1. 625.81 s [Cabal] 52 | deriving (Show, Generic, Typeable)
  2. 625.81 s [Cabal] | ^^^^^^^^
  3. 625.81 s [Cabal]
  4. 625.81 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
  5. 625.81 s [Cabal] src/Distribution/Simple/Setup/Haddock.hs:67:79: warning: [GHC-90584] [-Wderiving-typeable]
  6. 625.81 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  7. 625.81 s [Cabal] • In the data declaration for ‘HaddockTarget’
  8. 625.81 s [Cabal] |
  9. 625.81 s [Cabal] 67 | data HaddockTarget = ForHackage | ForDevelopment deriving (Eq, Show, Generic, Typeable)
  10. 625.81 s [Cabal] | ^^^^^^^^
  11. 625.81 s [Cabal]
  12. 625.81 s [Cabal] src/Distribution/Simple/Setup/Haddock.hs:110:28: warning: [GHC-90584] [-Wderiving-typeable]
  13. 625.81 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  14. 625.81 s [Cabal] • In the data declaration for ‘HaddockFlags’
  15. 625.81 s [Cabal] |
  16. 625.81 s [Cabal] 110 | deriving (Show, Generic, Typeable)
  17. 625.81 s [Cabal] | ^^^^^^^^
  18. 625.81 s [Cabal]
  19. 625.81 s [Cabal] src/Distribution/Simple/Setup/Haddock.hs:419:28: warning: [GHC-90584] [-Wderiving-typeable]
  20. 625.81 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  21. 625.81 s [Cabal] • In the data declaration for ‘HaddockProjectFlags’
  22. 625.81 s [Cabal] |
  23. 625.81 s [Cabal] 419 | deriving (Show, Generic, Typeable)
  24. 625.81 s [Cabal] | ^^^^^^^^
  25. 625.81 s [Cabal]
  26. 626.82 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
  27. 626.89 s [Cabal] src/Distribution/Simple/Setup/Global.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
  28. 626.89 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  29. 626.89 s [Cabal] • In the data declaration for ‘GlobalFlags’
  30. 626.89 s [Cabal] |
  31. 626.89 s [Cabal] 51 | deriving (Generic, Typeable)
  32. 626.89 s [Cabal] | ^^^^^^^^
  33. 626.89 s [Cabal]
  34. 626.89 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
  35. 626.89 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
  36. 626.89 s [Cabal] src/Distribution/Simple/Setup/Config.hs:230:34: warning: [GHC-90584] [-Wderiving-typeable]
  37. 626.89 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  38. 626.89 s [Cabal] • In the data declaration for ‘ConfigFlags’
  39. 626.89 s [Cabal] |
  40. 626.89 s [Cabal] 230 | deriving (Generic, Read, Show, Typeable)
  41. 626.89 s [Cabal] | ^^^^^^^^
  42. 626.89 s [Cabal]
  43. 631.00 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
  44. 633.74 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
  45. 633.78 s [Cabal] src/Distribution/Types/LocalBuildInfo.hs:137:34: warning: [GHC-90584] [-Wderiving-typeable]
  46. 633.78 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  47. 633.78 s [Cabal] • In the data declaration for ‘LocalBuildInfo’
  48. 633.78 s [Cabal] |
  49. 633.78 s [Cabal] 137 | deriving (Generic, Read, Show, Typeable)
  50. 633.78 s [Cabal] | ^^^^^^^^
  51. 633.78 s [Cabal]
  52. 634.83 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
  53. 635.38 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
  54. 636.59 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
  55. 636.59 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
  56. 636.59 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
  57. 636.59 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
  58. 636.59 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
  59. 637.16 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
  60. 638.43 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
  61. 638.43 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
  62. 638.43 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
  63. 638.43 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
  64. 638.43 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
  65. 638.43 s [Cabal] src/Distribution/Simple/Setup/Clean.hs:48:28: warning: [GHC-90584] [-Wderiving-typeable]
  66. 638.43 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  67. 638.43 s [Cabal] • In the data declaration for ‘CleanFlags’
  68. 638.43 s [Cabal] |
  69. 638.43 s [Cabal] 48 | deriving (Show, Generic, Typeable)
  70. 638.43 s [Cabal] | ^^^^^^^^
  71. 638.43 s [Cabal]
  72. 638.43 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
  73. 638.43 s [Cabal] src/Distribution/Simple/Setup/Build.hs:59:34: warning: [GHC-90584] [-Wderiving-typeable]
  74. 638.43 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  75. 638.43 s [Cabal] • In the data declaration for ‘BuildFlags’
  76. 638.43 s [Cabal] |
  77. 638.43 s [Cabal] 59 | deriving (Read, Show, Generic, Typeable)
  78. 638.43 s [Cabal] | ^^^^^^^^
  79. 638.43 s [Cabal]
  80. 638.43 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
  81. 638.43 s [Cabal] src/Distribution/Simple/Setup/Benchmark.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
  82. 638.43 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  83. 638.43 s [Cabal] • In the data declaration for ‘BenchmarkFlags’
  84. 638.43 s [Cabal] |
  85. 638.43 s [Cabal] 50 | deriving (Show, Generic, Typeable)
  86. 638.43 s [Cabal] | ^^^^^^^^
  87. 638.43 s [Cabal]
  88. 638.43 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
  89. 638.43 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
  90. 638.43 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
  91. 638.69 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
  92. 638.69 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
  93. 638.69 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
  94. 638.69 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
  95. 638.69 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
  96. 638.69 s [Cabal] src/Distribution/Simple/GHC/EnvironmentParser.hs:49:19: warning: [GHC-90584] [-Wderiving-typeable]
  97. 638.69 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  98. 638.69 s [Cabal] • In the newtype declaration for ‘ParseErrorExc’
  99. 638.69 s [Cabal] |
  100. 638.69 s [Cabal] 49 | deriving (Show, Typeable)
  101. 638.69 s [Cabal] | ^^^^^^^^
  102. 638.69 s [Cabal]
  103. 638.69 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
  104. 642.48 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 )
  105. 642.52 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 )
  106. 642.52 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 )
  107. 642.53 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 )
  108. 642.53 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
  109. 642.53 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
  110. 643.05 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
  111. 643.52 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
  112. 643.86 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o )
  113. 643.86 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.p_o )
  114. 643.86 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.p_o )
  115. 643.86 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.p_o )
  116. 643.86 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.p_o )
  117. 643.86 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
  118. 644.47 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
  119. 644.47 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
  120. 644.47 s [Cabal] src/Distribution/Compat/Time.hs:61:48: warning: [GHC-90584] [-Wderiving-typeable]
  121. 644.47 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  122. 644.47 s [Cabal] • In the newtype declaration for ‘ModTime’
  123. 644.47 s [Cabal] |
  124. 644.47 s [Cabal] 61 | deriving (Binary, Generic, Bounded, Eq, Ord, Typeable)
  125. 644.47 s [Cabal] | ^^^^^^^^
  126. 644.47 s [Cabal]
  127. 644.47 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
  128. 644.47 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
  129. 644.47 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
  130. 644.47 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
  131. 644.48 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
  132. 644.48 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
  133. 644.48 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
  134. 644.48 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
  135. 644.69 s [Cabal] src/Distribution/Simple/Configure.hs:188:13: warning: [GHC-90584] [-Wderiving-typeable]
  136. 644.69 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  137. 644.69 s [Cabal] • In the data declaration for ‘ConfigStateFileError’
  138. 644.69 s [Cabal] |
  139. 644.69 s [Cabal] 188 | deriving (Typeable)
  140. 644.69 s [Cabal] | ^^^^^^^^
  141. 644.69 s [Cabal]
  142. 649.56 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
  143. 649.99 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
  144. 650.38 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
  145. 650.80 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
  146. 653.11 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
  147. 657.90 s [Cabal] buildPhase completed in 2 minutes 6 seconds
  148. 657.94 s [Cabal] Phase: haddockPhase
  149. 659.67 s [Cabal] Preprocessing library for Cabal-3.12.1.0...
  150. 659.72 s [Cabal] Running Haddock on library for Cabal-3.12.1.0...
  151. 661.35 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, nothing ) [HIE file is missing]
  152. 662.04 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, nothing ) [HIE file is missing]
  153. 662.09 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, nothing ) [HIE file is missing]
  154. 662.23 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, nothing ) [HIE file is missing]
  155. 662.55 s [Cabal] src/Distribution/Backpack/ModuleShape.hs:34:32: warning: [GHC-90584] [-Wderiving-typeable]
  156. 662.55 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  157. 662.55 s [Cabal] • In the data declaration for ‘ModuleShape’
  158. 662.55 s [Cabal] |
  159. 662.55 s [Cabal] 34 | deriving (Eq, Show, Generic, Typeable)
  160. 662.55 s [Cabal] | ^^^^^^^^
  161. 662.55 s [Cabal]
  162. 662.55 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, nothing ) [HIE file is missing]
  163. 662.61 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, nothing ) [HIE file is missing]
  164. 662.75 s [Cabal] src/Distribution/Compat/Async.hs:148:7: warning: [GHC-90584] [-Wderiving-typeable]
  165. 662.75 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  166. 662.75 s [Cabal] • In the data declaration for ‘AsyncCancelled’
  167. 662.75 s [Cabal] |
  168. 662.75 s [Cabal] 148 | , Typeable
  169. 662.75 s [Cabal] | ^^^^^^^^
  170. 662.75 s [Cabal]
  171. 662.75 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, nothing ) [HIE file is missing]
  172. 662.76 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, nothing ) [HIE file is missing]
  173. 662.77 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, nothing ) [HIE file is missing]
  174. 662.78 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, nothing ) [HIE file is missing]
  175. 662.80 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, nothing ) [HIE file is missing]
  176. 662.95 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, nothing ) [HIE file is missing]
  177. 663.08 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, nothing ) [HIE file is missing]
  178. 663.20 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, nothing ) [HIE file is missing]
  179. 663.48 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, nothing ) [HIE file is missing]
  180. 663.51 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, nothing ) [HIE file is missing]
  181. 663.53 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, nothing ) [HIE file is missing]
  182. 663.56 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, nothing ) [HIE file is missing]
  183. 663.58 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, nothing ) [HIE file is missing]
  184. 663.76 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, nothing ) [HIE file is missing]
  185. 663.78 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, nothing ) [HIE file is missing]
  186. 664.65 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, nothing ) [HIE file is missing]
  187. 664.69 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, nothing ) [HIE file is missing]
  188. 664.75 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, nothing ) [HIE file is missing]
  189. 664.78 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, nothing ) [HIE file is missing]
  190. 664.88 s [Cabal] src/Distribution/Simple/Flag.hs:65:66: warning: [GHC-90584] [-Wderiving-typeable]
  191. 664.88 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  192. 664.88 s [Cabal] • In the data declaration for ‘Flag’
  193. 664.88 s [Cabal] |
  194. 664.88 s [Cabal] 65 | data Flag a = Flag a | NoFlag deriving (Eq, Generic, Show, Read, Typeable, Foldable, Traversable)
  195. 664.88 s [Cabal] | ^^^^^^^^
  196. 664.88 s [Cabal]
  197. 664.89 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, nothing ) [HIE file is missing]
  198. 665.08 s [Cabal] src/Distribution/Simple/InstallDirs/Internal.hs:15:31: warning: [GHC-90584] [-Wderiving-typeable]
  199. 665.08 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  200. 665.08 s [Cabal] • In the data declaration for ‘PathComponent’
  201. 665.08 s [Cabal] |
  202. 665.08 s [Cabal] 15 | deriving (Eq, Ord, Generic, Typeable)
  203. 665.08 s [Cabal] | ^^^^^^^^
  204. 665.08 s [Cabal]
  205. 665.08 s [Cabal] src/Distribution/Simple/InstallDirs/Internal.hs:68:31: warning: [GHC-90584] [-Wderiving-typeable]
  206. 665.08 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  207. 665.08 s [Cabal] • In the data declaration for ‘PathTemplateVariable’
  208. 665.08 s [Cabal] |
  209. 665.08 s [Cabal] 68 | deriving (Eq, Ord, Generic, Typeable)
  210. 665.08 s [Cabal] | ^^^^^^^^
  211. 665.08 s [Cabal]
  212. 665.09 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, nothing ) [HIE file is missing]
  213. 665.51 s [Cabal] src/Distribution/Simple/InstallDirs.hs:104:47: warning: [GHC-90584] [-Wderiving-typeable]
  214. 665.51 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  215. 665.51 s [Cabal] • In the data declaration for ‘InstallDirs’
  216. 665.51 s [Cabal] |
  217. 665.51 s [Cabal] 104 | deriving (Eq, Read, Show, Functor, Generic, Typeable)
  218. 665.51 s [Cabal] | ^^^^^^^^
  219. 665.51 s [Cabal]
  220. 665.52 s [Cabal] src/Distribution/Simple/InstallDirs.hs:390:31: warning: [GHC-90584] [-Wderiving-typeable]
  221. 665.52 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  222. 665.52 s [Cabal] • In the newtype declaration for ‘PathTemplate’
  223. 665.52 s [Cabal] |
  224. 665.52 s [Cabal] 390 | deriving (Eq, Ord, Generic, Typeable)
  225. 665.52 s [Cabal] | ^^^^^^^^
  226. 665.52 s [Cabal]
  227. 665.52 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, nothing ) [HIE file is missing]
  228. 665.55 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, nothing ) [HIE file is missing]
  229. 665.64 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, nothing ) [HIE file is missing]
  230. 665.67 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, nothing ) [HIE file is missing]
  231. 665.69 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, nothing ) [HIE file is missing]
  232. 665.71 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, nothing ) [HIE file is missing]
  233. 665.90 s [Cabal] src/Distribution/Types/ComponentLocalBuildInfo.hs:111:34: warning: [GHC-90584] [-Wderiving-typeable]
  234. 665.90 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  235. 665.90 s [Cabal] • In the data declaration for ‘ComponentLocalBuildInfo’
  236. 665.90 s [Cabal] |
  237. 665.90 s [Cabal] 111 | deriving (Generic, Read, Show, Typeable)
  238. 665.90 s [Cabal] | ^^^^^^^^
  239. 665.90 s [Cabal]
  240. 665.91 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, nothing ) [HIE file is missing]
  241. 665.96 s [Cabal] src/Distribution/Types/DumpBuildInfo.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
  242. 665.96 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  243. 665.96 s [Cabal] • In the data declaration for ‘DumpBuildInfo’
  244. 665.96 s [Cabal] |
  245. 665.96 s [Cabal] 13 | deriving (Read, Show, Eq, Ord, Enum, Bounded, Generic, Typeable)
  246. 665.96 s [Cabal] | ^^^^^^^^
  247. 665.96 s [Cabal]
  248. 665.97 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, nothing ) [HIE file is missing]
  249. 666.00 s [Cabal] src/Distribution/Types/GivenComponent.hs:26:38: warning: [GHC-90584] [-Wderiving-typeable]
  250. 666.00 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  251. 666.00 s [Cabal] • In the data declaration for ‘GivenComponent’
  252. 666.00 s [Cabal] |
  253. 666.00 s [Cabal] 26 | deriving (Generic, Read, Show, Eq, Typeable)
  254. 666.00 s [Cabal] | ^^^^^^^^
  255. 666.00 s [Cabal]
  256. 666.01 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, nothing ) [HIE file is missing]
  257. 666.01 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, nothing ) [HIE file is missing]
  258. 666.03 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, nothing ) [HIE file is missing]
  259. 666.08 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, nothing ) [HIE file is missing]
  260. 666.10 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, nothing ) [HIE file is missing]
  261. 666.13 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, nothing ) [HIE file is missing]
  262. 666.14 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, nothing ) [HIE file is missing]
  263. 666.16 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, nothing ) [HIE file is missing]
  264. 666.20 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, nothing ) [HIE file is missing]
  265. 666.44 s [Cabal] src/Distribution/Verbosity/Internal.hs:13:58: warning: [GHC-90584] [-Wderiving-typeable]
  266. 666.44 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  267. 666.44 s [Cabal] • In the data declaration for ‘VerbosityLevel’
  268. 666.44 s [Cabal] |
  269. 666.44 s [Cabal] 13 | deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
  270. 666.44 s [Cabal] | ^^^^^^^^
  271. 666.44 s [Cabal]
  272. 666.44 s [Cabal] src/Distribution/Verbosity/Internal.hs:27:58: warning: [GHC-90584] [-Wderiving-typeable]
  273. 666.44 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  274. 666.44 s [Cabal] • In the data declaration for ‘VerbosityFlag’
  275. 666.44 s [Cabal] |
  276. 666.44 s [Cabal] 27 | deriving (Generic, Show, Read, Eq, Ord, Enum, Bounded, Typeable)
  277. 666.44 s [Cabal] | ^^^^^^^^
  278. 666.44 s [Cabal]
  279. 666.45 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, nothing ) [HIE file is missing]
  280. 666.55 s [Cabal] src/Distribution/Verbosity.hs:95:34: warning: [GHC-90584] [-Wderiving-typeable]
  281. 666.55 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  282. 666.55 s [Cabal] • In the data declaration for ‘Verbosity’
  283. 666.55 s [Cabal] |
  284. 666.55 s [Cabal] 95 | deriving (Generic, Show, Read, Typeable)
  285. 666.55 s [Cabal] | ^^^^^^^^
  286. 666.55 s [Cabal]
  287. 666.55 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, nothing ) [HIE file is missing]
  288. 666.66 s [Cabal] src/Distribution/Simple/Program/Types.hs:110:26: warning: [GHC-90584] [-Wderiving-typeable]
  289. 666.66 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  290. 666.66 s [Cabal] • In the data declaration for ‘ProgramSearchPathEntry’
  291. 666.66 s [Cabal] |
  292. 666.66 s [Cabal] 110 | deriving (Eq, Generic, Typeable)
  293. 666.66 s [Cabal] | ^^^^^^^^
  294. 666.66 s [Cabal]
  295. 666.66 s [Cabal] src/Distribution/Simple/Program/Types.hs:150:38: warning: [GHC-90584] [-Wderiving-typeable]
  296. 666.66 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  297. 666.66 s [Cabal] • In the data declaration for ‘ConfiguredProgram’
  298. 666.66 s [Cabal] |
  299. 666.66 s [Cabal] 150 | deriving (Eq, Generic, Read, Show, Typeable)
  300. 666.66 s [Cabal] | ^^^^^^^^
  301. 666.66 s [Cabal]
  302. 666.66 s [Cabal] src/Distribution/Simple/Program/Types.hs:163:38: warning: [GHC-90584] [-Wderiving-typeable]
  303. 666.66 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  304. 666.66 s [Cabal] • In the data declaration for ‘ProgramLocation’
  305. 666.66 s [Cabal] |
  306. 666.66 s [Cabal] 163 | deriving (Eq, Generic, Read, Show, Typeable)
  307. 666.66 s [Cabal] | ^^^^^^^^
  308. 666.66 s [Cabal]
  309. 666.66 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, nothing ) [HIE file is missing]
  310. 666.68 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, nothing ) [HIE file is missing]
  311. 666.87 s [Cabal] src/Distribution/Simple/Errors.hs:176:19: warning: [GHC-90584] [-Wderiving-typeable]
  312. 666.87 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  313. 666.87 s [Cabal] • In the data declaration for ‘CabalException’
  314. 666.87 s [Cabal] |
  315. 666.87 s [Cabal] 176 | deriving (Show, Typeable)
  316. 666.87 s [Cabal] | ^^^^^^^^
  317. 666.87 s [Cabal]
  318. 666.87 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, nothing ) [HIE file is missing]
  319. 666.91 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, nothing ) [HIE file is missing]
  320. 667.09 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, nothing ) [HIE file is missing]
  321. 667.14 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, nothing ) [HIE file is missing]
  322. 667.15 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, nothing ) [HIE file is missing]
  323. 667.33 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, nothing ) [HIE file is missing]
  324. 667.34 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, nothing ) [HIE file is missing]
  325. 667.37 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, nothing ) [HIE file is missing]
  326. 667.38 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, nothing ) [HIE file is missing]
  327. 668.05 s [Cabal] src/Distribution/Simple/Utils.hs:385:19: warning: [GHC-90584] [-Wderiving-typeable]
  328. 668.05 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  329. 668.05 s [Cabal] • In the data declaration for ‘VerboseException’
  330. 668.05 s [Cabal] |
  331. 668.05 s [Cabal] 385 | deriving (Show, Typeable)
  332. 668.05 s [Cabal] | ^^^^^^^^
  333. 668.05 s [Cabal]
  334. 668.06 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, nothing ) [HIE file is missing]
  335. 668.09 s [Cabal] src/Distribution/Utils/NubList.hs:25:26: warning: [GHC-90584] [-Wderiving-typeable]
  336. 668.17 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  337. 668.17 s [Cabal] • In the newtype declaration for ‘NubList’
  338. 668.17 s [Cabal] |
  339. 668.17 s [Cabal] 25 | deriving (Eq, Generic, Typeable)
  340. 668.17 s [Cabal] | ^^^^^^^^
  341. 668.17 s [Cabal]
  342. 668.17 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, nothing ) [HIE file is missing]
  343. 668.17 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, nothing ) [HIE file is missing]
  344. 668.17 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, nothing ) [HIE file is missing]
  345. 668.18 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, nothing ) [HIE file is missing]
  346. 668.20 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, nothing ) [HIE file is missing]
  347. 668.21 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, nothing ) [HIE file is missing]
  348. 668.25 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, nothing ) [HIE file is missing]
  349. 668.60 s [Cabal] src/Distribution/Simple/PackageIndex.hs:145:38: warning: [GHC-90584] [-Wderiving-typeable]
  350. 668.60 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  351. 668.60 s [Cabal] • In the data declaration for ‘PackageIndex’
  352. 668.60 s [Cabal] |
  353. 668.60 s [Cabal] 145 | deriving (Eq, Generic, Show, Read, Typeable)
  354. 668.60 s [Cabal] | ^^^^^^^^
  355. 668.60 s [Cabal]
  356. 668.61 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, nothing ) [HIE file is missing]
  357. 668.66 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, nothing ) [HIE file is missing]
  358. 668.79 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, nothing ) [HIE file is missing]
  359. 668.81 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, nothing ) [HIE file is missing]
  360. 668.89 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, nothing ) [HIE file is missing]
  361. 668.95 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, nothing ) [HIE file is missing]
  362. 668.97 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, nothing ) [HIE file is missing]
  363. 669.10 s [Cabal] src/Distribution/Simple/Compiler.hs:107:26: warning: [GHC-90584] [-Wderiving-typeable]
  364. 669.10 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  365. 669.10 s [Cabal] • In the data declaration for ‘Compiler’
  366. 669.10 s [Cabal] |
  367. 669.10 s [Cabal] 107 | deriving (Eq, Generic, Typeable, Show, Read)
  368. 669.10 s [Cabal] | ^^^^^^^^
  369. 669.10 s [Cabal]
  370. 669.10 s [Cabal] src/Distribution/Simple/Compiler.hs:179:43: warning: [GHC-90584] [-Wderiving-typeable]
  371. 669.10 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  372. 669.10 s [Cabal] • In the data declaration for ‘PackageDB’
  373. 669.10 s [Cabal] |
  374. 669.10 s [Cabal] 179 | deriving (Eq, Generic, Ord, Show, Read, Typeable)
  375. 669.10 s [Cabal] | ^^^^^^^^
  376. 669.10 s [Cabal]
  377. 669.10 s [Cabal] src/Distribution/Simple/Compiler.hs:231:53: warning: [GHC-90584] [-Wderiving-typeable]
  378. 669.10 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  379. 669.10 s [Cabal] • In the data declaration for ‘OptimisationLevel’
  380. 669.10 s [Cabal] |
  381. 669.10 s [Cabal] 231 | deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
  382. 669.10 s [Cabal] | ^^^^^^^^
  383. 669.10 s [Cabal]
  384. 669.10 s [Cabal] src/Distribution/Simple/Compiler.hs:264:53: warning: [GHC-90584] [-Wderiving-typeable]
  385. 669.10 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  386. 669.10 s [Cabal] • In the data declaration for ‘DebugInfoLevel’
  387. 669.10 s [Cabal] |
  388. 669.10 s [Cabal] 264 | deriving (Bounded, Enum, Eq, Generic, Read, Show, Typeable)
  389. 669.10 s [Cabal] | ^^^^^^^^
  390. 669.10 s [Cabal]
  391. 669.11 s [Cabal] src/Distribution/Simple/Compiler.hs:458:38: warning: [GHC-90584] [-Wderiving-typeable]
  392. 669.11 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  393. 669.11 s [Cabal] • In the data declaration for ‘ProfDetailLevel’
  394. 669.11 s [Cabal] |
  395. 669.11 s [Cabal] 458 | deriving (Eq, Generic, Read, Show, Typeable)
  396. 669.11 s [Cabal] | ^^^^^^^^
  397. 669.11 s [Cabal]
  398. 669.11 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, nothing ) [HIE file is missing]
  399. 669.18 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, nothing ) [HIE file is missing]
  400. 669.19 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, nothing ) [HIE file is missing]
  401. 669.49 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, nothing ) [HIE file is missing]
  402. 669.52 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, nothing ) [HIE file is missing]
  403. 669.57 s [Cabal] src/Distribution/Simple/Program/Db.hs:100:13: warning: [GHC-90584] [-Wderiving-typeable]
  404. 669.57 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  405. 669.57 s [Cabal] • In the data declaration for ‘ProgramDb’
  406. 669.57 s [Cabal] |
  407. 669.57 s [Cabal] 100 | deriving (Typeable)
  408. 669.57 s [Cabal] | ^^^^^^^^
  409. 669.57 s [Cabal]
  410. 669.58 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, nothing ) [HIE file is missing]
  411. 669.59 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, nothing ) [HIE file is missing]
  412. 669.60 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, nothing ) [HIE file is missing]
  413. 669.80 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, nothing ) [HIE file is missing]
  414. 669.92 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, nothing ) [HIE file is missing]
  415. 670.05 s [Cabal] src/Distribution/Simple/Setup/Test.hs:52:52: warning: [GHC-90584] [-Wderiving-typeable]
  416. 670.05 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  417. 670.05 s [Cabal] • In the data declaration for ‘TestShowDetails’
  418. 670.05 s [Cabal] |
  419. 670.05 s [Cabal] 52 | deriving (Eq, Ord, Enum, Bounded, Generic, Show, Typeable)
  420. 670.05 s [Cabal] | ^^^^^^^^
  421. 670.05 s [Cabal]
  422. 670.05 s [Cabal] src/Distribution/Simple/Setup/Test.hs:94:28: warning: [GHC-90584] [-Wderiving-typeable]
  423. 670.05 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  424. 670.05 s [Cabal] • In the data declaration for ‘TestFlags’
  425. 670.05 s [Cabal] |
  426. 670.05 s [Cabal] 94 | deriving (Show, Generic, Typeable)
  427. 670.05 s [Cabal] | ^^^^^^^^
  428. 670.05 s [Cabal]
  429. 670.06 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, nothing ) [HIE file is missing]
  430. 670.08 s [Cabal] src/Distribution/Simple/Setup/SDist.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
  431. 670.08 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  432. 670.08 s [Cabal] • In the data declaration for ‘SDistFlags’
  433. 670.08 s [Cabal] |
  434. 670.08 s [Cabal] 50 | deriving (Show, Generic, Typeable)
  435. 670.08 s [Cabal] | ^^^^^^^^
  436. 670.08 s [Cabal]
  437. 670.09 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, nothing ) [HIE file is missing]
  438. 670.30 s [Cabal] src/Distribution/Simple/Setup/Repl.hs:51:28: warning: [GHC-90584] [-Wderiving-typeable]
  439. 670.30 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  440. 670.30 s [Cabal] • In the data declaration for ‘ReplOptions’
  441. 670.30 s [Cabal] |
  442. 670.30 s [Cabal] 51 | deriving (Show, Generic, Typeable)
  443. 670.30 s [Cabal] | ^^^^^^^^
  444. 670.30 s [Cabal]
  445. 670.30 s [Cabal] src/Distribution/Simple/Setup/Repl.hs:71:28: warning: [GHC-90584] [-Wderiving-typeable]
  446. 670.30 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  447. 670.30 s [Cabal] • In the data declaration for ‘ReplFlags’
  448. 670.30 s [Cabal] |
  449. 670.30 s [Cabal] 71 | deriving (Show, Generic, Typeable)
  450. 670.30 s [Cabal] | ^^^^^^^^
  451. 670.30 s [Cabal]
  452. 670.31 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, nothing ) [HIE file is missing]
  453. 670.34 s [Cabal] src/Distribution/Simple/Setup/Register.hs:58:28: warning: [GHC-90584] [-Wderiving-typeable]
  454. 670.34 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  455. 670.34 s [Cabal] • In the data declaration for ‘RegisterFlags’
  456. 670.34 s [Cabal] |
  457. 670.34 s [Cabal] 58 | deriving (Show, Generic, Typeable)
  458. 670.34 s [Cabal] | ^^^^^^^^
  459. 670.34 s [Cabal]
  460. 670.35 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, nothing ) [HIE file is missing]
  461. 670.41 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, nothing ) [HIE file is missing]
  462. 670.45 s [Cabal] src/Distribution/Simple/Setup/Hscolour.hs:52:28: warning: [GHC-90584] [-Wderiving-typeable]
  463. 670.45 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  464. 670.45 s [Cabal] • In the data declaration for ‘HscolourFlags’
  465. 670.45 s [Cabal] |
  466. 670.45 s [Cabal] 52 | deriving (Show, Generic, Typeable)
  467. 670.45 s [Cabal] | ^^^^^^^^
  468. 670.45 s [Cabal]
  469. 670.45 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, nothing ) [HIE file is missing]
  470. 670.66 s [Cabal] src/Distribution/Simple/Setup/Haddock.hs:67:79: warning: [GHC-90584] [-Wderiving-typeable]
  471. 670.66 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  472. 670.66 s [Cabal] • In the data declaration for ‘HaddockTarget’
  473. 670.66 s [Cabal] |
  474. 670.66 s [Cabal] 67 | data HaddockTarget = ForHackage | ForDevelopment deriving (Eq, Show, Generic, Typeable)
  475. 670.66 s [Cabal] | ^^^^^^^^
  476. 670.66 s [Cabal]
  477. 670.66 s [Cabal] src/Distribution/Simple/Setup/Haddock.hs:110:28: warning: [GHC-90584] [-Wderiving-typeable]
  478. 670.66 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  479. 670.66 s [Cabal] • In the data declaration for ‘HaddockFlags’
  480. 670.66 s [Cabal] |
  481. 670.66 s [Cabal] 110 | deriving (Show, Generic, Typeable)
  482. 670.66 s [Cabal] | ^^^^^^^^
  483. 670.66 s [Cabal]
  484. 670.67 s [Cabal] src/Distribution/Simple/Setup/Haddock.hs:419:28: warning: [GHC-90584] [-Wderiving-typeable]
  485. 670.67 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  486. 670.67 s [Cabal] • In the data declaration for ‘HaddockProjectFlags’
  487. 670.67 s [Cabal] |
  488. 670.67 s [Cabal] 419 | deriving (Show, Generic, Typeable)
  489. 670.67 s [Cabal] | ^^^^^^^^
  490. 670.67 s [Cabal]
  491. 670.67 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, nothing ) [HIE file is missing]
  492. 670.70 s [Cabal] src/Distribution/Simple/Setup/Global.hs:51:22: warning: [GHC-90584] [-Wderiving-typeable]
  493. 670.70 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  494. 670.70 s [Cabal] • In the data declaration for ‘GlobalFlags’
  495. 670.70 s [Cabal] |
  496. 670.70 s [Cabal] 51 | deriving (Generic, Typeable)
  497. 670.70 s [Cabal] | ^^^^^^^^
  498. 670.70 s [Cabal]
  499. 670.70 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, nothing ) [HIE file is missing]
  500. 670.75 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, nothing ) [HIE file is missing]
  501. 671.27 s [Cabal] src/Distribution/Simple/Setup/Config.hs:230:34: warning: [GHC-90584] [-Wderiving-typeable]
  502. 671.27 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  503. 671.27 s [Cabal] • In the data declaration for ‘ConfigFlags’
  504. 671.27 s [Cabal] |
  505. 671.27 s [Cabal] 230 | deriving (Generic, Read, Show, Typeable)
  506. 671.27 s [Cabal] | ^^^^^^^^
  507. 671.27 s [Cabal]
  508. 671.28 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, nothing ) [HIE file is missing]
  509. 671.45 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, nothing ) [HIE file is missing]
  510. 671.51 s [Cabal] src/Distribution/Types/LocalBuildInfo.hs:137:34: warning: [GHC-90584] [-Wderiving-typeable]
  511. 671.51 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  512. 671.51 s [Cabal] • In the data declaration for ‘LocalBuildInfo’
  513. 671.51 s [Cabal] |
  514. 671.51 s [Cabal] 137 | deriving (Generic, Read, Show, Typeable)
  515. 671.51 s [Cabal] | ^^^^^^^^
  516. 671.51 s [Cabal]
  517. 671.52 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, nothing ) [HIE file is missing]
  518. 671.56 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, nothing ) [HIE file is missing]
  519. 671.64 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, nothing ) [HIE file is missing]
  520. 671.71 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, nothing ) [HIE file is missing]
  521. 671.72 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, nothing ) [HIE file is missing]
  522. 671.75 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, nothing ) [HIE file is missing]
  523. 671.79 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, nothing ) [HIE file is missing]
  524. 671.87 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, nothing ) [HIE file is missing]
  525. 672.03 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, nothing ) [HIE file is missing]
  526. 672.05 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, nothing ) [HIE file is missing]
  527. 672.07 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, nothing ) [HIE file is missing]
  528. 672.14 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, nothing ) [HIE file is missing]
  529. 672.19 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, nothing ) [HIE file is missing]
  530. 672.22 s [Cabal] src/Distribution/Simple/Setup/Clean.hs:48:28: warning: [GHC-90584] [-Wderiving-typeable]
  531. 672.22 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  532. 672.22 s [Cabal] • In the data declaration for ‘CleanFlags’
  533. 672.22 s [Cabal] |
  534. 672.22 s [Cabal] 48 | deriving (Show, Generic, Typeable)
  535. 672.22 s [Cabal] | ^^^^^^^^
  536. 672.22 s [Cabal]
  537. 672.22 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, nothing ) [HIE file is missing]
  538. 672.28 s [Cabal] src/Distribution/Simple/Setup/Build.hs:59:34: warning: [GHC-90584] [-Wderiving-typeable]
  539. 672.28 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  540. 672.28 s [Cabal] • In the data declaration for ‘BuildFlags’
  541. 672.28 s [Cabal] |
  542. 672.28 s [Cabal] 59 | deriving (Read, Show, Generic, Typeable)
  543. 672.28 s [Cabal] | ^^^^^^^^
  544. 672.28 s [Cabal]
  545. 672.28 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, nothing ) [HIE file is missing]
  546. 672.31 s [Cabal] src/Distribution/Simple/Setup/Benchmark.hs:50:28: warning: [GHC-90584] [-Wderiving-typeable]
  547. 672.31 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  548. 672.31 s [Cabal] • In the data declaration for ‘BenchmarkFlags’
  549. 672.32 s [Cabal] |
  550. 672.32 s [Cabal] 50 | deriving (Show, Generic, Typeable)
  551. 672.32 s [Cabal] | ^^^^^^^^
  552. 672.32 s [Cabal]
  553. 672.32 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, nothing ) [HIE file is missing]
  554. 672.34 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, nothing ) [HIE file is missing]
  555. 672.35 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, nothing ) [HIE file is missing]
  556. 672.76 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, nothing ) [HIE file is missing]
  557. 672.79 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, nothing ) [HIE file is missing]
  558. 672.84 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, nothing ) [HIE file is missing]
  559. 672.89 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, nothing ) [HIE file is missing]
  560. 673.10 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, nothing ) [HIE file is missing]
  561. 673.18 s [Cabal] src/Distribution/Simple/GHC/EnvironmentParser.hs:49:19: warning: [GHC-90584] [-Wderiving-typeable]
  562. 673.18 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  563. 673.18 s [Cabal] • In the newtype declaration for ‘ParseErrorExc’
  564. 673.18 s [Cabal] |
  565. 673.18 s [Cabal] 49 | deriving (Show, Typeable)
  566. 673.18 s [Cabal] | ^^^^^^^^
  567. 673.18 s [Cabal]
  568. 673.18 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, nothing ) [HIE file is missing]
  569. 673.56 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, nothing ) [HIE file is missing]
  570. 673.58 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, nothing ) [HIE file is missing]
  571. 673.64 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, nothing ) [HIE file is missing]
  572. 673.68 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, nothing ) [HIE file is missing]
  573. 673.81 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, nothing ) [HIE file is missing]
  574. 673.83 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, nothing ) [HIE file is missing]
  575. 674.10 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, nothing ) [HIE file is missing]
  576. 674.13 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, nothing ) [HIE file is missing]
  577. 674.16 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, nothing ) [HIE file is missing]
  578. 674.18 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, nothing ) [HIE file is missing]
  579. 674.22 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, nothing ) [HIE file is missing]
  580. 674.25 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, nothing ) [HIE file is missing]
  581. 674.28 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, nothing ) [HIE file is missing]
  582. 674.42 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, nothing ) [HIE file is missing]
  583. 674.67 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, nothing ) [HIE file is missing]
  584. 674.69 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, nothing ) [HIE file is missing]
  585. 674.71 s [Cabal] src/Distribution/Compat/Time.hs:61:48: warning: [GHC-90584] [-Wderiving-typeable]
  586. 674.71 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  587. 674.71 s [Cabal] • In the newtype declaration for ‘ModTime’
  588. 674.72 s [Cabal] |
  589. 674.72 s [Cabal] 61 | deriving (Binary, Generic, Bounded, Eq, Ord, Typeable)
  590. 674.72 s [Cabal] | ^^^^^^^^
  591. 674.72 s [Cabal]
  592. 674.72 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, nothing ) [HIE file is missing]
  593. 674.77 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, nothing ) [HIE file is missing]
  594. 674.82 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, nothing ) [HIE file is missing]
  595. 674.83 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, nothing ) [HIE file is missing]
  596. 674.91 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, nothing ) [HIE file is missing]
  597. 675.02 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, nothing ) [HIE file is missing]
  598. 675.04 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, nothing ) [HIE file is missing]
  599. 675.11 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, nothing ) [HIE file is missing]
  600. 676.43 s [Cabal] src/Distribution/Simple/Configure.hs:188:13: warning: [GHC-90584] [-Wderiving-typeable]
  601. 676.43 s [Cabal] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  602. 676.43 s [Cabal] • In the data declaration for ‘ConfigStateFileError’
  603. 676.43 s [Cabal] |
  604. 676.43 s [Cabal] 188 | deriving (Typeable)
  605. 676.43 s [Cabal] | ^^^^^^^^
  606. 676.43 s [Cabal]
  607. 676.44 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, nothing ) [HIE file is missing]
  608. 676.50 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, nothing ) [HIE file is missing]
  609. 676.75 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, nothing ) [HIE file is missing]
  610. 677.14 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, nothing ) [HIE file is missing]
  611. 677.88 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, nothing ) [HIE file is missing]
  612. 678.13 s [Cabal] Haddock coverage:
  613. 678.22 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.FullUnitId'
  614. 678.22 s [Cabal] Missing documentation for:
  615. 678.22 s [Cabal] Module header
  616. 678.22 s [Cabal] FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
  617. 678.23 s [Cabal] FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
  618. 678.23 s [Cabal] expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:21)
  619. 678.23 s [Cabal] expandUnitId (src/Distribution/Backpack/FullUnitId.hs:27)
  620. 678.23 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  621. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  622. 678.23 s [Cabal] 100% ( 2 / 2) in 'Distribution.Backpack.ModSubst'
  623. 678.23 s [Cabal] Warning: 'ModuleScope' is ambiguous. It is defined
  624. 678.23 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:20
  625. 678.23 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:1
  626. 678.23 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  627. 678.23 s [Cabal] by specifying the type/value namespace explicitly.
  628. 678.23 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
  629. 678.23 s [Cabal] Warning: 'Module' is out of scope.
  630. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  631. 678.23 s [Cabal] Warning: 'ModuleShape' is out of scope.
  632. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  633. 678.23 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  634. 678.23 s [Cabal] * in ‘Distribution.Backpack’
  635. 678.23 s [Cabal] * in ‘Distribution.Backpack’
  636. 678.23 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  637. 678.23 s [Cabal] by specifying the type/value namespace explicitly.
  638. 678.23 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  639. 678.23 s [Cabal] Warning: 'ModuleShape' is ambiguous. It is defined
  640. 678.23 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:20
  641. 678.23 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:1
  642. 678.23 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  643. 678.23 s [Cabal] by specifying the type/value namespace explicitly.
  644. 678.23 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
  645. 678.23 s [Cabal] Warning: 'InstalledPackageInfo' is ambiguous. It is defined
  646. 678.23 s [Cabal] * in ‘Distribution.Types.InstalledPackageInfo’
  647. 678.23 s [Cabal] * in ‘Distribution.Types.InstalledPackageInfo’
  648. 678.23 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  649. 678.23 s [Cabal] by specifying the type/value namespace explicitly.
  650. 678.23 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
  651. 678.23 s [Cabal] 80% ( 4 / 5) in 'Distribution.Backpack.ModuleShape'
  652. 678.23 s [Cabal] Missing documentation for:
  653. 678.23 s [Cabal] shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:77)
  654. 678.23 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.PreModuleShape'
  655. 678.23 s [Cabal] Missing documentation for:
  656. 678.23 s [Cabal] Module header
  657. 678.23 s [Cabal] PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
  658. 678.23 s [Cabal] toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:29)
  659. 678.23 s [Cabal] renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:32)
  660. 678.23 s [Cabal] mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:41)
  661. 678.23 s [Cabal] Warning: 'async' is out of scope.
  662. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  663. 678.23 s [Cabal] 50% ( 1 / 2) in 'Distribution.Compat.CreatePipe'
  664. 678.23 s [Cabal] Missing documentation for:
  665. 678.23 s [Cabal] Module header
  666. 678.23 s [Cabal] 75% ( 3 / 4) in 'Distribution.Compat.Directory'
  667. 678.23 s [Cabal] Missing documentation for:
  668. 678.23 s [Cabal] Module header
  669. 678.23 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.FilePath'
  670. 678.23 s [Cabal] Missing documentation for:
  671. 678.23 s [Cabal] Module header
  672. 678.23 s [Cabal] Warning: 'GetShortPathName' is out of scope.
  673. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  674. 678.23 s [Cabal] 100% ( 2 / 2) in 'Distribution.Compat.Prelude.Internal'
  675. 678.23 s [Cabal] Warning: 'delegate_ctlc' is out of scope.
  676. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  677. 678.23 s [Cabal] 80% ( 4 / 5) in 'Distribution.Compat.Process'
  678. 678.23 s [Cabal] Missing documentation for:
  679. 678.23 s [Cabal] Module header
  680. 678.23 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.ResponseFile'
  681. 678.23 s [Cabal] Missing documentation for:
  682. 678.23 s [Cabal] Module header
  683. 678.23 s [Cabal] Warning: 'Verbosity' is out of scope.
  684. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  685. 678.23 s [Cabal] 66% ( 6 / 9) in 'Distribution.Compat.Stack'
  686. 678.23 s [Cabal] Missing documentation for:
  687. 678.23 s [Cabal] Module header
  688. 678.23 s [Cabal] WithCallStack (src/Distribution/Compat/Stack.hs:31)
  689. 678.23 s [Cabal] withLexicalCallStack (src/Distribution/Compat/Stack.hs:74)
  690. 678.23 s [Cabal] Warning: 'ReturnInOrder' is out of scope.
  691. 678.23 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  692. 678.24 s [Cabal] Warning: 'PackageCheck' is out of scope.
  693. 678.24 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  694. 678.24 s [Cabal] 50% ( 5 / 10) in 'Distribution.ReadE'
  695. 678.24 s [Cabal] Missing documentation for:
  696. 678.24 s [Cabal] succeedReadE (src/Distribution/ReadE.hs:47)
  697. 678.24 s [Cabal] failReadE (src/Distribution/ReadE.hs:50)
  698. 678.24 s [Cabal] parsecToReadE (src/Distribution/ReadE.hs:57)
  699. 678.24 s [Cabal] parsecToReadEErr (src/Distribution/ReadE.hs:61)
  700. 678.24 s [Cabal] unexpectMsgString (src/Distribution/ReadE.hs:67)
  701. 678.24 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  702. 678.24 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  703. 678.24 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  704. 678.24 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  705. 678.24 s [Cabal] by specifying the type/value namespace explicitly.
  706. 678.24 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  707. 678.24 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  708. 678.24 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  709. 678.24 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  710. 678.24 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  711. 678.24 s [Cabal] by specifying the type/value namespace explicitly.
  712. 678.24 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  713. 678.24 s [Cabal] 100% ( 6 / 6) in 'Distribution.Simple.BuildToolDepends'
  714. 678.25 s [Cabal] Warning: 'a' is out of scope.
  715. 678.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  716. 678.25 s [Cabal] Warning: 'b' is out of scope.
  717. 678.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  718. 678.25 s [Cabal] 100% ( 5 / 5) in 'Distribution.Simple.CCompiler'
  719. 678.25 s [Cabal] Warning: 'Flag' is ambiguous. It is defined
  720. 678.25 s [Cabal] * at src/Distribution/Simple/Flag.hs:65:15
  721. 678.25 s [Cabal] * at src/Distribution/Simple/Flag.hs:65:1
  722. 678.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  723. 678.25 s [Cabal] by specifying the type/value namespace explicitly.
  724. 678.25 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Flag.hs:65:1
  725. 678.25 s [Cabal] 100% ( 12 / 12) in 'Distribution.Simple.Flag'
  726. 678.25 s [Cabal] 0% ( 0 / 3) in 'Distribution.Simple.InstallDirs.Internal'
  727. 678.25 s [Cabal] Missing documentation for:
  728. 678.25 s [Cabal] Module header
  729. 678.25 s [Cabal] PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
  730. 678.25 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  731. 678.25 s [Cabal] Warning: 'InstallDirs' is ambiguous. It is defined
  732. 678.25 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:85:24
  733. 678.25 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:85:1
  734. 678.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  735. 678.25 s [Cabal] by specifying the type/value namespace explicitly.
  736. 678.25 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:85:1
  737. 678.25 s [Cabal] Warning: 'PathTemplate' is ambiguous. It is defined
  738. 678.25 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:389:24
  739. 678.25 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:389:1
  740. 678.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  741. 678.25 s [Cabal] by specifying the type/value namespace explicitly.
  742. 678.25 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:389:1
  743. 678.25 s [Cabal] 47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
  744. 678.25 s [Cabal] Missing documentation for:
  745. 678.25 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
  746. 678.25 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
  747. 678.25 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
  748. 678.25 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  749. 678.25 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  750. 678.25 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
  751. 678.25 s [Cabal] substPathTemplate (src/Distribution/Simple/InstallDirs.hs:414)
  752. 678.25 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
  753. 678.25 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
  754. 678.25 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
  755. 678.25 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
  756. 678.25 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
  757. 678.25 s [Cabal] Warning: 'strip' is out of scope.
  758. 678.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  759. 678.25 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Internal'
  760. 678.25 s [Cabal] Warning: 'TestInstance' is ambiguous. It is defined
  761. 678.25 s [Cabal] * at src/Distribution/TestSuite.hs:30:21
  762. 678.25 s [Cabal] * at src/Distribution/TestSuite.hs:30:1
  763. 678.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  764. 678.25 s [Cabal] by specifying the type/value namespace explicitly.
  765. 678.25 s [Cabal] Defaulting to the one defined at src/Distribution/TestSuite.hs:30:1
  766. 678.25 s [Cabal] 22% ( 2 / 9) in 'Distribution.TestSuite'
  767. 678.25 s [Cabal] Missing documentation for:
  768. 678.25 s [Cabal] TestInstance (src/Distribution/TestSuite.hs:30)
  769. 678.25 s [Cabal] OptionDescr (src/Distribution/TestSuite.hs:49)
  770. 678.25 s [Cabal] OptionType (src/Distribution/TestSuite.hs:59)
  771. 678.25 s [Cabal] Test (src/Distribution/TestSuite.hs:78)
  772. 678.25 s [Cabal] Options (src/Distribution/TestSuite.hs:94)
  773. 678.25 s [Cabal] Progress (src/Distribution/TestSuite.hs:96)
  774. 678.25 s [Cabal] Result (src/Distribution/TestSuite.hs:100)
  775. 678.25 s [Cabal] Warning: 'AnnotatedId' is ambiguous. It is defined
  776. 678.25 s [Cabal] * at src/Distribution/Types/AnnotatedId.hs:19:23
  777. 678.25 s [Cabal] * at src/Distribution/Types/AnnotatedId.hs:19:1
  778. 678.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  779. 678.25 s [Cabal] by specifying the type/value namespace explicitly.
  780. 678.25 s [Cabal] Defaulting to the one defined at src/Distribution/Types/AnnotatedId.hs:19:1
  781. 678.25 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.AnnotatedId'
  782. 678.25 s [Cabal] Missing documentation for:
  783. 678.25 s [Cabal] Module header
  784. 678.25 s [Cabal] Warning: 'PreExistingComponent' is ambiguous. It is defined
  785. 678.25 s [Cabal] * at src/Distribution/Backpack/PreExistingComponent.hs:37:29
  786. 678.25 s [Cabal] * at src/Distribution/Backpack/PreExistingComponent.hs:37:1
  787. 678.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  788. 678.25 s [Cabal] by specifying the type/value namespace explicitly.
  789. 678.25 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/PreExistingComponent.hs:37:1
  790. 678.25 s [Cabal] Warning: 'LinkedComponent' is out of scope.
  791. 678.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  792. 678.25 s [Cabal] Warning: 'pc_pkgid' is out of scope.
  793. 678.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  794. 678.26 s [Cabal] Warning: 'CSubLibName' is out of scope.
  795. 678.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  796. 678.26 s [Cabal] 20% ( 1 / 5) in 'Distribution.Types.ComponentInclude'
  797. 678.26 s [Cabal] Missing documentation for:
  798. 678.26 s [Cabal] Module header
  799. 678.26 s [Cabal] ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
  800. 678.26 s [Cabal] ci_id (src/Distribution/Types/ComponentInclude.hs:25)
  801. 678.26 s [Cabal] ci_pkgid (src/Distribution/Types/ComponentInclude.hs:28)
  802. 678.26 s [Cabal] Warning: 'ModuleRenaming' is ambiguous. It is defined
  803. 678.26 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  804. 678.26 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  805. 678.26 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  806. 678.26 s [Cabal] by specifying the type/value namespace explicitly.
  807. 678.26 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
  808. 678.26 s [Cabal] Warning: 'BuildInfo' is out of scope.
  809. 678.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  810. 678.26 s [Cabal] 25% ( 1 / 4) in 'Distribution.Types.ComponentLocalBuildInfo'
  811. 678.26 s [Cabal] Missing documentation for:
  812. 678.26 s [Cabal] Module header
  813. 678.26 s [Cabal] componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:122)
  814. 678.26 s [Cabal] maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:126)
  815. 678.26 s [Cabal] 0% ( 0 / 2) in 'Distribution.Types.DumpBuildInfo'
  816. 678.26 s [Cabal] Missing documentation for:
  817. 678.26 s [Cabal] Module header
  818. 678.26 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  819. 678.26 s [Cabal] Warning: 'GivenComponent' is ambiguous. It is defined
  820. 678.26 s [Cabal] * at src/Distribution/Types/GivenComponent.hs:20:23
  821. 678.26 s [Cabal] * at src/Distribution/Types/GivenComponent.hs:20:1
  822. 678.26 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  823. 678.26 s [Cabal] by specifying the type/value namespace explicitly.
  824. 678.26 s [Cabal] Defaulting to the one defined at src/Distribution/Types/GivenComponent.hs:20:1
  825. 678.26 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.GivenComponent'
  826. 678.26 s [Cabal] Missing documentation for:
  827. 678.26 s [Cabal] Module header
  828. 678.26 s [Cabal] 100% ( 5 / 5) in 'Distribution.Types.PackageName.Magic'
  829. 678.26 s [Cabal] 80% ( 4 / 5) in 'Distribution.Types.ParStrat'
  830. 678.26 s [Cabal] Missing documentation for:
  831. 678.26 s [Cabal] Module header
  832. 678.26 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  833. 678.26 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  834. 678.26 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  835. 678.26 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  836. 678.26 s [Cabal] by specifying the type/value namespace explicitly.
  837. 678.26 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  838. 678.26 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  839. 678.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  840. 678.26 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.TargetInfo'
  841. 678.26 s [Cabal] Missing documentation for:
  842. 678.26 s [Cabal] Module header
  843. 678.26 s [Cabal] 100% ( 8 / 8) in 'Distribution.Utils.IOData'
  844. 678.26 s [Cabal] Warning: 'ByteString' is out of scope.
  845. 678.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  846. 678.26 s [Cabal] 75% ( 3 / 4) in 'Distribution.Utils.Json'
  847. 678.26 s [Cabal] Missing documentation for:
  848. 678.26 s [Cabal] Json (src/Distribution/Utils/Json.hs:20)
  849. 678.26 s [Cabal] Warning: 'mapAccumL' is out of scope.
  850. 678.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  851. 678.26 s [Cabal] 50% ( 1 / 2) in 'Distribution.Utils.MapAccum'
  852. 678.26 s [Cabal] Missing documentation for:
  853. 678.26 s [Cabal] Module header
  854. 678.26 s [Cabal] 100% ( 5 / 5) in 'Distribution.Utils.Progress'
  855. 678.26 s [Cabal] Warning: 'Point' is ambiguous. It is defined
  856. 678.26 s [Cabal] * at src/Distribution/Utils/UnionFind.hs:23:21
  857. 678.26 s [Cabal] * at src/Distribution/Utils/UnionFind.hs:23:1
  858. 678.26 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  859. 678.26 s [Cabal] by specifying the type/value namespace explicitly.
  860. 678.26 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/UnionFind.hs:23:1
  861. 678.26 s [Cabal] 0% ( 0 / 3) in 'Distribution.Verbosity.Internal'
  862. 678.26 s [Cabal] Missing documentation for:
  863. 678.26 s [Cabal] Module header
  864. 678.26 s [Cabal] VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
  865. 678.26 s [Cabal] VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
  866. 678.26 s [Cabal] Warning: 'Verbosity' is ambiguous. It is defined
  867. 678.26 s [Cabal] * at src/Distribution/Verbosity.hs:90:18
  868. 678.26 s [Cabal] * at src/Distribution/Verbosity.hs:90:1
  869. 678.26 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  870. 678.26 s [Cabal] by specifying the type/value namespace explicitly.
  871. 678.26 s [Cabal] Defaulting to the one defined at src/Distribution/Verbosity.hs:90:1
  872. 678.26 s [Cabal] Warning: 'stderr' is out of scope.
  873. 678.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  874. 678.26 s [Cabal] Warning: 'stdout' is out of scope.
  875. 678.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  876. 678.27 s [Cabal] 87% ( 35 / 40) in 'Distribution.Verbosity'
  877. 678.27 s [Cabal] Missing documentation for:
  878. 678.27 s [Cabal] Verbosity (src/Distribution/Verbosity.hs:90)
  879. 678.27 s [Cabal] flagToVerbosity (src/Distribution/Verbosity.hs:241)
  880. 678.27 s [Cabal] showForCabal (src/Distribution/Verbosity.hs:244)
  881. 678.27 s [Cabal] showForGHC (src/Distribution/Verbosity.hs:267)
  882. 678.27 s [Cabal] verboseHasFlags (src/Distribution/Verbosity.hs:335)
  883. 678.27 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  884. 678.27 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  885. 678.27 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  886. 678.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  887. 678.27 s [Cabal] by specifying the type/value namespace explicitly.
  888. 678.27 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  889. 678.27 s [Cabal] Warning: 'ConfiguredProgram' is ambiguous. It is defined
  890. 678.27 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:26
  891. 678.27 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:1
  892. 678.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  893. 678.27 s [Cabal] by specifying the type/value namespace explicitly.
  894. 678.27 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
  895. 678.27 s [Cabal] Warning: 'simpleProgram' is out of scope.
  896. 678.27 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  897. 678.27 s [Cabal] Warning: 'findProgramOnSearchPath' is out of scope.
  898. 678.27 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  899. 678.27 s [Cabal] Warning: 'findExecutable' is out of scope.
  900. 678.27 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  901. 678.27 s [Cabal] 83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
  902. 678.27 s [Cabal] Missing documentation for:
  903. 678.27 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  904. 678.27 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  905. 678.27 s [Cabal] Warning: 'PreProcessor' is ambiguous. It is defined
  906. 678.27 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:21
  907. 678.27 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:1
  908. 678.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  909. 678.27 s [Cabal] by specifying the type/value namespace explicitly.
  910. 678.27 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
  911. 678.27 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.PreProcess.Types'
  912. 678.27 s [Cabal] Missing documentation for:
  913. 678.27 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
  914. 678.27 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
  915. 678.27 s [Cabal] 0% ( 0 / 5) in 'Distribution.Simple.Errors'
  916. 678.27 s [Cabal] Missing documentation for:
  917. 678.27 s [Cabal] Module header
  918. 678.27 s [Cabal] CabalException (src/Distribution/Simple/Errors.hs:46)
  919. 678.27 s [Cabal] FailedDependency (src/Distribution/Simple/Errors.hs:39)
  920. 678.27 s [Cabal] exceptionCode (src/Distribution/Simple/Errors.hs:179)
  921. 678.27 s [Cabal] exceptionMessage (src/Distribution/Simple/Errors.hs:315)
  922. 678.27 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.PreProcess.Unlit'
  923. 678.27 s [Cabal] Warning: 'ModuleShape' is ambiguous. It is defined
  924. 678.27 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:20
  925. 678.27 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:1
  926. 678.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  927. 678.27 s [Cabal] by specifying the type/value namespace explicitly.
  928. 678.27 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
  929. 678.27 s [Cabal] Warning: 'ModuleScope' is ambiguous. It is defined
  930. 678.27 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:20
  931. 678.27 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:1
  932. 678.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  933. 678.27 s [Cabal] by specifying the type/value namespace explicitly.
  934. 678.27 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
  935. 678.27 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  936. 678.27 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  937. 678.27 s [Cabal] Warning: 'UnifyM' is ambiguous. It is defined
  938. 678.27 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:83:22
  939. 678.27 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:83:1
  940. 678.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  941. 678.27 s [Cabal] by specifying the type/value namespace explicitly.
  942. 678.27 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:83:1
  943. 678.27 s [Cabal] Warning: 'Module' is ambiguous. It is defined
  944. 678.27 s [Cabal] * in ‘Distribution.Types.Module’
  945. 678.28 s [Cabal] * in ‘Distribution.Types.Module’
  946. 678.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  947. 678.28 s [Cabal] by specifying the type/value namespace explicitly.
  948. 678.28 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Module’
  949. 678.28 s [Cabal] Warning: 'ModuleU' is ambiguous. It is defined
  950. 678.28 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:256:5
  951. 678.28 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:265:1
  952. 678.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  953. 678.28 s [Cabal] by specifying the type/value namespace explicitly.
  954. 678.28 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:265:1
  955. 678.28 s [Cabal] Warning: 'UnitIdU' is ambiguous. It is defined
  956. 678.28 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:261:5
  957. 678.28 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:268:1
  958. 678.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  959. 678.28 s [Cabal] by specifying the type/value namespace explicitly.
  960. 678.28 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:268:1
  961. 678.28 s [Cabal] Warning: 'createDirectoryIfMissing' is out of scope.
  962. 678.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  963. 678.28 s [Cabal] Warning: 'findModuleFile' is out of scope.
  964. 678.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  965. 678.28 s [Cabal] Warning: 'CreatePipe' is out of scope.
  966. 678.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  967. 678.28 s [Cabal] Warning: 'rawSystem' is out of scope.
  968. 678.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  969. 678.28 s [Cabal] Warning: 'action' is out of scope.
  970. 678.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  971. 678.29 s [Cabal] Warning: 'ByteString' is out of scope.
  972. 678.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  973. 678.29 s [Cabal] Warning: 'die' is out of scope.
  974. 678.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  975. 678.29 s [Cabal] Warning: 'TempFileOptions' is ambiguous. It is defined
  976. 678.29 s [Cabal] * at src/Distribution/Simple/Utils.hs:1632:24
  977. 678.29 s [Cabal] * at src/Distribution/Simple/Utils.hs:1632:1
  978. 678.29 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  979. 678.29 s [Cabal] by specifying the type/value namespace explicitly.
  980. 678.29 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Utils.hs:1632:1
  981. 678.29 s [Cabal] Warning: 'waitForProcess' is out of scope.
  982. 678.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  983. 678.29 s [Cabal] 85% (122 /142) in 'Distribution.Simple.Utils'
  984. 678.29 s [Cabal] Missing documentation for:
  985. 678.29 s [Cabal] cabalVersion (src/Distribution/Simple/Utils.hs:285)
  986. 678.29 s [Cabal] dieNoVerbosity (src/Distribution/Simple/Utils.hs:346)
  987. 678.29 s [Cabal] die' (src/Distribution/Simple/Utils.hs:376)
  988. 678.29 s [Cabal] dieWithException (src/Distribution/Simple/Utils.hs:389)
  989. 678.29 s [Cabal] dieWithLocation' (src/Distribution/Simple/Utils.hs:365)
  990. 678.29 s [Cabal] dieNoWrap (src/Distribution/Simple/Utils.hs:408)
  991. 678.29 s [Cabal] topHandler (src/Distribution/Simple/Utils.hs:515)
  992. 678.29 s [Cabal] topHandlerWith (src/Distribution/Simple/Utils.hs:464)
  993. 678.29 s [Cabal] infoNoWrap (src/Distribution/Simple/Utils.hs:603)
  994. 678.29 s [Cabal] VerboseException (src/Distribution/Simple/Utils.hs:384)
  995. 678.29 s [Cabal] setFileOrdinary (src/Distribution/Compat/CopyFile.hs:77)
  996. 678.29 s [Cabal] setFileExecutable (src/Distribution/Compat/CopyFile.hs:78)
  997. 678.29 s [Cabal] shortRelativePath (src/Distribution/Simple/Utils.hs:1747)
  998. 678.29 s [Cabal] findFirstFile (src/Distribution/Simple/Utils.hs:1301)
  999. 678.29 s [Cabal] findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1277)
  1000. 678.29 s [Cabal] addLibraryPath (src/Distribution/Simple/Utils.hs:1397)
  1001. 678.29 s [Cabal] defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1638)
  1002. 678.29 s [Cabal] createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:124)
  1003. 678.29 s [Cabal] equating
  1004. 678.29 s [Cabal] unintersperse
  1005. 678.29 s [Cabal] Warning: 'NubList' is ambiguous. It is defined
  1006. 678.29 s [Cabal] * at src/Distribution/Utils/NubList.hs:24:21
  1007. 678.29 s [Cabal] * at src/Distribution/Utils/NubList.hs:24:1
  1008. 678.29 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1009. 678.29 s [Cabal] by specifying the type/value namespace explicitly.
  1010. 678.29 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/NubList.hs:24:1
  1011. 678.29 s [Cabal] 66% ( 6 / 9) in 'Distribution.Utils.NubList'
  1012. 678.29 s [Cabal] Missing documentation for:
  1013. 678.29 s [Cabal] Module header
  1014. 678.29 s [Cabal] fromNubList
  1015. 678.29 s [Cabal] fromNubListR
  1016. 678.30 s [Cabal] Warning: 'LogProgress' is ambiguous. It is defined
  1017. 678.30 s [Cabal] * at src/Distribution/Utils/LogProgress.hs:33:25
  1018. 678.30 s [Cabal] * at src/Distribution/Utils/LogProgress.hs:33:1
  1019. 678.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1020. 678.30 s [Cabal] by specifying the type/value namespace explicitly.
  1021. 678.30 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/LogProgress.hs:33:1
  1022. 678.30 s [Cabal] Warning: 'die' is out of scope.
  1023. 678.30 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1024. 678.30 s [Cabal] 85% ( 6 / 7) in 'Distribution.Utils.LogProgress'
  1025. 678.30 s [Cabal] Missing documentation for:
  1026. 678.30 s [Cabal] Module header
  1027. 678.30 s [Cabal] 30% ( 4 / 13) in 'Distribution.Simple.Program.Run'
  1028. 678.30 s [Cabal] Missing documentation for:
  1029. 678.30 s [Cabal] IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
  1030. 678.30 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
  1031. 678.30 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
  1032. 678.30 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:90)
  1033. 678.30 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
  1034. 678.30 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
  1035. 678.30 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
  1036. 678.30 s [Cabal] getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:177)
  1037. 678.30 s [Cabal] getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:189)
  1038. 678.30 s [Cabal] 100% ( 4 / 4) in 'Distribution.Simple.Program.Script'
  1039. 678.30 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Program.ResponseFile'
  1040. 678.30 s [Cabal] Missing documentation for:
  1041. 678.30 s [Cabal] withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:37)
  1042. 678.30 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Program.Hpc'
  1043. 678.30 s [Cabal] Missing documentation for:
  1044. 678.30 s [Cabal] union (src/Distribution/Simple/Program/Hpc.hs:115)
  1045. 678.30 s [Cabal] 63% ( 7 / 11) in 'Distribution.Simple.Program.Find'
  1046. 678.30 s [Cabal] Missing documentation for:
  1047. 678.30 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  1048. 678.30 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
  1049. 678.30 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
  1050. 678.30 s [Cabal] logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:72)
  1051. 678.30 s [Cabal] Warning: 'UnitIndex' is out of scope.
  1052. 678.30 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1053. 678.30 s [Cabal] Warning: 'PackageIndex' is ambiguous. It is defined
  1054. 678.30 s [Cabal] * at src/Distribution/Simple/PackageIndex.hs:127:23
  1055. 678.30 s [Cabal] * at src/Distribution/Simple/PackageIndex.hs:127:1
  1056. 678.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1057. 678.30 s [Cabal] by specifying the type/value namespace explicitly.
  1058. 678.30 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PackageIndex.hs:127:1
  1059. 678.30 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  1060. 678.30 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1061. 678.30 s [Cabal] Warning: 'Cabal' is out of scope.
  1062. 678.30 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1063. 678.31 s [Cabal] Warning: 'PackageDB' is out of scope.
  1064. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1065. 678.31 s [Cabal] 92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
  1066. 678.31 s [Cabal] Missing documentation for:
  1067. 678.31 s [Cabal] SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
  1068. 678.31 s [Cabal] topologicalOrder (src/Distribution/Simple/PackageIndex.hs:667)
  1069. 678.31 s [Cabal] reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:675)
  1070. 678.31 s [Cabal] 50% ( 3 / 6) in 'Distribution.Simple.PackageDescription'
  1071. 678.31 s [Cabal] Missing documentation for:
  1072. 678.31 s [Cabal] readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:45)
  1073. 678.31 s [Cabal] readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:48)
  1074. 678.31 s [Cabal] parseString (src/Distribution/Simple/PackageDescription.hs:81)
  1075. 678.31 s [Cabal] Warning: 'Version' is out of scope.
  1076. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1077. 678.31 s [Cabal] Warning: 'matchDirFileGlob' is out of scope.
  1078. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1079. 678.31 s [Cabal] 68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
  1080. 678.31 s [Cabal] Missing documentation for:
  1081. 678.31 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
  1082. 678.31 s [Cabal] enableMultidot (src/Distribution/Simple/Glob/Internal.hs:178)
  1083. 678.31 s [Cabal] dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:234)
  1084. 678.31 s [Cabal] isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:252)
  1085. 678.31 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  1086. 678.31 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
  1087. 678.31 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  1088. 678.31 s [Cabal] Warning: 'die'' is out of scope.
  1089. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1090. 678.31 s [Cabal] Warning: 'Version' is out of scope.
  1091. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1092. 678.31 s [Cabal] Warning: 'die' is out of scope.
  1093. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1094. 678.31 s [Cabal] 75% ( 12 / 16) in 'Distribution.Simple.Glob'
  1095. 678.31 s [Cabal] Missing documentation for:
  1096. 678.31 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  1097. 678.31 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
  1098. 678.31 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  1099. 678.31 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
  1100. 678.31 s [Cabal] Warning: 'ask' is out of scope.
  1101. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1102. 678.31 s [Cabal] Warning: 'm' is out of scope.
  1103. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1104. 678.31 s [Cabal] Warning: 'CheckCtx' is ambiguous. It is defined
  1105. 678.31 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:109:19
  1106. 678.31 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:109:1
  1107. 678.31 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1108. 678.31 s [Cabal] by specifying the type/value namespace explicitly.
  1109. 678.31 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:109:1
  1110. 678.31 s [Cabal] Warning: 'local' is out of scope.
  1111. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1112. 678.31 s [Cabal] Warning: 'CheckPackageContentOps' is ambiguous. It is defined
  1113. 678.31 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
  1114. 678.31 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1115. 678.31 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1116. 678.31 s [Cabal] by specifying the type/value namespace explicitly.
  1117. 678.31 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1118. 678.31 s [Cabal] Warning: 'TargetAnnotation' is ambiguous. It is defined
  1119. 678.31 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:160:27
  1120. 678.31 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:160:1
  1121. 678.31 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1122. 678.31 s [Cabal] by specifying the type/value namespace explicitly.
  1123. 678.31 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:160:1
  1124. 678.31 s [Cabal] Warning: 'TaraAnn' is out of scope.
  1125. 678.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1126. 678.32 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  1127. 678.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1128. 678.32 s [Cabal] 68% ( 33 / 48) in 'Distribution.Simple.Compiler'
  1129. 678.32 s [Cabal] Missing documentation for:
  1130. 678.32 s [Cabal] Compiler (src/Distribution/Simple/Compiler.hs:91)
  1131. 678.32 s [Cabal] showCompilerId (src/Distribution/Simple/Compiler.hs:113)
  1132. 678.32 s [Cabal] showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:116)
  1133. 678.32 s [Cabal] compilerFlavor (src/Distribution/Simple/Compiler.hs:123)
  1134. 678.32 s [Cabal] compilerVersion (src/Distribution/Simple/Compiler.hs:126)
  1135. 678.32 s [Cabal] compilerInfo (src/Distribution/Simple/Compiler.hs:155)
  1136. 678.32 s [Cabal] absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:213)
  1137. 678.32 s [Cabal] flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:237)
  1138. 678.32 s [Cabal] flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:270)
  1139. 678.32 s [Cabal] CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
  1140. 678.32 s [Cabal] languageToFlags (src/Distribution/Simple/Compiler.hs:295)
  1141. 678.32 s [Cabal] unsupportedLanguages (src/Distribution/Simple/Compiler.hs:290)
  1142. 678.32 s [Cabal] knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:476)
  1143. 678.32 s [Cabal] flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:464)
  1144. 678.32 s [Cabal] showProfDetailLevel (src/Distribution/Simple/Compiler.hs:486)
  1145. 678.32 s [Cabal] 65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
  1146. 678.32 s [Cabal] Missing documentation for:
  1147. 678.32 s [Cabal] initInvocation (src/Distribution/Simple/Program/HcPkg.hs:387)
  1148. 678.32 s [Cabal] registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:401)
  1149. 678.32 s [Cabal] unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:429)
  1150. 678.32 s [Cabal] recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:439)
  1151. 678.32 s [Cabal] exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:450)
  1152. 678.32 s [Cabal] hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:473)
  1153. 678.32 s [Cabal] dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:479)
  1154. 678.32 s [Cabal] describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:461)
  1155. 678.32 s [Cabal] listInvocation (src/Distribution/Simple/Program/HcPkg.hs:492)
  1156. 678.33 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  1157. 678.33 s [Cabal] * in ‘Distribution.Backpack’
  1158. 678.33 s [Cabal] * in ‘Distribution.Backpack’
  1159. 678.33 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1160. 678.33 s [Cabal] by specifying the type/value namespace explicitly.
  1161. 678.33 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  1162. 678.33 s [Cabal] 18% ( 2 / 11) in 'Distribution.Simple.Program.GHC'
  1163. 678.33 s [Cabal] Missing documentation for:
  1164. 678.33 s [Cabal] Module header
  1165. 678.33 s [Cabal] GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
  1166. 678.33 s [Cabal] GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
  1167. 678.33 s [Cabal] GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
  1168. 678.33 s [Cabal] GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
  1169. 678.33 s [Cabal] ghcInvocation (src/Distribution/Simple/Program/GHC.hs:648)
  1170. 678.33 s [Cabal] renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:659)
  1171. 678.33 s [Cabal] runGHC (src/Distribution/Simple/Program/GHC.hs:638)
  1172. 678.33 s [Cabal] normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:49)
  1173. 678.33 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1174. 678.33 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1175. 678.33 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1176. 678.33 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1177. 678.33 s [Cabal] by specifying the type/value namespace explicitly.
  1178. 678.33 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1179. 678.33 s [Cabal] 12% ( 4 / 31) in 'Distribution.Simple.Program.Builtin'
  1180. 678.33 s [Cabal] Missing documentation for:
  1181. 678.33 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
  1182. 678.33 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
  1183. 678.33 s [Cabal] runghcProgram (src/Distribution/Simple/Program/Builtin.hs:135)
  1184. 678.33 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
  1185. 678.33 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
  1186. 678.33 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
  1187. 678.33 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
  1188. 678.33 s [Cabal] haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:228)
  1189. 678.33 s [Cabal] haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:239)
  1190. 678.33 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
  1191. 678.33 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
  1192. 678.33 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
  1193. 678.33 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
  1194. 678.33 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
  1195. 678.33 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
  1196. 678.33 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
  1197. 678.33 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
  1198. 678.33 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
  1199. 678.33 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
  1200. 678.33 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
  1201. 678.33 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
  1202. 678.33 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
  1203. 678.33 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
  1204. 678.33 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
  1205. 678.33 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
  1206. 678.33 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
  1207. 678.33 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
  1208. 678.33 s [Cabal] Warning: 'ProgramDb' is ambiguous. It is defined
  1209. 678.33 s [Cabal] * at src/Distribution/Simple/Program/Db.hs:95:18
  1210. 678.33 s [Cabal] * at src/Distribution/Simple/Program/Db.hs:95:1
  1211. 678.33 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1212. 678.33 s [Cabal] by specifying the type/value namespace explicitly.
  1213. 678.33 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Db.hs:95:1
  1214. 678.33 s [Cabal] Warning: 'AnyVersion' is out of scope.
  1215. 678.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1216. 678.33 s [Cabal] Warning: 'Programs' is out of scope.
  1217. 678.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1218. 678.33 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1219. 678.33 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1220. 678.33 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1221. 678.33 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1222. 678.34 s [Cabal] by specifying the type/value namespace explicitly.
  1223. 678.34 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1224. 678.34 s [Cabal] 82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
  1225. 678.34 s [Cabal] Missing documentation for:
  1226. 678.34 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
  1227. 678.34 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
  1228. 678.34 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
  1229. 678.34 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
  1230. 678.34 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
  1231. 678.34 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
  1232. 678.34 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1233. 678.34 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1234. 678.34 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1235. 678.34 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1236. 678.34 s [Cabal] by specifying the type/value namespace explicitly.
  1237. 678.34 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1238. 678.34 s [Cabal] Warning: 'ConfiguredProgram' is ambiguous. It is defined
  1239. 678.34 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:26
  1240. 678.34 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:1
  1241. 678.34 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1242. 678.34 s [Cabal] by specifying the type/value namespace explicitly.
  1243. 678.34 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
  1244. 678.34 s [Cabal] 50% ( 40 / 80) in 'Distribution.Simple.Program'
  1245. 678.34 s [Cabal] Missing documentation for:
  1246. 678.34 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  1247. 678.34 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
  1248. 678.34 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
  1249. 678.34 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  1250. 678.34 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
  1251. 678.34 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
  1252. 678.34 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:90)
  1253. 678.34 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
  1254. 678.34 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
  1255. 678.34 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
  1256. 678.34 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
  1257. 678.34 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
  1258. 678.34 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
  1259. 678.34 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
  1260. 678.34 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
  1261. 678.34 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
  1262. 678.34 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
  1263. 678.34 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
  1264. 678.34 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
  1265. 678.34 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
  1266. 678.34 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
  1267. 678.34 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
  1268. 678.34 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
  1269. 678.34 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
  1270. 678.34 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
  1271. 678.34 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
  1272. 678.34 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
  1273. 678.34 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
  1274. 678.34 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
  1275. 678.34 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
  1276. 678.34 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
  1277. 678.34 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
  1278. 678.34 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
  1279. 678.34 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
  1280. 678.34 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
  1281. 678.34 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
  1282. 678.34 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
  1283. 678.34 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
  1284. 678.34 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
  1285. 678.34 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
  1286. 678.34 s [Cabal] 33% ( 1 / 3) in 'Distribution.Simple.Program.Strip'
  1287. 678.34 s [Cabal] Missing documentation for:
  1288. 678.34 s [Cabal] stripLib (src/Distribution/Simple/Program/Strip.hs:52)
  1289. 678.34 s [Cabal] stripExe (src/Distribution/Simple/Program/Strip.hs:41)
  1290. 678.34 s [Cabal] Warning: 'CommandUI' is ambiguous. It is defined
  1291. 678.34 s [Cabal] * at src/Distribution/Simple/Command.hs:97:24
  1292. 678.34 s [Cabal] * at src/Distribution/Simple/Command.hs:97:1
  1293. 678.34 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1294. 678.35 s [Cabal] by specifying the type/value namespace explicitly.
  1295. 678.35 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Command.hs:97:1
  1296. 678.35 s [Cabal] Warning: 'GetOpt' is out of scope.
  1297. 678.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1298. 678.35 s [Cabal] Warning: 'smart' is out of scope.
  1299. 678.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1300. 678.35 s [Cabal] 61% ( 33 / 54) in 'Distribution.Simple.Command'
  1301. 678.35 s [Cabal] Missing documentation for:
  1302. 678.35 s [Cabal] CommandUI (src/Distribution/Simple/Command.hs:97)
  1303. 678.35 s [Cabal] CommandParse (src/Distribution/Simple/Command.hs:596)
  1304. 678.35 s [Cabal] helpCommandUI (src/Distribution/Simple/Command.hs:764)
  1305. 678.35 s [Cabal] ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
  1306. 678.35 s [Cabal] Command (src/Distribution/Simple/Command.hs:608)
  1307. 678.35 s [Cabal] commandAddAction (src/Distribution/Simple/Command.hs:621)
  1308. 678.35 s [Cabal] CommandType (src/Distribution/Simple/Command.hs:607)
  1309. 678.35 s [Cabal] commandFromSpec (src/Distribution/Simple/Command.hs:788)
  1310. 678.35 s [Cabal] commandsRun (src/Distribution/Simple/Command.hs:659)
  1311. 678.35 s [Cabal] commandsRunWithFallback (src/Distribution/Simple/Command.hs:675)
  1312. 678.35 s [Cabal] defaultCommandFallback (src/Distribution/Simple/Command.hs:667)
  1313. 678.35 s [Cabal] Name (src/Distribution/Simple/Command.hs:117)
  1314. 678.35 s [Cabal] liftOption (src/Distribution/Simple/Command.hs:374)
  1315. 678.35 s [Cabal] Description (src/Distribution/Simple/Command.hs:118)
  1316. 678.35 s [Cabal] OptFlags (src/Distribution/Simple/Command.hs:160)
  1317. 678.35 s [Cabal] ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
  1318. 678.35 s [Cabal] MkOptDescr (src/Distribution/Simple/Command.hs:200)
  1319. 678.35 s [Cabal] optArgDef' (src/Distribution/Simple/Command.hs:275)
  1320. 678.35 s [Cabal] noArg (src/Distribution/Simple/Command.hs:279)
  1321. 678.35 s [Cabal] boolOpt (src/Distribution/Simple/Command.hs:287)
  1322. 678.35 s [Cabal] boolOpt' (src/Distribution/Simple/Command.hs:299)
  1323. 678.35 s [Cabal] Warning: 'progDb' is out of scope.
  1324. 678.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1325. 678.35 s [Cabal] Warning: 'OptionField' is ambiguous. It is defined
  1326. 678.35 s [Cabal] * at src/Distribution/Simple/Command.hs:125:22
  1327. 678.35 s [Cabal] * at src/Distribution/Simple/Command.hs:125:1
  1328. 678.35 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1329. 678.35 s [Cabal] by specifying the type/value namespace explicitly.
  1330. 678.35 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Command.hs:125:1
  1331. 678.36 s [Cabal] Warning: 'haddocksInterfaces' is out of scope.
  1332. 678.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1333. 678.36 s [Cabal] Warning: 'haddocksAction' is out of scope.
  1334. 678.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1335. 678.37 s [Cabal] Warning: 'BuildOptions' is ambiguous. It is defined
  1336. 678.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:148:21
  1337. 678.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:148:1
  1338. 678.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1339. 678.37 s [Cabal] by specifying the type/value namespace explicitly.
  1340. 678.37 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:148:1
  1341. 678.37 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  1342. 678.37 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1343. 678.37 s [Cabal] Warning: 'LocalBuildConfig' is ambiguous. It is defined
  1344. 678.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:134:25
  1345. 678.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:134:1
  1346. 678.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1347. 678.37 s [Cabal] by specifying the type/value namespace explicitly.
  1348. 678.37 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:134:1
  1349. 678.37 s [Cabal] Warning: 'PackageBuildDescr' is ambiguous. It is defined
  1350. 678.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:48:26
  1351. 678.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:48:1
  1352. 678.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1353. 678.37 s [Cabal] by specifying the type/value namespace explicitly.
  1354. 678.37 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:48:1
  1355. 678.37 s [Cabal] 77% ( 7 / 9) in 'Distribution.Types.LocalBuildConfig'
  1356. 678.37 s [Cabal] Missing documentation for:
  1357. 678.37 s [Cabal] Module header
  1358. 678.38 s [Cabal] buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:202)
  1359. 678.38 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  1360. 678.38 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  1361. 678.38 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  1362. 678.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1363. 678.38 s [Cabal] by specifying the type/value namespace explicitly.
  1364. 678.38 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  1365. 678.38 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1366. 678.38 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1367. 678.38 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1368. 678.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1369. 678.38 s [Cabal] by specifying the type/value namespace explicitly.
  1370. 678.38 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1371. 678.38 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  1372. 678.38 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  1373. 678.38 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1374. 678.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1375. 678.38 s [Cabal] by specifying the type/value namespace explicitly.
  1376. 678.38 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1377. 678.38 s [Cabal] Warning: 'PackageIdentifier' is ambiguous. It is defined
  1378. 678.38 s [Cabal] * in ‘Distribution.Types.PackageId’
  1379. 678.38 s [Cabal] * in ‘Distribution.Types.PackageId’
  1380. 678.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1381. 678.38 s [Cabal] by specifying the type/value namespace explicitly.
  1382. 678.38 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageId’
  1383. 678.38 s [Cabal] Warning: 'LocalBuildDescr' is out of scope.
  1384. 678.38 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1385. 678.38 s [Cabal] Warning: 'LocalBuildConfig' is out of scope.
  1386. 678.38 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1387. 678.38 s [Cabal] Warning: 'Component' is out of scope.
  1388. 678.38 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1389. 678.38 s [Cabal] 53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
  1390. 678.38 s [Cabal] Missing documentation for:
  1391. 678.38 s [Cabal] Module header
  1392. 678.38 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
  1393. 678.38 s [Cabal] buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:281)
  1394. 678.38 s [Cabal] configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:285)
  1395. 678.38 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
  1396. 678.38 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
  1397. 678.38 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
  1398. 678.38 s [Cabal] unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:360)
  1399. 678.38 s [Cabal] componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:420)
  1400. 678.38 s [Cabal] unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:423)
  1401. 678.38 s [Cabal] allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:426)
  1402. 678.38 s [Cabal] withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:429)
  1403. 678.38 s [Cabal] neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:432)
  1404. 678.39 s [Cabal] withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:435)
  1405. 678.39 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  1406. 678.39 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  1407. 678.39 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1408. 678.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1409. 678.39 s [Cabal] by specifying the type/value namespace explicitly.
  1410. 678.39 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1411. 678.39 s [Cabal] Warning: 'Library' is ambiguous. It is defined
  1412. 678.39 s [Cabal] * in ‘Distribution.Types.Library’
  1413. 678.39 s [Cabal] * in ‘Distribution.Types.Library’
  1414. 678.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1415. 678.39 s [Cabal] by specifying the type/value namespace explicitly.
  1416. 678.39 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Library’
  1417. 678.39 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1418. 678.39 s [Cabal] * in ‘Distribution.Types.Executable’
  1419. 678.39 s [Cabal] * in ‘Distribution.Types.Executable’
  1420. 678.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1421. 678.39 s [Cabal] by specifying the type/value namespace explicitly.
  1422. 678.39 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1423. 678.39 s [Cabal] Warning: 'compBuildOrder' is out of scope.
  1424. 678.39 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1425. 678.39 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  1426. 678.39 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1427. 678.39 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1428. 678.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1429. 678.39 s [Cabal] by specifying the type/value namespace explicitly.
  1430. 678.39 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  1431. 678.39 s [Cabal] 49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
  1432. 678.39 s [Cabal] Missing documentation for:
  1433. 678.39 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
  1434. 678.39 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
  1435. 678.39 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
  1436. 678.39 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
  1437. 678.39 s [Cabal] Component
  1438. 678.39 s [Cabal] ComponentName
  1439. 678.39 s [Cabal] LibraryName
  1440. 678.39 s [Cabal] defaultLibName
  1441. 678.39 s [Cabal] showComponentName
  1442. 678.39 s [Cabal] componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:115)
  1443. 678.39 s [Cabal] foldComponent
  1444. 678.39 s [Cabal] componentName
  1445. 678.39 s [Cabal] componentBuildInfo
  1446. 678.39 s [Cabal] lookupComponent
  1447. 678.39 s [Cabal] getComponent
  1448. 678.39 s [Cabal] allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:211)
  1449. 678.39 s [Cabal] withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:173)
  1450. 678.39 s [Cabal] enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:180)
  1451. 678.39 s [Cabal] enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:190)
  1452. 678.39 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
  1453. 678.39 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
  1454. 678.39 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
  1455. 678.39 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
  1456. 678.39 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
  1457. 678.39 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
  1458. 678.39 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
  1459. 678.39 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
  1460. 678.39 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
  1461. 678.39 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  1462. 678.39 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  1463. 678.39 s [Cabal] absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:378)
  1464. 678.39 s [Cabal] substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:436)
  1465. 678.39 s [Cabal] Warning: 'PackageLog' is ambiguous. It is defined
  1466. 678.39 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:40:19
  1467. 678.39 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:40:1
  1468. 678.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1469. 678.39 s [Cabal] by specifying the type/value namespace explicitly.
  1470. 678.39 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:40:1
  1471. 678.39 s [Cabal] Warning: 'TestSuiteLog' is ambiguous. It is defined
  1472. 678.39 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:21
  1473. 678.39 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:1
  1474. 678.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1475. 678.39 s [Cabal] by specifying the type/value namespace explicitly.
  1476. 678.39 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
  1477. 678.39 s [Cabal] 71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
  1478. 678.39 s [Cabal] Missing documentation for:
  1479. 678.39 s [Cabal] Module header
  1480. 678.39 s [Cabal] TestLogs (src/Distribution/Simple/Test/Log.hs:66)
  1481. 678.39 s [Cabal] summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:193)
  1482. 678.39 s [Cabal] testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:127)
  1483. 678.40 s [Cabal] 55% ( 5 / 9) in 'Distribution.Simple.Hpc'
  1484. 678.40 s [Cabal] Missing documentation for:
  1485. 678.40 s [Cabal] Way (src/Distribution/Simple/Hpc.hs:55)
  1486. 678.40 s [Cabal] htmlDir (src/Distribution/Simple/Hpc.hs:104)
  1487. 678.40 s [Cabal] mixDir (src/Distribution/Simple/Hpc.hs:77)
  1488. 678.40 s [Cabal] tixDir (src/Distribution/Simple/Hpc.hs:85)
  1489. 678.40 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Build.PackageInfoModule'
  1490. 678.40 s [Cabal] Missing documentation for:
  1491. 678.40 s [Cabal] generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:37)
  1492. 678.40 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Build.Macros'
  1493. 678.40 s [Cabal] Warning: 'computeCompatPackageName' is out of scope.
  1494. 678.40 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1495. 678.40 s [Cabal] Warning: 'ConfiguredComponent' is ambiguous. It is defined
  1496. 678.40 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
  1497. 678.40 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1498. 678.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1499. 678.40 s [Cabal] by specifying the type/value namespace explicitly.
  1500. 678.40 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1501. 678.41 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
  1502. 678.41 s [Cabal] Missing documentation for:
  1503. 678.41 s [Cabal] toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:179)
  1504. 678.41 s [Cabal] toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:317)
  1505. 678.41 s [Cabal] ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
  1506. 678.41 s [Cabal] extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:292)
  1507. 678.41 s [Cabal] newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:350)
  1508. 678.41 s [Cabal] Warning: 'LinkedComponent' is ambiguous. It is defined
  1509. 678.41 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:24
  1510. 678.41 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1511. 678.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1512. 678.41 s [Cabal] by specifying the type/value namespace explicitly.
  1513. 678.41 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1514. 678.41 s [Cabal] Warning: 'ModSubst' is out of scope.
  1515. 678.41 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1516. 678.41 s [Cabal] Warning: 'ConfiguredComponent' is ambiguous. It is defined
  1517. 678.41 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
  1518. 678.41 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1519. 678.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1520. 678.41 s [Cabal] by specifying the type/value namespace explicitly.
  1521. 678.41 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1522. 678.41 s [Cabal] Warning: 'ReadyComponent' is out of scope.
  1523. 678.41 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1524. 678.41 s [Cabal] Warning: 'ModuleRenaming' is ambiguous. It is defined
  1525. 678.41 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  1526. 678.41 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  1527. 678.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1528. 678.41 s [Cabal] by specifying the type/value namespace explicitly.
  1529. 678.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
  1530. 678.41 s [Cabal] Warning: 'IncludeRenaming' is ambiguous. It is defined
  1531. 678.41 s [Cabal] * in ‘Distribution.Types.IncludeRenaming’
  1532. 678.41 s [Cabal] * in ‘Distribution.Types.IncludeRenaming’
  1533. 678.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1534. 678.41 s [Cabal] by specifying the type/value namespace explicitly.
  1535. 678.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.IncludeRenaming’
  1536. 678.41 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.LinkedComponent'
  1537. 678.41 s [Cabal] Missing documentation for:
  1538. 678.41 s [Cabal] toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:123)
  1539. 678.41 s [Cabal] toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:417)
  1540. 678.41 s [Cabal] dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:99)
  1541. 678.41 s [Cabal] LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
  1542. 678.41 s [Cabal] extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:436)
  1543. 678.41 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1544. 678.41 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1545. 678.41 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1546. 678.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1547. 678.41 s [Cabal] by specifying the type/value namespace explicitly.
  1548. 678.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1549. 678.41 s [Cabal] 100% ( 7 / 7) in 'Distribution.Backpack.ComponentsGraph'
  1550. 678.41 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Ld'
  1551. 678.41 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Program.Ar'
  1552. 678.42 s [Cabal] Warning: 'CommandUI' is out of scope.
  1553. 678.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1554. 678.42 s [Cabal] Warning: 'Monoid' is out of scope.
  1555. 678.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1556. 678.42 s [Cabal] 25% ( 26 /102) in 'Distribution.Simple.Setup'
  1557. 678.42 s [Cabal] Missing documentation for:
  1558. 678.42 s [Cabal] emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:115)
  1559. 678.42 s [Cabal] defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:54)
  1560. 678.42 s [Cabal] globalCommand (src/Distribution/Simple/Setup/Global.hs:61)
  1561. 678.42 s [Cabal] emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1024)
  1562. 678.42 s [Cabal] defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:310)
  1563. 678.42 s [Cabal] configureCommand (src/Distribution/Simple/Setup/Config.hs:356)
  1564. 678.42 s [Cabal] configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:302)
  1565. 678.42 s [Cabal] readPackageDbList (src/Distribution/Simple/Setup/Config.hs:869)
  1566. 678.42 s [Cabal] showPackageDbList (src/Distribution/Simple/Setup/Config.hs:881)
  1567. 678.42 s [Cabal] emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:146)
  1568. 678.42 s [Cabal] defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:62)
  1569. 678.42 s [Cabal] copyCommand (src/Distribution/Simple/Setup/Copy.hs:72)
  1570. 678.42 s [Cabal] emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:151)
  1571. 678.42 s [Cabal] defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:61)
  1572. 678.42 s [Cabal] installCommand (src/Distribution/Simple/Setup/Install.hs:73)
  1573. 678.42 s [Cabal] HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
  1574. 678.42 s [Cabal] emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:357)
  1575. 678.42 s [Cabal] defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:116)
  1576. 678.42 s [Cabal] haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:146)
  1577. 678.42 s [Cabal] HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
  1578. 678.42 s [Cabal] emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:599)
  1579. 678.42 s [Cabal] defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:422)
  1580. 678.42 s [Cabal] haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:446)
  1581. 678.42 s [Cabal] HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
  1582. 678.42 s [Cabal] emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:58)
  1583. 678.42 s [Cabal] defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:61)
  1584. 678.42 s [Cabal] hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:81)
  1585. 678.42 s [Cabal] BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
  1586. 678.42 s [Cabal] emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:158)
  1587. 678.42 s [Cabal] defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:65)
  1588. 678.42 s [Cabal] buildCommand (src/Distribution/Simple/Setup/Build.hs:78)
  1589. 678.42 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  1590. 678.42 s [Cabal] ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
  1591. 678.42 s [Cabal] defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:77)
  1592. 678.42 s [Cabal] replCommand (src/Distribution/Simple/Setup/Repl.hs:95)
  1593. 678.42 s [Cabal] ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
  1594. 678.42 s [Cabal] CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
  1595. 678.42 s [Cabal] emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:90)
  1596. 678.42 s [Cabal] defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:54)
  1597. 678.42 s [Cabal] cleanCommand (src/Distribution/Simple/Setup/Clean.hs:63)
  1598. 678.42 s [Cabal] emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:188)
  1599. 678.42 s [Cabal] defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:61)
  1600. 678.42 s [Cabal] registerCommand (src/Distribution/Simple/Setup/Register.hs:75)
  1601. 678.42 s [Cabal] unregisterCommand (src/Distribution/Simple/Setup/Register.hs:142)
  1602. 678.42 s [Cabal] emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:106)
  1603. 678.42 s [Cabal] defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:53)
  1604. 678.42 s [Cabal] sdistCommand (src/Distribution/Simple/Setup/SDist.hs:63)
  1605. 678.42 s [Cabal] TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
  1606. 678.42 s [Cabal] emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:247)
  1607. 678.42 s [Cabal] defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:100)
  1608. 678.42 s [Cabal] testCommand (src/Distribution/Simple/Setup/Test.hs:114)
  1609. 678.42 s [Cabal] TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
  1610. 678.42 s [Cabal] BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
  1611. 678.42 s [Cabal] emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:124)
  1612. 678.42 s [Cabal] defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:56)
  1613. 678.42 s [Cabal] benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:64)
  1614. 678.42 s [Cabal] configureOptions (src/Distribution/Simple/Setup/Config.hs:403)
  1615. 678.42 s [Cabal] configureCCompiler (src/Distribution/Simple/Setup/Common.hs:327)
  1616. 678.42 s [Cabal] configureLinker (src/Distribution/Simple/Setup/Common.hs:330)
  1617. 678.42 s [Cabal] buildOptions (src/Distribution/Simple/Setup/Build.hs:129)
  1618. 678.42 s [Cabal] haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:184)
  1619. 678.42 s [Cabal] haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:484)
  1620. 678.42 s [Cabal] installDirsOptions (src/Distribution/Simple/Setup/Config.hs:920)
  1621. 678.42 s [Cabal] testOptions' (src/Distribution/Simple/Setup/Test.hs:134)
  1622. 678.42 s [Cabal] benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:84)
  1623. 678.42 s [Cabal] programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:105)
  1624. 678.42 s [Cabal] replOptions (src/Distribution/Simple/Setup/Repl.hs:183)
  1625. 678.42 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
  1626. 678.42 s [Cabal] optionDistPref (src/Distribution/Simple/Setup/Common.hs:255)
  1627. 678.42 s [Cabal] boolOpt (src/Distribution/Simple/Setup/Common.hs:228)
  1628. 678.42 s [Cabal] boolOpt' (src/Distribution/Simple/Setup/Common.hs:234)
  1629. 678.42 s [Cabal] trueArg (src/Distribution/Simple/Setup/Common.hs:237)
  1630. 678.42 s [Cabal] falseArg (src/Distribution/Simple/Setup/Common.hs:238)
  1631. 678.42 s [Cabal] optionVerbosity (src/Distribution/Simple/Setup/Common.hs:275)
  1632. 678.42 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
  1633. 678.42 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
  1634. 678.42 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1635. 678.42 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1636. 678.42 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1637. 678.42 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1638. 678.42 s [Cabal] by specifying the type/value namespace explicitly.
  1639. 678.42 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1640. 678.42 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  1641. 678.42 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  1642. 678.42 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  1643. 678.42 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1644. 678.42 s [Cabal] by specifying the type/value namespace explicitly.
  1645. 678.42 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  1646. 678.42 s [Cabal] Warning: 'Library' is out of scope.
  1647. 678.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1648. 678.42 s [Cabal] 81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
  1649. 678.42 s [Cabal] Missing documentation for:
  1650. 678.42 s [Cabal] Module header
  1651. 678.42 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
  1652. 678.42 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
  1653. 678.42 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1654. 678.42 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1655. 678.42 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1656. 678.42 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1657. 678.42 s [Cabal] by specifying the type/value namespace explicitly.
  1658. 678.42 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1659. 678.42 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  1660. 678.42 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  1661. 678.42 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  1662. 678.42 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1663. 678.42 s [Cabal] by specifying the type/value namespace explicitly.
  1664. 678.42 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  1665. 678.42 s [Cabal] Warning: 'matchExactly' is out of scope.
  1666. 678.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1667. 678.42 s [Cabal] Warning: 'ambiguousWith' is out of scope.
  1668. 678.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1669. 678.42 s [Cabal] Warning: 'shadows' is out of scope.
  1670. 678.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1671. 678.43 s [Cabal] 57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
  1672. 678.43 s [Cabal] Missing documentation for:
  1673. 678.43 s [Cabal] QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
  1674. 678.43 s [Cabal] buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:136)
  1675. 678.43 s [Cabal] readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:183)
  1676. 678.43 s [Cabal] showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:255)
  1677. 678.43 s [Cabal] UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
  1678. 678.43 s [Cabal] reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:247)
  1679. 678.43 s [Cabal] BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
  1680. 678.43 s [Cabal] reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:397)
  1681. 678.43 s [Cabal] Warning: 'lib' is out of scope.
  1682. 678.43 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1683. 678.43 s [Cabal] Warning: 'C' is out of scope.
  1684. 678.43 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1685. 678.43 s [Cabal] 58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
  1686. 678.43 s [Cabal] Missing documentation for:
  1687. 678.43 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
  1688. 678.43 s [Cabal] srcPref (src/Distribution/Simple/BuildPaths.hs:74)
  1689. 678.43 s [Cabal] hscolourPref (src/Distribution/Simple/BuildPaths.hs:77)
  1690. 678.43 s [Cabal] cppHeaderName (src/Distribution/Simple/BuildPaths.hs:108)
  1691. 678.43 s [Cabal] haddockName (src/Distribution/Simple/BuildPaths.hs:129)
  1692. 678.43 s [Cabal] mkLibName (src/Distribution/Simple/BuildPaths.hs:220)
  1693. 678.43 s [Cabal] mkProfLibName (src/Distribution/Simple/BuildPaths.hs:223)
  1694. 678.43 s [Cabal] mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:238)
  1695. 678.43 s [Cabal] mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:244)
  1696. 678.43 s [Cabal] getSourceFiles (src/Distribution/Simple/BuildPaths.hs:191)
  1697. 678.43 s [Cabal] getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:140)
  1698. 678.43 s [Cabal] getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:157)
  1699. 678.43 s [Cabal] getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:176)
  1700. 678.43 s [Cabal] 12% ( 1 / 8) in 'Distribution.Simple.UHC'
  1701. 678.43 s [Cabal] Missing documentation for:
  1702. 678.43 s [Cabal] configure (src/Distribution/Simple/UHC.hs:64)
  1703. 678.43 s [Cabal] getInstalledPackages (src/Distribution/Simple/UHC.hs:118)
  1704. 678.43 s [Cabal] buildLib (src/Distribution/Simple/UHC.hs:208)
  1705. 678.43 s [Cabal] buildExe (src/Distribution/Simple/UHC.hs:242)
  1706. 678.43 s [Cabal] installLib (src/Distribution/Simple/UHC.hs:324)
  1707. 678.43 s [Cabal] registerPackage (src/Distribution/Simple/UHC.hs:350)
  1708. 678.43 s [Cabal] inplacePackageDbPath (src/Distribution/Simple/UHC.hs:365)
  1709. 678.43 s [Cabal] 0% ( 0 / 13) in 'Distribution.Simple.HaskellSuite'
  1710. 678.43 s [Cabal] Missing documentation for:
  1711. 678.43 s [Cabal] Module header
  1712. 678.43 s [Cabal] configure (src/Distribution/Simple/HaskellSuite.hs:36)
  1713. 678.43 s [Cabal] hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:93)
  1714. 678.43 s [Cabal] numericVersion (src/Distribution/Simple/HaskellSuite.hs:96)
  1715. 678.43 s [Cabal] getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:99)
  1716. 678.43 s [Cabal] getExtensions (src/Distribution/Simple/HaskellSuite.hs:113)
  1717. 678.43 s [Cabal] getLanguages (src/Distribution/Simple/HaskellSuite.hs:121)
  1718. 678.43 s [Cabal] getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:135)
  1719. 678.43 s [Cabal] buildLib (src/Distribution/Simple/HaskellSuite.hs:173)
  1720. 678.43 s [Cabal] installLib (src/Distribution/Simple/HaskellSuite.hs:224)
  1721. 678.43 s [Cabal] registerPackage (src/Distribution/Simple/HaskellSuite.hs:245)
  1722. 678.43 s [Cabal] initPackageDB (src/Distribution/Simple/HaskellSuite.hs:257)
  1723. 678.43 s [Cabal] packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:265)
  1724. 678.43 s [Cabal] Warning: 'Arch' is ambiguous. It is defined
  1725. 678.43 s [Cabal] * in ‘Distribution.System’
  1726. 678.43 s [Cabal] * in ‘Distribution.Types.ConfVar’
  1727. 678.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1728. 678.43 s [Cabal] by specifying the type/value namespace explicitly.
  1729. 678.43 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1730. 678.43 s [Cabal] Warning: 'OS' is ambiguous. It is defined
  1731. 678.43 s [Cabal] * in ‘Distribution.System’
  1732. 678.43 s [Cabal] * in ‘Distribution.Types.ConfVar’
  1733. 678.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1734. 678.43 s [Cabal] by specifying the type/value namespace explicitly.
  1735. 678.43 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1736. 678.43 s [Cabal] Warning: 'Platform' is ambiguous. It is defined
  1737. 678.43 s [Cabal] * in ‘Distribution.System’
  1738. 678.43 s [Cabal] * in ‘Distribution.System’
  1739. 678.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1740. 678.43 s [Cabal] by specifying the type/value namespace explicitly.
  1741. 678.43 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1742. 678.44 s [Cabal] Warning: 'hsLibraries' is out of scope.
  1743. 678.44 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1744. 678.44 s [Cabal] Warning: 'BuildSources' is ambiguous. It is defined
  1745. 678.44 s [Cabal] * at src/Distribution/Simple/GHCJS.hs:1105:21
  1746. 678.44 s [Cabal] * at src/Distribution/Simple/GHCJS.hs:1105:1
  1747. 678.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1748. 678.44 s [Cabal] by specifying the type/value namespace explicitly.
  1749. 678.44 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/GHCJS.hs:1105:1
  1750. 678.44 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1751. 678.44 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1752. 678.44 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1753. 678.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1754. 678.44 s [Cabal] by specifying the type/value namespace explicitly.
  1755. 678.44 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1756. 678.44 s [Cabal] 52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
  1757. 678.44 s [Cabal] Missing documentation for:
  1758. 678.44 s [Cabal] Module header
  1759. 678.44 s [Cabal] getGhcInfo (src/Distribution/Simple/GHCJS.hs:308)
  1760. 678.44 s [Cabal] configure (src/Distribution/Simple/GHCJS.hs:117)
  1761. 678.44 s [Cabal] buildLib (src/Distribution/Simple/GHCJS.hs:463)
  1762. 678.44 s [Cabal] replLib (src/Distribution/Simple/GHCJS.hs:474)
  1763. 678.44 s [Cabal] replFLib (src/Distribution/Simple/GHCJS.hs:891)
  1764. 678.44 s [Cabal] replExe (src/Distribution/Simple/GHCJS.hs:914)
  1765. 678.44 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1968)
  1766. 678.44 s [Cabal] registerPackage (src/Distribution/Simple/GHCJS.hs:1992)
  1767. 678.44 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1780)
  1768. 678.44 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
  1769. 678.44 s [Cabal] getLibDir (src/Distribution/Simple/GHCJS.hs:355)
  1770. 678.44 s [Cabal] isDynamic (src/Distribution/Simple/GHCJS.hs:1948)
  1771. 678.44 s [Cabal] pkgRoot (src/Distribution/Simple/GHCJS.hs:2001)
  1772. 678.44 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
  1773. 678.44 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
  1774. 678.44 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  1775. 678.44 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
  1776. 678.44 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1777. 678.44 s [Cabal] * in ‘Distribution.Types.Executable’
  1778. 678.44 s [Cabal] * in ‘Distribution.Types.Executable’
  1779. 678.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1780. 678.44 s [Cabal] by specifying the type/value namespace explicitly.
  1781. 678.44 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1782. 678.44 s [Cabal] Warning: 'TestSuite' is ambiguous. It is defined
  1783. 678.44 s [Cabal] * in ‘Distribution.Types.TestSuite’
  1784. 678.44 s [Cabal] * in ‘Distribution.Types.TestSuite’
  1785. 678.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1786. 678.44 s [Cabal] by specifying the type/value namespace explicitly.
  1787. 678.44 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.TestSuite’
  1788. 678.44 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  1789. 678.44 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1790. 678.44 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1791. 678.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1792. 678.44 s [Cabal] by specifying the type/value namespace explicitly.
  1793. 678.44 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  1794. 678.45 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1795. 678.45 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1796. 678.45 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1797. 678.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1798. 678.45 s [Cabal] by specifying the type/value namespace explicitly.
  1799. 678.45 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1800. 678.45 s [Cabal] Warning: 'GhcOptions' is ambiguous. It is defined
  1801. 678.45 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:19
  1802. 678.45 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:1
  1803. 678.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1804. 678.45 s [Cabal] by specifying the type/value namespace explicitly.
  1805. 678.45 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
  1806. 678.45 s [Cabal] Warning: 'PreBuildComponentRules' is out of scope.
  1807. 678.45 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1808. 678.45 s [Cabal] Warning: 'GhcOptions' is ambiguous. It is defined
  1809. 678.45 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:19
  1810. 678.45 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:1
  1811. 678.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1812. 678.45 s [Cabal] by specifying the type/value namespace explicitly.
  1813. 678.45 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
  1814. 678.45 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1815. 678.45 s [Cabal] * in ‘Distribution.Types.Executable’
  1816. 678.45 s [Cabal] * in ‘Distribution.Types.Executable’
  1817. 678.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1818. 678.45 s [Cabal] by specifying the type/value namespace explicitly.
  1819. 678.45 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1820. 678.45 s [Cabal] Warning: 'hsLibraries' is out of scope.
  1821. 678.45 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1822. 678.45 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1823. 678.45 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1824. 678.45 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1825. 678.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1826. 678.45 s [Cabal] by specifying the type/value namespace explicitly.
  1827. 678.45 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1828. 678.46 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  1829. 678.46 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  1830. 678.46 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  1831. 678.46 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1832. 678.46 s [Cabal] by specifying the type/value namespace explicitly.
  1833. 678.46 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  1834. 678.46 s [Cabal] 55% ( 21 / 38) in 'Distribution.Simple.GHC'
  1835. 678.46 s [Cabal] Missing documentation for:
  1836. 678.46 s [Cabal] getGhcInfo (src/Distribution/Simple/GHC.hs:387)
  1837. 678.46 s [Cabal] configure (src/Distribution/Simple/GHC.hs:155)
  1838. 678.46 s [Cabal] getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:545)
  1839. 678.46 s [Cabal] buildLib (src/Distribution/Simple/GHC.hs:578)
  1840. 678.46 s [Cabal] replLib (src/Distribution/Simple/GHC.hs:590)
  1841. 678.46 s [Cabal] replFLib (src/Distribution/Simple/GHC.hs:636)
  1842. 678.46 s [Cabal] replExe (src/Distribution/Simple/GHC.hs:661)
  1843. 678.46 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHC.hs:960)
  1844. 678.46 s [Cabal] registerPackage (src/Distribution/Simple/GHC.hs:984)
  1845. 678.46 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:522)
  1846. 678.46 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
  1847. 678.46 s [Cabal] getLibDir (src/Distribution/Simple/GHC.hs:451)
  1848. 678.46 s [Cabal] pkgRoot (src/Distribution/Simple/GHC.hs:993)
  1849. 678.46 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
  1850. 678.46 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
  1851. 678.46 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  1852. 678.46 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
  1853. 678.47 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.ShowBuildInfo'
  1854. 678.47 s [Cabal] Missing documentation for:
  1855. 678.47 s [Cabal] mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:134)
  1856. 678.47 s [Cabal] mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:142)
  1857. 678.47 s [Cabal] Warning: 'register' is out of scope.
  1858. 678.47 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1859. 678.47 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Install'
  1860. 678.47 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Build.PathsModule'
  1861. 678.47 s [Cabal] Missing documentation for:
  1862. 678.47 s [Cabal] generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:42)
  1863. 678.47 s [Cabal] Warning: 'TestSuite' is out of scope.
  1864. 678.47 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1865. 678.47 s [Cabal] Warning: 'TestSuiteLog' is ambiguous. It is defined
  1866. 678.47 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:21
  1867. 678.47 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:1
  1868. 678.47 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1869. 678.47 s [Cabal] by specifying the type/value namespace explicitly.
  1870. 678.47 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
  1871. 678.47 s [Cabal] Warning: 'Test' is ambiguous. It is defined
  1872. 678.47 s [Cabal] * at src/Distribution/TestSuite.hs:79:5
  1873. 678.47 s [Cabal] * at src/Distribution/TestSuite.hs:78:1
  1874. 678.47 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1875. 678.47 s [Cabal] by specifying the type/value namespace explicitly.
  1876. 678.47 s [Cabal] Defaulting to the one defined at src/Distribution/TestSuite.hs:78:1
  1877. 678.47 s [Cabal] 75% ( 6 / 8) in 'Distribution.Simple.Test.LibV09'
  1878. 678.47 s [Cabal] Missing documentation for:
  1879. 678.47 s [Cabal] Module header
  1880. 678.47 s [Cabal] runTest (src/Distribution/Simple/Test/LibV09.hs:65)
  1881. 678.47 s [Cabal] 0% ( 0 / 2) in 'Distribution.Simple.Test.ExeV10'
  1882. 678.47 s [Cabal] Missing documentation for:
  1883. 678.47 s [Cabal] Module header
  1884. 678.47 s [Cabal] runTest (src/Distribution/Simple/Test/ExeV10.hs:59)
  1885. 678.47 s [Cabal] Warning: 'dist' is out of scope.
  1886. 678.47 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1887. 678.47 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1888. 678.47 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1889. 678.47 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1890. 678.47 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1891. 678.47 s [Cabal] by specifying the type/value namespace explicitly.
  1892. 678.47 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1893. 678.47 s [Cabal] Warning: 'CheckPackageContentOps' is ambiguous. It is defined
  1894. 678.47 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
  1895. 678.47 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1896. 678.48 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1897. 678.48 s [Cabal] by specifying the type/value namespace explicitly.
  1898. 678.48 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1899. 678.48 s [Cabal] Warning: 'GenericPackageDescription' is ambiguous. It is defined
  1900. 678.48 s [Cabal] * in ‘Distribution.Types.GenericPackageDescription’
  1901. 678.48 s [Cabal] * in ‘Distribution.Types.GenericPackageDescription’
  1902. 678.48 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1903. 678.48 s [Cabal] by specifying the type/value namespace explicitly.
  1904. 678.48 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.GenericPackageDescription’
  1905. 678.48 s [Cabal] 89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
  1906. 678.48 s [Cabal] Missing documentation for:
  1907. 678.48 s [Cabal] CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
  1908. 678.48 s [Cabal] ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:597)
  1909. 678.48 s [Cabal] 66% ( 4 / 6) in 'Distribution.Make'
  1910. 678.48 s [Cabal] Missing documentation for:
  1911. 678.48 s [Cabal] defaultMain (src/Distribution/Make.hs:85)
  1912. 678.48 s [Cabal] defaultMainArgs (src/Distribution/Make.hs:88)
  1913. 678.48 s [Cabal] Warning: 'sleepFileTimeCalibrate' is out of scope.
  1914. 678.48 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1915. 678.48 s [Cabal] Warning: 'ModTime' is ambiguous. It is defined
  1916. 678.48 s [Cabal] * at src/Distribution/Compat/Time.hs:60:19
  1917. 678.48 s [Cabal] * at src/Distribution/Compat/Time.hs:60:1
  1918. 678.48 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1919. 678.48 s [Cabal] by specifying the type/value namespace explicitly.
  1920. 678.48 s [Cabal] Defaulting to the one defined at src/Distribution/Compat/Time.hs:60:1
  1921. 678.48 s [Cabal] 85% ( 6 / 7) in 'Distribution.Compat.Time'
  1922. 678.48 s [Cabal] Missing documentation for:
  1923. 678.48 s [Cabal] Module header
  1924. 678.49 s [Cabal] Warning: 'ReadyComponent' is ambiguous. It is defined
  1925. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:55:23
  1926. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:55:1
  1927. 678.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1928. 678.49 s [Cabal] by specifying the type/value namespace explicitly.
  1929. 678.49 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:55:1
  1930. 678.49 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  1931. 678.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1932. 678.49 s [Cabal] Warning: 'LinkedComponent' is ambiguous. It is defined
  1933. 678.49 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:24
  1934. 678.49 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1935. 678.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1936. 678.49 s [Cabal] by specifying the type/value namespace explicitly.
  1937. 678.49 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1938. 678.49 s [Cabal] Warning: 'improveUnitId' is out of scope.
  1939. 678.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1940. 678.49 s [Cabal] Warning: 'HashedUnitId' is out of scope.
  1941. 678.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1942. 678.49 s [Cabal] Warning: 'IndefiniteComponent' is ambiguous. It is defined
  1943. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:110:28
  1944. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:110:1
  1945. 678.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1946. 678.49 s [Cabal] by specifying the type/value namespace explicitly.
  1947. 678.49 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:110:1
  1948. 678.49 s [Cabal] Warning: 'InstantiatedComponent' is ambiguous. It is defined
  1949. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:93:30
  1950. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:93:1
  1951. 678.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1952. 678.49 s [Cabal] by specifying the type/value namespace explicitly.
  1953. 678.49 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:93:1
  1954. 678.49 s [Cabal] Warning: 'componentPackageDeps' is out of scope.
  1955. 678.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1956. 678.49 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  1957. 678.49 s [Cabal] * in ‘Distribution.Backpack’
  1958. 678.49 s [Cabal] * in ‘Distribution.Backpack’
  1959. 678.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1960. 678.49 s [Cabal] by specifying the type/value namespace explicitly.
  1961. 678.49 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  1962. 678.49 s [Cabal] Warning: 'InstM' is ambiguous. It is defined
  1963. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:205:19
  1964. 678.49 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:205:1
  1965. 678.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1966. 678.49 s [Cabal] by specifying the type/value namespace explicitly.
  1967. 678.49 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:205:1
  1968. 678.49 s [Cabal] Warning: 'MungedPackageId' is ambiguous. It is defined
  1969. 678.49 s [Cabal] * in ‘Distribution.Types.MungedPackageId’
  1970. 678.49 s [Cabal] * in ‘Distribution.Types.MungedPackageId’
  1971. 678.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1972. 678.49 s [Cabal] by specifying the type/value namespace explicitly.
  1973. 678.49 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.MungedPackageId’
  1974. 678.49 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.Configure'
  1975. 678.49 s [Cabal] Missing documentation for:
  1976. 678.49 s [Cabal] configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:79)
  1977. 678.49 s [Cabal] Warning: 'OpenModule' is out of scope.
  1978. 678.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1979. 678.49 s [Cabal] Warning: 'Module' is out of scope.
  1980. 678.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1981. 678.49 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.DescribeUnitId'
  1982. 678.49 s [Cabal] Missing documentation for:
  1983. 678.49 s [Cabal] Module header
  1984. 678.49 s [Cabal] 52% ( 9 / 17) in 'Distribution.Simple.Register'
  1985. 678.49 s [Cabal] Missing documentation for:
  1986. 678.49 s [Cabal] register (src/Distribution/Simple/Register.hs:99)
  1987. 678.49 s [Cabal] unregister (src/Distribution/Simple/Register.hs:703)
  1988. 678.49 s [Cabal] internalPackageDBPath (src/Distribution/Simple/Register.hs:738)
  1989. 678.49 s [Cabal] initPackageDB (src/Distribution/Simple/Register.hs:355)
  1990. 678.49 s [Cabal] doesPackageDBExist (src/Distribution/Simple/Register.hs:375)
  1991. 678.49 s [Cabal] deletePackageDB (src/Distribution/Simple/Register.hs:383)
  1992. 678.49 s [Cabal] registerPackage (src/Distribution/Simple/Register.hs:430)
  1993. 678.49 s [Cabal] generateRegistrationInfo (src/Distribution/Simple/Register.hs:261)
  1994. 678.50 s [Cabal] Warning: 'PreProcessor' is ambiguous. It is defined
  1995. 678.50 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:21
  1996. 678.50 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:1
  1997. 678.50 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1998. 678.50 s [Cabal] by specifying the type/value namespace explicitly.
  1999. 678.50 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
  2000. 678.50 s [Cabal] Warning: 'Suffix' is ambiguous. It is defined
  2001. 678.50 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:101:18
  2002. 678.50 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:101:1
  2003. 678.50 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2004. 678.50 s [Cabal] by specifying the type/value namespace explicitly.
  2005. 678.50 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:101:1
  2006. 678.50 s [Cabal] 40% ( 9 / 22) in 'Distribution.Simple.PreProcess'
  2007. 678.50 s [Cabal] Missing documentation for:
  2008. 678.50 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
  2009. 678.50 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
  2010. 678.50 s [Cabal] mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:109)
  2011. 678.50 s [Cabal] runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:124)
  2012. 678.50 s [Cabal] ppCpp (src/Distribution/Simple/PreProcess.hs:407)
  2013. 678.50 s [Cabal] ppCpp' (src/Distribution/Simple/PreProcess.hs:410)
  2014. 678.50 s [Cabal] ppGreenCard (src/Distribution/Simple/PreProcess.hs:382)
  2015. 678.50 s [Cabal] ppC2hs (src/Distribution/Simple/PreProcess.hs:651)
  2016. 678.50 s [Cabal] ppHsc2hs (src/Distribution/Simple/PreProcess.hs:476)
  2017. 678.50 s [Cabal] ppHappy (src/Distribution/Simple/PreProcess.hs:813)
  2018. 678.50 s [Cabal] ppAlex (src/Distribution/Simple/PreProcess.hs:822)
  2019. 678.50 s [Cabal] ppUnlit (src/Distribution/Simple/PreProcess.hs:397)
  2020. 678.50 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:720)
  2021. 678.50 s [Cabal] Warning: 'UserHooks' is ambiguous. It is defined
  2022. 678.50 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:18
  2023. 678.50 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:1
  2024. 678.50 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2025. 678.50 s [Cabal] by specifying the type/value namespace explicitly.
  2026. 678.50 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
  2027. 678.50 s [Cabal] 75% ( 3 / 4) in 'Distribution.Simple.UserHooks'
  2028. 678.50 s [Cabal] Missing documentation for:
  2029. 678.50 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  2030. 678.50 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Bench'
  2031. 678.51 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  2032. 678.51 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  2033. 678.51 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  2034. 678.51 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2035. 678.51 s [Cabal] by specifying the type/value namespace explicitly.
  2036. 678.51 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  2037. 678.51 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2038. 678.51 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2039. 678.51 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2040. 678.51 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2041. 678.51 s [Cabal] by specifying the type/value namespace explicitly.
  2042. 678.51 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2043. 678.51 s [Cabal] Warning: 'ConfigFlags' is ambiguous. It is defined
  2044. 678.51 s [Cabal] * at src/Distribution/Simple/Setup/Config.hs:78:20
  2045. 678.51 s [Cabal] * at src/Distribution/Simple/Setup/Config.hs:78:1
  2046. 678.51 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2047. 678.51 s [Cabal] by specifying the type/value namespace explicitly.
  2048. 678.51 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Setup/Config.hs:78:1
  2049. 678.51 s [Cabal] Warning: 'UserHooks' is out of scope.
  2050. 678.51 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2051. 678.51 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  2052. 678.51 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  2053. 678.51 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  2054. 678.51 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2055. 678.51 s [Cabal] by specifying the type/value namespace explicitly.
  2056. 678.51 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  2057. 678.52 s [Cabal] 85% ( 23 / 27) in 'Distribution.Simple.Configure'
  2058. 678.52 s [Cabal] Missing documentation for:
  2059. 678.52 s [Cabal] configCompilerEx (src/Distribution/Simple/Configure.hs:2274)
  2060. 678.52 s [Cabal] configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2258)
  2061. 678.52 s [Cabal] checkForeignDeps (src/Distribution/Simple/Configure.hs:2293)
  2062. 678.52 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:720)
  2063. 678.52 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Test'
  2064. 678.52 s [Cabal] Warning: 'die' is out of scope.
  2065. 678.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2066. 678.52 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  2067. 678.52 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2068. 678.52 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2069. 678.52 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2070. 678.52 s [Cabal] by specifying the type/value namespace explicitly.
  2071. 678.52 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  2072. 678.52 s [Cabal] Warning: 'errorPrefix' is out of scope.
  2073. 678.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2074. 678.52 s [Cabal] 100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
  2075. 678.52 s [Cabal] Warning: 'autogenComponentsModuleDir' is out of scope.
  2076. 678.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2077. 678.53 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  2078. 678.53 s [Cabal] * in ‘Distribution.Types.Benchmark’
  2079. 678.53 s [Cabal] * in ‘Distribution.Types.Benchmark’
  2080. 678.53 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2081. 678.53 s [Cabal] by specifying the type/value namespace explicitly.
  2082. 678.53 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  2083. 678.53 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2084. 678.53 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2085. 678.53 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2086. 678.53 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2087. 678.53 s [Cabal] by specifying the type/value namespace explicitly.
  2088. 678.53 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2089. 678.53 s [Cabal] Warning: 'TestSuite' is ambiguous. It is defined
  2090. 678.53 s [Cabal] * in ‘Distribution.Types.TestSuite’
  2091. 678.53 s [Cabal] * in ‘Distribution.Types.TestSuite’
  2092. 678.53 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2093. 678.53 s [Cabal] by specifying the type/value namespace explicitly.
  2094. 678.53 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.TestSuite’
  2095. 678.53 s [Cabal] 88% ( 15 / 17) in 'Distribution.Simple.Build'
  2096. 678.53 s [Cabal] Missing documentation for:
  2097. 678.53 s [Cabal] repl (src/Distribution/Simple/Build.hs:278)
  2098. 678.53 s [Cabal] AutogenFile (src/Distribution/Simple/Build.hs:1078)
  2099. 678.53 s [Cabal] Warning: 'Haddock' is out of scope.
  2100. 678.53 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2101. 678.53 s [Cabal] Warning: 'HaddocksFlags' is out of scope.
  2102. 678.53 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2103. 678.53 s [Cabal] Warning: 'haddocks' is out of scope.
  2104. 678.53 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2105. 678.53 s [Cabal] 66% ( 4 / 6) in 'Distribution.Simple.Haddock'
  2106. 678.53 s [Cabal] Missing documentation for:
  2107. 678.53 s [Cabal] haddock (src/Distribution/Simple/Haddock.hs:213)
  2108. 678.53 s [Cabal] hscolour (src/Distribution/Simple/Haddock.hs:1125)
  2109. 678.53 s [Cabal] Warning: 'UserHooks' is ambiguous. It is defined
  2110. 678.53 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:18
  2111. 678.53 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:1
  2112. 678.53 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2113. 678.53 s [Cabal] by specifying the type/value namespace explicitly.
  2114. 678.53 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
  2115. 678.54 s [Cabal] 95% ( 20 / 21) in 'Distribution.Simple'
  2116. 678.54 s [Cabal] Missing documentation for:
  2117. 678.54 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  2118. 679.17 s [Cabal] Warning: Distribution.Backpack.FullUnitId: could not find link destinations for:
  2119. 679.17 s [Cabal] - Distribution.Backpack.FullUnitId.Rep_FullUnitId
  2120. 679.17 s [Cabal] Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
  2121. 679.17 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2122. 679.17 s [Cabal] - Distribution.Utils.Structured.Tagged
  2123. 679.17 s [Cabal] - Distribution.Backpack.ModuleShape.Rep_ModuleShape
  2124. 679.17 s [Cabal] Warning: Distribution.Backpack.PreModuleShape: could not find link destinations for:
  2125. 679.17 s [Cabal] - Distribution.Backpack.PreModuleShape.Rep_PreModuleShape
  2126. 679.17 s [Cabal] Warning: Distribution.Compat.Stack: could not find link destinations for:
  2127. 679.17 s [Cabal] - GHC.Internal.IsList.D:R:ItemCallStack
  2128. 679.17 s [Cabal] Warning: Distribution.ReadE: could not find link destinations for:
  2129. 679.17 s [Cabal] - Distribution.ReadE.ErrorMsg
  2130. 679.18 s [Cabal] Warning: Distribution.Simple.Flag: could not find link destinations for:
  2131. 679.18 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2132. 679.18 s [Cabal] - Distribution.Utils.Structured.Tagged
  2133. 679.18 s [Cabal] - Distribution.Simple.Flag.Rep_Flag
  2134. 679.18 s [Cabal] Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
  2135. 679.18 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2136. 679.18 s [Cabal] - Distribution.Utils.Structured.Tagged
  2137. 679.18 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathComponent
  2138. 679.18 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2139. 679.18 s [Cabal] Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
  2140. 679.18 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2141. 679.18 s [Cabal] - Distribution.Utils.Structured.Tagged
  2142. 679.18 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2143. 679.18 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2144. 679.18 s [Cabal] - Distribution.Simple.InstallDirs.Rep_InstallDirs
  2145. 679.18 s [Cabal] - Distribution.Simple.InstallDirs.Rep_PathTemplate
  2146. 679.19 s [Cabal] Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
  2147. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2148. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2149. 679.19 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
  2150. 679.19 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
  2151. 679.19 s [Cabal] Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
  2152. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2153. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2154. 679.19 s [Cabal] - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
  2155. 679.19 s [Cabal] Warning: Distribution.Types.GivenComponent: could not find link destinations for:
  2156. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2157. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2158. 679.19 s [Cabal] - Distribution.Types.GivenComponent.Rep_GivenComponent
  2159. 679.19 s [Cabal] Warning: Distribution.Types.TargetInfo: could not find link destinations for:
  2160. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2161. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2162. 679.19 s [Cabal] - Distribution.Types.TargetInfo.Rep_TargetInfo
  2163. 679.19 s [Cabal] - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
  2164. 679.19 s [Cabal] Warning: Distribution.Verbosity.Internal: could not find link destinations for:
  2165. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2166. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2167. 679.19 s [Cabal] - Distribution.Verbosity.Internal.Rep_VerbosityFlag
  2168. 679.19 s [Cabal] - Distribution.Verbosity.Internal.Rep_VerbosityLevel
  2169. 679.19 s [Cabal] Warning: Distribution.Verbosity: could not find link destinations for:
  2170. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2171. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2172. 679.19 s [Cabal] - Distribution.Verbosity.Rep_Verbosity
  2173. 679.19 s [Cabal] Warning: Distribution.Simple.Program.Types: could not find link destinations for:
  2174. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2175. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2176. 679.19 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramLocation
  2177. 679.19 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2178. 679.19 s [Cabal] - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
  2179. 679.19 s [Cabal] Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
  2180. 679.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2181. 679.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2182. 679.19 s [Cabal] - Distribution.Simple.PreProcess.Types.Rep_Suffix
  2183. 679.25 s [Cabal] Warning: Distribution.Simple.Utils: could not find link destinations for:
  2184. 679.25 s [Cabal] - Distribution.Simple.Utils.withMetadata
  2185. 679.25 s [Cabal] Warning: Distribution.Utils.NubList: could not find link destinations for:
  2186. 679.25 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2187. 679.25 s [Cabal] - Distribution.Utils.Structured.Tagged
  2188. 679.25 s [Cabal] - Distribution.Utils.NubList.Rep_NubList
  2189. 679.25 s [Cabal] Warning: Distribution.Utils.LogProgress: could not find link destinations for:
  2190. 679.25 s [Cabal] - Distribution.Utils.LogProgress.CtxMsg
  2191. 679.25 s [Cabal] Warning: Distribution.Simple.Program.Find: could not find link destinations for:
  2192. 679.25 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2193. 679.25 s [Cabal] - Distribution.Utils.Structured.Tagged
  2194. 679.25 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2195. 679.25 s [Cabal] - Distribution.Simple.Program.Find.findExecutable
  2196. 679.25 s [Cabal] Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
  2197. 679.25 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2198. 679.25 s [Cabal] - Distribution.Utils.Structured.Tagged
  2199. 679.25 s [Cabal] - Distribution.Simple.PackageIndex.Rep_PackageIndex
  2200. 679.25 s [Cabal] - Distribution.Simple.PackageIndex.DepUniqueKey
  2201. 679.25 s [Cabal] Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
  2202. 679.25 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2203. 679.25 s [Cabal] - Distribution.Utils.Structured.Tagged
  2204. 679.25 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_GlobPiece
  2205. 679.25 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_Glob
  2206. 679.25 s [Cabal] Warning: Distribution.Simple.Glob: could not find link destinations for:
  2207. 679.25 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2208. 679.25 s [Cabal] - Distribution.Utils.Structured.Tagged
  2209. 679.25 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_Glob
  2210. 679.26 s [Cabal] Warning: Distribution.Simple.Compiler: could not find link destinations for:
  2211. 679.26 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2212. 679.26 s [Cabal] - Distribution.Utils.Structured.Tagged
  2213. 679.26 s [Cabal] - Distribution.Simple.Compiler.Rep_DebugInfoLevel
  2214. 679.26 s [Cabal] - Distribution.Simple.Compiler.Rep_OptimisationLevel
  2215. 679.26 s [Cabal] - Distribution.Simple.Compiler.Rep_PackageDB
  2216. 679.26 s [Cabal] - Distribution.Simple.Compiler.Rep_ProfDetailLevel
  2217. 679.26 s [Cabal] - Distribution.Simple.Compiler.Rep_Compiler
  2218. 679.26 s [Cabal] Warning: Distribution.Simple.Program.GHC: could not find link destinations for:
  2219. 679.26 s [Cabal] - Distribution.Simple.Program.GHC.Rep_GhcOptions
  2220. 679.27 s [Cabal] Warning: Distribution.Simple.Program.Db: could not find link destinations for:
  2221. 679.27 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2222. 679.27 s [Cabal] - Distribution.Utils.Structured.Tagged
  2223. 679.27 s [Cabal] Warning: Distribution.Simple.Program: could not find link destinations for:
  2224. 679.27 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2225. 679.27 s [Cabal] - Distribution.Utils.Structured.Tagged
  2226. 679.27 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramLocation
  2227. 679.27 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2228. 679.27 s [Cabal] - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
  2229. 679.28 s [Cabal] Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
  2230. 679.28 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2231. 679.28 s [Cabal] - Distribution.Utils.Structured.Tagged
  2232. 679.28 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_BuildOptions
  2233. 679.28 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_ComponentBuildDescr
  2234. 679.28 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_LocalBuildConfig
  2235. 679.28 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_LocalBuildDescr
  2236. 679.28 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_PackageBuildDescr
  2237. 679.28 s [Cabal] Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
  2238. 679.28 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2239. 679.28 s [Cabal] - Distribution.Utils.Structured.Tagged
  2240. 679.28 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2241. 679.29 s [Cabal] Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
  2242. 679.29 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2243. 679.29 s [Cabal] - Distribution.Utils.Structured.Tagged
  2244. 679.29 s [Cabal] - Distribution.Types.LibraryName.Rep_LibraryName
  2245. 679.29 s [Cabal] - Distribution.Types.ComponentName.Rep_ComponentName
  2246. 679.29 s [Cabal] - Distribution.Types.ComponentName.NotLibComponentName
  2247. 679.29 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2248. 679.29 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2249. 679.29 s [Cabal] - Distribution.Simple.InstallDirs.Rep_InstallDirs
  2250. 679.29 s [Cabal] - Distribution.Simple.InstallDirs.Rep_PathTemplate
  2251. 679.29 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
  2252. 679.29 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
  2253. 679.29 s [Cabal] - Distribution.Types.Component.Rep_Component
  2254. 679.29 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2255. 679.31 s [Cabal] Warning: Distribution.Simple.Setup: could not find link destinations for:
  2256. 679.31 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2257. 679.31 s [Cabal] - Distribution.Utils.Structured.Tagged
  2258. 679.31 s [Cabal] - Distribution.Simple.Flag.Rep_Flag
  2259. 679.31 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2260. 679.31 s [Cabal] - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
  2261. 679.31 s [Cabal] - Distribution.Simple.Setup.Common.programDbPaths
  2262. 679.31 s [Cabal] - Distribution.Simple.Setup.Test.Rep_TestShowDetails
  2263. 679.31 s [Cabal] - Distribution.Simple.Setup.Test.Rep_TestFlags
  2264. 679.31 s [Cabal] - Distribution.Simple.Setup.SDist.Rep_SDistFlags
  2265. 679.31 s [Cabal] - Distribution.Simple.Setup.Repl.Rep_ReplFlags
  2266. 679.31 s [Cabal] - Distribution.Simple.Setup.Repl.Rep_ReplOptions
  2267. 679.31 s [Cabal] - Distribution.Simple.Setup.Register.Rep_RegisterFlags
  2268. 679.31 s [Cabal] - Distribution.Simple.Setup.Install.Rep_InstallFlags
  2269. 679.31 s [Cabal] - Distribution.Simple.Setup.Hscolour.Rep_HscolourFlags
  2270. 679.31 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockTarget
  2271. 679.31 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockFlags
  2272. 679.31 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockProjectFlags
  2273. 679.31 s [Cabal] - Distribution.Simple.Setup.Global.Rep_GlobalFlags
  2274. 679.31 s [Cabal] - Distribution.Simple.Setup.Copy.Rep_CopyFlags
  2275. 679.31 s [Cabal] - Distribution.Simple.Setup.Config.Rep_ConfigFlags
  2276. 679.31 s [Cabal] - Distribution.Simple.Setup.Clean.Rep_CleanFlags
  2277. 679.31 s [Cabal] - Distribution.Simple.Setup.Build.Rep_BuildFlags
  2278. 679.31 s [Cabal] - Distribution.Simple.Setup.Benchmark.Rep_BenchmarkFlags
  2279. 679.31 s [Cabal] - Distribution.Simple.Setup.Rep_BuildingWhat
  2280. 679.31 s [Cabal] Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
  2281. 679.31 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2282. 679.31 s [Cabal] - Distribution.Utils.Structured.Tagged
  2283. 679.31 s [Cabal] - Distribution.Types.TargetInfo.Rep_TargetInfo
  2284. 679.31 s [Cabal] - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
  2285. 679.31 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2286. 679.31 s [Cabal] - Distribution.Simple.Setup.Rep_BuildingWhat
  2287. 679.31 s [Cabal] Warning: Distribution.Simple.BuildTarget: could not find link destinations for:
  2288. 679.31 s [Cabal] - Distribution.Simple.BuildTarget.Rep_BuildTarget
  2289. 679.32 s [Cabal] Warning: Distribution.PackageDescription.Check: could not find link destinations for:
  2290. 679.32 s [Cabal] - Distribution.PackageDescription.Check.Warning.CEType
  2291. 679.32 s [Cabal] - Distribution.PackageDescription.Check.Warning.WarnLang
  2292. 679.32 s [Cabal] Warning: Distribution.Make: could not find link destinations for:
  2293. 679.32 s [Cabal] - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
  2294. 679.32 s [Cabal] - Distribution.Types.Version.Rep_Version
  2295. 679.32 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2296. 679.32 s [Cabal] - Distribution.Utils.Structured.Tagged
  2297. 679.32 s [Cabal] - Distribution.License.Rep_License
  2298. 679.32 s [Cabal] Warning: Distribution.Compat.Time: could not find link destinations for:
  2299. 679.32 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2300. 679.32 s [Cabal] - Distribution.Utils.Structured.Tagged
  2301. 679.32 s [Cabal] - Distribution.Compat.Time.Rep_ModTime
  2302. 679.32 s [Cabal] Warning: Distribution.Backpack.Configure: could not find link destinations for:
  2303. 679.32 s [Cabal] - Distribution.Backpack.PreExistingComponent.PreExistingComponent
  2304. 679.32 s [Cabal] - Distribution.Backpack.PreExistingComponent.PromisedComponent
  2305. 679.32 s [Cabal] Warning: Distribution.Simple.PreProcess: could not find link destinations for:
  2306. 679.32 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2307. 679.32 s [Cabal] - Distribution.Utils.Structured.Tagged
  2308. 679.32 s [Cabal] - Distribution.Simple.PreProcess.Types.Rep_Suffix
  2309. 691.80 s [Cabal] Documentation created: dist/doc/html/Cabal, dist/doc/html/Cabal/Cabal.txt
  2310. 692.12 s [Cabal] haddockPhase completed in 34 seconds
  2311. 692.12 s [Cabal] Phase: installPhase
  2312. 692.25 s [Cabal] Installing library in /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/Cabal-3.12.1.0-2jXqQK1suaFGEIhnZsPYKX
  2313. 695.43 s [Cabal] Phase: fixupPhase
  2314. 695.46 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0
  2315. 695.46 s [Cabal] shrinking /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSCabal-3.12.1.0-2jXqQK1suaFGEIhnZsPYKX-ghc9.12.2.so
  2316. 695.61 s [Cabal] checking for references to /build/ in /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0...
  2317. 695.78 s [Cabal] patching script interpreter paths in /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0
  2318. 695.79 s [Cabal] stripping (with command strip and flags -S -p) in /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0/lib
  2319. 697.19 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/hvzhd2f1q43b3dn6r667x6h1l7iqk6aa-Cabal-3.12.1.0-doc
  2320. 697.24 s [Cabal] checking for references to /build/ in /nix/store/hvzhd2f1q43b3dn6r667x6h1l7iqk6aa-Cabal-3.12.1.0-doc...
  2321. 697.32 s [Cabal] patching script interpreter paths in /nix/store/hvzhd2f1q43b3dn6r667x6h1l7iqk6aa-Cabal-3.12.1.0-doc
  2322. 697.79 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0 /nix/store/hvzhd2f1q43b3dn6r667x6h1l7iqk6aa-Cabal-3.12.1.0-doc
  2323. 698.24 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2324. 698.26 s [post-build-hook] Uploading to the NixCI cache: /nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0 /nix/store/hvzhd2f1q43b3dn6r667x6h1l7iqk6aa-Cabal-3.12.1.0-doc
  2325. 698.31 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2326. 698.43 s [post-build-hook] copying 1 paths...
  2327. 698.43 s [post-build-hook] copying path '/nix/store/dklqnfzkywrx0q4wx7bcsz3gf4appv94-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
  2328. 738.66 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2329. 738.84 s [post-build-hook] copying 0 paths...
  2330. 738.88 s Progress: 2 of 22 built, 165 of 165 downloaded from cache
  2331. 738.95 s Building cabal-doctest
  2332. 739.01 s Building ghc-paths
  2333. 739.07 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  2334. 739.07 s [cabal-doctest] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  2335. 739.13 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  2336. 739.14 s [ghc-paths] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  2337. 739.40 s [cabal-doctest] Phase: unpackPhase
  2338. 739.41 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  2339. 739.42 s [cabal-doctest] source root is cabal-doctest-1.0.12
  2340. 739.42 s [ghc-paths] Phase: unpackPhase
  2341. 739.43 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  2342. 739.43 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  2343. 739.44 s [ghc-paths] source root is ghc-paths-0.1.0.12
  2344. 739.44 s [cabal-doctest] Phase: patchPhase
  2345. 739.45 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  2346. 739.46 s [cabal-doctest] Phase: compileBuildDriverPhase
  2347. 739.46 s [ghc-paths] Phase: patchPhase
  2348. 739.46 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.KX0sQJ1MQz/setup-package.conf.d -threaded
  2349. 739.46 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  2350. 739.47 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  2351. 739.47 s [ghc-paths] patching file GHC/Paths.hs
  2352. 739.48 s [ghc-paths] Phase: compileBuildDriverPhase
  2353. 739.49 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.7HZmDIJsHy/setup-package.conf.d -threaded
  2354. 739.61 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.KX0sQJ1MQz/Main.o )
  2355. 739.68 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.7HZmDIJsHy/Main.o )
  2356. 739.75 s [cabal-doctest] [2 of 2] Linking Setup
  2357. 740.58 s [ghc-paths] [2 of 2] Linking Setup
  2358. 742.01 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  2359. 742.07 s [cabal-doctest] Phase: configurePhase
  2360. 742.08 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/rg0gksia0nyrh7n4d1xyiij3v7yzmx3r-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.KX0sQJ1MQz/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  2361. 742.09 s [cabal-doctest] Using Parsec parser
  2362. 742.09 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  2363. 742.18 s [cabal-doctest] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  2364. 742.18 s [cabal-doctest] 'ghc' version < 9.12):
  2365. 742.18 s [cabal-doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  2366. 742.18 s [cabal-doctest] 9.12.2
  2367. 742.96 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  2368. 742.98 s [ghc-paths] Phase: configurePhase
  2369. 742.99 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/071jnjrg8a9v9v4xmwxmms5kig430870-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.7HZmDIJsHy/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  2370. 743.00 s [ghc-paths] Using Parsec parser
  2371. 743.00 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  2372. 743.11 s [ghc-paths] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  2373. 743.11 s [ghc-paths] 'ghc' version < 9.12):
  2374. 743.11 s [ghc-paths] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  2375. 743.11 s [ghc-paths] 9.12.2
  2376. 743.52 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.14.1.0
  2377. 743.52 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.21.0.0
  2378. 743.52 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.9.0
  2379. 743.52 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.5.4.0
  2380. 743.52 s [cabal-doctest] Source component graph: component lib
  2381. 743.52 s [cabal-doctest] Configured component graph:
  2382. 743.52 s [cabal-doctest] component cabal-doctest-1.0.12-IP3gNAq10xJG6SrQQyuYmS
  2383. 743.52 s [cabal-doctest] include Cabal-3.14.1.0-b4d8
  2384. 743.52 s [cabal-doctest] include base-4.21.0.0-d2ce
  2385. 743.52 s [cabal-doctest] include directory-1.3.9.0-7268
  2386. 743.52 s [cabal-doctest] include filepath-1.5.4.0-59d1
  2387. 743.52 s [cabal-doctest] Linked component graph:
  2388. 743.52 s [cabal-doctest] unit cabal-doctest-1.0.12-IP3gNAq10xJG6SrQQyuYmS
  2389. 743.52 s [cabal-doctest] include Cabal-3.14.1.0-b4d8
  2390. 743.52 s [cabal-doctest] include base-4.21.0.0-d2ce
  2391. 743.52 s [cabal-doctest] include directory-1.3.9.0-7268
  2392. 743.52 s [cabal-doctest] include filepath-1.5.4.0-59d1
  2393. 743.52 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-IP3gNAq10xJG6SrQQyuYmS:Distribution.Extra.Doctest
  2394. 743.52 s [cabal-doctest] Ready component graph:
  2395. 743.52 s [cabal-doctest] definite cabal-doctest-1.0.12-IP3gNAq10xJG6SrQQyuYmS
  2396. 743.52 s [cabal-doctest] depends Cabal-3.14.1.0-b4d8
  2397. 743.52 s [cabal-doctest] depends base-4.21.0.0-d2ce
  2398. 743.52 s [cabal-doctest] depends directory-1.3.9.0-7268
  2399. 743.52 s [cabal-doctest] depends filepath-1.5.4.0-59d1
  2400. 743.52 s [cabal-doctest] Using Cabal-3.14.1.0 compiled by ghc-9.12
  2401. 743.52 s [cabal-doctest] Using compiler: ghc-9.12.2
  2402. 743.52 s [cabal-doctest] Using install prefix:
  2403. 743.52 s [cabal-doctest] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12
  2404. 743.52 s [cabal-doctest] Executables installed in:
  2405. 743.52 s [cabal-doctest] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/bin
  2406. 743.52 s [cabal-doctest] Libraries installed in:
  2407. 743.52 s [cabal-doctest] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/cabal-doctest-1.0.12-IP3gNAq10xJG6SrQQyuYmS
  2408. 743.52 s [cabal-doctest] Dynamic Libraries installed in:
  2409. 743.52 s [cabal-doctest] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  2410. 743.53 s [cabal-doctest] Private executables installed in:
  2411. 743.53 s [cabal-doctest] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.12.2-e4b2/cabal-doctest-1.0.12
  2412. 743.53 s [cabal-doctest] Data files installed in:
  2413. 743.53 s [cabal-doctest] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.12.2-e4b2/cabal-doctest-1.0.12
  2414. 743.53 s [cabal-doctest] Documentation installed in:
  2415. 743.53 s [cabal-doctest] /nix/store/rg0gksia0nyrh7n4d1xyiij3v7yzmx3r-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  2416. 743.53 s [cabal-doctest] Configuration files installed in:
  2417. 743.53 s [cabal-doctest] /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/etc
  2418. 743.53 s [cabal-doctest] No alex found
  2419. 743.53 s [cabal-doctest] Using ar found on system at:
  2420. 743.53 s [cabal-doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2421. 743.53 s [cabal-doctest] No c2hs found
  2422. 743.53 s [cabal-doctest] No cpphs found
  2423. 743.53 s [cabal-doctest] No doctest found
  2424. 743.53 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  2425. 743.53 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2426. 743.53 s [cabal-doctest] Using ghc version 9.12.2 found on system at:
  2427. 743.53 s [cabal-doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  2428. 743.53 s [cabal-doctest] Using ghc-pkg version 9.12.2 found on system at:
  2429. 743.53 s [cabal-doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  2430. 743.53 s [cabal-doctest] No ghcjs found
  2431. 743.53 s [cabal-doctest] No ghcjs-pkg found
  2432. 743.53 s [cabal-doctest] No greencard found
  2433. 743.53 s [cabal-doctest] Using haddock version 2.30.0 found on system at:
  2434. 743.53 s [cabal-doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  2435. 743.53 s [cabal-doctest] No happy found
  2436. 743.53 s [cabal-doctest] No haskell-suite found
  2437. 743.53 s [cabal-doctest] No haskell-suite-pkg found
  2438. 743.53 s [cabal-doctest] No hmake found
  2439. 743.53 s [cabal-doctest] Using hpc version 0.69 found on system at:
  2440. 743.53 s [cabal-doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  2441. 743.53 s [cabal-doctest] Using hsc2hs version 0.68.10 found on system at:
  2442. 743.53 s [cabal-doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  2443. 743.53 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  2444. 743.53 s [cabal-doctest] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  2445. 743.53 s [cabal-doctest] No jhc found
  2446. 743.53 s [cabal-doctest] Using ld found on system at:
  2447. 743.53 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2448. 743.53 s [cabal-doctest] No pkg-config found
  2449. 743.53 s [cabal-doctest] Using runghc version 9.12.2 found on system at:
  2450. 743.53 s [cabal-doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  2451. 743.53 s [cabal-doctest] Using strip version 2.44 found on system at:
  2452. 743.53 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2453. 743.53 s [cabal-doctest] Using tar found on system at:
  2454. 743.53 s [cabal-doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2455. 743.53 s [cabal-doctest] No uhc found
  2456. 743.75 s [cabal-doctest] Phase: buildPhase
  2457. 743.89 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  2458. 743.89 s [cabal-doctest] Building library for cabal-doctest-1.0.12...
  2459. 744.09 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 )
  2460. 744.41 s [ghc-paths] Dependency base >=3 && <5: using base-4.21.0.0
  2461. 744.41 s [ghc-paths] Source component graph: component lib
  2462. 744.41 s [ghc-paths] Configured component graph:
  2463. 744.41 s [ghc-paths] component ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2464. 744.41 s [ghc-paths] include base-4.21.0.0-d2ce
  2465. 744.41 s [ghc-paths] Linked component graph:
  2466. 744.41 s [ghc-paths] unit ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2467. 744.41 s [ghc-paths] include base-4.21.0.0-d2ce
  2468. 744.41 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8:GHC.Paths
  2469. 744.41 s [ghc-paths] Ready component graph:
  2470. 744.41 s [ghc-paths] definite ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2471. 744.41 s [ghc-paths] depends base-4.21.0.0-d2ce
  2472. 744.41 s [ghc-paths] Using Cabal-3.14.1.0 compiled by ghc-9.12
  2473. 744.41 s [ghc-paths] Using compiler: ghc-9.12.2
  2474. 744.41 s [ghc-paths] Using install prefix:
  2475. 744.41 s [ghc-paths] /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12
  2476. 744.41 s [ghc-paths] Executables installed in:
  2477. 744.41 s [ghc-paths] /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/bin
  2478. 744.41 s [ghc-paths] Libraries installed in:
  2479. 744.41 s [ghc-paths] /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2480. 744.41 s [ghc-paths] Dynamic Libraries installed in:
  2481. 744.41 s [ghc-paths] /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  2482. 744.41 s [ghc-paths] Private executables installed in:
  2483. 744.41 s [ghc-paths] /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.12.2-e4b2/ghc-paths-0.1.0.12
  2484. 744.41 s [ghc-paths] Data files installed in:
  2485. 744.41 s [ghc-paths] /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.12.2-e4b2/ghc-paths-0.1.0.12
  2486. 744.41 s [ghc-paths] Documentation installed in:
  2487. 744.41 s [ghc-paths] /nix/store/071jnjrg8a9v9v4xmwxmms5kig430870-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  2488. 744.41 s [ghc-paths] Configuration files installed in:
  2489. 744.41 s [ghc-paths] /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/etc
  2490. 744.41 s [ghc-paths] No alex found
  2491. 744.42 s [ghc-paths] Using ar found on system at:
  2492. 744.42 s [ghc-paths] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2493. 744.42 s [ghc-paths] No c2hs found
  2494. 744.42 s [ghc-paths] No cpphs found
  2495. 744.42 s [ghc-paths] No doctest found
  2496. 744.42 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  2497. 744.42 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2498. 744.42 s [ghc-paths] Using ghc version 9.12.2 found on system at:
  2499. 744.42 s [ghc-paths] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  2500. 744.42 s [ghc-paths] Using ghc-pkg version 9.12.2 found on system at:
  2501. 744.42 s [ghc-paths] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  2502. 744.42 s [ghc-paths] No ghcjs found
  2503. 744.42 s [ghc-paths] No ghcjs-pkg found
  2504. 744.42 s [ghc-paths] No greencard found
  2505. 744.42 s [ghc-paths] Using haddock version 2.30.0 found on system at:
  2506. 744.42 s [ghc-paths] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  2507. 744.42 s [ghc-paths] No happy found
  2508. 744.42 s [ghc-paths] No haskell-suite found
  2509. 744.42 s [ghc-paths] No haskell-suite-pkg found
  2510. 744.42 s [ghc-paths] No hmake found
  2511. 744.42 s [ghc-paths] Using hpc version 0.69 found on system at:
  2512. 744.42 s [ghc-paths] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  2513. 744.42 s [ghc-paths] Using hsc2hs version 0.68.10 found on system at:
  2514. 744.42 s [ghc-paths] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  2515. 744.42 s [ghc-paths] Using hscolour version 1.25 found on system at:
  2516. 744.42 s [ghc-paths] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  2517. 744.42 s [ghc-paths] No jhc found
  2518. 744.42 s [ghc-paths] Using ld found on system at:
  2519. 744.42 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2520. 744.42 s [ghc-paths] No pkg-config found
  2521. 744.42 s [ghc-paths] Using runghc version 9.12.2 found on system at:
  2522. 744.42 s [ghc-paths] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  2523. 744.42 s [ghc-paths] Using strip version 2.44 found on system at:
  2524. 744.42 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2525. 744.42 s [ghc-paths] Using tar found on system at:
  2526. 744.42 s [ghc-paths] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2527. 744.42 s [ghc-paths] No uhc found
  2528. 744.42 s [ghc-paths] Running: /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  2529. 744.57 s [ghc-paths] Phase: buildPhase
  2530. 744.71 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  2531. 744.72 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  2532. 744.95 s [cabal-doctest] src/Distribution/Extra/Doctest.hs:193:1: warning: [GHC-38417] [-Wmissing-signatures]
  2533. 744.95 s [cabal-doctest] Top-level binding with no type signature:
  2534. 744.95 s [cabal-doctest] unsymbolizePath :: Distribution.Utils.Path.SymbolicPathX
  2535. 744.95 s [cabal-doctest] allowAbsolute from to
  2536. 744.95 s [cabal-doctest] -> FilePath
  2537. 744.95 s [cabal-doctest] |
  2538. 744.95 s [cabal-doctest] 193 | unsymbolizePath = getSymbolicPath
  2539. 744.95 s [cabal-doctest] | ^^^^^^^^^^^^^^^
  2540. 744.95 s [cabal-doctest]
  2541. 744.96 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  2542. 745.68 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  2543. 748.11 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  2544. 748.17 s [ghc-paths] Phase: checkPhase
  2545. 748.28 s [ghc-paths] Package has no test suites.
  2546. 748.29 s [ghc-paths] Phase: haddockPhase
  2547. 748.75 s [cabal-doctest] src/Distribution/Extra/Doctest.hs:193:1: warning: [GHC-38417] [-Wmissing-signatures]
  2548. 748.75 s [cabal-doctest] Top-level binding with no type signature:
  2549. 748.75 s [cabal-doctest] unsymbolizePath :: Distribution.Utils.Path.SymbolicPathX
  2550. 748.75 s [cabal-doctest] allowAbsolute from to
  2551. 748.75 s [cabal-doctest] -> FilePath
  2552. 748.75 s [cabal-doctest] |
  2553. 748.75 s [cabal-doctest] 193 | unsymbolizePath = getSymbolicPath
  2554. 748.75 s [cabal-doctest] | ^^^^^^^^^^^^^^^
  2555. 748.75 s [cabal-doctest]
  2556. 749.08 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  2557. 749.08 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  2558. 749.66 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, nothing ) [HIE file is missing]
  2559. 749.77 s [ghc-paths] Haddock coverage:
  2560. 750.08 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  2561. 750.08 s [ghc-paths] Missing documentation for:
  2562. 750.08 s [ghc-paths] Module header
  2563. 750.08 s [ghc-paths] ghc (GHC/Paths.hs:34)
  2564. 750.08 s [ghc-paths] ghc_pkg (GHC/Paths.hs:35)
  2565. 750.08 s [ghc-paths] libdir (GHC/Paths.hs:31)
  2566. 750.08 s [ghc-paths] docdir (GHC/Paths.hs:32)
  2567. 755.59 s [cabal-doctest] Phase: checkPhase
  2568. 755.74 s [cabal-doctest] Package has no test suites.
  2569. 755.78 s [cabal-doctest] Phase: haddockPhase
  2570. 757.08 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  2571. 757.08 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12...
  2572. 757.49 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths,
  2573. 757.49 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  2574. 757.65 s [ghc-paths] Phase: installPhase
  2575. 757.67 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing ) [HIE file is missing]
  2576. 757.71 s [ghc-paths] Installing library in /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2577. 757.96 s [ghc-paths] Phase: fixupPhase
  2578. 757.99 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12
  2579. 757.99 s [ghc-paths] shrinking /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8-ghc9.12.2.so
  2580. 758.00 s [ghc-paths] checking for references to /build/ in /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12...
  2581. 758.02 s [ghc-paths] patching script interpreter paths in /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12
  2582. 758.03 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12/lib
  2583. 758.06 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/071jnjrg8a9v9v4xmwxmms5kig430870-ghc-paths-0.1.0.12-doc
  2584. 758.07 s [ghc-paths] checking for references to /build/ in /nix/store/071jnjrg8a9v9v4xmwxmms5kig430870-ghc-paths-0.1.0.12-doc...
  2585. 758.09 s [ghc-paths] patching script interpreter paths in /nix/store/071jnjrg8a9v9v4xmwxmms5kig430870-ghc-paths-0.1.0.12-doc
  2586. 758.20 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/071jnjrg8a9v9v4xmwxmms5kig430870-ghc-paths-0.1.0.12-doc /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12
  2587. 758.69 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2588. 758.72 s [post-build-hook] Uploading to the NixCI cache: /nix/store/071jnjrg8a9v9v4xmwxmms5kig430870-ghc-paths-0.1.0.12-doc /nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12
  2589. 758.78 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2590. 758.91 s [post-build-hook] copying 1 paths...
  2591. 758.91 s [post-build-hook] copying path '/nix/store/7hfrmxrk2hx60p0xc7ab5glzh9k809fn-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  2592. 759.97 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2593. 760.14 s [post-build-hook] copying 0 paths...
  2594. 760.18 s Progress: 3 of 22 built (1 building), 165 of 165 downloaded from cache
  2595. 760.27 s Building doctest
  2596. 760.27 s [cabal-doctest] src/Distribution/Extra/Doctest.hs:193:1: warning: [GHC-38417] [-Wmissing-signatures]
  2597. 760.27 s [cabal-doctest] Top-level binding with no type signature:
  2598. 760.27 s [cabal-doctest] unsymbolizePath :: Distribution.Utils.Path.SymbolicPathX
  2599. 760.27 s [cabal-doctest] allowAbsolute from to
  2600. 760.27 s [cabal-doctest] -> FilePath
  2601. 760.27 s [cabal-doctest] |
  2602. 760.27 s [cabal-doctest] 193 | unsymbolizePath = getSymbolicPath
  2603. 760.27 s [cabal-doctest] | ^^^^^^^^^^^^^^^
  2604. 760.27 s [cabal-doctest]
  2605. 760.27 s [cabal-doctest] Haddock coverage:
  2606. 760.27 s [cabal-doctest] Warning: 'UserHooks' is ambiguous. It is defined
  2607. 760.27 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  2608. 760.27 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  2609. 760.27 s [cabal-doctest] You may be able to disambiguate the identifier by qualifying it or
  2610. 760.27 s [cabal-doctest] by specifying the type/value namespace explicitly.
  2611. 760.27 s [cabal-doctest] Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
  2612. 760.27 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  2613. 760.42 s [doctest] Phase: setupCompilerEnvironmentPhase
  2614. 760.43 s [doctest] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  2615. 760.77 s [doctest] Phase: unpackPhase
  2616. 760.78 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  2617. 760.82 s [doctest] source root is doctest-0.24.2
  2618. 760.82 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  2619. 760.83 s [doctest] Phase: patchPhase
  2620. 760.85 s [doctest] Phase: compileBuildDriverPhase
  2621. 760.85 s [doctest] setupCompileFlags: -package-db=/build/tmp.Qc8tGGEyZy/setup-package.conf.d -threaded
  2622. 761.00 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.Qc8tGGEyZy/Main.o )
  2623. 761.14 s [doctest] [2 of 2] Linking Setup
  2624. 764.15 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  2625. 764.17 s [doctest] Phase: configurePhase
  2626. 764.18 s [doctest] configureFlags: --verbose --prefix=/nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/hrgiasay69psf1833wkwffr73ih824n0-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.Qc8tGGEyZy/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/lib
  2627. 764.21 s [doctest] Using Parsec parser
  2628. 764.21 s [doctest] Configuring doctest-0.24.2...
  2629. 764.31 s [doctest] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  2630. 764.31 s [doctest] 'ghc' version < 9.12):
  2631. 764.31 s [doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  2632. 764.31 s [doctest] 9.12.2
  2633. 765.27 s [doctest] Flags chosen: cabal-doctest=False
  2634. 766.17 s [doctest] Dependency base >=4.12 && <5: using base-4.21.0.0
  2635. 766.17 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  2636. 766.21 s [doctest] Dependency containers: using containers-0.7
  2637. 766.21 s [doctest] Dependency deepseq: using deepseq-1.5.1.0
  2638. 766.21 s [doctest] Dependency directory: using directory-1.3.9.0
  2639. 766.21 s [doctest] Dependency exceptions: using exceptions-0.10.9
  2640. 766.21 s [doctest] Dependency filepath: using filepath-1.5.4.0
  2641. 766.21 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.12.2
  2642. 766.21 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  2643. 766.21 s [doctest] Dependency process: using process-1.6.25.0
  2644. 766.21 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  2645. 766.21 s [doctest] Dependency temporary: using temporary-1.3
  2646. 766.21 s [doctest] Dependency transformers: using transformers-0.6.1.2
  2647. 766.21 s [doctest] Dependency base >=4.12 && <5: using base-4.21.0.0
  2648. 766.21 s [doctest] Dependency doctest: using doctest-0.24.2
  2649. 766.21 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  2650. 766.21 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  2651. 766.21 s [doctest] Dependency base >=4.12 && <5: using base-4.21.0.0
  2652. 766.21 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  2653. 766.21 s [doctest] Dependency containers: using containers-0.7
  2654. 766.21 s [doctest] Dependency deepseq: using deepseq-1.5.1.0
  2655. 766.21 s [doctest] Dependency directory: using directory-1.3.9.0
  2656. 766.21 s [doctest] Dependency exceptions: using exceptions-0.10.9
  2657. 766.21 s [doctest] Dependency filepath: using filepath-1.5.4.0
  2658. 766.21 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.12.2
  2659. 766.21 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  2660. 766.21 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  2661. 766.21 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  2662. 766.21 s [doctest] Dependency mockery: using mockery-0.3.5
  2663. 766.21 s [doctest] Dependency process: using process-1.6.25.0
  2664. 766.21 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  2665. 766.21 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  2666. 766.21 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  2667. 766.21 s [doctest] Dependency temporary: using temporary-1.3
  2668. 766.21 s [doctest] Dependency transformers: using transformers-0.6.1.2
  2669. 766.21 s [doctest] Source component graph:
  2670. 766.21 s [doctest] component test:spec
  2671. 766.21 s [doctest] component lib
  2672. 766.21 s [doctest] component exe:doctest dependency lib
  2673. 766.21 s [doctest] Configured component graph:
  2674. 766.21 s [doctest] component doctest-0.24.2-dQg6uaGVjZ2BWIqFRrT1b-spec
  2675. 766.21 s [doctest] include HUnit-1.6.2.0-GNOJ6Xqc1VSFhiNzfsTga2
  2676. 766.21 s [doctest] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  2677. 766.21 s [doctest] include base-4.21.0.0-d2ce
  2678. 766.21 s [doctest] include code-page-0.2.1-Lkm8w0yZk8m5k4VuNnnNPd
  2679. 766.21 s [doctest] include containers-0.7-0a77
  2680. 766.21 s [doctest] include deepseq-1.5.1.0-a72f
  2681. 766.21 s [doctest] include directory-1.3.9.0-7268
  2682. 766.21 s [doctest] include exceptions-0.10.9-01cc
  2683. 766.21 s [doctest] include filepath-1.5.4.0-59d1
  2684. 766.21 s [doctest] include ghc-9.12.2-e4b2
  2685. 766.21 s [doctest] include ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2686. 766.21 s [doctest] include hspec-2.11.14-EORtxegTgklKsqIGuZdPdp
  2687. 766.21 s [doctest] include hspec-core-2.11.14-LCL9ChSpd2Y3mSDqWmGLgw
  2688. 766.21 s [doctest] include mockery-0.3.5-EHdfBHMoDgGApbAPF4JHbf
  2689. 766.21 s [doctest] include process-1.6.25.0-63b2
  2690. 766.21 s [doctest] include silently-1.2.5.4-IGfzjXV1Puw6tfZlyu8IKk
  2691. 766.21 s [doctest] include stringbuilder-0.5.1-5HkvyMmLUR98RXllWtXhsy
  2692. 766.21 s [doctest] include syb-0.7.2.4-4tQJ3NLZwOj1hacJSgyoUg
  2693. 766.21 s [doctest] include temporary-1.3-4jNthx57Q4yDBiintoLbqk
  2694. 766.21 s [doctest] include transformers-0.6.1.2-c2d4
  2695. 766.21 s [doctest] component doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  2696. 766.21 s [doctest] include base-4.21.0.0-d2ce
  2697. 766.21 s [doctest] include code-page-0.2.1-Lkm8w0yZk8m5k4VuNnnNPd
  2698. 766.21 s [doctest] include containers-0.7-0a77
  2699. 766.21 s [doctest] include deepseq-1.5.1.0-a72f
  2700. 766.21 s [doctest] include directory-1.3.9.0-7268
  2701. 766.21 s [doctest] include exceptions-0.10.9-01cc
  2702. 766.21 s [doctest] include filepath-1.5.4.0-59d1
  2703. 766.21 s [doctest] include ghc-9.12.2-e4b2
  2704. 766.21 s [doctest] include ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2705. 766.21 s [doctest] include process-1.6.25.0-63b2
  2706. 766.21 s [doctest] include syb-0.7.2.4-4tQJ3NLZwOj1hacJSgyoUg
  2707. 766.21 s [doctest] include temporary-1.3-4jNthx57Q4yDBiintoLbqk
  2708. 766.21 s [doctest] include transformers-0.6.1.2-c2d4
  2709. 766.21 s [doctest] component doctest-0.24.2-6fSasoOfXM6Iz5Rx7GwbxH-doctest
  2710. 766.21 s [doctest] include base-4.21.0.0-d2ce
  2711. 766.21 s [doctest] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  2712. 766.21 s [doctest] Linked component graph:
  2713. 766.21 s [doctest] unit doctest-0.24.2-dQg6uaGVjZ2BWIqFRrT1b-spec
  2714. 766.21 s [doctest] include HUnit-1.6.2.0-GNOJ6Xqc1VSFhiNzfsTga2
  2715. 766.22 s [doctest] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  2716. 766.22 s [doctest] include base-4.21.0.0-d2ce
  2717. 766.22 s [doctest] include code-page-0.2.1-Lkm8w0yZk8m5k4VuNnnNPd
  2718. 766.22 s [doctest] include containers-0.7-0a77
  2719. 766.22 s [doctest] include deepseq-1.5.1.0-a72f
  2720. 766.22 s [doctest] include directory-1.3.9.0-7268
  2721. 766.22 s [doctest] include exceptions-0.10.9-01cc
  2722. 766.22 s [doctest] include filepath-1.5.4.0-59d1
  2723. 766.22 s [doctest] include ghc-9.12.2-e4b2
  2724. 766.22 s [doctest] include ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2725. 766.22 s [doctest] include hspec-2.11.14-EORtxegTgklKsqIGuZdPdp
  2726. 766.22 s [doctest] include hspec-core-2.11.14-LCL9ChSpd2Y3mSDqWmGLgw
  2727. 766.22 s [doctest] include mockery-0.3.5-EHdfBHMoDgGApbAPF4JHbf
  2728. 766.22 s [doctest] include process-1.6.25.0-63b2
  2729. 766.22 s [doctest] include silently-1.2.5.4-IGfzjXV1Puw6tfZlyu8IKk
  2730. 766.22 s [doctest] include stringbuilder-0.5.1-5HkvyMmLUR98RXllWtXhsy
  2731. 766.22 s [doctest] include syb-0.7.2.4-4tQJ3NLZwOj1hacJSgyoUg
  2732. 766.22 s [doctest] include temporary-1.3-4jNthx57Q4yDBiintoLbqk
  2733. 766.22 s [doctest] include transformers-0.6.1.2-c2d4
  2734. 766.22 s [doctest] unit doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  2735. 766.22 s [doctest] include base-4.21.0.0-d2ce
  2736. 766.22 s [doctest] include code-page-0.2.1-Lkm8w0yZk8m5k4VuNnnNPd
  2737. 766.22 s [doctest] include containers-0.7-0a77
  2738. 766.22 s [doctest] include deepseq-1.5.1.0-a72f
  2739. 766.22 s [doctest] include directory-1.3.9.0-7268
  2740. 766.22 s [doctest] include exceptions-0.10.9-01cc
  2741. 766.22 s [doctest] include filepath-1.5.4.0-59d1
  2742. 766.22 s [doctest] include ghc-9.12.2-e4b2
  2743. 766.22 s [doctest] include ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2744. 766.22 s [doctest] include process-1.6.25.0-63b2
  2745. 766.22 s [doctest] include syb-0.7.2.4-4tQJ3NLZwOj1hacJSgyoUg
  2746. 766.22 s [doctest] include temporary-1.3-4jNthx57Q4yDBiintoLbqk
  2747. 766.22 s [doctest] include transformers-0.6.1.2-c2d4
  2748. 766.22 s [doctest] Test.DocTest=doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x:Test.DocTest.Internal.Run
  2749. 766.22 s [doctest] unit doctest-0.24.2-6fSasoOfXM6Iz5Rx7GwbxH-doctest
  2750. 766.22 s [doctest] include base-4.21.0.0-d2ce
  2751. 766.22 s [doctest] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  2752. 766.22 s [doctest] Ready component graph:
  2753. 766.22 s [doctest] definite doctest-0.24.2-dQg6uaGVjZ2BWIqFRrT1b-spec
  2754. 766.22 s [doctest] depends HUnit-1.6.2.0-GNOJ6Xqc1VSFhiNzfsTga2
  2755. 766.22 s [doctest] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  2756. 766.22 s [doctest] depends base-4.21.0.0-d2ce
  2757. 766.22 s [doctest] depends code-page-0.2.1-Lkm8w0yZk8m5k4VuNnnNPd
  2758. 766.22 s [doctest] depends containers-0.7-0a77
  2759. 766.22 s [doctest] depends deepseq-1.5.1.0-a72f
  2760. 766.22 s [doctest] depends directory-1.3.9.0-7268
  2761. 766.22 s [doctest] depends exceptions-0.10.9-01cc
  2762. 766.22 s [doctest] depends filepath-1.5.4.0-59d1
  2763. 766.22 s [doctest] depends ghc-9.12.2-e4b2
  2764. 766.22 s [doctest] depends ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2765. 766.22 s [doctest] depends hspec-2.11.14-EORtxegTgklKsqIGuZdPdp
  2766. 766.22 s [doctest] depends hspec-core-2.11.14-LCL9ChSpd2Y3mSDqWmGLgw
  2767. 766.22 s [doctest] depends mockery-0.3.5-EHdfBHMoDgGApbAPF4JHbf
  2768. 766.22 s [doctest] depends process-1.6.25.0-63b2
  2769. 766.22 s [doctest] depends silently-1.2.5.4-IGfzjXV1Puw6tfZlyu8IKk
  2770. 766.22 s [doctest] depends stringbuilder-0.5.1-5HkvyMmLUR98RXllWtXhsy
  2771. 766.22 s [doctest] depends syb-0.7.2.4-4tQJ3NLZwOj1hacJSgyoUg
  2772. 766.22 s [doctest] depends temporary-1.3-4jNthx57Q4yDBiintoLbqk
  2773. 766.22 s [doctest] depends transformers-0.6.1.2-c2d4
  2774. 766.22 s [doctest] definite doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  2775. 766.22 s [doctest] depends base-4.21.0.0-d2ce
  2776. 766.22 s [doctest] depends code-page-0.2.1-Lkm8w0yZk8m5k4VuNnnNPd
  2777. 766.22 s [doctest] depends containers-0.7-0a77
  2778. 766.22 s [doctest] depends deepseq-1.5.1.0-a72f
  2779. 766.22 s [doctest] depends directory-1.3.9.0-7268
  2780. 766.22 s [doctest] depends exceptions-0.10.9-01cc
  2781. 766.22 s [doctest] depends filepath-1.5.4.0-59d1
  2782. 766.22 s [doctest] depends ghc-9.12.2-e4b2
  2783. 766.22 s [doctest] depends ghc-paths-0.1.0.12-HYkAeD6x1fvJKCzxZpsho8
  2784. 766.22 s [doctest] depends process-1.6.25.0-63b2
  2785. 766.22 s [doctest] depends syb-0.7.2.4-4tQJ3NLZwOj1hacJSgyoUg
  2786. 766.22 s [doctest] depends temporary-1.3-4jNthx57Q4yDBiintoLbqk
  2787. 766.22 s [doctest] depends transformers-0.6.1.2-c2d4
  2788. 766.22 s [doctest] definite doctest-0.24.2-6fSasoOfXM6Iz5Rx7GwbxH-doctest
  2789. 766.22 s [doctest] depends base-4.21.0.0-d2ce
  2790. 766.22 s [doctest] depends doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  2791. 766.22 s [doctest] Using Cabal-3.14.1.0 compiled by ghc-9.12
  2792. 766.22 s [doctest] Using compiler: ghc-9.12.2
  2793. 766.22 s [doctest] Using install prefix:
  2794. 766.22 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2
  2795. 766.22 s [doctest] Executables installed in:
  2796. 766.22 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin
  2797. 766.22 s [doctest] Libraries installed in:
  2798. 766.22 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  2799. 766.22 s [doctest] Dynamic Libraries installed in:
  2800. 766.22 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  2801. 766.31 s [doctest] Private executables installed in:
  2802. 766.31 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/libexec/x86_64-linux-ghc-9.12.2-e4b2/doctest-0.24.2
  2803. 766.31 s [doctest] Data files installed in:
  2804. 766.31 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/share/x86_64-linux-ghc-9.12.2-e4b2/doctest-0.24.2
  2805. 766.31 s [doctest] Documentation installed in:
  2806. 766.31 s [doctest] /nix/store/hrgiasay69psf1833wkwffr73ih824n0-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  2807. 766.31 s [doctest] Configuration files installed in:
  2808. 766.31 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/etc
  2809. 766.31 s [doctest] No alex found
  2810. 766.31 s [doctest] Using ar found on system at:
  2811. 766.31 s [doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2812. 766.31 s [doctest] No c2hs found
  2813. 766.31 s [doctest] No cpphs found
  2814. 766.31 s [doctest] No doctest found
  2815. 766.31 s [doctest] Using gcc version 14.3.0 given by user at:
  2816. 766.31 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2817. 766.31 s [doctest] Using ghc version 9.12.2 found on system at:
  2818. 766.31 s [doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  2819. 766.31 s [doctest] Using ghc-pkg version 9.12.2 found on system at:
  2820. 766.31 s [doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  2821. 766.31 s [doctest] No ghcjs found
  2822. 766.31 s [doctest] No ghcjs-pkg found
  2823. 766.31 s [doctest] No greencard found
  2824. 766.31 s [doctest] Using haddock version 2.30.0 found on system at:
  2825. 766.31 s [doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  2826. 766.31 s [doctest] No happy found
  2827. 766.31 s [doctest] No haskell-suite found
  2828. 766.31 s [doctest] No haskell-suite-pkg found
  2829. 766.31 s [doctest] No hmake found
  2830. 766.31 s [doctest] Using hpc version 0.69 found on system at:
  2831. 766.31 s [doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  2832. 766.31 s [doctest] Using hsc2hs version 0.68.10 found on system at:
  2833. 766.31 s [doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  2834. 766.31 s [doctest] Using hscolour version 1.25 found on system at:
  2835. 766.31 s [doctest] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  2836. 766.31 s [doctest] No jhc found
  2837. 766.31 s [doctest] Using ld found on system at:
  2838. 766.31 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2839. 766.31 s [doctest] No pkg-config found
  2840. 766.31 s [doctest] Using runghc version 9.12.2 found on system at:
  2841. 766.31 s [doctest] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  2842. 766.31 s [doctest] Using strip version 2.44 found on system at:
  2843. 766.31 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2844. 766.31 s [doctest] Using tar found on system at:
  2845. 766.31 s [doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2846. 766.31 s [doctest] No uhc found
  2847. 766.65 s [doctest] Phase: buildPhase
  2848. 766.94 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  2849. 766.97 s [doctest] Building test suite 'spec' for doctest-0.24.2...
  2850. 768.25 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  2851. 768.44 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  2852. 771.21 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  2853. 771.21 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  2854. 771.30 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  2855. 771.30 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  2856. 771.30 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  2857. 771.30 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  2858. 771.30 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  2859. 771.30 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  2860. 771.30 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  2861. 771.30 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  2862. 771.30 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  2863. 771.30 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  2864. 771.30 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  2865. 771.30 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  2866. 771.30 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  2867. 771.31 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  2868. 771.31 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  2869. 771.46 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  2870. 771.46 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  2871. 771.46 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  2872. 771.46 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 )
  2873. 771.46 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 )
  2874. 771.46 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  2875. 771.46 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  2876. 772.64 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 )
  2877. 772.67 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  2878. 773.19 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 )
  2879. 773.22 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  2880. 773.81 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  2881. 774.55 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  2882. 774.55 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  2883. 774.72 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  2884. 774.87 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  2885. 774.99 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 )
  2886. 775.04 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  2887. 775.07 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  2888. 775.91 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  2889. 776.05 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  2890. 776.05 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  2891. 776.05 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  2892. 776.05 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  2893. 776.05 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  2894. 778.99 s [doctest] [45 of 45] Linking dist/build/spec/spec
  2895. 779.50 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest,
  2896. 779.50 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  2897. 779.93 s [cabal-doctest] Phase: installPhase
  2898. 780.14 s [cabal-doctest] Installing library in /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/cabal-doctest-1.0.12-IP3gNAq10xJG6SrQQyuYmS
  2899. 780.67 s [cabal-doctest] Phase: fixupPhase
  2900. 780.73 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12
  2901. 780.74 s [cabal-doctest] shrinking /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHScabal-doctest-1.0.12-IP3gNAq10xJG6SrQQyuYmS-ghc9.12.2.so
  2902. 780.77 s [cabal-doctest] checking for references to /build/ in /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12...
  2903. 780.81 s [cabal-doctest] patching script interpreter paths in /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12
  2904. 780.83 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12/lib
  2905. 780.98 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/rg0gksia0nyrh7n4d1xyiij3v7yzmx3r-cabal-doctest-1.0.12-doc
  2906. 780.99 s [cabal-doctest] checking for references to /build/ in /nix/store/rg0gksia0nyrh7n4d1xyiij3v7yzmx3r-cabal-doctest-1.0.12-doc...
  2907. 781.03 s [cabal-doctest] patching script interpreter paths in /nix/store/rg0gksia0nyrh7n4d1xyiij3v7yzmx3r-cabal-doctest-1.0.12-doc
  2908. 781.31 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12 /nix/store/rg0gksia0nyrh7n4d1xyiij3v7yzmx3r-cabal-doctest-1.0.12-doc
  2909. 782.25 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2910. 782.33 s [post-build-hook] Uploading to the NixCI cache: /nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12 /nix/store/rg0gksia0nyrh7n4d1xyiij3v7yzmx3r-cabal-doctest-1.0.12-doc
  2911. 782.61 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2912. 782.82 s [post-build-hook] copying 1 paths...
  2913. 782.82 s [post-build-hook] copying path '/nix/store/c1rs41zkm2lcig75qsr0gpxfwd8ck3iv-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  2914. 783.86 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2915. 784.17 s [post-build-hook] copying 0 paths...
  2916. 784.31 s Progress: 4 of 22 built (1 building), 165 of 165 downloaded from cache
  2917. 791.03 s [doctest] Preprocessing library for doctest-0.24.2...
  2918. 791.07 s [doctest] Building library for doctest-0.24.2...
  2919. 792.31 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  2920. 792.84 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  2921. 797.32 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  2922. 797.35 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  2923. 797.35 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  2924. 797.35 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 )
  2925. 797.35 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  2926. 797.35 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  2927. 797.35 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  2928. 797.35 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 )
  2929. 797.35 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  2930. 797.35 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  2931. 797.35 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  2932. 797.35 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 )
  2933. 797.35 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 )
  2934. 797.35 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  2935. 797.35 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  2936. 799.27 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 )
  2937. 799.33 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  2938. 799.99 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 )
  2939. 800.11 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  2940. 800.89 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  2941. 800.90 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  2942. 801.91 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  2943. 802.52 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 )
  2944. 802.60 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  2945. 805.02 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  2946. 805.75 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  2947. 810.39 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  2948. 810.43 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  2949. 810.43 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  2950. 810.43 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  2951. 810.43 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  2952. 810.43 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  2953. 810.43 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  2954. 810.43 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  2955. 810.43 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  2956. 810.43 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  2957. 810.43 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  2958. 810.43 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  2959. 810.79 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  2960. 810.80 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  2961. 810.80 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  2962. 812.13 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  2963. 812.45 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  2964. 813.22 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  2965. 813.50 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  2966. 814.34 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  2967. 814.34 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  2968. 815.72 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  2969. 816.37 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  2970. 816.67 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  2971. 830.47 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  2972. 830.47 s [doctest] Building executable 'doctest' for doctest-0.24.2...
  2973. 830.80 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  2974. 831.49 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  2975. 832.21 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  2976. 842.82 s [doctest] buildPhase completed in 1 minutes 16 seconds
  2977. 842.82 s [doctest] Phase: checkPhase
  2978. 843.99 s [doctest] Running 1 test suites...
  2979. 843.99 s [doctest] Test suite spec: RUNNING...
  2980. 844.13 s [doctest]
  2981. 844.13 s [doctest] Extract
  2982. 844.13 s [doctest] extract
  2983. 844.32 s [doctest] extracts documentation for a top-level declaration [✔]
  2984. 844.46 s [doctest] extracts documentation from argument list [✔]
  2985. 844.54 s [doctest] extracts documentation for a type class function [✔]
  2986. 844.66 s [doctest] extracts documentation from the argument list of a type class function [✔]
  2987. 844.78 s [doctest] extracts documentation from the module header [✔]
  2988. 844.94 s [doctest] extracts documentation from imported modules [✔]
  2989. 845.05 s [doctest] extracts documentation from export list [✔]
  2990. 845.17 s [doctest] extracts documentation from named chunks [✔]
  2991. 845.30 s [doctest] returns docstrings in the same order they appear in the source [✔]
  2992. 845.43 s [doctest] extracts $setup code [✔]
  2993. 845.53 s [doctest] fails on invalid flags [✔]
  2994. 845.53 s [doctest] extract (regression tests)
  2995. 845.65 s [doctest] works with infix operators [✔]
  2996. 845.79 s [doctest] works with parallel list comprehensions [✔]
  2997. 845.88 s [doctest] works with list comprehensions in instance definitions [✔]
  2998. 846.00 s [doctest] works with foreign imports [✔]
  2999. 846.13 s [doctest] works for rewrite rules [✔]
  3000. 846.24 s [doctest] works for rewrite rules with type signatures [✔]
  3001. 846.35 s [doctest] strips CR from dos line endings [✔]
  3002. 846.56 s [doctest] works with a module that splices in an expression from an other module [✔]
  3003. 846.62 s [doctest] works for type families and GHC 7.6.1 [✔]
  3004. 846.62 s [doctest] Info
  3005. 846.62 s [doctest] formatInfo
  3006. 846.81 s [doctest] formats --info output [✔]
  3007. 846.81 s [doctest] Interpreter
  3008. 846.81 s [doctest] interpreterSupported
  3009. 846.99 s [doctest] indicates whether GHCi is supported on current platform [✔]
  3010. 846.99 s [doctest] ghcInfo
  3011. 847.19 s [doctest] includes "Have interpreter" [✔]
  3012. 847.19 s [doctest] safeEval
  3013. 848.09 s [doctest] evaluates an expression [✔]
  3014. 848.78 s [doctest] returns Left on unterminated multiline command [✔]
  3015. 848.78 s [doctest] filterExpression
  3016. 848.78 s [doctest] removes :set -XTemplateHaskell [✔]
  3017. 848.78 s [doctest] filters -XTemplateHaskell [✔]
  3018. 848.78 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  3019. 848.78 s [doctest] Language.Haskell.GhciWrapper
  3020. 848.78 s [doctest] evalEcho
  3021. 849.61 s [doctest] prints result to stdout [✔]
  3022. 849.61 s [doctest] evalWith
  3023. 849.61 s [doctest] with PreserveIt
  3024. 850.45 s [doctest] preserves it [✔]
  3025. 850.45 s [doctest] eval
  3026. 851.09 s [doctest] shows literals [✔]
  3027. 851.79 s [doctest] shows string literals containing Unicode [✔]
  3028. 852.50 s [doctest] evaluates simple expressions [✔]
  3029. 853.20 s [doctest] supports let bindings [✔]
  3030. 854.04 s [doctest] allows import statements [✔]
  3031. 854.66 s [doctest] captures stdout [✔]
  3032. 855.33 s [doctest] captures stdout (Unicode) [✔]
  3033. 856.01 s [doctest] captures stdout (empty line) [✔]
  3034. 856.75 s [doctest] captures stdout (multiple lines) [✔]
  3035. 857.54 s [doctest] captures stderr [✔]
  3036. 858.27 s [doctest] captures stderr (Unicode) [✔]
  3037. 858.95 s [doctest] shows exceptions [✔]
  3038. 859.63 s [doctest] shows exceptions (ExitCode) [✔]
  3039. 860.30 s [doctest] gives an error message for identifiers that are not in scope [✔]
  3040. 860.30 s [doctest] when configVerbose is True
  3041. 860.97 s [doctest] prints prompt [✔]
  3042. 860.97 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  3043. 861.71 s [doctest] does not fail on marker expression (bug fix) [✔]
  3044. 861.71 s [doctest] with NoImplicitPrelude
  3045. 862.37 s [doctest] works [✔]
  3046. 862.37 s [doctest] with a strange String type
  3047. 863.02 s [doctest] works [✔]
  3048. 863.02 s [doctest] Location
  3049. 863.02 s [doctest] toLocation
  3050. 863.02 s [doctest] works for a regular SrcSpan [✔]
  3051. 863.02 s [doctest] works for a single-line SrcSpan [✔]
  3052. 863.02 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  3053. 863.02 s [doctest] works for a bad SrcSpan [✔]
  3054. 863.03 s [doctest] works for a SrcLoc with bad locations [✔]
  3055. 863.03 s [doctest] enumerate
  3056. 863.03 s [doctest] replicates UnhelpfulLocation [✔]
  3057. 863.03 s [doctest] enumerates Location [✔]
  3058. 863.03 s [doctest] Main
  3059. 863.03 s [doctest] doctest
  3060. 863.94 s [doctest] testSimple [✔]
  3061. 864.82 s [doctest] it-variable [✔]
  3062. 865.72 s [doctest] it-variable in $setup [✔]
  3063. 866.61 s [doctest] failing [✔]
  3064. 867.43 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  3065. 867.43 s [doctest] without --fail-fast
  3066. 868.37 s [doctest] continuous even if some tests fail [✔]
  3067. 868.38 s [doctest] with --fail-fast
  3068. 869.31 s [doctest] stops after the first failure [✔]
  3069. 870.02 s [doctest] stops after failures in $setup [✔]
  3070. 871.53 s [doctest] testImport [✔]
  3071. 872.47 s [doctest] testCommentLocation [✔]
  3072. 873.25 s [doctest] testPutStr [✔]
  3073. 873.99 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  3074. 874.84 s [doctest] testBlankline [✔]
  3075. 875.65 s [doctest] examples from the same Haddock comment share the same scope [✔]
  3076. 876.44 s [doctest] testDocumentationForArguments [✔]
  3077. 877.34 s [doctest] template-haskell [✔]
  3078. 878.08 s [doctest] handles source files with CRLF line endings [✔]
  3079. 878.91 s [doctest] runs $setup before each test group [✔]
  3080. 879.74 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  3081. 880.48 s [doctest] ignores trailing whitespace when matching test output [✔]
  3082. 880.54 s [doctest] doctest as a runner for QuickCheck properties
  3083. 881.27 s [doctest] runs a boolean property [✔]
  3084. 882.21 s [doctest] runs an explicitly quantified property [✔]
  3085. 883.14 s [doctest] runs an implicitly quantified property [✔]
  3086. 884.10 s [doctest] reports a failing property [✔]
  3087. 884.86 s [doctest] runs a boolean property with an explicit type signature [✔]
  3088. 885.90 s [doctest] runs $setup before each property [✔]
  3089. 885.90 s [doctest] doctest (regression tests)
  3090. 887.36 s [doctest] bugfixWorkingDirectory [✔]
  3091. 888.17 s [doctest] bugfixOutputToStdErr [✔]
  3092. 888.87 s [doctest] bugfixImportHierarchical [✔]
  3093. 889.72 s [doctest] bugfixMultipleModules [✔]
  3094. 891.46 s [doctest] testCPP [✔]
  3095. 892.79 s [doctest] template-haskell-bugfix [✔]
  3096. 893.50 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  3097. 894.21 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  3098. 894.25 s [doctest] Options
  3099. 894.25 s [doctest] parseOptions
  3100. 894.25 s [doctest] strips --optghc [✔]
  3101. 894.25 s [doctest] strips --optghc= [✔]
  3102. 894.25 s [doctest] with ghc options that are not valid with --interactive
  3103. 894.31 s [doctest] returns ProxyToGhc [✔]
  3104. 894.31 s [doctest] +++ OK, passed 100 tests.
  3105. 894.31 s [doctest] with --interactive
  3106. 894.31 s [doctest] disables magic mode [✔]
  3107. 894.31 s [doctest] filters out --interactive [✔]
  3108. 894.31 s [doctest] accepts --fast [✔]
  3109. 894.31 s [doctest] --no-magic
  3110. 894.31 s [doctest] without --no-magic
  3111. 894.31 s [doctest] enables magic mode [✔]
  3112. 894.31 s [doctest] with --no-magic
  3113. 894.31 s [doctest] disables magic mode [✔]
  3114. 894.31 s [doctest] --fast
  3115. 894.31 s [doctest] without --fast
  3116. 894.31 s [doctest] disables fast mode [✔]
  3117. 894.31 s [doctest] with --fast
  3118. 894.31 s [doctest] enables fast mode [✔]
  3119. 894.31 s [doctest] --preserve-it
  3120. 894.31 s [doctest] without --preserve-it
  3121. 894.31 s [doctest] does not preserve the `it` variable [✔]
  3122. 894.31 s [doctest] with --preserve-it
  3123. 894.31 s [doctest] preserves the `it` variable [✔]
  3124. 894.31 s [doctest] --fail-fast
  3125. 894.31 s [doctest] without --fail-fast
  3126. 894.31 s [doctest] disables fail-fast mode [✔]
  3127. 894.31 s [doctest] with --fail-fast
  3128. 894.31 s [doctest] enables fail-fast mode [✔]
  3129. 894.31 s [doctest] with --help
  3130. 894.31 s [doctest] outputs usage information [✔]
  3131. 894.31 s [doctest] with --version
  3132. 894.31 s [doctest] outputs version information [✔]
  3133. 894.31 s [doctest] with --info
  3134. 894.42 s [doctest] outputs machine readable version information [✔]
  3135. 894.42 s [doctest] --verbose
  3136. 894.42 s [doctest] without --verbose
  3137. 894.42 s [doctest] is not verbose by default [✔]
  3138. 894.42 s [doctest] with --verbose
  3139. 894.42 s [doctest] parses verbose option [✔]
  3140. 894.42 s [doctest] PackageDBs
  3141. 894.42 s [doctest] getPackageDBsFromEnv
  3142. 894.43 s [doctest] uses global and user when no env used [✔]
  3143. 894.43 s [doctest] respects GHC_PACKAGE_PATH [✔]
  3144. 894.43 s [doctest] Parse
  3145. 894.43 s [doctest] extractDocTests
  3146. 894.48 s [doctest] extracts properties from a module [✔]
  3147. 894.57 s [doctest] extracts examples from a module [✔]
  3148. 894.67 s [doctest] extracts examples from documentation for non-exported names [✔]
  3149. 894.76 s [doctest] extracts multiple examples from a module [✔]
  3150. 894.85 s [doctest] returns an empty list, if documentation contains no examples [✔]
  3151. 894.94 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  3152. 895.03 s [doctest] keeps modules that only contain setup code [✔]
  3153. 895.03 s [doctest] parseInteractions (an internal function)
  3154. 895.03 s [doctest] parses an interaction [✔]
  3155. 895.03 s [doctest] drops whitespace as appropriate [✔]
  3156. 895.03 s [doctest] parses an interaction without a result [✔]
  3157. 895.03 s [doctest] works with a complex example [✔]
  3158. 895.03 s [doctest] attaches location information to parsed interactions [✔]
  3159. 895.03 s [doctest] basic multiline [✔]
  3160. 895.03 s [doctest] multiline align output [✔]
  3161. 895.03 s [doctest] multiline align output with >>> [✔]
  3162. 895.03 s [doctest] parses wild cards lines [✔]
  3163. 895.03 s [doctest] parses wild card chunks [✔]
  3164. 895.03 s [doctest] parseProperties (an internal function)
  3165. 895.03 s [doctest] parses a property [✔]
  3166. 895.03 s [doctest] mkLineChunks (an internal function)
  3167. 895.03 s [doctest] replaces ellipsis with WildCardChunks [✔]
  3168. 895.03 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  3169. 895.03 s [doctest] handles leading and trailing dots [✔]
  3170. 895.03 s [doctest] handles leading and trailing ellipsis [✔]
  3171. 895.03 s [doctest] Property
  3172. 895.03 s [doctest] runProperty
  3173. 895.68 s [doctest] reports a failing property [✔]
  3174. 896.33 s [doctest] runs a Bool property [✔]
  3175. 896.99 s [doctest] runs a Bool property with an explicit type signature [✔]
  3176. 897.85 s [doctest] runs an implicitly quantified property [✔]
  3177. 898.80 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  3178. 899.50 s [doctest] runs an explicitly quantified property [✔]
  3179. 900.19 s [doctest] allows to mix implicit and explicit quantification [✔]
  3180. 900.86 s [doctest] reports the value for which a property fails [✔]
  3181. 901.50 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  3182. 902.36 s [doctest] defaults ambiguous type variables to Integer [✔]
  3183. 902.36 s [doctest] freeVariables
  3184. 903.03 s [doctest] finds a free variables in a term [✔]
  3185. 903.50 s [doctest] ignores duplicates [✔]
  3186. 904.02 s [doctest] works for terms with multiple names [✔]
  3187. 904.48 s [doctest] works for names that contain a prime [✔]
  3188. 904.98 s [doctest] works for names that are similar to other names that are in scope [✔]
  3189. 904.98 s [doctest] parseNotInScope
  3190. 904.98 s [doctest] when error message was produced by GHC 7.4.1
  3191. 904.98 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  3192. 904.98 s [doctest] ignores duplicates [✔]
  3193. 904.98 s [doctest] works for variable names that contain a prime [✔]
  3194. 904.98 s [doctest] works for error messages with suggestions [✔]
  3195. 904.98 s [doctest] when error message was produced by GHC 8.0.1
  3196. 904.98 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  3197. 904.98 s [doctest] ignores duplicates [✔]
  3198. 904.98 s [doctest] works for variable names that contain a prime [✔]
  3199. 904.98 s [doctest] works for error messages with suggestions [✔]
  3200. 904.98 s [doctest] Run
  3201. 904.98 s [doctest] doctest
  3202. 905.81 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  3203. 905.81 s [doctest] prints help on --help [✔]
  3204. 905.86 s [doctest] prints version on --version [✔]
  3205. 906.74 s [doctest] accepts arbitrary GHC options [✔]
  3206. 907.68 s [doctest] accepts GHC options with --optghc [✔]
  3207. 908.65 s [doctest] prints a deprecation message for --optghc [✔]
  3208. 908.79 s [doctest] prints error message on invalid option [✔]
  3209. 909.43 s [doctest] interprets GHC response files [✔]
  3210. 910.24 s [doctest] prints verbose description of a specification [✔]
  3211. 911.11 s [doctest] prints verbose description of a property [✔]
  3212. 911.92 s [doctest] prints verbose error [✔]
  3213. 912.91 s [doctest] can deal with potentially problematic GHC options [✔]
  3214. 912.91 s [doctest] doctestWithResult
  3215. 912.91 s [doctest] on parse error
  3216. 912.99 s [doctest] aborts with (ExitFailure 1) [✔]
  3217. 913.08 s [doctest] prints a useful error message [✔]
  3218. 913.08 s [doctest] expandDirs
  3219. 913.08 s [doctest] expands a directory [✔]
  3220. 913.08 s [doctest] ignores files [✔]
  3221. 913.08 s [doctest] ignores random things [✔]
  3222. 913.08 s [doctest] Runner
  3223. 913.08 s [doctest] report
  3224. 913.08 s [doctest] when mode is interactive
  3225. 913.08 s [doctest] writes to stderr [✔]
  3226. 913.08 s [doctest] when mode is non-interactive
  3227. 913.08 s [doctest] writes to stderr [✔]
  3228. 913.08 s [doctest] report_
  3229. 913.08 s [doctest] when mode is interactive
  3230. 913.08 s [doctest] writes transient output to stderr [✔]
  3231. 913.08 s [doctest] when mode is non-interactive
  3232. 913.08 s [doctest] is ignored [✔]
  3233. 913.08 s [doctest] Runner.Example
  3234. 913.08 s [doctest] mkResult
  3235. 913.17 s [doctest] returns Equal when output matches [✔]
  3236. 913.17 s [doctest] +++ OK, passed 100 tests.
  3237. 913.17 s [doctest] ignores trailing whitespace [✔]
  3238. 913.17 s [doctest] with WildCardLine
  3239. 913.17 s [doctest] matches zero lines [✔]
  3240. 913.17 s [doctest] matches first zero line [✔]
  3241. 913.17 s [doctest] matches final zero line [✔]
  3242. 913.17 s [doctest] matches an arbitrary number of lines [✔]
  3243. 913.18 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  3244. 913.18 s [doctest] +++ OK, passed 100 tests.
  3245. 913.18 s [doctest] with WildCardChunk
  3246. 913.18 s [doctest] matches an arbitrary line chunk [✔]
  3247. 913.18 s [doctest] matches an arbitrary line chunk at end [✔]
  3248. 913.18 s [doctest] does not match at end [✔]
  3249. 913.18 s [doctest] does not match at start [✔]
  3250. 913.18 s [doctest] when output does not match
  3251. 913.18 s [doctest] constructs failure message [✔]
  3252. 913.18 s [doctest] constructs failure message for multi-line output [✔]
  3253. 913.18 s [doctest] when any output line contains "unsafe" characters
  3254. 913.18 s [doctest] uses show to format output lines [✔]
  3255. 913.18 s [doctest] insert caret after last matching character on different lengths [✔]
  3256. 913.18 s [doctest] insert caret after mismatching line for multi-line output [✔]
  3257. 913.18 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  3258. 913.18 s [doctest] insert caret after longest match for wildcard [✔]
  3259. 913.18 s [doctest] show expanded pattern for long matches [✔]
  3260. 913.18 s [doctest] Util
  3261. 913.18 s [doctest] convertDosLineEndings
  3262. 913.18 s [doctest] converts CRLF to LF [✔]
  3263. 913.18 s [doctest] strips a trailing CR [✔]
  3264. 913.18 s [doctest] takeWhileEnd
  3265. 913.18 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  3266. 913.18 s [doctest]
  3267. 913.18 s [doctest] Finished in 69.1331 seconds
  3268. 913.18 s [doctest] 198 examples, 0 failures
  3269. 913.22 s [doctest] Test suite spec: PASS
  3270. 913.22 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  3271. 913.22 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  3272. 913.24 s [doctest] checkPhase completed in 1 minutes 10 seconds
  3273. 913.24 s [doctest] Phase: haddockPhase
  3274. 916.57 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  3275. 919.76 s [doctest] Preprocessing library for doctest-0.24.2...
  3276. 919.77 s [doctest] Running Haddock on library for doctest-0.24.2...
  3277. 921.35 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, nothing ) [HIE file is missing]
  3278. 921.53 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, nothing ) [HIE file is missing]
  3279. 922.45 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing ) [HIE file is missing]
  3280. 922.57 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, nothing ) [HIE file is missing]
  3281. 922.67 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, nothing ) [HIE file is missing]
  3282. 922.72 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing ) [HIE file is missing]
  3283. 922.85 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, nothing ) [HIE file is missing]
  3284. 922.90 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, nothing ) [HIE file is missing]
  3285. 923.26 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, nothing ) [HIE file is missing]
  3286. 923.28 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, nothing ) [HIE file is missing]
  3287. 923.31 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, nothing ) [HIE file is missing]
  3288. 923.34 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, nothing ) [HIE file is missing]
  3289. 923.46 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, nothing ) [HIE file is missing]
  3290. 923.63 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing ) [HIE file is missing]
  3291. 923.64 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing ) [HIE file is missing]
  3292. 923.65 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, nothing ) [HIE file is missing]
  3293. 923.66 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, nothing ) [HIE file is missing]
  3294. 924.11 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing ) [HIE file is missing]
  3295. 924.11 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, nothing ) [HIE file is missing]
  3296. 924.23 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing ) [HIE file is missing]
  3297. 924.24 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, nothing ) [HIE file is missing]
  3298. 924.39 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, nothing ) [HIE file is missing]
  3299. 924.44 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, nothing ) [HIE file is missing]
  3300. 924.67 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, nothing ) [HIE file is missing]
  3301. 924.76 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing ) [HIE file is missing]
  3302. 924.77 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, nothing ) [HIE file is missing]
  3303. 924.81 s [doctest] Haddock coverage:
  3304. 925.58 s [doctest] Warning: Imports: Could not find documentation for exported module: Imports
  3305. 925.60 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  3306. 925.60 s [doctest] Missing documentation for:
  3307. 925.60 s [doctest] Module header
  3308. 925.60 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:10)
  3309. 925.60 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  3310. 925.60 s [doctest] Missing documentation for:
  3311. 925.60 s [doctest] Module header
  3312. 925.60 s [doctest] Warning: 'SomeException' is ambiguous. It is defined
  3313. 925.60 s [doctest] * in ‘GHC.Internal.Exception.Type’
  3314. 925.60 s [doctest] * in ‘GHC.Internal.Exception.Type’
  3315. 925.60 s [doctest] You may be able to disambiguate the identifier by qualifying it or
  3316. 925.60 s [doctest] by specifying the type/value namespace explicitly.
  3317. 925.60 s [doctest] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  3318. 925.60 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  3319. 925.60 s [doctest] Missing documentation for:
  3320. 925.60 s [doctest] Module header
  3321. 925.61 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  3322. 925.61 s [doctest] Missing documentation for:
  3323. 925.61 s [doctest] Module header
  3324. 925.61 s [doctest] parseModules (src/Parse.hs:60)
  3325. 925.61 s [doctest] DocTest (src/Parse.hs:29)
  3326. 925.61 s [doctest] ExpectedLine (src/Parse.hs:38)
  3327. 925.61 s [doctest] ExpectedResult (src/Parse.hs:45)
  3328. 925.61 s [doctest] Expression (src/Parse.hs:44)
  3329. 925.61 s [doctest] LineChunk (src/Parse.hs:32)
  3330. 925.61 s [doctest] Warning: 'report_' is out of scope.
  3331. 925.61 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  3332. 925.61 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  3333. 925.61 s [doctest] Missing documentation for:
  3334. 925.61 s [doctest] Module header
  3335. 925.61 s [doctest] defaultConfig (src/Options.hs:68)
  3336. 925.61 s [doctest] doctestWith (src/Run.hs:137)
  3337. 925.61 s [doctest] doctestWithRepl (src/Run.hs:67)
  3338. 925.61 s [doctest] doctestWithResult (src/Run.hs:145)
  3339. 925.61 s [doctest] evaluateResult (src/Run.hs:142)
  3340. 925.61 s [doctest] runDocTests (src/Run.hs:155)
  3341. 925.61 s [doctest] formatSummary (src/Runner.hs:58)
  3342. 925.61 s [doctest] isSuccess (src/Runner.hs:55)
  3343. 925.61 s [doctest] Config (src/Options.hs:58)
  3344. 925.61 s [doctest] Result (src/Run.hs:139)
  3345. 925.61 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  3346. 925.61 s [doctest] Missing documentation for:
  3347. 925.61 s [doctest] Module header
  3348. 944.83 s [doctest] Documentation created: dist/doc/html/doctest,
  3349. 944.83 s [doctest] dist/doc/html/doctest/doctest.txt
  3350. 947.40 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  3351. 947.83 s [doctest] haddockPhase completed in 35 seconds
  3352. 947.83 s [doctest] Phase: installPhase
  3353. 947.91 s [doctest] Installing library in /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  3354. 948.07 s [doctest] Installing executable doctest in /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin
  3355. 948.07 s [doctest] Warning: The directory
  3356. 948.07 s [doctest] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin is not in the
  3357. 948.07 s [doctest] system search path.
  3358. 949.00 s [doctest] Phase: fixupPhase
  3359. 949.03 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2
  3360. 949.03 s [doctest] shrinking /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin/doctest
  3361. 949.30 s [doctest] shrinking /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSdoctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x-ghc9.12.2.so
  3362. 949.32 s [doctest] checking for references to /build/ in /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2...
  3363. 949.44 s [doctest] patching script interpreter paths in /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2
  3364. 949.45 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/lib /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin
  3365. 950.07 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/hrgiasay69psf1833wkwffr73ih824n0-doctest-0.24.2-doc
  3366. 950.08 s [doctest] checking for references to /build/ in /nix/store/hrgiasay69psf1833wkwffr73ih824n0-doctest-0.24.2-doc...
  3367. 950.12 s [doctest] patching script interpreter paths in /nix/store/hrgiasay69psf1833wkwffr73ih824n0-doctest-0.24.2-doc
  3368. 950.43 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/hrgiasay69psf1833wkwffr73ih824n0-doctest-0.24.2-doc /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2
  3369. 951.54 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  3370. 951.56 s [post-build-hook] Uploading to the NixCI cache: /nix/store/hrgiasay69psf1833wkwffr73ih824n0-doctest-0.24.2-doc /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2
  3371. 951.62 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3372. 951.74 s [post-build-hook] copying 1 paths...
  3373. 951.74 s [post-build-hook] copying path '/nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  3374. 992.54 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3375. 992.75 s [post-build-hook] copying 0 paths...
  3376. 992.80 s Progress: 5 of 22 built, 165 of 165 downloaded from cache
  3377. 992.87 s Building duoids
  3378. 992.92 s Building vector
  3379. 992.98 s [duoids] Phase: setupCompilerEnvironmentPhase
  3380. 992.98 s [duoids] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  3381. 993.07 s [vector] Phase: setupCompilerEnvironmentPhase
  3382. 993.08 s [vector] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  3383. 993.24 s [duoids] Phase: unpackPhase
  3384. 993.24 s [duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./core
  3385. 993.25 s [duoids] source root is core
  3386. 993.26 s [duoids] Phase: patchPhase
  3387. 993.27 s [duoids] Phase: compileBuildDriverPhase
  3388. 993.27 s [duoids] setupCompileFlags: -package-db=/build/tmp.QycspMb4vz/setup-package.conf.d -threaded
  3389. 993.35 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.QycspMb4vz/Main.o )
  3390. 993.39 s [vector] Phase: unpackPhase
  3391. 993.40 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  3392. 993.41 s [vector] source root is vector-0.13.2.0
  3393. 993.42 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  3394. 993.43 s [vector] Phase: patchPhase
  3395. 993.43 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  3396. 993.44 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  3397. 993.45 s [duoids] [2 of 2] Linking Setup
  3398. 993.47 s [vector] Phase: compileBuildDriverPhase
  3399. 993.48 s [vector] setupCompileFlags: -package-db=/build/tmp.h4T8RrbkeQ/setup-package.conf.d -threaded
  3400. 993.58 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.h4T8RrbkeQ/Main.o )
  3401. 993.65 s [vector] [2 of 2] Linking Setup
  3402. 996.17 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  3403. 996.19 s [duoids] Phase: configurePhase
  3404. 996.20 s [duoids] configureFlags: --verbose --prefix=/nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.QycspMb4vz/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/lib
  3405. 996.21 s [duoids] Using Parsec parser
  3406. 996.21 s [duoids] Configuring duoids-0.0.1.0...
  3407. 996.29 s [duoids] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  3408. 996.29 s [duoids] 'ghc' version < 9.12):
  3409. 996.29 s [duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  3410. 996.29 s [duoids] 9.12.2
  3411. 996.30 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  3412. 996.31 s [vector] Phase: configurePhase
  3413. 996.32 s [vector] configureFlags: --verbose --prefix=/nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.h4T8RrbkeQ/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/lib
  3414. 996.35 s [vector] Using Parsec parser
  3415. 996.35 s [vector] Configuring vector-0.13.2.0...
  3416. 996.48 s [vector] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  3417. 996.48 s [vector] 'ghc' version < 9.12):
  3418. 996.48 s [vector] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  3419. 996.48 s [vector] 9.12.2
  3420. 996.92 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  3421. 997.22 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  3422. 997.22 s [vector] wall=False
  3423. 997.56 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  3424. 997.56 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  3425. 997.61 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  3426. 997.61 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  3427. 997.61 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  3428. 997.61 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  3429. 997.61 s [duoids] <0.25: using doctest-0.24.2
  3430. 997.61 s [duoids] Dependency duoids: using duoids-0.0.1.0
  3431. 997.61 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  3432. 997.61 s [duoids] Source component graph:
  3433. 997.61 s [duoids] component lib
  3434. 997.61 s [duoids] component test:doctests dependency lib
  3435. 997.61 s [duoids] Configured component graph:
  3436. 997.61 s [duoids] component duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  3437. 997.61 s [duoids] include base-4.21.0.0-d2ce
  3438. 997.61 s [duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  3439. 997.61 s [duoids] component duoids-0.0.1.0-3VdKaHaa2xJLyQ7wyxvGN7-doctests
  3440. 997.61 s [duoids] include base-4.21.0.0-d2ce
  3441. 997.61 s [duoids] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  3442. 997.61 s [duoids] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  3443. 997.61 s [duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  3444. 997.61 s [duoids] Linked component graph:
  3445. 997.61 s [duoids] unit duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  3446. 997.61 s [duoids] include base-4.21.0.0-d2ce
  3447. 997.61 s [duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  3448. 997.61 s [duoids] Control.Duoidal=duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP:Data.Duoid.Laws
  3449. 997.61 s [duoids] unit duoids-0.0.1.0-3VdKaHaa2xJLyQ7wyxvGN7-doctests
  3450. 997.61 s [duoids] include base-4.21.0.0-d2ce
  3451. 997.61 s [duoids] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  3452. 997.61 s [duoids] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  3453. 997.61 s [duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  3454. 997.61 s [duoids] Ready component graph:
  3455. 997.61 s [duoids] definite duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  3456. 997.61 s [duoids] depends base-4.21.0.0-d2ce
  3457. 997.61 s [duoids] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  3458. 997.61 s [duoids] definite duoids-0.0.1.0-3VdKaHaa2xJLyQ7wyxvGN7-doctests
  3459. 997.61 s [duoids] depends base-4.21.0.0-d2ce
  3460. 997.61 s [duoids] depends doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  3461. 997.61 s [duoids] depends duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  3462. 997.61 s [duoids] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  3463. 997.61 s [duoids] Using Cabal-3.14.1.0 compiled by ghc-9.12
  3464. 997.61 s [duoids] Using compiler: ghc-9.12.2
  3465. 997.61 s [duoids] Using install prefix:
  3466. 997.61 s [duoids] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0
  3467. 997.61 s [duoids] Executables installed in:
  3468. 997.61 s [duoids] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/bin
  3469. 997.61 s [duoids] Libraries installed in:
  3470. 997.61 s [duoids] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  3471. 997.61 s [duoids] Dynamic Libraries installed in:
  3472. 997.61 s [duoids] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  3473. 997.61 s [duoids] Private executables installed in:
  3474. 997.61 s [duoids] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-e4b2/duoids-0.0.1.0
  3475. 997.61 s [duoids] Data files installed in:
  3476. 997.61 s [duoids] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/share/x86_64-linux-ghc-9.12.2-e4b2/duoids-0.0.1.0
  3477. 997.61 s [duoids] Documentation installed in:
  3478. 997.61 s [duoids] /nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  3479. 997.61 s [duoids] Configuration files installed in:
  3480. 997.61 s [duoids] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/etc
  3481. 997.61 s [duoids] No alex found
  3482. 997.61 s [duoids] Using ar found on system at:
  3483. 997.61 s [duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  3484. 997.61 s [duoids] No c2hs found
  3485. 997.61 s [duoids] No cpphs found
  3486. 997.61 s [duoids] Using doctest version 0.24.2 found on system at:
  3487. 997.61 s [duoids] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin/doctest
  3488. 997.61 s [duoids] Using gcc version 14.3.0 given by user at:
  3489. 997.61 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  3490. 997.61 s [duoids] Using ghc version 9.12.2 found on system at:
  3491. 997.61 s [duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  3492. 997.61 s [duoids] Using ghc-pkg version 9.12.2 found on system at:
  3493. 997.61 s [duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  3494. 997.61 s [duoids] No ghcjs found
  3495. 997.61 s [duoids] No ghcjs-pkg found
  3496. 997.61 s [duoids] No greencard found
  3497. 997.61 s [duoids] Using haddock version 2.30.0 found on system at:
  3498. 997.61 s [duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  3499. 997.61 s [duoids] No happy found
  3500. 997.61 s [duoids] No haskell-suite found
  3501. 997.61 s [duoids] No haskell-suite-pkg found
  3502. 997.61 s [duoids] No hmake found
  3503. 997.61 s [duoids] Using hpc version 0.69 found on system at:
  3504. 997.61 s [duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  3505. 997.61 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  3506. 997.61 s [duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  3507. 997.61 s [duoids] Using hscolour version 1.25 found on system at:
  3508. 997.61 s [duoids] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  3509. 997.61 s [duoids] No jhc found
  3510. 997.61 s [duoids] Using ld found on system at:
  3511. 997.61 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  3512. 997.61 s [duoids] No pkg-config found
  3513. 997.61 s [duoids] Using runghc version 9.12.2 found on system at:
  3514. 997.61 s [duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  3515. 997.61 s [duoids] Using strip version 2.44 found on system at:
  3516. 997.61 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  3517. 997.61 s [duoids] Using tar found on system at:
  3518. 997.61 s [duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  3519. 997.61 s [duoids] No uhc found
  3520. 997.69 s [vector] Dependency base: using base-4.21.0.0
  3521. 997.69 s [vector] Dependency deepseq: using deepseq-1.5.1.0
  3522. 997.69 s [vector] Dependency primitive: using primitive-0.9.1.0
  3523. 997.69 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  3524. 997.69 s [vector] Dependency base: using base-4.21.0.0
  3525. 997.69 s [vector] Dependency random: using random-1.2.1.3
  3526. 997.69 s [vector] Dependency tasty: using tasty-1.5.3
  3527. 997.69 s [vector] Dependency vector: using vector-0.13.2.0
  3528. 997.69 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  3529. 997.69 s [vector] Dependency base: using base-4.21.0.0
  3530. 997.69 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  3531. 997.69 s [vector] Dependency primitive: using primitive-0.9.1.0
  3532. 997.69 s [vector] Dependency random: using random-1.2.1.3
  3533. 997.69 s [vector] Dependency tasty: using tasty-1.5.3
  3534. 997.69 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  3535. 997.69 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  3536. 997.69 s [vector] Dependency template-haskell: using template-haskell-2.23.0.0
  3537. 997.69 s [vector] Dependency transformers: using transformers-0.6.1.2
  3538. 997.69 s [vector] Dependency vector: using vector-0.13.2.0
  3539. 997.69 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  3540. 997.69 s [vector] Dependency base: using base-4.21.0.0
  3541. 997.69 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  3542. 997.69 s [vector] Dependency primitive: using primitive-0.9.1.0
  3543. 997.69 s [vector] Dependency random: using random-1.2.1.3
  3544. 997.69 s [vector] Dependency tasty: using tasty-1.5.3
  3545. 997.69 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  3546. 997.69 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  3547. 997.69 s [vector] Dependency template-haskell: using template-haskell-2.23.0.0
  3548. 997.69 s [vector] Dependency transformers: using transformers-0.6.1.2
  3549. 997.69 s [vector] Dependency vector: using vector-0.13.2.0
  3550. 997.69 s [vector] Dependency base: using base-4.21.0.0
  3551. 997.69 s [vector] Dependency doctest: using doctest-0.24.2
  3552. 997.69 s [vector] Dependency primitive: using primitive-0.9.1.0
  3553. 997.69 s [vector] Dependency vector: using vector-0.13.2.0
  3554. 997.69 s [vector] Dependency base: using base-4.21.0.0
  3555. 997.69 s [vector] Dependency primitive: using primitive-0.9.1.0
  3556. 997.69 s [vector] Dependency tasty: using tasty-1.5.3
  3557. 997.69 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  3558. 997.69 s [vector] Dependency vector: using vector-0.13.2.0
  3559. 997.69 s [vector] Source component graph:
  3560. 997.69 s [vector] component lib
  3561. 997.69 s [vector] component lib:benchmarks-O2 dependency lib
  3562. 997.69 s [vector] component test:vector-doctest dependency lib
  3563. 997.69 s [vector] component test:vector-inspection dependency lib
  3564. 997.69 s [vector] component test:vector-tests-O0 dependency lib
  3565. 997.69 s [vector] component test:vector-tests-O2 dependency lib
  3566. 997.69 s [vector] Configured component graph:
  3567. 997.69 s [vector] component vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3568. 997.69 s [vector] include base-4.21.0.0-d2ce
  3569. 997.69 s [vector] include deepseq-1.5.1.0-a72f
  3570. 997.69 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3571. 997.69 s [vector] include vector-stream-0.1.0.1-HLLx8mJWHmR2T8fnWYmPCY
  3572. 997.69 s [vector] component vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2
  3573. 997.69 s [vector] include base-4.21.0.0-d2ce
  3574. 997.69 s [vector] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3575. 997.69 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3576. 997.69 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3577. 997.69 s [vector] component vector-0.13.2.0-AD7SNDqt85252M0k463KeB-vector-doctest
  3578. 997.69 s [vector] include base-4.21.0.0-d2ce
  3579. 997.69 s [vector] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  3580. 997.69 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3581. 997.69 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3582. 997.69 s [vector] component vector-0.13.2.0-JxdiT5kzjFE1uD6zfX6fcS-vector-inspection
  3583. 997.69 s [vector] include base-4.21.0.0-d2ce
  3584. 997.69 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3585. 997.69 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3586. 997.69 s [vector] include tasty-inspection-testing-0.2.1-Gw7kp89Jgg1Blz0v9iw5aJ
  3587. 997.69 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3588. 997.69 s [vector] component vector-0.13.2.0-Hjs6KNrLxsC8N8v8uD6Pvh-vector-tests-O0
  3589. 997.69 s [vector] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  3590. 997.69 s [vector] include base-4.21.0.0-d2ce
  3591. 997.69 s [vector] include base-orphans-0.9.3-5mPDkdxLjOIHCheWDdS0JU
  3592. 997.69 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3593. 997.69 s [vector] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3594. 997.69 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3595. 997.69 s [vector] include tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  3596. 997.69 s [vector] include tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  3597. 997.69 s [vector] include template-haskell-2.23.0.0-44ec
  3598. 997.69 s [vector] include transformers-0.6.1.2-c2d4
  3599. 997.69 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3600. 997.69 s [vector] component vector-0.13.2.0-ARIthUbYnGm64gfDG0ZCjN-vector-tests-O2
  3601. 997.69 s [vector] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  3602. 997.69 s [vector] include base-4.21.0.0-d2ce
  3603. 997.69 s [vector] include base-orphans-0.9.3-5mPDkdxLjOIHCheWDdS0JU
  3604. 997.69 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3605. 997.69 s [vector] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3606. 997.69 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3607. 997.69 s [vector] include tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  3608. 997.69 s [vector] include tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  3609. 997.69 s [vector] include template-haskell-2.23.0.0-44ec
  3610. 997.69 s [vector] include transformers-0.6.1.2-c2d4
  3611. 997.69 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3612. 997.69 s [vector] Linked component graph:
  3613. 997.69 s [vector] unit vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3614. 997.69 s [vector] include base-4.21.0.0-d2ce
  3615. 997.69 s [vector] include deepseq-1.5.1.0-a72f
  3616. 997.69 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3617. 997.69 s [vector] include vector-stream-0.1.0.1-HLLx8mJWHmR2T8fnWYmPCY
  3618. 997.69 s [vector] Data.Vector=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL:Data.Vector.Unboxed.Mutable
  3619. 997.69 s [vector] unit vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2
  3620. 997.69 s [vector] include base-4.21.0.0-d2ce
  3621. 997.69 s [vector] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3622. 997.69 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3623. 997.69 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3624. 997.75 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2:Bench.Vector.TestData.ParenTree
  3625. 997.75 s [vector] unit vector-0.13.2.0-AD7SNDqt85252M0k463KeB-vector-doctest
  3626. 997.75 s [vector] include base-4.21.0.0-d2ce
  3627. 997.75 s [vector] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  3628. 997.75 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3629. 997.75 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3630. 997.75 s [vector] unit vector-0.13.2.0-JxdiT5kzjFE1uD6zfX6fcS-vector-inspection
  3631. 997.75 s [vector] include base-4.21.0.0-d2ce
  3632. 997.75 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3633. 997.75 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3634. 997.75 s [vector] include tasty-inspection-testing-0.2.1-Gw7kp89Jgg1Blz0v9iw5aJ
  3635. 997.75 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3636. 997.75 s [vector] unit vector-0.13.2.0-Hjs6KNrLxsC8N8v8uD6Pvh-vector-tests-O0
  3637. 997.75 s [vector] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  3638. 997.75 s [vector] include base-4.21.0.0-d2ce
  3639. 997.75 s [vector] include base-orphans-0.9.3-5mPDkdxLjOIHCheWDdS0JU
  3640. 997.75 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3641. 997.75 s [vector] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3642. 997.75 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3643. 997.75 s [vector] include tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  3644. 997.75 s [vector] include tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  3645. 997.75 s [vector] include template-haskell-2.23.0.0-44ec
  3646. 997.75 s [vector] include transformers-0.6.1.2-c2d4
  3647. 997.75 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3648. 997.75 s [vector] unit vector-0.13.2.0-ARIthUbYnGm64gfDG0ZCjN-vector-tests-O2
  3649. 997.75 s [vector] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  3650. 997.75 s [vector] include base-4.21.0.0-d2ce
  3651. 997.75 s [vector] include base-orphans-0.9.3-5mPDkdxLjOIHCheWDdS0JU
  3652. 997.75 s [vector] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3653. 997.75 s [vector] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3654. 997.75 s [vector] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3655. 997.75 s [vector] include tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  3656. 997.75 s [vector] include tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  3657. 997.75 s [vector] include template-haskell-2.23.0.0-44ec
  3658. 997.75 s [vector] include transformers-0.6.1.2-c2d4
  3659. 997.75 s [vector] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3660. 997.75 s [vector] Ready component graph:
  3661. 997.75 s [vector] definite vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3662. 997.75 s [vector] depends base-4.21.0.0-d2ce
  3663. 997.75 s [vector] depends deepseq-1.5.1.0-a72f
  3664. 997.75 s [vector] depends primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3665. 997.75 s [vector] depends vector-stream-0.1.0.1-HLLx8mJWHmR2T8fnWYmPCY
  3666. 997.75 s [vector] definite vector-0.13.2.0-Hjs6KNrLxsC8N8v8uD6Pvh-vector-tests-O0
  3667. 997.75 s [vector] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  3668. 997.75 s [vector] depends base-4.21.0.0-d2ce
  3669. 997.75 s [vector] depends base-orphans-0.9.3-5mPDkdxLjOIHCheWDdS0JU
  3670. 997.75 s [vector] depends primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3671. 997.75 s [vector] depends random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3672. 997.75 s [vector] depends tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3673. 997.75 s [vector] depends tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  3674. 997.75 s [vector] depends tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  3675. 997.75 s [vector] depends template-haskell-2.23.0.0-44ec
  3676. 997.75 s [vector] depends transformers-0.6.1.2-c2d4
  3677. 997.75 s [vector] depends vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3678. 997.75 s [vector] definite vector-0.13.2.0-JxdiT5kzjFE1uD6zfX6fcS-vector-inspection
  3679. 997.75 s [vector] depends base-4.21.0.0-d2ce
  3680. 997.75 s [vector] depends primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3681. 997.75 s [vector] depends tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3682. 997.75 s [vector] depends tasty-inspection-testing-0.2.1-Gw7kp89Jgg1Blz0v9iw5aJ
  3683. 997.75 s [vector] depends vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3684. 997.75 s [vector] definite vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2
  3685. 997.75 s [vector] depends base-4.21.0.0-d2ce
  3686. 997.75 s [vector] depends random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3687. 997.75 s [vector] depends tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3688. 997.75 s [vector] depends vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3689. 997.75 s [vector] definite vector-0.13.2.0-ARIthUbYnGm64gfDG0ZCjN-vector-tests-O2
  3690. 997.75 s [vector] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  3691. 997.75 s [vector] depends base-4.21.0.0-d2ce
  3692. 997.75 s [vector] depends base-orphans-0.9.3-5mPDkdxLjOIHCheWDdS0JU
  3693. 997.75 s [vector] depends primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3694. 997.75 s [vector] depends random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  3695. 997.75 s [vector] depends tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  3696. 997.75 s [vector] depends tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  3697. 997.75 s [vector] depends tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  3698. 997.75 s [vector] depends template-haskell-2.23.0.0-44ec
  3699. 997.75 s [vector] depends transformers-0.6.1.2-c2d4
  3700. 997.75 s [vector] depends vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3701. 997.75 s [vector] definite vector-0.13.2.0-AD7SNDqt85252M0k463KeB-vector-doctest
  3702. 997.75 s [vector] depends base-4.21.0.0-d2ce
  3703. 997.75 s [vector] depends doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  3704. 997.75 s [vector] depends primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  3705. 997.75 s [vector] depends vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3706. 997.75 s [vector] Using Cabal-3.14.1.0 compiled by ghc-9.12
  3707. 997.75 s [vector] Using compiler: ghc-9.12.2
  3708. 997.75 s [vector] Using install prefix:
  3709. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0
  3710. 997.75 s [vector] Executables installed in:
  3711. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/bin
  3712. 997.75 s [vector] Libraries installed in:
  3713. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  3714. 997.75 s [vector] Dynamic Libraries installed in:
  3715. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  3716. 997.75 s [vector] Private executables installed in:
  3717. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.12.2-e4b2/vector-0.13.2.0
  3718. 997.75 s [vector] Data files installed in:
  3719. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/share/x86_64-linux-ghc-9.12.2-e4b2/vector-0.13.2.0
  3720. 997.75 s [vector] Documentation installed in:
  3721. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.12.2-e4b2/vector-0.13.2.0
  3722. 997.75 s [vector] Configuration files installed in:
  3723. 997.75 s [vector] /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/etc
  3724. 997.75 s [vector] No alex found
  3725. 997.75 s [vector] Using ar found on system at:
  3726. 997.75 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  3727. 997.75 s [vector] No c2hs found
  3728. 997.75 s [vector] No cpphs found
  3729. 997.75 s [vector] Using doctest version 0.24.2 found on system at:
  3730. 997.75 s [vector] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin/doctest
  3731. 997.75 s [vector] Using gcc version 14.3.0 given by user at:
  3732. 997.75 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  3733. 997.75 s [vector] Using ghc version 9.12.2 found on system at:
  3734. 997.75 s [vector] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  3735. 997.75 s [vector] Using ghc-pkg version 9.12.2 found on system at:
  3736. 997.75 s [vector] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  3737. 997.75 s [vector] No ghcjs found
  3738. 997.75 s [vector] No ghcjs-pkg found
  3739. 997.75 s [vector] No greencard found
  3740. 997.75 s [vector] Using haddock version 2.30.0 found on system at:
  3741. 997.75 s [vector] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  3742. 997.75 s [vector] No happy found
  3743. 997.75 s [vector] No haskell-suite found
  3744. 997.75 s [vector] No haskell-suite-pkg found
  3745. 997.75 s [vector] No hmake found
  3746. 997.75 s [vector] Using hpc version 0.69 found on system at:
  3747. 997.75 s [vector] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  3748. 997.75 s [vector] Using hsc2hs version 0.68.10 found on system at:
  3749. 997.75 s [vector] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  3750. 997.75 s [vector] Using hscolour version 1.25 found on system at:
  3751. 997.75 s [vector] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  3752. 997.75 s [vector] No jhc found
  3753. 997.75 s [vector] Using ld found on system at:
  3754. 997.75 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  3755. 997.75 s [vector] No pkg-config found
  3756. 997.75 s [vector] Using runghc version 9.12.2 found on system at:
  3757. 997.75 s [vector] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  3758. 997.75 s [vector] Using strip version 2.44 found on system at:
  3759. 997.75 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  3760. 997.75 s [vector] Using tar found on system at:
  3761. 997.75 s [vector] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  3762. 997.75 s [vector] No uhc found
  3763. 997.75 s [duoids] Phase: buildPhase
  3764. 997.83 s [duoids] Preprocessing library for duoids-0.0.1.0...
  3765. 997.83 s [duoids] Building library for duoids-0.0.1.0...
  3766. 997.96 s [vector] Phase: buildPhase
  3767. 998.01 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 )
  3768. 998.08 s [vector] Preprocessing library for vector-0.13.2.0...
  3769. 998.09 s [vector] Building library for vector-0.13.2.0...
  3770. 999.00 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  3771. 999.10 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 )
  3772. 999.29 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.o, dist/build/Data/Vector/Fusion/Util.dyn_o )
  3773. 999.38 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 )
  3774. 999.90 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 )
  3775. 999.90 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 )
  3776. 999.90 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 )
  3777. 999.90 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 )
  3778. 1001.72 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  3779. 1005.09 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 )
  3780. 1005.17 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 )
  3781. 1005.17 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 )
  3782. 1005.71 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  3783. 1006.66 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  3784. 1008.88 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  3785. 1009.49 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 )
  3786. 1013.16 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  3787. 1013.75 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  3788. 1013.79 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  3789. 1015.76 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 )
  3790. 1022.77 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 )
  3791. 1023.41 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  3792. 1023.41 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  3793. 1023.71 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  3794. 1023.98 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 )
  3795. 1024.60 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  3796. 1026.38 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  3797. 1035.52 s [duoids] buildPhase completed in 38 seconds
  3798. 1035.53 s [duoids] Phase: checkPhase
  3799. 1036.61 s [duoids] Running 1 test suites...
  3800. 1036.61 s [duoids] Test suite doctests: RUNNING...
  3801. 1037.80 s [duoids] on the commandline: warning: [GHC-98887]
  3802. 1037.80 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3803. 1037.80 s [duoids]
  3804. 1037.81 s [duoids] on the commandline: warning: [GHC-98887]
  3805. 1037.81 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3806. 1037.81 s [duoids]
  3807. 1037.82 s [duoids] on the commandline: warning: [GHC-98887]
  3808. 1037.82 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3809. 1037.82 s [duoids]
  3810. 1037.82 s [duoids] on the commandline: warning: [GHC-98887]
  3811. 1037.82 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3812. 1037.82 s [duoids]
  3813. 1037.83 s [duoids] on the commandline: warning: [GHC-98887]
  3814. 1037.83 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3815. 1037.83 s [duoids]
  3816. 1037.84 s [duoids] on the commandline: warning: [GHC-98887]
  3817. 1037.84 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3818. 1037.84 s [duoids]
  3819. 1037.85 s [duoids] on the commandline: warning: [GHC-98887]
  3820. 1037.85 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3821. 1037.85 s [duoids]
  3822. 1037.86 s [duoids] on the commandline: warning: [GHC-98887]
  3823. 1037.86 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3824. 1037.86 s [duoids]
  3825. 1037.88 s [duoids] on the commandline: warning: [GHC-98887]
  3826. 1037.88 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3827. 1037.88 s [duoids]
  3828. 1037.89 s [duoids] on the commandline: warning: [GHC-98887]
  3829. 1037.89 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3830. 1037.89 s [duoids]
  3831. 1041.69 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  3832. 1041.86 s [duoids] NameLib Nothing
  3833. 1041.86 s [duoids] ----------------------------------------
  3834. 1041.91 s [duoids] Test suite doctests: PASS
  3835. 1041.91 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  3836. 1041.91 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  3837. 1041.94 s [duoids] Phase: haddockPhase
  3838. 1046.49 s [duoids] Preprocessing library for duoids-0.0.1.0...
  3839. 1046.49 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  3840. 1047.29 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 )
  3841. 1047.34 s [vector] src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
  3842. 1047.34 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  3843. 1047.34 s [vector] • In the data declaration for ‘MVector’
  3844. 1047.34 s [vector] |
  3845. 1047.34 s [vector] 99 | deriving ( Typeable )
  3846. 1047.34 s [vector] | ^^^^^^^^
  3847. 1047.34 s [vector]
  3848. 1047.34 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  3849. 1048.08 s [vector] src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
  3850. 1048.08 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  3851. 1048.08 s [vector] • In the data declaration for ‘Vector’
  3852. 1048.08 s [vector] |
  3853. 1048.08 s [vector] 222 | deriving ( Typeable )
  3854. 1048.08 s [vector] | ^^^^^^^^
  3855. 1048.08 s [vector]
  3856. 1048.64 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing ) [HIE file is missing]
  3857. 1049.52 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing ) [HIE file is missing]
  3858. 1051.05 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing ) [HIE file is missing]
  3859. 1053.01 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing ) [HIE file is missing]
  3860. 1053.05 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing ) [HIE file is missing]
  3861. 1053.13 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing ) [HIE file is missing]
  3862. 1053.20 s [duoids] Haddock coverage:
  3863. 1053.20 s [duoids] Warning: 'Alternative' is out of scope.
  3864. 1053.20 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3865. 1053.21 s [duoids] Warning: 'Applicative' is out of scope.
  3866. 1053.21 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3867. 1053.21 s [duoids] Warning: 'cancel' is out of scope.
  3868. 1053.21 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3869. 1054.54 s [duoids] Warning: 'Par' is ambiguous. It is defined
  3870. 1054.54 s [duoids] * at src/Data/Duoid.hs:62:5
  3871. 1054.54 s [duoids] * at src/Data/Duoid.hs:58:1
  3872. 1054.54 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3873. 1054.54 s [duoids] by specifying the type/value namespace explicitly.
  3874. 1054.54 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  3875. 1054.54 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  3876. 1054.54 s [duoids] * at src/Data/Duoid.hs:118:5
  3877. 1054.54 s [duoids] * at src/Data/Duoid.hs:114:1
  3878. 1054.54 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3879. 1054.54 s [duoids] by specifying the type/value namespace explicitly.
  3880. 1054.54 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  3881. 1054.55 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  3882. 1054.55 s [duoids] Warning: 'ExceptT' is out of scope.
  3883. 1054.56 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3884. 1054.56 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  3885. 1054.56 s [duoids] * at src/Control/Duoidal.hs:238:5
  3886. 1054.56 s [duoids] * at src/Control/Duoidal.hs:234:1
  3887. 1054.56 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3888. 1054.56 s [duoids] by specifying the type/value namespace explicitly.
  3889. 1054.56 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  3890. 1054.56 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  3891. 1054.56 s [duoids] * at src/Control/Duoidal.hs:308:5
  3892. 1054.56 s [duoids] * at src/Control/Duoidal.hs:304:1
  3893. 1054.56 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3894. 1054.56 s [duoids] by specifying the type/value namespace explicitly.
  3895. 1054.56 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  3896. 1054.56 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  3897. 1054.56 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3898. 1054.56 s [duoids] Warning: 'Validation' is out of scope.
  3899. 1054.56 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3900. 1054.56 s [duoids] Warning: 'fail' is out of scope.
  3901. 1054.56 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3902. 1054.56 s [duoids] Warning: 'MonadFail' is out of scope.
  3903. 1054.56 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3904. 1054.57 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  3905. 1054.57 s [duoids] * at src/Control/Duoidal.hs:774:5
  3906. 1054.57 s [duoids] * at src/Control/Duoidal.hs:770:1
  3907. 1054.57 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3908. 1054.57 s [duoids] by specifying the type/value namespace explicitly.
  3909. 1054.57 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  3910. 1054.57 s [duoids] Warning: 'Writer' is out of scope.
  3911. 1054.57 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3912. 1054.57 s [duoids] Warning: 'Set' is out of scope.
  3913. 1054.57 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3914. 1054.57 s [duoids] Warning: 'Char' is out of scope.
  3915. 1054.57 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3916. 1054.58 s [duoids] Warning: 'Const' is ambiguous. It is defined
  3917. 1054.58 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  3918. 1054.58 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  3919. 1054.58 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3920. 1054.58 s [duoids] by specifying the type/value namespace explicitly.
  3921. 1054.58 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  3922. 1054.58 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  3923. 1054.58 s [duoids] * at src/Control/Duoidal.hs:395:1
  3924. 1054.58 s [duoids] * at src/Data/Duoid.hs:183:1
  3925. 1054.58 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3926. 1054.58 s [duoids] by specifying the type/value namespace explicitly.
  3927. 1054.58 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  3928. 1054.58 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  3929. 1054.58 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  3930. 1054.59 s [duoids] Warning: 'Normal' is out of scope.
  3931. 1054.59 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3932. 1054.59 s [duoids] Warning: 'Law' is ambiguous. It is defined
  3933. 1054.59 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  3934. 1054.59 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  3935. 1054.59 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3936. 1054.59 s [duoids] by specifying the type/value namespace explicitly.
  3937. 1054.59 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  3938. 1054.59 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  3939. 1054.59 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  3940. 1055.12 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  3941. 1055.12 s [duoids] - Data.Duoid.Rep1_Comm
  3942. 1055.12 s [duoids] - Data.Duoid.Rep1_Par
  3943. 1055.12 s [duoids] - Data.Duoid.Rep1_Seq
  3944. 1055.12 s [duoids] - Data.Duoid.Rep_Comm
  3945. 1055.12 s [duoids] - Data.Duoid.Rep_Par
  3946. 1055.12 s [duoids] - Data.Duoid.Rep_Seq
  3947. 1055.17 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  3948. 1055.17 s [duoids] - Control.Duoidal.Rep1_Commutative
  3949. 1055.17 s [duoids] - Control.Duoidal.Rep1_Parallel
  3950. 1055.17 s [duoids] - Control.Duoidal.Rep1_Sequential
  3951. 1055.17 s [duoids] - Control.Duoidal.Rep_Commutative
  3952. 1055.17 s [duoids] - Control.Duoidal.Rep_Parallel
  3953. 1055.17 s [duoids] - Control.Duoidal.Rep_Sequential
  3954. 1055.17 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  3955. 1055.17 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  3956. 1055.17 s [duoids] - Data.Duoid.Laws.Rep_Law
  3957. 1055.17 s [duoids] - Data.Duoid.Laws.Rep_Laws
  3958. 1055.17 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  3959. 1068.75 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 )
  3960. 1068.78 s [vector] src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
  3961. 1068.78 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  3962. 1068.78 s [vector] • In the data declaration for ‘MVector’
  3963. 1068.78 s [vector] |
  3964. 1068.78 s [vector] 115 | deriving ( Typeable )
  3965. 1068.79 s [vector] | ^^^^^^^^
  3966. 1068.79 s [vector]
  3967. 1068.79 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 )
  3968. 1068.79 s [vector] src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
  3969. 1068.79 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  3970. 1068.79 s [vector] • In the data declaration for ‘Vector’
  3971. 1068.79 s [vector] |
  3972. 1068.79 s [vector] 209 | deriving ( Typeable )
  3973. 1068.79 s [vector] | ^^^^^^^^
  3974. 1068.79 s [vector]
  3975. 1068.79 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 )
  3976. 1068.79 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 )
  3977. 1068.79 s [vector] src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
  3978. 1068.79 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  3979. 1068.79 s [vector] • In the data declaration for ‘MVector’
  3980. 1068.79 s [vector] |
  3981. 1068.79 s [vector] 134 | deriving ( Typeable )
  3982. 1068.79 s [vector] | ^^^^^^^^
  3983. 1068.79 s [vector]
  3984. 1068.79 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 )
  3985. 1068.79 s [vector] src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
  3986. 1068.79 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  3987. 1068.79 s [vector] • In the data declaration for ‘Vector’
  3988. 1068.79 s [vector] |
  3989. 1068.79 s [vector] 219 | deriving ( Typeable )
  3990. 1068.79 s [vector] | ^^^^^^^^
  3991. 1068.79 s [vector]
  3992. 1071.09 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 )
  3993. 1071.10 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  3994. 1071.10 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  3995. 1071.10 s [vector] • In the newtype declaration for ‘MVector’
  3996. 1071.10 s [vector] |
  3997. 1071.10 s [vector] 97 | deriving ( Typeable )
  3998. 1071.10 s [vector] | ^^^^^^^^
  3999. 1071.10 s [vector]
  4000. 1071.10 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 )
  4001. 1071.10 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  4002. 1071.10 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4003. 1071.10 s [vector] • In the newtype declaration for ‘Vector’
  4004. 1071.10 s [vector] |
  4005. 1071.10 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  4006. 1071.10 s [vector] | ^^^^^^^^
  4007. 1071.10 s [vector]
  4008. 1084.88 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 )
  4009. 1084.95 s [duoids] Documentation created: dist/doc/html/duoids, dist/doc/html/duoids/duoids.txt
  4010. 1085.59 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  4011. 1085.59 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4012. 1085.59 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  4013. 1085.59 s [vector] |
  4014. 1085.59 s [vector] 97 | deriving instance Typeable Vector
  4015. 1085.59 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4016. 1085.59 s [vector]
  4017. 1085.59 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  4018. 1085.59 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4019. 1085.59 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  4020. 1085.59 s [vector] |
  4021. 1085.59 s [vector] 98 | deriving instance Typeable MVector
  4022. 1085.59 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4023. 1085.59 s [vector]
  4024. 1087.93 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  4025. 1088.44 s [duoids] haddockPhase completed in 47 seconds
  4026. 1088.44 s [duoids] Phase: installPhase
  4027. 1088.68 s [duoids] Installing library in /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  4028. 1089.89 s [duoids] Phase: fixupPhase
  4029. 1089.94 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0
  4030. 1090.00 s [duoids] shrinking /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSduoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP-ghc9.12.2.so
  4031. 1090.00 s [duoids] checking for references to /build/ in /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0...
  4032. 1090.07 s [duoids] patching script interpreter paths in /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0
  4033. 1090.08 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/lib
  4034. 1090.57 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc
  4035. 1090.59 s [duoids] checking for references to /build/ in /nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc...
  4036. 1090.67 s [duoids] patching script interpreter paths in /nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc
  4037. 1091.24 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0 /nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc
  4038. 1092.94 s [post-build-hook] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  4039. 1092.94 s [post-build-hook]
  4040. 1093.32 s [post-build-hook] Pushing /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0 (8.01 MiB)
  4041. 1093.50 s [post-build-hook] Pushing /nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc (2.26 MiB)
  4042. 1094.62 s [post-build-hook]
  4043. 1094.62 s [post-build-hook] All done.
  4044. 1094.75 s [post-build-hook] Uploading to the NixCI cache: /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0 /nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc
  4045. 1095.22 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4046. 1095.27 s [post-build-hook] copying 2 paths...
  4047. 1095.31 s [post-build-hook] copying path '/nix/store/viq9n71lb271ws6cr5a6dz12x35pcvh2-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4048. 1096.29 s [post-build-hook] copying path '/nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  4049. 1101.25 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4050. 1101.79 s [post-build-hook] copying 1 paths...
  4051. 1101.83 s [post-build-hook] copying path '/nix/store/gqj54lfvvx154nfh3dwcr2x950cxrd0c-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4052. 1102.31 s Progress: 6 of 22 built (1 building), 165 of 165 downloaded from cache
  4053. 1102.49 s Building duoidal-transformers
  4054. 1102.69 s Building duoids-hedgehog
  4055. 1102.69 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 )
  4056. 1102.70 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  4057. 1102.71 s [duoidal-transformers] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  4058. 1103.05 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  4059. 1103.06 s [duoids-hedgehog] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  4060. 1103.38 s [duoidal-transformers] Phase: unpackPhase
  4061. 1103.40 s [duoidal-transformers] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./transformers
  4062. 1103.43 s [duoidal-transformers] source root is transformers
  4063. 1103.46 s [duoidal-transformers] Phase: patchPhase
  4064. 1103.51 s [duoidal-transformers] Phase: compileBuildDriverPhase
  4065. 1103.53 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.ubyMfkGRSj/setup-package.conf.d -threaded
  4066. 1103.84 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ubyMfkGRSj/Main.o )
  4067. 1104.10 s [duoidal-transformers] [2 of 2] Linking Setup
  4068. 1104.25 s [duoids-hedgehog] Phase: unpackPhase
  4069. 1104.26 s [duoids-hedgehog] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./hedgehog
  4070. 1104.29 s [duoids-hedgehog] source root is hedgehog
  4071. 1104.34 s [duoids-hedgehog] Phase: patchPhase
  4072. 1104.38 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  4073. 1104.39 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.3oKvKt3FNo/setup-package.conf.d -threaded
  4074. 1104.64 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.3oKvKt3FNo/Main.o )
  4075. 1104.89 s [duoids-hedgehog] [2 of 2] Linking Setup
  4076. 1107.93 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  4077. 1107.97 s [duoidal-transformers] Phase: configurePhase
  4078. 1108.01 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.ubyMfkGRSj/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/lib
  4079. 1108.03 s [duoidal-transformers] Using Parsec parser
  4080. 1108.03 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  4081. 1108.19 s [duoidal-transformers] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  4082. 1108.19 s [duoidal-transformers] 'ghc' version < 9.12):
  4083. 1108.19 s [duoidal-transformers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  4084. 1108.19 s [duoidal-transformers] 9.12.2
  4085. 1108.98 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  4086. 1109.00 s [duoids-hedgehog] Phase: configurePhase
  4087. 1109.01 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.3oKvKt3FNo/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/lib
  4088. 1109.08 s [duoids-hedgehog] Using Parsec parser
  4089. 1109.08 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  4090. 1109.12 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  4091. 1109.23 s [duoids-hedgehog] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  4092. 1109.23 s [duoids-hedgehog] 'ghc' version < 9.12):
  4093. 1109.23 s [duoids-hedgehog] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  4094. 1109.23 s [duoids-hedgehog] 9.12.2
  4095. 1110.09 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4096. 1110.09 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  4097. 1110.09 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4098. 1110.09 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4099. 1110.09 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.2
  4100. 1110.09 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4101. 1110.09 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  4102. 1110.09 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  4103. 1110.09 s [duoidal-transformers] <0.25: using doctest-0.24.2
  4104. 1110.09 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  4105. 1110.09 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4106. 1110.09 s [duoidal-transformers] Source component graph:
  4107. 1110.09 s [duoidal-transformers] component lib
  4108. 1110.09 s [duoidal-transformers] component test:doctests dependency lib
  4109. 1110.09 s [duoidal-transformers] Configured component graph:
  4110. 1110.09 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4111. 1110.09 s [duoidal-transformers] include base-4.21.0.0-d2ce
  4112. 1110.09 s [duoidal-transformers] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  4113. 1110.09 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4114. 1110.09 s [duoidal-transformers] include transformers-0.6.1.2-c2d4
  4115. 1110.09 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-Hl5SKcw2LCKFTyz0IX3S2S-doctests
  4116. 1110.09 s [duoidal-transformers] include base-4.21.0.0-d2ce
  4117. 1110.09 s [duoidal-transformers] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  4118. 1110.09 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4119. 1110.09 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4120. 1110.09 s [duoidal-transformers] Linked component graph:
  4121. 1110.09 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4122. 1110.09 s [duoidal-transformers] include base-4.21.0.0-d2ce
  4123. 1110.09 s [duoidal-transformers] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  4124. 1110.09 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4125. 1110.09 s [duoidal-transformers] include transformers-0.6.1.2-c2d4
  4126. 1110.09 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt:Control.Duoidal.Trans.Orphans
  4127. 1110.09 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-Hl5SKcw2LCKFTyz0IX3S2S-doctests
  4128. 1110.09 s [duoidal-transformers] include base-4.21.0.0-d2ce
  4129. 1110.09 s [duoidal-transformers] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  4130. 1110.09 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4131. 1110.09 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4132. 1110.09 s [duoidal-transformers] Ready component graph:
  4133. 1110.09 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4134. 1110.09 s [duoidal-transformers] depends base-4.21.0.0-d2ce
  4135. 1110.09 s [duoidal-transformers] depends duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  4136. 1110.09 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4137. 1110.09 s [duoidal-transformers] depends transformers-0.6.1.2-c2d4
  4138. 1110.09 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-Hl5SKcw2LCKFTyz0IX3S2S-doctests
  4139. 1110.09 s [duoidal-transformers] depends base-4.21.0.0-d2ce
  4140. 1110.09 s [duoidal-transformers] depends doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  4141. 1110.09 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4142. 1110.09 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4143. 1110.09 s [duoidal-transformers] Using Cabal-3.14.1.0 compiled by ghc-9.12
  4144. 1110.09 s [duoidal-transformers] Using compiler: ghc-9.12.2
  4145. 1110.10 s [duoidal-transformers] Using install prefix:
  4146. 1110.10 s [duoidal-transformers] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0
  4147. 1110.10 s [duoidal-transformers] Executables installed in:
  4148. 1110.10 s [duoidal-transformers] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/bin
  4149. 1110.10 s [duoidal-transformers] Libraries installed in:
  4150. 1110.10 s [duoidal-transformers] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4151. 1110.10 s [duoidal-transformers] Dynamic Libraries installed in:
  4152. 1110.10 s [duoidal-transformers] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  4153. 1110.10 s [duoidal-transformers] Private executables installed in:
  4154. 1110.10 s [duoidal-transformers] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-e4b2/duoidal-transformers-0.0.1.0
  4155. 1110.10 s [duoidal-transformers] Data files installed in:
  4156. 1110.10 s [duoidal-transformers] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.12.2-e4b2/duoidal-transformers-0.0.1.0
  4157. 1110.10 s [duoidal-transformers] Documentation installed in:
  4158. 1110.10 s [duoidal-transformers] /nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  4159. 1110.10 s [duoidal-transformers] Configuration files installed in:
  4160. 1110.10 s [duoidal-transformers] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/etc
  4161. 1110.10 s [duoidal-transformers] No alex found
  4162. 1110.10 s [duoidal-transformers] Using ar found on system at:
  4163. 1110.10 s [duoidal-transformers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  4164. 1110.10 s [duoidal-transformers] No c2hs found
  4165. 1110.10 s [duoidal-transformers] No cpphs found
  4166. 1110.10 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  4167. 1110.10 s [duoidal-transformers] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin/doctest
  4168. 1110.10 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  4169. 1110.10 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  4170. 1110.10 s [duoidal-transformers] Using ghc version 9.12.2 found on system at:
  4171. 1110.10 s [duoidal-transformers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  4172. 1110.10 s [duoidal-transformers] Using ghc-pkg version 9.12.2 found on system at:
  4173. 1110.10 s [duoidal-transformers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  4174. 1110.10 s [duoidal-transformers] No ghcjs found
  4175. 1110.10 s [duoidal-transformers] No ghcjs-pkg found
  4176. 1110.10 s [duoidal-transformers] No greencard found
  4177. 1110.10 s [duoidal-transformers] Using haddock version 2.30.0 found on system at:
  4178. 1110.10 s [duoidal-transformers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  4179. 1110.10 s [duoidal-transformers] No happy found
  4180. 1110.10 s [duoidal-transformers] No haskell-suite found
  4181. 1110.10 s [duoidal-transformers] No haskell-suite-pkg found
  4182. 1110.10 s [duoidal-transformers] No hmake found
  4183. 1110.10 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  4184. 1110.10 s [duoidal-transformers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  4185. 1110.10 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  4186. 1110.10 s [duoidal-transformers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  4187. 1110.10 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  4188. 1110.10 s [duoidal-transformers] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  4189. 1110.10 s [duoidal-transformers] No jhc found
  4190. 1110.10 s [duoidal-transformers] Using ld found on system at:
  4191. 1110.10 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  4192. 1110.10 s [duoidal-transformers] No pkg-config found
  4193. 1110.10 s [duoidal-transformers] Using runghc version 9.12.2 found on system at:
  4194. 1110.10 s [duoidal-transformers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  4195. 1110.10 s [duoidal-transformers] Using strip version 2.44 found on system at:
  4196. 1110.10 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  4197. 1110.10 s [duoidal-transformers] Using tar found on system at:
  4198. 1110.10 s [duoidal-transformers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  4199. 1110.10 s [duoidal-transformers] No uhc found
  4200. 1110.54 s [duoidal-transformers] Phase: buildPhase
  4201. 1110.61 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  4202. 1110.78 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  4203. 1110.78 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  4204. 1111.16 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 )
  4205. 1111.60 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4206. 1111.60 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  4207. 1111.60 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4208. 1111.60 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4209. 1111.60 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4210. 1111.60 s [duoids-hedgehog] hedgehog-1.5
  4211. 1111.60 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4212. 1111.60 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  4213. 1111.60 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4214. 1111.61 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4215. 1111.61 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4216. 1111.61 s [duoids-hedgehog] hedgehog-1.5
  4217. 1111.61 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4218. 1111.61 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  4219. 1111.61 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  4220. 1111.61 s [duoids-hedgehog] <0.25: using doctest-0.24.2
  4221. 1111.61 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4222. 1111.61 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4223. 1111.61 s [duoids-hedgehog] Source component graph:
  4224. 1111.61 s [duoids-hedgehog] component lib
  4225. 1111.61 s [duoids-hedgehog] component test:doctests dependency lib
  4226. 1111.61 s [duoids-hedgehog] component test:laws dependency lib
  4227. 1111.61 s [duoids-hedgehog] Configured component graph:
  4228. 1111.61 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4229. 1111.61 s [duoids-hedgehog] include base-4.21.0.0-d2ce
  4230. 1111.61 s [duoids-hedgehog] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  4231. 1111.61 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4232. 1111.61 s [duoids-hedgehog] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  4233. 1111.61 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-IvkSAXHKD8d7jNcNmG9mEz-doctests
  4234. 1111.61 s [duoids-hedgehog] include base-4.21.0.0-d2ce
  4235. 1111.61 s [duoids-hedgehog] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  4236. 1111.61 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4237. 1111.61 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4238. 1111.61 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-7aZMlINmXaY765pqxgGmd6-laws
  4239. 1111.61 s [duoids-hedgehog] include base-4.21.0.0-d2ce
  4240. 1111.61 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4241. 1111.61 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4242. 1111.61 s [duoids-hedgehog] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  4243. 1111.61 s [duoids-hedgehog] Linked component graph:
  4244. 1111.61 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4245. 1111.61 s [duoids-hedgehog] include base-4.21.0.0-d2ce
  4246. 1111.61 s [duoids-hedgehog] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  4247. 1111.61 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4248. 1111.61 s [duoids-hedgehog] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  4249. 1111.61 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF:Test.Duoidal
  4250. 1111.61 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-IvkSAXHKD8d7jNcNmG9mEz-doctests
  4251. 1111.61 s [duoids-hedgehog] include base-4.21.0.0-d2ce
  4252. 1111.61 s [duoids-hedgehog] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  4253. 1111.61 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4254. 1111.61 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4255. 1111.61 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-7aZMlINmXaY765pqxgGmd6-laws
  4256. 1111.61 s [duoids-hedgehog] include base-4.21.0.0-d2ce
  4257. 1111.61 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4258. 1111.61 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4259. 1111.61 s [duoids-hedgehog] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  4260. 1111.61 s [duoids-hedgehog] Ready component graph:
  4261. 1111.61 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4262. 1111.61 s [duoids-hedgehog] depends base-4.21.0.0-d2ce
  4263. 1111.61 s [duoids-hedgehog] depends duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  4264. 1111.61 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4265. 1111.61 s [duoids-hedgehog] depends hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  4266. 1111.61 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-7aZMlINmXaY765pqxgGmd6-laws
  4267. 1111.61 s [duoids-hedgehog] depends base-4.21.0.0-d2ce
  4268. 1111.61 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4269. 1111.61 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4270. 1111.61 s [duoids-hedgehog] depends hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  4271. 1111.61 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-IvkSAXHKD8d7jNcNmG9mEz-doctests
  4272. 1111.61 s [duoids-hedgehog] depends base-4.21.0.0-d2ce
  4273. 1111.61 s [duoids-hedgehog] depends doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  4274. 1111.61 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4275. 1111.61 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  4276. 1111.61 s [duoids-hedgehog] Using Cabal-3.14.1.0 compiled by ghc-9.12
  4277. 1111.61 s [duoids-hedgehog] Using compiler: ghc-9.12.2
  4278. 1111.61 s [duoids-hedgehog] Using install prefix:
  4279. 1111.61 s [duoids-hedgehog] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0
  4280. 1111.61 s [duoids-hedgehog] Executables installed in:
  4281. 1111.61 s [duoids-hedgehog] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/bin
  4282. 1111.61 s [duoids-hedgehog] Libraries installed in:
  4283. 1111.61 s [duoids-hedgehog] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4284. 1111.61 s [duoids-hedgehog] Dynamic Libraries installed in:
  4285. 1111.61 s [duoids-hedgehog] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  4286. 1111.61 s [duoids-hedgehog] Private executables installed in:
  4287. 1111.61 s [duoids-hedgehog] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-e4b2/duoids-hedgehog-0.0.1.0
  4288. 1111.61 s [duoids-hedgehog] Data files installed in:
  4289. 1111.61 s [duoids-hedgehog] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.12.2-e4b2/duoids-hedgehog-0.0.1.0
  4290. 1111.61 s [duoids-hedgehog] Documentation installed in:
  4291. 1111.61 s [duoids-hedgehog] /nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  4292. 1111.61 s [duoids-hedgehog] Configuration files installed in:
  4293. 1111.61 s [duoids-hedgehog] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/etc
  4294. 1111.61 s [duoids-hedgehog] No alex found
  4295. 1111.61 s [duoids-hedgehog] Using ar found on system at:
  4296. 1111.61 s [duoids-hedgehog] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  4297. 1111.61 s [duoids-hedgehog] No c2hs found
  4298. 1111.61 s [duoids-hedgehog] No cpphs found
  4299. 1111.61 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  4300. 1111.61 s [duoids-hedgehog] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin/doctest
  4301. 1111.61 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  4302. 1111.61 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  4303. 1111.61 s [duoids-hedgehog] Using ghc version 9.12.2 found on system at:
  4304. 1111.61 s [duoids-hedgehog] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  4305. 1111.61 s [duoids-hedgehog] Using ghc-pkg version 9.12.2 found on system at:
  4306. 1111.61 s [duoids-hedgehog] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  4307. 1111.61 s [duoids-hedgehog] No ghcjs found
  4308. 1111.61 s [duoids-hedgehog] No ghcjs-pkg found
  4309. 1111.61 s [duoids-hedgehog] No greencard found
  4310. 1111.61 s [duoids-hedgehog] Using haddock version 2.30.0 found on system at:
  4311. 1111.61 s [duoids-hedgehog] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  4312. 1111.61 s [duoids-hedgehog] No happy found
  4313. 1111.61 s [duoids-hedgehog] No haskell-suite found
  4314. 1111.61 s [duoids-hedgehog] No haskell-suite-pkg found
  4315. 1111.61 s [duoids-hedgehog] No hmake found
  4316. 1111.61 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  4317. 1111.61 s [duoids-hedgehog] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  4318. 1111.61 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  4319. 1111.62 s [duoids-hedgehog] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  4320. 1111.62 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  4321. 1111.62 s [duoids-hedgehog] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  4322. 1111.62 s [duoids-hedgehog] No jhc found
  4323. 1111.62 s [duoids-hedgehog] Using ld found on system at:
  4324. 1111.62 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  4325. 1111.62 s [duoids-hedgehog] No pkg-config found
  4326. 1111.62 s [duoids-hedgehog] Using runghc version 9.12.2 found on system at:
  4327. 1111.62 s [duoids-hedgehog] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  4328. 1111.62 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  4329. 1111.62 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  4330. 1111.62 s [duoids-hedgehog] Using tar found on system at:
  4331. 1111.62 s [duoids-hedgehog] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  4332. 1111.62 s [duoids-hedgehog] No uhc found
  4333. 1111.82 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 )
  4334. 1112.04 s [duoids-hedgehog] Phase: buildPhase
  4335. 1112.41 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  4336. 1112.41 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  4337. 1113.00 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  4338. 1113.31 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 )
  4339. 1114.16 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 )
  4340. 1114.94 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  4341. 1115.57 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  4342. 1117.52 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  4343. 1121.94 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 )
  4344. 1125.08 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 )
  4345. 1125.80 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  4346. 1125.98 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 )
  4347. 1126.35 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4348. 1126.35 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4349. 1126.58 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 )
  4350. 1126.58 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  4351. 1126.58 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  4352. 1126.58 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 )
  4353. 1126.67 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4354. 1127.70 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4355. 1129.17 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  4356. 1129.91 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4357. 1129.91 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4358. 1130.23 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  4359. 1132.74 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  4360. 1134.91 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4361. 1134.92 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4362. 1135.28 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4363. 1136.21 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4364. 1137.80 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  4365. 1138.82 s [duoidal-transformers] Phase: checkPhase
  4366. 1139.54 s [duoidal-transformers] Running 1 test suites...
  4367. 1139.54 s [duoidal-transformers] Test suite doctests: RUNNING...
  4368. 1139.84 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  4369. 1140.32 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4370. 1140.35 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4371. 1140.36 s [duoidal-transformers]
  4372. 1140.36 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4373. 1140.36 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4374. 1140.36 s [duoidal-transformers]
  4375. 1140.36 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4376. 1140.36 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4377. 1140.36 s [duoidal-transformers]
  4378. 1140.97 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  4379. 1141.07 s [duoidal-transformers] NameLib Nothing
  4380. 1141.07 s [duoidal-transformers] ----------------------------------------
  4381. 1141.09 s [duoidal-transformers] Test suite doctests: PASS
  4382. 1141.09 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  4383. 1141.09 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  4384. 1141.11 s [duoidal-transformers] Phase: haddockPhase
  4385. 1144.03 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  4386. 1144.03 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  4387. 1145.18 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing ) [HIE file is missing]
  4388. 1145.66 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing ) [HIE file is missing]
  4389. 1145.89 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  4390. 1146.05 s [duoidal-transformers] Haddock coverage:
  4391. 1146.05 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  4392. 1146.05 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  4393. 1146.39 s [duoids-hedgehog] buildPhase completed in 35 seconds
  4394. 1146.39 s [duoids-hedgehog] Phase: checkPhase
  4395. 1147.01 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  4396. 1147.01 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  4397. 1147.27 s [duoids-hedgehog] Running 2 test suites...
  4398. 1147.27 s [duoids-hedgehog] Test suite laws: RUNNING...
  4399. 1147.28 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  4400. 1147.29 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4401. 1147.29 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4402. 1147.29 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4403. 1147.29 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4404. 1147.29 s [duoids-hedgehog] ✓ 4 succeeded.
  4405. 1147.29 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  4406. 1147.29 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4407. 1147.29 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4408. 1147.29 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4409. 1147.29 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4410. 1147.29 s [duoids-hedgehog] ✓ 4 succeeded.
  4411. 1147.29 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  4412. 1147.29 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4413. 1147.29 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4414. 1147.29 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4415. 1147.29 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4416. 1147.29 s [duoids-hedgehog] ✓ 4 succeeded.
  4417. 1147.29 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  4418. 1147.30 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4419. 1147.30 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4420. 1147.30 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4421. 1147.30 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4422. 1147.30 s [duoids-hedgehog] ✓ 4 succeeded.
  4423. 1147.30 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  4424. 1147.30 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4425. 1147.30 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4426. 1147.30 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4427. 1147.30 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4428. 1147.30 s [duoids-hedgehog] ✓ 4 succeeded.
  4429. 1147.30 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  4430. 1147.30 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4431. 1147.30 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4432. 1147.30 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4433. 1147.30 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4434. 1147.30 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4435. 1147.31 s [duoids-hedgehog] ✓ 5 succeeded.
  4436. 1147.31 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  4437. 1147.31 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4438. 1147.31 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4439. 1147.31 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4440. 1147.31 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4441. 1147.31 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4442. 1147.31 s [duoids-hedgehog] ✓ 5 succeeded.
  4443. 1147.31 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  4444. 1147.31 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4445. 1147.31 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4446. 1147.31 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4447. 1147.31 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4448. 1147.31 s [duoids-hedgehog] ✓ 4 succeeded.
  4449. 1147.31 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  4450. 1147.32 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4451. 1147.32 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4452. 1147.32 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4453. 1147.32 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4454. 1147.32 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4455. 1147.32 s [duoids-hedgehog] ✓ 5 succeeded.
  4456. 1147.32 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  4457. 1147.32 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4458. 1147.32 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4459. 1147.32 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4460. 1147.32 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4461. 1147.32 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4462. 1147.32 s [duoids-hedgehog] ✓ 5 succeeded.
  4463. 1147.32 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  4464. 1147.32 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4465. 1147.32 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4466. 1147.32 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4467. 1147.32 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4468. 1147.32 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4469. 1147.32 s [duoids-hedgehog] ✓ 5 succeeded.
  4470. 1147.32 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  4471. 1147.32 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4472. 1147.32 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4473. 1147.32 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4474. 1147.32 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4475. 1147.32 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4476. 1147.32 s [duoids-hedgehog] ✓ 5 succeeded.
  4477. 1147.32 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  4478. 1147.33 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4479. 1147.33 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4480. 1147.33 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4481. 1147.33 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4482. 1147.33 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4483. 1147.33 s [duoids-hedgehog] ✓ 5 succeeded.
  4484. 1147.33 s [duoids-hedgehog] Test suite laws: PASS
  4485. 1147.33 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  4486. 1147.33 s [duoids-hedgehog] Test suite doctests: RUNNING...
  4487. 1148.97 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  4488. 1149.11 s [duoids-hedgehog] NameLib Nothing
  4489. 1149.11 s [duoids-hedgehog] ----------------------------------------
  4490. 1149.13 s [duoids-hedgehog] Test suite doctests: PASS
  4491. 1149.13 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  4492. 1149.13 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  4493. 1149.17 s [duoids-hedgehog] Phase: haddockPhase
  4494. 1152.02 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  4495. 1152.11 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  4496. 1152.11 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  4497. 1153.29 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  4498. 1153.78 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing ) [HIE file is missing]
  4499. 1155.90 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing ) [HIE file is missing]
  4500. 1156.06 s [duoids-hedgehog] Haddock coverage:
  4501. 1157.36 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  4502. 1157.36 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  4503. 1172.15 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  4504. 1172.18 s [vector] src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
  4505. 1172.18 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4506. 1172.18 s [vector] • In the data declaration for ‘MVector’
  4507. 1172.18 s [vector] |
  4508. 1172.19 s [vector] 99 | deriving ( Typeable )
  4509. 1172.19 s [vector] | ^^^^^^^^
  4510. 1172.19 s [vector]
  4511. 1172.19 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  4512. 1172.51 s [vector] src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
  4513. 1172.51 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4514. 1172.51 s [vector] • In the data declaration for ‘Vector’
  4515. 1172.51 s [vector] |
  4516. 1172.51 s [vector] 222 | deriving ( Typeable )
  4517. 1172.51 s [vector] | ^^^^^^^^
  4518. 1172.51 s [vector]
  4519. 1175.31 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers,
  4520. 1175.31 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  4521. 1179.22 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4522. 1179.69 s [duoidal-transformers] haddockPhase completed in 39 seconds
  4523. 1179.73 s [duoidal-transformers] Phase: installPhase
  4524. 1179.91 s [duoidal-transformers] Installing library in /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/duoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt
  4525. 1180.55 s [duoidal-transformers] Phase: fixupPhase
  4526. 1180.58 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0
  4527. 1180.59 s [duoidal-transformers] shrinking /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSduoidal-transformers-0.0.1.0-20qWqZ8AoRKEdhI91AL7Bt-ghc9.12.2.so
  4528. 1180.60 s [duoidal-transformers] checking for references to /build/ in /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0...
  4529. 1180.63 s [duoidal-transformers] patching script interpreter paths in /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0
  4530. 1180.64 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/lib
  4531. 1180.73 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc
  4532. 1180.74 s [duoidal-transformers] checking for references to /build/ in /nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc...
  4533. 1180.76 s [duoidal-transformers] patching script interpreter paths in /nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc
  4534. 1181.17 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0
  4535. 1181.90 s [post-build-hook] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  4536. 1181.90 s [post-build-hook]
  4537. 1182.30 s [post-build-hook] Pushing /nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc (347.18 KiB)
  4538. 1182.37 s [post-build-hook] Pushing /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0 (680.27 KiB)
  4539. 1183.43 s [post-build-hook]
  4540. 1183.43 s [post-build-hook] All done.
  4541. 1183.51 s [post-build-hook] Uploading to the NixCI cache: /nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0
  4542. 1183.83 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4543. 1183.85 s [post-build-hook] copying 2 paths...
  4544. 1183.85 s [post-build-hook] copying path '/nix/store/2fl0b325vrbrn09spa40brykq5y8bcbi-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4545. 1184.27 s [post-build-hook] copying path '/nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  4546. 1184.90 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4547. 1185.24 s [post-build-hook] copying 1 paths...
  4548. 1185.28 s [post-build-hook] copying path '/nix/store/siaxdbx2vgf64yid6ka9yikdylwib8wa-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4549. 1185.54 s Progress: 7 of 21 built (2 building), 165 of 165 downloaded from cache
  4550. 1189.01 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  4551. 1189.01 s [vector] src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
  4552. 1189.01 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4553. 1189.01 s [vector] • In the data declaration for ‘MVector’
  4554. 1189.01 s [vector] |
  4555. 1189.01 s [vector] 115 | deriving ( Typeable )
  4556. 1189.01 s [vector] | ^^^^^^^^
  4557. 1189.01 s [vector]
  4558. 1189.01 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  4559. 1189.01 s [vector] src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
  4560. 1189.01 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4561. 1189.01 s [vector] • In the data declaration for ‘Vector’
  4562. 1189.01 s [vector] |
  4563. 1189.01 s [vector] 209 | deriving ( Typeable )
  4564. 1189.01 s [vector] | ^^^^^^^^
  4565. 1189.01 s [vector]
  4566. 1189.01 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  4567. 1189.01 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  4568. 1189.01 s [vector] src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
  4569. 1189.01 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4570. 1189.01 s [vector] • In the data declaration for ‘MVector’
  4571. 1189.01 s [vector] |
  4572. 1189.01 s [vector] 134 | deriving ( Typeable )
  4573. 1189.01 s [vector] | ^^^^^^^^
  4574. 1189.01 s [vector]
  4575. 1189.02 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  4576. 1189.02 s [vector] src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
  4577. 1189.02 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4578. 1189.02 s [vector] • In the data declaration for ‘Vector’
  4579. 1189.02 s [vector] |
  4580. 1189.02 s [vector] 219 | deriving ( Typeable )
  4581. 1189.02 s [vector] | ^^^^^^^^
  4582. 1189.02 s [vector]
  4583. 1190.61 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  4584. 1190.66 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  4585. 1190.66 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4586. 1190.66 s [vector] • In the newtype declaration for ‘MVector’
  4587. 1190.66 s [vector] |
  4588. 1190.66 s [vector] 97 | deriving ( Typeable )
  4589. 1190.66 s [vector] | ^^^^^^^^
  4590. 1190.66 s [vector]
  4591. 1190.66 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  4592. 1190.66 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  4593. 1190.66 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4594. 1190.66 s [vector] • In the newtype declaration for ‘Vector’
  4595. 1190.66 s [vector] |
  4596. 1190.66 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  4597. 1190.66 s [vector] | ^^^^^^^^
  4598. 1190.66 s [vector]
  4599. 1190.66 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog,
  4600. 1190.66 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  4601. 1193.65 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4602. 1196.71 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4603. 1197.18 s [duoids-hedgehog] haddockPhase completed in 48 seconds
  4604. 1197.22 s [duoids-hedgehog] Phase: installPhase
  4605. 1197.83 s [duoids-hedgehog] Installing library in /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  4606. 1198.45 s [duoids-hedgehog] Phase: fixupPhase
  4607. 1198.49 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0
  4608. 1198.50 s [duoids-hedgehog] shrinking /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSduoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF-ghc9.12.2.so
  4609. 1198.51 s [duoids-hedgehog] checking for references to /build/ in /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0...
  4610. 1198.55 s [duoids-hedgehog] patching script interpreter paths in /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0
  4611. 1198.56 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/lib
  4612. 1198.62 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc
  4613. 1198.63 s [duoids-hedgehog] checking for references to /build/ in /nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc...
  4614. 1198.66 s [duoids-hedgehog] patching script interpreter paths in /nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc
  4615. 1198.93 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0
  4616. 1212.67 s [post-build-hook] Pushing 2 paths (136 are already present) using zstd to cache sellout ⏳
  4617. 1212.67 s [post-build-hook]
  4618. 1217.85 s [post-build-hook] Pushing /nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc (301.18 KiB)
  4619. 1218.17 s [post-build-hook] Pushing /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0 (607.62 KiB)
  4620. 1228.63 s [post-build-hook]
  4621. 1228.67 s [post-build-hook] All done.
  4622. 1228.67 s [post-build-hook] Uploading to the NixCI cache: /nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0
  4623. 1228.74 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4624. 1228.77 s [post-build-hook] copying 2 paths...
  4625. 1228.77 s [post-build-hook] copying path '/nix/store/14ws6i1diavw3swd2rv8nb4d92z37vxa-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4626. 1229.18 s [post-build-hook] copying path '/nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  4627. 1229.74 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4628. 1230.02 s [post-build-hook] copying 1 paths...
  4629. 1230.03 s [post-build-hook] copying path '/nix/store/19bm1l6qcbzxsry7y21mc682nhbrf7w9-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4630. 1230.34 s Progress: 8 of 20 built (1 building), 165 of 165 downloaded from cache
  4631. 1230.34 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  4632. 1230.34 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  4633. 1230.34 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4634. 1230.34 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  4635. 1230.34 s [vector] |
  4636. 1230.34 s [vector] 97 | deriving instance Typeable Vector
  4637. 1230.34 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4638. 1230.34 s [vector]
  4639. 1230.34 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  4640. 1230.34 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4641. 1230.34 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  4642. 1230.34 s [vector] |
  4643. 1230.34 s [vector] 98 | deriving instance Typeable MVector
  4644. 1230.34 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4645. 1230.34 s [vector]
  4646. 1230.34 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  4647. 1230.34 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  4648. 1230.34 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  4649. 1230.34 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  4650. 1230.34 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 )
  4651. 1230.34 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 )
  4652. 1230.34 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 )
  4653. 1230.34 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4654. 1230.34 s [vector] In the use of ‘tail’
  4655. 1230.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4656. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4657. 1230.34 s [vector] |
  4658. 1230.34 s [vector] 244 | postscanl f z = tail . scanl f z
  4659. 1230.34 s [vector] | ^^^^
  4660. 1230.34 s [vector]
  4661. 1230.34 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4662. 1230.34 s [vector] In the use of ‘tail’
  4663. 1230.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4664. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4665. 1230.34 s [vector] |
  4666. 1230.34 s [vector] 245 | prescanr f z = tail . scanr f z
  4667. 1230.34 s [vector] | ^^^^
  4668. 1230.34 s [vector]
  4669. 1230.34 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 )
  4670. 1230.34 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4671. 1230.34 s [vector] In the use of ‘head’
  4672. 1230.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4673. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4674. 1230.34 s [vector] |
  4675. 1230.34 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4676. 1230.34 s [vector] | ^^^^
  4677. 1230.34 s [vector]
  4678. 1230.34 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4679. 1230.34 s [vector] In the use of ‘head’
  4680. 1230.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4681. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4682. 1230.34 s [vector] |
  4683. 1230.34 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4684. 1230.34 s [vector] | ^^^^
  4685. 1230.34 s [vector]
  4686. 1230.34 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4687. 1230.34 s [vector] In the use of ‘tail’
  4688. 1230.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4689. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4690. 1230.34 s [vector] |
  4691. 1230.34 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4692. 1230.34 s [vector] | ^^^^
  4693. 1230.34 s [vector]
  4694. 1230.34 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4695. 1230.34 s [vector] In the use of ‘head’
  4696. 1230.34 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4697. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4698. 1230.34 s [vector] |
  4699. 1230.34 s [vector] 439 | = V.uniq `eq` (map head . group)
  4700. 1230.34 s [vector] | ^^^^
  4701. 1230.34 s [vector]
  4702. 1230.34 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 )
  4703. 1230.34 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 )
  4704. 1230.34 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 )
  4705. 1230.34 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 )
  4706. 1230.34 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 )
  4707. 1230.34 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 )
  4708. 1230.34 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 )
  4709. 1230.34 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  4710. 1230.34 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  4711. 1230.34 s [vector] |
  4712. 1230.34 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  4713. 1230.34 s [vector] | ^^^^^^
  4714. 1230.34 s [vector]
  4715. 1230.34 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4716. 1230.34 s [vector] In the use of ‘head’
  4717. 1230.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4718. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4719. 1230.34 s [vector] |
  4720. 1230.34 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4721. 1230.34 s [vector] | ^^^^
  4722. 1230.34 s [vector]
  4723. 1230.34 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4724. 1230.34 s [vector] In the use of ‘tail’
  4725. 1230.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4726. 1230.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4727. 1230.34 s [vector] |
  4728. 1230.34 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4729. 1230.34 s [vector] | ^^^^
  4730. 1230.34 s [vector]
  4731. 1230.34 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 )
  4732. 1230.34 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  4733. 1230.34 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  4734. 1230.34 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  4735. 1230.34 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  4736. 1230.34 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 )
  4737. 1230.34 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  4738. 1230.34 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  4739. 1230.66 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  4740. 1232.16 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  4741. 1232.16 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  4742. 1232.35 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 )
  4743. 1235.17 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 )
  4744. 1235.24 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 )
  4745. 1235.39 s [vector] [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.dyn_o )
  4746. 1235.39 s [vector] [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.o, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.dyn_o )
  4747. 1235.39 s [vector] [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.o, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.dyn_o )
  4748. 1235.39 s [vector] [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.o, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.dyn_o )
  4749. 1235.39 s [vector] [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.dyn_o )
  4750. 1235.39 s [vector] [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.dyn_o )
  4751. 1235.39 s [vector] [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.dyn_o )
  4752. 1235.39 s [vector] [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.dyn_o )
  4753. 1235.39 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 )
  4754. 1235.39 s [vector] [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.o, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.dyn_o )
  4755. 1235.39 s [vector] [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.o, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.dyn_o )
  4756. 1235.88 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 )
  4757. 1238.80 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 )
  4758. 1238.80 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 )
  4759. 1239.17 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 )
  4760. 1239.17 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 )
  4761. 1239.17 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 )
  4762. 1239.17 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 )
  4763. 1239.17 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 )
  4764. 1239.17 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 )
  4765. 1239.17 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 )
  4766. 1239.17 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 )
  4767. 1239.17 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  4768. 1239.17 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 )
  4769. 1239.17 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 )
  4770. 1241.91 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  4771. 1241.91 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  4772. 1242.08 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 )
  4773. 1242.31 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 )
  4774. 1252.55 s [vector] [ 3 of 12] Compiling Utilities ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
  4775. 1252.59 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4776. 1252.59 s [vector] In the use of ‘tail’
  4777. 1252.59 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4778. 1252.59 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4779. 1252.59 s [vector] |
  4780. 1252.59 s [vector] 244 | postscanl f z = tail . scanl f z
  4781. 1252.59 s [vector] | ^^^^
  4782. 1252.59 s [vector]
  4783. 1252.59 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4784. 1252.59 s [vector] In the use of ‘tail’
  4785. 1252.59 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4786. 1252.59 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4787. 1252.59 s [vector] |
  4788. 1252.59 s [vector] 245 | prescanr f z = tail . scanr f z
  4789. 1252.59 s [vector] | ^^^^
  4790. 1252.59 s [vector]
  4791. 1252.59 s [vector] [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.dyn_o )
  4792. 1252.59 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4793. 1252.59 s [vector] In the use of ‘head’
  4794. 1252.59 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4795. 1252.59 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4796. 1252.59 s [vector] |
  4797. 1252.59 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4798. 1252.59 s [vector] | ^^^^
  4799. 1252.59 s [vector]
  4800. 1252.59 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4801. 1252.59 s [vector] In the use of ‘head’
  4802. 1252.59 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4803. 1252.59 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4804. 1252.59 s [vector] |
  4805. 1252.59 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4806. 1252.59 s [vector] | ^^^^
  4807. 1252.59 s [vector]
  4808. 1252.59 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4809. 1252.59 s [vector] In the use of ‘tail’
  4810. 1252.59 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4811. 1252.59 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4812. 1252.59 s [vector] |
  4813. 1252.59 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4814. 1252.60 s [vector] | ^^^^
  4815. 1252.60 s [vector]
  4816. 1252.60 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4817. 1252.60 s [vector] In the use of ‘head’
  4818. 1252.60 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4819. 1252.60 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4820. 1252.60 s [vector] |
  4821. 1252.60 s [vector] 439 | = V.uniq `eq` (map head . group)
  4822. 1252.60 s [vector] | ^^^^
  4823. 1252.60 s [vector]
  4824. 1265.71 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 )
  4825. 1295.52 s [vector] [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.dyn_o )
  4826. 1295.55 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.dyn_o )
  4827. 1295.55 s [vector] [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.dyn_o )
  4828. 1295.55 s [vector] [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.dyn_o )
  4829. 1295.55 s [vector] [10 of 12] Compiling Tests.Move ( tests/Tests/Move.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.dyn_o )
  4830. 1295.55 s [vector] [11 of 12] Compiling Tests.Bundle ( tests/Tests/Bundle.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.dyn_o )
  4831. 1295.55 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  4832. 1295.55 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  4833. 1295.55 s [vector] |
  4834. 1295.55 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  4835. 1295.55 s [vector] | ^^^^^^
  4836. 1295.55 s [vector]
  4837. 1295.55 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4838. 1295.55 s [vector] In the use of ‘head’
  4839. 1295.55 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4840. 1295.55 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4841. 1295.55 s [vector] |
  4842. 1295.55 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4843. 1295.55 s [vector] | ^^^^
  4844. 1295.55 s [vector]
  4845. 1295.56 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4846. 1295.56 s [vector] In the use of ‘tail’
  4847. 1295.56 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4848. 1295.56 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4849. 1295.56 s [vector] |
  4850. 1295.56 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4851. 1295.56 s [vector] | ^^^^
  4852. 1295.56 s [vector]
  4853. 1295.56 s [vector] [12 of 12] Compiling Main ( tests/Main.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.dyn_o )
  4854. 1296.54 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  4855. 1298.52 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  4856. 1298.52 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  4857. 1298.65 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  4858. 1299.28 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  4859. 1304.97 s [vector] buildPhase completed in 5 minutes 7 seconds
  4860. 1304.97 s [vector] Phase: checkPhase
  4861. 1305.38 s [vector] Running 2 test suites...
  4862. 1305.38 s [vector] Test suite vector-tests-O0: RUNNING...
  4863. 1305.73 s [vector] toplevel
  4864. 1305.73 s [vector] Data.Vector.Fusion.Bundle
  4865. 1305.73 s [vector] fromList.toList == id: OK
  4866. 1305.73 s [vector] +++ OK, passed 100 tests.
  4867. 1305.73 s [vector] toList.fromList == id: OK
  4868. 1305.73 s [vector] +++ OK, passed 100 tests.
  4869. 1305.73 s [vector] eq: OK
  4870. 1305.73 s [vector] +++ OK, passed 100 tests.
  4871. 1305.75 s [vector] length: OK
  4872. 1305.75 s [vector] +++ OK, passed 100 tests.
  4873. 1305.75 s [vector] null: OK
  4874. 1305.75 s [vector] +++ OK, passed 100 tests.
  4875. 1305.75 s [vector] empty: OK
  4876. 1305.75 s [vector] +++ OK, passed 100 tests.
  4877. 1305.76 s [vector] singleton: OK
  4878. 1305.76 s [vector] +++ OK, passed 100 tests.
  4879. 1305.76 s [vector] replicate: OK
  4880. 1305.76 s [vector] +++ OK, passed 100 tests.
  4881. 1305.76 s [vector] cons: OK
  4882. 1305.76 s [vector] +++ OK, passed 100 tests.
  4883. 1305.76 s [vector] snoc: OK
  4884. 1305.77 s [vector] +++ OK, passed 100 tests.
  4885. 1305.78 s [vector] append: OK
  4886. 1305.78 s [vector] +++ OK, passed 100 tests.
  4887. 1305.78 s [vector] head: OK
  4888. 1305.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4889. 1305.78 s [vector] last: OK
  4890. 1305.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4891. 1305.80 s [vector] index: OK
  4892. 1305.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4893. 1305.80 s [vector] extract: OK
  4894. 1305.80 s [vector] +++ OK, passed 100 tests.
  4895. 1305.80 s [vector] init: OK
  4896. 1305.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4897. 1305.80 s [vector] tail: OK
  4898. 1305.80 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4899. 1305.80 s [vector] take: OK
  4900. 1305.80 s [vector] +++ OK, passed 100 tests.
  4901. 1305.80 s [vector] drop: OK
  4902. 1305.80 s [vector] +++ OK, passed 100 tests.
  4903. 1305.80 s [vector] map: OK
  4904. 1305.80 s [vector] +++ OK, passed 100 tests.
  4905. 1305.80 s [vector] zipWith: OK
  4906. 1305.80 s [vector] +++ OK, passed 100 tests.
  4907. 1305.80 s [vector] zipWith3: OK
  4908. 1305.80 s [vector] +++ OK, passed 100 tests.
  4909. 1305.80 s [vector] filter: OK
  4910. 1305.80 s [vector] +++ OK, passed 100 tests.
  4911. 1305.80 s [vector] takeWhile: OK
  4912. 1305.80 s [vector] +++ OK, passed 100 tests.
  4913. 1305.80 s [vector] dropWhile: OK
  4914. 1305.80 s [vector] +++ OK, passed 100 tests.
  4915. 1305.80 s [vector] elem: OK
  4916. 1305.80 s [vector] +++ OK, passed 100 tests.
  4917. 1305.80 s [vector] notElem: OK
  4918. 1305.80 s [vector] +++ OK, passed 100 tests.
  4919. 1305.80 s [vector] find: OK
  4920. 1305.80 s [vector] +++ OK, passed 100 tests.
  4921. 1305.80 s [vector] findIndex: OK
  4922. 1305.80 s [vector] +++ OK, passed 100 tests.
  4923. 1305.80 s [vector] foldl: OK
  4924. 1305.80 s [vector] +++ OK, passed 100 tests.
  4925. 1305.80 s [vector] foldl1: OK (0.02s)
  4926. 1305.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4927. 1305.80 s [vector] foldl': OK
  4928. 1305.80 s [vector] +++ OK, passed 100 tests.
  4929. 1305.80 s [vector] foldl1': OK
  4930. 1305.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4931. 1305.81 s [vector] foldr: OK
  4932. 1305.81 s [vector] +++ OK, passed 100 tests.
  4933. 1305.81 s [vector] foldr1: OK
  4934. 1305.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4935. 1305.81 s [vector] prescanl: OK
  4936. 1305.81 s [vector] +++ OK, passed 100 tests.
  4937. 1305.81 s [vector] prescanl': OK
  4938. 1305.81 s [vector] +++ OK, passed 100 tests.
  4939. 1305.81 s [vector] postscanl: OK
  4940. 1305.81 s [vector] +++ OK, passed 100 tests.
  4941. 1305.82 s [vector] postscanl': OK
  4942. 1305.82 s [vector] +++ OK, passed 100 tests.
  4943. 1305.82 s [vector] scanl: OK
  4944. 1305.82 s [vector] +++ OK, passed 100 tests.
  4945. 1305.82 s [vector] scanl': OK
  4946. 1305.82 s [vector] +++ OK, passed 100 tests.
  4947. 1305.82 s [vector] scanl1: OK
  4948. 1305.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4949. 1305.82 s [vector] scanl1': OK
  4950. 1305.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4951. 1305.82 s [vector] concatMap: OK
  4952. 1305.82 s [vector] +++ OK, passed 100 tests.
  4953. 1305.82 s [vector] unfoldr: OK
  4954. 1305.82 s [vector] +++ OK, passed 100 tests.
  4955. 1305.82 s [vector] and: OK
  4956. 1305.82 s [vector] +++ OK, passed 100 tests.
  4957. 1305.82 s [vector] or: OK
  4958. 1305.82 s [vector] +++ OK, passed 100 tests.
  4959. 1305.82 s [vector] Tests.Vector.Boxed
  4960. 1305.82 s [vector] Bool
  4961. 1305.82 s [vector] fromList.toList == id: OK
  4962. 1305.82 s [vector] +++ OK, passed 100 tests.
  4963. 1305.82 s [vector] toList.fromList == id: OK
  4964. 1305.82 s [vector] +++ OK, passed 100 tests.
  4965. 1305.82 s [vector] unstream.stream == id: OK
  4966. 1305.82 s [vector] +++ OK, passed 100 tests.
  4967. 1305.82 s [vector] stream.unstream == id: OK
  4968. 1305.82 s [vector] +++ OK, passed 100 tests.
  4969. 1305.82 s [vector] eq: OK
  4970. 1305.82 s [vector] +++ OK, passed 100 tests.
  4971. 1305.82 s [vector] length: OK
  4972. 1305.82 s [vector] +++ OK, passed 100 tests.
  4973. 1305.83 s [vector] null: OK
  4974. 1305.83 s [vector] +++ OK, passed 100 tests.
  4975. 1305.83 s [vector] index: OK
  4976. 1305.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4977. 1305.83 s [vector] safeIndex: OK
  4978. 1305.83 s [vector] +++ OK, passed 100 tests.
  4979. 1305.83 s [vector] head: OK
  4980. 1305.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4981. 1305.83 s [vector] last: OK
  4982. 1305.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4983. 1305.83 s [vector] unsafeIndex: OK
  4984. 1305.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4985. 1305.83 s [vector] unsafeHead: OK
  4986. 1305.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4987. 1305.83 s [vector] unsafeLast: OK
  4988. 1305.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4989. 1305.83 s [vector] slice: OK
  4990. 1305.83 s [vector] +++ OK, passed 100 tests.
  4991. 1305.83 s [vector] init: OK
  4992. 1305.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4993. 1305.83 s [vector] tail: OK
  4994. 1305.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4995. 1305.83 s [vector] take: OK
  4996. 1305.83 s [vector] +++ OK, passed 100 tests.
  4997. 1305.83 s [vector] drop: OK
  4998. 1305.83 s [vector] +++ OK, passed 100 tests.
  4999. 1305.83 s [vector] splitAt: OK
  5000. 1305.83 s [vector] +++ OK, passed 100 tests.
  5001. 1305.83 s [vector] empty: OK
  5002. 1305.83 s [vector] +++ OK, passed 100 tests.
  5003. 1305.83 s [vector] singleton: OK
  5004. 1305.83 s [vector] +++ OK, passed 100 tests.
  5005. 1305.83 s [vector] replicate: OK
  5006. 1305.83 s [vector] +++ OK, passed 100 tests.
  5007. 1305.83 s [vector] generate: OK
  5008. 1305.84 s [vector] +++ OK, passed 100 tests.
  5009. 1305.84 s [vector] iterateN: OK
  5010. 1305.84 s [vector] +++ OK, passed 100 tests.
  5011. 1305.84 s [vector] iterateNM: OK (0.07s)
  5012. 1305.84 s [vector] +++ OK, passed 100 tests.
  5013. 1305.84 s [vector] generateM: OK
  5014. 1305.84 s [vector] +++ OK, passed 100 tests.
  5015. 1305.85 s [vector] replicateM: OK (0.01s)
  5016. 1305.85 s [vector] +++ OK, passed 100 tests.
  5017. 1305.85 s [vector] create: OK
  5018. 1305.85 s [vector] +++ OK, passed 100 tests.
  5019. 1305.85 s [vector] createT: OK
  5020. 1305.85 s [vector] +++ OK, passed 100 tests.
  5021. 1305.85 s [vector] unfoldr: OK
  5022. 1305.85 s [vector] +++ OK, passed 100 tests.
  5023. 1305.85 s [vector] unfoldrN: OK
  5024. 1305.85 s [vector] +++ OK, passed 100 tests.
  5025. 1305.85 s [vector] unfoldrExactN: OK
  5026. 1305.85 s [vector] +++ OK, passed 100 tests.
  5027. 1305.85 s [vector] unfoldrM: OK
  5028. 1305.85 s [vector] +++ OK, passed 100 tests.
  5029. 1305.85 s [vector] unfoldrNM: OK
  5030. 1305.85 s [vector] +++ OK, passed 100 tests.
  5031. 1305.85 s [vector] unfoldrExactNM: OK (0.03s)
  5032. 1305.85 s [vector] +++ OK, passed 100 tests.
  5033. 1305.86 s [vector] constructN: OK
  5034. 1305.86 s [vector] +++ OK, passed 100 tests.
  5035. 1305.86 s [vector] constructrN: OK
  5036. 1305.86 s [vector] +++ OK, passed 100 tests.
  5037. 1305.86 s [vector] cons: OK
  5038. 1305.86 s [vector] +++ OK, passed 100 tests.
  5039. 1305.86 s [vector] snoc: OK
  5040. 1305.86 s [vector] +++ OK, passed 100 tests.
  5041. 1305.86 s [vector] append: OK
  5042. 1305.86 s [vector] +++ OK, passed 100 tests.
  5043. 1305.86 s [vector] concat: OK (0.01s)
  5044. 1305.86 s [vector] +++ OK, passed 100 tests.
  5045. 1305.86 s [vector] force: OK
  5046. 1305.86 s [vector] +++ OK, passed 100 tests.
  5047. 1305.86 s [vector] upd: OK
  5048. 1305.86 s [vector] +++ OK, passed 100 tests.
  5049. 1305.86 s [vector] accum: OK
  5050. 1305.86 s [vector] +++ OK, passed 100 tests.
  5051. 1305.86 s [vector] reverse: OK
  5052. 1305.86 s [vector] +++ OK, passed 100 tests.
  5053. 1305.86 s [vector] backpermute: OK
  5054. 1305.86 s [vector] +++ OK, passed 100 tests.
  5055. 1305.86 s [vector] map: OK
  5056. 1305.86 s [vector] +++ OK, passed 100 tests.
  5057. 1305.86 s [vector] imap: OK
  5058. 1305.86 s [vector] +++ OK, passed 100 tests.
  5059. 1305.86 s [vector] concatMap: OK (0.02s)
  5060. 1305.86 s [vector] +++ OK, passed 100 tests.
  5061. 1305.86 s [vector] mapM: OK
  5062. 1305.86 s [vector] +++ OK, passed 100 tests.
  5063. 1305.86 s [vector] mapM_: OK (0.02s)
  5064. 1305.86 s [vector] +++ OK, passed 100 tests.
  5065. 1305.86 s [vector] forM: OK
  5066. 1305.86 s [vector] +++ OK, passed 100 tests.
  5067. 1305.86 s [vector] forM_: OK (0.01s)
  5068. 1305.86 s [vector] +++ OK, passed 100 tests.
  5069. 1305.86 s [vector] imapM: OK
  5070. 1305.86 s [vector] +++ OK, passed 100 tests.
  5071. 1305.86 s [vector] imapM_: OK (0.02s)
  5072. 1305.86 s [vector] +++ OK, passed 100 tests.
  5073. 1305.86 s [vector] zipWith: OK
  5074. 1305.86 s [vector] +++ OK, passed 100 tests.
  5075. 1305.87 s [vector] zipWith3: OK
  5076. 1305.87 s [vector] +++ OK, passed 100 tests.
  5077. 1305.87 s [vector] izipWith: OK
  5078. 1305.87 s [vector] +++ OK, passed 100 tests.
  5079. 1305.87 s [vector] izipWith3: OK
  5080. 1305.87 s [vector] +++ OK, passed 100 tests.
  5081. 1305.87 s [vector] izipWithM: OK
  5082. 1305.87 s [vector] +++ OK, passed 100 tests.
  5083. 1305.87 s [vector] izipWithM_: OK (0.02s)
  5084. 1305.87 s [vector] +++ OK, passed 100 tests.
  5085. 1305.87 s [vector] zipWithM: OK
  5086. 1305.87 s [vector] +++ OK, passed 100 tests.
  5087. 1305.87 s [vector] zipWithM_: OK (0.01s)
  5088. 1305.87 s [vector] +++ OK, passed 100 tests.
  5089. 1305.87 s [vector] filter: OK
  5090. 1305.87 s [vector] +++ OK, passed 100 tests.
  5091. 1305.87 s [vector] ifilter: OK
  5092. 1305.87 s [vector] +++ OK, passed 100 tests.
  5093. 1305.87 s [vector] filterM: OK (0.02s)
  5094. 1305.87 s [vector] +++ OK, passed 100 tests.
  5095. 1305.87 s [vector] uniq: OK
  5096. 1305.87 s [vector] +++ OK, passed 100 tests.
  5097. 1305.88 s [vector] mapMaybe: OK
  5098. 1305.88 s [vector] +++ OK, passed 100 tests.
  5099. 1305.88 s [vector] imapMaybe: OK
  5100. 1305.88 s [vector] +++ OK, passed 100 tests.
  5101. 1305.88 s [vector] takeWhile: OK
  5102. 1305.88 s [vector] +++ OK, passed 100 tests.
  5103. 1305.88 s [vector] dropWhile: OK
  5104. 1305.88 s [vector] +++ OK, passed 100 tests.
  5105. 1305.88 s [vector] partition: OK
  5106. 1305.88 s [vector] +++ OK, passed 100 tests.
  5107. 1305.88 s [vector] partitionWith: OK
  5108. 1305.88 s [vector] +++ OK, passed 100 tests.
  5109. 1305.89 s [vector] span: OK
  5110. 1305.89 s [vector] +++ OK, passed 100 tests.
  5111. 1305.89 s [vector] break: OK
  5112. 1305.89 s [vector] +++ OK, passed 100 tests.
  5113. 1305.89 s [vector] spanR: OK
  5114. 1305.89 s [vector] +++ OK, passed 100 tests.
  5115. 1305.89 s [vector] breakR: OK
  5116. 1305.89 s [vector] +++ OK, passed 100 tests.
  5117. 1305.89 s [vector] groupBy: OK
  5118. 1305.89 s [vector] +++ OK, passed 100 tests.
  5119. 1305.89 s [vector] elem: OK
  5120. 1305.89 s [vector] +++ OK, passed 100 tests.
  5121. 1305.89 s [vector] notElem: OK
  5122. 1305.89 s [vector] +++ OK, passed 100 tests.
  5123. 1305.89 s [vector] find: OK
  5124. 1305.89 s [vector] +++ OK, passed 100 tests.
  5125. 1305.89 s [vector] findIndex: OK
  5126. 1305.89 s [vector] +++ OK, passed 100 tests.
  5127. 1305.89 s [vector] findIndexR: OK
  5128. 1305.89 s [vector] +++ OK, passed 100 tests.
  5129. 1305.89 s [vector] findIndices: OK
  5130. 1305.89 s [vector] +++ OK, passed 100 tests.
  5131. 1305.89 s [vector] elemIndex: OK
  5132. 1305.89 s [vector] +++ OK, passed 100 tests.
  5133. 1305.89 s [vector] elemIndices: OK
  5134. 1305.89 s [vector] +++ OK, passed 100 tests.
  5135. 1305.89 s [vector] foldl: OK
  5136. 1305.89 s [vector] +++ OK, passed 100 tests.
  5137. 1305.90 s [vector] foldl1: OK
  5138. 1305.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5139. 1305.90 s [vector] foldl': OK
  5140. 1305.90 s [vector] +++ OK, passed 100 tests.
  5141. 1305.90 s [vector] foldl1': OK
  5142. 1305.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5143. 1305.90 s [vector] foldr: OK
  5144. 1305.90 s [vector] +++ OK, passed 100 tests.
  5145. 1305.90 s [vector] foldr1: OK
  5146. 1305.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5147. 1305.90 s [vector] foldr': OK
  5148. 1305.90 s [vector] +++ OK, passed 100 tests.
  5149. 1305.90 s [vector] foldr1': OK
  5150. 1305.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5151. 1305.91 s [vector] ifoldl: OK
  5152. 1305.91 s [vector] +++ OK, passed 100 tests.
  5153. 1305.91 s [vector] ifoldl': OK
  5154. 1305.91 s [vector] +++ OK, passed 100 tests.
  5155. 1305.91 s [vector] ifoldr: OK
  5156. 1305.91 s [vector] +++ OK, passed 100 tests.
  5157. 1305.91 s [vector] ifoldr': OK
  5158. 1305.91 s [vector] +++ OK, passed 100 tests.
  5159. 1305.92 s [vector] ifoldM: OK
  5160. 1305.92 s [vector] +++ OK, passed 100 tests.
  5161. 1305.92 s [vector] ifoldM': OK
  5162. 1305.92 s [vector] +++ OK, passed 100 tests.
  5163. 1305.94 s [vector] ifoldM_: OK (0.02s)
  5164. 1305.94 s [vector] +++ OK, passed 100 tests.
  5165. 1305.95 s [vector] ifoldM'_: OK (0.01s)
  5166. 1305.95 s [vector] +++ OK, passed 100 tests.
  5167. 1305.95 s [vector] all: OK
  5168. 1305.95 s [vector] +++ OK, passed 100 tests.
  5169. 1305.95 s [vector] any: OK
  5170. 1305.95 s [vector] +++ OK, passed 100 tests.
  5171. 1305.95 s [vector] prescanl: OK
  5172. 1305.95 s [vector] +++ OK, passed 100 tests.
  5173. 1305.95 s [vector] prescanl': OK
  5174. 1305.95 s [vector] +++ OK, passed 100 tests.
  5175. 1305.95 s [vector] postscanl: OK
  5176. 1305.96 s [vector] +++ OK, passed 100 tests.
  5177. 1305.96 s [vector] postscanl': OK
  5178. 1305.96 s [vector] +++ OK, passed 100 tests.
  5179. 1305.96 s [vector] scanl: OK
  5180. 1305.96 s [vector] +++ OK, passed 100 tests.
  5181. 1305.96 s [vector] scanl': OK
  5182. 1305.96 s [vector] +++ OK, passed 100 tests.
  5183. 1305.96 s [vector] scanl1: OK
  5184. 1305.96 s [vector] +++ OK, passed 100 tests.
  5185. 1305.96 s [vector] scanl1': OK
  5186. 1305.96 s [vector] +++ OK, passed 100 tests.
  5187. 1305.96 s [vector] iscanl: OK
  5188. 1305.97 s [vector] +++ OK, passed 100 tests.
  5189. 1305.97 s [vector] iscanl': OK
  5190. 1305.97 s [vector] +++ OK, passed 100 tests.
  5191. 1305.97 s [vector] prescanr: OK
  5192. 1305.97 s [vector] +++ OK, passed 100 tests.
  5193. 1305.97 s [vector] prescanr': OK
  5194. 1305.97 s [vector] +++ OK, passed 100 tests.
  5195. 1305.97 s [vector] postscanr: OK
  5196. 1305.98 s [vector] +++ OK, passed 100 tests.
  5197. 1305.98 s [vector] postscanr': OK
  5198. 1305.98 s [vector] +++ OK, passed 100 tests.
  5199. 1305.99 s [vector] scanr: OK
  5200. 1305.99 s [vector] +++ OK, passed 100 tests.
  5201. 1305.99 s [vector] scanr': OK
  5202. 1305.99 s [vector] +++ OK, passed 100 tests.
  5203. 1306.00 s [vector] scanr1: OK
  5204. 1306.00 s [vector] +++ OK, passed 100 tests.
  5205. 1306.00 s [vector] scanr1': OK
  5206. 1306.00 s [vector] +++ OK, passed 100 tests.
  5207. 1306.01 s [vector] iscanr: OK
  5208. 1306.01 s [vector] +++ OK, passed 100 tests.
  5209. 1306.02 s [vector] iscanr': OK
  5210. 1306.02 s [vector] +++ OK, passed 100 tests.
  5211. 1306.02 s [vector] mut_read: OK
  5212. 1306.02 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5213. 1306.02 s [vector] mut_write: OK
  5214. 1306.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5215. 1306.03 s [vector] mut_modify: OK
  5216. 1306.03 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5217. 1306.03 s [vector] mut_generate: OK
  5218. 1306.03 s [vector] +++ OK, passed 100 tests.
  5219. 1306.04 s [vector] mut_generateM: OK (0.01s)
  5220. 1306.04 s [vector] +++ OK, passed 100 tests.
  5221. 1306.06 s [vector] mut_mapM_: OK
  5222. 1306.06 s [vector] +++ OK, passed 100 tests.
  5223. 1306.08 s [vector] mut_imapM_: OK
  5224. 1306.08 s [vector] +++ OK, passed 100 tests.
  5225. 1306.10 s [vector] mut_forM_: OK (0.02s)
  5226. 1306.10 s [vector] +++ OK, passed 100 tests.
  5227. 1306.12 s [vector] mut_iforM_: OK
  5228. 1306.12 s [vector] +++ OK, passed 100 tests.
  5229. 1306.12 s [vector] mut_foldr: OK
  5230. 1306.12 s [vector] +++ OK, passed 100 tests.
  5231. 1306.12 s [vector] mut_foldr': OK
  5232. 1306.12 s [vector] +++ OK, passed 100 tests.
  5233. 1306.12 s [vector] mut_foldl: OK
  5234. 1306.12 s [vector] +++ OK, passed 100 tests.
  5235. 1306.12 s [vector] mut_foldl': OK
  5236. 1306.12 s [vector] +++ OK, passed 100 tests.
  5237. 1306.13 s [vector] mut_ifoldr: OK
  5238. 1306.13 s [vector] +++ OK, passed 100 tests.
  5239. 1306.13 s [vector] mut_ifoldr': OK
  5240. 1306.13 s [vector] +++ OK, passed 100 tests.
  5241. 1306.13 s [vector] mut_ifoldl: OK
  5242. 1306.13 s [vector] +++ OK, passed 100 tests.
  5243. 1306.13 s [vector] mut_ifoldl': OK
  5244. 1306.13 s [vector] +++ OK, passed 100 tests.
  5245. 1306.14 s [vector] mut_foldM: OK
  5246. 1306.14 s [vector] +++ OK, passed 100 tests.
  5247. 1306.14 s [vector] mut_foldM': OK
  5248. 1306.14 s [vector] +++ OK, passed 100 tests.
  5249. 1306.14 s [vector] mut_foldrM: OK
  5250. 1306.14 s [vector] +++ OK, passed 100 tests.
  5251. 1306.15 s [vector] mut_foldrM': OK
  5252. 1306.15 s [vector] +++ OK, passed 100 tests.
  5253. 1306.15 s [vector] mut_ifoldM: OK
  5254. 1306.15 s [vector] +++ OK, passed 100 tests.
  5255. 1306.15 s [vector] mut_ifoldM': OK
  5256. 1306.15 s [vector] +++ OK, passed 100 tests.
  5257. 1306.15 s [vector] mut_ifoldrM: OK
  5258. 1306.15 s [vector] +++ OK, passed 100 tests.
  5259. 1306.16 s [vector] mut_ifoldrM': OK
  5260. 1306.16 s [vector] +++ OK, passed 100 tests.
  5261. 1306.16 s [vector] compare: OK
  5262. 1306.16 s [vector] +++ OK, passed 100 tests.
  5263. 1306.16 s [vector] maximum: OK
  5264. 1306.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5265. 1306.16 s [vector] minimum: OK
  5266. 1306.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5267. 1306.16 s [vector] minIndex: OK
  5268. 1306.16 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5269. 1306.16 s [vector] maxIndex: OK
  5270. 1306.16 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5271. 1306.16 s [vector] maximumBy: OK
  5272. 1306.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5273. 1306.16 s [vector] minimumBy: OK
  5274. 1306.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5275. 1306.16 s [vector] maximumOn: OK
  5276. 1306.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5277. 1306.16 s [vector] minimumOn: OK
  5278. 1306.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5279. 1306.16 s [vector] maxIndexBy: OK
  5280. 1306.16 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5281. 1306.16 s [vector] minIndexBy: OK
  5282. 1306.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5283. 1306.16 s [vector] ListFirstMaxIndexWins: OK
  5284. 1306.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5285. 1306.16 s [vector] FalseListFirstMaxIndexWins: OK
  5286. 1306.16 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5287. 1306.17 s [vector] []
  5288. 1306.17 s [vector] zip: OK
  5289. 1306.17 s [vector] +++ OK, passed 100 tests.
  5290. 1306.18 s [vector] zip3: OK
  5291. 1306.18 s [vector] +++ OK, passed 100 tests.
  5292. 1306.18 s [vector] unzip: OK
  5293. 1306.18 s [vector] +++ OK, passed 100 tests.
  5294. 1306.19 s [vector] unzip3: OK
  5295. 1306.19 s [vector] +++ OK, passed 100 tests.
  5296. 1306.19 s [vector] indexed: OK
  5297. 1306.19 s [vector] +++ OK, passed 100 tests.
  5298. 1306.19 s [vector] update: OK
  5299. 1306.19 s [vector] +++ OK, passed 100 tests.
  5300. 1306.19 s [vector] concat: OK (0.01s)
  5301. 1306.19 s [vector] +++ OK, passed 100 tests.
  5302. 1306.19 s [vector] mempty: OK
  5303. 1306.19 s [vector] +++ OK, passed 100 tests.
  5304. 1306.19 s [vector] mappend: OK
  5305. 1306.19 s [vector] +++ OK, passed 100 tests.
  5306. 1306.19 s [vector] mconcat: OK (0.01s)
  5307. 1306.19 s [vector] +++ OK, passed 100 tests.
  5308. 1306.19 s [vector] fmap: OK
  5309. 1306.19 s [vector] +++ OK, passed 100 tests.
  5310. 1306.19 s [vector] return: OK
  5311. 1306.19 s [vector] +++ OK, passed 100 tests.
  5312. 1306.21 s [vector] bind: OK (0.02s)
  5313. 1306.21 s [vector] +++ OK, passed 100 tests.
  5314. 1306.21 s [vector] mzip: OK
  5315. 1306.21 s [vector] +++ OK, passed 100 tests.
  5316. 1306.21 s [vector] munzip: OK
  5317. 1306.21 s [vector] +++ OK, passed 100 tests.
  5318. 1306.22 s [vector] applicative_pure: OK
  5319. 1306.22 s [vector] +++ OK, passed 100 tests.
  5320. 1306.24 s [vector] applicative_appl: OK (0.02s)
  5321. 1306.24 s [vector] +++ OK, passed 100 tests.
  5322. 1306.24 s [vector] alternative_empty: OK
  5323. 1306.24 s [vector] +++ OK, passed 100 tests.
  5324. 1306.24 s [vector] alternative_or: OK
  5325. 1306.24 s [vector] +++ OK, passed 100 tests.
  5326. 1306.29 s [vector] sequence: OK (0.05s)
  5327. 1306.30 s [vector] +++ OK, passed 100 tests.
  5328. 1306.30 s [vector] sequence_: OK (0.01s)
  5329. 1306.30 s [vector] +++ OK, passed 100 tests.
  5330. 1306.30 s [vector] glength: OK
  5331. 1306.30 s [vector] +++ OK, passed 100 tests.
  5332. 1306.30 s [vector] and: OK
  5333. 1306.30 s [vector] +++ OK, passed 100 tests.
  5334. 1306.30 s [vector] or: OK
  5335. 1306.30 s [vector] +++ OK, passed 100 tests.
  5336. 1306.30 s [vector] Int
  5337. 1306.30 s [vector] fromList.toList == id: OK
  5338. 1306.30 s [vector] +++ OK, passed 100 tests.
  5339. 1306.30 s [vector] toList.fromList == id: OK
  5340. 1306.30 s [vector] +++ OK, passed 100 tests.
  5341. 1306.30 s [vector] unstream.stream == id: OK
  5342. 1306.30 s [vector] +++ OK, passed 100 tests.
  5343. 1306.30 s [vector] stream.unstream == id: OK
  5344. 1306.30 s [vector] +++ OK, passed 100 tests.
  5345. 1306.30 s [vector] eq: OK
  5346. 1306.30 s [vector] +++ OK, passed 100 tests.
  5347. 1306.30 s [vector] length: OK
  5348. 1306.30 s [vector] +++ OK, passed 100 tests.
  5349. 1306.30 s [vector] null: OK
  5350. 1306.30 s [vector] +++ OK, passed 100 tests.
  5351. 1306.30 s [vector] index: OK
  5352. 1306.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5353. 1306.30 s [vector] safeIndex: OK
  5354. 1306.30 s [vector] +++ OK, passed 100 tests.
  5355. 1306.30 s [vector] head: OK
  5356. 1306.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5357. 1306.30 s [vector] last: OK
  5358. 1306.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5359. 1306.30 s [vector] unsafeIndex: OK
  5360. 1306.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5361. 1306.30 s [vector] unsafeHead: OK
  5362. 1306.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5363. 1306.30 s [vector] unsafeLast: OK
  5364. 1306.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5365. 1306.30 s [vector] slice: OK
  5366. 1306.30 s [vector] +++ OK, passed 100 tests.
  5367. 1306.30 s [vector] init: OK
  5368. 1306.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5369. 1306.31 s [vector] tail: OK
  5370. 1306.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5371. 1306.31 s [vector] take: OK
  5372. 1306.31 s [vector] +++ OK, passed 100 tests.
  5373. 1306.31 s [vector] drop: OK
  5374. 1306.31 s [vector] +++ OK, passed 100 tests.
  5375. 1306.31 s [vector] splitAt: OK
  5376. 1306.31 s [vector] +++ OK, passed 100 tests.
  5377. 1306.31 s [vector] empty: OK
  5378. 1306.31 s [vector] +++ OK, passed 100 tests.
  5379. 1306.31 s [vector] singleton: OK
  5380. 1306.31 s [vector] +++ OK, passed 100 tests.
  5381. 1306.31 s [vector] replicate: OK
  5382. 1306.31 s [vector] +++ OK, passed 100 tests.
  5383. 1306.31 s [vector] generate: OK
  5384. 1306.31 s [vector] +++ OK, passed 100 tests.
  5385. 1306.32 s [vector] iterateN: OK
  5386. 1306.32 s [vector] +++ OK, passed 100 tests.
  5387. 1306.34 s [vector] iterateNM: OK (0.02s)
  5388. 1306.34 s [vector] +++ OK, passed 100 tests.
  5389. 1306.38 s [vector] generateM: OK (0.04s)
  5390. 1306.38 s [vector] +++ OK, passed 100 tests.
  5391. 1306.38 s [vector] replicateM: OK (0.01s)
  5392. 1306.38 s [vector] +++ OK, passed 100 tests.
  5393. 1306.38 s [vector] create: OK
  5394. 1306.38 s [vector] +++ OK, passed 100 tests.
  5395. 1306.39 s [vector] createT: OK
  5396. 1306.39 s [vector] +++ OK, passed 100 tests.
  5397. 1306.40 s [vector] unfoldr: OK
  5398. 1306.40 s [vector] +++ OK, passed 100 tests.
  5399. 1306.40 s [vector] unfoldrN: OK
  5400. 1306.40 s [vector] +++ OK, passed 100 tests.
  5401. 1306.40 s [vector] unfoldrExactN: OK
  5402. 1306.40 s [vector] +++ OK, passed 100 tests.
  5403. 1306.40 s [vector] unfoldrM: OK
  5404. 1306.40 s [vector] +++ OK, passed 100 tests.
  5405. 1306.40 s [vector] unfoldrNM: OK
  5406. 1306.40 s [vector] +++ OK, passed 100 tests.
  5407. 1306.44 s [vector] unfoldrExactNM: OK (0.04s)
  5408. 1306.44 s [vector] +++ OK, passed 100 tests.
  5409. 1306.44 s [vector] constructN: OK
  5410. 1306.44 s [vector] +++ OK, passed 100 tests.
  5411. 1306.45 s [vector] constructrN: OK
  5412. 1306.46 s [vector] +++ OK, passed 100 tests.
  5413. 1306.46 s [vector] cons: OK
  5414. 1306.46 s [vector] +++ OK, passed 100 tests.
  5415. 1306.46 s [vector] snoc: OK
  5416. 1306.46 s [vector] +++ OK, passed 100 tests.
  5417. 1306.46 s [vector] append: OK
  5418. 1306.47 s [vector] +++ OK, passed 100 tests.
  5419. 1306.47 s [vector] concat: OK (0.01s)
  5420. 1306.48 s [vector] +++ OK, passed 100 tests.
  5421. 1306.48 s [vector] force: OK
  5422. 1306.48 s [vector] +++ OK, passed 100 tests.
  5423. 1306.48 s [vector] upd: OK
  5424. 1306.48 s [vector] +++ OK, passed 100 tests.
  5425. 1306.48 s [vector] accum: OK
  5426. 1306.48 s [vector] +++ OK, passed 100 tests.
  5427. 1306.49 s [vector] reverse: OK
  5428. 1306.49 s [vector] +++ OK, passed 100 tests.
  5429. 1306.49 s [vector] backpermute: OK
  5430. 1306.49 s [vector] +++ OK, passed 100 tests.
  5431. 1306.49 s [vector] map: OK
  5432. 1306.49 s [vector] +++ OK, passed 100 tests.
  5433. 1306.49 s [vector] imap: OK
  5434. 1306.50 s [vector] +++ OK, passed 100 tests.
  5435. 1306.50 s [vector] concatMap: OK
  5436. 1306.50 s [vector] +++ OK, passed 100 tests.
  5437. 1306.50 s [vector] mapM: OK
  5438. 1306.50 s [vector] +++ OK, passed 100 tests.
  5439. 1306.50 s [vector] mapM_: OK (0.02s)
  5440. 1306.50 s [vector] +++ OK, passed 100 tests.
  5441. 1306.50 s [vector] forM: OK
  5442. 1306.50 s [vector] +++ OK, passed 100 tests.
  5443. 1306.52 s [vector] forM_: OK (0.02s)
  5444. 1306.52 s [vector] +++ OK, passed 100 tests.
  5445. 1306.52 s [vector] imapM: OK
  5446. 1306.54 s [vector] +++ OK, passed 100 tests.
  5447. 1306.55 s [vector] imapM_: OK (0.03s)
  5448. 1306.55 s [vector] +++ OK, passed 100 tests.
  5449. 1306.55 s [vector] zipWith: OK
  5450. 1306.55 s [vector] +++ OK, passed 100 tests.
  5451. 1306.56 s [vector] zipWith3: OK
  5452. 1306.56 s [vector] +++ OK, passed 100 tests.
  5453. 1306.57 s [vector] izipWith: OK
  5454. 1306.57 s [vector] +++ OK, passed 100 tests.
  5455. 1306.58 s [vector] izipWith3: OK
  5456. 1306.58 s [vector] +++ OK, passed 100 tests.
  5457. 1306.58 s [vector] izipWithM: OK
  5458. 1306.58 s [vector] +++ OK, passed 100 tests.
  5459. 1306.60 s [vector] izipWithM_: OK (0.02s)
  5460. 1306.60 s [vector] +++ OK, passed 100 tests.
  5461. 1306.61 s [vector] zipWithM: OK
  5462. 1306.61 s [vector] +++ OK, passed 100 tests.
  5463. 1306.61 s [vector] zipWithM_: OK (0.01s)
  5464. 1306.61 s [vector] +++ OK, passed 100 tests.
  5465. 1306.62 s [vector] filter: OK
  5466. 1306.62 s [vector] +++ OK, passed 100 tests.
  5467. 1306.62 s [vector] ifilter: OK
  5468. 1306.62 s [vector] +++ OK, passed 100 tests.
  5469. 1306.65 s [vector] filterM: OK (0.03s)
  5470. 1306.65 s [vector] +++ OK, passed 100 tests.
  5471. 1306.65 s [vector] uniq: OK
  5472. 1306.65 s [vector] +++ OK, passed 100 tests.
  5473. 1306.65 s [vector] mapMaybe: OK
  5474. 1306.65 s [vector] +++ OK, passed 100 tests.
  5475. 1306.65 s [vector] imapMaybe: OK
  5476. 1306.65 s [vector] +++ OK, passed 100 tests.
  5477. 1306.65 s [vector] takeWhile: OK
  5478. 1306.65 s [vector] +++ OK, passed 100 tests.
  5479. 1306.67 s [vector] dropWhile: OK
  5480. 1306.67 s [vector] +++ OK, passed 100 tests.
  5481. 1306.67 s [vector] partition: OK
  5482. 1306.67 s [vector] +++ OK, passed 100 tests.
  5483. 1306.67 s [vector] partitionWith: OK
  5484. 1306.67 s [vector] +++ OK, passed 100 tests.
  5485. 1306.67 s [vector] span: OK
  5486. 1306.67 s [vector] +++ OK, passed 100 tests.
  5487. 1306.67 s [vector] break: OK
  5488. 1306.67 s [vector] +++ OK, passed 100 tests.
  5489. 1306.67 s [vector] spanR: OK
  5490. 1306.67 s [vector] +++ OK, passed 100 tests.
  5491. 1306.67 s [vector] breakR: OK
  5492. 1306.67 s [vector] +++ OK, passed 100 tests.
  5493. 1306.67 s [vector] groupBy: OK
  5494. 1306.67 s [vector] +++ OK, passed 100 tests.
  5495. 1306.67 s [vector] elem: OK
  5496. 1306.67 s [vector] +++ OK, passed 100 tests.
  5497. 1306.68 s [vector] notElem: OK
  5498. 1306.68 s [vector] +++ OK, passed 100 tests.
  5499. 1306.68 s [vector] find: OK
  5500. 1306.68 s [vector] +++ OK, passed 100 tests.
  5501. 1306.68 s [vector] findIndex: OK
  5502. 1306.68 s [vector] +++ OK, passed 100 tests.
  5503. 1306.68 s [vector] findIndexR: OK
  5504. 1306.68 s [vector] +++ OK, passed 100 tests.
  5505. 1306.68 s [vector] findIndices: OK
  5506. 1306.68 s [vector] +++ OK, passed 100 tests.
  5507. 1306.68 s [vector] elemIndex: OK
  5508. 1306.68 s [vector] +++ OK, passed 100 tests.
  5509. 1306.69 s [vector] elemIndices: OK
  5510. 1306.69 s [vector] +++ OK, passed 100 tests.
  5511. 1306.69 s [vector] foldl: OK
  5512. 1306.70 s [vector] +++ OK, passed 100 tests.
  5513. 1306.70 s [vector] foldl1: OK
  5514. 1306.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5515. 1306.70 s [vector] foldl': OK
  5516. 1306.70 s [vector] +++ OK, passed 100 tests.
  5517. 1306.70 s [vector] foldl1': OK
  5518. 1306.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5519. 1306.70 s [vector] foldr: OK
  5520. 1306.70 s [vector] +++ OK, passed 100 tests.
  5521. 1306.70 s [vector] foldr1: OK
  5522. 1306.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5523. 1306.70 s [vector] foldr': OK
  5524. 1306.70 s [vector] +++ OK, passed 100 tests.
  5525. 1306.70 s [vector] foldr1': OK
  5526. 1306.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5527. 1306.71 s [vector] ifoldl: OK
  5528. 1306.71 s [vector] +++ OK, passed 100 tests.
  5529. 1306.72 s [vector] ifoldl': OK
  5530. 1306.72 s [vector] +++ OK, passed 100 tests.
  5531. 1306.72 s [vector] ifoldr: OK
  5532. 1306.72 s [vector] +++ OK, passed 100 tests.
  5533. 1306.72 s [vector] ifoldr': OK
  5534. 1306.72 s [vector] +++ OK, passed 100 tests.
  5535. 1306.72 s [vector] ifoldM: OK
  5536. 1306.72 s [vector] +++ OK, passed 100 tests.
  5537. 1306.72 s [vector] ifoldM': OK
  5538. 1306.72 s [vector] +++ OK, passed 100 tests.
  5539. 1306.76 s [vector] ifoldM_: OK
  5540. 1306.76 s [vector] +++ OK, passed 100 tests.
  5541. 1306.76 s [vector] ifoldM'_: OK (0.02s)
  5542. 1306.76 s [vector] +++ OK, passed 100 tests.
  5543. 1306.77 s [vector] all: OK
  5544. 1306.77 s [vector] +++ OK, passed 100 tests.
  5545. 1306.78 s [vector] any: OK
  5546. 1306.78 s [vector] +++ OK, passed 100 tests.
  5547. 1306.78 s [vector] prescanl: OK
  5548. 1306.78 s [vector] +++ OK, passed 100 tests.
  5549. 1306.78 s [vector] prescanl': OK
  5550. 1306.78 s [vector] +++ OK, passed 100 tests.
  5551. 1306.78 s [vector] postscanl: OK
  5552. 1306.78 s [vector] +++ OK, passed 100 tests.
  5553. 1306.78 s [vector] postscanl': OK
  5554. 1306.78 s [vector] +++ OK, passed 100 tests.
  5555. 1306.78 s [vector] scanl: OK
  5556. 1306.78 s [vector] +++ OK, passed 100 tests.
  5557. 1306.79 s [vector] scanl': OK
  5558. 1306.79 s [vector] +++ OK, passed 100 tests.
  5559. 1306.79 s [vector] scanl1: OK
  5560. 1306.79 s [vector] +++ OK, passed 100 tests.
  5561. 1306.79 s [vector] scanl1': OK
  5562. 1306.79 s [vector] +++ OK, passed 100 tests.
  5563. 1306.79 s [vector] iscanl: OK
  5564. 1306.79 s [vector] +++ OK, passed 100 tests.
  5565. 1306.79 s [vector] iscanl': OK
  5566. 1306.79 s [vector] +++ OK, passed 100 tests.
  5567. 1306.80 s [vector] prescanr: OK
  5568. 1306.80 s [vector] +++ OK, passed 100 tests.
  5569. 1306.80 s [vector] prescanr': OK
  5570. 1306.80 s [vector] +++ OK, passed 100 tests.
  5571. 1306.81 s [vector] postscanr: OK
  5572. 1306.81 s [vector] +++ OK, passed 100 tests.
  5573. 1306.81 s [vector] postscanr': OK
  5574. 1306.81 s [vector] +++ OK, passed 100 tests.
  5575. 1306.82 s [vector] scanr: OK
  5576. 1306.82 s [vector] +++ OK, passed 100 tests.
  5577. 1306.82 s [vector] scanr': OK
  5578. 1306.82 s [vector] +++ OK, passed 100 tests.
  5579. 1306.82 s [vector] scanr1: OK
  5580. 1306.82 s [vector] +++ OK, passed 100 tests.
  5581. 1306.82 s [vector] scanr1': OK
  5582. 1306.82 s [vector] +++ OK, passed 100 tests.
  5583. 1306.82 s [vector] iscanr: OK
  5584. 1306.82 s [vector] +++ OK, passed 100 tests.
  5585. 1306.83 s [vector] iscanr': OK
  5586. 1306.83 s [vector] +++ OK, passed 100 tests.
  5587. 1306.83 s [vector] mut_read: OK
  5588. 1306.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5589. 1306.83 s [vector] mut_write: OK
  5590. 1306.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5591. 1306.83 s [vector] mut_modify: OK
  5592. 1306.83 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5593. 1306.83 s [vector] mut_generate: OK
  5594. 1306.83 s [vector] +++ OK, passed 100 tests.
  5595. 1306.86 s [vector] mut_generateM: OK
  5596. 1306.86 s [vector] +++ OK, passed 100 tests.
  5597. 1306.86 s [vector] mut_mapM_: OK (0.02s)
  5598. 1306.86 s [vector] +++ OK, passed 100 tests.
  5599. 1306.90 s [vector] mut_imapM_: OK
  5600. 1306.90 s [vector] +++ OK, passed 100 tests.
  5601. 1306.92 s [vector] mut_forM_: OK (0.02s)
  5602. 1306.92 s [vector] +++ OK, passed 100 tests.
  5603. 1306.92 s [vector] mut_iforM_: OK (0.02s)
  5604. 1306.92 s [vector] +++ OK, passed 100 tests.
  5605. 1306.92 s [vector] mut_foldr: OK
  5606. 1306.92 s [vector] +++ OK, passed 100 tests.
  5607. 1306.92 s [vector] mut_foldr': OK
  5608. 1306.92 s [vector] +++ OK, passed 100 tests.
  5609. 1306.93 s [vector] mut_foldl: OK
  5610. 1306.93 s [vector] +++ OK, passed 100 tests.
  5611. 1306.94 s [vector] mut_foldl': OK
  5612. 1306.94 s [vector] +++ OK, passed 100 tests.
  5613. 1306.94 s [vector] mut_ifoldr: OK
  5614. 1306.94 s [vector] +++ OK, passed 100 tests.
  5615. 1306.94 s [vector] mut_ifoldr': OK
  5616. 1306.94 s [vector] +++ OK, passed 100 tests.
  5617. 1306.94 s [vector] mut_ifoldl: OK
  5618. 1306.94 s [vector] +++ OK, passed 100 tests.
  5619. 1306.95 s [vector] mut_ifoldl': OK
  5620. 1306.95 s [vector] +++ OK, passed 100 tests.
  5621. 1306.96 s [vector] mut_foldM: OK
  5622. 1306.96 s [vector] +++ OK, passed 100 tests.
  5623. 1306.96 s [vector] mut_foldM': OK
  5624. 1306.96 s [vector] +++ OK, passed 100 tests.
  5625. 1306.96 s [vector] mut_foldrM: OK
  5626. 1306.97 s [vector] +++ OK, passed 100 tests.
  5627. 1306.97 s [vector] mut_foldrM': OK
  5628. 1306.97 s [vector] +++ OK, passed 100 tests.
  5629. 1306.97 s [vector] mut_ifoldM: OK
  5630. 1306.97 s [vector] +++ OK, passed 100 tests.
  5631. 1306.97 s [vector] mut_ifoldM': OK
  5632. 1306.97 s [vector] +++ OK, passed 100 tests.
  5633. 1306.97 s [vector] mut_ifoldrM: OK
  5634. 1306.97 s [vector] +++ OK, passed 100 tests.
  5635. 1306.97 s [vector] mut_ifoldrM': OK
  5636. 1306.97 s [vector] +++ OK, passed 100 tests.
  5637. 1306.97 s [vector] compare: OK
  5638. 1306.97 s [vector] +++ OK, passed 100 tests.
  5639. 1306.97 s [vector] maximum: OK
  5640. 1306.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5641. 1306.97 s [vector] minimum: OK
  5642. 1306.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5643. 1306.97 s [vector] minIndex: OK
  5644. 1306.97 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5645. 1306.97 s [vector] maxIndex: OK
  5646. 1306.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5647. 1306.97 s [vector] maximumBy: OK
  5648. 1306.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5649. 1306.97 s [vector] minimumBy: OK
  5650. 1306.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5651. 1306.97 s [vector] maximumOn: OK
  5652. 1306.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5653. 1306.97 s [vector] minimumOn: OK
  5654. 1306.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5655. 1306.97 s [vector] maxIndexBy: OK
  5656. 1306.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5657. 1306.98 s [vector] minIndexBy: OK
  5658. 1306.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5659. 1306.98 s [vector] ListFirstMaxIndexWins: OK
  5660. 1306.98 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5661. 1306.98 s [vector] FalseListFirstMaxIndexWins: OK
  5662. 1306.98 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5663. 1306.98 s [vector] []
  5664. 1306.98 s [vector] zip: OK
  5665. 1306.98 s [vector] +++ OK, passed 100 tests.
  5666. 1306.98 s [vector] zip3: OK
  5667. 1306.98 s [vector] +++ OK, passed 100 tests.
  5668. 1306.99 s [vector] unzip: OK
  5669. 1306.99 s [vector] +++ OK, passed 100 tests.
  5670. 1306.99 s [vector] unzip3: OK
  5671. 1306.99 s [vector] +++ OK, passed 100 tests.
  5672. 1307.00 s [vector] indexed: OK
  5673. 1307.00 s [vector] +++ OK, passed 100 tests.
  5674. 1307.00 s [vector] update: OK
  5675. 1307.00 s [vector] +++ OK, passed 100 tests.
  5676. 1307.03 s [vector] concat: OK (0.03s)
  5677. 1307.03 s [vector] +++ OK, passed 100 tests.
  5678. 1307.04 s [vector] mempty: OK
  5679. 1307.04 s [vector] +++ OK, passed 100 tests.
  5680. 1307.04 s [vector] mappend: OK
  5681. 1307.04 s [vector] +++ OK, passed 100 tests.
  5682. 1307.08 s [vector] mconcat: OK (0.04s)
  5683. 1307.08 s [vector] +++ OK, passed 100 tests.
  5684. 1307.08 s [vector] fmap: OK
  5685. 1307.08 s [vector] +++ OK, passed 100 tests.
  5686. 1307.10 s [vector] return: OK
  5687. 1307.10 s [vector] +++ OK, passed 100 tests.
  5688. 1307.12 s [vector] bind: OK (0.04s)
  5689. 1307.12 s [vector] +++ OK, passed 100 tests.
  5690. 1307.12 s [vector] mzip: OK
  5691. 1307.12 s [vector] +++ OK, passed 100 tests.
  5692. 1307.12 s [vector] munzip: OK
  5693. 1307.12 s [vector] +++ OK, passed 100 tests.
  5694. 1307.12 s [vector] applicative_pure: OK
  5695. 1307.14 s [vector] +++ OK, passed 100 tests.
  5696. 1307.18 s [vector] applicative_appl: OK (0.06s)
  5697. 1307.18 s [vector] +++ OK, passed 100 tests.
  5698. 1307.18 s [vector] alternative_empty: OK
  5699. 1307.18 s [vector] +++ OK, passed 100 tests.
  5700. 1307.18 s [vector] alternative_or: OK
  5701. 1307.18 s [vector] +++ OK, passed 100 tests.
  5702. 1307.24 s [vector] sequence: OK (0.05s)
  5703. 1307.24 s [vector] +++ OK, passed 100 tests.
  5704. 1307.25 s [vector] sequence_: OK (0.02s)
  5705. 1307.25 s [vector] +++ OK, passed 100 tests.
  5706. 1307.25 s [vector] glength: OK
  5707. 1307.25 s [vector] +++ OK, passed 100 tests.
  5708. 1307.26 s [vector] sum: OK
  5709. 1307.26 s [vector] +++ OK, passed 100 tests.
  5710. 1307.26 s [vector] product: OK
  5711. 1307.26 s [vector] +++ OK, passed 100 tests.
  5712. 1307.26 s [vector] enumFromN: OK
  5713. 1307.26 s [vector] +++ OK, passed 100 tests.
  5714. 1307.26 s [vector] enumFromThenN: OK
  5715. 1307.26 s [vector] +++ OK, passed 100 tests.
  5716. 1307.26 s [vector] enumFromTo: OK
  5717. 1307.26 s [vector] +++ OK, passed 100 tests.
  5718. 1307.26 s [vector] enumFromThenTo: OK
  5719. 1307.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5720. 1307.26 s [vector] unstream
  5721. 1307.26 s [vector] unstream == vunstream (exact): OK
  5722. 1307.26 s [vector] +++ OK, passed 100 tests.
  5723. 1307.26 s [vector] unstream == vunstream (unknown): OK
  5724. 1307.26 s [vector] +++ OK, passed 100 tests.
  5725. 1307.26 s [vector] unstreamR ~= vunstream (exact): OK
  5726. 1307.26 s [vector] +++ OK, passed 100 tests.
  5727. 1307.26 s [vector] unstreamR ~= vunstream (unknown): OK
  5728. 1307.26 s [vector] +++ OK, passed 100 tests.
  5729. 1307.26 s [vector] Tests.Vector.Primitive
  5730. 1307.26 s [vector] Int
  5731. 1307.27 s [vector] fromList.toList == id: OK
  5732. 1307.27 s [vector] +++ OK, passed 100 tests.
  5733. 1307.27 s [vector] toList.fromList == id: OK
  5734. 1307.27 s [vector] +++ OK, passed 100 tests.
  5735. 1307.27 s [vector] unstream.stream == id: OK
  5736. 1307.27 s [vector] +++ OK, passed 100 tests.
  5737. 1307.27 s [vector] stream.unstream == id: OK
  5738. 1307.27 s [vector] +++ OK, passed 100 tests.
  5739. 1307.27 s [vector] eq: OK
  5740. 1307.27 s [vector] +++ OK, passed 100 tests.
  5741. 1307.27 s [vector] length: OK
  5742. 1307.27 s [vector] +++ OK, passed 100 tests.
  5743. 1307.27 s [vector] null: OK
  5744. 1307.27 s [vector] +++ OK, passed 100 tests.
  5745. 1307.27 s [vector] index: OK
  5746. 1307.27 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5747. 1307.27 s [vector] safeIndex: OK
  5748. 1307.27 s [vector] +++ OK, passed 100 tests.
  5749. 1307.27 s [vector] head: OK
  5750. 1307.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5751. 1307.27 s [vector] last: OK
  5752. 1307.27 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5753. 1307.27 s [vector] unsafeIndex: OK
  5754. 1307.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5755. 1307.27 s [vector] unsafeHead: OK
  5756. 1307.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5757. 1307.27 s [vector] unsafeLast: OK
  5758. 1307.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5759. 1307.27 s [vector] slice: OK
  5760. 1307.27 s [vector] +++ OK, passed 100 tests.
  5761. 1307.28 s [vector] init: OK
  5762. 1307.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5763. 1307.28 s [vector] tail: OK
  5764. 1307.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5765. 1307.28 s [vector] take: OK
  5766. 1307.28 s [vector] +++ OK, passed 100 tests.
  5767. 1307.28 s [vector] drop: OK
  5768. 1307.28 s [vector] +++ OK, passed 100 tests.
  5769. 1307.28 s [vector] splitAt: OK
  5770. 1307.28 s [vector] +++ OK, passed 100 tests.
  5771. 1307.28 s [vector] empty: OK
  5772. 1307.28 s [vector] +++ OK, passed 100 tests.
  5773. 1307.28 s [vector] singleton: OK
  5774. 1307.28 s [vector] +++ OK, passed 100 tests.
  5775. 1307.28 s [vector] replicate: OK
  5776. 1307.28 s [vector] +++ OK, passed 100 tests.
  5777. 1307.28 s [vector] generate: OK
  5778. 1307.28 s [vector] +++ OK, passed 100 tests.
  5779. 1307.28 s [vector] iterateN: OK
  5780. 1307.30 s [vector] +++ OK, passed 100 tests.
  5781. 1307.36 s [vector] iterateNM: OK (0.07s)
  5782. 1307.36 s [vector] +++ OK, passed 100 tests.
  5783. 1307.38 s [vector] generateM: OK (0.01s)
  5784. 1307.38 s [vector] +++ OK, passed 100 tests.
  5785. 1307.40 s [vector] replicateM: OK (0.02s)
  5786. 1307.40 s [vector] +++ OK, passed 100 tests.
  5787. 1307.40 s [vector] create: OK (0.01s)
  5788. 1307.40 s [vector] +++ OK, passed 100 tests.
  5789. 1307.40 s [vector] createT: OK
  5790. 1307.40 s [vector] +++ OK, passed 100 tests.
  5791. 1307.40 s [vector] unfoldr: OK
  5792. 1307.40 s [vector] +++ OK, passed 100 tests.
  5793. 1307.40 s [vector] unfoldrN: OK
  5794. 1307.40 s [vector] +++ OK, passed 100 tests.
  5795. 1307.40 s [vector] unfoldrExactN: OK
  5796. 1307.41 s [vector] +++ OK, passed 100 tests.
  5797. 1307.41 s [vector] unfoldrM: OK
  5798. 1307.42 s [vector] +++ OK, passed 100 tests.
  5799. 1307.44 s [vector] unfoldrNM: OK (0.01s)
  5800. 1307.44 s [vector] +++ OK, passed 100 tests.
  5801. 1307.47 s [vector] unfoldrExactNM: OK (0.04s)
  5802. 1307.48 s [vector] +++ OK, passed 100 tests.
  5803. 1307.48 s [vector] constructN: OK
  5804. 1307.48 s [vector] +++ OK, passed 100 tests.
  5805. 1307.48 s [vector] constructrN: OK
  5806. 1307.48 s [vector] +++ OK, passed 100 tests.
  5807. 1307.48 s [vector] cons: OK
  5808. 1307.48 s [vector] +++ OK, passed 100 tests.
  5809. 1307.48 s [vector] snoc: OK
  5810. 1307.50 s [vector] +++ OK, passed 100 tests.
  5811. 1307.50 s [vector] append: OK
  5812. 1307.50 s [vector] +++ OK, passed 100 tests.
  5813. 1307.50 s [vector] concat: OK (0.02s)
  5814. 1307.50 s [vector] +++ OK, passed 100 tests.
  5815. 1307.50 s [vector] force: OK
  5816. 1307.50 s [vector] +++ OK, passed 100 tests.
  5817. 1307.51 s [vector] upd: OK
  5818. 1307.51 s [vector] +++ OK, passed 100 tests.
  5819. 1307.51 s [vector] accum: OK
  5820. 1307.51 s [vector] +++ OK, passed 100 tests.
  5821. 1307.51 s [vector] reverse: OK
  5822. 1307.51 s [vector] +++ OK, passed 100 tests.
  5823. 1307.51 s [vector] backpermute: OK
  5824. 1307.52 s [vector] +++ OK, passed 100 tests.
  5825. 1307.52 s [vector] map: OK
  5826. 1307.52 s [vector] +++ OK, passed 100 tests.
  5827. 1307.53 s [vector] imap: OK
  5828. 1307.53 s [vector] +++ OK, passed 100 tests.
  5829. 1307.54 s [vector] concatMap: OK
  5830. 1307.54 s [vector] +++ OK, passed 100 tests.
  5831. 1307.54 s [vector] mapM: OK
  5832. 1307.54 s [vector] +++ OK, passed 100 tests.
  5833. 1307.55 s [vector] mapM_: OK (0.02s)
  5834. 1307.56 s [vector] +++ OK, passed 100 tests.
  5835. 1307.56 s [vector] forM: OK
  5836. 1307.56 s [vector] +++ OK, passed 100 tests.
  5837. 1307.58 s [vector] forM_: OK (0.02s)
  5838. 1307.58 s [vector] +++ OK, passed 100 tests.
  5839. 1307.58 s [vector] imapM: OK
  5840. 1307.58 s [vector] +++ OK, passed 100 tests.
  5841. 1307.60 s [vector] imapM_: OK (0.02s)
  5842. 1307.60 s [vector] +++ OK, passed 100 tests.
  5843. 1307.60 s [vector] zipWith: OK
  5844. 1307.60 s [vector] +++ OK, passed 100 tests.
  5845. 1307.60 s [vector] zipWith3: OK
  5846. 1307.60 s [vector] +++ OK, passed 100 tests.
  5847. 1307.61 s [vector] izipWith: OK
  5848. 1307.62 s [vector] +++ OK, passed 100 tests.
  5849. 1307.62 s [vector] izipWith3: OK
  5850. 1307.62 s [vector] +++ OK, passed 100 tests.
  5851. 1307.64 s [vector] izipWithM: OK (0.01s)
  5852. 1307.64 s [vector] +++ OK, passed 100 tests.
  5853. 1307.64 s [vector] izipWithM_: OK (0.02s)
  5854. 1307.66 s [vector] +++ OK, passed 100 tests.
  5855. 1307.66 s [vector] zipWithM: OK
  5856. 1307.66 s [vector] +++ OK, passed 100 tests.
  5857. 1307.66 s [vector] zipWithM_: OK (0.01s)
  5858. 1307.66 s [vector] +++ OK, passed 100 tests.
  5859. 1307.66 s [vector] filter: OK
  5860. 1307.66 s [vector] +++ OK, passed 100 tests.
  5861. 1307.68 s [vector] ifilter: OK
  5862. 1307.68 s [vector] +++ OK, passed 100 tests.
  5863. 1307.69 s [vector] filterM: OK (0.03s)
  5864. 1307.69 s [vector] +++ OK, passed 100 tests.
  5865. 1307.70 s [vector] uniq: OK
  5866. 1307.70 s [vector] +++ OK, passed 100 tests.
  5867. 1307.70 s [vector] mapMaybe: OK
  5868. 1307.70 s [vector] +++ OK, passed 100 tests.
  5869. 1307.70 s [vector] imapMaybe: OK
  5870. 1307.70 s [vector] +++ OK, passed 100 tests.
  5871. 1307.70 s [vector] takeWhile: OK
  5872. 1307.70 s [vector] +++ OK, passed 100 tests.
  5873. 1307.70 s [vector] dropWhile: OK
  5874. 1307.70 s [vector] +++ OK, passed 100 tests.
  5875. 1307.70 s [vector] partition: OK
  5876. 1307.70 s [vector] +++ OK, passed 100 tests.
  5877. 1307.70 s [vector] partitionWith: OK
  5878. 1307.70 s [vector] +++ OK, passed 100 tests.
  5879. 1307.70 s [vector] span: OK
  5880. 1307.70 s [vector] +++ OK, passed 100 tests.
  5881. 1307.70 s [vector] break: OK
  5882. 1307.70 s [vector] +++ OK, passed 100 tests.
  5883. 1307.71 s [vector] spanR: OK
  5884. 1307.71 s [vector] +++ OK, passed 100 tests.
  5885. 1307.71 s [vector] breakR: OK
  5886. 1307.71 s [vector] +++ OK, passed 100 tests.
  5887. 1307.71 s [vector] groupBy: OK
  5888. 1307.71 s [vector] +++ OK, passed 100 tests.
  5889. 1307.71 s [vector] elem: OK
  5890. 1307.71 s [vector] +++ OK, passed 100 tests.
  5891. 1307.71 s [vector] notElem: OK
  5892. 1307.71 s [vector] +++ OK, passed 100 tests.
  5893. 1307.71 s [vector] find: OK
  5894. 1307.71 s [vector] +++ OK, passed 100 tests.
  5895. 1307.71 s [vector] findIndex: OK
  5896. 1307.71 s [vector] +++ OK, passed 100 tests.
  5897. 1307.71 s [vector] findIndexR: OK
  5898. 1307.71 s [vector] +++ OK, passed 100 tests.
  5899. 1307.72 s [vector] findIndices: OK
  5900. 1307.72 s [vector] +++ OK, passed 100 tests.
  5901. 1307.72 s [vector] elemIndex: OK
  5902. 1307.72 s [vector] +++ OK, passed 100 tests.
  5903. 1307.72 s [vector] elemIndices: OK
  5904. 1307.72 s [vector] +++ OK, passed 100 tests.
  5905. 1307.72 s [vector] foldl: OK
  5906. 1307.72 s [vector] +++ OK, passed 100 tests.
  5907. 1307.72 s [vector] foldl1: OK
  5908. 1307.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5909. 1307.73 s [vector] foldl': OK
  5910. 1307.73 s [vector] +++ OK, passed 100 tests.
  5911. 1307.73 s [vector] foldl1': OK
  5912. 1307.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5913. 1307.73 s [vector] foldr: OK
  5914. 1307.74 s [vector] +++ OK, passed 100 tests.
  5915. 1307.74 s [vector] foldr1: OK
  5916. 1307.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5917. 1307.74 s [vector] foldr': OK
  5918. 1307.74 s [vector] +++ OK, passed 100 tests.
  5919. 1307.75 s [vector] foldr1': OK
  5920. 1307.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5921. 1307.75 s [vector] ifoldl: OK
  5922. 1307.75 s [vector] +++ OK, passed 100 tests.
  5923. 1307.75 s [vector] ifoldl': OK
  5924. 1307.75 s [vector] +++ OK, passed 100 tests.
  5925. 1307.76 s [vector] ifoldr: OK
  5926. 1307.76 s [vector] +++ OK, passed 100 tests.
  5927. 1307.77 s [vector] ifoldr': OK
  5928. 1307.77 s [vector] +++ OK, passed 100 tests.
  5929. 1307.78 s [vector] ifoldM: OK
  5930. 1307.78 s [vector] +++ OK, passed 100 tests.
  5931. 1307.78 s [vector] ifoldM': OK
  5932. 1307.78 s [vector] +++ OK, passed 100 tests.
  5933. 1307.82 s [vector] ifoldM_: OK (0.03s)
  5934. 1307.82 s [vector] +++ OK, passed 100 tests.
  5935. 1307.84 s [vector] ifoldM'_: OK (0.03s)
  5936. 1307.84 s [vector] +++ OK, passed 100 tests.
  5937. 1307.84 s [vector] all: OK
  5938. 1307.84 s [vector] +++ OK, passed 100 tests.
  5939. 1307.84 s [vector] any: OK
  5940. 1307.84 s [vector] +++ OK, passed 100 tests.
  5941. 1307.84 s [vector] prescanl: OK
  5942. 1307.84 s [vector] +++ OK, passed 100 tests.
  5943. 1307.84 s [vector] prescanl': OK
  5944. 1307.84 s [vector] +++ OK, passed 100 tests.
  5945. 1307.85 s [vector] postscanl: OK
  5946. 1307.86 s [vector] +++ OK, passed 100 tests.
  5947. 1307.86 s [vector] postscanl': OK
  5948. 1307.86 s [vector] +++ OK, passed 100 tests.
  5949. 1307.86 s [vector] scanl: OK
  5950. 1307.86 s [vector] +++ OK, passed 100 tests.
  5951. 1307.86 s [vector] scanl': OK
  5952. 1307.86 s [vector] +++ OK, passed 100 tests.
  5953. 1307.87 s [vector] scanl1: OK
  5954. 1307.87 s [vector] +++ OK, passed 100 tests.
  5955. 1307.87 s [vector] scanl1': OK
  5956. 1307.87 s [vector] +++ OK, passed 100 tests.
  5957. 1307.88 s [vector] iscanl: OK
  5958. 1307.88 s [vector] +++ OK, passed 100 tests.
  5959. 1307.88 s [vector] iscanl': OK
  5960. 1307.88 s [vector] +++ OK, passed 100 tests.
  5961. 1307.88 s [vector] prescanr: OK
  5962. 1307.88 s [vector] +++ OK, passed 100 tests.
  5963. 1307.88 s [vector] prescanr': OK
  5964. 1307.88 s [vector] +++ OK, passed 100 tests.
  5965. 1307.89 s [vector] postscanr: OK
  5966. 1307.90 s [vector] +++ OK, passed 100 tests.
  5967. 1307.90 s [vector] postscanr': OK
  5968. 1307.90 s [vector] +++ OK, passed 100 tests.
  5969. 1307.90 s [vector] scanr: OK
  5970. 1307.90 s [vector] +++ OK, passed 100 tests.
  5971. 1307.90 s [vector] scanr': OK
  5972. 1307.91 s [vector] +++ OK, passed 100 tests.
  5973. 1307.91 s [vector] scanr1: OK
  5974. 1307.91 s [vector] +++ OK, passed 100 tests.
  5975. 1307.91 s [vector] scanr1': OK
  5976. 1307.91 s [vector] +++ OK, passed 100 tests.
  5977. 1307.91 s [vector] iscanr: OK
  5978. 1307.92 s [vector] +++ OK, passed 100 tests.
  5979. 1307.92 s [vector] iscanr': OK
  5980. 1307.92 s [vector] +++ OK, passed 100 tests.
  5981. 1307.92 s [vector] mut_read: OK
  5982. 1307.92 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5983. 1307.92 s [vector] mut_write: OK
  5984. 1307.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5985. 1307.92 s [vector] mut_modify: OK
  5986. 1307.92 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5987. 1307.92 s [vector] mut_generate: OK
  5988. 1307.92 s [vector] +++ OK, passed 100 tests.
  5989. 1307.95 s [vector] mut_generateM: OK (0.01s)
  5990. 1307.96 s [vector] +++ OK, passed 100 tests.
  5991. 1307.96 s [vector] mut_mapM_: OK (0.02s)
  5992. 1307.96 s [vector] +++ OK, passed 100 tests.
  5993. 1307.98 s [vector] mut_imapM_: OK (0.02s)
  5994. 1307.98 s [vector] +++ OK, passed 100 tests.
  5995. 1307.99 s [vector] mut_forM_: OK (0.02s)
  5996. 1307.99 s [vector] +++ OK, passed 100 tests.
  5997. 1308.01 s [vector] mut_iforM_: OK (0.01s)
  5998. 1308.01 s [vector] +++ OK, passed 100 tests.
  5999. 1308.01 s [vector] mut_foldr: OK
  6000. 1308.01 s [vector] +++ OK, passed 100 tests.
  6001. 1308.02 s [vector] mut_foldr': OK
  6002. 1308.02 s [vector] +++ OK, passed 100 tests.
  6003. 1308.02 s [vector] mut_foldl: OK
  6004. 1308.03 s [vector] +++ OK, passed 100 tests.
  6005. 1308.03 s [vector] mut_foldl': OK
  6006. 1308.03 s [vector] +++ OK, passed 100 tests.
  6007. 1308.03 s [vector] mut_ifoldr: OK
  6008. 1308.03 s [vector] +++ OK, passed 100 tests.
  6009. 1308.04 s [vector] mut_ifoldr': OK
  6010. 1308.04 s [vector] +++ OK, passed 100 tests.
  6011. 1308.04 s [vector] mut_ifoldl: OK
  6012. 1308.05 s [vector] +++ OK, passed 100 tests.
  6013. 1308.05 s [vector] mut_ifoldl': OK
  6014. 1308.05 s [vector] +++ OK, passed 100 tests.
  6015. 1308.05 s [vector] mut_foldM: OK
  6016. 1308.05 s [vector] +++ OK, passed 100 tests.
  6017. 1308.06 s [vector] mut_foldM': OK
  6018. 1308.06 s [vector] +++ OK, passed 100 tests.
  6019. 1308.06 s [vector] mut_foldrM: OK
  6020. 1308.06 s [vector] +++ OK, passed 100 tests.
  6021. 1308.07 s [vector] mut_foldrM': OK
  6022. 1308.07 s [vector] +++ OK, passed 100 tests.
  6023. 1308.08 s [vector] mut_ifoldM: OK
  6024. 1308.08 s [vector] +++ OK, passed 100 tests.
  6025. 1308.08 s [vector] mut_ifoldM': OK
  6026. 1308.08 s [vector] +++ OK, passed 100 tests.
  6027. 1308.09 s [vector] mut_ifoldrM: OK
  6028. 1308.09 s [vector] +++ OK, passed 100 tests.
  6029. 1308.09 s [vector] mut_ifoldrM': OK
  6030. 1308.09 s [vector] +++ OK, passed 100 tests.
  6031. 1308.09 s [vector] compare: OK
  6032. 1308.09 s [vector] +++ OK, passed 100 tests.
  6033. 1308.09 s [vector] maximum: OK
  6034. 1308.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6035. 1308.09 s [vector] minimum: OK
  6036. 1308.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6037. 1308.09 s [vector] minIndex: OK
  6038. 1308.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6039. 1308.09 s [vector] maxIndex: OK
  6040. 1308.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6041. 1308.09 s [vector] maximumBy: OK
  6042. 1308.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6043. 1308.09 s [vector] minimumBy: OK
  6044. 1308.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6045. 1308.09 s [vector] maximumOn: OK
  6046. 1308.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6047. 1308.10 s [vector] minimumOn: OK
  6048. 1308.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6049. 1308.10 s [vector] maxIndexBy: OK
  6050. 1308.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6051. 1308.10 s [vector] minIndexBy: OK
  6052. 1308.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6053. 1308.10 s [vector] ListFirstMaxIndexWins: OK
  6054. 1308.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6055. 1308.10 s [vector] FalseListFirstMaxIndexWins: OK
  6056. 1308.10 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6057. 1308.10 s [vector] []
  6058. 1308.10 s [vector] mempty: OK
  6059. 1308.10 s [vector] +++ OK, passed 100 tests.
  6060. 1308.10 s [vector] mappend: OK
  6061. 1308.12 s [vector] +++ OK, passed 100 tests.
  6062. 1308.13 s [vector] mconcat: OK (0.03s)
  6063. 1308.13 s [vector] +++ OK, passed 100 tests.
  6064. 1308.13 s [vector] glength: OK
  6065. 1308.13 s [vector] +++ OK, passed 100 tests.
  6066. 1308.13 s [vector] sum: OK
  6067. 1308.13 s [vector] +++ OK, passed 100 tests.
  6068. 1308.14 s [vector] product: OK
  6069. 1308.14 s [vector] +++ OK, passed 100 tests.
  6070. 1308.14 s [vector] enumFromN: OK
  6071. 1308.14 s [vector] +++ OK, passed 100 tests.
  6072. 1308.14 s [vector] enumFromThenN: OK
  6073. 1308.14 s [vector] +++ OK, passed 100 tests.
  6074. 1308.14 s [vector] enumFromTo: OK
  6075. 1308.14 s [vector] +++ OK, passed 100 tests.
  6076. 1308.14 s [vector] enumFromThenTo: OK
  6077. 1308.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6078. 1308.14 s [vector] Double
  6079. 1308.14 s [vector] fromList.toList == id: OK
  6080. 1308.14 s [vector] +++ OK, passed 100 tests.
  6081. 1308.14 s [vector] toList.fromList == id: OK
  6082. 1308.14 s [vector] +++ OK, passed 100 tests.
  6083. 1308.15 s [vector] unstream.stream == id: OK
  6084. 1308.15 s [vector] +++ OK, passed 100 tests.
  6085. 1308.15 s [vector] stream.unstream == id: OK
  6086. 1308.15 s [vector] +++ OK, passed 100 tests.
  6087. 1308.15 s [vector] eq: OK
  6088. 1308.15 s [vector] +++ OK, passed 100 tests.
  6089. 1308.15 s [vector] length: OK
  6090. 1308.15 s [vector] +++ OK, passed 100 tests.
  6091. 1308.15 s [vector] null: OK
  6092. 1308.15 s [vector] +++ OK, passed 100 tests.
  6093. 1308.15 s [vector] index: OK
  6094. 1308.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6095. 1308.16 s [vector] safeIndex: OK
  6096. 1308.16 s [vector] +++ OK, passed 100 tests.
  6097. 1308.16 s [vector] head: OK
  6098. 1308.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6099. 1308.16 s [vector] last: OK
  6100. 1308.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6101. 1308.16 s [vector] unsafeIndex: OK
  6102. 1308.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6103. 1308.16 s [vector] unsafeHead: OK
  6104. 1308.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6105. 1308.16 s [vector] unsafeLast: OK
  6106. 1308.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6107. 1308.17 s [vector] slice: OK
  6108. 1308.17 s [vector] +++ OK, passed 100 tests.
  6109. 1308.17 s [vector] init: OK
  6110. 1308.17 s [vector] +++ OK, passed 100 tests; 26 discarded.
  6111. 1308.17 s [vector] tail: OK
  6112. 1308.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6113. 1308.17 s [vector] take: OK
  6114. 1308.17 s [vector] +++ OK, passed 100 tests.
  6115. 1308.18 s [vector] drop: OK
  6116. 1308.18 s [vector] +++ OK, passed 100 tests.
  6117. 1308.18 s [vector] splitAt: OK
  6118. 1308.18 s [vector] +++ OK, passed 100 tests.
  6119. 1308.18 s [vector] empty: OK
  6120. 1308.18 s [vector] +++ OK, passed 100 tests.
  6121. 1308.18 s [vector] singleton: OK
  6122. 1308.18 s [vector] +++ OK, passed 100 tests.
  6123. 1308.18 s [vector] replicate: OK
  6124. 1308.18 s [vector] +++ OK, passed 100 tests.
  6125. 1308.19 s [vector] generate: OK
  6126. 1308.19 s [vector] +++ OK, passed 100 tests.
  6127. 1308.19 s [vector] iterateN: OK
  6128. 1308.20 s [vector] +++ OK, passed 100 tests.
  6129. 1308.29 s [vector] iterateNM: OK (0.10s)
  6130. 1308.29 s [vector] +++ OK, passed 100 tests.
  6131. 1308.32 s [vector] generateM: OK (0.02s)
  6132. 1308.32 s [vector] +++ OK, passed 100 tests.
  6133. 1308.34 s [vector] replicateM: OK (0.02s)
  6134. 1308.34 s [vector] +++ OK, passed 100 tests.
  6135. 1308.34 s [vector] create: OK
  6136. 1308.34 s [vector] +++ OK, passed 100 tests.
  6137. 1308.35 s [vector] createT: OK
  6138. 1308.35 s [vector] +++ OK, passed 100 tests.
  6139. 1308.35 s [vector] unfoldr: OK
  6140. 1308.35 s [vector] +++ OK, passed 100 tests.
  6141. 1308.35 s [vector] unfoldrN: OK
  6142. 1308.35 s [vector] +++ OK, passed 100 tests.
  6143. 1308.35 s [vector] unfoldrExactN: OK
  6144. 1308.35 s [vector] +++ OK, passed 100 tests.
  6145. 1308.35 s [vector] unfoldrM: OK
  6146. 1308.35 s [vector] +++ OK, passed 100 tests.
  6147. 1308.36 s [vector] unfoldrNM: OK
  6148. 1308.36 s [vector] +++ OK, passed 100 tests.
  6149. 1308.40 s [vector] unfoldrExactNM: OK (0.04s)
  6150. 1308.40 s [vector] +++ OK, passed 100 tests.
  6151. 1308.42 s [vector] constructN: OK (0.02s)
  6152. 1308.42 s [vector] +++ OK, passed 100 tests.
  6153. 1308.42 s [vector] constructrN: OK (0.02s)
  6154. 1308.42 s [vector] +++ OK, passed 100 tests.
  6155. 1308.43 s [vector] cons: OK
  6156. 1308.44 s [vector] +++ OK, passed 100 tests.
  6157. 1308.44 s [vector] snoc: OK
  6158. 1308.44 s [vector] +++ OK, passed 100 tests.
  6159. 1308.44 s [vector] append: OK
  6160. 1308.44 s [vector] +++ OK, passed 100 tests.
  6161. 1308.45 s [vector] concat: OK (0.02s)
  6162. 1308.45 s [vector] +++ OK, passed 100 tests.
  6163. 1308.46 s [vector] force: OK
  6164. 1308.46 s [vector] +++ OK, passed 100 tests.
  6165. 1308.46 s [vector] upd: OK
  6166. 1308.46 s [vector] +++ OK, passed 100 tests.
  6167. 1308.47 s [vector] accum: OK (0.01s)
  6168. 1308.47 s [vector] +++ OK, passed 100 tests.
  6169. 1308.48 s [vector] reverse: OK
  6170. 1308.48 s [vector] +++ OK, passed 100 tests.
  6171. 1308.50 s [vector] backpermute: OK
  6172. 1308.50 s [vector] +++ OK, passed 100 tests.
  6173. 1308.50 s [vector] map: OK
  6174. 1308.50 s [vector] +++ OK, passed 100 tests.
  6175. 1308.50 s [vector] imap: OK
  6176. 1308.50 s [vector] +++ OK, passed 100 tests.
  6177. 1308.50 s [vector] concatMap: OK
  6178. 1308.50 s [vector] +++ OK, passed 100 tests.
  6179. 1308.51 s [vector] mapM: OK
  6180. 1308.52 s [vector] +++ OK, passed 100 tests.
  6181. 1308.55 s [vector] mapM_: OK (0.04s)
  6182. 1308.56 s [vector] +++ OK, passed 100 tests.
  6183. 1308.56 s [vector] forM: OK
  6184. 1308.56 s [vector] +++ OK, passed 100 tests.
  6185. 1308.60 s [vector] forM_: OK (0.04s)
  6186. 1308.60 s [vector] +++ OK, passed 100 tests.
  6187. 1308.62 s [vector] imapM: OK (0.01s)
  6188. 1308.62 s [vector] +++ OK, passed 100 tests.
  6189. 1308.65 s [vector] imapM_: OK (0.04s)
  6190. 1308.65 s [vector] +++ OK, passed 100 tests.
  6191. 1308.66 s [vector] zipWith: OK (0.01s)
  6192. 1308.66 s [vector] +++ OK, passed 100 tests.
  6193. 1308.66 s [vector] zipWith3: OK (0.01s)
  6194. 1308.66 s [vector] +++ OK, passed 100 tests.
  6195. 1308.67 s [vector] izipWith: OK
  6196. 1308.67 s [vector] +++ OK, passed 100 tests.
  6197. 1308.70 s [vector] izipWith3: OK
  6198. 1308.70 s [vector] +++ OK, passed 100 tests.
  6199. 1308.72 s [vector] izipWithM: OK (0.01s)
  6200. 1308.72 s [vector] +++ OK, passed 100 tests.
  6201. 1308.74 s [vector] izipWithM_: OK (0.04s)
  6202. 1308.74 s [vector] +++ OK, passed 100 tests.
  6203. 1308.76 s [vector] zipWithM: OK (0.01s)
  6204. 1308.76 s [vector] +++ OK, passed 100 tests.
  6205. 1308.79 s [vector] zipWithM_: OK (0.03s)
  6206. 1308.80 s [vector] +++ OK, passed 100 tests.
  6207. 1308.80 s [vector] filter: OK
  6208. 1308.80 s [vector] +++ OK, passed 100 tests.
  6209. 1308.80 s [vector] ifilter: OK
  6210. 1308.80 s [vector] +++ OK, passed 100 tests.
  6211. 1308.85 s [vector] filterM: OK (0.06s)
  6212. 1308.85 s [vector] +++ OK, passed 100 tests.
  6213. 1308.85 s [vector] uniq: OK
  6214. 1308.85 s [vector] +++ OK, passed 100 tests.
  6215. 1308.86 s [vector] mapMaybe: OK
  6216. 1308.86 s [vector] +++ OK, passed 100 tests.
  6217. 1308.87 s [vector] imapMaybe: OK
  6218. 1308.87 s [vector] +++ OK, passed 100 tests.
  6219. 1308.87 s [vector] takeWhile: OK
  6220. 1308.88 s [vector] +++ OK, passed 100 tests.
  6221. 1308.88 s [vector] dropWhile: OK
  6222. 1308.89 s [vector] +++ OK, passed 100 tests.
  6223. 1308.89 s [vector] partition: OK
  6224. 1308.89 s [vector] +++ OK, passed 100 tests.
  6225. 1308.89 s [vector] partitionWith: OK
  6226. 1308.89 s [vector] +++ OK, passed 100 tests.
  6227. 1308.89 s [vector] span: OK
  6228. 1308.89 s [vector] +++ OK, passed 100 tests.
  6229. 1308.89 s [vector] break: OK
  6230. 1308.90 s [vector] +++ OK, passed 100 tests.
  6231. 1308.90 s [vector] spanR: OK
  6232. 1308.90 s [vector] +++ OK, passed 100 tests.
  6233. 1308.92 s [vector] breakR: OK
  6234. 1308.92 s [vector] +++ OK, passed 100 tests.
  6235. 1308.92 s [vector] groupBy: OK (0.02s)
  6236. 1308.92 s [vector] +++ OK, passed 100 tests.
  6237. 1308.92 s [vector] elem: OK
  6238. 1308.92 s [vector] +++ OK, passed 100 tests.
  6239. 1308.92 s [vector] notElem: OK
  6240. 1308.92 s [vector] +++ OK, passed 100 tests.
  6241. 1308.92 s [vector] find: OK
  6242. 1308.92 s [vector] +++ OK, passed 100 tests.
  6243. 1308.92 s [vector] findIndex: OK
  6244. 1308.92 s [vector] +++ OK, passed 100 tests.
  6245. 1308.93 s [vector] findIndexR: OK
  6246. 1308.93 s [vector] +++ OK, passed 100 tests.
  6247. 1308.94 s [vector] findIndices: OK
  6248. 1308.94 s [vector] +++ OK, passed 100 tests.
  6249. 1308.95 s [vector] elemIndex: OK
  6250. 1308.95 s [vector] +++ OK, passed 100 tests.
  6251. 1308.96 s [vector] elemIndices: OK
  6252. 1308.96 s [vector] +++ OK, passed 100 tests.
  6253. 1308.97 s [vector] foldl: OK (0.01s)
  6254. 1308.98 s [vector] +++ OK, passed 100 tests.
  6255. 1308.98 s [vector] foldl1: OK (0.01s)
  6256. 1308.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6257. 1308.99 s [vector] foldl': OK (0.01s)
  6258. 1309.00 s [vector] +++ OK, passed 100 tests.
  6259. 1309.00 s [vector] foldl1': OK (0.01s)
  6260. 1309.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6261. 1309.02 s [vector] foldr: OK (0.02s)
  6262. 1309.02 s [vector] +++ OK, passed 100 tests.
  6263. 1309.03 s [vector] foldr1: OK (0.01s)
  6264. 1309.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6265. 1309.04 s [vector] foldr': OK (0.01s)
  6266. 1309.04 s [vector] +++ OK, passed 100 tests.
  6267. 1309.06 s [vector] foldr1': OK (0.02s)
  6268. 1309.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6269. 1309.08 s [vector] ifoldl: OK (0.02s)
  6270. 1309.08 s [vector] +++ OK, passed 100 tests.
  6271. 1309.10 s [vector] ifoldl': OK (0.02s)
  6272. 1309.10 s [vector] +++ OK, passed 100 tests.
  6273. 1309.12 s [vector] ifoldr: OK (0.02s)
  6274. 1309.12 s [vector] +++ OK, passed 100 tests.
  6275. 1309.14 s [vector] ifoldr': OK (0.02s)
  6276. 1309.14 s [vector] +++ OK, passed 100 tests.
  6277. 1309.16 s [vector] ifoldM: OK (0.03s)
  6278. 1309.16 s [vector] +++ OK, passed 100 tests.
  6279. 1309.20 s [vector] ifoldM': OK (0.03s)
  6280. 1309.20 s [vector] +++ OK, passed 100 tests.
  6281. 1309.24 s [vector] ifoldM_: OK (0.05s)
  6282. 1309.24 s [vector] +++ OK, passed 100 tests.
  6283. 1309.28 s [vector] ifoldM'_: OK (0.04s)
  6284. 1309.28 s [vector] +++ OK, passed 100 tests.
  6285. 1309.28 s [vector] all: OK
  6286. 1309.28 s [vector] +++ OK, passed 100 tests.
  6287. 1309.28 s [vector] any: OK
  6288. 1309.28 s [vector] +++ OK, passed 100 tests.
  6289. 1309.30 s [vector] prescanl: OK (0.01s)
  6290. 1309.30 s [vector] +++ OK, passed 100 tests.
  6291. 1309.32 s [vector] prescanl': OK (0.02s)
  6292. 1309.32 s [vector] +++ OK, passed 100 tests.
  6293. 1309.34 s [vector] postscanl: OK (0.02s)
  6294. 1309.34 s [vector] +++ OK, passed 100 tests.
  6295. 1309.36 s [vector] postscanl': OK (0.02s)
  6296. 1309.36 s [vector] +++ OK, passed 100 tests.
  6297. 1309.36 s [vector] scanl: OK (0.01s)
  6298. 1309.36 s [vector] +++ OK, passed 100 tests.
  6299. 1309.38 s [vector] scanl': OK (0.01s)
  6300. 1309.38 s [vector] +++ OK, passed 100 tests.
  6301. 1309.40 s [vector] scanl1: OK (0.02s)
  6302. 1309.40 s [vector] +++ OK, passed 100 tests.
  6303. 1309.40 s [vector] scanl1': OK (0.01s)
  6304. 1309.40 s [vector] +++ OK, passed 100 tests.
  6305. 1309.42 s [vector] iscanl: OK (0.02s)
  6306. 1309.42 s [vector] +++ OK, passed 100 tests.
  6307. 1309.44 s [vector] iscanl': OK (0.02s)
  6308. 1309.44 s [vector] +++ OK, passed 100 tests.
  6309. 1309.46 s [vector] prescanr: OK (0.02s)
  6310. 1309.46 s [vector] +++ OK, passed 100 tests.
  6311. 1309.48 s [vector] prescanr': OK (0.02s)
  6312. 1309.48 s [vector] +++ OK, passed 100 tests.
  6313. 1309.50 s [vector] postscanr: OK (0.02s)
  6314. 1309.50 s [vector] +++ OK, passed 100 tests.
  6315. 1309.52 s [vector] postscanr': OK (0.03s)
  6316. 1309.52 s [vector] +++ OK, passed 100 tests.
  6317. 1309.56 s [vector] scanr: OK (0.03s)
  6318. 1309.56 s [vector] +++ OK, passed 100 tests.
  6319. 1309.58 s [vector] scanr': OK (0.03s)
  6320. 1309.58 s [vector] +++ OK, passed 100 tests.
  6321. 1309.62 s [vector] scanr1: OK (0.03s)
  6322. 1309.62 s [vector] +++ OK, passed 100 tests.
  6323. 1309.62 s [vector] scanr1': OK (0.02s)
  6324. 1309.62 s [vector] +++ OK, passed 100 tests.
  6325. 1309.64 s [vector] iscanr: OK (0.02s)
  6326. 1309.64 s [vector] +++ OK, passed 100 tests.
  6327. 1309.65 s [vector] iscanr': OK (0.02s)
  6328. 1309.65 s [vector] +++ OK, passed 100 tests.
  6329. 1309.65 s [vector] mut_read: OK
  6330. 1309.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6331. 1309.65 s [vector] mut_write: OK
  6332. 1309.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6333. 1309.66 s [vector] mut_modify: OK
  6334. 1309.66 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6335. 1309.66 s [vector] mut_generate: OK
  6336. 1309.66 s [vector] +++ OK, passed 100 tests.
  6337. 1309.70 s [vector] mut_generateM: OK (0.02s)
  6338. 1309.70 s [vector] +++ OK, passed 100 tests.
  6339. 1309.72 s [vector] mut_mapM_: OK (0.04s)
  6340. 1309.72 s [vector] +++ OK, passed 100 tests.
  6341. 1309.76 s [vector] mut_imapM_: OK (0.04s)
  6342. 1309.76 s [vector] +++ OK, passed 100 tests.
  6343. 1309.80 s [vector] mut_forM_: OK (0.04s)
  6344. 1309.80 s [vector] +++ OK, passed 100 tests.
  6345. 1309.85 s [vector] mut_iforM_: OK (0.02s)
  6346. 1309.85 s [vector] +++ OK, passed 100 tests.
  6347. 1309.86 s [vector] mut_foldr: OK (0.01s)
  6348. 1309.86 s [vector] +++ OK, passed 100 tests.
  6349. 1309.88 s [vector] mut_foldr': OK (0.01s)
  6350. 1309.88 s [vector] +++ OK, passed 100 tests.
  6351. 1309.88 s [vector] mut_foldl: OK (0.01s)
  6352. 1309.88 s [vector] +++ OK, passed 100 tests.
  6353. 1309.90 s [vector] mut_foldl': OK (0.01s)
  6354. 1309.90 s [vector] +++ OK, passed 100 tests.
  6355. 1309.91 s [vector] mut_ifoldr: OK (0.02s)
  6356. 1309.91 s [vector] +++ OK, passed 100 tests.
  6357. 1309.92 s [vector] mut_ifoldr': OK
  6358. 1309.92 s [vector] +++ OK, passed 100 tests.
  6359. 1309.94 s [vector] mut_ifoldl: OK
  6360. 1309.94 s [vector] +++ OK, passed 100 tests.
  6361. 1309.96 s [vector] mut_ifoldl': OK (0.02s)
  6362. 1309.96 s [vector] +++ OK, passed 100 tests.
  6363. 1309.98 s [vector] mut_foldM: OK (0.02s)
  6364. 1310.18 s [vector] +++ OK, passed 100 tests.
  6365. 1310.18 s [vector] mut_foldM': OK (0.03s)
  6366. 1310.18 s [vector] +++ OK, passed 100 tests.
  6367. 1310.18 s [vector] mut_foldrM: OK (0.02s)
  6368. 1310.18 s [vector] +++ OK, passed 100 tests.
  6369. 1310.18 s [vector] mut_foldrM': OK (0.03s)
  6370. 1310.18 s [vector] +++ OK, passed 100 tests.
  6371. 1310.18 s [vector] mut_ifoldM: OK (0.01s)
  6372. 1310.18 s [vector] +++ OK, passed 100 tests.
  6373. 1310.18 s [vector] mut_ifoldM': OK (0.02s)
  6374. 1310.18 s [vector] +++ OK, passed 100 tests.
  6375. 1310.18 s [vector] mut_ifoldrM: OK
  6376. 1310.18 s [vector] +++ OK, passed 100 tests.
  6377. 1310.18 s [vector] mut_ifoldrM': OK (0.01s)
  6378. 1310.18 s [vector] +++ OK, passed 100 tests.
  6379. 1310.18 s [vector] compare: OK
  6380. 1310.18 s [vector] +++ OK, passed 100 tests.
  6381. 1310.18 s [vector] maximum: OK
  6382. 1310.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6383. 1310.18 s [vector] minimum: OK
  6384. 1310.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6385. 1310.18 s [vector] minIndex: OK
  6386. 1310.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6387. 1310.18 s [vector] maxIndex: OK
  6388. 1310.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6389. 1310.18 s [vector] maximumBy: OK
  6390. 1310.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6391. 1310.18 s [vector] minimumBy: OK
  6392. 1310.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6393. 1310.18 s [vector] maximumOn: OK
  6394. 1310.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6395. 1310.18 s [vector] minimumOn: OK
  6396. 1310.18 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6397. 1310.18 s [vector] maxIndexBy: OK
  6398. 1310.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6399. 1310.18 s [vector] minIndexBy: OK
  6400. 1310.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6401. 1310.18 s [vector] ListFirstMaxIndexWins: OK
  6402. 1310.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6403. 1310.18 s [vector] FalseListFirstMaxIndexWins: OK
  6404. 1310.18 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6405. 1310.18 s [vector] []
  6406. 1310.18 s [vector] mempty: OK
  6407. 1310.18 s [vector] +++ OK, passed 100 tests.
  6408. 1310.18 s [vector] mappend: OK
  6409. 1310.18 s [vector] +++ OK, passed 100 tests.
  6410. 1310.18 s [vector] mconcat: OK (0.03s)
  6411. 1310.18 s [vector] +++ OK, passed 100 tests.
  6412. 1310.18 s [vector] glength: OK
  6413. 1310.18 s [vector] +++ OK, passed 100 tests.
  6414. 1310.18 s [vector] sum: OK
  6415. 1310.18 s [vector] +++ OK, passed 100 tests.
  6416. 1310.18 s [vector] product: OK
  6417. 1310.18 s [vector] +++ OK, passed 100 tests.
  6418. 1310.18 s [vector] enumFromN: OK
  6419. 1310.18 s [vector] +++ OK, passed 100 tests.
  6420. 1310.18 s [vector] enumFromThenN: OK
  6421. 1310.18 s [vector] +++ OK, passed 100 tests.
  6422. 1310.18 s [vector] enumFromTo: OK
  6423. 1310.18 s [vector] +++ OK, passed 100 tests.
  6424. 1310.18 s [vector] enumFromThenTo: OK
  6425. 1310.18 s [vector] +++ OK, passed 100 tests; 3 discarded.
  6426. 1310.18 s [vector] unstream
  6427. 1310.18 s [vector] unstream == vunstream (exact): OK
  6428. 1310.18 s [vector] +++ OK, passed 100 tests.
  6429. 1310.18 s [vector] unstream == vunstream (unknown): OK
  6430. 1310.18 s [vector] +++ OK, passed 100 tests.
  6431. 1310.18 s [vector] unstreamR ~= vunstream (exact): OK
  6432. 1310.18 s [vector] +++ OK, passed 100 tests.
  6433. 1310.18 s [vector] unstreamR ~= vunstream (unknown): OK
  6434. 1310.18 s [vector] +++ OK, passed 100 tests.
  6435. 1310.18 s [vector] Tests.Vector.Storable
  6436. 1310.18 s [vector] Data.Vector.Storable.Vector (Int)
  6437. 1310.18 s [vector] fromList.toList == id: OK
  6438. 1310.18 s [vector] +++ OK, passed 100 tests.
  6439. 1310.18 s [vector] toList.fromList == id: OK
  6440. 1310.18 s [vector] +++ OK, passed 100 tests.
  6441. 1310.18 s [vector] unstream.stream == id: OK
  6442. 1310.18 s [vector] +++ OK, passed 100 tests.
  6443. 1310.18 s [vector] stream.unstream == id: OK
  6444. 1310.18 s [vector] +++ OK, passed 100 tests.
  6445. 1310.18 s [vector] eq: OK
  6446. 1310.18 s [vector] +++ OK, passed 100 tests.
  6447. 1310.18 s [vector] length: OK
  6448. 1310.18 s [vector] +++ OK, passed 100 tests.
  6449. 1310.18 s [vector] null: OK
  6450. 1310.18 s [vector] +++ OK, passed 100 tests.
  6451. 1310.18 s [vector] index: OK
  6452. 1310.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6453. 1310.18 s [vector] safeIndex: OK
  6454. 1310.18 s [vector] +++ OK, passed 100 tests.
  6455. 1310.18 s [vector] head: OK
  6456. 1310.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6457. 1310.19 s [vector] last: OK
  6458. 1310.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6459. 1310.19 s [vector] unsafeIndex: OK
  6460. 1310.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6461. 1310.19 s [vector] unsafeHead: OK
  6462. 1310.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6463. 1310.19 s [vector] unsafeLast: OK
  6464. 1310.19 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6465. 1310.19 s [vector] slice: OK
  6466. 1310.19 s [vector] +++ OK, passed 100 tests.
  6467. 1310.19 s [vector] init: OK
  6468. 1310.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6469. 1310.19 s [vector] tail: OK
  6470. 1310.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6471. 1310.19 s [vector] take: OK
  6472. 1310.19 s [vector] +++ OK, passed 100 tests.
  6473. 1310.19 s [vector] drop: OK
  6474. 1310.19 s [vector] +++ OK, passed 100 tests.
  6475. 1310.19 s [vector] splitAt: OK
  6476. 1310.19 s [vector] +++ OK, passed 100 tests.
  6477. 1310.19 s [vector] empty: OK
  6478. 1310.19 s [vector] +++ OK, passed 100 tests.
  6479. 1310.19 s [vector] singleton: OK
  6480. 1310.19 s [vector] +++ OK, passed 100 tests.
  6481. 1310.19 s [vector] replicate: OK
  6482. 1310.19 s [vector] +++ OK, passed 100 tests.
  6483. 1310.19 s [vector] generate: OK
  6484. 1310.19 s [vector] +++ OK, passed 100 tests.
  6485. 1310.19 s [vector] iterateN: OK
  6486. 1310.19 s [vector] +++ OK, passed 100 tests.
  6487. 1310.24 s [vector] iterateNM: OK (0.03s)
  6488. 1310.24 s [vector] +++ OK, passed 100 tests.
  6489. 1310.27 s [vector] generateM: OK (0.03s)
  6490. 1310.27 s [vector] +++ OK, passed 100 tests.
  6491. 1310.27 s [vector] replicateM: OK
  6492. 1310.27 s [vector] +++ OK, passed 100 tests.
  6493. 1310.27 s [vector] create: OK
  6494. 1310.27 s [vector] +++ OK, passed 100 tests.
  6495. 1310.27 s [vector] createT: OK
  6496. 1310.27 s [vector] +++ OK, passed 100 tests.
  6497. 1310.27 s [vector] unfoldr: OK
  6498. 1310.27 s [vector] +++ OK, passed 100 tests.
  6499. 1310.27 s [vector] unfoldrN: OK
  6500. 1310.28 s [vector] +++ OK, passed 100 tests.
  6501. 1310.28 s [vector] unfoldrExactN: OK
  6502. 1310.28 s [vector] +++ OK, passed 100 tests.
  6503. 1310.28 s [vector] unfoldrM: OK
  6504. 1310.28 s [vector] +++ OK, passed 100 tests.
  6505. 1310.28 s [vector] unfoldrNM: OK
  6506. 1310.28 s [vector] +++ OK, passed 100 tests.
  6507. 1310.31 s [vector] unfoldrExactNM: OK
  6508. 1310.31 s [vector] +++ OK, passed 100 tests.
  6509. 1310.31 s [vector] constructN: OK
  6510. 1310.32 s [vector] +++ OK, passed 100 tests.
  6511. 1310.32 s [vector] constructrN: OK
  6512. 1310.32 s [vector] +++ OK, passed 100 tests.
  6513. 1310.32 s [vector] cons: OK
  6514. 1310.32 s [vector] +++ OK, passed 100 tests.
  6515. 1310.32 s [vector] snoc: OK
  6516. 1310.32 s [vector] +++ OK, passed 100 tests.
  6517. 1310.32 s [vector] append: OK
  6518. 1310.32 s [vector] +++ OK, passed 100 tests.
  6519. 1310.33 s [vector] concat: OK (0.01s)
  6520. 1310.33 s [vector] +++ OK, passed 100 tests.
  6521. 1310.34 s [vector] force: OK
  6522. 1310.34 s [vector] +++ OK, passed 100 tests.
  6523. 1310.34 s [vector] upd: OK
  6524. 1310.34 s [vector] +++ OK, passed 100 tests.
  6525. 1310.35 s [vector] accum: OK
  6526. 1310.35 s [vector] +++ OK, passed 100 tests.
  6527. 1310.35 s [vector] reverse: OK
  6528. 1310.35 s [vector] +++ OK, passed 100 tests.
  6529. 1310.35 s [vector] backpermute: OK
  6530. 1310.35 s [vector] +++ OK, passed 100 tests.
  6531. 1310.35 s [vector] map: OK
  6532. 1310.35 s [vector] +++ OK, passed 100 tests.
  6533. 1310.35 s [vector] imap: OK
  6534. 1310.35 s [vector] +++ OK, passed 100 tests.
  6535. 1310.35 s [vector] concatMap: OK
  6536. 1310.35 s [vector] +++ OK, passed 100 tests.
  6537. 1310.35 s [vector] mapM: OK
  6538. 1310.36 s [vector] +++ OK, passed 100 tests.
  6539. 1310.38 s [vector] mapM_: OK (0.03s)
  6540. 1310.40 s [vector] +++ OK, passed 100 tests.
  6541. 1310.40 s [vector] forM: OK
  6542. 1310.40 s [vector] +++ OK, passed 100 tests.
  6543. 1310.41 s [vector] forM_: OK (0.02s)
  6544. 1310.41 s [vector] +++ OK, passed 100 tests.
  6545. 1310.41 s [vector] imapM: OK
  6546. 1310.42 s [vector] +++ OK, passed 100 tests.
  6547. 1310.43 s [vector] imapM_: OK (0.02s)
  6548. 1310.43 s [vector] +++ OK, passed 100 tests.
  6549. 1310.44 s [vector] zipWith: OK
  6550. 1310.44 s [vector] +++ OK, passed 100 tests.
  6551. 1310.44 s [vector] zipWith3: OK
  6552. 1310.44 s [vector] +++ OK, passed 100 tests.
  6553. 1310.44 s [vector] izipWith: OK
  6554. 1310.45 s [vector] +++ OK, passed 100 tests.
  6555. 1310.46 s [vector] izipWith3: OK
  6556. 1310.46 s [vector] +++ OK, passed 100 tests.
  6557. 1310.46 s [vector] izipWithM: OK
  6558. 1310.46 s [vector] +++ OK, passed 100 tests.
  6559. 1310.47 s [vector] izipWithM_: OK (0.02s)
  6560. 1310.48 s [vector] +++ OK, passed 100 tests.
  6561. 1310.48 s [vector] zipWithM: OK
  6562. 1310.48 s [vector] +++ OK, passed 100 tests.
  6563. 1310.48 s [vector] zipWithM_: OK (0.01s)
  6564. 1310.49 s [vector] +++ OK, passed 100 tests.
  6565. 1310.50 s [vector] filter: OK
  6566. 1310.50 s [vector] +++ OK, passed 100 tests.
  6567. 1310.50 s [vector] ifilter: OK
  6568. 1310.50 s [vector] +++ OK, passed 100 tests.
  6569. 1310.52 s [vector] filterM: OK (0.03s)
  6570. 1310.52 s [vector] +++ OK, passed 100 tests.
  6571. 1310.52 s [vector] uniq: OK
  6572. 1310.52 s [vector] +++ OK, passed 100 tests.
  6573. 1310.52 s [vector] mapMaybe: OK
  6574. 1310.52 s [vector] +++ OK, passed 100 tests.
  6575. 1310.53 s [vector] imapMaybe: OK
  6576. 1310.53 s [vector] +++ OK, passed 100 tests.
  6577. 1310.53 s [vector] takeWhile: OK
  6578. 1310.53 s [vector] +++ OK, passed 100 tests.
  6579. 1310.53 s [vector] dropWhile: OK
  6580. 1310.53 s [vector] +++ OK, passed 100 tests.
  6581. 1310.53 s [vector] partition: OK
  6582. 1310.53 s [vector] +++ OK, passed 100 tests.
  6583. 1310.53 s [vector] partitionWith: OK
  6584. 1310.54 s [vector] +++ OK, passed 100 tests.
  6585. 1310.54 s [vector] span: OK
  6586. 1310.54 s [vector] +++ OK, passed 100 tests.
  6587. 1310.54 s [vector] break: OK
  6588. 1310.54 s [vector] +++ OK, passed 100 tests.
  6589. 1310.54 s [vector] spanR: OK
  6590. 1310.54 s [vector] +++ OK, passed 100 tests.
  6591. 1310.54 s [vector] breakR: OK
  6592. 1310.54 s [vector] +++ OK, passed 100 tests.
  6593. 1310.54 s [vector] groupBy: OK
  6594. 1310.54 s [vector] +++ OK, passed 100 tests.
  6595. 1310.54 s [vector] elem: OK
  6596. 1310.54 s [vector] +++ OK, passed 100 tests.
  6597. 1310.54 s [vector] notElem: OK
  6598. 1310.55 s [vector] +++ OK, passed 100 tests.
  6599. 1310.55 s [vector] find: OK
  6600. 1310.55 s [vector] +++ OK, passed 100 tests.
  6601. 1310.55 s [vector] findIndex: OK
  6602. 1310.55 s [vector] +++ OK, passed 100 tests.
  6603. 1310.56 s [vector] findIndexR: OK
  6604. 1310.56 s [vector] +++ OK, passed 100 tests.
  6605. 1310.56 s [vector] findIndices: OK
  6606. 1310.56 s [vector] +++ OK, passed 100 tests.
  6607. 1310.56 s [vector] elemIndex: OK
  6608. 1310.56 s [vector] +++ OK, passed 100 tests.
  6609. 1310.56 s [vector] elemIndices: OK
  6610. 1310.56 s [vector] +++ OK, passed 100 tests.
  6611. 1310.57 s [vector] foldl: OK
  6612. 1310.57 s [vector] +++ OK, passed 100 tests.
  6613. 1310.57 s [vector] foldl1: OK
  6614. 1310.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6615. 1310.57 s [vector] foldl': OK
  6616. 1310.57 s [vector] +++ OK, passed 100 tests.
  6617. 1310.57 s [vector] foldl1': OK
  6618. 1310.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6619. 1310.57 s [vector] foldr: OK
  6620. 1310.57 s [vector] +++ OK, passed 100 tests.
  6621. 1310.57 s [vector] foldr1: OK
  6622. 1310.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6623. 1310.57 s [vector] foldr': OK
  6624. 1310.57 s [vector] +++ OK, passed 100 tests.
  6625. 1310.57 s [vector] foldr1': OK
  6626. 1310.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6627. 1310.57 s [vector] ifoldl: OK
  6628. 1310.58 s [vector] +++ OK, passed 100 tests.
  6629. 1310.58 s [vector] ifoldl': OK
  6630. 1310.58 s [vector] +++ OK, passed 100 tests.
  6631. 1310.58 s [vector] ifoldr: OK
  6632. 1310.58 s [vector] +++ OK, passed 100 tests.
  6633. 1310.59 s [vector] ifoldr': OK
  6634. 1310.60 s [vector] +++ OK, passed 100 tests.
  6635. 1310.60 s [vector] ifoldM: OK
  6636. 1310.60 s [vector] +++ OK, passed 100 tests.
  6637. 1310.60 s [vector] ifoldM': OK
  6638. 1310.60 s [vector] +++ OK, passed 100 tests.
  6639. 1310.62 s [vector] ifoldM_: OK (0.02s)
  6640. 1310.62 s [vector] +++ OK, passed 100 tests.
  6641. 1310.64 s [vector] ifoldM'_: OK (0.02s)
  6642. 1310.64 s [vector] +++ OK, passed 100 tests.
  6643. 1310.64 s [vector] all: OK
  6644. 1310.64 s [vector] +++ OK, passed 100 tests.
  6645. 1310.64 s [vector] any: OK
  6646. 1310.64 s [vector] +++ OK, passed 100 tests.
  6647. 1310.64 s [vector] prescanl: OK
  6648. 1310.65 s [vector] +++ OK, passed 100 tests.
  6649. 1310.65 s [vector] prescanl': OK
  6650. 1310.65 s [vector] +++ OK, passed 100 tests.
  6651. 1310.65 s [vector] postscanl: OK
  6652. 1310.65 s [vector] +++ OK, passed 100 tests.
  6653. 1310.66 s [vector] postscanl': OK
  6654. 1310.66 s [vector] +++ OK, passed 100 tests.
  6655. 1310.66 s [vector] scanl: OK
  6656. 1310.66 s [vector] +++ OK, passed 100 tests.
  6657. 1310.67 s [vector] scanl': OK
  6658. 1310.67 s [vector] +++ OK, passed 100 tests.
  6659. 1310.67 s [vector] scanl1: OK
  6660. 1310.67 s [vector] +++ OK, passed 100 tests.
  6661. 1310.67 s [vector] scanl1': OK
  6662. 1310.68 s [vector] +++ OK, passed 100 tests.
  6663. 1310.68 s [vector] iscanl: OK
  6664. 1310.68 s [vector] +++ OK, passed 100 tests.
  6665. 1310.69 s [vector] iscanl': OK
  6666. 1310.69 s [vector] +++ OK, passed 100 tests.
  6667. 1310.69 s [vector] prescanr: OK
  6668. 1310.69 s [vector] +++ OK, passed 100 tests.
  6669. 1310.69 s [vector] prescanr': OK
  6670. 1310.69 s [vector] +++ OK, passed 100 tests.
  6671. 1310.70 s [vector] postscanr: OK
  6672. 1310.70 s [vector] +++ OK, passed 100 tests.
  6673. 1310.70 s [vector] postscanr': OK
  6674. 1310.71 s [vector] +++ OK, passed 100 tests.
  6675. 1310.71 s [vector] scanr: OK
  6676. 1310.71 s [vector] +++ OK, passed 100 tests.
  6677. 1310.71 s [vector] scanr': OK
  6678. 1310.71 s [vector] +++ OK, passed 100 tests.
  6679. 1310.72 s [vector] scanr1: OK
  6680. 1310.72 s [vector] +++ OK, passed 100 tests.
  6681. 1310.72 s [vector] scanr1': OK
  6682. 1310.72 s [vector] +++ OK, passed 100 tests.
  6683. 1310.72 s [vector] iscanr: OK
  6684. 1310.72 s [vector] +++ OK, passed 100 tests.
  6685. 1310.72 s [vector] iscanr': OK
  6686. 1310.72 s [vector] +++ OK, passed 100 tests.
  6687. 1310.72 s [vector] mut_read: OK
  6688. 1310.72 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6689. 1310.73 s [vector] mut_write: OK
  6690. 1310.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6691. 1310.73 s [vector] mut_modify: OK
  6692. 1310.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6693. 1310.73 s [vector] mut_generate: OK
  6694. 1310.73 s [vector] +++ OK, passed 100 tests.
  6695. 1310.74 s [vector] mut_generateM: OK
  6696. 1310.74 s [vector] +++ OK, passed 100 tests.
  6697. 1310.76 s [vector] mut_mapM_: OK (0.02s)
  6698. 1310.76 s [vector] +++ OK, passed 100 tests.
  6699. 1310.78 s [vector] mut_imapM_: OK (0.02s)
  6700. 1310.78 s [vector] +++ OK, passed 100 tests.
  6701. 1310.82 s [vector] mut_forM_: OK (0.02s)
  6702. 1310.82 s [vector] +++ OK, passed 100 tests.
  6703. 1310.83 s [vector] mut_iforM_: OK (0.02s)
  6704. 1310.83 s [vector] +++ OK, passed 100 tests.
  6705. 1310.83 s [vector] mut_foldr: OK
  6706. 1310.84 s [vector] +++ OK, passed 100 tests.
  6707. 1310.84 s [vector] mut_foldr': OK
  6708. 1310.84 s [vector] +++ OK, passed 100 tests.
  6709. 1310.85 s [vector] mut_foldl: OK
  6710. 1310.85 s [vector] +++ OK, passed 100 tests.
  6711. 1310.85 s [vector] mut_foldl': OK
  6712. 1310.86 s [vector] +++ OK, passed 100 tests.
  6713. 1310.86 s [vector] mut_ifoldr: OK
  6714. 1310.86 s [vector] +++ OK, passed 100 tests.
  6715. 1310.86 s [vector] mut_ifoldr': OK
  6716. 1310.87 s [vector] +++ OK, passed 100 tests.
  6717. 1310.87 s [vector] mut_ifoldl: OK
  6718. 1310.87 s [vector] +++ OK, passed 100 tests.
  6719. 1310.87 s [vector] mut_ifoldl': OK
  6720. 1310.88 s [vector] +++ OK, passed 100 tests.
  6721. 1310.88 s [vector] mut_foldM: OK
  6722. 1310.88 s [vector] +++ OK, passed 100 tests.
  6723. 1310.88 s [vector] mut_foldM': OK
  6724. 1310.88 s [vector] +++ OK, passed 100 tests.
  6725. 1310.88 s [vector] mut_foldrM: OK
  6726. 1310.88 s [vector] +++ OK, passed 100 tests.
  6727. 1310.88 s [vector] mut_foldrM': OK
  6728. 1310.88 s [vector] +++ OK, passed 100 tests.
  6729. 1310.88 s [vector] mut_ifoldM: OK
  6730. 1310.88 s [vector] +++ OK, passed 100 tests.
  6731. 1310.88 s [vector] mut_ifoldM': OK
  6732. 1310.88 s [vector] +++ OK, passed 100 tests.
  6733. 1310.88 s [vector] mut_ifoldrM: OK
  6734. 1310.88 s [vector] +++ OK, passed 100 tests.
  6735. 1310.88 s [vector] mut_ifoldrM': OK
  6736. 1310.88 s [vector] +++ OK, passed 100 tests.
  6737. 1310.88 s [vector] compare: OK
  6738. 1310.88 s [vector] +++ OK, passed 100 tests.
  6739. 1310.88 s [vector] maximum: OK
  6740. 1310.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6741. 1310.88 s [vector] minimum: OK
  6742. 1310.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6743. 1310.90 s [vector] minIndex: OK
  6744. 1310.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6745. 1310.90 s [vector] maxIndex: OK
  6746. 1310.90 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6747. 1310.90 s [vector] maximumBy: OK
  6748. 1310.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6749. 1310.90 s [vector] minimumBy: OK
  6750. 1310.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6751. 1310.90 s [vector] maximumOn: OK
  6752. 1310.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6753. 1310.90 s [vector] minimumOn: OK
  6754. 1310.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6755. 1310.90 s [vector] maxIndexBy: OK
  6756. 1310.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6757. 1310.90 s [vector] minIndexBy: OK
  6758. 1310.90 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6759. 1310.90 s [vector] ListFirstMaxIndexWins: OK
  6760. 1310.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6761. 1310.90 s [vector] FalseListFirstMaxIndexWins: OK
  6762. 1310.90 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6763. 1310.90 s [vector] []
  6764. 1310.90 s [vector] mempty: OK
  6765. 1310.90 s [vector] +++ OK, passed 100 tests.
  6766. 1310.90 s [vector] mappend: OK
  6767. 1310.90 s [vector] +++ OK, passed 100 tests.
  6768. 1310.90 s [vector] mconcat: OK (0.02s)
  6769. 1310.90 s [vector] +++ OK, passed 100 tests.
  6770. 1310.90 s [vector] glength: OK
  6771. 1310.90 s [vector] +++ OK, passed 100 tests.
  6772. 1310.90 s [vector] sum: OK
  6773. 1310.90 s [vector] +++ OK, passed 100 tests.
  6774. 1310.91 s [vector] product: OK
  6775. 1310.91 s [vector] +++ OK, passed 100 tests.
  6776. 1310.91 s [vector] enumFromN: OK
  6777. 1310.91 s [vector] +++ OK, passed 100 tests.
  6778. 1310.91 s [vector] enumFromThenN: OK
  6779. 1310.91 s [vector] +++ OK, passed 100 tests.
  6780. 1310.91 s [vector] enumFromTo: OK
  6781. 1310.91 s [vector] +++ OK, passed 100 tests.
  6782. 1310.91 s [vector] enumFromThenTo: OK
  6783. 1310.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6784. 1310.91 s [vector] Data.Vector.Storable.Vector (Double)
  6785. 1310.91 s [vector] fromList.toList == id: OK
  6786. 1310.91 s [vector] +++ OK, passed 100 tests.
  6787. 1310.91 s [vector] toList.fromList == id: OK
  6788. 1310.91 s [vector] +++ OK, passed 100 tests.
  6789. 1310.91 s [vector] unstream.stream == id: OK
  6790. 1310.91 s [vector] +++ OK, passed 100 tests.
  6791. 1310.91 s [vector] stream.unstream == id: OK
  6792. 1310.91 s [vector] +++ OK, passed 100 tests.
  6793. 1310.91 s [vector] eq: OK
  6794. 1310.91 s [vector] +++ OK, passed 100 tests.
  6795. 1310.91 s [vector] length: OK
  6796. 1310.91 s [vector] +++ OK, passed 100 tests.
  6797. 1310.92 s [vector] null: OK
  6798. 1310.92 s [vector] +++ OK, passed 100 tests.
  6799. 1310.92 s [vector] index: OK
  6800. 1310.92 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6801. 1310.92 s [vector] safeIndex: OK
  6802. 1310.92 s [vector] +++ OK, passed 100 tests.
  6803. 1310.92 s [vector] head: OK
  6804. 1310.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6805. 1310.92 s [vector] last: OK
  6806. 1310.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6807. 1310.92 s [vector] unsafeIndex: OK
  6808. 1310.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6809. 1310.92 s [vector] unsafeHead: OK
  6810. 1310.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6811. 1310.92 s [vector] unsafeLast: OK
  6812. 1310.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6813. 1310.92 s [vector] slice: OK
  6814. 1310.92 s [vector] +++ OK, passed 100 tests.
  6815. 1310.92 s [vector] init: OK
  6816. 1310.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6817. 1310.92 s [vector] tail: OK
  6818. 1310.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6819. 1310.92 s [vector] take: OK
  6820. 1310.92 s [vector] +++ OK, passed 100 tests.
  6821. 1310.93 s [vector] drop: OK
  6822. 1310.93 s [vector] +++ OK, passed 100 tests.
  6823. 1310.93 s [vector] splitAt: OK
  6824. 1310.93 s [vector] +++ OK, passed 100 tests.
  6825. 1310.93 s [vector] empty: OK
  6826. 1310.93 s [vector] +++ OK, passed 100 tests.
  6827. 1310.93 s [vector] singleton: OK
  6828. 1310.93 s [vector] +++ OK, passed 100 tests.
  6829. 1310.93 s [vector] replicate: OK
  6830. 1310.93 s [vector] +++ OK, passed 100 tests.
  6831. 1310.93 s [vector] generate: OK
  6832. 1310.93 s [vector] +++ OK, passed 100 tests.
  6833. 1310.94 s [vector] iterateN: OK
  6834. 1310.94 s [vector] +++ OK, passed 100 tests.
  6835. 1311.01 s [vector] iterateNM: OK (0.08s)
  6836. 1311.01 s [vector] +++ OK, passed 100 tests.
  6837. 1311.05 s [vector] generateM: OK (0.03s)
  6838. 1311.05 s [vector] +++ OK, passed 100 tests.
  6839. 1311.05 s [vector] replicateM: OK
  6840. 1311.05 s [vector] +++ OK, passed 100 tests.
  6841. 1311.05 s [vector] create: OK
  6842. 1311.05 s [vector] +++ OK, passed 100 tests.
  6843. 1311.05 s [vector] createT: OK
  6844. 1311.05 s [vector] +++ OK, passed 100 tests.
  6845. 1311.05 s [vector] unfoldr: OK
  6846. 1311.05 s [vector] +++ OK, passed 100 tests.
  6847. 1311.06 s [vector] unfoldrN: OK
  6848. 1311.06 s [vector] +++ OK, passed 100 tests.
  6849. 1311.06 s [vector] unfoldrExactN: OK
  6850. 1311.06 s [vector] +++ OK, passed 100 tests.
  6851. 1311.06 s [vector] unfoldrM: OK
  6852. 1311.06 s [vector] +++ OK, passed 100 tests.
  6853. 1311.06 s [vector] unfoldrNM: OK
  6854. 1311.06 s [vector] +++ OK, passed 100 tests.
  6855. 1311.11 s [vector] unfoldrExactNM: OK (0.04s)
  6856. 1311.12 s [vector] +++ OK, passed 100 tests.
  6857. 1311.12 s [vector] constructN: OK (0.01s)
  6858. 1311.12 s [vector] +++ OK, passed 100 tests.
  6859. 1311.13 s [vector] constructrN: OK (0.01s)
  6860. 1311.13 s [vector] +++ OK, passed 100 tests.
  6861. 1311.14 s [vector] cons: OK
  6862. 1311.14 s [vector] +++ OK, passed 100 tests.
  6863. 1311.14 s [vector] snoc: OK
  6864. 1311.14 s [vector] +++ OK, passed 100 tests.
  6865. 1311.14 s [vector] append: OK
  6866. 1311.14 s [vector] +++ OK, passed 100 tests.
  6867. 1311.16 s [vector] concat: OK (0.02s)
  6868. 1311.16 s [vector] +++ OK, passed 100 tests.
  6869. 1311.18 s [vector] force: OK
  6870. 1311.18 s [vector] +++ OK, passed 100 tests.
  6871. 1311.18 s [vector] upd: OK
  6872. 1311.18 s [vector] +++ OK, passed 100 tests.
  6873. 1311.18 s [vector] accum: OK (0.01s)
  6874. 1311.18 s [vector] +++ OK, passed 100 tests.
  6875. 1311.18 s [vector] reverse: OK
  6876. 1311.18 s [vector] +++ OK, passed 100 tests.
  6877. 1311.20 s [vector] backpermute: OK
  6878. 1311.20 s [vector] +++ OK, passed 100 tests.
  6879. 1311.20 s [vector] map: OK
  6880. 1311.20 s [vector] +++ OK, passed 100 tests.
  6881. 1311.20 s [vector] imap: OK
  6882. 1311.21 s [vector] +++ OK, passed 100 tests.
  6883. 1311.22 s [vector] concatMap: OK
  6884. 1311.22 s [vector] +++ OK, passed 100 tests.
  6885. 1311.22 s [vector] mapM: OK
  6886. 1311.22 s [vector] +++ OK, passed 100 tests.
  6887. 1311.26 s [vector] mapM_: OK (0.04s)
  6888. 1311.26 s [vector] +++ OK, passed 100 tests.
  6889. 1311.28 s [vector] forM: OK
  6890. 1311.28 s [vector] +++ OK, passed 100 tests.
  6891. 1311.31 s [vector] forM_: OK (0.04s)
  6892. 1311.32 s [vector] +++ OK, passed 100 tests.
  6893. 1311.32 s [vector] imapM: OK
  6894. 1311.32 s [vector] +++ OK, passed 100 tests.
  6895. 1311.36 s [vector] imapM_: OK (0.04s)
  6896. 1311.36 s [vector] +++ OK, passed 100 tests.
  6897. 1311.37 s [vector] zipWith: OK (0.01s)
  6898. 1311.38 s [vector] +++ OK, passed 100 tests.
  6899. 1311.38 s [vector] zipWith3: OK (0.01s)
  6900. 1311.39 s [vector] +++ OK, passed 100 tests.
  6901. 1311.40 s [vector] izipWith: OK (0.01s)
  6902. 1311.40 s [vector] +++ OK, passed 100 tests.
  6903. 1311.41 s [vector] izipWith3: OK (0.01s)
  6904. 1311.42 s [vector] +++ OK, passed 100 tests.
  6905. 1311.42 s [vector] izipWithM: OK (0.01s)
  6906. 1311.42 s [vector] +++ OK, passed 100 tests.
  6907. 1311.46 s [vector] izipWithM_: OK (0.04s)
  6908. 1311.47 s [vector] +++ OK, passed 100 tests.
  6909. 1311.48 s [vector] zipWithM: OK (0.01s)
  6910. 1311.48 s [vector] +++ OK, passed 100 tests.
  6911. 1311.52 s [vector] zipWithM_: OK (0.04s)
  6912. 1311.52 s [vector] +++ OK, passed 100 tests.
  6913. 1311.52 s [vector] filter: OK
  6914. 1311.52 s [vector] +++ OK, passed 100 tests.
  6915. 1311.53 s [vector] ifilter: OK
  6916. 1311.53 s [vector] +++ OK, passed 100 tests.
  6917. 1311.58 s [vector] filterM: OK (0.04s)
  6918. 1311.58 s [vector] +++ OK, passed 100 tests.
  6919. 1311.58 s [vector] uniq: OK
  6920. 1311.58 s [vector] +++ OK, passed 100 tests.
  6921. 1311.58 s [vector] mapMaybe: OK
  6922. 1311.58 s [vector] +++ OK, passed 100 tests.
  6923. 1311.60 s [vector] imapMaybe: OK
  6924. 1311.60 s [vector] +++ OK, passed 100 tests.
  6925. 1311.60 s [vector] takeWhile: OK
  6926. 1311.60 s [vector] +++ OK, passed 100 tests.
  6927. 1311.60 s [vector] dropWhile: OK
  6928. 1311.60 s [vector] +++ OK, passed 100 tests.
  6929. 1311.61 s [vector] partition: OK
  6930. 1311.61 s [vector] +++ OK, passed 100 tests.
  6931. 1311.62 s [vector] partitionWith: OK (0.01s)
  6932. 1311.62 s [vector] +++ OK, passed 100 tests.
  6933. 1311.62 s [vector] span: OK
  6934. 1311.62 s [vector] +++ OK, passed 100 tests.
  6935. 1311.62 s [vector] break: OK
  6936. 1311.62 s [vector] +++ OK, passed 100 tests.
  6937. 1311.62 s [vector] spanR: OK
  6938. 1311.64 s [vector] +++ OK, passed 100 tests.
  6939. 1311.64 s [vector] breakR: OK
  6940. 1311.64 s [vector] +++ OK, passed 100 tests.
  6941. 1311.64 s [vector] groupBy: OK (0.02s)
  6942. 1311.64 s [vector] +++ OK, passed 100 tests.
  6943. 1311.64 s [vector] elem: OK
  6944. 1311.64 s [vector] +++ OK, passed 100 tests.
  6945. 1311.65 s [vector] notElem: OK
  6946. 1311.65 s [vector] +++ OK, passed 100 tests.
  6947. 1311.65 s [vector] find: OK
  6948. 1311.65 s [vector] +++ OK, passed 100 tests.
  6949. 1311.65 s [vector] findIndex: OK
  6950. 1311.65 s [vector] +++ OK, passed 100 tests.
  6951. 1311.65 s [vector] findIndexR: OK
  6952. 1311.66 s [vector] +++ OK, passed 100 tests.
  6953. 1311.67 s [vector] findIndices: OK (0.01s)
  6954. 1311.67 s [vector] +++ OK, passed 100 tests.
  6955. 1311.67 s [vector] elemIndex: OK
  6956. 1311.67 s [vector] +++ OK, passed 100 tests.
  6957. 1311.68 s [vector] elemIndices: OK
  6958. 1311.68 s [vector] +++ OK, passed 100 tests.
  6959. 1311.70 s [vector] foldl: OK (0.02s)
  6960. 1311.70 s [vector] +++ OK, passed 100 tests.
  6961. 1311.71 s [vector] foldl1: OK (0.01s)
  6962. 1311.72 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6963. 1311.72 s [vector] foldl': OK (0.01s)
  6964. 1311.72 s [vector] +++ OK, passed 100 tests.
  6965. 1311.74 s [vector] foldl1': OK (0.02s)
  6966. 1311.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6967. 1311.76 s [vector] foldr: OK (0.02s)
  6968. 1311.76 s [vector] +++ OK, passed 100 tests.
  6969. 1311.79 s [vector] foldr1: OK (0.02s)
  6970. 1311.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6971. 1311.79 s [vector] foldr': OK (0.01s)
  6972. 1311.79 s [vector] +++ OK, passed 100 tests.
  6973. 1311.82 s [vector] foldr1': OK (0.01s)
  6974. 1311.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6975. 1311.84 s [vector] ifoldl: OK (0.02s)
  6976. 1311.84 s [vector] +++ OK, passed 100 tests.
  6977. 1311.86 s [vector] ifoldl': OK (0.03s)
  6978. 1311.86 s [vector] +++ OK, passed 100 tests.
  6979. 1311.88 s [vector] ifoldr: OK (0.02s)
  6980. 1311.88 s [vector] +++ OK, passed 100 tests.
  6981. 1311.90 s [vector] ifoldr': OK (0.02s)
  6982. 1311.90 s [vector] +++ OK, passed 100 tests.
  6983. 1311.94 s [vector] ifoldM: OK
  6984. 1311.94 s [vector] +++ OK, passed 100 tests.
  6985. 1311.96 s [vector] ifoldM': OK (0.02s)
  6986. 1311.96 s [vector] +++ OK, passed 100 tests.
  6987. 1312.00 s [vector] ifoldM_: OK (0.05s)
  6988. 1312.00 s [vector] +++ OK, passed 100 tests.
  6989. 1312.04 s [vector] ifoldM'_: OK (0.04s)
  6990. 1312.04 s [vector] +++ OK, passed 100 tests.
  6991. 1312.04 s [vector] all: OK
  6992. 1312.04 s [vector] +++ OK, passed 100 tests.
  6993. 1312.04 s [vector] any: OK
  6994. 1312.04 s [vector] +++ OK, passed 100 tests.
  6995. 1312.06 s [vector] prescanl: OK
  6996. 1312.06 s [vector] +++ OK, passed 100 tests.
  6997. 1312.08 s [vector] prescanl': OK (0.01s)
  6998. 1312.08 s [vector] +++ OK, passed 100 tests.
  6999. 1312.10 s [vector] postscanl: OK (0.03s)
  7000. 1312.10 s [vector] +++ OK, passed 100 tests.
  7001. 1312.14 s [vector] postscanl': OK (0.02s)
  7002. 1312.14 s [vector] +++ OK, passed 100 tests.
  7003. 1312.15 s [vector] scanl: OK (0.02s)
  7004. 1312.16 s [vector] +++ OK, passed 100 tests.
  7005. 1312.16 s [vector] scanl': OK (0.01s)
  7006. 1312.17 s [vector] +++ OK, passed 100 tests.
  7007. 1312.18 s [vector] scanl1: OK (0.02s)
  7008. 1312.18 s [vector] +++ OK, passed 100 tests.
  7009. 1312.20 s [vector] scanl1': OK (0.02s)
  7010. 1312.20 s [vector] +++ OK, passed 100 tests.
  7011. 1312.20 s [vector] iscanl: OK (0.02s)
  7012. 1312.20 s [vector] +++ OK, passed 100 tests.
  7013. 1312.22 s [vector] iscanl': OK
  7014. 1312.22 s [vector] +++ OK, passed 100 tests.
  7015. 1312.24 s [vector] prescanr: OK (0.01s)
  7016. 1312.24 s [vector] +++ OK, passed 100 tests.
  7017. 1312.25 s [vector] prescanr': OK (0.02s)
  7018. 1312.25 s [vector] +++ OK, passed 100 tests.
  7019. 1312.28 s [vector] postscanr: OK (0.01s)
  7020. 1312.28 s [vector] +++ OK, passed 100 tests.
  7021. 1312.28 s [vector] postscanr': OK (0.02s)
  7022. 1312.28 s [vector] +++ OK, passed 100 tests.
  7023. 1312.29 s [vector] scanr: OK (0.02s)
  7024. 1312.29 s [vector] +++ OK, passed 100 tests.
  7025. 1312.31 s [vector] scanr': OK (0.01s)
  7026. 1312.31 s [vector] +++ OK, passed 100 tests.
  7027. 1312.34 s [vector] scanr1: OK
  7028. 1312.34 s [vector] +++ OK, passed 100 tests.
  7029. 1312.34 s [vector] scanr1': OK (0.01s)
  7030. 1312.34 s [vector] +++ OK, passed 100 tests.
  7031. 1312.36 s [vector] iscanr: OK (0.01s)
  7032. 1312.36 s [vector] +++ OK, passed 100 tests.
  7033. 1312.37 s [vector] iscanr': OK (0.01s)
  7034. 1312.37 s [vector] +++ OK, passed 100 tests.
  7035. 1312.37 s [vector] mut_read: OK
  7036. 1312.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7037. 1312.37 s [vector] mut_write: OK
  7038. 1312.37 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7039. 1312.37 s [vector] mut_modify: OK
  7040. 1312.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7041. 1312.37 s [vector] mut_generate: OK
  7042. 1312.38 s [vector] +++ OK, passed 100 tests.
  7043. 1312.40 s [vector] mut_generateM: OK (0.02s)
  7044. 1312.40 s [vector] +++ OK, passed 100 tests.
  7045. 1312.44 s [vector] mut_mapM_: OK (0.04s)
  7046. 1312.44 s [vector] +++ OK, passed 100 tests.
  7047. 1312.48 s [vector] mut_imapM_: OK (0.04s)
  7048. 1312.48 s [vector] +++ OK, passed 100 tests.
  7049. 1312.52 s [vector] mut_forM_: OK (0.03s)
  7050. 1312.52 s [vector] +++ OK, passed 100 tests.
  7051. 1312.54 s [vector] mut_iforM_: OK (0.04s)
  7052. 1312.54 s [vector] +++ OK, passed 100 tests.
  7053. 1312.56 s [vector] mut_foldr: OK (0.01s)
  7054. 1312.56 s [vector] +++ OK, passed 100 tests.
  7055. 1312.58 s [vector] mut_foldr': OK (0.01s)
  7056. 1312.58 s [vector] +++ OK, passed 100 tests.
  7057. 1312.60 s [vector] mut_foldl: OK (0.02s)
  7058. 1312.60 s [vector] +++ OK, passed 100 tests.
  7059. 1312.62 s [vector] mut_foldl': OK (0.02s)
  7060. 1312.63 s [vector] +++ OK, passed 100 tests.
  7061. 1312.64 s [vector] mut_ifoldr: OK (0.03s)
  7062. 1312.64 s [vector] +++ OK, passed 100 tests.
  7063. 1312.66 s [vector] mut_ifoldr': OK (0.01s)
  7064. 1312.66 s [vector] +++ OK, passed 100 tests.
  7065. 1312.66 s [vector] mut_ifoldl: OK (0.01s)
  7066. 1312.67 s [vector] +++ OK, passed 100 tests.
  7067. 1312.68 s [vector] mut_ifoldl': OK (0.01s)
  7068. 1312.68 s [vector] +++ OK, passed 100 tests.
  7069. 1312.70 s [vector] mut_foldM: OK (0.01s)
  7070. 1312.70 s [vector] +++ OK, passed 100 tests.
  7071. 1312.70 s [vector] mut_foldM': OK (0.01s)
  7072. 1312.70 s [vector] +++ OK, passed 100 tests.
  7073. 1312.72 s [vector] mut_foldrM: OK (0.01s)
  7074. 1312.72 s [vector] +++ OK, passed 100 tests.
  7075. 1312.72 s [vector] mut_foldrM': OK (0.01s)
  7076. 1312.72 s [vector] +++ OK, passed 100 tests.
  7077. 1312.74 s [vector] mut_ifoldM: OK (0.01s)
  7078. 1312.74 s [vector] +++ OK, passed 100 tests.
  7079. 1312.76 s [vector] mut_ifoldM': OK (0.01s)
  7080. 1312.76 s [vector] +++ OK, passed 100 tests.
  7081. 1312.78 s [vector] mut_ifoldrM: OK (0.01s)
  7082. 1312.78 s [vector] +++ OK, passed 100 tests.
  7083. 1312.78 s [vector] mut_ifoldrM': OK (0.02s)
  7084. 1312.78 s [vector] +++ OK, passed 100 tests.
  7085. 1312.78 s [vector] compare: OK
  7086. 1312.78 s [vector] +++ OK, passed 100 tests.
  7087. 1312.78 s [vector] maximum: OK
  7088. 1312.79 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7089. 1312.79 s [vector] minimum: OK
  7090. 1312.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7091. 1312.79 s [vector] minIndex: OK
  7092. 1312.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7093. 1312.79 s [vector] maxIndex: OK
  7094. 1312.79 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7095. 1312.79 s [vector] maximumBy: OK
  7096. 1312.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7097. 1312.80 s [vector] minimumBy: OK
  7098. 1312.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7099. 1312.80 s [vector] maximumOn: OK
  7100. 1312.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7101. 1312.80 s [vector] minimumOn: OK
  7102. 1312.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7103. 1312.80 s [vector] maxIndexBy: OK
  7104. 1312.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7105. 1312.80 s [vector] minIndexBy: OK
  7106. 1312.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7107. 1312.80 s [vector] ListFirstMaxIndexWins: OK
  7108. 1312.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7109. 1312.81 s [vector] FalseListFirstMaxIndexWins: OK
  7110. 1312.81 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7111. 1312.81 s [vector] []
  7112. 1312.81 s [vector] mempty: OK
  7113. 1312.81 s [vector] +++ OK, passed 100 tests.
  7114. 1312.81 s [vector] mappend: OK
  7115. 1312.81 s [vector] +++ OK, passed 100 tests.
  7116. 1312.82 s [vector] mconcat: OK (0.03s)
  7117. 1312.82 s [vector] +++ OK, passed 100 tests.
  7118. 1312.82 s [vector] glength: OK
  7119. 1312.82 s [vector] +++ OK, passed 100 tests.
  7120. 1312.84 s [vector] sum: OK
  7121. 1312.84 s [vector] +++ OK, passed 100 tests.
  7122. 1312.84 s [vector] product: OK
  7123. 1312.84 s [vector] +++ OK, passed 100 tests.
  7124. 1312.84 s [vector] enumFromN: OK
  7125. 1312.84 s [vector] +++ OK, passed 100 tests.
  7126. 1312.84 s [vector] enumFromThenN: OK
  7127. 1312.84 s [vector] +++ OK, passed 100 tests.
  7128. 1312.84 s [vector] enumFromTo: OK
  7129. 1312.84 s [vector] +++ OK, passed 100 tests.
  7130. 1312.84 s [vector] enumFromThenTo: OK
  7131. 1312.84 s [vector] +++ OK, passed 100 tests; 1 discarded.
  7132. 1312.84 s [vector] unstream
  7133. 1312.85 s [vector] unstream == vunstream (exact): OK
  7134. 1312.85 s [vector] +++ OK, passed 100 tests.
  7135. 1312.85 s [vector] unstream == vunstream (unknown): OK
  7136. 1312.85 s [vector] +++ OK, passed 100 tests.
  7137. 1312.85 s [vector] unstreamR ~= vunstream (exact): OK
  7138. 1312.85 s [vector] +++ OK, passed 100 tests.
  7139. 1312.85 s [vector] unstreamR ~= vunstream (unknown): OK
  7140. 1312.85 s [vector] +++ OK, passed 100 tests.
  7141. 1312.85 s [vector] Tests.Vector.Strict
  7142. 1312.85 s [vector] Bool
  7143. 1312.85 s [vector] fromList.toList == id: OK
  7144. 1312.85 s [vector] +++ OK, passed 100 tests.
  7145. 1312.85 s [vector] toList.fromList == id: OK
  7146. 1312.85 s [vector] +++ OK, passed 100 tests.
  7147. 1312.85 s [vector] unstream.stream == id: OK
  7148. 1312.85 s [vector] +++ OK, passed 100 tests.
  7149. 1312.85 s [vector] stream.unstream == id: OK
  7150. 1312.85 s [vector] +++ OK, passed 100 tests.
  7151. 1312.85 s [vector] eq: OK
  7152. 1312.85 s [vector] +++ OK, passed 100 tests.
  7153. 1312.85 s [vector] length: OK
  7154. 1312.85 s [vector] +++ OK, passed 100 tests.
  7155. 1312.85 s [vector] null: OK
  7156. 1312.85 s [vector] +++ OK, passed 100 tests.
  7157. 1312.85 s [vector] index: OK
  7158. 1312.85 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7159. 1312.85 s [vector] safeIndex: OK
  7160. 1312.85 s [vector] +++ OK, passed 100 tests.
  7161. 1312.85 s [vector] head: OK
  7162. 1312.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7163. 1312.86 s [vector] last: OK
  7164. 1312.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7165. 1312.86 s [vector] unsafeIndex: OK
  7166. 1312.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7167. 1312.86 s [vector] unsafeHead: OK
  7168. 1312.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7169. 1312.86 s [vector] unsafeLast: OK
  7170. 1312.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7171. 1312.86 s [vector] slice: OK
  7172. 1312.86 s [vector] +++ OK, passed 100 tests.
  7173. 1312.86 s [vector] init: OK
  7174. 1312.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7175. 1312.86 s [vector] tail: OK
  7176. 1312.86 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7177. 1312.86 s [vector] take: OK
  7178. 1312.86 s [vector] +++ OK, passed 100 tests.
  7179. 1312.86 s [vector] drop: OK
  7180. 1312.86 s [vector] +++ OK, passed 100 tests.
  7181. 1312.86 s [vector] splitAt: OK
  7182. 1312.86 s [vector] +++ OK, passed 100 tests.
  7183. 1312.86 s [vector] empty: OK
  7184. 1312.86 s [vector] +++ OK, passed 100 tests.
  7185. 1312.86 s [vector] singleton: OK
  7186. 1312.86 s [vector] +++ OK, passed 100 tests.
  7187. 1312.86 s [vector] replicate: OK
  7188. 1312.86 s [vector] +++ OK, passed 100 tests.
  7189. 1312.87 s [vector] generate: OK
  7190. 1312.87 s [vector] +++ OK, passed 100 tests.
  7191. 1312.88 s [vector] iterateN: OK
  7192. 1312.88 s [vector] +++ OK, passed 100 tests.
  7193. 1312.94 s [vector] iterateNM: OK (0.05s)
  7194. 1312.94 s [vector] +++ OK, passed 100 tests.
  7195. 1312.94 s [vector] generateM: OK (0.02s)
  7196. 1312.94 s [vector] +++ OK, passed 100 tests.
  7197. 1312.96 s [vector] replicateM: OK (0.02s)
  7198. 1312.96 s [vector] +++ OK, passed 100 tests.
  7199. 1312.96 s [vector] create: OK
  7200. 1312.96 s [vector] +++ OK, passed 100 tests.
  7201. 1312.96 s [vector] createT: OK
  7202. 1312.96 s [vector] +++ OK, passed 100 tests.
  7203. 1312.96 s [vector] unfoldr: OK
  7204. 1312.96 s [vector] +++ OK, passed 100 tests.
  7205. 1312.97 s [vector] unfoldrN: OK
  7206. 1312.97 s [vector] +++ OK, passed 100 tests.
  7207. 1312.98 s [vector] unfoldrExactN: OK
  7208. 1312.99 s [vector] +++ OK, passed 100 tests.
  7209. 1312.99 s [vector] unfoldrM: OK
  7210. 1312.99 s [vector] +++ OK, passed 100 tests.
  7211. 1312.99 s [vector] unfoldrNM: OK
  7212. 1312.99 s [vector] +++ OK, passed 100 tests.
  7213. 1313.02 s [vector] unfoldrExactNM: OK (0.04s)
  7214. 1313.03 s [vector] +++ OK, passed 100 tests.
  7215. 1313.03 s [vector] constructN: OK
  7216. 1313.03 s [vector] +++ OK, passed 100 tests.
  7217. 1313.03 s [vector] constructrN: OK
  7218. 1313.03 s [vector] +++ OK, passed 100 tests.
  7219. 1313.03 s [vector] cons: OK
  7220. 1313.03 s [vector] +++ OK, passed 100 tests.
  7221. 1313.03 s [vector] snoc: OK
  7222. 1313.04 s [vector] +++ OK, passed 100 tests.
  7223. 1313.04 s [vector] append: OK
  7224. 1313.04 s [vector] +++ OK, passed 100 tests.
  7225. 1313.04 s [vector] concat: OK (0.01s)
  7226. 1313.04 s [vector] +++ OK, passed 100 tests.
  7227. 1313.04 s [vector] force: OK
  7228. 1313.04 s [vector] +++ OK, passed 100 tests.
  7229. 1313.04 s [vector] upd: OK
  7230. 1313.05 s [vector] +++ OK, passed 100 tests.
  7231. 1313.05 s [vector] accum: OK
  7232. 1313.05 s [vector] +++ OK, passed 100 tests.
  7233. 1313.05 s [vector] reverse: OK
  7234. 1313.05 s [vector] +++ OK, passed 100 tests.
  7235. 1313.06 s [vector] backpermute: OK
  7236. 1313.06 s [vector] +++ OK, passed 100 tests.
  7237. 1313.06 s [vector] map: OK
  7238. 1313.06 s [vector] +++ OK, passed 100 tests.
  7239. 1313.06 s [vector] imap: OK
  7240. 1313.06 s [vector] +++ OK, passed 100 tests.
  7241. 1313.06 s [vector] concatMap: OK
  7242. 1313.06 s [vector] +++ OK, passed 100 tests.
  7243. 1313.06 s [vector] mapM: OK
  7244. 1313.06 s [vector] +++ OK, passed 100 tests.
  7245. 1313.07 s [vector] mapM_: OK (0.01s)
  7246. 1313.08 s [vector] +++ OK, passed 100 tests.
  7247. 1313.08 s [vector] forM: OK
  7248. 1313.08 s [vector] +++ OK, passed 100 tests.
  7249. 1313.08 s [vector] forM_: OK (0.01s)
  7250. 1313.10 s [vector] +++ OK, passed 100 tests.
  7251. 1313.10 s [vector] imapM: OK
  7252. 1313.10 s [vector] +++ OK, passed 100 tests.
  7253. 1313.10 s [vector] imapM_: OK (0.02s)
  7254. 1313.10 s [vector] +++ OK, passed 100 tests.
  7255. 1313.10 s [vector] zipWith: OK
  7256. 1313.11 s [vector] +++ OK, passed 100 tests.
  7257. 1313.11 s [vector] zipWith3: OK
  7258. 1313.11 s [vector] +++ OK, passed 100 tests.
  7259. 1313.11 s [vector] izipWith: OK
  7260. 1313.11 s [vector] +++ OK, passed 100 tests.
  7261. 1313.11 s [vector] izipWith3: OK
  7262. 1313.11 s [vector] +++ OK, passed 100 tests.
  7263. 1313.11 s [vector] izipWithM: OK
  7264. 1313.11 s [vector] +++ OK, passed 100 tests.
  7265. 1313.12 s [vector] izipWithM_: OK
  7266. 1313.12 s [vector] +++ OK, passed 100 tests.
  7267. 1313.12 s [vector] zipWithM: OK
  7268. 1313.12 s [vector] +++ OK, passed 100 tests.
  7269. 1313.13 s [vector] zipWithM_: OK
  7270. 1313.13 s [vector] +++ OK, passed 100 tests.
  7271. 1313.14 s [vector] filter: OK
  7272. 1313.14 s [vector] +++ OK, passed 100 tests.
  7273. 1313.14 s [vector] ifilter: OK
  7274. 1313.14 s [vector] +++ OK, passed 100 tests.
  7275. 1313.15 s [vector] filterM: OK (0.02s)
  7276. 1313.16 s [vector] +++ OK, passed 100 tests.
  7277. 1313.16 s [vector] uniq: OK
  7278. 1313.16 s [vector] +++ OK, passed 100 tests.
  7279. 1313.16 s [vector] mapMaybe: OK
  7280. 1313.16 s [vector] +++ OK, passed 100 tests.
  7281. 1313.16 s [vector] imapMaybe: OK
  7282. 1313.16 s [vector] +++ OK, passed 100 tests.
  7283. 1313.16 s [vector] takeWhile: OK
  7284. 1313.16 s [vector] +++ OK, passed 100 tests.
  7285. 1313.16 s [vector] dropWhile: OK
  7286. 1313.16 s [vector] +++ OK, passed 100 tests.
  7287. 1313.16 s [vector] partition: OK
  7288. 1313.16 s [vector] +++ OK, passed 100 tests.
  7289. 1313.16 s [vector] partitionWith: OK
  7290. 1313.16 s [vector] +++ OK, passed 100 tests.
  7291. 1313.16 s [vector] span: OK
  7292. 1313.16 s [vector] +++ OK, passed 100 tests.
  7293. 1313.16 s [vector] break: OK
  7294. 1313.16 s [vector] +++ OK, passed 100 tests.
  7295. 1313.17 s [vector] spanR: OK
  7296. 1313.17 s [vector] +++ OK, passed 100 tests.
  7297. 1313.17 s [vector] breakR: OK
  7298. 1313.17 s [vector] +++ OK, passed 100 tests.
  7299. 1313.17 s [vector] groupBy: OK
  7300. 1313.17 s [vector] +++ OK, passed 100 tests.
  7301. 1313.17 s [vector] elem: OK
  7302. 1313.17 s [vector] +++ OK, passed 100 tests.
  7303. 1313.17 s [vector] notElem: OK
  7304. 1313.17 s [vector] +++ OK, passed 100 tests.
  7305. 1313.17 s [vector] find: OK
  7306. 1313.17 s [vector] +++ OK, passed 100 tests.
  7307. 1313.17 s [vector] findIndex: OK
  7308. 1313.17 s [vector] +++ OK, passed 100 tests.
  7309. 1313.17 s [vector] findIndexR: OK
  7310. 1313.17 s [vector] +++ OK, passed 100 tests.
  7311. 1313.17 s [vector] findIndices: OK
  7312. 1313.17 s [vector] +++ OK, passed 100 tests.
  7313. 1313.17 s [vector] elemIndex: OK
  7314. 1313.17 s [vector] +++ OK, passed 100 tests.
  7315. 1313.17 s [vector] elemIndices: OK
  7316. 1313.17 s [vector] +++ OK, passed 100 tests.
  7317. 1313.17 s [vector] foldl: OK
  7318. 1313.17 s [vector] +++ OK, passed 100 tests.
  7319. 1313.17 s [vector] foldl1: OK
  7320. 1313.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7321. 1313.18 s [vector] foldl': OK
  7322. 1313.18 s [vector] +++ OK, passed 100 tests.
  7323. 1313.18 s [vector] foldl1': OK
  7324. 1313.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7325. 1313.18 s [vector] foldr: OK
  7326. 1313.18 s [vector] +++ OK, passed 100 tests.
  7327. 1313.18 s [vector] foldr1: OK
  7328. 1313.18 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7329. 1313.18 s [vector] foldr': OK
  7330. 1313.19 s [vector] +++ OK, passed 100 tests.
  7331. 1313.19 s [vector] foldr1': OK
  7332. 1313.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7333. 1313.19 s [vector] ifoldl: OK
  7334. 1313.19 s [vector] +++ OK, passed 100 tests.
  7335. 1313.19 s [vector] ifoldl': OK
  7336. 1313.19 s [vector] +++ OK, passed 100 tests.
  7337. 1313.19 s [vector] ifoldr: OK
  7338. 1313.19 s [vector] +++ OK, passed 100 tests.
  7339. 1313.20 s [vector] ifoldr': OK
  7340. 1313.20 s [vector] +++ OK, passed 100 tests.
  7341. 1313.22 s [vector] ifoldM: OK
  7342. 1313.22 s [vector] +++ OK, passed 100 tests.
  7343. 1313.22 s [vector] ifoldM': OK
  7344. 1313.22 s [vector] +++ OK, passed 100 tests.
  7345. 1313.22 s [vector] ifoldM_: OK (0.01s)
  7346. 1313.22 s [vector] +++ OK, passed 100 tests.
  7347. 1313.23 s [vector] ifoldM'_: OK (0.01s)
  7348. 1313.23 s [vector] +++ OK, passed 100 tests.
  7349. 1313.23 s [vector] all: OK
  7350. 1313.23 s [vector] +++ OK, passed 100 tests.
  7351. 1313.23 s [vector] any: OK
  7352. 1313.23 s [vector] +++ OK, passed 100 tests.
  7353. 1313.23 s [vector] prescanl: OK
  7354. 1313.23 s [vector] +++ OK, passed 100 tests.
  7355. 1313.23 s [vector] prescanl': OK
  7356. 1313.23 s [vector] +++ OK, passed 100 tests.
  7357. 1313.23 s [vector] postscanl: OK
  7358. 1313.23 s [vector] +++ OK, passed 100 tests.
  7359. 1313.23 s [vector] postscanl': OK
  7360. 1313.23 s [vector] +++ OK, passed 100 tests.
  7361. 1313.24 s [vector] scanl: OK
  7362. 1313.24 s [vector] +++ OK, passed 100 tests.
  7363. 1313.24 s [vector] scanl': OK
  7364. 1313.24 s [vector] +++ OK, passed 100 tests.
  7365. 1313.24 s [vector] scanl1: OK
  7366. 1313.25 s [vector] +++ OK, passed 100 tests.
  7367. 1313.25 s [vector] scanl1': OK
  7368. 1313.25 s [vector] +++ OK, passed 100 tests.
  7369. 1313.25 s [vector] iscanl: OK
  7370. 1313.25 s [vector] +++ OK, passed 100 tests.
  7371. 1313.25 s [vector] iscanl': OK
  7372. 1313.25 s [vector] +++ OK, passed 100 tests.
  7373. 1313.25 s [vector] prescanr: OK
  7374. 1313.25 s [vector] +++ OK, passed 100 tests.
  7375. 1313.25 s [vector] prescanr': OK
  7376. 1313.26 s [vector] +++ OK, passed 100 tests.
  7377. 1313.26 s [vector] postscanr: OK
  7378. 1313.26 s [vector] +++ OK, passed 100 tests.
  7379. 1313.26 s [vector] postscanr': OK
  7380. 1313.26 s [vector] +++ OK, passed 100 tests.
  7381. 1313.26 s [vector] scanr: OK
  7382. 1313.27 s [vector] +++ OK, passed 100 tests.
  7383. 1313.27 s [vector] scanr': OK
  7384. 1313.27 s [vector] +++ OK, passed 100 tests.
  7385. 1313.27 s [vector] scanr1: OK
  7386. 1313.27 s [vector] +++ OK, passed 100 tests.
  7387. 1313.27 s [vector] scanr1': OK
  7388. 1313.27 s [vector] +++ OK, passed 100 tests.
  7389. 1313.27 s [vector] iscanr: OK
  7390. 1313.27 s [vector] +++ OK, passed 100 tests.
  7391. 1313.27 s [vector] iscanr': OK
  7392. 1313.27 s [vector] +++ OK, passed 100 tests.
  7393. 1313.27 s [vector] mut_read: OK
  7394. 1313.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7395. 1313.27 s [vector] mut_write: OK
  7396. 1313.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7397. 1313.27 s [vector] mut_modify: OK
  7398. 1313.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7399. 1313.28 s [vector] mut_generate: OK
  7400. 1313.28 s [vector] +++ OK, passed 100 tests.
  7401. 1313.28 s [vector] mut_generateM: OK
  7402. 1313.28 s [vector] +++ OK, passed 100 tests.
  7403. 1313.31 s [vector] mut_mapM_: OK (0.02s)
  7404. 1313.31 s [vector] +++ OK, passed 100 tests.
  7405. 1313.32 s [vector] mut_imapM_: OK (0.01s)
  7406. 1313.32 s [vector] +++ OK, passed 100 tests.
  7407. 1313.34 s [vector] mut_forM_: OK (0.01s)
  7408. 1313.34 s [vector] +++ OK, passed 100 tests.
  7409. 1313.34 s [vector] mut_iforM_: OK (0.01s)
  7410. 1313.34 s [vector] +++ OK, passed 100 tests.
  7411. 1313.34 s [vector] mut_foldr: OK
  7412. 1313.34 s [vector] +++ OK, passed 100 tests.
  7413. 1313.35 s [vector] mut_foldr': OK
  7414. 1313.35 s [vector] +++ OK, passed 100 tests.
  7415. 1313.35 s [vector] mut_foldl: OK
  7416. 1313.35 s [vector] +++ OK, passed 100 tests.
  7417. 1313.35 s [vector] mut_foldl': OK
  7418. 1313.35 s [vector] +++ OK, passed 100 tests.
  7419. 1313.35 s [vector] mut_ifoldr: OK
  7420. 1313.35 s [vector] +++ OK, passed 100 tests.
  7421. 1313.35 s [vector] mut_ifoldr': OK
  7422. 1313.36 s [vector] +++ OK, passed 100 tests.
  7423. 1313.36 s [vector] mut_ifoldl: OK
  7424. 1313.36 s [vector] +++ OK, passed 100 tests.
  7425. 1313.36 s [vector] mut_ifoldl': OK
  7426. 1313.36 s [vector] +++ OK, passed 100 tests.
  7427. 1313.36 s [vector] mut_foldM: OK
  7428. 1313.37 s [vector] +++ OK, passed 100 tests.
  7429. 1313.37 s [vector] mut_foldM': OK
  7430. 1313.37 s [vector] +++ OK, passed 100 tests.
  7431. 1313.38 s [vector] mut_foldrM: OK
  7432. 1313.38 s [vector] +++ OK, passed 100 tests.
  7433. 1313.38 s [vector] mut_foldrM': OK
  7434. 1313.39 s [vector] +++ OK, passed 100 tests.
  7435. 1313.39 s [vector] mut_ifoldM: OK
  7436. 1313.39 s [vector] +++ OK, passed 100 tests.
  7437. 1313.39 s [vector] mut_ifoldM': OK
  7438. 1313.39 s [vector] +++ OK, passed 100 tests.
  7439. 1313.39 s [vector] mut_ifoldrM: OK
  7440. 1313.39 s [vector] +++ OK, passed 100 tests.
  7441. 1313.39 s [vector] mut_ifoldrM': OK
  7442. 1313.39 s [vector] +++ OK, passed 100 tests.
  7443. 1313.39 s [vector] compare: OK
  7444. 1313.39 s [vector] +++ OK, passed 100 tests.
  7445. 1313.39 s [vector] maximum: OK
  7446. 1313.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7447. 1313.39 s [vector] minimum: OK
  7448. 1313.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7449. 1313.39 s [vector] minIndex: OK
  7450. 1313.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7451. 1313.39 s [vector] maxIndex: OK
  7452. 1313.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7453. 1313.39 s [vector] maximumBy: OK
  7454. 1313.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7455. 1313.40 s [vector] minimumBy: OK
  7456. 1313.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7457. 1313.40 s [vector] maximumOn: OK
  7458. 1313.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7459. 1313.40 s [vector] minimumOn: OK
  7460. 1313.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7461. 1313.40 s [vector] maxIndexBy: OK
  7462. 1313.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7463. 1313.40 s [vector] minIndexBy: OK
  7464. 1313.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7465. 1313.40 s [vector] ListFirstMaxIndexWins: OK
  7466. 1313.40 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7467. 1313.40 s [vector] FalseListFirstMaxIndexWins: OK
  7468. 1313.40 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7469. 1313.40 s [vector] []
  7470. 1313.40 s [vector] zip: OK
  7471. 1313.40 s [vector] +++ OK, passed 100 tests.
  7472. 1313.40 s [vector] zip3: OK
  7473. 1313.40 s [vector] +++ OK, passed 100 tests.
  7474. 1313.40 s [vector] unzip: OK
  7475. 1313.41 s [vector] +++ OK, passed 100 tests.
  7476. 1313.42 s [vector] unzip3: OK
  7477. 1313.42 s [vector] +++ OK, passed 100 tests.
  7478. 1313.42 s [vector] indexed: OK
  7479. 1313.42 s [vector] +++ OK, passed 100 tests.
  7480. 1313.42 s [vector] update: OK
  7481. 1313.42 s [vector] +++ OK, passed 100 tests.
  7482. 1313.42 s [vector] concat: OK
  7483. 1313.42 s [vector] +++ OK, passed 100 tests.
  7484. 1313.42 s [vector] mempty: OK
  7485. 1313.42 s [vector] +++ OK, passed 100 tests.
  7486. 1313.43 s [vector] mappend: OK
  7487. 1313.43 s [vector] +++ OK, passed 100 tests.
  7488. 1313.43 s [vector] mconcat: OK
  7489. 1313.43 s [vector] +++ OK, passed 100 tests.
  7490. 1313.43 s [vector] fmap: OK
  7491. 1313.44 s [vector] +++ OK, passed 100 tests.
  7492. 1313.44 s [vector] return: OK
  7493. 1313.44 s [vector] +++ OK, passed 100 tests.
  7494. 1313.44 s [vector] bind: OK (0.01s)
  7495. 1313.44 s [vector] +++ OK, passed 100 tests.
  7496. 1313.44 s [vector] mzip: OK
  7497. 1313.44 s [vector] +++ OK, passed 100 tests.
  7498. 1313.44 s [vector] munzip: OK
  7499. 1313.45 s [vector] +++ OK, passed 100 tests.
  7500. 1313.45 s [vector] applicative_pure: OK
  7501. 1313.45 s [vector] +++ OK, passed 100 tests.
  7502. 1313.46 s [vector] applicative_appl: OK (0.02s)
  7503. 1313.46 s [vector] +++ OK, passed 100 tests.
  7504. 1313.46 s [vector] alternative_empty: OK
  7505. 1313.46 s [vector] +++ OK, passed 100 tests.
  7506. 1313.48 s [vector] alternative_or: OK
  7507. 1313.48 s [vector] +++ OK, passed 100 tests.
  7508. 1313.49 s [vector] sequence: OK (0.02s)
  7509. 1313.49 s [vector] +++ OK, passed 100 tests.
  7510. 1313.50 s [vector] sequence_: OK
  7511. 1313.50 s [vector] +++ OK, passed 100 tests.
  7512. 1313.50 s [vector] glength: OK
  7513. 1313.50 s [vector] +++ OK, passed 100 tests.
  7514. 1313.50 s [vector] and: OK
  7515. 1313.50 s [vector] +++ OK, passed 100 tests.
  7516. 1313.50 s [vector] or: OK
  7517. 1313.50 s [vector] +++ OK, passed 100 tests.
  7518. 1313.50 s [vector] Int
  7519. 1313.50 s [vector] fromList.toList == id: OK
  7520. 1313.50 s [vector] +++ OK, passed 100 tests.
  7521. 1313.50 s [vector] toList.fromList == id: OK
  7522. 1313.50 s [vector] +++ OK, passed 100 tests.
  7523. 1313.50 s [vector] unstream.stream == id: OK
  7524. 1313.50 s [vector] +++ OK, passed 100 tests.
  7525. 1313.50 s [vector] stream.unstream == id: OK
  7526. 1313.50 s [vector] +++ OK, passed 100 tests.
  7527. 1313.50 s [vector] eq: OK
  7528. 1313.50 s [vector] +++ OK, passed 100 tests.
  7529. 1313.50 s [vector] length: OK
  7530. 1313.50 s [vector] +++ OK, passed 100 tests.
  7531. 1313.50 s [vector] null: OK
  7532. 1313.50 s [vector] +++ OK, passed 100 tests.
  7533. 1313.50 s [vector] index: OK
  7534. 1313.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7535. 1313.50 s [vector] safeIndex: OK
  7536. 1313.50 s [vector] +++ OK, passed 100 tests.
  7537. 1313.50 s [vector] head: OK
  7538. 1313.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7539. 1313.50 s [vector] last: OK
  7540. 1313.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7541. 1313.50 s [vector] unsafeIndex: OK
  7542. 1313.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7543. 1313.51 s [vector] unsafeHead: OK
  7544. 1313.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7545. 1313.51 s [vector] unsafeLast: OK
  7546. 1313.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7547. 1313.51 s [vector] slice: OK
  7548. 1313.51 s [vector] +++ OK, passed 100 tests.
  7549. 1313.51 s [vector] init: OK
  7550. 1313.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7551. 1313.51 s [vector] tail: OK
  7552. 1313.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7553. 1313.51 s [vector] take: OK
  7554. 1313.51 s [vector] +++ OK, passed 100 tests.
  7555. 1313.52 s [vector] drop: OK
  7556. 1313.52 s [vector] +++ OK, passed 100 tests.
  7557. 1313.52 s [vector] splitAt: OK
  7558. 1313.52 s [vector] +++ OK, passed 100 tests.
  7559. 1313.52 s [vector] empty: OK
  7560. 1313.52 s [vector] +++ OK, passed 100 tests.
  7561. 1313.52 s [vector] singleton: OK
  7562. 1313.52 s [vector] +++ OK, passed 100 tests.
  7563. 1313.52 s [vector] replicate: OK
  7564. 1313.52 s [vector] +++ OK, passed 100 tests.
  7565. 1313.52 s [vector] generate: OK
  7566. 1313.52 s [vector] +++ OK, passed 100 tests.
  7567. 1313.52 s [vector] iterateN: OK
  7568. 1313.52 s [vector] +++ OK, passed 100 tests.
  7569. 1313.58 s [vector] iterateNM: OK (0.05s)
  7570. 1313.58 s [vector] +++ OK, passed 100 tests.
  7571. 1313.58 s [vector] generateM: OK (0.02s)
  7572. 1313.58 s [vector] +++ OK, passed 100 tests.
  7573. 1313.58 s [vector] replicateM: OK
  7574. 1313.58 s [vector] +++ OK, passed 100 tests.
  7575. 1313.58 s [vector] create: OK
  7576. 1313.58 s [vector] +++ OK, passed 100 tests.
  7577. 1313.59 s [vector] createT: OK
  7578. 1313.59 s [vector] +++ OK, passed 100 tests.
  7579. 1313.59 s [vector] unfoldr: OK
  7580. 1313.59 s [vector] +++ OK, passed 100 tests.
  7581. 1313.59 s [vector] unfoldrN: OK
  7582. 1313.59 s [vector] +++ OK, passed 100 tests.
  7583. 1313.59 s [vector] unfoldrExactN: OK
  7584. 1313.59 s [vector] +++ OK, passed 100 tests.
  7585. 1313.60 s [vector] unfoldrM: OK
  7586. 1313.60 s [vector] +++ OK, passed 100 tests.
  7587. 1313.60 s [vector] unfoldrNM: OK
  7588. 1313.60 s [vector] +++ OK, passed 100 tests.
  7589. 1313.70 s [vector] unfoldrExactNM: OK (0.10s)
  7590. 1313.70 s [vector] +++ OK, passed 100 tests.
  7591. 1313.71 s [vector] constructN: OK (0.01s)
  7592. 1313.71 s [vector] +++ OK, passed 100 tests.
  7593. 1313.71 s [vector] constructrN: OK
  7594. 1313.72 s [vector] +++ OK, passed 100 tests.
  7595. 1313.72 s [vector] cons: OK
  7596. 1313.72 s [vector] +++ OK, passed 100 tests.
  7597. 1313.72 s [vector] snoc: OK
  7598. 1313.72 s [vector] +++ OK, passed 100 tests.
  7599. 1313.72 s [vector] append: OK
  7600. 1313.73 s [vector] +++ OK, passed 100 tests.
  7601. 1313.73 s [vector] concat: OK (0.02s)
  7602. 1313.73 s [vector] +++ OK, passed 100 tests.
  7603. 1313.73 s [vector] force: OK
  7604. 1313.74 s [vector] +++ OK, passed 100 tests.
  7605. 1313.74 s [vector] upd: OK
  7606. 1313.74 s [vector] +++ OK, passed 100 tests.
  7607. 1313.74 s [vector] accum: OK
  7608. 1313.74 s [vector] +++ OK, passed 100 tests.
  7609. 1313.74 s [vector] reverse: OK
  7610. 1313.74 s [vector] +++ OK, passed 100 tests.
  7611. 1313.74 s [vector] backpermute: OK
  7612. 1313.75 s [vector] +++ OK, passed 100 tests.
  7613. 1313.75 s [vector] map: OK
  7614. 1313.75 s [vector] +++ OK, passed 100 tests.
  7615. 1313.75 s [vector] imap: OK
  7616. 1313.75 s [vector] +++ OK, passed 100 tests.
  7617. 1313.75 s [vector] concatMap: OK
  7618. 1313.75 s [vector] +++ OK, passed 100 tests.
  7619. 1313.76 s [vector] mapM: OK
  7620. 1313.76 s [vector] +++ OK, passed 100 tests.
  7621. 1313.78 s [vector] mapM_: OK (0.03s)
  7622. 1313.78 s [vector] +++ OK, passed 100 tests.
  7623. 1313.80 s [vector] forM: OK
  7624. 1313.80 s [vector] +++ OK, passed 100 tests.
  7625. 1313.80 s [vector] forM_: OK (0.02s)
  7626. 1313.82 s [vector] +++ OK, passed 100 tests.
  7627. 1313.82 s [vector] imapM: OK
  7628. 1313.82 s [vector] +++ OK, passed 100 tests.
  7629. 1313.83 s [vector] imapM_: OK (0.02s)
  7630. 1313.83 s [vector] +++ OK, passed 100 tests.
  7631. 1313.83 s [vector] zipWith: OK
  7632. 1313.84 s [vector] +++ OK, passed 100 tests.
  7633. 1313.84 s [vector] zipWith3: OK
  7634. 1313.84 s [vector] +++ OK, passed 100 tests.
  7635. 1313.84 s [vector] izipWith: OK
  7636. 1313.84 s [vector] +++ OK, passed 100 tests.
  7637. 1313.84 s [vector] izipWith3: OK
  7638. 1313.84 s [vector] +++ OK, passed 100 tests.
  7639. 1313.84 s [vector] izipWithM: OK
  7640. 1313.84 s [vector] +++ OK, passed 100 tests.
  7641. 1313.86 s [vector] izipWithM_: OK (0.02s)
  7642. 1313.86 s [vector] +++ OK, passed 100 tests.
  7643. 1313.86 s [vector] zipWithM: OK
  7644. 1313.86 s [vector] +++ OK, passed 100 tests.
  7645. 1313.88 s [vector] zipWithM_: OK (0.02s)
  7646. 1313.88 s [vector] +++ OK, passed 100 tests.
  7647. 1313.88 s [vector] filter: OK
  7648. 1313.88 s [vector] +++ OK, passed 100 tests.
  7649. 1313.88 s [vector] ifilter: OK
  7650. 1313.88 s [vector] +++ OK, passed 100 tests.
  7651. 1313.92 s [vector] filterM: OK (0.03s)
  7652. 1313.92 s [vector] +++ OK, passed 100 tests.
  7653. 1313.92 s [vector] uniq: OK
  7654. 1313.92 s [vector] +++ OK, passed 100 tests.
  7655. 1313.92 s [vector] mapMaybe: OK
  7656. 1313.92 s [vector] +++ OK, passed 100 tests.
  7657. 1313.92 s [vector] imapMaybe: OK
  7658. 1313.93 s [vector] +++ OK, passed 100 tests.
  7659. 1313.93 s [vector] takeWhile: OK
  7660. 1313.93 s [vector] +++ OK, passed 100 tests.
  7661. 1313.93 s [vector] dropWhile: OK
  7662. 1313.93 s [vector] +++ OK, passed 100 tests.
  7663. 1313.93 s [vector] partition: OK
  7664. 1313.93 s [vector] +++ OK, passed 100 tests.
  7665. 1313.93 s [vector] partitionWith: OK
  7666. 1313.93 s [vector] +++ OK, passed 100 tests.
  7667. 1313.93 s [vector] span: OK
  7668. 1313.93 s [vector] +++ OK, passed 100 tests.
  7669. 1313.93 s [vector] break: OK
  7670. 1313.94 s [vector] +++ OK, passed 100 tests.
  7671. 1313.94 s [vector] spanR: OK
  7672. 1313.94 s [vector] +++ OK, passed 100 tests.
  7673. 1313.94 s [vector] breakR: OK
  7674. 1313.94 s [vector] +++ OK, passed 100 tests.
  7675. 1313.94 s [vector] groupBy: OK
  7676. 1313.94 s [vector] +++ OK, passed 100 tests.
  7677. 1313.94 s [vector] elem: OK
  7678. 1313.94 s [vector] +++ OK, passed 100 tests.
  7679. 1313.94 s [vector] notElem: OK
  7680. 1313.94 s [vector] +++ OK, passed 100 tests.
  7681. 1313.94 s [vector] find: OK
  7682. 1313.94 s [vector] +++ OK, passed 100 tests.
  7683. 1313.94 s [vector] findIndex: OK
  7684. 1313.94 s [vector] +++ OK, passed 100 tests.
  7685. 1313.94 s [vector] findIndexR: OK
  7686. 1313.94 s [vector] +++ OK, passed 100 tests.
  7687. 1313.94 s [vector] findIndices: OK
  7688. 1313.94 s [vector] +++ OK, passed 100 tests.
  7689. 1313.94 s [vector] elemIndex: OK
  7690. 1313.94 s [vector] +++ OK, passed 100 tests.
  7691. 1313.94 s [vector] elemIndices: OK
  7692. 1313.94 s [vector] +++ OK, passed 100 tests.
  7693. 1313.95 s [vector] foldl: OK
  7694. 1313.95 s [vector] +++ OK, passed 100 tests.
  7695. 1313.95 s [vector] foldl1: OK
  7696. 1313.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7697. 1313.96 s [vector] foldl': OK
  7698. 1313.96 s [vector] +++ OK, passed 100 tests.
  7699. 1313.97 s [vector] foldl1': OK
  7700. 1313.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7701. 1313.97 s [vector] foldr: OK
  7702. 1313.97 s [vector] +++ OK, passed 100 tests.
  7703. 1313.97 s [vector] foldr1: OK
  7704. 1313.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7705. 1313.97 s [vector] foldr': OK
  7706. 1313.97 s [vector] +++ OK, passed 100 tests.
  7707. 1313.97 s [vector] foldr1': OK
  7708. 1313.97 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7709. 1313.97 s [vector] ifoldl: OK
  7710. 1313.98 s [vector] +++ OK, passed 100 tests.
  7711. 1313.98 s [vector] ifoldl': OK
  7712. 1313.98 s [vector] +++ OK, passed 100 tests.
  7713. 1313.98 s [vector] ifoldr: OK
  7714. 1313.99 s [vector] +++ OK, passed 100 tests.
  7715. 1313.99 s [vector] ifoldr': OK
  7716. 1313.99 s [vector] +++ OK, passed 100 tests.
  7717. 1313.99 s [vector] ifoldM: OK
  7718. 1314.00 s [vector] +++ OK, passed 100 tests.
  7719. 1314.00 s [vector] ifoldM': OK
  7720. 1314.00 s [vector] +++ OK, passed 100 tests.
  7721. 1314.04 s [vector] ifoldM_: OK (0.03s)
  7722. 1314.04 s [vector] +++ OK, passed 100 tests.
  7723. 1314.05 s [vector] ifoldM'_: OK (0.02s)
  7724. 1314.05 s [vector] +++ OK, passed 100 tests.
  7725. 1314.06 s [vector] all: OK
  7726. 1314.06 s [vector] +++ OK, passed 100 tests.
  7727. 1314.07 s [vector] any: OK
  7728. 1314.07 s [vector] +++ OK, passed 100 tests.
  7729. 1314.07 s [vector] prescanl: OK
  7730. 1314.07 s [vector] +++ OK, passed 100 tests.
  7731. 1314.07 s [vector] prescanl': OK
  7732. 1314.07 s [vector] +++ OK, passed 100 tests.
  7733. 1314.08 s [vector] postscanl: OK
  7734. 1314.08 s [vector] +++ OK, passed 100 tests.
  7735. 1314.08 s [vector] postscanl': OK
  7736. 1314.08 s [vector] +++ OK, passed 100 tests.
  7737. 1314.08 s [vector] scanl: OK
  7738. 1314.08 s [vector] +++ OK, passed 100 tests.
  7739. 1314.09 s [vector] scanl': OK
  7740. 1314.09 s [vector] +++ OK, passed 100 tests.
  7741. 1314.09 s [vector] scanl1: OK
  7742. 1314.09 s [vector] +++ OK, passed 100 tests.
  7743. 1314.09 s [vector] scanl1': OK
  7744. 1314.09 s [vector] +++ OK, passed 100 tests.
  7745. 1314.09 s [vector] iscanl: OK
  7746. 1314.09 s [vector] +++ OK, passed 100 tests.
  7747. 1314.09 s [vector] iscanl': OK
  7748. 1314.09 s [vector] +++ OK, passed 100 tests.
  7749. 1314.09 s [vector] prescanr: OK
  7750. 1314.09 s [vector] +++ OK, passed 100 tests.
  7751. 1314.10 s [vector] prescanr': OK
  7752. 1314.10 s [vector] +++ OK, passed 100 tests.
  7753. 1314.10 s [vector] postscanr: OK
  7754. 1314.10 s [vector] +++ OK, passed 100 tests.
  7755. 1314.10 s [vector] postscanr': OK
  7756. 1314.10 s [vector] +++ OK, passed 100 tests.
  7757. 1314.10 s [vector] scanr: OK
  7758. 1314.10 s [vector] +++ OK, passed 100 tests.
  7759. 1314.10 s [vector] scanr': OK
  7760. 1314.10 s [vector] +++ OK, passed 100 tests.
  7761. 1314.11 s [vector] scanr1: OK
  7762. 1314.11 s [vector] +++ OK, passed 100 tests.
  7763. 1314.11 s [vector] scanr1': OK
  7764. 1314.11 s [vector] +++ OK, passed 100 tests.
  7765. 1314.12 s [vector] iscanr: OK
  7766. 1314.12 s [vector] +++ OK, passed 100 tests.
  7767. 1314.12 s [vector] iscanr': OK
  7768. 1314.12 s [vector] +++ OK, passed 100 tests.
  7769. 1314.12 s [vector] mut_read: OK
  7770. 1314.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7771. 1314.12 s [vector] mut_write: OK
  7772. 1314.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7773. 1314.12 s [vector] mut_modify: OK
  7774. 1314.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7775. 1314.12 s [vector] mut_generate: OK
  7776. 1314.13 s [vector] +++ OK, passed 100 tests.
  7777. 1314.14 s [vector] mut_generateM: OK (0.01s)
  7778. 1314.14 s [vector] +++ OK, passed 100 tests.
  7779. 1314.16 s [vector] mut_mapM_: OK (0.02s)
  7780. 1314.16 s [vector] +++ OK, passed 100 tests.
  7781. 1314.18 s [vector] mut_imapM_: OK (0.02s)
  7782. 1314.18 s [vector] +++ OK, passed 100 tests.
  7783. 1314.20 s [vector] mut_forM_: OK (0.02s)
  7784. 1314.20 s [vector] +++ OK, passed 100 tests.
  7785. 1314.22 s [vector] mut_iforM_: OK (0.03s)
  7786. 1314.22 s [vector] +++ OK, passed 100 tests.
  7787. 1314.22 s [vector] mut_foldr: OK
  7788. 1314.22 s [vector] +++ OK, passed 100 tests.
  7789. 1314.22 s [vector] mut_foldr': OK
  7790. 1314.23 s [vector] +++ OK, passed 100 tests.
  7791. 1314.24 s [vector] mut_foldl: OK
  7792. 1314.24 s [vector] +++ OK, passed 100 tests.
  7793. 1314.24 s [vector] mut_foldl': OK
  7794. 1314.24 s [vector] +++ OK, passed 100 tests.
  7795. 1314.24 s [vector] mut_ifoldr: OK
  7796. 1314.24 s [vector] +++ OK, passed 100 tests.
  7797. 1314.24 s [vector] mut_ifoldr': OK
  7798. 1314.24 s [vector] +++ OK, passed 100 tests.
  7799. 1314.24 s [vector] mut_ifoldl: OK
  7800. 1314.24 s [vector] +++ OK, passed 100 tests.
  7801. 1314.24 s [vector] mut_ifoldl': OK
  7802. 1314.24 s [vector] +++ OK, passed 100 tests.
  7803. 1314.24 s [vector] mut_foldM: OK
  7804. 1314.24 s [vector] +++ OK, passed 100 tests.
  7805. 1314.25 s [vector] mut_foldM': OK
  7806. 1314.25 s [vector] +++ OK, passed 100 tests.
  7807. 1314.25 s [vector] mut_foldrM: OK
  7808. 1314.25 s [vector] +++ OK, passed 100 tests.
  7809. 1314.25 s [vector] mut_foldrM': OK
  7810. 1314.25 s [vector] +++ OK, passed 100 tests.
  7811. 1314.26 s [vector] mut_ifoldM: OK
  7812. 1314.26 s [vector] +++ OK, passed 100 tests.
  7813. 1314.26 s [vector] mut_ifoldM': OK
  7814. 1314.26 s [vector] +++ OK, passed 100 tests.
  7815. 1314.27 s [vector] mut_ifoldrM: OK
  7816. 1314.27 s [vector] +++ OK, passed 100 tests.
  7817. 1314.27 s [vector] mut_ifoldrM': OK
  7818. 1314.27 s [vector] +++ OK, passed 100 tests.
  7819. 1314.27 s [vector] compare: OK
  7820. 1314.27 s [vector] +++ OK, passed 100 tests.
  7821. 1314.27 s [vector] maximum: OK
  7822. 1314.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7823. 1314.27 s [vector] minimum: OK
  7824. 1314.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7825. 1314.27 s [vector] minIndex: OK
  7826. 1314.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7827. 1314.27 s [vector] maxIndex: OK
  7828. 1314.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7829. 1314.27 s [vector] maximumBy: OK
  7830. 1314.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7831. 1314.28 s [vector] minimumBy: OK
  7832. 1314.28 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7833. 1314.28 s [vector] maximumOn: OK
  7834. 1314.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7835. 1314.28 s [vector] minimumOn: OK
  7836. 1314.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7837. 1314.28 s [vector] maxIndexBy: OK
  7838. 1314.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7839. 1314.28 s [vector] minIndexBy: OK
  7840. 1314.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7841. 1314.28 s [vector] ListFirstMaxIndexWins: OK
  7842. 1314.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7843. 1314.28 s [vector] FalseListFirstMaxIndexWins: OK
  7844. 1314.28 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7845. 1314.28 s [vector] []
  7846. 1314.28 s [vector] zip: OK
  7847. 1314.28 s [vector] +++ OK, passed 100 tests.
  7848. 1314.28 s [vector] zip3: OK
  7849. 1314.28 s [vector] +++ OK, passed 100 tests.
  7850. 1314.28 s [vector] unzip: OK
  7851. 1314.28 s [vector] +++ OK, passed 100 tests.
  7852. 1314.29 s [vector] unzip3: OK
  7853. 1314.29 s [vector] +++ OK, passed 100 tests.
  7854. 1314.29 s [vector] indexed: OK
  7855. 1314.29 s [vector] +++ OK, passed 100 tests.
  7856. 1314.29 s [vector] update: OK
  7857. 1314.29 s [vector] +++ OK, passed 100 tests.
  7858. 1314.30 s [vector] concat: OK
  7859. 1314.30 s [vector] +++ OK, passed 100 tests.
  7860. 1314.30 s [vector] mempty: OK
  7861. 1314.30 s [vector] +++ OK, passed 100 tests.
  7862. 1314.31 s [vector] mappend: OK
  7863. 1314.32 s [vector] +++ OK, passed 100 tests.
  7864. 1314.32 s [vector] mconcat: OK (0.01s)
  7865. 1314.32 s [vector] +++ OK, passed 100 tests.
  7866. 1314.32 s [vector] fmap: OK
  7867. 1314.32 s [vector] +++ OK, passed 100 tests.
  7868. 1314.32 s [vector] return: OK
  7869. 1314.32 s [vector] +++ OK, passed 100 tests.
  7870. 1314.34 s [vector] bind: OK (0.02s)
  7871. 1314.34 s [vector] +++ OK, passed 100 tests.
  7872. 1314.34 s [vector] mzip: OK
  7873. 1314.34 s [vector] +++ OK, passed 100 tests.
  7874. 1314.34 s [vector] munzip: OK
  7875. 1314.34 s [vector] +++ OK, passed 100 tests.
  7876. 1314.34 s [vector] applicative_pure: OK
  7877. 1314.34 s [vector] +++ OK, passed 100 tests.
  7878. 1314.39 s [vector] applicative_appl: OK (0.05s)
  7879. 1314.39 s [vector] +++ OK, passed 100 tests.
  7880. 1314.39 s [vector] alternative_empty: OK
  7881. 1314.39 s [vector] +++ OK, passed 100 tests.
  7882. 1314.40 s [vector] alternative_or: OK
  7883. 1314.40 s [vector] +++ OK, passed 100 tests.
  7884. 1314.44 s [vector] sequence: OK (0.04s)
  7885. 1314.44 s [vector] +++ OK, passed 100 tests.
  7886. 1314.45 s [vector] sequence_: OK (0.01s)
  7887. 1314.45 s [vector] +++ OK, passed 100 tests.
  7888. 1314.45 s [vector] glength: OK
  7889. 1314.45 s [vector] +++ OK, passed 100 tests.
  7890. 1314.45 s [vector] sum: OK
  7891. 1314.45 s [vector] +++ OK, passed 100 tests.
  7892. 1314.45 s [vector] product: OK
  7893. 1314.45 s [vector] +++ OK, passed 100 tests.
  7894. 1314.45 s [vector] enumFromN: OK
  7895. 1314.45 s [vector] +++ OK, passed 100 tests.
  7896. 1314.45 s [vector] enumFromThenN: OK
  7897. 1314.45 s [vector] +++ OK, passed 100 tests.
  7898. 1314.45 s [vector] enumFromTo: OK
  7899. 1314.45 s [vector] +++ OK, passed 100 tests.
  7900. 1314.45 s [vector] enumFromThenTo: OK
  7901. 1314.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7902. 1314.45 s [vector] unstream
  7903. 1314.45 s [vector] unstream == vunstream (exact): OK
  7904. 1314.45 s [vector] +++ OK, passed 100 tests.
  7905. 1314.45 s [vector] unstream == vunstream (unknown): OK
  7906. 1314.45 s [vector] +++ OK, passed 100 tests.
  7907. 1314.46 s [vector] unstreamR ~= vunstream (exact): OK
  7908. 1314.46 s [vector] +++ OK, passed 100 tests.
  7909. 1314.46 s [vector] unstreamR ~= vunstream (unknown): OK
  7910. 1314.46 s [vector] +++ OK, passed 100 tests.
  7911. 1314.46 s [vector] Tests.Vector.Unboxed
  7912. 1314.46 s [vector] ()
  7913. 1314.46 s [vector] fromList.toList == id: OK
  7914. 1314.46 s [vector] +++ OK, passed 100 tests.
  7915. 1314.46 s [vector] toList.fromList == id: OK
  7916. 1314.46 s [vector] +++ OK, passed 100 tests.
  7917. 1314.46 s [vector] unstream.stream == id: OK
  7918. 1314.46 s [vector] +++ OK, passed 100 tests.
  7919. 1314.46 s [vector] stream.unstream == id: OK
  7920. 1314.46 s [vector] +++ OK, passed 100 tests.
  7921. 1314.46 s [vector] eq: OK
  7922. 1314.46 s [vector] +++ OK, passed 100 tests.
  7923. 1314.46 s [vector] length: OK
  7924. 1314.46 s [vector] +++ OK, passed 100 tests.
  7925. 1314.46 s [vector] null: OK
  7926. 1314.46 s [vector] +++ OK, passed 100 tests.
  7927. 1314.46 s [vector] index: OK
  7928. 1314.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7929. 1314.46 s [vector] safeIndex: OK
  7930. 1314.46 s [vector] +++ OK, passed 100 tests.
  7931. 1314.46 s [vector] head: OK
  7932. 1314.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7933. 1314.46 s [vector] last: OK
  7934. 1314.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7935. 1314.46 s [vector] unsafeIndex: OK
  7936. 1314.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7937. 1314.46 s [vector] unsafeHead: OK
  7938. 1314.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7939. 1314.46 s [vector] unsafeLast: OK
  7940. 1314.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7941. 1314.46 s [vector] slice: OK
  7942. 1314.46 s [vector] +++ OK, passed 100 tests.
  7943. 1314.46 s [vector] init: OK
  7944. 1314.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7945. 1314.47 s [vector] tail: OK
  7946. 1314.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7947. 1314.47 s [vector] take: OK
  7948. 1314.47 s [vector] +++ OK, passed 100 tests.
  7949. 1314.47 s [vector] drop: OK
  7950. 1314.47 s [vector] +++ OK, passed 100 tests.
  7951. 1314.47 s [vector] splitAt: OK
  7952. 1314.47 s [vector] +++ OK, passed 100 tests.
  7953. 1314.47 s [vector] empty: OK
  7954. 1314.47 s [vector] +++ OK, passed 100 tests.
  7955. 1314.47 s [vector] singleton: OK
  7956. 1314.47 s [vector] +++ OK, passed 100 tests.
  7957. 1314.47 s [vector] replicate: OK
  7958. 1314.47 s [vector] +++ OK, passed 100 tests.
  7959. 1314.47 s [vector] generate: OK
  7960. 1314.47 s [vector] +++ OK, passed 100 tests.
  7961. 1314.47 s [vector] iterateN: OK
  7962. 1314.48 s [vector] +++ OK, passed 100 tests.
  7963. 1314.51 s [vector] iterateNM: OK (0.03s)
  7964. 1314.51 s [vector] +++ OK, passed 100 tests.
  7965. 1314.52 s [vector] generateM: OK (0.01s)
  7966. 1314.52 s [vector] +++ OK, passed 100 tests.
  7967. 1314.53 s [vector] replicateM: OK (0.02s)
  7968. 1314.53 s [vector] +++ OK, passed 100 tests.
  7969. 1314.53 s [vector] create: OK
  7970. 1314.53 s [vector] +++ OK, passed 100 tests.
  7971. 1314.53 s [vector] createT: OK
  7972. 1314.53 s [vector] +++ OK, passed 100 tests.
  7973. 1314.53 s [vector] unfoldr: OK
  7974. 1314.53 s [vector] +++ OK, passed 100 tests.
  7975. 1314.53 s [vector] unfoldrN: OK
  7976. 1314.54 s [vector] +++ OK, passed 100 tests.
  7977. 1314.54 s [vector] unfoldrExactN: OK
  7978. 1314.54 s [vector] +++ OK, passed 100 tests.
  7979. 1314.54 s [vector] unfoldrM: OK
  7980. 1314.54 s [vector] +++ OK, passed 100 tests.
  7981. 1314.54 s [vector] unfoldrNM: OK
  7982. 1314.54 s [vector] +++ OK, passed 100 tests.
  7983. 1314.57 s [vector] unfoldrExactNM: OK (0.01s)
  7984. 1314.57 s [vector] +++ OK, passed 100 tests.
  7985. 1314.57 s [vector] constructN: OK
  7986. 1314.57 s [vector] +++ OK, passed 100 tests.
  7987. 1314.57 s [vector] constructrN: OK
  7988. 1314.57 s [vector] +++ OK, passed 100 tests.
  7989. 1314.57 s [vector] cons: OK
  7990. 1314.57 s [vector] +++ OK, passed 100 tests.
  7991. 1314.57 s [vector] snoc: OK
  7992. 1314.57 s [vector] +++ OK, passed 100 tests.
  7993. 1314.58 s [vector] append: OK
  7994. 1314.58 s [vector] +++ OK, passed 100 tests.
  7995. 1314.59 s [vector] concat: OK (0.01s)
  7996. 1314.59 s [vector] +++ OK, passed 100 tests.
  7997. 1314.59 s [vector] force: OK
  7998. 1314.59 s [vector] +++ OK, passed 100 tests.
  7999. 1314.59 s [vector] upd: OK
  8000. 1314.60 s [vector] +++ OK, passed 100 tests.
  8001. 1314.60 s [vector] accum: OK
  8002. 1314.60 s [vector] +++ OK, passed 100 tests.
  8003. 1314.60 s [vector] reverse: OK
  8004. 1314.60 s [vector] +++ OK, passed 100 tests.
  8005. 1314.60 s [vector] backpermute: OK
  8006. 1314.60 s [vector] +++ OK, passed 100 tests.
  8007. 1314.60 s [vector] map: OK
  8008. 1314.60 s [vector] +++ OK, passed 100 tests.
  8009. 1314.60 s [vector] imap: OK
  8010. 1314.61 s [vector] +++ OK, passed 100 tests.
  8011. 1314.61 s [vector] concatMap: OK
  8012. 1314.61 s [vector] +++ OK, passed 100 tests.
  8013. 1314.62 s [vector] mapM: OK
  8014. 1314.62 s [vector] +++ OK, passed 100 tests.
  8015. 1314.63 s [vector] mapM_: OK (0.02s)
  8016. 1314.63 s [vector] +++ OK, passed 100 tests.
  8017. 1314.64 s [vector] forM: OK
  8018. 1314.64 s [vector] +++ OK, passed 100 tests.
  8019. 1314.65 s [vector] forM_: OK (0.02s)
  8020. 1314.65 s [vector] +++ OK, passed 100 tests.
  8021. 1314.66 s [vector] imapM: OK
  8022. 1314.66 s [vector] +++ OK, passed 100 tests.
  8023. 1314.67 s [vector] imapM_: OK (0.02s)
  8024. 1314.67 s [vector] +++ OK, passed 100 tests.
  8025. 1314.67 s [vector] zipWith: OK
  8026. 1314.67 s [vector] +++ OK, passed 100 tests.
  8027. 1314.67 s [vector] zipWith3: OK
  8028. 1314.67 s [vector] +++ OK, passed 100 tests.
  8029. 1314.67 s [vector] izipWith: OK
  8030. 1314.68 s [vector] +++ OK, passed 100 tests.
  8031. 1314.68 s [vector] izipWith3: OK
  8032. 1314.69 s [vector] +++ OK, passed 100 tests.
  8033. 1314.69 s [vector] izipWithM: OK
  8034. 1314.69 s [vector] +++ OK, passed 100 tests.
  8035. 1314.69 s [vector] izipWithM_: OK (0.01s)
  8036. 1314.69 s [vector] +++ OK, passed 100 tests.
  8037. 1314.70 s [vector] zipWithM: OK
  8038. 1314.70 s [vector] +++ OK, passed 100 tests.
  8039. 1314.70 s [vector] zipWithM_: OK
  8040. 1314.70 s [vector] +++ OK, passed 100 tests.
  8041. 1314.70 s [vector] filter: OK
  8042. 1314.72 s [vector] +++ OK, passed 100 tests.
  8043. 1314.72 s [vector] ifilter: OK
  8044. 1314.72 s [vector] +++ OK, passed 100 tests.
  8045. 1314.74 s [vector] filterM: OK (0.03s)
  8046. 1314.74 s [vector] +++ OK, passed 100 tests.
  8047. 1314.74 s [vector] uniq: OK
  8048. 1314.74 s [vector] +++ OK, passed 100 tests.
  8049. 1314.74 s [vector] mapMaybe: OK
  8050. 1314.74 s [vector] +++ OK, passed 100 tests.
  8051. 1314.74 s [vector] imapMaybe: OK
  8052. 1314.74 s [vector] +++ OK, passed 100 tests.
  8053. 1314.74 s [vector] takeWhile: OK
  8054. 1314.74 s [vector] +++ OK, passed 100 tests.
  8055. 1314.75 s [vector] dropWhile: OK
  8056. 1314.75 s [vector] +++ OK, passed 100 tests.
  8057. 1314.75 s [vector] partition: OK
  8058. 1314.75 s [vector] +++ OK, passed 100 tests.
  8059. 1314.75 s [vector] partitionWith: OK
  8060. 1314.75 s [vector] +++ OK, passed 100 tests.
  8061. 1314.75 s [vector] span: OK
  8062. 1314.75 s [vector] +++ OK, passed 100 tests.
  8063. 1314.75 s [vector] break: OK
  8064. 1314.75 s [vector] +++ OK, passed 100 tests.
  8065. 1314.75 s [vector] spanR: OK
  8066. 1314.75 s [vector] +++ OK, passed 100 tests.
  8067. 1314.75 s [vector] breakR: OK
  8068. 1314.76 s [vector] +++ OK, passed 100 tests.
  8069. 1314.76 s [vector] groupBy: OK
  8070. 1314.76 s [vector] +++ OK, passed 100 tests.
  8071. 1314.76 s [vector] elem: OK
  8072. 1314.76 s [vector] +++ OK, passed 100 tests.
  8073. 1314.76 s [vector] notElem: OK
  8074. 1314.76 s [vector] +++ OK, passed 100 tests.
  8075. 1314.76 s [vector] find: OK
  8076. 1314.76 s [vector] +++ OK, passed 100 tests.
  8077. 1314.76 s [vector] findIndex: OK
  8078. 1314.76 s [vector] +++ OK, passed 100 tests.
  8079. 1314.76 s [vector] findIndexR: OK
  8080. 1314.76 s [vector] +++ OK, passed 100 tests.
  8081. 1314.76 s [vector] findIndices: OK
  8082. 1314.76 s [vector] +++ OK, passed 100 tests.
  8083. 1314.76 s [vector] elemIndex: OK
  8084. 1314.76 s [vector] +++ OK, passed 100 tests.
  8085. 1314.76 s [vector] elemIndices: OK
  8086. 1314.76 s [vector] +++ OK, passed 100 tests.
  8087. 1314.77 s [vector] foldl: OK
  8088. 1314.77 s [vector] +++ OK, passed 100 tests.
  8089. 1314.77 s [vector] foldl1: OK
  8090. 1314.77 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8091. 1314.77 s [vector] foldl': OK
  8092. 1314.77 s [vector] +++ OK, passed 100 tests.
  8093. 1314.77 s [vector] foldl1': OK
  8094. 1314.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8095. 1314.77 s [vector] foldr: OK
  8096. 1314.77 s [vector] +++ OK, passed 100 tests.
  8097. 1314.77 s [vector] foldr1: OK
  8098. 1314.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8099. 1314.77 s [vector] foldr': OK
  8100. 1314.77 s [vector] +++ OK, passed 100 tests.
  8101. 1314.77 s [vector] foldr1': OK
  8102. 1314.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8103. 1314.78 s [vector] ifoldl: OK
  8104. 1314.78 s [vector] +++ OK, passed 100 tests.
  8105. 1314.78 s [vector] ifoldl': OK
  8106. 1314.78 s [vector] +++ OK, passed 100 tests.
  8107. 1314.78 s [vector] ifoldr: OK
  8108. 1314.78 s [vector] +++ OK, passed 100 tests.
  8109. 1314.78 s [vector] ifoldr': OK
  8110. 1314.78 s [vector] +++ OK, passed 100 tests.
  8111. 1314.78 s [vector] ifoldM: OK
  8112. 1314.78 s [vector] +++ OK, passed 100 tests.
  8113. 1314.78 s [vector] ifoldM': OK
  8114. 1314.78 s [vector] +++ OK, passed 100 tests.
  8115. 1314.82 s [vector] ifoldM_: OK
  8116. 1314.82 s [vector] +++ OK, passed 100 tests.
  8117. 1314.83 s [vector] ifoldM'_: OK (0.02s)
  8118. 1314.83 s [vector] +++ OK, passed 100 tests.
  8119. 1314.83 s [vector] all: OK
  8120. 1314.83 s [vector] +++ OK, passed 100 tests.
  8121. 1314.83 s [vector] any: OK
  8122. 1314.83 s [vector] +++ OK, passed 100 tests.
  8123. 1314.83 s [vector] prescanl: OK
  8124. 1314.83 s [vector] +++ OK, passed 100 tests.
  8125. 1314.83 s [vector] prescanl': OK
  8126. 1314.83 s [vector] +++ OK, passed 100 tests.
  8127. 1314.83 s [vector] postscanl: OK
  8128. 1314.83 s [vector] +++ OK, passed 100 tests.
  8129. 1314.83 s [vector] postscanl': OK
  8130. 1314.83 s [vector] +++ OK, passed 100 tests.
  8131. 1314.84 s [vector] scanl: OK
  8132. 1314.84 s [vector] +++ OK, passed 100 tests.
  8133. 1314.84 s [vector] scanl': OK
  8134. 1314.84 s [vector] +++ OK, passed 100 tests.
  8135. 1314.84 s [vector] scanl1: OK
  8136. 1314.84 s [vector] +++ OK, passed 100 tests.
  8137. 1314.84 s [vector] scanl1': OK
  8138. 1314.84 s [vector] +++ OK, passed 100 tests.
  8139. 1314.84 s [vector] iscanl: OK
  8140. 1314.84 s [vector] +++ OK, passed 100 tests.
  8141. 1314.84 s [vector] iscanl': OK
  8142. 1314.84 s [vector] +++ OK, passed 100 tests.
  8143. 1314.84 s [vector] prescanr: OK
  8144. 1314.84 s [vector] +++ OK, passed 100 tests.
  8145. 1314.84 s [vector] prescanr': OK
  8146. 1314.84 s [vector] +++ OK, passed 100 tests.
  8147. 1314.84 s [vector] postscanr: OK
  8148. 1314.84 s [vector] +++ OK, passed 100 tests.
  8149. 1314.85 s [vector] postscanr': OK
  8150. 1314.85 s [vector] +++ OK, passed 100 tests.
  8151. 1314.85 s [vector] scanr: OK
  8152. 1314.85 s [vector] +++ OK, passed 100 tests.
  8153. 1314.85 s [vector] scanr': OK
  8154. 1314.85 s [vector] +++ OK, passed 100 tests.
  8155. 1314.85 s [vector] scanr1: OK
  8156. 1314.85 s [vector] +++ OK, passed 100 tests.
  8157. 1314.85 s [vector] scanr1': OK
  8158. 1314.85 s [vector] +++ OK, passed 100 tests.
  8159. 1314.85 s [vector] iscanr: OK
  8160. 1314.85 s [vector] +++ OK, passed 100 tests.
  8161. 1314.85 s [vector] iscanr': OK
  8162. 1314.85 s [vector] +++ OK, passed 100 tests.
  8163. 1314.85 s [vector] mut_read: OK
  8164. 1314.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8165. 1314.86 s [vector] mut_write: OK
  8166. 1314.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8167. 1314.86 s [vector] mut_modify: OK
  8168. 1314.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8169. 1314.86 s [vector] mut_generate: OK
  8170. 1314.86 s [vector] +++ OK, passed 100 tests.
  8171. 1314.86 s [vector] mut_generateM: OK
  8172. 1314.87 s [vector] +++ OK, passed 100 tests.
  8173. 1314.87 s [vector] mut_mapM_: OK
  8174. 1314.88 s [vector] +++ OK, passed 100 tests.
  8175. 1314.89 s [vector] mut_imapM_: OK (0.01s)
  8176. 1314.90 s [vector] +++ OK, passed 100 tests.
  8177. 1314.90 s [vector] mut_forM_: OK (0.01s)
  8178. 1314.90 s [vector] +++ OK, passed 100 tests.
  8179. 1314.91 s [vector] mut_iforM_: OK (0.01s)
  8180. 1314.91 s [vector] +++ OK, passed 100 tests.
  8181. 1314.91 s [vector] mut_foldr: OK
  8182. 1314.91 s [vector] +++ OK, passed 100 tests.
  8183. 1314.91 s [vector] mut_foldr': OK
  8184. 1314.91 s [vector] +++ OK, passed 100 tests.
  8185. 1314.91 s [vector] mut_foldl: OK
  8186. 1314.91 s [vector] +++ OK, passed 100 tests.
  8187. 1314.91 s [vector] mut_foldl': OK
  8188. 1314.91 s [vector] +++ OK, passed 100 tests.
  8189. 1314.91 s [vector] mut_ifoldr: OK
  8190. 1314.91 s [vector] +++ OK, passed 100 tests.
  8191. 1314.91 s [vector] mut_ifoldr': OK
  8192. 1314.91 s [vector] +++ OK, passed 100 tests.
  8193. 1314.91 s [vector] mut_ifoldl: OK
  8194. 1314.92 s [vector] +++ OK, passed 100 tests.
  8195. 1314.92 s [vector] mut_ifoldl': OK
  8196. 1314.92 s [vector] +++ OK, passed 100 tests.
  8197. 1314.92 s [vector] mut_foldM: OK
  8198. 1314.92 s [vector] +++ OK, passed 100 tests.
  8199. 1314.92 s [vector] mut_foldM': OK
  8200. 1314.92 s [vector] +++ OK, passed 100 tests.
  8201. 1314.92 s [vector] mut_foldrM: OK
  8202. 1314.92 s [vector] +++ OK, passed 100 tests.
  8203. 1314.92 s [vector] mut_foldrM': OK
  8204. 1314.92 s [vector] +++ OK, passed 100 tests.
  8205. 1314.92 s [vector] mut_ifoldM: OK
  8206. 1314.92 s [vector] +++ OK, passed 100 tests.
  8207. 1314.92 s [vector] mut_ifoldM': OK
  8208. 1314.92 s [vector] +++ OK, passed 100 tests.
  8209. 1314.92 s [vector] mut_ifoldrM: OK
  8210. 1314.92 s [vector] +++ OK, passed 100 tests.
  8211. 1314.92 s [vector] mut_ifoldrM': OK
  8212. 1314.92 s [vector] +++ OK, passed 100 tests.
  8213. 1314.92 s [vector] compare: OK
  8214. 1314.92 s [vector] +++ OK, passed 100 tests.
  8215. 1314.92 s [vector] maximum: OK
  8216. 1314.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8217. 1314.92 s [vector] minimum: OK
  8218. 1314.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8219. 1314.92 s [vector] minIndex: OK
  8220. 1314.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8221. 1314.92 s [vector] maxIndex: OK
  8222. 1314.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8223. 1314.92 s [vector] maximumBy: OK
  8224. 1314.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8225. 1314.92 s [vector] minimumBy: OK
  8226. 1314.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8227. 1314.92 s [vector] maximumOn: OK
  8228. 1314.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8229. 1314.93 s [vector] minimumOn: OK
  8230. 1314.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8231. 1314.93 s [vector] maxIndexBy: OK
  8232. 1314.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8233. 1314.94 s [vector] minIndexBy: OK
  8234. 1314.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8235. 1314.94 s [vector] ListFirstMaxIndexWins: OK
  8236. 1314.94 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8237. 1314.94 s [vector] FalseListFirstMaxIndexWins: OK
  8238. 1314.94 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8239. 1314.94 s [vector] []
  8240. 1314.94 s [vector] zip: OK
  8241. 1314.94 s [vector] +++ OK, passed 100 tests.
  8242. 1314.94 s [vector] zip3: OK
  8243. 1314.94 s [vector] +++ OK, passed 100 tests.
  8244. 1314.94 s [vector] unzip: OK
  8245. 1314.94 s [vector] +++ OK, passed 100 tests.
  8246. 1314.94 s [vector] unzip3: OK
  8247. 1314.94 s [vector] +++ OK, passed 100 tests.
  8248. 1314.94 s [vector] indexed: OK
  8249. 1314.94 s [vector] +++ OK, passed 100 tests.
  8250. 1314.94 s [vector] update: OK
  8251. 1314.94 s [vector] +++ OK, passed 100 tests.
  8252. 1314.94 s [vector] mempty: OK
  8253. 1314.94 s [vector] +++ OK, passed 100 tests.
  8254. 1314.94 s [vector] mappend: OK
  8255. 1314.94 s [vector] +++ OK, passed 100 tests.
  8256. 1314.95 s [vector] mconcat: OK
  8257. 1314.95 s [vector] +++ OK, passed 100 tests.
  8258. 1314.95 s [vector] glength: OK
  8259. 1314.95 s [vector] +++ OK, passed 100 tests.
  8260. 1314.95 s [vector] (Bool)
  8261. 1314.95 s [vector] fromList.toList == id: OK
  8262. 1314.95 s [vector] +++ OK, passed 100 tests.
  8263. 1314.95 s [vector] toList.fromList == id: OK
  8264. 1314.95 s [vector] +++ OK, passed 100 tests.
  8265. 1314.95 s [vector] unstream.stream == id: OK
  8266. 1314.95 s [vector] +++ OK, passed 100 tests.
  8267. 1314.95 s [vector] stream.unstream == id: OK
  8268. 1314.95 s [vector] +++ OK, passed 100 tests.
  8269. 1314.95 s [vector] eq: OK
  8270. 1314.95 s [vector] +++ OK, passed 100 tests.
  8271. 1314.95 s [vector] length: OK
  8272. 1314.95 s [vector] +++ OK, passed 100 tests.
  8273. 1314.95 s [vector] null: OK
  8274. 1314.95 s [vector] +++ OK, passed 100 tests.
  8275. 1314.95 s [vector] index: OK
  8276. 1314.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8277. 1314.96 s [vector] safeIndex: OK
  8278. 1314.96 s [vector] +++ OK, passed 100 tests.
  8279. 1314.96 s [vector] head: OK
  8280. 1314.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8281. 1314.96 s [vector] last: OK
  8282. 1314.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8283. 1314.96 s [vector] unsafeIndex: OK
  8284. 1314.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8285. 1314.96 s [vector] unsafeHead: OK
  8286. 1314.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8287. 1314.96 s [vector] unsafeLast: OK
  8288. 1314.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8289. 1314.96 s [vector] slice: OK
  8290. 1314.96 s [vector] +++ OK, passed 100 tests.
  8291. 1314.96 s [vector] init: OK
  8292. 1314.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8293. 1314.96 s [vector] tail: OK
  8294. 1314.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8295. 1314.96 s [vector] take: OK
  8296. 1314.96 s [vector] +++ OK, passed 100 tests.
  8297. 1314.96 s [vector] drop: OK
  8298. 1314.96 s [vector] +++ OK, passed 100 tests.
  8299. 1314.96 s [vector] splitAt: OK
  8300. 1314.96 s [vector] +++ OK, passed 100 tests.
  8301. 1314.96 s [vector] empty: OK
  8302. 1314.96 s [vector] +++ OK, passed 100 tests.
  8303. 1314.96 s [vector] singleton: OK
  8304. 1314.96 s [vector] +++ OK, passed 100 tests.
  8305. 1314.96 s [vector] replicate: OK
  8306. 1314.96 s [vector] +++ OK, passed 100 tests.
  8307. 1314.96 s [vector] generate: OK
  8308. 1314.98 s [vector] +++ OK, passed 100 tests.
  8309. 1314.98 s [vector] iterateN: OK
  8310. 1315.29 s [vector] +++ OK, passed 100 tests.
  8311. 1315.29 s [vector] iterateNM: OK (0.05s)
  8312. 1315.29 s [vector] +++ OK, passed 100 tests.
  8313. 1315.29 s [vector] generateM: OK (0.02s)
  8314. 1315.29 s [vector] +++ OK, passed 100 tests.
  8315. 1315.29 s [vector] replicateM: OK
  8316. 1315.29 s [vector] +++ OK, passed 100 tests.
  8317. 1315.29 s [vector] create: OK
  8318. 1315.29 s [vector] +++ OK, passed 100 tests.
  8319. 1315.29 s [vector] createT: OK
  8320. 1315.29 s [vector] +++ OK, passed 100 tests.
  8321. 1315.29 s [vector] unfoldr: OK
  8322. 1315.29 s [vector] +++ OK, passed 100 tests.
  8323. 1315.29 s [vector] unfoldrN: OK
  8324. 1315.29 s [vector] +++ OK, passed 100 tests.
  8325. 1315.29 s [vector] unfoldrExactN: OK
  8326. 1315.29 s [vector] +++ OK, passed 100 tests.
  8327. 1315.29 s [vector] unfoldrM: OK
  8328. 1315.29 s [vector] +++ OK, passed 100 tests.
  8329. 1315.29 s [vector] unfoldrNM: OK
  8330. 1315.29 s [vector] +++ OK, passed 100 tests.
  8331. 1315.29 s [vector] unfoldrExactNM: OK (0.04s)
  8332. 1315.29 s [vector] +++ OK, passed 100 tests.
  8333. 1315.29 s [vector] constructN: OK
  8334. 1315.29 s [vector] +++ OK, passed 100 tests.
  8335. 1315.29 s [vector] constructrN: OK
  8336. 1315.29 s [vector] +++ OK, passed 100 tests.
  8337. 1315.29 s [vector] cons: OK
  8338. 1315.29 s [vector] +++ OK, passed 100 tests.
  8339. 1315.29 s [vector] snoc: OK
  8340. 1315.29 s [vector] +++ OK, passed 100 tests.
  8341. 1315.29 s [vector] append: OK
  8342. 1315.29 s [vector] +++ OK, passed 100 tests.
  8343. 1315.29 s [vector] concat: OK (0.01s)
  8344. 1315.29 s [vector] +++ OK, passed 100 tests.
  8345. 1315.29 s [vector] force: OK
  8346. 1315.29 s [vector] +++ OK, passed 100 tests.
  8347. 1315.29 s [vector] upd: OK
  8348. 1315.29 s [vector] +++ OK, passed 100 tests.
  8349. 1315.29 s [vector] accum: OK
  8350. 1315.29 s [vector] +++ OK, passed 100 tests.
  8351. 1315.29 s [vector] reverse: OK
  8352. 1315.29 s [vector] +++ OK, passed 100 tests.
  8353. 1315.29 s [vector] backpermute: OK
  8354. 1315.29 s [vector] +++ OK, passed 100 tests.
  8355. 1315.29 s [vector] map: OK
  8356. 1315.29 s [vector] +++ OK, passed 100 tests.
  8357. 1315.29 s [vector] imap: OK
  8358. 1315.29 s [vector] +++ OK, passed 100 tests.
  8359. 1315.29 s [vector] concatMap: OK
  8360. 1315.29 s [vector] +++ OK, passed 100 tests.
  8361. 1315.29 s [vector] mapM: OK
  8362. 1315.29 s [vector] +++ OK, passed 100 tests.
  8363. 1315.29 s [vector] mapM_: OK (0.01s)
  8364. 1315.29 s [vector] +++ OK, passed 100 tests.
  8365. 1315.29 s [vector] forM: OK
  8366. 1315.29 s [vector] +++ OK, passed 100 tests.
  8367. 1315.29 s [vector] forM_: OK (0.01s)
  8368. 1315.29 s [vector] +++ OK, passed 100 tests.
  8369. 1315.29 s [vector] imapM: OK
  8370. 1315.29 s [vector] +++ OK, passed 100 tests.
  8371. 1315.29 s [vector] imapM_: OK (0.02s)
  8372. 1315.29 s [vector] +++ OK, passed 100 tests.
  8373. 1315.29 s [vector] zipWith: OK
  8374. 1315.29 s [vector] +++ OK, passed 100 tests.
  8375. 1315.29 s [vector] zipWith3: OK
  8376. 1315.29 s [vector] +++ OK, passed 100 tests.
  8377. 1315.29 s [vector] izipWith: OK
  8378. 1315.29 s [vector] +++ OK, passed 100 tests.
  8379. 1315.29 s [vector] izipWith3: OK
  8380. 1315.29 s [vector] +++ OK, passed 100 tests.
  8381. 1315.29 s [vector] izipWithM: OK
  8382. 1315.29 s [vector] +++ OK, passed 100 tests.
  8383. 1315.29 s [vector] izipWithM_: OK (0.01s)
  8384. 1315.29 s [vector] +++ OK, passed 100 tests.
  8385. 1315.29 s [vector] zipWithM: OK
  8386. 1315.29 s [vector] +++ OK, passed 100 tests.
  8387. 1315.29 s [vector] zipWithM_: OK (0.01s)
  8388. 1315.29 s [vector] +++ OK, passed 100 tests.
  8389. 1315.30 s [vector] filter: OK
  8390. 1315.30 s [vector] +++ OK, passed 100 tests.
  8391. 1315.30 s [vector] ifilter: OK
  8392. 1315.30 s [vector] +++ OK, passed 100 tests.
  8393. 1315.30 s [vector] filterM: OK
  8394. 1315.30 s [vector] +++ OK, passed 100 tests.
  8395. 1315.30 s [vector] uniq: OK
  8396. 1315.30 s [vector] +++ OK, passed 100 tests.
  8397. 1315.30 s [vector] mapMaybe: OK
  8398. 1315.30 s [vector] +++ OK, passed 100 tests.
  8399. 1315.30 s [vector] imapMaybe: OK
  8400. 1315.30 s [vector] +++ OK, passed 100 tests.
  8401. 1315.30 s [vector] takeWhile: OK
  8402. 1315.30 s [vector] +++ OK, passed 100 tests.
  8403. 1315.30 s [vector] dropWhile: OK
  8404. 1315.30 s [vector] +++ OK, passed 100 tests.
  8405. 1315.30 s [vector] partition: OK
  8406. 1315.30 s [vector] +++ OK, passed 100 tests.
  8407. 1315.30 s [vector] partitionWith: OK
  8408. 1315.30 s [vector] +++ OK, passed 100 tests.
  8409. 1315.30 s [vector] span: OK
  8410. 1315.30 s [vector] +++ OK, passed 100 tests.
  8411. 1315.30 s [vector] break: OK
  8412. 1315.30 s [vector] +++ OK, passed 100 tests.
  8413. 1315.30 s [vector] spanR: OK
  8414. 1315.30 s [vector] +++ OK, passed 100 tests.
  8415. 1315.30 s [vector] breakR: OK
  8416. 1315.30 s [vector] +++ OK, passed 100 tests.
  8417. 1315.30 s [vector] groupBy: OK
  8418. 1315.30 s [vector] +++ OK, passed 100 tests.
  8419. 1315.30 s [vector] elem: OK
  8420. 1315.30 s [vector] +++ OK, passed 100 tests.
  8421. 1315.30 s [vector] notElem: OK
  8422. 1315.30 s [vector] +++ OK, passed 100 tests.
  8423. 1315.30 s [vector] find: OK
  8424. 1315.30 s [vector] +++ OK, passed 100 tests.
  8425. 1315.30 s [vector] findIndex: OK
  8426. 1315.30 s [vector] +++ OK, passed 100 tests.
  8427. 1315.30 s [vector] findIndexR: OK
  8428. 1315.30 s [vector] +++ OK, passed 100 tests.
  8429. 1315.30 s [vector] findIndices: OK
  8430. 1315.30 s [vector] +++ OK, passed 100 tests.
  8431. 1315.30 s [vector] elemIndex: OK
  8432. 1315.30 s [vector] +++ OK, passed 100 tests.
  8433. 1315.30 s [vector] elemIndices: OK
  8434. 1315.30 s [vector] +++ OK, passed 100 tests.
  8435. 1315.30 s [vector] foldl: OK
  8436. 1315.30 s [vector] +++ OK, passed 100 tests.
  8437. 1315.30 s [vector] foldl1: OK
  8438. 1315.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8439. 1315.30 s [vector] foldl': OK
  8440. 1315.30 s [vector] +++ OK, passed 100 tests.
  8441. 1315.30 s [vector] foldl1': OK
  8442. 1315.30 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8443. 1315.30 s [vector] foldr: OK
  8444. 1315.30 s [vector] +++ OK, passed 100 tests.
  8445. 1315.31 s [vector] foldr1: OK
  8446. 1315.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8447. 1315.31 s [vector] foldr': OK
  8448. 1315.31 s [vector] +++ OK, passed 100 tests.
  8449. 1315.31 s [vector] foldr1': OK
  8450. 1315.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8451. 1315.32 s [vector] ifoldl: OK
  8452. 1315.32 s [vector] +++ OK, passed 100 tests.
  8453. 1315.33 s [vector] ifoldl': OK
  8454. 1315.33 s [vector] +++ OK, passed 100 tests.
  8455. 1315.33 s [vector] ifoldr: OK
  8456. 1315.33 s [vector] +++ OK, passed 100 tests.
  8457. 1315.33 s [vector] ifoldr': OK
  8458. 1315.34 s [vector] +++ OK, passed 100 tests.
  8459. 1315.34 s [vector] ifoldM: OK
  8460. 1315.34 s [vector] +++ OK, passed 100 tests.
  8461. 1315.34 s [vector] ifoldM': OK
  8462. 1315.34 s [vector] +++ OK, passed 100 tests.
  8463. 1315.38 s [vector] ifoldM_: OK (0.02s)
  8464. 1315.38 s [vector] +++ OK, passed 100 tests.
  8465. 1315.38 s [vector] ifoldM'_: OK (0.02s)
  8466. 1315.38 s [vector] +++ OK, passed 100 tests.
  8467. 1315.38 s [vector] all: OK
  8468. 1315.38 s [vector] +++ OK, passed 100 tests.
  8469. 1315.38 s [vector] any: OK
  8470. 1315.38 s [vector] +++ OK, passed 100 tests.
  8471. 1315.38 s [vector] prescanl: OK
  8472. 1315.38 s [vector] +++ OK, passed 100 tests.
  8473. 1315.39 s [vector] prescanl': OK
  8474. 1315.39 s [vector] +++ OK, passed 100 tests.
  8475. 1315.39 s [vector] postscanl: OK
  8476. 1315.39 s [vector] +++ OK, passed 100 tests.
  8477. 1315.39 s [vector] postscanl': OK
  8478. 1315.39 s [vector] +++ OK, passed 100 tests.
  8479. 1315.39 s [vector] scanl: OK
  8480. 1315.39 s [vector] +++ OK, passed 100 tests.
  8481. 1315.39 s [vector] scanl': OK
  8482. 1315.39 s [vector] +++ OK, passed 100 tests.
  8483. 1315.40 s [vector] scanl1: OK
  8484. 1315.40 s [vector] +++ OK, passed 100 tests.
  8485. 1315.40 s [vector] scanl1': OK
  8486. 1315.40 s [vector] +++ OK, passed 100 tests.
  8487. 1315.40 s [vector] iscanl: OK
  8488. 1315.40 s [vector] +++ OK, passed 100 tests.
  8489. 1315.40 s [vector] iscanl': OK
  8490. 1315.40 s [vector] +++ OK, passed 100 tests.
  8491. 1315.40 s [vector] prescanr: OK
  8492. 1315.40 s [vector] +++ OK, passed 100 tests.
  8493. 1315.41 s [vector] prescanr': OK
  8494. 1315.41 s [vector] +++ OK, passed 100 tests.
  8495. 1315.41 s [vector] postscanr: OK
  8496. 1315.41 s [vector] +++ OK, passed 100 tests.
  8497. 1315.41 s [vector] postscanr': OK
  8498. 1315.42 s [vector] +++ OK, passed 100 tests.
  8499. 1315.42 s [vector] scanr: OK
  8500. 1315.42 s [vector] +++ OK, passed 100 tests.
  8501. 1315.42 s [vector] scanr': OK
  8502. 1315.42 s [vector] +++ OK, passed 100 tests.
  8503. 1315.42 s [vector] scanr1: OK
  8504. 1315.42 s [vector] +++ OK, passed 100 tests.
  8505. 1315.42 s [vector] scanr1': OK
  8506. 1315.42 s [vector] +++ OK, passed 100 tests.
  8507. 1315.42 s [vector] iscanr: OK
  8508. 1315.43 s [vector] +++ OK, passed 100 tests.
  8509. 1315.43 s [vector] iscanr': OK
  8510. 1315.43 s [vector] +++ OK, passed 100 tests.
  8511. 1315.43 s [vector] mut_read: OK
  8512. 1315.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8513. 1315.43 s [vector] mut_write: OK
  8514. 1315.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8515. 1315.43 s [vector] mut_modify: OK
  8516. 1315.44 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8517. 1315.44 s [vector] mut_generate: OK
  8518. 1315.44 s [vector] +++ OK, passed 100 tests.
  8519. 1315.44 s [vector] mut_generateM: OK (0.01s)
  8520. 1315.44 s [vector] +++ OK, passed 100 tests.
  8521. 1315.46 s [vector] mut_mapM_: OK
  8522. 1315.46 s [vector] +++ OK, passed 100 tests.
  8523. 1315.48 s [vector] mut_imapM_: OK (0.02s)
  8524. 1315.48 s [vector] +++ OK, passed 100 tests.
  8525. 1315.50 s [vector] mut_forM_: OK (0.01s)
  8526. 1315.50 s [vector] +++ OK, passed 100 tests.
  8527. 1315.51 s [vector] mut_iforM_: OK (0.02s)
  8528. 1315.51 s [vector] +++ OK, passed 100 tests.
  8529. 1315.51 s [vector] mut_foldr: OK
  8530. 1315.51 s [vector] +++ OK, passed 100 tests.
  8531. 1315.52 s [vector] mut_foldr': OK
  8532. 1315.52 s [vector] +++ OK, passed 100 tests.
  8533. 1315.52 s [vector] mut_foldl: OK
  8534. 1315.52 s [vector] +++ OK, passed 100 tests.
  8535. 1315.52 s [vector] mut_foldl': OK
  8536. 1315.52 s [vector] +++ OK, passed 100 tests.
  8537. 1315.52 s [vector] mut_ifoldr: OK
  8538. 1315.52 s [vector] +++ OK, passed 100 tests.
  8539. 1315.52 s [vector] mut_ifoldr': OK
  8540. 1315.53 s [vector] +++ OK, passed 100 tests.
  8541. 1315.53 s [vector] mut_ifoldl: OK
  8542. 1315.53 s [vector] +++ OK, passed 100 tests.
  8543. 1315.53 s [vector] mut_ifoldl': OK
  8544. 1315.53 s [vector] +++ OK, passed 100 tests.
  8545. 1315.53 s [vector] mut_foldM: OK
  8546. 1315.54 s [vector] +++ OK, passed 100 tests.
  8547. 1315.54 s [vector] mut_foldM': OK
  8548. 1315.54 s [vector] +++ OK, passed 100 tests.
  8549. 1315.54 s [vector] mut_foldrM: OK
  8550. 1315.54 s [vector] +++ OK, passed 100 tests.
  8551. 1315.54 s [vector] mut_foldrM': OK
  8552. 1315.55 s [vector] +++ OK, passed 100 tests.
  8553. 1315.55 s [vector] mut_ifoldM: OK
  8554. 1315.55 s [vector] +++ OK, passed 100 tests.
  8555. 1315.55 s [vector] mut_ifoldM': OK
  8556. 1315.55 s [vector] +++ OK, passed 100 tests.
  8557. 1315.55 s [vector] mut_ifoldrM: OK
  8558. 1315.55 s [vector] +++ OK, passed 100 tests.
  8559. 1315.56 s [vector] mut_ifoldrM': OK
  8560. 1315.56 s [vector] +++ OK, passed 100 tests.
  8561. 1315.56 s [vector] compare: OK
  8562. 1315.56 s [vector] +++ OK, passed 100 tests.
  8563. 1315.56 s [vector] maximum: OK
  8564. 1315.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8565. 1315.56 s [vector] minimum: OK
  8566. 1315.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8567. 1315.56 s [vector] minIndex: OK
  8568. 1315.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8569. 1315.56 s [vector] maxIndex: OK
  8570. 1315.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8571. 1315.56 s [vector] maximumBy: OK
  8572. 1315.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8573. 1315.56 s [vector] minimumBy: OK
  8574. 1315.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8575. 1315.56 s [vector] maximumOn: OK
  8576. 1315.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8577. 1315.56 s [vector] minimumOn: OK
  8578. 1315.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8579. 1315.56 s [vector] maxIndexBy: OK
  8580. 1315.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8581. 1315.56 s [vector] minIndexBy: OK
  8582. 1315.56 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8583. 1315.56 s [vector] ListFirstMaxIndexWins: OK
  8584. 1315.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8585. 1315.57 s [vector] FalseListFirstMaxIndexWins: OK
  8586. 1315.57 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8587. 1315.57 s [vector] []
  8588. 1315.57 s [vector] zip: OK
  8589. 1315.57 s [vector] +++ OK, passed 100 tests.
  8590. 1315.57 s [vector] zip3: OK
  8591. 1315.57 s [vector] +++ OK, passed 100 tests.
  8592. 1315.57 s [vector] unzip: OK
  8593. 1315.57 s [vector] +++ OK, passed 100 tests.
  8594. 1315.57 s [vector] unzip3: OK
  8595. 1315.57 s [vector] +++ OK, passed 100 tests.
  8596. 1315.57 s [vector] indexed: OK
  8597. 1315.57 s [vector] +++ OK, passed 100 tests.
  8598. 1315.57 s [vector] update: OK
  8599. 1315.57 s [vector] +++ OK, passed 100 tests.
  8600. 1315.57 s [vector] mempty: OK
  8601. 1315.57 s [vector] +++ OK, passed 100 tests.
  8602. 1315.58 s [vector] mappend: OK
  8603. 1315.58 s [vector] +++ OK, passed 100 tests.
  8604. 1315.60 s [vector] mconcat: OK (0.02s)
  8605. 1315.60 s [vector] +++ OK, passed 100 tests.
  8606. 1315.60 s [vector] glength: OK
  8607. 1315.60 s [vector] +++ OK, passed 100 tests.
  8608. 1315.60 s [vector] and: OK
  8609. 1315.60 s [vector] +++ OK, passed 100 tests.
  8610. 1315.60 s [vector] or: OK
  8611. 1315.60 s [vector] +++ OK, passed 100 tests.
  8612. 1315.60 s [vector] (Int)
  8613. 1315.60 s [vector] fromList.toList == id: OK
  8614. 1315.60 s [vector] +++ OK, passed 100 tests.
  8615. 1315.60 s [vector] toList.fromList == id: OK
  8616. 1315.60 s [vector] +++ OK, passed 100 tests.
  8617. 1315.60 s [vector] unstream.stream == id: OK
  8618. 1315.60 s [vector] +++ OK, passed 100 tests.
  8619. 1315.60 s [vector] stream.unstream == id: OK
  8620. 1315.60 s [vector] +++ OK, passed 100 tests.
  8621. 1315.60 s [vector] eq: OK
  8622. 1315.60 s [vector] +++ OK, passed 100 tests.
  8623. 1315.60 s [vector] length: OK
  8624. 1315.60 s [vector] +++ OK, passed 100 tests.
  8625. 1315.60 s [vector] null: OK
  8626. 1315.60 s [vector] +++ OK, passed 100 tests.
  8627. 1315.60 s [vector] index: OK
  8628. 1315.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8629. 1315.61 s [vector] safeIndex: OK
  8630. 1315.61 s [vector] +++ OK, passed 100 tests.
  8631. 1315.61 s [vector] head: OK
  8632. 1315.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8633. 1315.61 s [vector] last: OK
  8634. 1315.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8635. 1315.61 s [vector] unsafeIndex: OK
  8636. 1315.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8637. 1315.61 s [vector] unsafeHead: OK
  8638. 1315.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8639. 1315.61 s [vector] unsafeLast: OK
  8640. 1315.61 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8641. 1315.61 s [vector] slice: OK
  8642. 1315.61 s [vector] +++ OK, passed 100 tests.
  8643. 1315.61 s [vector] init: OK
  8644. 1315.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8645. 1315.61 s [vector] tail: OK
  8646. 1315.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8647. 1315.61 s [vector] take: OK
  8648. 1315.61 s [vector] +++ OK, passed 100 tests.
  8649. 1315.61 s [vector] drop: OK
  8650. 1315.61 s [vector] +++ OK, passed 100 tests.
  8651. 1315.61 s [vector] splitAt: OK
  8652. 1315.61 s [vector] +++ OK, passed 100 tests.
  8653. 1315.61 s [vector] empty: OK
  8654. 1315.61 s [vector] +++ OK, passed 100 tests.
  8655. 1315.61 s [vector] singleton: OK
  8656. 1315.61 s [vector] +++ OK, passed 100 tests.
  8657. 1315.61 s [vector] replicate: OK
  8658. 1315.61 s [vector] +++ OK, passed 100 tests.
  8659. 1315.61 s [vector] generate: OK
  8660. 1315.61 s [vector] +++ OK, passed 100 tests.
  8661. 1315.62 s [vector] iterateN: OK
  8662. 1315.62 s [vector] +++ OK, passed 100 tests.
  8663. 1315.66 s [vector] iterateNM: OK (0.04s)
  8664. 1315.66 s [vector] +++ OK, passed 100 tests.
  8665. 1315.68 s [vector] generateM: OK (0.01s)
  8666. 1315.68 s [vector] +++ OK, passed 100 tests.
  8667. 1315.68 s [vector] replicateM: OK (0.02s)
  8668. 1315.68 s [vector] +++ OK, passed 100 tests.
  8669. 1315.68 s [vector] create: OK
  8670. 1315.68 s [vector] +++ OK, passed 100 tests.
  8671. 1315.68 s [vector] createT: OK
  8672. 1315.68 s [vector] +++ OK, passed 100 tests.
  8673. 1315.69 s [vector] unfoldr: OK
  8674. 1315.69 s [vector] +++ OK, passed 100 tests.
  8675. 1315.69 s [vector] unfoldrN: OK
  8676. 1315.70 s [vector] +++ OK, passed 100 tests.
  8677. 1315.70 s [vector] unfoldrExactN: OK
  8678. 1315.70 s [vector] +++ OK, passed 100 tests.
  8679. 1315.70 s [vector] unfoldrM: OK
  8680. 1315.70 s [vector] +++ OK, passed 100 tests.
  8681. 1315.70 s [vector] unfoldrNM: OK
  8682. 1315.70 s [vector] +++ OK, passed 100 tests.
  8683. 1315.74 s [vector] unfoldrExactNM: OK (0.04s)
  8684. 1315.74 s [vector] +++ OK, passed 100 tests.
  8685. 1315.74 s [vector] constructN: OK
  8686. 1315.74 s [vector] +++ OK, passed 100 tests.
  8687. 1315.75 s [vector] constructrN: OK
  8688. 1315.75 s [vector] +++ OK, passed 100 tests.
  8689. 1315.75 s [vector] cons: OK
  8690. 1315.75 s [vector] +++ OK, passed 100 tests.
  8691. 1315.75 s [vector] snoc: OK
  8692. 1315.75 s [vector] +++ OK, passed 100 tests.
  8693. 1315.76 s [vector] append: OK
  8694. 1315.76 s [vector] +++ OK, passed 100 tests.
  8695. 1315.77 s [vector] concat: OK (0.02s)
  8696. 1315.78 s [vector] +++ OK, passed 100 tests.
  8697. 1315.78 s [vector] force: OK
  8698. 1315.78 s [vector] +++ OK, passed 100 tests.
  8699. 1315.78 s [vector] upd: OK (0.01s)
  8700. 1315.78 s [vector] +++ OK, passed 100 tests.
  8701. 1315.78 s [vector] accum: OK
  8702. 1315.79 s [vector] +++ OK, passed 100 tests.
  8703. 1315.79 s [vector] reverse: OK
  8704. 1315.79 s [vector] +++ OK, passed 100 tests.
  8705. 1315.79 s [vector] backpermute: OK
  8706. 1315.79 s [vector] +++ OK, passed 100 tests.
  8707. 1315.80 s [vector] map: OK
  8708. 1315.80 s [vector] +++ OK, passed 100 tests.
  8709. 1315.80 s [vector] imap: OK
  8710. 1315.80 s [vector] +++ OK, passed 100 tests.
  8711. 1315.80 s [vector] concatMap: OK
  8712. 1315.80 s [vector] +++ OK, passed 100 tests.
  8713. 1315.80 s [vector] mapM: OK
  8714. 1315.80 s [vector] +++ OK, passed 100 tests.
  8715. 1315.82 s [vector] mapM_: OK (0.02s)
  8716. 1315.82 s [vector] +++ OK, passed 100 tests.
  8717. 1315.83 s [vector] forM: OK
  8718. 1315.84 s [vector] +++ OK, passed 100 tests.
  8719. 1315.84 s [vector] forM_: OK (0.02s)
  8720. 1315.84 s [vector] +++ OK, passed 100 tests.
  8721. 1315.86 s [vector] imapM: OK
  8722. 1315.86 s [vector] +++ OK, passed 100 tests.
  8723. 1315.86 s [vector] imapM_: OK (0.02s)
  8724. 1315.86 s [vector] +++ OK, passed 100 tests.
  8725. 1315.86 s [vector] zipWith: OK
  8726. 1315.86 s [vector] +++ OK, passed 100 tests.
  8727. 1315.86 s [vector] zipWith3: OK
  8728. 1315.86 s [vector] +++ OK, passed 100 tests.
  8729. 1315.87 s [vector] izipWith: OK
  8730. 1315.87 s [vector] +++ OK, passed 100 tests.
  8731. 1315.87 s [vector] izipWith3: OK
  8732. 1315.87 s [vector] +++ OK, passed 100 tests.
  8733. 1315.88 s [vector] izipWithM: OK
  8734. 1315.88 s [vector] +++ OK, passed 100 tests.
  8735. 1315.89 s [vector] izipWithM_: OK (0.02s)
  8736. 1315.90 s [vector] +++ OK, passed 100 tests.
  8737. 1315.90 s [vector] zipWithM: OK
  8738. 1315.90 s [vector] +++ OK, passed 100 tests.
  8739. 1315.91 s [vector] zipWithM_: OK (0.02s)
  8740. 1315.91 s [vector] +++ OK, passed 100 tests.
  8741. 1315.92 s [vector] filter: OK
  8742. 1315.92 s [vector] +++ OK, passed 100 tests.
  8743. 1315.92 s [vector] ifilter: OK
  8744. 1315.92 s [vector] +++ OK, passed 100 tests.
  8745. 1315.94 s [vector] filterM: OK (0.03s)
  8746. 1315.94 s [vector] +++ OK, passed 100 tests.
  8747. 1315.95 s [vector] uniq: OK
  8748. 1315.95 s [vector] +++ OK, passed 100 tests.
  8749. 1315.95 s [vector] mapMaybe: OK
  8750. 1315.95 s [vector] +++ OK, passed 100 tests.
  8751. 1315.95 s [vector] imapMaybe: OK
  8752. 1315.95 s [vector] +++ OK, passed 100 tests.
  8753. 1315.95 s [vector] takeWhile: OK
  8754. 1315.95 s [vector] +++ OK, passed 100 tests.
  8755. 1315.95 s [vector] dropWhile: OK
  8756. 1315.95 s [vector] +++ OK, passed 100 tests.
  8757. 1315.95 s [vector] partition: OK
  8758. 1315.95 s [vector] +++ OK, passed 100 tests.
  8759. 1315.95 s [vector] partitionWith: OK
  8760. 1315.95 s [vector] +++ OK, passed 100 tests.
  8761. 1315.95 s [vector] span: OK
  8762. 1315.95 s [vector] +++ OK, passed 100 tests.
  8763. 1315.95 s [vector] break: OK
  8764. 1315.95 s [vector] +++ OK, passed 100 tests.
  8765. 1315.95 s [vector] spanR: OK
  8766. 1315.95 s [vector] +++ OK, passed 100 tests.
  8767. 1315.95 s [vector] breakR: OK
  8768. 1315.95 s [vector] +++ OK, passed 100 tests.
  8769. 1315.96 s [vector] groupBy: OK
  8770. 1315.96 s [vector] +++ OK, passed 100 tests.
  8771. 1315.96 s [vector] elem: OK
  8772. 1315.96 s [vector] +++ OK, passed 100 tests.
  8773. 1315.96 s [vector] notElem: OK
  8774. 1315.96 s [vector] +++ OK, passed 100 tests.
  8775. 1315.96 s [vector] find: OK
  8776. 1315.96 s [vector] +++ OK, passed 100 tests.
  8777. 1315.96 s [vector] findIndex: OK
  8778. 1315.96 s [vector] +++ OK, passed 100 tests.
  8779. 1315.96 s [vector] findIndexR: OK
  8780. 1315.96 s [vector] +++ OK, passed 100 tests.
  8781. 1315.96 s [vector] findIndices: OK
  8782. 1315.96 s [vector] +++ OK, passed 100 tests.
  8783. 1315.96 s [vector] elemIndex: OK
  8784. 1315.96 s [vector] +++ OK, passed 100 tests.
  8785. 1315.97 s [vector] elemIndices: OK
  8786. 1315.97 s [vector] +++ OK, passed 100 tests.
  8787. 1315.97 s [vector] foldl: OK
  8788. 1315.98 s [vector] +++ OK, passed 100 tests.
  8789. 1315.98 s [vector] foldl1: OK
  8790. 1315.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8791. 1315.98 s [vector] foldl': OK
  8792. 1315.98 s [vector] +++ OK, passed 100 tests.
  8793. 1315.98 s [vector] foldl1': OK
  8794. 1315.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8795. 1315.98 s [vector] foldr: OK
  8796. 1315.98 s [vector] +++ OK, passed 100 tests.
  8797. 1315.98 s [vector] foldr1: OK
  8798. 1315.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8799. 1315.98 s [vector] foldr': OK
  8800. 1315.99 s [vector] +++ OK, passed 100 tests.
  8801. 1315.99 s [vector] foldr1': OK
  8802. 1315.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8803. 1315.99 s [vector] ifoldl: OK
  8804. 1315.99 s [vector] +++ OK, passed 100 tests.
  8805. 1315.99 s [vector] ifoldl': OK
  8806. 1316.00 s [vector] +++ OK, passed 100 tests.
  8807. 1316.00 s [vector] ifoldr: OK
  8808. 1316.00 s [vector] +++ OK, passed 100 tests.
  8809. 1316.00 s [vector] ifoldr': OK
  8810. 1316.00 s [vector] +++ OK, passed 100 tests.
  8811. 1316.00 s [vector] ifoldM: OK
  8812. 1316.00 s [vector] +++ OK, passed 100 tests.
  8813. 1316.01 s [vector] ifoldM': OK
  8814. 1316.01 s [vector] +++ OK, passed 100 tests.
  8815. 1316.04 s [vector] ifoldM_: OK (0.02s)
  8816. 1316.04 s [vector] +++ OK, passed 100 tests.
  8817. 1316.05 s [vector] ifoldM'_: OK (0.02s)
  8818. 1316.05 s [vector] +++ OK, passed 100 tests.
  8819. 1316.06 s [vector] all: OK
  8820. 1316.06 s [vector] +++ OK, passed 100 tests.
  8821. 1316.06 s [vector] any: OK
  8822. 1316.06 s [vector] +++ OK, passed 100 tests.
  8823. 1316.06 s [vector] prescanl: OK
  8824. 1316.06 s [vector] +++ OK, passed 100 tests.
  8825. 1316.06 s [vector] prescanl': OK
  8826. 1316.06 s [vector] +++ OK, passed 100 tests.
  8827. 1316.06 s [vector] postscanl: OK
  8828. 1316.07 s [vector] +++ OK, passed 100 tests.
  8829. 1316.07 s [vector] postscanl': OK
  8830. 1316.07 s [vector] +++ OK, passed 100 tests.
  8831. 1316.08 s [vector] scanl: OK
  8832. 1316.08 s [vector] +++ OK, passed 100 tests.
  8833. 1316.08 s [vector] scanl': OK
  8834. 1316.08 s [vector] +++ OK, passed 100 tests.
  8835. 1316.08 s [vector] scanl1: OK
  8836. 1316.08 s [vector] +++ OK, passed 100 tests.
  8837. 1316.08 s [vector] scanl1': OK
  8838. 1316.08 s [vector] +++ OK, passed 100 tests.
  8839. 1316.08 s [vector] iscanl: OK
  8840. 1316.09 s [vector] +++ OK, passed 100 tests.
  8841. 1316.09 s [vector] iscanl': OK
  8842. 1316.09 s [vector] +++ OK, passed 100 tests.
  8843. 1316.09 s [vector] prescanr: OK
  8844. 1316.09 s [vector] +++ OK, passed 100 tests.
  8845. 1316.09 s [vector] prescanr': OK
  8846. 1316.09 s [vector] +++ OK, passed 100 tests.
  8847. 1316.10 s [vector] postscanr: OK
  8848. 1316.10 s [vector] +++ OK, passed 100 tests.
  8849. 1316.10 s [vector] postscanr': OK
  8850. 1316.10 s [vector] +++ OK, passed 100 tests.
  8851. 1316.11 s [vector] scanr: OK
  8852. 1316.11 s [vector] +++ OK, passed 100 tests.
  8853. 1316.11 s [vector] scanr': OK
  8854. 1316.11 s [vector] +++ OK, passed 100 tests.
  8855. 1316.11 s [vector] scanr1: OK
  8856. 1316.11 s [vector] +++ OK, passed 100 tests.
  8857. 1316.12 s [vector] scanr1': OK
  8858. 1316.12 s [vector] +++ OK, passed 100 tests.
  8859. 1316.12 s [vector] iscanr: OK
  8860. 1316.12 s [vector] +++ OK, passed 100 tests.
  8861. 1316.12 s [vector] iscanr': OK
  8862. 1316.12 s [vector] +++ OK, passed 100 tests.
  8863. 1316.12 s [vector] mut_read: OK
  8864. 1316.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8865. 1316.14 s [vector] mut_write: OK
  8866. 1316.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8867. 1316.14 s [vector] mut_modify: OK
  8868. 1316.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8869. 1316.14 s [vector] mut_generate: OK
  8870. 1316.14 s [vector] +++ OK, passed 100 tests.
  8871. 1316.14 s [vector] mut_generateM: OK (0.01s)
  8872. 1316.14 s [vector] +++ OK, passed 100 tests.
  8873. 1316.16 s [vector] mut_mapM_: OK (0.02s)
  8874. 1316.16 s [vector] +++ OK, passed 100 tests.
  8875. 1316.18 s [vector] mut_imapM_: OK (0.02s)
  8876. 1316.18 s [vector] +++ OK, passed 100 tests.
  8877. 1316.20 s [vector] mut_forM_: OK (0.02s)
  8878. 1316.20 s [vector] +++ OK, passed 100 tests.
  8879. 1316.23 s [vector] mut_iforM_: OK (0.04s)
  8880. 1316.23 s [vector] +++ OK, passed 100 tests.
  8881. 1316.24 s [vector] mut_foldr: OK
  8882. 1316.24 s [vector] +++ OK, passed 100 tests.
  8883. 1316.24 s [vector] mut_foldr': OK
  8884. 1316.24 s [vector] +++ OK, passed 100 tests.
  8885. 1316.24 s [vector] mut_foldl: OK
  8886. 1316.24 s [vector] +++ OK, passed 100 tests.
  8887. 1316.24 s [vector] mut_foldl': OK
  8888. 1316.24 s [vector] +++ OK, passed 100 tests.
  8889. 1316.25 s [vector] mut_ifoldr: OK
  8890. 1316.26 s [vector] +++ OK, passed 100 tests.
  8891. 1316.26 s [vector] mut_ifoldr': OK
  8892. 1316.27 s [vector] +++ OK, passed 100 tests.
  8893. 1316.27 s [vector] mut_ifoldl: OK
  8894. 1316.27 s [vector] +++ OK, passed 100 tests.
  8895. 1316.27 s [vector] mut_ifoldl': OK
  8896. 1316.27 s [vector] +++ OK, passed 100 tests.
  8897. 1316.27 s [vector] mut_foldM: OK
  8898. 1316.27 s [vector] +++ OK, passed 100 tests.
  8899. 1316.28 s [vector] mut_foldM': OK
  8900. 1316.28 s [vector] +++ OK, passed 100 tests.
  8901. 1316.28 s [vector] mut_foldrM: OK
  8902. 1316.28 s [vector] +++ OK, passed 100 tests.
  8903. 1316.28 s [vector] mut_foldrM': OK
  8904. 1316.28 s [vector] +++ OK, passed 100 tests.
  8905. 1316.28 s [vector] mut_ifoldM: OK
  8906. 1316.28 s [vector] +++ OK, passed 100 tests.
  8907. 1316.29 s [vector] mut_ifoldM': OK
  8908. 1316.29 s [vector] +++ OK, passed 100 tests.
  8909. 1316.29 s [vector] mut_ifoldrM: OK
  8910. 1316.29 s [vector] +++ OK, passed 100 tests.
  8911. 1316.29 s [vector] mut_ifoldrM': OK
  8912. 1316.29 s [vector] +++ OK, passed 100 tests.
  8913. 1316.29 s [vector] compare: OK
  8914. 1316.30 s [vector] +++ OK, passed 100 tests.
  8915. 1316.30 s [vector] maximum: OK
  8916. 1316.30 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8917. 1316.30 s [vector] minimum: OK
  8918. 1316.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8919. 1316.30 s [vector] minIndex: OK
  8920. 1316.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8921. 1316.30 s [vector] maxIndex: OK
  8922. 1316.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8923. 1316.30 s [vector] maximumBy: OK
  8924. 1316.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8925. 1316.30 s [vector] minimumBy: OK
  8926. 1316.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8927. 1316.30 s [vector] maximumOn: OK
  8928. 1316.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8929. 1316.30 s [vector] minimumOn: OK
  8930. 1316.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8931. 1316.30 s [vector] maxIndexBy: OK
  8932. 1316.31 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8933. 1316.31 s [vector] minIndexBy: OK
  8934. 1316.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8935. 1316.31 s [vector] ListFirstMaxIndexWins: OK
  8936. 1316.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8937. 1316.31 s [vector] FalseListFirstMaxIndexWins: OK
  8938. 1316.31 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8939. 1316.31 s [vector] []
  8940. 1316.31 s [vector] zip: OK
  8941. 1316.31 s [vector] +++ OK, passed 100 tests.
  8942. 1316.31 s [vector] zip3: OK
  8943. 1316.31 s [vector] +++ OK, passed 100 tests.
  8944. 1316.31 s [vector] unzip: OK
  8945. 1316.31 s [vector] +++ OK, passed 100 tests.
  8946. 1316.31 s [vector] unzip3: OK
  8947. 1316.32 s [vector] +++ OK, passed 100 tests.
  8948. 1316.32 s [vector] indexed: OK
  8949. 1316.32 s [vector] +++ OK, passed 100 tests.
  8950. 1316.32 s [vector] update: OK
  8951. 1316.32 s [vector] +++ OK, passed 100 tests.
  8952. 1316.32 s [vector] mempty: OK
  8953. 1316.32 s [vector] +++ OK, passed 100 tests.
  8954. 1316.32 s [vector] mappend: OK
  8955. 1316.32 s [vector] +++ OK, passed 100 tests.
  8956. 1316.33 s [vector] mconcat: OK (0.02s)
  8957. 1316.33 s [vector] +++ OK, passed 100 tests.
  8958. 1316.34 s [vector] glength: OK
  8959. 1316.34 s [vector] +++ OK, passed 100 tests.
  8960. 1316.34 s [vector] sum: OK
  8961. 1316.34 s [vector] +++ OK, passed 100 tests.
  8962. 1316.34 s [vector] product: OK
  8963. 1316.34 s [vector] +++ OK, passed 100 tests.
  8964. 1316.34 s [vector] enumFromN: OK
  8965. 1316.34 s [vector] +++ OK, passed 100 tests.
  8966. 1316.34 s [vector] enumFromThenN: OK
  8967. 1316.34 s [vector] +++ OK, passed 100 tests.
  8968. 1316.34 s [vector] enumFromTo: OK
  8969. 1316.34 s [vector] +++ OK, passed 100 tests.
  8970. 1316.34 s [vector] enumFromThenTo: OK
  8971. 1316.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8972. 1316.34 s [vector] (Float)
  8973. 1316.34 s [vector] fromList.toList == id: OK
  8974. 1316.34 s [vector] +++ OK, passed 100 tests.
  8975. 1316.34 s [vector] toList.fromList == id: OK
  8976. 1316.34 s [vector] +++ OK, passed 100 tests.
  8977. 1316.34 s [vector] unstream.stream == id: OK
  8978. 1316.34 s [vector] +++ OK, passed 100 tests.
  8979. 1316.34 s [vector] stream.unstream == id: OK
  8980. 1316.34 s [vector] +++ OK, passed 100 tests.
  8981. 1316.35 s [vector] eq: OK
  8982. 1316.35 s [vector] +++ OK, passed 100 tests.
  8983. 1316.35 s [vector] length: OK
  8984. 1316.35 s [vector] +++ OK, passed 100 tests.
  8985. 1316.35 s [vector] null: OK
  8986. 1316.35 s [vector] +++ OK, passed 100 tests.
  8987. 1316.35 s [vector] index: OK
  8988. 1316.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8989. 1316.35 s [vector] safeIndex: OK
  8990. 1316.35 s [vector] +++ OK, passed 100 tests.
  8991. 1316.35 s [vector] head: OK
  8992. 1316.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8993. 1316.35 s [vector] last: OK
  8994. 1316.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8995. 1316.36 s [vector] unsafeIndex: OK
  8996. 1316.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8997. 1316.36 s [vector] unsafeHead: OK
  8998. 1316.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8999. 1316.36 s [vector] unsafeLast: OK
  9000. 1316.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9001. 1316.36 s [vector] slice: OK
  9002. 1316.36 s [vector] +++ OK, passed 100 tests.
  9003. 1316.36 s [vector] init: OK
  9004. 1316.36 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9005. 1316.36 s [vector] tail: OK
  9006. 1316.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9007. 1316.37 s [vector] take: OK
  9008. 1316.37 s [vector] +++ OK, passed 100 tests.
  9009. 1316.37 s [vector] drop: OK
  9010. 1316.37 s [vector] +++ OK, passed 100 tests.
  9011. 1316.37 s [vector] splitAt: OK
  9012. 1316.37 s [vector] +++ OK, passed 100 tests.
  9013. 1316.37 s [vector] empty: OK
  9014. 1316.38 s [vector] +++ OK, passed 100 tests.
  9015. 1316.38 s [vector] singleton: OK
  9016. 1316.38 s [vector] +++ OK, passed 100 tests.
  9017. 1316.38 s [vector] replicate: OK
  9018. 1316.38 s [vector] +++ OK, passed 100 tests.
  9019. 1316.39 s [vector] generate: OK
  9020. 1316.39 s [vector] +++ OK, passed 100 tests.
  9021. 1316.39 s [vector] iterateN: OK
  9022. 1316.39 s [vector] +++ OK, passed 100 tests.
  9023. 1316.47 s [vector] iterateNM: OK (0.07s)
  9024. 1316.47 s [vector] +++ OK, passed 100 tests.
  9025. 1316.50 s [vector] generateM: OK (0.02s)
  9026. 1316.50 s [vector] +++ OK, passed 100 tests.
  9027. 1316.50 s [vector] replicateM: OK
  9028. 1316.50 s [vector] +++ OK, passed 100 tests.
  9029. 1316.50 s [vector] create: OK
  9030. 1316.50 s [vector] +++ OK, passed 100 tests.
  9031. 1316.50 s [vector] createT: OK
  9032. 1316.50 s [vector] +++ OK, passed 100 tests.
  9033. 1316.51 s [vector] unfoldr: OK
  9034. 1316.51 s [vector] +++ OK, passed 100 tests.
  9035. 1316.51 s [vector] unfoldrN: OK
  9036. 1316.51 s [vector] +++ OK, passed 100 tests.
  9037. 1316.51 s [vector] unfoldrExactN: OK
  9038. 1316.51 s [vector] +++ OK, passed 100 tests.
  9039. 1316.52 s [vector] unfoldrM: OK
  9040. 1316.52 s [vector] +++ OK, passed 100 tests.
  9041. 1316.52 s [vector] unfoldrNM: OK
  9042. 1316.52 s [vector] +++ OK, passed 100 tests.
  9043. 1316.56 s [vector] unfoldrExactNM: OK (0.04s)
  9044. 1316.56 s [vector] +++ OK, passed 100 tests.
  9045. 1316.57 s [vector] constructN: OK (0.01s)
  9046. 1316.57 s [vector] +++ OK, passed 100 tests.
  9047. 1316.57 s [vector] constructrN: OK
  9048. 1316.57 s [vector] +++ OK, passed 100 tests.
  9049. 1316.58 s [vector] cons: OK
  9050. 1316.58 s [vector] +++ OK, passed 100 tests.
  9051. 1316.60 s [vector] snoc: OK
  9052. 1316.60 s [vector] +++ OK, passed 100 tests.
  9053. 1316.60 s [vector] append: OK
  9054. 1316.60 s [vector] +++ OK, passed 100 tests.
  9055. 1316.61 s [vector] concat: OK (0.03s)
  9056. 1316.61 s [vector] +++ OK, passed 100 tests.
  9057. 1316.62 s [vector] force: OK
  9058. 1316.62 s [vector] +++ OK, passed 100 tests.
  9059. 1316.62 s [vector] upd: OK
  9060. 1316.62 s [vector] +++ OK, passed 100 tests.
  9061. 1316.63 s [vector] accum: OK (0.01s)
  9062. 1316.64 s [vector] +++ OK, passed 100 tests.
  9063. 1316.64 s [vector] reverse: OK
  9064. 1316.65 s [vector] +++ OK, passed 100 tests.
  9065. 1316.65 s [vector] backpermute: OK
  9066. 1316.65 s [vector] +++ OK, passed 100 tests.
  9067. 1316.65 s [vector] map: OK
  9068. 1316.65 s [vector] +++ OK, passed 100 tests.
  9069. 1316.66 s [vector] imap: OK
  9070. 1316.66 s [vector] +++ OK, passed 100 tests.
  9071. 1316.66 s [vector] concatMap: OK
  9072. 1316.66 s [vector] +++ OK, passed 100 tests.
  9073. 1316.68 s [vector] mapM: OK
  9074. 1316.68 s [vector] +++ OK, passed 100 tests.
  9075. 1316.72 s [vector] mapM_: OK (0.05s)
  9076. 1316.72 s [vector] +++ OK, passed 100 tests.
  9077. 1316.74 s [vector] forM: OK (0.01s)
  9078. 1316.74 s [vector] +++ OK, passed 100 tests.
  9079. 1316.79 s [vector] forM_: OK (0.06s)
  9080. 1316.79 s [vector] +++ OK, passed 100 tests.
  9081. 1316.80 s [vector] imapM: OK (0.01s)
  9082. 1316.80 s [vector] +++ OK, passed 100 tests.
  9083. 1316.85 s [vector] imapM_: OK (0.05s)
  9084. 1316.85 s [vector] +++ OK, passed 100 tests.
  9085. 1316.86 s [vector] zipWith: OK
  9086. 1316.86 s [vector] +++ OK, passed 100 tests.
  9087. 1316.86 s [vector] zipWith3: OK
  9088. 1316.86 s [vector] +++ OK, passed 100 tests.
  9089. 1316.87 s [vector] izipWith: OK
  9090. 1316.87 s [vector] +++ OK, passed 100 tests.
  9091. 1316.88 s [vector] izipWith3: OK
  9092. 1316.88 s [vector] +++ OK, passed 100 tests.
  9093. 1316.90 s [vector] izipWithM: OK
  9094. 1316.90 s [vector] +++ OK, passed 100 tests.
  9095. 1316.92 s [vector] izipWithM_: OK (0.03s)
  9096. 1316.92 s [vector] +++ OK, passed 100 tests.
  9097. 1316.93 s [vector] zipWithM: OK
  9098. 1316.94 s [vector] +++ OK, passed 100 tests.
  9099. 1316.97 s [vector] zipWithM_: OK (0.03s)
  9100. 1316.97 s [vector] +++ OK, passed 100 tests.
  9101. 1316.98 s [vector] filter: OK
  9102. 1316.98 s [vector] +++ OK, passed 100 tests.
  9103. 1316.98 s [vector] ifilter: OK
  9104. 1316.98 s [vector] +++ OK, passed 100 tests.
  9105. 1317.03 s [vector] filterM: OK (0.05s)
  9106. 1317.03 s [vector] +++ OK, passed 100 tests.
  9107. 1317.03 s [vector] uniq: OK
  9108. 1317.03 s [vector] +++ OK, passed 100 tests.
  9109. 1317.04 s [vector] mapMaybe: OK
  9110. 1317.04 s [vector] +++ OK, passed 100 tests.
  9111. 1317.04 s [vector] imapMaybe: OK
  9112. 1317.04 s [vector] +++ OK, passed 100 tests.
  9113. 1317.04 s [vector] takeWhile: OK
  9114. 1317.05 s [vector] +++ OK, passed 100 tests.
  9115. 1317.05 s [vector] dropWhile: OK
  9116. 1317.05 s [vector] +++ OK, passed 100 tests.
  9117. 1317.05 s [vector] partition: OK
  9118. 1317.05 s [vector] +++ OK, passed 100 tests.
  9119. 1317.06 s [vector] partitionWith: OK
  9120. 1317.06 s [vector] +++ OK, passed 100 tests.
  9121. 1317.06 s [vector] span: OK
  9122. 1317.06 s [vector] +++ OK, passed 100 tests.
  9123. 1317.07 s [vector] break: OK
  9124. 1317.07 s [vector] +++ OK, passed 100 tests.
  9125. 1317.07 s [vector] spanR: OK
  9126. 1317.07 s [vector] +++ OK, passed 100 tests.
  9127. 1317.07 s [vector] breakR: OK
  9128. 1317.07 s [vector] +++ OK, passed 100 tests.
  9129. 1317.07 s [vector] groupBy: OK
  9130. 1317.07 s [vector] +++ OK, passed 100 tests.
  9131. 1317.07 s [vector] elem: OK
  9132. 1317.08 s [vector] +++ OK, passed 100 tests.
  9133. 1317.08 s [vector] notElem: OK
  9134. 1317.08 s [vector] +++ OK, passed 100 tests.
  9135. 1317.08 s [vector] find: OK
  9136. 1317.08 s [vector] +++ OK, passed 100 tests.
  9137. 1317.08 s [vector] findIndex: OK
  9138. 1317.08 s [vector] +++ OK, passed 100 tests.
  9139. 1317.08 s [vector] findIndexR: OK
  9140. 1317.08 s [vector] +++ OK, passed 100 tests.
  9141. 1317.09 s [vector] findIndices: OK
  9142. 1317.09 s [vector] +++ OK, passed 100 tests.
  9143. 1317.09 s [vector] elemIndex: OK
  9144. 1317.09 s [vector] +++ OK, passed 100 tests.
  9145. 1317.09 s [vector] elemIndices: OK
  9146. 1317.09 s [vector] +++ OK, passed 100 tests.
  9147. 1317.10 s [vector] foldl: OK
  9148. 1317.10 s [vector] +++ OK, passed 100 tests.
  9149. 1317.10 s [vector] foldl1: OK
  9150. 1317.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9151. 1317.11 s [vector] foldl': OK
  9152. 1317.12 s [vector] +++ OK, passed 100 tests.
  9153. 1317.13 s [vector] foldl1': OK
  9154. 1317.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9155. 1317.14 s [vector] foldr: OK
  9156. 1317.14 s [vector] +++ OK, passed 100 tests.
  9157. 1317.14 s [vector] foldr1: OK
  9158. 1317.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9159. 1317.16 s [vector] foldr': OK
  9160. 1317.16 s [vector] +++ OK, passed 100 tests.
  9161. 1317.16 s [vector] foldr1': OK
  9162. 1317.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9163. 1317.17 s [vector] ifoldl: OK
  9164. 1317.18 s [vector] +++ OK, passed 100 tests.
  9165. 1317.18 s [vector] ifoldl': OK
  9166. 1317.18 s [vector] +++ OK, passed 100 tests.
  9167. 1317.19 s [vector] ifoldr: OK
  9168. 1317.19 s [vector] +++ OK, passed 100 tests.
  9169. 1317.19 s [vector] ifoldr': OK
  9170. 1317.19 s [vector] +++ OK, passed 100 tests.
  9171. 1317.20 s [vector] ifoldM: OK
  9172. 1317.20 s [vector] +++ OK, passed 100 tests.
  9173. 1317.24 s [vector] ifoldM': OK
  9174. 1317.24 s [vector] +++ OK, passed 100 tests.
  9175. 1317.28 s [vector] ifoldM_: OK (0.04s)
  9176. 1317.28 s [vector] +++ OK, passed 100 tests.
  9177. 1317.30 s [vector] ifoldM'_: OK (0.04s)
  9178. 1317.30 s [vector] +++ OK, passed 100 tests.
  9179. 1317.32 s [vector] all: OK
  9180. 1317.32 s [vector] +++ OK, passed 100 tests.
  9181. 1317.32 s [vector] any: OK
  9182. 1317.32 s [vector] +++ OK, passed 100 tests.
  9183. 1317.33 s [vector] prescanl: OK
  9184. 1317.34 s [vector] +++ OK, passed 100 tests.
  9185. 1317.34 s [vector] prescanl': OK
  9186. 1317.34 s [vector] +++ OK, passed 100 tests.
  9187. 1317.35 s [vector] postscanl: OK (0.01s)
  9188. 1317.35 s [vector] +++ OK, passed 100 tests.
  9189. 1317.35 s [vector] postscanl': OK
  9190. 1317.35 s [vector] +++ OK, passed 100 tests.
  9191. 1317.35 s [vector] scanl: OK
  9192. 1317.36 s [vector] +++ OK, passed 100 tests.
  9193. 1317.36 s [vector] scanl': OK (0.01s)
  9194. 1317.36 s [vector] +++ OK, passed 100 tests.
  9195. 1317.37 s [vector] scanl1: OK
  9196. 1317.38 s [vector] +++ OK, passed 100 tests.
  9197. 1317.38 s [vector] scanl1': OK
  9198. 1317.38 s [vector] +++ OK, passed 100 tests.
  9199. 1317.39 s [vector] iscanl: OK (0.01s)
  9200. 1317.39 s [vector] +++ OK, passed 100 tests.
  9201. 1317.39 s [vector] iscanl': OK (0.01s)
  9202. 1317.39 s [vector] +++ OK, passed 100 tests.
  9203. 1317.40 s [vector] prescanr: OK
  9204. 1317.40 s [vector] +++ OK, passed 100 tests.
  9205. 1317.41 s [vector] prescanr': OK
  9206. 1317.41 s [vector] +++ OK, passed 100 tests.
  9207. 1317.43 s [vector] postscanr: OK (0.01s)
  9208. 1317.44 s [vector] +++ OK, passed 100 tests.
  9209. 1317.44 s [vector] postscanr': OK
  9210. 1317.44 s [vector] +++ OK, passed 100 tests.
  9211. 1317.45 s [vector] scanr: OK (0.01s)
  9212. 1317.46 s [vector] +++ OK, passed 100 tests.
  9213. 1317.46 s [vector] scanr': OK
  9214. 1317.46 s [vector] +++ OK, passed 100 tests.
  9215. 1317.47 s [vector] scanr1: OK (0.01s)
  9216. 1317.48 s [vector] +++ OK, passed 100 tests.
  9217. 1317.48 s [vector] scanr1': OK
  9218. 1317.48 s [vector] +++ OK, passed 100 tests.
  9219. 1317.50 s [vector] iscanr: OK (0.01s)
  9220. 1317.50 s [vector] +++ OK, passed 100 tests.
  9221. 1317.50 s [vector] iscanr': OK (0.01s)
  9222. 1317.50 s [vector] +++ OK, passed 100 tests.
  9223. 1317.51 s [vector] mut_read: OK
  9224. 1317.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9225. 1317.51 s [vector] mut_write: OK
  9226. 1317.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9227. 1317.51 s [vector] mut_modify: OK
  9228. 1317.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9229. 1317.52 s [vector] mut_generate: OK
  9230. 1317.52 s [vector] +++ OK, passed 100 tests.
  9231. 1317.56 s [vector] mut_generateM: OK (0.03s)
  9232. 1317.56 s [vector] +++ OK, passed 100 tests.
  9233. 1317.64 s [vector] mut_mapM_: OK (0.08s)
  9234. 1317.64 s [vector] +++ OK, passed 100 tests.
  9235. 1317.72 s [vector] mut_imapM_: OK (0.08s)
  9236. 1317.72 s [vector] +++ OK, passed 100 tests.
  9237. 1317.80 s [vector] mut_forM_: OK (0.08s)
  9238. 1317.80 s [vector] +++ OK, passed 100 tests.
  9239. 1317.83 s [vector] mut_iforM_: OK (0.04s)
  9240. 1317.84 s [vector] +++ OK, passed 100 tests.
  9241. 1317.84 s [vector] mut_foldr: OK
  9242. 1317.84 s [vector] +++ OK, passed 100 tests.
  9243. 1317.84 s [vector] mut_foldr': OK
  9244. 1317.84 s [vector] +++ OK, passed 100 tests.
  9245. 1317.84 s [vector] mut_foldl: OK
  9246. 1317.84 s [vector] +++ OK, passed 100 tests.
  9247. 1317.86 s [vector] mut_foldl': OK
  9248. 1317.86 s [vector] +++ OK, passed 100 tests.
  9249. 1317.87 s [vector] mut_ifoldr: OK (0.01s)
  9250. 1317.87 s [vector] +++ OK, passed 100 tests.
  9251. 1317.90 s [vector] mut_ifoldr': OK
  9252. 1317.90 s [vector] +++ OK, passed 100 tests.
  9253. 1317.90 s [vector] mut_ifoldl: OK (0.01s)
  9254. 1317.90 s [vector] +++ OK, passed 100 tests.
  9255. 1317.92 s [vector] mut_ifoldl': OK (0.02s)
  9256. 1317.92 s [vector] +++ OK, passed 100 tests.
  9257. 1317.93 s [vector] mut_foldM: OK (0.02s)
  9258. 1317.93 s [vector] +++ OK, passed 100 tests.
  9259. 1317.96 s [vector] mut_foldM': OK (0.01s)
  9260. 1317.96 s [vector] +++ OK, passed 100 tests.
  9261. 1317.98 s [vector] mut_foldrM: OK (0.02s)
  9262. 1317.98 s [vector] +++ OK, passed 100 tests.
  9263. 1318.00 s [vector] mut_foldrM': OK (0.02s)
  9264. 1318.00 s [vector] +++ OK, passed 100 tests.
  9265. 1318.02 s [vector] mut_ifoldM: OK (0.02s)
  9266. 1318.02 s [vector] +++ OK, passed 100 tests.
  9267. 1318.04 s [vector] mut_ifoldM': OK (0.02s)
  9268. 1318.04 s [vector] +++ OK, passed 100 tests.
  9269. 1318.06 s [vector] mut_ifoldrM: OK (0.02s)
  9270. 1318.06 s [vector] +++ OK, passed 100 tests.
  9271. 1318.06 s [vector] mut_ifoldrM': OK (0.02s)
  9272. 1318.06 s [vector] +++ OK, passed 100 tests.
  9273. 1318.06 s [vector] compare: OK
  9274. 1318.06 s [vector] +++ OK, passed 100 tests.
  9275. 1318.06 s [vector] maximum: OK
  9276. 1318.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9277. 1318.06 s [vector] minimum: OK
  9278. 1318.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9279. 1318.06 s [vector] minIndex: OK
  9280. 1318.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9281. 1318.06 s [vector] maxIndex: OK
  9282. 1318.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9283. 1318.07 s [vector] maximumBy: OK
  9284. 1318.07 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9285. 1318.07 s [vector] minimumBy: OK
  9286. 1318.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9287. 1318.07 s [vector] maximumOn: OK
  9288. 1318.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9289. 1318.07 s [vector] minimumOn: OK
  9290. 1318.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9291. 1318.07 s [vector] maxIndexBy: OK
  9292. 1318.07 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9293. 1318.07 s [vector] minIndexBy: OK
  9294. 1318.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9295. 1318.07 s [vector] ListFirstMaxIndexWins: OK
  9296. 1318.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9297. 1318.07 s [vector] FalseListFirstMaxIndexWins: OK
  9298. 1318.07 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9299. 1318.08 s [vector] []
  9300. 1318.08 s [vector] zip: OK
  9301. 1318.08 s [vector] +++ OK, passed 100 tests.
  9302. 1318.08 s [vector] zip3: OK
  9303. 1318.08 s [vector] +++ OK, passed 100 tests.
  9304. 1318.08 s [vector] unzip: OK
  9305. 1318.08 s [vector] +++ OK, passed 100 tests.
  9306. 1318.08 s [vector] unzip3: OK
  9307. 1318.08 s [vector] +++ OK, passed 100 tests.
  9308. 1318.08 s [vector] indexed: OK
  9309. 1318.09 s [vector] +++ OK, passed 100 tests.
  9310. 1318.09 s [vector] update: OK
  9311. 1318.09 s [vector] +++ OK, passed 100 tests.
  9312. 1318.09 s [vector] mempty: OK
  9313. 1318.09 s [vector] +++ OK, passed 100 tests.
  9314. 1318.09 s [vector] mappend: OK
  9315. 1318.10 s [vector] +++ OK, passed 100 tests.
  9316. 1318.12 s [vector] mconcat: OK (0.03s)
  9317. 1318.12 s [vector] +++ OK, passed 100 tests.
  9318. 1318.12 s [vector] glength: OK
  9319. 1318.12 s [vector] +++ OK, passed 100 tests.
  9320. 1318.12 s [vector] sum: OK
  9321. 1318.12 s [vector] +++ OK, passed 100 tests.
  9322. 1318.12 s [vector] product: OK
  9323. 1318.12 s [vector] +++ OK, passed 100 tests.
  9324. 1318.12 s [vector] enumFromN: OK
  9325. 1318.12 s [vector] +++ OK, passed 100 tests.
  9326. 1318.13 s [vector] enumFromThenN: OK
  9327. 1318.13 s [vector] +++ OK, passed 100 tests.
  9328. 1318.13 s [vector] enumFromTo: OK
  9329. 1318.13 s [vector] +++ OK, passed 100 tests.
  9330. 1318.13 s [vector] enumFromThenTo: OK
  9331. 1318.13 s [vector] +++ OK, passed 100 tests; 2 discarded.
  9332. 1318.13 s [vector] (Double)
  9333. 1318.13 s [vector] fromList.toList == id: OK
  9334. 1318.13 s [vector] +++ OK, passed 100 tests.
  9335. 1318.13 s [vector] toList.fromList == id: OK
  9336. 1318.13 s [vector] +++ OK, passed 100 tests.
  9337. 1318.13 s [vector] unstream.stream == id: OK
  9338. 1318.13 s [vector] +++ OK, passed 100 tests.
  9339. 1318.13 s [vector] stream.unstream == id: OK
  9340. 1318.13 s [vector] +++ OK, passed 100 tests.
  9341. 1318.13 s [vector] eq: OK
  9342. 1318.13 s [vector] +++ OK, passed 100 tests.
  9343. 1318.13 s [vector] length: OK
  9344. 1318.13 s [vector] +++ OK, passed 100 tests.
  9345. 1318.13 s [vector] null: OK
  9346. 1318.13 s [vector] +++ OK, passed 100 tests.
  9347. 1318.13 s [vector] index: OK
  9348. 1318.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9349. 1318.13 s [vector] safeIndex: OK
  9350. 1318.13 s [vector] +++ OK, passed 100 tests.
  9351. 1318.14 s [vector] head: OK
  9352. 1318.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9353. 1318.14 s [vector] last: OK
  9354. 1318.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9355. 1318.14 s [vector] unsafeIndex: OK
  9356. 1318.14 s [vector] +++ OK, passed 100 tests; 29 discarded.
  9357. 1318.14 s [vector] unsafeHead: OK
  9358. 1318.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9359. 1318.14 s [vector] unsafeLast: OK
  9360. 1318.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9361. 1318.14 s [vector] slice: OK
  9362. 1318.14 s [vector] +++ OK, passed 100 tests.
  9363. 1318.14 s [vector] init: OK
  9364. 1318.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9365. 1318.14 s [vector] tail: OK
  9366. 1318.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9367. 1318.15 s [vector] take: OK
  9368. 1318.15 s [vector] +++ OK, passed 100 tests.
  9369. 1318.15 s [vector] drop: OK
  9370. 1318.15 s [vector] +++ OK, passed 100 tests.
  9371. 1318.15 s [vector] splitAt: OK
  9372. 1318.15 s [vector] +++ OK, passed 100 tests.
  9373. 1318.15 s [vector] empty: OK
  9374. 1318.15 s [vector] +++ OK, passed 100 tests.
  9375. 1318.15 s [vector] singleton: OK
  9376. 1318.15 s [vector] +++ OK, passed 100 tests.
  9377. 1318.15 s [vector] replicate: OK
  9378. 1318.15 s [vector] +++ OK, passed 100 tests.
  9379. 1318.15 s [vector] generate: OK
  9380. 1318.15 s [vector] +++ OK, passed 100 tests.
  9381. 1318.16 s [vector] iterateN: OK
  9382. 1318.16 s [vector] +++ OK, passed 100 tests.
  9383. 1318.20 s [vector] iterateNM: OK (0.04s)
  9384. 1318.20 s [vector] +++ OK, passed 100 tests.
  9385. 1318.23 s [vector] generateM: OK (0.03s)
  9386. 1318.23 s [vector] +++ OK, passed 100 tests.
  9387. 1318.23 s [vector] replicateM: OK (0.01s)
  9388. 1318.23 s [vector] +++ OK, passed 100 tests.
  9389. 1318.24 s [vector] create: OK
  9390. 1318.24 s [vector] +++ OK, passed 100 tests.
  9391. 1318.24 s [vector] createT: OK
  9392. 1318.26 s [vector] +++ OK, passed 100 tests.
  9393. 1318.26 s [vector] unfoldr: OK
  9394. 1318.26 s [vector] +++ OK, passed 100 tests.
  9395. 1318.27 s [vector] unfoldrN: OK
  9396. 1318.27 s [vector] +++ OK, passed 100 tests.
  9397. 1318.27 s [vector] unfoldrExactN: OK
  9398. 1318.27 s [vector] +++ OK, passed 100 tests.
  9399. 1318.27 s [vector] unfoldrM: OK (0.03s)
  9400. 1318.27 s [vector] +++ OK, passed 100 tests.
  9401. 1318.28 s [vector] unfoldrNM: OK
  9402. 1318.28 s [vector] +++ OK, passed 100 tests.
  9403. 1318.32 s [vector] unfoldrExactNM: OK (0.04s)
  9404. 1318.32 s [vector] +++ OK, passed 100 tests.
  9405. 1318.34 s [vector] constructN: OK (0.02s)
  9406. 1318.34 s [vector] +++ OK, passed 100 tests.
  9407. 1318.34 s [vector] constructrN: OK (0.02s)
  9408. 1318.34 s [vector] +++ OK, passed 100 tests.
  9409. 1318.35 s [vector] cons: OK
  9410. 1318.35 s [vector] +++ OK, passed 100 tests.
  9411. 1318.36 s [vector] snoc: OK
  9412. 1318.36 s [vector] +++ OK, passed 100 tests.
  9413. 1318.36 s [vector] append: OK
  9414. 1318.36 s [vector] +++ OK, passed 100 tests.
  9415. 1318.37 s [vector] concat: OK (0.02s)
  9416. 1318.38 s [vector] +++ OK, passed 100 tests.
  9417. 1318.38 s [vector] force: OK
  9418. 1318.38 s [vector] +++ OK, passed 100 tests.
  9419. 1318.38 s [vector] upd: OK
  9420. 1318.38 s [vector] +++ OK, passed 100 tests.
  9421. 1318.40 s [vector] accum: OK (0.02s)
  9422. 1318.40 s [vector] +++ OK, passed 100 tests.
  9423. 1318.40 s [vector] reverse: OK
  9424. 1318.40 s [vector] +++ OK, passed 100 tests.
  9425. 1318.41 s [vector] backpermute: OK
  9426. 1318.41 s [vector] +++ OK, passed 100 tests.
  9427. 1318.42 s [vector] map: OK
  9428. 1318.42 s [vector] +++ OK, passed 100 tests.
  9429. 1318.42 s [vector] imap: OK
  9430. 1318.42 s [vector] +++ OK, passed 100 tests.
  9431. 1318.42 s [vector] concatMap: OK
  9432. 1318.42 s [vector] +++ OK, passed 100 tests.
  9433. 1318.43 s [vector] mapM: OK
  9434. 1318.44 s [vector] +++ OK, passed 100 tests.
  9435. 1318.48 s [vector] mapM_: OK (0.04s)
  9436. 1318.48 s [vector] +++ OK, passed 100 tests.
  9437. 1318.48 s [vector] forM: OK
  9438. 1318.48 s [vector] +++ OK, passed 100 tests.
  9439. 1318.53 s [vector] forM_: OK (0.04s)
  9440. 1318.54 s [vector] +++ OK, passed 100 tests.
  9441. 1318.54 s [vector] imapM: OK
  9442. 1318.54 s [vector] +++ OK, passed 100 tests.
  9443. 1318.58 s [vector] imapM_: OK (0.04s)
  9444. 1318.58 s [vector] +++ OK, passed 100 tests.
  9445. 1318.58 s [vector] zipWith: OK (0.01s)
  9446. 1318.58 s [vector] +++ OK, passed 100 tests.
  9447. 1318.59 s [vector] zipWith3: OK
  9448. 1318.59 s [vector] +++ OK, passed 100 tests.
  9449. 1318.62 s [vector] izipWith: OK (0.01s)
  9450. 1318.62 s [vector] +++ OK, passed 100 tests.
  9451. 1318.64 s [vector] izipWith3: OK (0.02s)
  9452. 1318.64 s [vector] +++ OK, passed 100 tests.
  9453. 1318.66 s [vector] izipWithM: OK (0.02s)
  9454. 1318.66 s [vector] +++ OK, passed 100 tests.
  9455. 1318.72 s [vector] izipWithM_: OK (0.06s)
  9456. 1318.72 s [vector] +++ OK, passed 100 tests.
  9457. 1318.74 s [vector] zipWithM: OK (0.02s)
  9458. 1318.74 s [vector] +++ OK, passed 100 tests.
  9459. 1318.77 s [vector] zipWithM_: OK (0.05s)
  9460. 1318.78 s [vector] +++ OK, passed 100 tests.
  9461. 1318.78 s [vector] filter: OK
  9462. 1318.78 s [vector] +++ OK, passed 100 tests.
  9463. 1318.80 s [vector] ifilter: OK (0.01s)
  9464. 1318.80 s [vector] +++ OK, passed 100 tests.
  9465. 1318.86 s [vector] filterM: OK (0.08s)
  9466. 1318.86 s [vector] +++ OK, passed 100 tests.
  9467. 1318.87 s [vector] uniq: OK
  9468. 1318.87 s [vector] +++ OK, passed 100 tests.
  9469. 1318.88 s [vector] mapMaybe: OK
  9470. 1318.88 s [vector] +++ OK, passed 100 tests.
  9471. 1318.88 s [vector] imapMaybe: OK
  9472. 1318.88 s [vector] +++ OK, passed 100 tests.
  9473. 1318.88 s [vector] takeWhile: OK
  9474. 1318.89 s [vector] +++ OK, passed 100 tests.
  9475. 1318.90 s [vector] dropWhile: OK
  9476. 1318.90 s [vector] +++ OK, passed 100 tests.
  9477. 1318.90 s [vector] partition: OK
  9478. 1318.90 s [vector] +++ OK, passed 100 tests.
  9479. 1318.90 s [vector] partitionWith: OK
  9480. 1318.90 s [vector] +++ OK, passed 100 tests.
  9481. 1318.90 s [vector] span: OK
  9482. 1318.91 s [vector] +++ OK, passed 100 tests.
  9483. 1318.91 s [vector] break: OK
  9484. 1318.92 s [vector] +++ OK, passed 100 tests.
  9485. 1318.92 s [vector] spanR: OK
  9486. 1318.92 s [vector] +++ OK, passed 100 tests.
  9487. 1318.92 s [vector] breakR: OK
  9488. 1318.92 s [vector] +++ OK, passed 100 tests.
  9489. 1318.92 s [vector] groupBy: OK (0.01s)
  9490. 1318.92 s [vector] +++ OK, passed 100 tests.
  9491. 1318.92 s [vector] elem: OK
  9492. 1318.92 s [vector] +++ OK, passed 100 tests.
  9493. 1318.93 s [vector] notElem: OK
  9494. 1318.93 s [vector] +++ OK, passed 100 tests.
  9495. 1318.93 s [vector] find: OK
  9496. 1318.94 s [vector] +++ OK, passed 100 tests.
  9497. 1318.94 s [vector] findIndex: OK
  9498. 1318.94 s [vector] +++ OK, passed 100 tests.
  9499. 1318.94 s [vector] findIndexR: OK
  9500. 1318.95 s [vector] +++ OK, passed 100 tests.
  9501. 1318.95 s [vector] findIndices: OK
  9502. 1318.95 s [vector] +++ OK, passed 100 tests.
  9503. 1318.95 s [vector] elemIndex: OK
  9504. 1318.95 s [vector] +++ OK, passed 100 tests.
  9505. 1318.95 s [vector] elemIndices: OK
  9506. 1318.95 s [vector] +++ OK, passed 100 tests.
  9507. 1318.96 s [vector] foldl: OK (0.02s)
  9508. 1318.96 s [vector] +++ OK, passed 100 tests.
  9509. 1318.98 s [vector] foldl1: OK (0.01s)
  9510. 1318.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9511. 1319.00 s [vector] foldl': OK (0.01s)
  9512. 1319.00 s [vector] +++ OK, passed 100 tests.
  9513. 1319.00 s [vector] foldl1': OK (0.01s)
  9514. 1319.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9515. 1319.02 s [vector] foldr: OK (0.01s)
  9516. 1319.02 s [vector] +++ OK, passed 100 tests.
  9517. 1319.04 s [vector] foldr1: OK (0.01s)
  9518. 1319.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9519. 1319.07 s [vector] foldr': OK (0.02s)
  9520. 1319.07 s [vector] +++ OK, passed 100 tests.
  9521. 1319.08 s [vector] foldr1': OK (0.01s)
  9522. 1319.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9523. 1319.08 s [vector] ifoldl: OK (0.02s)
  9524. 1319.08 s [vector] +++ OK, passed 100 tests.
  9525. 1319.09 s [vector] ifoldl': OK (0.02s)
  9526. 1319.09 s [vector] +++ OK, passed 100 tests.
  9527. 1319.12 s [vector] ifoldr: OK (0.01s)
  9528. 1319.12 s [vector] +++ OK, passed 100 tests.
  9529. 1319.14 s [vector] ifoldr': OK (0.02s)
  9530. 1319.14 s [vector] +++ OK, passed 100 tests.
  9531. 1319.15 s [vector] ifoldM: OK (0.02s)
  9532. 1319.16 s [vector] +++ OK, passed 100 tests.
  9533. 1319.16 s [vector] ifoldM': OK (0.01s)
  9534. 1319.16 s [vector] +++ OK, passed 100 tests.
  9535. 1319.19 s [vector] ifoldM_: OK (0.04s)
  9536. 1319.19 s [vector] +++ OK, passed 100 tests.
  9537. 1319.23 s [vector] ifoldM'_: OK (0.03s)
  9538. 1319.23 s [vector] +++ OK, passed 100 tests.
  9539. 1319.24 s [vector] all: OK
  9540. 1319.24 s [vector] +++ OK, passed 100 tests.
  9541. 1319.24 s [vector] any: OK
  9542. 1319.24 s [vector] +++ OK, passed 100 tests.
  9543. 1319.26 s [vector] prescanl: OK (0.02s)
  9544. 1319.26 s [vector] +++ OK, passed 100 tests.
  9545. 1319.28 s [vector] prescanl': OK (0.01s)
  9546. 1319.28 s [vector] +++ OK, passed 100 tests.
  9547. 1319.28 s [vector] postscanl: OK (0.01s)
  9548. 1319.29 s [vector] +++ OK, passed 100 tests.
  9549. 1319.32 s [vector] postscanl': OK (0.03s)
  9550. 1319.32 s [vector] +++ OK, passed 100 tests.
  9551. 1319.34 s [vector] scanl: OK (0.02s)
  9552. 1319.34 s [vector] +++ OK, passed 100 tests.
  9553. 1319.35 s [vector] scanl': OK (0.02s)
  9554. 1319.36 s [vector] +++ OK, passed 100 tests.
  9555. 1319.36 s [vector] scanl1: OK (0.01s)
  9556. 1319.36 s [vector] +++ OK, passed 100 tests.
  9557. 1319.38 s [vector] scanl1': OK (0.01s)
  9558. 1319.38 s [vector] +++ OK, passed 100 tests.
  9559. 1319.39 s [vector] iscanl: OK (0.01s)
  9560. 1319.40 s [vector] +++ OK, passed 100 tests.
  9561. 1319.40 s [vector] iscanl': OK (0.01s)
  9562. 1319.40 s [vector] +++ OK, passed 100 tests.
  9563. 1319.42 s [vector] prescanr: OK (0.02s)
  9564. 1319.42 s [vector] +++ OK, passed 100 tests.
  9565. 1319.44 s [vector] prescanr': OK (0.02s)
  9566. 1319.44 s [vector] +++ OK, passed 100 tests.
  9567. 1319.46 s [vector] postscanr: OK (0.01s)
  9568. 1319.46 s [vector] +++ OK, passed 100 tests.
  9569. 1319.46 s [vector] postscanr': OK (0.02s)
  9570. 1319.46 s [vector] +++ OK, passed 100 tests.
  9571. 1319.48 s [vector] scanr: OK (0.01s)
  9572. 1319.48 s [vector] +++ OK, passed 100 tests.
  9573. 1319.50 s [vector] scanr': OK (0.01s)
  9574. 1319.50 s [vector] +++ OK, passed 100 tests.
  9575. 1319.50 s [vector] scanr1: OK (0.01s)
  9576. 1319.50 s [vector] +++ OK, passed 100 tests.
  9577. 1319.52 s [vector] scanr1': OK (0.02s)
  9578. 1319.52 s [vector] +++ OK, passed 100 tests.
  9579. 1319.54 s [vector] iscanr: OK (0.02s)
  9580. 1319.54 s [vector] +++ OK, passed 100 tests.
  9581. 1319.55 s [vector] iscanr': OK (0.01s)
  9582. 1319.55 s [vector] +++ OK, passed 100 tests.
  9583. 1319.55 s [vector] mut_read: OK
  9584. 1319.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9585. 1319.55 s [vector] mut_write: OK
  9586. 1319.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9587. 1319.56 s [vector] mut_modify: OK
  9588. 1319.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9589. 1319.56 s [vector] mut_generate: OK
  9590. 1319.56 s [vector] +++ OK, passed 100 tests.
  9591. 1319.58 s [vector] mut_generateM: OK (0.03s)
  9592. 1319.58 s [vector] +++ OK, passed 100 tests.
  9593. 1319.62 s [vector] mut_mapM_: OK (0.04s)
  9594. 1319.62 s [vector] +++ OK, passed 100 tests.
  9595. 1319.66 s [vector] mut_imapM_: OK (0.04s)
  9596. 1319.66 s [vector] +++ OK, passed 100 tests.
  9597. 1319.70 s [vector] mut_forM_: OK (0.04s)
  9598. 1319.70 s [vector] +++ OK, passed 100 tests.
  9599. 1319.74 s [vector] mut_iforM_: OK (0.05s)
  9600. 1319.74 s [vector] +++ OK, passed 100 tests.
  9601. 1319.76 s [vector] mut_foldr: OK
  9602. 1319.76 s [vector] +++ OK, passed 100 tests.
  9603. 1319.78 s [vector] mut_foldr': OK (0.02s)
  9604. 1319.78 s [vector] +++ OK, passed 100 tests.
  9605. 1319.80 s [vector] mut_foldl: OK (0.02s)
  9606. 1319.80 s [vector] +++ OK, passed 100 tests.
  9607. 1319.82 s [vector] mut_foldl': OK (0.01s)
  9608. 1319.82 s [vector] +++ OK, passed 100 tests.
  9609. 1319.84 s [vector] mut_ifoldr: OK (0.01s)
  9610. 1319.84 s [vector] +++ OK, passed 100 tests.
  9611. 1319.86 s [vector] mut_ifoldr': OK (0.02s)
  9612. 1319.86 s [vector] +++ OK, passed 100 tests.
  9613. 1319.88 s [vector] mut_ifoldl: OK (0.02s)
  9614. 1319.88 s [vector] +++ OK, passed 100 tests.
  9615. 1319.89 s [vector] mut_ifoldl': OK (0.02s)
  9616. 1319.90 s [vector] +++ OK, passed 100 tests.
  9617. 1319.90 s [vector] mut_foldM: OK (0.02s)
  9618. 1319.90 s [vector] +++ OK, passed 100 tests.
  9619. 1319.92 s [vector] mut_foldM': OK (0.02s)
  9620. 1319.92 s [vector] +++ OK, passed 100 tests.
  9621. 1319.94 s [vector] mut_foldrM: OK (0.02s)
  9622. 1319.94 s [vector] +++ OK, passed 100 tests.
  9623. 1319.96 s [vector] mut_foldrM': OK (0.02s)
  9624. 1319.96 s [vector] +++ OK, passed 100 tests.
  9625. 1319.98 s [vector] mut_ifoldM: OK (0.02s)
  9626. 1319.98 s [vector] +++ OK, passed 100 tests.
  9627. 1320.21 s [vector] mut_ifoldM': OK (0.02s)
  9628. 1320.21 s [vector] +++ OK, passed 100 tests.
  9629. 1320.21 s [vector] mut_ifoldrM: OK (0.01s)
  9630. 1320.21 s [vector] +++ OK, passed 100 tests.
  9631. 1320.21 s [vector] mut_ifoldrM': OK (0.01s)
  9632. 1320.21 s [vector] +++ OK, passed 100 tests.
  9633. 1320.21 s [vector] compare: OK
  9634. 1320.21 s [vector] +++ OK, passed 100 tests.
  9635. 1320.21 s [vector] maximum: OK
  9636. 1320.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9637. 1320.21 s [vector] minimum: OK
  9638. 1320.21 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9639. 1320.21 s [vector] minIndex: OK
  9640. 1320.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9641. 1320.21 s [vector] maxIndex: OK
  9642. 1320.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9643. 1320.22 s [vector] maximumBy: OK
  9644. 1320.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9645. 1320.22 s [vector] minimumBy: OK
  9646. 1320.22 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9647. 1320.22 s [vector] maximumOn: OK
  9648. 1320.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9649. 1320.22 s [vector] minimumOn: OK
  9650. 1320.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9651. 1320.22 s [vector] maxIndexBy: OK
  9652. 1320.22 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9653. 1320.22 s [vector] minIndexBy: OK
  9654. 1320.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9655. 1320.22 s [vector] ListFirstMaxIndexWins: OK
  9656. 1320.22 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9657. 1320.22 s [vector] FalseListFirstMaxIndexWins: OK
  9658. 1320.22 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9659. 1320.22 s [vector] []
  9660. 1320.22 s [vector] zip: OK
  9661. 1320.22 s [vector] +++ OK, passed 100 tests.
  9662. 1320.22 s [vector] zip3: OK
  9663. 1320.22 s [vector] +++ OK, passed 100 tests.
  9664. 1320.22 s [vector] unzip: OK
  9665. 1320.22 s [vector] +++ OK, passed 100 tests.
  9666. 1320.22 s [vector] unzip3: OK
  9667. 1320.22 s [vector] +++ OK, passed 100 tests.
  9668. 1320.22 s [vector] indexed: OK
  9669. 1320.22 s [vector] +++ OK, passed 100 tests.
  9670. 1320.22 s [vector] update: OK
  9671. 1320.22 s [vector] +++ OK, passed 100 tests.
  9672. 1320.22 s [vector] mempty: OK
  9673. 1320.22 s [vector] +++ OK, passed 100 tests.
  9674. 1320.22 s [vector] mappend: OK
  9675. 1320.22 s [vector] +++ OK, passed 100 tests.
  9676. 1320.22 s [vector] mconcat: OK (0.03s)
  9677. 1320.22 s [vector] +++ OK, passed 100 tests.
  9678. 1320.22 s [vector] glength: OK
  9679. 1320.22 s [vector] +++ OK, passed 100 tests.
  9680. 1320.22 s [vector] sum: OK
  9681. 1320.22 s [vector] +++ OK, passed 100 tests.
  9682. 1320.22 s [vector] product: OK
  9683. 1320.22 s [vector] +++ OK, passed 100 tests.
  9684. 1320.22 s [vector] enumFromN: OK
  9685. 1320.22 s [vector] +++ OK, passed 100 tests.
  9686. 1320.22 s [vector] enumFromThenN: OK
  9687. 1320.22 s [vector] +++ OK, passed 100 tests.
  9688. 1320.22 s [vector] enumFromTo: OK
  9689. 1320.22 s [vector] +++ OK, passed 100 tests.
  9690. 1320.22 s [vector] enumFromThenTo: OK
  9691. 1320.22 s [vector] +++ OK, passed 100 tests; 5 discarded.
  9692. 1320.22 s [vector] (Int,Bool)
  9693. 1320.22 s [vector] fromList.toList == id: OK
  9694. 1320.22 s [vector] +++ OK, passed 100 tests.
  9695. 1320.22 s [vector] toList.fromList == id: OK
  9696. 1320.22 s [vector] +++ OK, passed 100 tests.
  9697. 1320.22 s [vector] unstream.stream == id: OK
  9698. 1320.22 s [vector] +++ OK, passed 100 tests.
  9699. 1320.22 s [vector] stream.unstream == id: OK
  9700. 1320.22 s [vector] +++ OK, passed 100 tests.
  9701. 1320.22 s [vector] eq: OK
  9702. 1320.22 s [vector] +++ OK, passed 100 tests.
  9703. 1320.22 s [vector] length: OK
  9704. 1320.22 s [vector] +++ OK, passed 100 tests.
  9705. 1320.22 s [vector] null: OK
  9706. 1320.22 s [vector] +++ OK, passed 100 tests.
  9707. 1320.22 s [vector] index: OK
  9708. 1320.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9709. 1320.22 s [vector] safeIndex: OK
  9710. 1320.22 s [vector] +++ OK, passed 100 tests.
  9711. 1320.22 s [vector] head: OK
  9712. 1320.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9713. 1320.22 s [vector] last: OK
  9714. 1320.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9715. 1320.22 s [vector] unsafeIndex: OK
  9716. 1320.22 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9717. 1320.22 s [vector] unsafeHead: OK
  9718. 1320.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9719. 1320.22 s [vector] unsafeLast: OK
  9720. 1320.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9721. 1320.22 s [vector] slice: OK
  9722. 1320.22 s [vector] +++ OK, passed 100 tests.
  9723. 1320.22 s [vector] init: OK
  9724. 1320.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9725. 1320.22 s [vector] tail: OK
  9726. 1320.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9727. 1320.22 s [vector] take: OK
  9728. 1320.22 s [vector] +++ OK, passed 100 tests.
  9729. 1320.22 s [vector] drop: OK
  9730. 1320.22 s [vector] +++ OK, passed 100 tests.
  9731. 1320.22 s [vector] splitAt: OK
  9732. 1320.22 s [vector] +++ OK, passed 100 tests.
  9733. 1320.22 s [vector] empty: OK
  9734. 1320.22 s [vector] +++ OK, passed 100 tests.
  9735. 1320.22 s [vector] singleton: OK
  9736. 1320.22 s [vector] +++ OK, passed 100 tests.
  9737. 1320.22 s [vector] replicate: OK
  9738. 1320.22 s [vector] +++ OK, passed 100 tests.
  9739. 1320.22 s [vector] generate: OK
  9740. 1320.22 s [vector] +++ OK, passed 100 tests.
  9741. 1320.22 s [vector] iterateN: OK
  9742. 1320.22 s [vector] +++ OK, passed 100 tests.
  9743. 1320.22 s [vector] iterateNM: OK (0.04s)
  9744. 1320.22 s [vector] +++ OK, passed 100 tests.
  9745. 1320.22 s [vector] generateM: OK (0.03s)
  9746. 1320.22 s [vector] +++ OK, passed 100 tests.
  9747. 1320.22 s [vector] replicateM: OK (0.01s)
  9748. 1320.22 s [vector] +++ OK, passed 100 tests.
  9749. 1320.22 s [vector] create: OK
  9750. 1320.22 s [vector] +++ OK, passed 100 tests.
  9751. 1320.22 s [vector] createT: OK
  9752. 1320.22 s [vector] +++ OK, passed 100 tests.
  9753. 1320.22 s [vector] unfoldr: OK
  9754. 1320.22 s [vector] +++ OK, passed 100 tests.
  9755. 1320.22 s [vector] unfoldrN: OK
  9756. 1320.22 s [vector] +++ OK, passed 100 tests.
  9757. 1320.22 s [vector] unfoldrExactN: OK
  9758. 1320.22 s [vector] +++ OK, passed 100 tests.
  9759. 1320.22 s [vector] unfoldrM: OK
  9760. 1320.22 s [vector] +++ OK, passed 100 tests.
  9761. 1320.22 s [vector] unfoldrNM: OK
  9762. 1320.22 s [vector] +++ OK, passed 100 tests.
  9763. 1320.27 s [vector] unfoldrExactNM: OK (0.06s)
  9764. 1320.28 s [vector] +++ OK, passed 100 tests.
  9765. 1320.28 s [vector] constructN: OK
  9766. 1320.28 s [vector] +++ OK, passed 100 tests.
  9767. 1320.28 s [vector] constructrN: OK
  9768. 1320.28 s [vector] +++ OK, passed 100 tests.
  9769. 1320.28 s [vector] cons: OK
  9770. 1320.28 s [vector] +++ OK, passed 100 tests.
  9771. 1320.28 s [vector] snoc: OK
  9772. 1320.28 s [vector] +++ OK, passed 100 tests.
  9773. 1320.30 s [vector] append: OK
  9774. 1320.30 s [vector] +++ OK, passed 100 tests.
  9775. 1320.33 s [vector] concat: OK (0.04s)
  9776. 1320.33 s [vector] +++ OK, passed 100 tests.
  9777. 1320.33 s [vector] force: OK
  9778. 1320.33 s [vector] +++ OK, passed 100 tests.
  9779. 1320.34 s [vector] upd: OK
  9780. 1320.34 s [vector] +++ OK, passed 100 tests.
  9781. 1320.34 s [vector] accum: OK
  9782. 1320.35 s [vector] +++ OK, passed 100 tests.
  9783. 1320.36 s [vector] reverse: OK
  9784. 1320.36 s [vector] +++ OK, passed 100 tests.
  9785. 1320.36 s [vector] backpermute: OK
  9786. 1320.36 s [vector] +++ OK, passed 100 tests.
  9787. 1320.36 s [vector] map: OK
  9788. 1320.36 s [vector] +++ OK, passed 100 tests.
  9789. 1320.36 s [vector] imap: OK
  9790. 1320.36 s [vector] +++ OK, passed 100 tests.
  9791. 1320.37 s [vector] concatMap: OK
  9792. 1320.38 s [vector] +++ OK, passed 100 tests.
  9793. 1320.38 s [vector] mapM: OK
  9794. 1320.38 s [vector] +++ OK, passed 100 tests.
  9795. 1320.41 s [vector] mapM_: OK (0.04s)
  9796. 1320.42 s [vector] +++ OK, passed 100 tests.
  9797. 1320.42 s [vector] forM: OK
  9798. 1320.42 s [vector] +++ OK, passed 100 tests.
  9799. 1320.46 s [vector] forM_: OK (0.05s)
  9800. 1320.46 s [vector] +++ OK, passed 100 tests.
  9801. 1320.48 s [vector] imapM: OK
  9802. 1320.48 s [vector] +++ OK, passed 100 tests.
  9803. 1320.50 s [vector] imapM_: OK (0.04s)
  9804. 1320.50 s [vector] +++ OK, passed 100 tests.
  9805. 1320.51 s [vector] zipWith: OK
  9806. 1320.52 s [vector] +++ OK, passed 100 tests.
  9807. 1320.52 s [vector] zipWith3: OK
  9808. 1320.52 s [vector] +++ OK, passed 100 tests.
  9809. 1320.52 s [vector] izipWith: OK
  9810. 1320.52 s [vector] +++ OK, passed 100 tests.
  9811. 1320.53 s [vector] izipWith3: OK
  9812. 1320.54 s [vector] +++ OK, passed 100 tests.
  9813. 1320.54 s [vector] izipWithM: OK
  9814. 1320.54 s [vector] +++ OK, passed 100 tests.
  9815. 1320.56 s [vector] izipWithM_: OK (0.03s)
  9816. 1320.56 s [vector] +++ OK, passed 100 tests.
  9817. 1320.56 s [vector] zipWithM: OK
  9818. 1320.56 s [vector] +++ OK, passed 100 tests.
  9819. 1320.60 s [vector] zipWithM_: OK (0.03s)
  9820. 1320.60 s [vector] +++ OK, passed 100 tests.
  9821. 1320.60 s [vector] filter: OK
  9822. 1320.60 s [vector] +++ OK, passed 100 tests.
  9823. 1320.62 s [vector] ifilter: OK
  9824. 1320.62 s [vector] +++ OK, passed 100 tests.
  9825. 1320.65 s [vector] filterM: OK (0.05s)
  9826. 1320.65 s [vector] +++ OK, passed 100 tests.
  9827. 1320.66 s [vector] uniq: OK
  9828. 1320.66 s [vector] +++ OK, passed 100 tests.
  9829. 1320.66 s [vector] mapMaybe: OK
  9830. 1320.66 s [vector] +++ OK, passed 100 tests.
  9831. 1320.67 s [vector] imapMaybe: OK
  9832. 1320.67 s [vector] +++ OK, passed 100 tests.
  9833. 1320.67 s [vector] takeWhile: OK
  9834. 1320.67 s [vector] +++ OK, passed 100 tests.
  9835. 1320.67 s [vector] dropWhile: OK
  9836. 1320.67 s [vector] +++ OK, passed 100 tests.
  9837. 1320.67 s [vector] partition: OK
  9838. 1320.67 s [vector] +++ OK, passed 100 tests.
  9839. 1320.68 s [vector] partitionWith: OK
  9840. 1320.68 s [vector] +++ OK, passed 100 tests.
  9841. 1320.68 s [vector] span: OK
  9842. 1320.68 s [vector] +++ OK, passed 100 tests.
  9843. 1320.68 s [vector] break: OK
  9844. 1320.68 s [vector] +++ OK, passed 100 tests.
  9845. 1320.69 s [vector] spanR: OK
  9846. 1320.69 s [vector] +++ OK, passed 100 tests.
  9847. 1320.69 s [vector] breakR: OK
  9848. 1320.69 s [vector] +++ OK, passed 100 tests.
  9849. 1320.69 s [vector] groupBy: OK
  9850. 1320.69 s [vector] +++ OK, passed 100 tests.
  9851. 1320.69 s [vector] elem: OK
  9852. 1320.69 s [vector] +++ OK, passed 100 tests.
  9853. 1320.70 s [vector] notElem: OK
  9854. 1320.70 s [vector] +++ OK, passed 100 tests.
  9855. 1320.70 s [vector] find: OK
  9856. 1320.70 s [vector] +++ OK, passed 100 tests.
  9857. 1320.70 s [vector] findIndex: OK
  9858. 1320.71 s [vector] +++ OK, passed 100 tests.
  9859. 1320.71 s [vector] findIndexR: OK
  9860. 1320.72 s [vector] +++ OK, passed 100 tests.
  9861. 1320.72 s [vector] findIndices: OK
  9862. 1320.72 s [vector] +++ OK, passed 100 tests.
  9863. 1320.72 s [vector] elemIndex: OK
  9864. 1320.72 s [vector] +++ OK, passed 100 tests.
  9865. 1320.72 s [vector] elemIndices: OK
  9866. 1320.73 s [vector] +++ OK, passed 100 tests.
  9867. 1320.73 s [vector] foldl: OK
  9868. 1320.74 s [vector] +++ OK, passed 100 tests.
  9869. 1320.74 s [vector] foldl1: OK
  9870. 1320.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9871. 1320.74 s [vector] foldl': OK
  9872. 1320.74 s [vector] +++ OK, passed 100 tests.
  9873. 1320.74 s [vector] foldl1': OK
  9874. 1320.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9875. 1320.74 s [vector] foldr: OK
  9876. 1320.74 s [vector] +++ OK, passed 100 tests.
  9877. 1320.74 s [vector] foldr1: OK
  9878. 1320.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9879. 1320.74 s [vector] foldr': OK
  9880. 1320.74 s [vector] +++ OK, passed 100 tests.
  9881. 1320.75 s [vector] foldr1': OK
  9882. 1320.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9883. 1320.75 s [vector] ifoldl: OK
  9884. 1320.75 s [vector] +++ OK, passed 100 tests.
  9885. 1320.76 s [vector] ifoldl': OK
  9886. 1320.76 s [vector] +++ OK, passed 100 tests.
  9887. 1320.77 s [vector] ifoldr: OK
  9888. 1320.77 s [vector] +++ OK, passed 100 tests.
  9889. 1320.77 s [vector] ifoldr': OK
  9890. 1320.77 s [vector] +++ OK, passed 100 tests.
  9891. 1320.77 s [vector] ifoldM: OK
  9892. 1320.77 s [vector] +++ OK, passed 100 tests.
  9893. 1320.80 s [vector] ifoldM': OK
  9894. 1320.80 s [vector] +++ OK, passed 100 tests.
  9895. 1320.84 s [vector] ifoldM_: OK (0.04s)
  9896. 1320.84 s [vector] +++ OK, passed 100 tests.
  9897. 1320.86 s [vector] ifoldM'_: OK (0.04s)
  9898. 1320.86 s [vector] +++ OK, passed 100 tests.
  9899. 1320.86 s [vector] all: OK
  9900. 1320.86 s [vector] +++ OK, passed 100 tests.
  9901. 1320.86 s [vector] any: OK
  9902. 1320.86 s [vector] +++ OK, passed 100 tests.
  9903. 1320.88 s [vector] prescanl: OK (0.01s)
  9904. 1320.88 s [vector] +++ OK, passed 100 tests.
  9905. 1320.88 s [vector] prescanl': OK
  9906. 1320.88 s [vector] +++ OK, passed 100 tests.
  9907. 1320.90 s [vector] postscanl: OK
  9908. 1320.90 s [vector] +++ OK, passed 100 tests.
  9909. 1320.91 s [vector] postscanl': OK
  9910. 1320.92 s [vector] +++ OK, passed 100 tests.
  9911. 1320.92 s [vector] scanl: OK
  9912. 1320.92 s [vector] +++ OK, passed 100 tests.
  9913. 1320.92 s [vector] scanl': OK
  9914. 1320.92 s [vector] +++ OK, passed 100 tests.
  9915. 1320.93 s [vector] scanl1: OK
  9916. 1320.93 s [vector] +++ OK, passed 100 tests.
  9917. 1320.93 s [vector] scanl1': OK
  9918. 1320.93 s [vector] +++ OK, passed 100 tests.
  9919. 1320.93 s [vector] iscanl: OK
  9920. 1320.94 s [vector] +++ OK, passed 100 tests.
  9921. 1320.95 s [vector] iscanl': OK
  9922. 1320.95 s [vector] +++ OK, passed 100 tests.
  9923. 1320.96 s [vector] prescanr: OK
  9924. 1320.96 s [vector] +++ OK, passed 100 tests.
  9925. 1320.96 s [vector] prescanr': OK
  9926. 1320.97 s [vector] +++ OK, passed 100 tests.
  9927. 1320.98 s [vector] postscanr: OK
  9928. 1320.98 s [vector] +++ OK, passed 100 tests.
  9929. 1320.98 s [vector] postscanr': OK
  9930. 1320.98 s [vector] +++ OK, passed 100 tests.
  9931. 1320.98 s [vector] scanr: OK
  9932. 1320.98 s [vector] +++ OK, passed 100 tests.
  9933. 1320.98 s [vector] scanr': OK
  9934. 1320.98 s [vector] +++ OK, passed 100 tests.
  9935. 1320.99 s [vector] scanr1: OK
  9936. 1320.99 s [vector] +++ OK, passed 100 tests.
  9937. 1321.00 s [vector] scanr1': OK
  9938. 1321.00 s [vector] +++ OK, passed 100 tests.
  9939. 1321.00 s [vector] iscanr: OK
  9940. 1321.00 s [vector] +++ OK, passed 100 tests.
  9941. 1321.01 s [vector] iscanr': OK
  9942. 1321.01 s [vector] +++ OK, passed 100 tests.
  9943. 1321.01 s [vector] mut_read: OK
  9944. 1321.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9945. 1321.01 s [vector] mut_write: OK
  9946. 1321.01 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9947. 1321.02 s [vector] mut_modify: OK
  9948. 1321.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9949. 1321.02 s [vector] mut_generate: OK
  9950. 1321.02 s [vector] +++ OK, passed 100 tests.
  9951. 1321.04 s [vector] mut_generateM: OK (0.02s)
  9952. 1321.04 s [vector] +++ OK, passed 100 tests.
  9953. 1321.08 s [vector] mut_mapM_: OK (0.03s)
  9954. 1321.08 s [vector] +++ OK, passed 100 tests.
  9955. 1321.10 s [vector] mut_imapM_: OK (0.03s)
  9956. 1321.10 s [vector] +++ OK, passed 100 tests.
  9957. 1321.14 s [vector] mut_forM_: OK (0.02s)
  9958. 1321.14 s [vector] +++ OK, passed 100 tests.
  9959. 1321.17 s [vector] mut_iforM_: OK (0.04s)
  9960. 1321.18 s [vector] +++ OK, passed 100 tests.
  9961. 1321.18 s [vector] mut_foldr: OK
  9962. 1321.18 s [vector] +++ OK, passed 100 tests.
  9963. 1321.18 s [vector] mut_foldr': OK
  9964. 1321.18 s [vector] +++ OK, passed 100 tests.
  9965. 1321.19 s [vector] mut_foldl: OK
  9966. 1321.19 s [vector] +++ OK, passed 100 tests.
  9967. 1321.19 s [vector] mut_foldl': OK
  9968. 1321.19 s [vector] +++ OK, passed 100 tests.
  9969. 1321.20 s [vector] mut_ifoldr: OK
  9970. 1321.20 s [vector] +++ OK, passed 100 tests.
  9971. 1321.20 s [vector] mut_ifoldr': OK
  9972. 1321.20 s [vector] +++ OK, passed 100 tests.
  9973. 1321.21 s [vector] mut_ifoldl: OK
  9974. 1321.21 s [vector] +++ OK, passed 100 tests.
  9975. 1321.22 s [vector] mut_ifoldl': OK
  9976. 1321.22 s [vector] +++ OK, passed 100 tests.
  9977. 1321.22 s [vector] mut_foldM: OK
  9978. 1321.22 s [vector] +++ OK, passed 100 tests.
  9979. 1321.24 s [vector] mut_foldM': OK
  9980. 1321.24 s [vector] +++ OK, passed 100 tests.
  9981. 1321.24 s [vector] mut_foldrM: OK
  9982. 1321.24 s [vector] +++ OK, passed 100 tests.
  9983. 1321.24 s [vector] mut_foldrM': OK
  9984. 1321.25 s [vector] +++ OK, passed 100 tests.
  9985. 1321.26 s [vector] mut_ifoldM: OK
  9986. 1321.26 s [vector] +++ OK, passed 100 tests.
  9987. 1321.26 s [vector] mut_ifoldM': OK
  9988. 1321.26 s [vector] +++ OK, passed 100 tests.
  9989. 1321.27 s [vector] mut_ifoldrM: OK
  9990. 1321.27 s [vector] +++ OK, passed 100 tests.
  9991. 1321.27 s [vector] mut_ifoldrM': OK
  9992. 1321.27 s [vector] +++ OK, passed 100 tests.
  9993. 1321.27 s [vector] compare: OK
  9994. 1321.27 s [vector] +++ OK, passed 100 tests.
  9995. 1321.27 s [vector] maximum: OK
  9996. 1321.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9997. 1321.27 s [vector] minimum: OK
  9998. 1321.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9999. 1321.28 s [vector] minIndex: OK
  10000. 1321.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10001. 1321.28 s [vector] maxIndex: OK
  10002. 1321.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10003. 1321.28 s [vector] maximumBy: OK
  10004. 1321.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10005. 1321.28 s [vector] minimumBy: OK
  10006. 1321.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10007. 1321.28 s [vector] maximumOn: OK
  10008. 1321.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10009. 1321.28 s [vector] minimumOn: OK
  10010. 1321.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10011. 1321.28 s [vector] maxIndexBy: OK
  10012. 1321.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10013. 1321.29 s [vector] minIndexBy: OK
  10014. 1321.29 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10015. 1321.29 s [vector] ListFirstMaxIndexWins: OK
  10016. 1321.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10017. 1321.29 s [vector] FalseListFirstMaxIndexWins: OK
  10018. 1321.29 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10019. 1321.29 s [vector] []
  10020. 1321.29 s [vector] zip: OK
  10021. 1321.29 s [vector] +++ OK, passed 100 tests.
  10022. 1321.29 s [vector] zip3: OK
  10023. 1321.30 s [vector] +++ OK, passed 100 tests.
  10024. 1321.30 s [vector] unzip: OK
  10025. 1321.30 s [vector] +++ OK, passed 100 tests.
  10026. 1321.31 s [vector] unzip3: OK
  10027. 1321.31 s [vector] +++ OK, passed 100 tests.
  10028. 1321.31 s [vector] indexed: OK
  10029. 1321.31 s [vector] +++ OK, passed 100 tests.
  10030. 1321.31 s [vector] update: OK
  10031. 1321.31 s [vector] +++ OK, passed 100 tests.
  10032. 1321.31 s [vector] mempty: OK
  10033. 1321.31 s [vector] +++ OK, passed 100 tests.
  10034. 1321.32 s [vector] mappend: OK
  10035. 1321.32 s [vector] +++ OK, passed 100 tests.
  10036. 1321.36 s [vector] mconcat: OK (0.02s)
  10037. 1321.36 s [vector] +++ OK, passed 100 tests.
  10038. 1321.36 s [vector] glength: OK
  10039. 1321.36 s [vector] +++ OK, passed 100 tests.
  10040. 1321.36 s [vector] (Int,Bool,Int)
  10041. 1321.36 s [vector] fromList.toList == id: OK
  10042. 1321.36 s [vector] +++ OK, passed 100 tests.
  10043. 1321.36 s [vector] toList.fromList == id: OK
  10044. 1321.36 s [vector] +++ OK, passed 100 tests.
  10045. 1321.36 s [vector] unstream.stream == id: OK
  10046. 1321.36 s [vector] +++ OK, passed 100 tests.
  10047. 1321.36 s [vector] stream.unstream == id: OK
  10048. 1321.36 s [vector] +++ OK, passed 100 tests.
  10049. 1321.37 s [vector] eq: OK
  10050. 1321.37 s [vector] +++ OK, passed 100 tests.
  10051. 1321.37 s [vector] length: OK
  10052. 1321.37 s [vector] +++ OK, passed 100 tests.
  10053. 1321.37 s [vector] null: OK
  10054. 1321.37 s [vector] +++ OK, passed 100 tests.
  10055. 1321.37 s [vector] index: OK
  10056. 1321.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10057. 1321.38 s [vector] safeIndex: OK
  10058. 1321.38 s [vector] +++ OK, passed 100 tests.
  10059. 1321.38 s [vector] head: OK
  10060. 1321.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10061. 1321.39 s [vector] last: OK
  10062. 1321.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10063. 1321.39 s [vector] unsafeIndex: OK
  10064. 1321.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10065. 1321.39 s [vector] unsafeHead: OK
  10066. 1321.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10067. 1321.39 s [vector] unsafeLast: OK
  10068. 1321.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10069. 1321.39 s [vector] slice: OK
  10070. 1321.39 s [vector] +++ OK, passed 100 tests.
  10071. 1321.39 s [vector] init: OK
  10072. 1321.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10073. 1321.39 s [vector] tail: OK
  10074. 1321.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10075. 1321.39 s [vector] take: OK
  10076. 1321.39 s [vector] +++ OK, passed 100 tests.
  10077. 1321.39 s [vector] drop: OK
  10078. 1321.39 s [vector] +++ OK, passed 100 tests.
  10079. 1321.39 s [vector] splitAt: OK
  10080. 1321.39 s [vector] +++ OK, passed 100 tests.
  10081. 1321.39 s [vector] empty: OK
  10082. 1321.39 s [vector] +++ OK, passed 100 tests.
  10083. 1321.40 s [vector] singleton: OK
  10084. 1321.40 s [vector] +++ OK, passed 100 tests.
  10085. 1321.40 s [vector] replicate: OK
  10086. 1321.42 s [vector] +++ OK, passed 100 tests.
  10087. 1321.42 s [vector] generate: OK
  10088. 1321.42 s [vector] +++ OK, passed 100 tests.
  10089. 1321.42 s [vector] iterateN: OK
  10090. 1321.42 s [vector] +++ OK, passed 100 tests.
  10091. 1321.46 s [vector] iterateNM: OK (0.05s)
  10092. 1321.46 s [vector] +++ OK, passed 100 tests.
  10093. 1321.51 s [vector] generateM: OK (0.05s)
  10094. 1321.52 s [vector] +++ OK, passed 100 tests.
  10095. 1321.52 s [vector] replicateM: OK (0.01s)
  10096. 1321.52 s [vector] +++ OK, passed 100 tests.
  10097. 1321.52 s [vector] create: OK
  10098. 1321.52 s [vector] +++ OK, passed 100 tests.
  10099. 1321.52 s [vector] createT: OK
  10100. 1321.52 s [vector] +++ OK, passed 100 tests.
  10101. 1321.52 s [vector] unfoldr: OK
  10102. 1321.52 s [vector] +++ OK, passed 100 tests.
  10103. 1321.52 s [vector] unfoldrN: OK
  10104. 1321.52 s [vector] +++ OK, passed 100 tests.
  10105. 1321.52 s [vector] unfoldrExactN: OK
  10106. 1321.54 s [vector] +++ OK, passed 100 tests.
  10107. 1321.54 s [vector] unfoldrM: OK
  10108. 1321.54 s [vector] +++ OK, passed 100 tests.
  10109. 1321.56 s [vector] unfoldrNM: OK (0.02s)
  10110. 1321.56 s [vector] +++ OK, passed 100 tests.
  10111. 1321.59 s [vector] unfoldrExactNM: OK (0.03s)
  10112. 1321.60 s [vector] +++ OK, passed 100 tests.
  10113. 1321.60 s [vector] constructN: OK
  10114. 1321.60 s [vector] +++ OK, passed 100 tests.
  10115. 1321.60 s [vector] constructrN: OK
  10116. 1321.61 s [vector] +++ OK, passed 100 tests.
  10117. 1321.62 s [vector] cons: OK
  10118. 1321.62 s [vector] +++ OK, passed 100 tests.
  10119. 1321.62 s [vector] snoc: OK
  10120. 1321.62 s [vector] +++ OK, passed 100 tests.
  10121. 1321.62 s [vector] append: OK
  10122. 1321.62 s [vector] +++ OK, passed 100 tests.
  10123. 1321.66 s [vector] concat: OK (0.05s)
  10124. 1321.66 s [vector] +++ OK, passed 100 tests.
  10125. 1321.68 s [vector] force: OK
  10126. 1321.68 s [vector] +++ OK, passed 100 tests.
  10127. 1321.68 s [vector] upd: OK
  10128. 1321.68 s [vector] +++ OK, passed 100 tests.
  10129. 1321.69 s [vector] accum: OK (0.01s)
  10130. 1321.70 s [vector] +++ OK, passed 100 tests.
  10131. 1321.70 s [vector] reverse: OK
  10132. 1321.70 s [vector] +++ OK, passed 100 tests.
  10133. 1321.70 s [vector] backpermute: OK
  10134. 1321.70 s [vector] +++ OK, passed 100 tests.
  10135. 1321.70 s [vector] map: OK
  10136. 1321.70 s [vector] +++ OK, passed 100 tests.
  10137. 1321.70 s [vector] imap: OK
  10138. 1321.70 s [vector] +++ OK, passed 100 tests.
  10139. 1321.71 s [vector] concatMap: OK
  10140. 1321.71 s [vector] +++ OK, passed 100 tests.
  10141. 1321.72 s [vector] mapM: OK
  10142. 1321.72 s [vector] +++ OK, passed 100 tests.
  10143. 1321.76 s [vector] mapM_: OK (0.04s)
  10144. 1321.76 s [vector] +++ OK, passed 100 tests.
  10145. 1321.76 s [vector] forM: OK
  10146. 1321.76 s [vector] +++ OK, passed 100 tests.
  10147. 1321.82 s [vector] forM_: OK (0.05s)
  10148. 1321.82 s [vector] +++ OK, passed 100 tests.
  10149. 1321.84 s [vector] imapM: OK
  10150. 1321.84 s [vector] +++ OK, passed 100 tests.
  10151. 1321.90 s [vector] imapM_: OK (0.07s)
  10152. 1321.90 s [vector] +++ OK, passed 100 tests.
  10153. 1321.90 s [vector] zipWith: OK
  10154. 1321.90 s [vector] +++ OK, passed 100 tests.
  10155. 1321.91 s [vector] zipWith3: OK
  10156. 1321.92 s [vector] +++ OK, passed 100 tests.
  10157. 1321.92 s [vector] izipWith: OK
  10158. 1321.92 s [vector] +++ OK, passed 100 tests.
  10159. 1321.93 s [vector] izipWith3: OK (0.01s)
  10160. 1321.93 s [vector] +++ OK, passed 100 tests.
  10161. 1321.94 s [vector] izipWithM: OK (0.01s)
  10162. 1321.95 s [vector] +++ OK, passed 100 tests.
  10163. 1321.98 s [vector] izipWithM_: OK (0.04s)
  10164. 1321.98 s [vector] +++ OK, passed 100 tests.
  10165. 1321.99 s [vector] zipWithM: OK
  10166. 1322.00 s [vector] +++ OK, passed 100 tests.
  10167. 1322.03 s [vector] zipWithM_: OK (0.04s)
  10168. 1322.04 s [vector] +++ OK, passed 100 tests.
  10169. 1322.04 s [vector] filter: OK
  10170. 1322.06 s [vector] +++ OK, passed 100 tests.
  10171. 1322.06 s [vector] ifilter: OK
  10172. 1322.06 s [vector] +++ OK, passed 100 tests.
  10173. 1322.12 s [vector] filterM: OK (0.07s)
  10174. 1322.12 s [vector] +++ OK, passed 100 tests.
  10175. 1322.12 s [vector] uniq: OK
  10176. 1322.12 s [vector] +++ OK, passed 100 tests.
  10177. 1322.12 s [vector] mapMaybe: OK
  10178. 1322.12 s [vector] +++ OK, passed 100 tests.
  10179. 1322.13 s [vector] imapMaybe: OK
  10180. 1322.13 s [vector] +++ OK, passed 100 tests.
  10181. 1322.14 s [vector] takeWhile: OK
  10182. 1322.14 s [vector] +++ OK, passed 100 tests.
  10183. 1322.14 s [vector] dropWhile: OK
  10184. 1322.14 s [vector] +++ OK, passed 100 tests.
  10185. 1322.15 s [vector] partition: OK
  10186. 1322.15 s [vector] +++ OK, passed 100 tests.
  10187. 1322.15 s [vector] partitionWith: OK
  10188. 1322.15 s [vector] +++ OK, passed 100 tests.
  10189. 1322.15 s [vector] span: OK
  10190. 1322.16 s [vector] +++ OK, passed 100 tests.
  10191. 1322.16 s [vector] break: OK
  10192. 1322.16 s [vector] +++ OK, passed 100 tests.
  10193. 1322.16 s [vector] spanR: OK
  10194. 1322.17 s [vector] +++ OK, passed 100 tests.
  10195. 1322.17 s [vector] breakR: OK
  10196. 1322.17 s [vector] +++ OK, passed 100 tests.
  10197. 1322.17 s [vector] groupBy: OK
  10198. 1322.17 s [vector] +++ OK, passed 100 tests.
  10199. 1322.17 s [vector] elem: OK
  10200. 1322.18 s [vector] +++ OK, passed 100 tests.
  10201. 1322.18 s [vector] notElem: OK
  10202. 1322.18 s [vector] +++ OK, passed 100 tests.
  10203. 1322.18 s [vector] find: OK
  10204. 1322.18 s [vector] +++ OK, passed 100 tests.
  10205. 1322.18 s [vector] findIndex: OK
  10206. 1322.18 s [vector] +++ OK, passed 100 tests.
  10207. 1322.18 s [vector] findIndexR: OK
  10208. 1322.18 s [vector] +++ OK, passed 100 tests.
  10209. 1322.18 s [vector] findIndices: OK
  10210. 1322.18 s [vector] +++ OK, passed 100 tests.
  10211. 1322.19 s [vector] elemIndex: OK
  10212. 1322.19 s [vector] +++ OK, passed 100 tests.
  10213. 1322.19 s [vector] elemIndices: OK
  10214. 1322.19 s [vector] +++ OK, passed 100 tests.
  10215. 1322.20 s [vector] foldl: OK
  10216. 1322.20 s [vector] +++ OK, passed 100 tests.
  10217. 1322.21 s [vector] foldl1: OK
  10218. 1322.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10219. 1322.21 s [vector] foldl': OK
  10220. 1322.21 s [vector] +++ OK, passed 100 tests.
  10221. 1322.21 s [vector] foldl1': OK
  10222. 1322.22 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10223. 1322.23 s [vector] foldr: OK
  10224. 1322.23 s [vector] +++ OK, passed 100 tests.
  10225. 1322.24 s [vector] foldr1: OK
  10226. 1322.24 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10227. 1322.26 s [vector] foldr': OK
  10228. 1322.26 s [vector] +++ OK, passed 100 tests.
  10229. 1322.26 s [vector] foldr1': OK
  10230. 1322.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10231. 1322.27 s [vector] ifoldl: OK
  10232. 1322.27 s [vector] +++ OK, passed 100 tests.
  10233. 1322.28 s [vector] ifoldl': OK
  10234. 1322.28 s [vector] +++ OK, passed 100 tests.
  10235. 1322.28 s [vector] ifoldr: OK
  10236. 1322.28 s [vector] +++ OK, passed 100 tests.
  10237. 1322.28 s [vector] ifoldr': OK
  10238. 1322.28 s [vector] +++ OK, passed 100 tests.
  10239. 1322.29 s [vector] ifoldM: OK
  10240. 1322.29 s [vector] +++ OK, passed 100 tests.
  10241. 1322.30 s [vector] ifoldM': OK
  10242. 1322.30 s [vector] +++ OK, passed 100 tests.
  10243. 1322.36 s [vector] ifoldM_: OK (0.05s)
  10244. 1322.36 s [vector] +++ OK, passed 100 tests.
  10245. 1322.40 s [vector] ifoldM'_: OK (0.05s)
  10246. 1322.40 s [vector] +++ OK, passed 100 tests.
  10247. 1322.42 s [vector] all: OK
  10248. 1322.42 s [vector] +++ OK, passed 100 tests.
  10249. 1322.42 s [vector] any: OK
  10250. 1322.42 s [vector] +++ OK, passed 100 tests.
  10251. 1322.42 s [vector] prescanl: OK
  10252. 1322.42 s [vector] +++ OK, passed 100 tests.
  10253. 1322.43 s [vector] prescanl': OK
  10254. 1322.44 s [vector] +++ OK, passed 100 tests.
  10255. 1322.44 s [vector] postscanl: OK (0.01s)
  10256. 1322.44 s [vector] +++ OK, passed 100 tests.
  10257. 1322.44 s [vector] postscanl': OK
  10258. 1322.44 s [vector] +++ OK, passed 100 tests.
  10259. 1322.46 s [vector] scanl: OK (0.01s)
  10260. 1322.46 s [vector] +++ OK, passed 100 tests.
  10261. 1322.47 s [vector] scanl': OK (0.01s)
  10262. 1322.48 s [vector] +++ OK, passed 100 tests.
  10263. 1322.48 s [vector] scanl1: OK (0.01s)
  10264. 1322.48 s [vector] +++ OK, passed 100 tests.
  10265. 1322.50 s [vector] scanl1': OK (0.01s)
  10266. 1322.50 s [vector] +++ OK, passed 100 tests.
  10267. 1322.51 s [vector] iscanl: OK (0.02s)
  10268. 1322.52 s [vector] +++ OK, passed 100 tests.
  10269. 1322.52 s [vector] iscanl': OK (0.01s)
  10270. 1322.52 s [vector] +++ OK, passed 100 tests.
  10271. 1322.54 s [vector] prescanr: OK (0.02s)
  10272. 1322.54 s [vector] +++ OK, passed 100 tests.
  10273. 1322.56 s [vector] prescanr': OK (0.02s)
  10274. 1322.56 s [vector] +++ OK, passed 100 tests.
  10275. 1322.57 s [vector] postscanr: OK (0.01s)
  10276. 1322.57 s [vector] +++ OK, passed 100 tests.
  10277. 1322.57 s [vector] postscanr': OK (0.01s)
  10278. 1322.57 s [vector] +++ OK, passed 100 tests.
  10279. 1322.60 s [vector] scanr: OK (0.01s)
  10280. 1322.60 s [vector] +++ OK, passed 100 tests.
  10281. 1322.61 s [vector] scanr': OK (0.02s)
  10282. 1322.62 s [vector] +++ OK, passed 100 tests.
  10283. 1322.62 s [vector] scanr1: OK
  10284. 1322.62 s [vector] +++ OK, passed 100 tests.
  10285. 1322.63 s [vector] scanr1': OK (0.01s)
  10286. 1322.63 s [vector] +++ OK, passed 100 tests.
  10287. 1322.64 s [vector] iscanr: OK (0.01s)
  10288. 1322.64 s [vector] +++ OK, passed 100 tests.
  10289. 1322.65 s [vector] iscanr': OK (0.01s)
  10290. 1322.65 s [vector] +++ OK, passed 100 tests.
  10291. 1322.65 s [vector] mut_read: OK
  10292. 1322.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10293. 1322.65 s [vector] mut_write: OK
  10294. 1322.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10295. 1322.66 s [vector] mut_modify: OK
  10296. 1322.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10297. 1322.68 s [vector] mut_generate: OK
  10298. 1322.68 s [vector] +++ OK, passed 100 tests.
  10299. 1322.72 s [vector] mut_generateM: OK (0.04s)
  10300. 1322.72 s [vector] +++ OK, passed 100 tests.
  10301. 1322.76 s [vector] mut_mapM_: OK (0.05s)
  10302. 1322.76 s [vector] +++ OK, passed 100 tests.
  10303. 1322.82 s [vector] mut_imapM_: OK (0.05s)
  10304. 1322.82 s [vector] +++ OK, passed 100 tests.
  10305. 1322.86 s [vector] mut_forM_: OK (0.05s)
  10306. 1322.86 s [vector] +++ OK, passed 100 tests.
  10307. 1322.94 s [vector] mut_iforM_: OK (0.09s)
  10308. 1322.94 s [vector] +++ OK, passed 100 tests.
  10309. 1322.96 s [vector] mut_foldr: OK (0.01s)
  10310. 1322.96 s [vector] +++ OK, passed 100 tests.
  10311. 1322.96 s [vector] mut_foldr': OK
  10312. 1322.96 s [vector] +++ OK, passed 100 tests.
  10313. 1322.98 s [vector] mut_foldl: OK
  10314. 1322.98 s [vector] +++ OK, passed 100 tests.
  10315. 1322.99 s [vector] mut_foldl': OK (0.01s)
  10316. 1322.99 s [vector] +++ OK, passed 100 tests.
  10317. 1323.00 s [vector] mut_ifoldr: OK (0.02s)
  10318. 1323.00 s [vector] +++ OK, passed 100 tests.
  10319. 1323.02 s [vector] mut_ifoldr': OK (0.01s)
  10320. 1323.02 s [vector] +++ OK, passed 100 tests.
  10321. 1323.04 s [vector] mut_ifoldl: OK (0.02s)
  10322. 1323.04 s [vector] +++ OK, passed 100 tests.
  10323. 1323.06 s [vector] mut_ifoldl': OK (0.02s)
  10324. 1323.06 s [vector] +++ OK, passed 100 tests.
  10325. 1323.06 s [vector] mut_foldM: OK (0.01s)
  10326. 1323.06 s [vector] +++ OK, passed 100 tests.
  10327. 1323.08 s [vector] mut_foldM': OK (0.02s)
  10328. 1323.08 s [vector] +++ OK, passed 100 tests.
  10329. 1323.10 s [vector] mut_foldrM: OK (0.01s)
  10330. 1323.10 s [vector] +++ OK, passed 100 tests.
  10331. 1323.11 s [vector] mut_foldrM': OK (0.01s)
  10332. 1323.12 s [vector] +++ OK, passed 100 tests.
  10333. 1323.12 s [vector] mut_ifoldM: OK (0.01s)
  10334. 1323.12 s [vector] +++ OK, passed 100 tests.
  10335. 1323.14 s [vector] mut_ifoldM': OK (0.02s)
  10336. 1323.14 s [vector] +++ OK, passed 100 tests.
  10337. 1323.15 s [vector] mut_ifoldrM: OK (0.01s)
  10338. 1323.15 s [vector] +++ OK, passed 100 tests.
  10339. 1323.15 s [vector] mut_ifoldrM': OK (0.01s)
  10340. 1323.15 s [vector] +++ OK, passed 100 tests.
  10341. 1323.16 s [vector] compare: OK
  10342. 1323.16 s [vector] +++ OK, passed 100 tests.
  10343. 1323.16 s [vector] maximum: OK
  10344. 1323.16 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10345. 1323.16 s [vector] minimum: OK
  10346. 1323.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10347. 1323.16 s [vector] minIndex: OK
  10348. 1323.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10349. 1323.16 s [vector] maxIndex: OK
  10350. 1323.16 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10351. 1323.16 s [vector] maximumBy: OK
  10352. 1323.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10353. 1323.16 s [vector] minimumBy: OK
  10354. 1323.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10355. 1323.17 s [vector] maximumOn: OK
  10356. 1323.17 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10357. 1323.17 s [vector] minimumOn: OK
  10358. 1323.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10359. 1323.17 s [vector] maxIndexBy: OK
  10360. 1323.17 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10361. 1323.17 s [vector] minIndexBy: OK
  10362. 1323.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10363. 1323.17 s [vector] ListFirstMaxIndexWins: OK
  10364. 1323.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10365. 1323.18 s [vector] FalseListFirstMaxIndexWins: OK
  10366. 1323.18 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10367. 1323.18 s [vector] []
  10368. 1323.18 s [vector] zip: OK
  10369. 1323.18 s [vector] +++ OK, passed 100 tests.
  10370. 1323.19 s [vector] zip3: OK
  10371. 1323.20 s [vector] +++ OK, passed 100 tests.
  10372. 1323.20 s [vector] unzip: OK
  10373. 1323.20 s [vector] +++ OK, passed 100 tests.
  10374. 1323.21 s [vector] unzip3: OK (0.01s)
  10375. 1323.21 s [vector] +++ OK, passed 100 tests.
  10376. 1323.21 s [vector] indexed: OK
  10377. 1323.22 s [vector] +++ OK, passed 100 tests.
  10378. 1323.22 s [vector] update: OK
  10379. 1323.22 s [vector] +++ OK, passed 100 tests.
  10380. 1323.22 s [vector] mempty: OK
  10381. 1323.22 s [vector] +++ OK, passed 100 tests.
  10382. 1323.23 s [vector] mappend: OK
  10383. 1323.23 s [vector] +++ OK, passed 100 tests.
  10384. 1323.28 s [vector] mconcat: OK (0.07s)
  10385. 1323.28 s [vector] +++ OK, passed 100 tests.
  10386. 1323.28 s [vector] glength: OK
  10387. 1323.28 s [vector] +++ OK, passed 100 tests.
  10388. 1323.28 s [vector] unstream
  10389. 1323.29 s [vector] unstream == vunstream (exact): OK
  10390. 1323.29 s [vector] +++ OK, passed 100 tests.
  10391. 1323.29 s [vector] unstream == vunstream (unknown): OK
  10392. 1323.29 s [vector] +++ OK, passed 100 tests.
  10393. 1323.29 s [vector] unstreamR ~= vunstream (exact): OK
  10394. 1323.29 s [vector] +++ OK, passed 100 tests.
  10395. 1323.29 s [vector] unstreamR ~= vunstream (unknown): OK
  10396. 1323.29 s [vector] +++ OK, passed 100 tests.
  10397. 1323.29 s [vector] Data.Vector.Storable.Vector Alignment
  10398. 1323.29 s [vector] Aligned Double: OK
  10399. 1323.29 s [vector] Aligned Int: OK
  10400. 1323.29 s [vector] Regression tests
  10401. 1323.29 s [vector] enumFromTo crash #188
  10402. 1323.29 s [vector] Word8: OK
  10403. 1323.29 s [vector] Word16: OK
  10404. 1323.29 s [vector] Word32: OK
  10405. 1323.29 s [vector] Word64: OK
  10406. 1323.29 s [vector] Word: OK
  10407. 1323.29 s [vector] Int8: OK
  10408. 1323.29 s [vector] Int16: OK
  10409. 1323.29 s [vector] Int32: OK
  10410. 1323.29 s [vector] Int64: OK
  10411. 1323.29 s [vector] Int: OK
  10412. 1323.29 s [vector] Char: OK
  10413. 1323.29 s [vector] Negative tests
  10414. 1323.29 s [vector] slice out of bounds #257
  10415. 1323.29 s [vector] Boxed
  10416. 1323.29 s [vector] Negative ix: OK
  10417. 1323.29 s [vector] Negative size: OK
  10418. 1323.29 s [vector] Negative ix and size: OK
  10419. 1323.29 s [vector] Too large ix: OK
  10420. 1323.29 s [vector] Too large size: OK
  10421. 1323.29 s [vector] Too large ix and size: OK
  10422. 1323.29 s [vector] Overflow: OK
  10423. 1323.29 s [vector] OutOfMemory: OK
  10424. 1323.29 s [vector] Primitive
  10425. 1323.29 s [vector] Negative ix: OK
  10426. 1323.29 s [vector] Negative size: OK
  10427. 1323.29 s [vector] Negative ix and size: OK
  10428. 1323.29 s [vector] Too large ix: OK
  10429. 1323.29 s [vector] Too large size: OK
  10430. 1323.29 s [vector] Too large ix and size: OK
  10431. 1323.29 s [vector] Overflow: OK
  10432. 1323.29 s [vector] OutOfMemory: OK
  10433. 1323.29 s [vector] Storable
  10434. 1323.29 s [vector] Negative ix: OK
  10435. 1323.29 s [vector] Negative size: OK
  10436. 1323.29 s [vector] Negative ix and size: OK
  10437. 1323.29 s [vector] Too large ix: OK
  10438. 1323.29 s [vector] Too large size: OK
  10439. 1323.29 s [vector] Too large ix and size: OK
  10440. 1323.29 s [vector] Overflow: OK
  10441. 1323.29 s [vector] OutOfMemory: OK
  10442. 1323.29 s [vector] Unboxed
  10443. 1323.29 s [vector] Negative ix: OK
  10444. 1323.29 s [vector] Negative size: OK
  10445. 1323.29 s [vector] Negative ix and size: OK
  10446. 1323.29 s [vector] Too large ix: OK
  10447. 1323.29 s [vector] Too large size: OK
  10448. 1323.29 s [vector] Too large ix and size: OK
  10449. 1323.29 s [vector] Overflow: OK
  10450. 1323.29 s [vector] OutOfMemory: OK
  10451. 1323.29 s [vector] take #282
  10452. 1323.29 s [vector] Boxed: OK
  10453. 1323.29 s [vector] Primitive: OK
  10454. 1323.29 s [vector] Storable: OK
  10455. 1323.29 s [vector] Unboxed: OK
  10456. 1323.29 s [vector] Data.Vector
  10457. 1323.29 s [vector] MonadFix: OK
  10458. 1323.30 s [vector] toFromArray: OK
  10459. 1323.30 s [vector] toFromArraySlice: OK
  10460. 1323.30 s [vector] toFromArraySliceUnsafe: OK
  10461. 1323.30 s [vector] toFromMutableArray: OK
  10462. 1323.31 s [vector] Data.Vector.Mutable (Move): OK
  10463. 1323.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10464. 1323.31 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  10465. 1323.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10466. 1323.31 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  10467. 1323.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10468. 1323.35 s [vector] Data.Vector.Storable.Mutable (Move): OK
  10469. 1323.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10470. 1323.36 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  10471. 1323.36 s [vector] +++ OK, passed 100 tests.
  10472. 1323.36 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.03s)
  10473. 1323.36 s [vector] +++ OK, passed 100 tests.
  10474. 1323.36 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  10475. 1323.36 s [vector] +++ OK, passed 100 tests.
  10476. 1323.36 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  10477. 1323.36 s [vector] +++ OK, passed 100 tests.
  10478. 1323.36 s [vector]
  10479. 1323.36 s [vector] All 2808 tests passed (17.95s)
  10480. 1323.37 s [vector] Test suite vector-tests-O0: PASS
  10481. 1323.37 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  10482. 1323.37 s [vector] Test suite vector-tests-O2: RUNNING...
  10483. 1323.63 s [vector] toplevel
  10484. 1323.63 s [vector] Data.Vector.Fusion.Bundle
  10485. 1323.63 s [vector] fromList.toList == id: OK
  10486. 1323.63 s [vector] +++ OK, passed 100 tests.
  10487. 1323.65 s [vector] toList.fromList == id: OK
  10488. 1323.65 s [vector] +++ OK, passed 100 tests.
  10489. 1323.65 s [vector] eq: OK
  10490. 1323.65 s [vector] +++ OK, passed 100 tests.
  10491. 1323.65 s [vector] length: OK
  10492. 1323.65 s [vector] +++ OK, passed 100 tests.
  10493. 1323.67 s [vector] null: OK
  10494. 1323.67 s [vector] +++ OK, passed 100 tests.
  10495. 1323.67 s [vector] empty: OK
  10496. 1323.67 s [vector] +++ OK, passed 100 tests.
  10497. 1323.67 s [vector] singleton: OK
  10498. 1323.67 s [vector] +++ OK, passed 100 tests.
  10499. 1323.67 s [vector] replicate: OK
  10500. 1323.67 s [vector] +++ OK, passed 100 tests.
  10501. 1323.67 s [vector] cons: OK
  10502. 1323.67 s [vector] +++ OK, passed 100 tests.
  10503. 1323.67 s [vector] snoc: OK
  10504. 1323.67 s [vector] +++ OK, passed 100 tests.
  10505. 1323.68 s [vector] append: OK
  10506. 1323.68 s [vector] +++ OK, passed 100 tests.
  10507. 1323.68 s [vector] head: OK
  10508. 1323.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10509. 1323.68 s [vector] last: OK
  10510. 1323.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10511. 1323.68 s [vector] index: OK
  10512. 1323.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10513. 1323.68 s [vector] extract: OK
  10514. 1323.68 s [vector] +++ OK, passed 100 tests.
  10515. 1323.68 s [vector] init: OK
  10516. 1323.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10517. 1323.68 s [vector] tail: OK
  10518. 1323.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10519. 1323.68 s [vector] take: OK
  10520. 1323.68 s [vector] +++ OK, passed 100 tests.
  10521. 1323.69 s [vector] drop: OK
  10522. 1323.69 s [vector] +++ OK, passed 100 tests.
  10523. 1323.71 s [vector] map: OK
  10524. 1323.71 s [vector] +++ OK, passed 100 tests.
  10525. 1323.71 s [vector] zipWith: OK
  10526. 1323.71 s [vector] +++ OK, passed 100 tests.
  10527. 1323.71 s [vector] zipWith3: OK
  10528. 1323.71 s [vector] +++ OK, passed 100 tests.
  10529. 1323.71 s [vector] filter: OK
  10530. 1323.71 s [vector] +++ OK, passed 100 tests.
  10531. 1323.71 s [vector] takeWhile: OK
  10532. 1323.71 s [vector] +++ OK, passed 100 tests.
  10533. 1323.71 s [vector] dropWhile: OK
  10534. 1323.71 s [vector] +++ OK, passed 100 tests.
  10535. 1323.71 s [vector] elem: OK
  10536. 1323.71 s [vector] +++ OK, passed 100 tests.
  10537. 1323.71 s [vector] notElem: OK
  10538. 1323.71 s [vector] +++ OK, passed 100 tests.
  10539. 1323.72 s [vector] find: OK
  10540. 1323.72 s [vector] +++ OK, passed 100 tests.
  10541. 1323.72 s [vector] findIndex: OK
  10542. 1323.72 s [vector] +++ OK, passed 100 tests.
  10543. 1323.72 s [vector] foldl: OK
  10544. 1323.72 s [vector] +++ OK, passed 100 tests.
  10545. 1323.72 s [vector] foldl1: OK
  10546. 1323.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10547. 1323.72 s [vector] foldl': OK
  10548. 1323.72 s [vector] +++ OK, passed 100 tests.
  10549. 1323.72 s [vector] foldl1': OK
  10550. 1323.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10551. 1323.72 s [vector] foldr: OK
  10552. 1323.72 s [vector] +++ OK, passed 100 tests.
  10553. 1323.72 s [vector] foldr1: OK
  10554. 1323.72 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10555. 1323.72 s [vector] prescanl: OK
  10556. 1323.72 s [vector] +++ OK, passed 100 tests.
  10557. 1323.72 s [vector] prescanl': OK
  10558. 1323.72 s [vector] +++ OK, passed 100 tests.
  10559. 1323.72 s [vector] postscanl: OK
  10560. 1323.72 s [vector] +++ OK, passed 100 tests.
  10561. 1323.72 s [vector] postscanl': OK
  10562. 1323.72 s [vector] +++ OK, passed 100 tests.
  10563. 1323.72 s [vector] scanl: OK
  10564. 1323.72 s [vector] +++ OK, passed 100 tests.
  10565. 1323.72 s [vector] scanl': OK
  10566. 1323.72 s [vector] +++ OK, passed 100 tests.
  10567. 1323.72 s [vector] scanl1: OK
  10568. 1323.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10569. 1323.72 s [vector] scanl1': OK
  10570. 1323.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10571. 1323.72 s [vector] concatMap: OK
  10572. 1323.72 s [vector] +++ OK, passed 100 tests.
  10573. 1323.72 s [vector] unfoldr: OK
  10574. 1323.72 s [vector] +++ OK, passed 100 tests.
  10575. 1323.72 s [vector] and: OK
  10576. 1323.72 s [vector] +++ OK, passed 100 tests.
  10577. 1323.72 s [vector] or: OK
  10578. 1323.72 s [vector] +++ OK, passed 100 tests.
  10579. 1323.72 s [vector] Tests.Vector.Boxed
  10580. 1323.72 s [vector] Bool
  10581. 1323.72 s [vector] fromList.toList == id: OK
  10582. 1323.72 s [vector] +++ OK, passed 100 tests.
  10583. 1323.72 s [vector] toList.fromList == id: OK
  10584. 1323.72 s [vector] +++ OK, passed 100 tests.
  10585. 1323.72 s [vector] unstream.stream == id: OK
  10586. 1323.72 s [vector] +++ OK, passed 100 tests.
  10587. 1323.72 s [vector] stream.unstream == id: OK
  10588. 1323.72 s [vector] +++ OK, passed 100 tests.
  10589. 1323.73 s [vector] eq: OK
  10590. 1323.73 s [vector] +++ OK, passed 100 tests.
  10591. 1323.74 s [vector] length: OK
  10592. 1323.74 s [vector] +++ OK, passed 100 tests.
  10593. 1323.74 s [vector] null: OK
  10594. 1323.74 s [vector] +++ OK, passed 100 tests.
  10595. 1323.74 s [vector] index: OK
  10596. 1323.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10597. 1323.74 s [vector] safeIndex: OK
  10598. 1323.74 s [vector] +++ OK, passed 100 tests.
  10599. 1323.75 s [vector] head: OK
  10600. 1323.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10601. 1323.75 s [vector] last: OK
  10602. 1323.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10603. 1323.75 s [vector] unsafeIndex: OK
  10604. 1323.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10605. 1323.75 s [vector] unsafeHead: OK
  10606. 1323.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10607. 1323.75 s [vector] unsafeLast: OK
  10608. 1323.75 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10609. 1323.75 s [vector] slice: OK
  10610. 1323.75 s [vector] +++ OK, passed 100 tests.
  10611. 1323.75 s [vector] init: OK
  10612. 1323.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10613. 1323.75 s [vector] tail: OK
  10614. 1323.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10615. 1323.75 s [vector] take: OK
  10616. 1323.75 s [vector] +++ OK, passed 100 tests.
  10617. 1323.75 s [vector] drop: OK
  10618. 1323.75 s [vector] +++ OK, passed 100 tests.
  10619. 1323.75 s [vector] splitAt: OK
  10620. 1323.75 s [vector] +++ OK, passed 100 tests.
  10621. 1323.75 s [vector] empty: OK
  10622. 1323.75 s [vector] +++ OK, passed 100 tests.
  10623. 1323.75 s [vector] singleton: OK
  10624. 1323.75 s [vector] +++ OK, passed 100 tests.
  10625. 1323.75 s [vector] replicate: OK
  10626. 1323.75 s [vector] +++ OK, passed 100 tests.
  10627. 1323.75 s [vector] generate: OK
  10628. 1323.75 s [vector] +++ OK, passed 100 tests.
  10629. 1323.75 s [vector] iterateN: OK
  10630. 1323.75 s [vector] +++ OK, passed 100 tests.
  10631. 1323.75 s [vector] iterateNM: OK (0.03s)
  10632. 1323.75 s [vector] +++ OK, passed 100 tests.
  10633. 1323.76 s [vector] generateM: OK (0.01s)
  10634. 1323.76 s [vector] +++ OK, passed 100 tests.
  10635. 1323.76 s [vector] replicateM: OK
  10636. 1323.76 s [vector] +++ OK, passed 100 tests.
  10637. 1323.76 s [vector] create: OK
  10638. 1323.76 s [vector] +++ OK, passed 100 tests.
  10639. 1323.76 s [vector] createT: OK
  10640. 1323.76 s [vector] +++ OK, passed 100 tests.
  10641. 1323.76 s [vector] unfoldr: OK
  10642. 1323.76 s [vector] +++ OK, passed 100 tests.
  10643. 1323.77 s [vector] unfoldrN: OK
  10644. 1323.77 s [vector] +++ OK, passed 100 tests.
  10645. 1323.77 s [vector] unfoldrExactN: OK
  10646. 1323.77 s [vector] +++ OK, passed 100 tests.
  10647. 1323.77 s [vector] unfoldrM: OK
  10648. 1323.77 s [vector] +++ OK, passed 100 tests.
  10649. 1323.77 s [vector] unfoldrNM: OK
  10650. 1323.77 s [vector] +++ OK, passed 100 tests.
  10651. 1323.77 s [vector] unfoldrExactNM: OK (0.03s)
  10652. 1323.77 s [vector] +++ OK, passed 100 tests.
  10653. 1323.77 s [vector] constructN: OK
  10654. 1323.77 s [vector] +++ OK, passed 100 tests.
  10655. 1323.77 s [vector] constructrN: OK
  10656. 1323.77 s [vector] +++ OK, passed 100 tests.
  10657. 1323.77 s [vector] cons: OK
  10658. 1323.77 s [vector] +++ OK, passed 100 tests.
  10659. 1323.78 s [vector] snoc: OK
  10660. 1323.78 s [vector] +++ OK, passed 100 tests.
  10661. 1323.78 s [vector] append: OK
  10662. 1323.78 s [vector] +++ OK, passed 100 tests.
  10663. 1323.78 s [vector] concat: OK (0.01s)
  10664. 1323.78 s [vector] +++ OK, passed 100 tests.
  10665. 1323.78 s [vector] force: OK
  10666. 1323.78 s [vector] +++ OK, passed 100 tests.
  10667. 1323.78 s [vector] upd: OK
  10668. 1323.78 s [vector] +++ OK, passed 100 tests.
  10669. 1323.78 s [vector] accum: OK
  10670. 1323.78 s [vector] +++ OK, passed 100 tests.
  10671. 1323.78 s [vector] reverse: OK
  10672. 1323.78 s [vector] +++ OK, passed 100 tests.
  10673. 1323.78 s [vector] backpermute: OK
  10674. 1323.78 s [vector] +++ OK, passed 100 tests.
  10675. 1323.78 s [vector] map: OK
  10676. 1323.78 s [vector] +++ OK, passed 100 tests.
  10677. 1323.78 s [vector] imap: OK
  10678. 1323.78 s [vector] +++ OK, passed 100 tests.
  10679. 1323.78 s [vector] concatMap: OK
  10680. 1323.78 s [vector] +++ OK, passed 100 tests.
  10681. 1323.78 s [vector] mapM: OK
  10682. 1323.78 s [vector] +++ OK, passed 100 tests.
  10683. 1323.78 s [vector] mapM_: OK
  10684. 1323.78 s [vector] +++ OK, passed 100 tests.
  10685. 1323.78 s [vector] forM: OK
  10686. 1323.78 s [vector] +++ OK, passed 100 tests.
  10687. 1323.78 s [vector] forM_: OK (0.01s)
  10688. 1323.78 s [vector] +++ OK, passed 100 tests.
  10689. 1323.78 s [vector] imapM: OK
  10690. 1323.78 s [vector] +++ OK, passed 100 tests.
  10691. 1323.78 s [vector] imapM_: OK (0.04s)
  10692. 1323.78 s [vector] +++ OK, passed 100 tests.
  10693. 1323.78 s [vector] zipWith: OK
  10694. 1323.78 s [vector] +++ OK, passed 100 tests.
  10695. 1323.78 s [vector] zipWith3: OK
  10696. 1323.78 s [vector] +++ OK, passed 100 tests.
  10697. 1323.78 s [vector] izipWith: OK
  10698. 1323.78 s [vector] +++ OK, passed 100 tests.
  10699. 1323.78 s [vector] izipWith3: OK
  10700. 1323.78 s [vector] +++ OK, passed 100 tests.
  10701. 1323.78 s [vector] izipWithM: OK
  10702. 1323.78 s [vector] +++ OK, passed 100 tests.
  10703. 1323.78 s [vector] izipWithM_: OK
  10704. 1323.78 s [vector] +++ OK, passed 100 tests.
  10705. 1323.78 s [vector] zipWithM: OK
  10706. 1323.78 s [vector] +++ OK, passed 100 tests.
  10707. 1323.78 s [vector] zipWithM_: OK
  10708. 1323.78 s [vector] +++ OK, passed 100 tests.
  10709. 1323.78 s [vector] filter: OK
  10710. 1323.78 s [vector] +++ OK, passed 100 tests.
  10711. 1323.78 s [vector] ifilter: OK
  10712. 1323.78 s [vector] +++ OK, passed 100 tests.
  10713. 1323.78 s [vector] filterM: OK (0.01s)
  10714. 1323.78 s [vector] +++ OK, passed 100 tests.
  10715. 1323.78 s [vector] uniq: OK
  10716. 1323.78 s [vector] +++ OK, passed 100 tests.
  10717. 1323.78 s [vector] mapMaybe: OK
  10718. 1323.78 s [vector] +++ OK, passed 100 tests.
  10719. 1323.78 s [vector] imapMaybe: OK
  10720. 1323.78 s [vector] +++ OK, passed 100 tests.
  10721. 1323.78 s [vector] takeWhile: OK
  10722. 1323.78 s [vector] +++ OK, passed 100 tests.
  10723. 1323.78 s [vector] dropWhile: OK
  10724. 1323.78 s [vector] +++ OK, passed 100 tests.
  10725. 1323.78 s [vector] partition: OK
  10726. 1323.78 s [vector] +++ OK, passed 100 tests.
  10727. 1323.78 s [vector] partitionWith: OK
  10728. 1323.78 s [vector] +++ OK, passed 100 tests.
  10729. 1323.78 s [vector] span: OK
  10730. 1323.78 s [vector] +++ OK, passed 100 tests.
  10731. 1323.78 s [vector] break: OK
  10732. 1323.78 s [vector] +++ OK, passed 100 tests.
  10733. 1323.78 s [vector] spanR: OK
  10734. 1323.79 s [vector] +++ OK, passed 100 tests.
  10735. 1323.79 s [vector] breakR: OK
  10736. 1323.79 s [vector] +++ OK, passed 100 tests.
  10737. 1323.79 s [vector] groupBy: OK
  10738. 1323.79 s [vector] +++ OK, passed 100 tests.
  10739. 1323.79 s [vector] elem: OK
  10740. 1323.79 s [vector] +++ OK, passed 100 tests.
  10741. 1323.79 s [vector] notElem: OK
  10742. 1323.79 s [vector] +++ OK, passed 100 tests.
  10743. 1323.79 s [vector] find: OK
  10744. 1323.79 s [vector] +++ OK, passed 100 tests.
  10745. 1323.79 s [vector] findIndex: OK
  10746. 1323.79 s [vector] +++ OK, passed 100 tests.
  10747. 1323.79 s [vector] findIndexR: OK
  10748. 1323.79 s [vector] +++ OK, passed 100 tests.
  10749. 1323.79 s [vector] findIndices: OK
  10750. 1323.79 s [vector] +++ OK, passed 100 tests.
  10751. 1323.79 s [vector] elemIndex: OK
  10752. 1323.79 s [vector] +++ OK, passed 100 tests.
  10753. 1323.79 s [vector] elemIndices: OK
  10754. 1323.79 s [vector] +++ OK, passed 100 tests.
  10755. 1323.79 s [vector] foldl: OK
  10756. 1323.79 s [vector] +++ OK, passed 100 tests.
  10757. 1323.79 s [vector] foldl1: OK
  10758. 1323.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10759. 1323.79 s [vector] foldl': OK
  10760. 1323.79 s [vector] +++ OK, passed 100 tests.
  10761. 1323.79 s [vector] foldl1': OK
  10762. 1323.79 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10763. 1323.79 s [vector] foldr: OK
  10764. 1323.79 s [vector] +++ OK, passed 100 tests.
  10765. 1323.79 s [vector] foldr1: OK
  10766. 1323.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10767. 1323.79 s [vector] foldr': OK
  10768. 1323.79 s [vector] +++ OK, passed 100 tests.
  10769. 1323.80 s [vector] foldr1': OK
  10770. 1323.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10771. 1323.80 s [vector] ifoldl: OK
  10772. 1323.80 s [vector] +++ OK, passed 100 tests.
  10773. 1323.80 s [vector] ifoldl': OK
  10774. 1323.80 s [vector] +++ OK, passed 100 tests.
  10775. 1323.80 s [vector] ifoldr: OK
  10776. 1323.80 s [vector] +++ OK, passed 100 tests.
  10777. 1323.80 s [vector] ifoldr': OK
  10778. 1323.80 s [vector] +++ OK, passed 100 tests.
  10779. 1323.80 s [vector] ifoldM: OK
  10780. 1323.80 s [vector] +++ OK, passed 100 tests.
  10781. 1323.80 s [vector] ifoldM': OK
  10782. 1323.80 s [vector] +++ OK, passed 100 tests.
  10783. 1323.80 s [vector] ifoldM_: OK (0.01s)
  10784. 1323.80 s [vector] +++ OK, passed 100 tests.
  10785. 1323.80 s [vector] ifoldM'_: OK
  10786. 1323.80 s [vector] +++ OK, passed 100 tests.
  10787. 1323.80 s [vector] all: OK
  10788. 1323.80 s [vector] +++ OK, passed 100 tests.
  10789. 1323.80 s [vector] any: OK
  10790. 1323.80 s [vector] +++ OK, passed 100 tests.
  10791. 1323.80 s [vector] prescanl: OK
  10792. 1323.80 s [vector] +++ OK, passed 100 tests.
  10793. 1323.80 s [vector] prescanl': OK
  10794. 1323.80 s [vector] +++ OK, passed 100 tests.
  10795. 1323.80 s [vector] postscanl: OK
  10796. 1323.80 s [vector] +++ OK, passed 100 tests.
  10797. 1323.80 s [vector] postscanl': OK
  10798. 1323.80 s [vector] +++ OK, passed 100 tests.
  10799. 1323.80 s [vector] scanl: OK
  10800. 1323.80 s [vector] +++ OK, passed 100 tests.
  10801. 1323.80 s [vector] scanl': OK
  10802. 1323.80 s [vector] +++ OK, passed 100 tests.
  10803. 1323.81 s [vector] scanl1: OK
  10804. 1323.81 s [vector] +++ OK, passed 100 tests.
  10805. 1323.81 s [vector] scanl1': OK
  10806. 1323.81 s [vector] +++ OK, passed 100 tests.
  10807. 1323.81 s [vector] iscanl: OK
  10808. 1323.81 s [vector] +++ OK, passed 100 tests.
  10809. 1323.81 s [vector] iscanl': OK
  10810. 1323.81 s [vector] +++ OK, passed 100 tests.
  10811. 1323.81 s [vector] prescanr: OK
  10812. 1323.81 s [vector] +++ OK, passed 100 tests.
  10813. 1323.81 s [vector] prescanr': OK
  10814. 1323.81 s [vector] +++ OK, passed 100 tests.
  10815. 1323.81 s [vector] postscanr: OK
  10816. 1323.81 s [vector] +++ OK, passed 100 tests.
  10817. 1323.81 s [vector] postscanr': OK
  10818. 1323.81 s [vector] +++ OK, passed 100 tests.
  10819. 1323.82 s [vector] scanr: OK
  10820. 1323.82 s [vector] +++ OK, passed 100 tests.
  10821. 1323.82 s [vector] scanr': OK
  10822. 1323.82 s [vector] +++ OK, passed 100 tests.
  10823. 1323.83 s [vector] scanr1: OK
  10824. 1323.83 s [vector] +++ OK, passed 100 tests.
  10825. 1323.83 s [vector] scanr1': OK
  10826. 1323.83 s [vector] +++ OK, passed 100 tests.
  10827. 1323.83 s [vector] iscanr: OK
  10828. 1323.83 s [vector] +++ OK, passed 100 tests.
  10829. 1323.83 s [vector] iscanr': OK
  10830. 1323.83 s [vector] +++ OK, passed 100 tests.
  10831. 1323.83 s [vector] mut_read: OK
  10832. 1323.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10833. 1323.83 s [vector] mut_write: OK
  10834. 1323.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10835. 1323.83 s [vector] mut_modify: OK
  10836. 1323.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10837. 1323.83 s [vector] mut_generate: OK
  10838. 1323.83 s [vector] +++ OK, passed 100 tests.
  10839. 1323.85 s [vector] mut_generateM: OK
  10840. 1323.85 s [vector] +++ OK, passed 100 tests.
  10841. 1323.85 s [vector] mut_mapM_: OK (0.01s)
  10842. 1323.85 s [vector] +++ OK, passed 100 tests.
  10843. 1323.87 s [vector] mut_imapM_: OK (0.01s)
  10844. 1323.87 s [vector] +++ OK, passed 100 tests.
  10845. 1323.87 s [vector] mut_forM_: OK (0.01s)
  10846. 1323.87 s [vector] +++ OK, passed 100 tests.
  10847. 1323.88 s [vector] mut_iforM_: OK
  10848. 1323.88 s [vector] +++ OK, passed 100 tests.
  10849. 1323.88 s [vector] mut_foldr: OK
  10850. 1323.88 s [vector] +++ OK, passed 100 tests.
  10851. 1323.88 s [vector] mut_foldr': OK
  10852. 1323.88 s [vector] +++ OK, passed 100 tests.
  10853. 1323.88 s [vector] mut_foldl: OK
  10854. 1323.88 s [vector] +++ OK, passed 100 tests.
  10855. 1323.89 s [vector] mut_foldl': OK
  10856. 1323.89 s [vector] +++ OK, passed 100 tests.
  10857. 1323.89 s [vector] mut_ifoldr: OK
  10858. 1323.89 s [vector] +++ OK, passed 100 tests.
  10859. 1323.89 s [vector] mut_ifoldr': OK
  10860. 1323.89 s [vector] +++ OK, passed 100 tests.
  10861. 1323.89 s [vector] mut_ifoldl: OK
  10862. 1323.89 s [vector] +++ OK, passed 100 tests.
  10863. 1323.89 s [vector] mut_ifoldl': OK
  10864. 1323.89 s [vector] +++ OK, passed 100 tests.
  10865. 1323.89 s [vector] mut_foldM: OK
  10866. 1323.89 s [vector] +++ OK, passed 100 tests.
  10867. 1323.89 s [vector] mut_foldM': OK
  10868. 1323.90 s [vector] +++ OK, passed 100 tests.
  10869. 1323.90 s [vector] mut_foldrM: OK
  10870. 1323.90 s [vector] +++ OK, passed 100 tests.
  10871. 1323.90 s [vector] mut_foldrM': OK
  10872. 1323.90 s [vector] +++ OK, passed 100 tests.
  10873. 1323.90 s [vector] mut_ifoldM: OK
  10874. 1323.90 s [vector] +++ OK, passed 100 tests.
  10875. 1323.90 s [vector] mut_ifoldM': OK
  10876. 1323.90 s [vector] +++ OK, passed 100 tests.
  10877. 1323.90 s [vector] mut_ifoldrM: OK
  10878. 1323.90 s [vector] +++ OK, passed 100 tests.
  10879. 1323.90 s [vector] mut_ifoldrM': OK
  10880. 1323.90 s [vector] +++ OK, passed 100 tests.
  10881. 1323.90 s [vector] compare: OK
  10882. 1323.90 s [vector] +++ OK, passed 100 tests.
  10883. 1323.90 s [vector] maximum: OK
  10884. 1323.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10885. 1323.90 s [vector] minimum: OK
  10886. 1323.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10887. 1323.90 s [vector] minIndex: OK
  10888. 1323.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10889. 1323.90 s [vector] maxIndex: OK
  10890. 1323.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10891. 1323.91 s [vector] maximumBy: OK
  10892. 1323.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10893. 1323.91 s [vector] minimumBy: OK
  10894. 1323.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10895. 1323.91 s [vector] maximumOn: OK
  10896. 1323.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10897. 1323.91 s [vector] minimumOn: OK
  10898. 1323.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10899. 1323.91 s [vector] maxIndexBy: OK
  10900. 1323.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10901. 1323.91 s [vector] minIndexBy: OK
  10902. 1323.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10903. 1323.91 s [vector] ListFirstMaxIndexWins: OK
  10904. 1323.91 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10905. 1323.91 s [vector] FalseListFirstMaxIndexWins: OK
  10906. 1323.91 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10907. 1323.91 s [vector] []
  10908. 1323.91 s [vector] zip: OK
  10909. 1323.91 s [vector] +++ OK, passed 100 tests.
  10910. 1323.91 s [vector] zip3: OK
  10911. 1323.91 s [vector] +++ OK, passed 100 tests.
  10912. 1323.91 s [vector] unzip: OK
  10913. 1323.91 s [vector] +++ OK, passed 100 tests.
  10914. 1323.91 s [vector] unzip3: OK
  10915. 1323.91 s [vector] +++ OK, passed 100 tests.
  10916. 1323.91 s [vector] indexed: OK
  10917. 1323.91 s [vector] +++ OK, passed 100 tests.
  10918. 1323.91 s [vector] update: OK
  10919. 1323.91 s [vector] +++ OK, passed 100 tests.
  10920. 1323.92 s [vector] concat: OK
  10921. 1323.92 s [vector] +++ OK, passed 100 tests.
  10922. 1323.92 s [vector] mempty: OK
  10923. 1323.92 s [vector] +++ OK, passed 100 tests.
  10924. 1323.93 s [vector] mappend: OK
  10925. 1323.93 s [vector] +++ OK, passed 100 tests.
  10926. 1323.93 s [vector] mconcat: OK
  10927. 1323.93 s [vector] +++ OK, passed 100 tests.
  10928. 1323.93 s [vector] fmap: OK
  10929. 1323.93 s [vector] +++ OK, passed 100 tests.
  10930. 1323.93 s [vector] return: OK
  10931. 1323.93 s [vector] +++ OK, passed 100 tests.
  10932. 1323.94 s [vector] bind: OK (0.01s)
  10933. 1323.94 s [vector] +++ OK, passed 100 tests.
  10934. 1323.94 s [vector] mzip: OK
  10935. 1323.94 s [vector] +++ OK, passed 100 tests.
  10936. 1323.94 s [vector] munzip: OK
  10937. 1323.94 s [vector] +++ OK, passed 100 tests.
  10938. 1323.95 s [vector] applicative_pure: OK
  10939. 1323.95 s [vector] +++ OK, passed 100 tests.
  10940. 1323.96 s [vector] applicative_appl: OK (0.01s)
  10941. 1323.96 s [vector] +++ OK, passed 100 tests.
  10942. 1323.96 s [vector] alternative_empty: OK
  10943. 1323.96 s [vector] +++ OK, passed 100 tests.
  10944. 1323.96 s [vector] alternative_or: OK
  10945. 1323.96 s [vector] +++ OK, passed 100 tests.
  10946. 1323.99 s [vector] sequence: OK (0.02s)
  10947. 1323.99 s [vector] +++ OK, passed 100 tests.
  10948. 1323.99 s [vector] sequence_: OK
  10949. 1323.99 s [vector] +++ OK, passed 100 tests.
  10950. 1323.99 s [vector] glength: OK
  10951. 1323.99 s [vector] +++ OK, passed 100 tests.
  10952. 1323.99 s [vector] and: OK
  10953. 1323.99 s [vector] +++ OK, passed 100 tests.
  10954. 1323.99 s [vector] or: OK
  10955. 1323.99 s [vector] +++ OK, passed 100 tests.
  10956. 1323.99 s [vector] Int
  10957. 1323.99 s [vector] fromList.toList == id: OK
  10958. 1323.99 s [vector] +++ OK, passed 100 tests.
  10959. 1323.99 s [vector] toList.fromList == id: OK
  10960. 1323.99 s [vector] +++ OK, passed 100 tests.
  10961. 1323.99 s [vector] unstream.stream == id: OK
  10962. 1323.99 s [vector] +++ OK, passed 100 tests.
  10963. 1323.99 s [vector] stream.unstream == id: OK
  10964. 1323.99 s [vector] +++ OK, passed 100 tests.
  10965. 1323.99 s [vector] eq: OK
  10966. 1323.99 s [vector] +++ OK, passed 100 tests.
  10967. 1323.99 s [vector] length: OK
  10968. 1323.99 s [vector] +++ OK, passed 100 tests.
  10969. 1323.99 s [vector] null: OK
  10970. 1323.99 s [vector] +++ OK, passed 100 tests.
  10971. 1323.99 s [vector] index: OK
  10972. 1323.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10973. 1323.99 s [vector] safeIndex: OK
  10974. 1324.00 s [vector] +++ OK, passed 100 tests.
  10975. 1324.00 s [vector] head: OK
  10976. 1324.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10977. 1324.00 s [vector] last: OK
  10978. 1324.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10979. 1324.00 s [vector] unsafeIndex: OK
  10980. 1324.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10981. 1324.00 s [vector] unsafeHead: OK
  10982. 1324.00 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10983. 1324.00 s [vector] unsafeLast: OK
  10984. 1324.00 s [vector] +++ OK, passed 100 tests; 26 discarded.
  10985. 1324.00 s [vector] slice: OK
  10986. 1324.00 s [vector] +++ OK, passed 100 tests.
  10987. 1324.00 s [vector] init: OK
  10988. 1324.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10989. 1324.00 s [vector] tail: OK
  10990. 1324.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10991. 1324.00 s [vector] take: OK
  10992. 1324.00 s [vector] +++ OK, passed 100 tests.
  10993. 1324.00 s [vector] drop: OK
  10994. 1324.00 s [vector] +++ OK, passed 100 tests.
  10995. 1324.00 s [vector] splitAt: OK
  10996. 1324.00 s [vector] +++ OK, passed 100 tests.
  10997. 1324.00 s [vector] empty: OK
  10998. 1324.00 s [vector] +++ OK, passed 100 tests.
  10999. 1324.00 s [vector] singleton: OK
  11000. 1324.00 s [vector] +++ OK, passed 100 tests.
  11001. 1324.00 s [vector] replicate: OK
  11002. 1324.00 s [vector] +++ OK, passed 100 tests.
  11003. 1324.00 s [vector] generate: OK
  11004. 1324.01 s [vector] +++ OK, passed 100 tests.
  11005. 1324.01 s [vector] iterateN: OK
  11006. 1324.01 s [vector] +++ OK, passed 100 tests.
  11007. 1324.03 s [vector] iterateNM: OK (0.02s)
  11008. 1324.03 s [vector] +++ OK, passed 100 tests.
  11009. 1324.06 s [vector] generateM: OK (0.03s)
  11010. 1324.06 s [vector] +++ OK, passed 100 tests.
  11011. 1324.06 s [vector] replicateM: OK
  11012. 1324.06 s [vector] +++ OK, passed 100 tests.
  11013. 1324.06 s [vector] create: OK
  11014. 1324.06 s [vector] +++ OK, passed 100 tests.
  11015. 1324.06 s [vector] createT: OK
  11016. 1324.06 s [vector] +++ OK, passed 100 tests.
  11017. 1324.06 s [vector] unfoldr: OK
  11018. 1324.06 s [vector] +++ OK, passed 100 tests.
  11019. 1324.07 s [vector] unfoldrN: OK
  11020. 1324.07 s [vector] +++ OK, passed 100 tests.
  11021. 1324.08 s [vector] unfoldrExactN: OK
  11022. 1324.08 s [vector] +++ OK, passed 100 tests.
  11023. 1324.08 s [vector] unfoldrM: OK
  11024. 1324.08 s [vector] +++ OK, passed 100 tests.
  11025. 1324.08 s [vector] unfoldrNM: OK
  11026. 1324.08 s [vector] +++ OK, passed 100 tests.
  11027. 1324.10 s [vector] unfoldrExactNM: OK (0.02s)
  11028. 1324.11 s [vector] +++ OK, passed 100 tests.
  11029. 1324.11 s [vector] constructN: OK
  11030. 1324.11 s [vector] +++ OK, passed 100 tests.
  11031. 1324.11 s [vector] constructrN: OK
  11032. 1324.11 s [vector] +++ OK, passed 100 tests.
  11033. 1324.11 s [vector] cons: OK
  11034. 1324.11 s [vector] +++ OK, passed 100 tests.
  11035. 1324.11 s [vector] snoc: OK
  11036. 1324.11 s [vector] +++ OK, passed 100 tests.
  11037. 1324.13 s [vector] append: OK
  11038. 1324.13 s [vector] +++ OK, passed 100 tests.
  11039. 1324.13 s [vector] concat: OK (0.01s)
  11040. 1324.13 s [vector] +++ OK, passed 100 tests.
  11041. 1324.13 s [vector] force: OK
  11042. 1324.13 s [vector] +++ OK, passed 100 tests.
  11043. 1324.13 s [vector] upd: OK
  11044. 1324.13 s [vector] +++ OK, passed 100 tests.
  11045. 1324.13 s [vector] accum: OK
  11046. 1324.13 s [vector] +++ OK, passed 100 tests.
  11047. 1324.13 s [vector] reverse: OK
  11048. 1324.13 s [vector] +++ OK, passed 100 tests.
  11049. 1324.14 s [vector] backpermute: OK
  11050. 1324.14 s [vector] +++ OK, passed 100 tests.
  11051. 1324.14 s [vector] map: OK
  11052. 1324.14 s [vector] +++ OK, passed 100 tests.
  11053. 1324.14 s [vector] imap: OK
  11054. 1324.14 s [vector] +++ OK, passed 100 tests.
  11055. 1324.14 s [vector] concatMap: OK
  11056. 1324.14 s [vector] +++ OK, passed 100 tests.
  11057. 1324.14 s [vector] mapM: OK
  11058. 1324.15 s [vector] +++ OK, passed 100 tests.
  11059. 1324.16 s [vector] mapM_: OK (0.02s)
  11060. 1324.17 s [vector] +++ OK, passed 100 tests.
  11061. 1324.17 s [vector] forM: OK
  11062. 1324.17 s [vector] +++ OK, passed 100 tests.
  11063. 1324.18 s [vector] forM_: OK (0.02s)
  11064. 1324.19 s [vector] +++ OK, passed 100 tests.
  11065. 1324.19 s [vector] imapM: OK
  11066. 1324.19 s [vector] +++ OK, passed 100 tests.
  11067. 1324.20 s [vector] imapM_: OK (0.02s)
  11068. 1324.20 s [vector] +++ OK, passed 100 tests.
  11069. 1324.20 s [vector] zipWith: OK
  11070. 1324.20 s [vector] +++ OK, passed 100 tests.
  11071. 1324.21 s [vector] zipWith3: OK
  11072. 1324.21 s [vector] +++ OK, passed 100 tests.
  11073. 1324.21 s [vector] izipWith: OK
  11074. 1324.21 s [vector] +++ OK, passed 100 tests.
  11075. 1324.21 s [vector] izipWith3: OK
  11076. 1324.21 s [vector] +++ OK, passed 100 tests.
  11077. 1324.21 s [vector] izipWithM: OK
  11078. 1324.21 s [vector] +++ OK, passed 100 tests.
  11079. 1324.23 s [vector] izipWithM_: OK (0.01s)
  11080. 1324.23 s [vector] +++ OK, passed 100 tests.
  11081. 1324.23 s [vector] zipWithM: OK
  11082. 1324.23 s [vector] +++ OK, passed 100 tests.
  11083. 1324.24 s [vector] zipWithM_: OK
  11084. 1324.25 s [vector] +++ OK, passed 100 tests.
  11085. 1324.25 s [vector] filter: OK
  11086. 1324.25 s [vector] +++ OK, passed 100 tests.
  11087. 1324.25 s [vector] ifilter: OK
  11088. 1324.25 s [vector] +++ OK, passed 100 tests.
  11089. 1324.27 s [vector] filterM: OK (0.02s)
  11090. 1324.27 s [vector] +++ OK, passed 100 tests.
  11091. 1324.27 s [vector] uniq: OK
  11092. 1324.27 s [vector] +++ OK, passed 100 tests.
  11093. 1324.27 s [vector] mapMaybe: OK
  11094. 1324.27 s [vector] +++ OK, passed 100 tests.
  11095. 1324.27 s [vector] imapMaybe: OK
  11096. 1324.27 s [vector] +++ OK, passed 100 tests.
  11097. 1324.27 s [vector] takeWhile: OK
  11098. 1324.27 s [vector] +++ OK, passed 100 tests.
  11099. 1324.27 s [vector] dropWhile: OK
  11100. 1324.27 s [vector] +++ OK, passed 100 tests.
  11101. 1324.28 s [vector] partition: OK
  11102. 1324.28 s [vector] +++ OK, passed 100 tests.
  11103. 1324.28 s [vector] partitionWith: OK
  11104. 1324.28 s [vector] +++ OK, passed 100 tests.
  11105. 1324.28 s [vector] span: OK
  11106. 1324.28 s [vector] +++ OK, passed 100 tests.
  11107. 1324.28 s [vector] break: OK
  11108. 1324.29 s [vector] +++ OK, passed 100 tests.
  11109. 1324.29 s [vector] spanR: OK
  11110. 1324.29 s [vector] +++ OK, passed 100 tests.
  11111. 1324.29 s [vector] breakR: OK
  11112. 1324.29 s [vector] +++ OK, passed 100 tests.
  11113. 1324.29 s [vector] groupBy: OK
  11114. 1324.29 s [vector] +++ OK, passed 100 tests.
  11115. 1324.29 s [vector] elem: OK
  11116. 1324.29 s [vector] +++ OK, passed 100 tests.
  11117. 1324.29 s [vector] notElem: OK
  11118. 1324.29 s [vector] +++ OK, passed 100 tests.
  11119. 1324.29 s [vector] find: OK
  11120. 1324.29 s [vector] +++ OK, passed 100 tests.
  11121. 1324.29 s [vector] findIndex: OK
  11122. 1324.29 s [vector] +++ OK, passed 100 tests.
  11123. 1324.29 s [vector] findIndexR: OK
  11124. 1324.29 s [vector] +++ OK, passed 100 tests.
  11125. 1324.29 s [vector] findIndices: OK
  11126. 1324.30 s [vector] +++ OK, passed 100 tests.
  11127. 1324.30 s [vector] elemIndex: OK
  11128. 1324.30 s [vector] +++ OK, passed 100 tests.
  11129. 1324.31 s [vector] elemIndices: OK
  11130. 1324.31 s [vector] +++ OK, passed 100 tests.
  11131. 1324.31 s [vector] foldl: OK
  11132. 1324.31 s [vector] +++ OK, passed 100 tests.
  11133. 1324.31 s [vector] foldl1: OK
  11134. 1324.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11135. 1324.32 s [vector] foldl': OK
  11136. 1324.32 s [vector] +++ OK, passed 100 tests.
  11137. 1324.32 s [vector] foldl1': OK
  11138. 1324.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11139. 1324.32 s [vector] foldr: OK
  11140. 1324.32 s [vector] +++ OK, passed 100 tests.
  11141. 1324.32 s [vector] foldr1: OK
  11142. 1324.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11143. 1324.32 s [vector] foldr': OK
  11144. 1324.33 s [vector] +++ OK, passed 100 tests.
  11145. 1324.33 s [vector] foldr1': OK
  11146. 1324.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11147. 1324.33 s [vector] ifoldl: OK
  11148. 1324.33 s [vector] +++ OK, passed 100 tests.
  11149. 1324.34 s [vector] ifoldl': OK
  11150. 1324.35 s [vector] +++ OK, passed 100 tests.
  11151. 1324.35 s [vector] ifoldr: OK
  11152. 1324.35 s [vector] +++ OK, passed 100 tests.
  11153. 1324.35 s [vector] ifoldr': OK
  11154. 1324.35 s [vector] +++ OK, passed 100 tests.
  11155. 1324.35 s [vector] ifoldM: OK
  11156. 1324.35 s [vector] +++ OK, passed 100 tests.
  11157. 1324.37 s [vector] ifoldM': OK
  11158. 1324.37 s [vector] +++ OK, passed 100 tests.
  11159. 1324.39 s [vector] ifoldM_: OK (0.02s)
  11160. 1324.39 s [vector] +++ OK, passed 100 tests.
  11161. 1324.39 s [vector] ifoldM'_: OK (0.02s)
  11162. 1324.39 s [vector] +++ OK, passed 100 tests.
  11163. 1324.40 s [vector] all: OK
  11164. 1324.40 s [vector] +++ OK, passed 100 tests.
  11165. 1324.40 s [vector] any: OK
  11166. 1324.41 s [vector] +++ OK, passed 100 tests.
  11167. 1324.41 s [vector] prescanl: OK
  11168. 1324.42 s [vector] +++ OK, passed 100 tests.
  11169. 1324.42 s [vector] prescanl': OK
  11170. 1324.42 s [vector] +++ OK, passed 100 tests.
  11171. 1324.42 s [vector] postscanl: OK
  11172. 1324.42 s [vector] +++ OK, passed 100 tests.
  11173. 1324.42 s [vector] postscanl': OK
  11174. 1324.42 s [vector] +++ OK, passed 100 tests.
  11175. 1324.42 s [vector] scanl: OK
  11176. 1324.42 s [vector] +++ OK, passed 100 tests.
  11177. 1324.42 s [vector] scanl': OK
  11178. 1324.42 s [vector] +++ OK, passed 100 tests.
  11179. 1324.42 s [vector] scanl1: OK
  11180. 1324.42 s [vector] +++ OK, passed 100 tests.
  11181. 1324.42 s [vector] scanl1': OK
  11182. 1324.43 s [vector] +++ OK, passed 100 tests.
  11183. 1324.43 s [vector] iscanl: OK
  11184. 1324.43 s [vector] +++ OK, passed 100 tests.
  11185. 1324.43 s [vector] iscanl': OK
  11186. 1324.43 s [vector] +++ OK, passed 100 tests.
  11187. 1324.43 s [vector] prescanr: OK
  11188. 1324.43 s [vector] +++ OK, passed 100 tests.
  11189. 1324.43 s [vector] prescanr': OK
  11190. 1324.43 s [vector] +++ OK, passed 100 tests.
  11191. 1324.43 s [vector] postscanr: OK
  11192. 1324.43 s [vector] +++ OK, passed 100 tests.
  11193. 1324.43 s [vector] postscanr': OK
  11194. 1324.43 s [vector] +++ OK, passed 100 tests.
  11195. 1324.43 s [vector] scanr: OK
  11196. 1324.43 s [vector] +++ OK, passed 100 tests.
  11197. 1324.44 s [vector] scanr': OK
  11198. 1324.44 s [vector] +++ OK, passed 100 tests.
  11199. 1324.44 s [vector] scanr1: OK
  11200. 1324.44 s [vector] +++ OK, passed 100 tests.
  11201. 1324.44 s [vector] scanr1': OK
  11202. 1324.45 s [vector] +++ OK, passed 100 tests.
  11203. 1324.45 s [vector] iscanr: OK
  11204. 1324.45 s [vector] +++ OK, passed 100 tests.
  11205. 1324.45 s [vector] iscanr': OK
  11206. 1324.45 s [vector] +++ OK, passed 100 tests.
  11207. 1324.45 s [vector] mut_read: OK
  11208. 1324.45 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11209. 1324.46 s [vector] mut_write: OK
  11210. 1324.47 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11211. 1324.47 s [vector] mut_modify: OK
  11212. 1324.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11213. 1324.47 s [vector] mut_generate: OK
  11214. 1324.47 s [vector] +++ OK, passed 100 tests.
  11215. 1324.47 s [vector] mut_generateM: OK
  11216. 1324.47 s [vector] +++ OK, passed 100 tests.
  11217. 1324.47 s [vector] mut_mapM_: OK (0.01s)
  11218. 1324.47 s [vector] +++ OK, passed 100 tests.
  11219. 1324.49 s [vector] mut_imapM_: OK (0.02s)
  11220. 1324.49 s [vector] +++ OK, passed 100 tests.
  11221. 1324.51 s [vector] mut_forM_: OK (0.02s)
  11222. 1324.51 s [vector] +++ OK, passed 100 tests.
  11223. 1324.52 s [vector] mut_iforM_: OK (0.02s)
  11224. 1324.52 s [vector] +++ OK, passed 100 tests.
  11225. 1324.52 s [vector] mut_foldr: OK
  11226. 1324.52 s [vector] +++ OK, passed 100 tests.
  11227. 1324.53 s [vector] mut_foldr': OK
  11228. 1324.53 s [vector] +++ OK, passed 100 tests.
  11229. 1324.53 s [vector] mut_foldl: OK
  11230. 1324.53 s [vector] +++ OK, passed 100 tests.
  11231. 1324.54 s [vector] mut_foldl': OK
  11232. 1324.54 s [vector] +++ OK, passed 100 tests.
  11233. 1324.54 s [vector] mut_ifoldr: OK
  11234. 1324.55 s [vector] +++ OK, passed 100 tests.
  11235. 1324.55 s [vector] mut_ifoldr': OK
  11236. 1324.55 s [vector] +++ OK, passed 100 tests.
  11237. 1324.55 s [vector] mut_ifoldl: OK
  11238. 1324.56 s [vector] +++ OK, passed 100 tests.
  11239. 1324.56 s [vector] mut_ifoldl': OK
  11240. 1324.56 s [vector] +++ OK, passed 100 tests.
  11241. 1324.56 s [vector] mut_foldM: OK
  11242. 1324.56 s [vector] +++ OK, passed 100 tests.
  11243. 1324.56 s [vector] mut_foldM': OK
  11244. 1324.56 s [vector] +++ OK, passed 100 tests.
  11245. 1324.56 s [vector] mut_foldrM: OK
  11246. 1324.57 s [vector] +++ OK, passed 100 tests.
  11247. 1324.57 s [vector] mut_foldrM': OK
  11248. 1324.57 s [vector] +++ OK, passed 100 tests.
  11249. 1324.57 s [vector] mut_ifoldM: OK
  11250. 1324.57 s [vector] +++ OK, passed 100 tests.
  11251. 1324.57 s [vector] mut_ifoldM': OK
  11252. 1324.57 s [vector] +++ OK, passed 100 tests.
  11253. 1324.57 s [vector] mut_ifoldrM: OK
  11254. 1324.57 s [vector] +++ OK, passed 100 tests.
  11255. 1324.57 s [vector] mut_ifoldrM': OK
  11256. 1324.57 s [vector] +++ OK, passed 100 tests.
  11257. 1324.57 s [vector] compare: OK
  11258. 1324.57 s [vector] +++ OK, passed 100 tests.
  11259. 1324.57 s [vector] maximum: OK
  11260. 1324.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11261. 1324.57 s [vector] minimum: OK
  11262. 1324.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11263. 1324.57 s [vector] minIndex: OK
  11264. 1324.57 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11265. 1324.57 s [vector] maxIndex: OK
  11266. 1324.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11267. 1324.57 s [vector] maximumBy: OK
  11268. 1324.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11269. 1324.57 s [vector] minimumBy: OK
  11270. 1324.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11271. 1324.57 s [vector] maximumOn: OK
  11272. 1324.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11273. 1324.57 s [vector] minimumOn: OK
  11274. 1324.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11275. 1324.58 s [vector] maxIndexBy: OK
  11276. 1324.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11277. 1324.58 s [vector] minIndexBy: OK
  11278. 1324.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11279. 1324.58 s [vector] ListFirstMaxIndexWins: OK
  11280. 1324.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11281. 1324.58 s [vector] FalseListFirstMaxIndexWins: OK
  11282. 1324.58 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11283. 1324.58 s [vector] []
  11284. 1324.58 s [vector] zip: OK
  11285. 1324.58 s [vector] +++ OK, passed 100 tests.
  11286. 1324.58 s [vector] zip3: OK
  11287. 1324.58 s [vector] +++ OK, passed 100 tests.
  11288. 1324.58 s [vector] unzip: OK
  11289. 1324.58 s [vector] +++ OK, passed 100 tests.
  11290. 1324.58 s [vector] unzip3: OK
  11291. 1324.58 s [vector] +++ OK, passed 100 tests.
  11292. 1324.58 s [vector] indexed: OK
  11293. 1324.58 s [vector] +++ OK, passed 100 tests.
  11294. 1324.58 s [vector] update: OK
  11295. 1324.58 s [vector] +++ OK, passed 100 tests.
  11296. 1324.58 s [vector] concat: OK
  11297. 1324.58 s [vector] +++ OK, passed 100 tests.
  11298. 1324.58 s [vector] mempty: OK
  11299. 1324.58 s [vector] +++ OK, passed 100 tests.
  11300. 1324.59 s [vector] mappend: OK
  11301. 1324.59 s [vector] +++ OK, passed 100 tests.
  11302. 1324.60 s [vector] mconcat: OK (0.02s)
  11303. 1324.60 s [vector] +++ OK, passed 100 tests.
  11304. 1324.60 s [vector] fmap: OK
  11305. 1324.60 s [vector] +++ OK, passed 100 tests.
  11306. 1324.61 s [vector] return: OK
  11307. 1324.61 s [vector] +++ OK, passed 100 tests.
  11308. 1324.63 s [vector] bind: OK (0.02s)
  11309. 1324.63 s [vector] +++ OK, passed 100 tests.
  11310. 1324.63 s [vector] mzip: OK
  11311. 1324.63 s [vector] +++ OK, passed 100 tests.
  11312. 1324.63 s [vector] munzip: OK
  11313. 1324.63 s [vector] +++ OK, passed 100 tests.
  11314. 1324.63 s [vector] applicative_pure: OK
  11315. 1324.63 s [vector] +++ OK, passed 100 tests.
  11316. 1324.66 s [vector] applicative_appl: OK (0.03s)
  11317. 1324.66 s [vector] +++ OK, passed 100 tests.
  11318. 1324.66 s [vector] alternative_empty: OK
  11319. 1324.67 s [vector] +++ OK, passed 100 tests.
  11320. 1324.67 s [vector] alternative_or: OK
  11321. 1324.67 s [vector] +++ OK, passed 100 tests.
  11322. 1324.71 s [vector] sequence: OK (0.04s)
  11323. 1324.71 s [vector] +++ OK, passed 100 tests.
  11324. 1324.71 s [vector] sequence_: OK (0.01s)
  11325. 1324.71 s [vector] +++ OK, passed 100 tests.
  11326. 1324.71 s [vector] glength: OK
  11327. 1324.71 s [vector] +++ OK, passed 100 tests.
  11328. 1324.71 s [vector] sum: OK
  11329. 1324.71 s [vector] +++ OK, passed 100 tests.
  11330. 1324.71 s [vector] product: OK
  11331. 1324.71 s [vector] +++ OK, passed 100 tests.
  11332. 1324.71 s [vector] enumFromN: OK
  11333. 1324.71 s [vector] +++ OK, passed 100 tests.
  11334. 1324.71 s [vector] enumFromThenN: OK
  11335. 1324.71 s [vector] +++ OK, passed 100 tests.
  11336. 1324.71 s [vector] enumFromTo: OK
  11337. 1324.71 s [vector] +++ OK, passed 100 tests.
  11338. 1324.71 s [vector] enumFromThenTo: OK
  11339. 1324.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11340. 1324.71 s [vector] unstream
  11341. 1324.71 s [vector] unstream == vunstream (exact): OK
  11342. 1324.71 s [vector] +++ OK, passed 100 tests.
  11343. 1324.71 s [vector] unstream == vunstream (unknown): OK
  11344. 1324.71 s [vector] +++ OK, passed 100 tests.
  11345. 1324.71 s [vector] unstreamR ~= vunstream (exact): OK
  11346. 1324.71 s [vector] +++ OK, passed 100 tests.
  11347. 1324.71 s [vector] unstreamR ~= vunstream (unknown): OK
  11348. 1324.71 s [vector] +++ OK, passed 100 tests.
  11349. 1324.71 s [vector] Tests.Vector.Primitive
  11350. 1324.71 s [vector] Int
  11351. 1324.71 s [vector] fromList.toList == id: OK
  11352. 1324.71 s [vector] +++ OK, passed 100 tests.
  11353. 1324.71 s [vector] toList.fromList == id: OK
  11354. 1324.71 s [vector] +++ OK, passed 100 tests.
  11355. 1324.71 s [vector] unstream.stream == id: OK
  11356. 1324.71 s [vector] +++ OK, passed 100 tests.
  11357. 1324.71 s [vector] stream.unstream == id: OK
  11358. 1324.71 s [vector] +++ OK, passed 100 tests.
  11359. 1324.71 s [vector] eq: OK
  11360. 1324.71 s [vector] +++ OK, passed 100 tests.
  11361. 1324.71 s [vector] length: OK
  11362. 1324.71 s [vector] +++ OK, passed 100 tests.
  11363. 1324.72 s [vector] null: OK
  11364. 1324.72 s [vector] +++ OK, passed 100 tests.
  11365. 1324.72 s [vector] index: OK
  11366. 1324.72 s [vector] +++ OK, passed 100 tests; 30 discarded.
  11367. 1324.72 s [vector] safeIndex: OK
  11368. 1324.72 s [vector] +++ OK, passed 100 tests.
  11369. 1324.72 s [vector] head: OK
  11370. 1324.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11371. 1324.72 s [vector] last: OK
  11372. 1324.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11373. 1324.72 s [vector] unsafeIndex: OK
  11374. 1324.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11375. 1324.72 s [vector] unsafeHead: OK
  11376. 1324.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11377. 1324.72 s [vector] unsafeLast: OK
  11378. 1324.72 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11379. 1324.72 s [vector] slice: OK
  11380. 1324.72 s [vector] +++ OK, passed 100 tests.
  11381. 1324.72 s [vector] init: OK
  11382. 1324.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11383. 1324.72 s [vector] tail: OK
  11384. 1324.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11385. 1324.72 s [vector] take: OK
  11386. 1324.72 s [vector] +++ OK, passed 100 tests.
  11387. 1324.73 s [vector] drop: OK
  11388. 1324.73 s [vector] +++ OK, passed 100 tests.
  11389. 1324.73 s [vector] splitAt: OK
  11390. 1324.73 s [vector] +++ OK, passed 100 tests.
  11391. 1324.73 s [vector] empty: OK
  11392. 1324.73 s [vector] +++ OK, passed 100 tests.
  11393. 1324.73 s [vector] singleton: OK
  11394. 1324.73 s [vector] +++ OK, passed 100 tests.
  11395. 1324.73 s [vector] replicate: OK
  11396. 1324.73 s [vector] +++ OK, passed 100 tests.
  11397. 1324.73 s [vector] generate: OK
  11398. 1324.73 s [vector] +++ OK, passed 100 tests.
  11399. 1324.73 s [vector] iterateN: OK
  11400. 1324.73 s [vector] +++ OK, passed 100 tests.
  11401. 1324.77 s [vector] iterateNM: OK (0.03s)
  11402. 1324.77 s [vector] +++ OK, passed 100 tests.
  11403. 1324.79 s [vector] generateM: OK (0.01s)
  11404. 1324.79 s [vector] +++ OK, passed 100 tests.
  11405. 1324.80 s [vector] replicateM: OK (0.02s)
  11406. 1324.80 s [vector] +++ OK, passed 100 tests.
  11407. 1324.80 s [vector] create: OK
  11408. 1324.80 s [vector] +++ OK, passed 100 tests.
  11409. 1324.80 s [vector] createT: OK
  11410. 1324.80 s [vector] +++ OK, passed 100 tests.
  11411. 1324.80 s [vector] unfoldr: OK
  11412. 1324.80 s [vector] +++ OK, passed 100 tests.
  11413. 1324.80 s [vector] unfoldrN: OK
  11414. 1324.80 s [vector] +++ OK, passed 100 tests.
  11415. 1324.80 s [vector] unfoldrExactN: OK
  11416. 1324.80 s [vector] +++ OK, passed 100 tests.
  11417. 1324.82 s [vector] unfoldrM: OK
  11418. 1324.82 s [vector] +++ OK, passed 100 tests.
  11419. 1324.82 s [vector] unfoldrNM: OK
  11420. 1324.82 s [vector] +++ OK, passed 100 tests.
  11421. 1324.84 s [vector] unfoldrExactNM: OK (0.02s)
  11422. 1324.85 s [vector] +++ OK, passed 100 tests.
  11423. 1324.85 s [vector] constructN: OK
  11424. 1324.85 s [vector] +++ OK, passed 100 tests.
  11425. 1324.85 s [vector] constructrN: OK
  11426. 1324.85 s [vector] +++ OK, passed 100 tests.
  11427. 1324.85 s [vector] cons: OK
  11428. 1324.85 s [vector] +++ OK, passed 100 tests.
  11429. 1324.86 s [vector] snoc: OK
  11430. 1324.86 s [vector] +++ OK, passed 100 tests.
  11431. 1324.86 s [vector] append: OK
  11432. 1324.86 s [vector] +++ OK, passed 100 tests.
  11433. 1324.86 s [vector] concat: OK (0.02s)
  11434. 1324.86 s [vector] +++ OK, passed 100 tests.
  11435. 1324.87 s [vector] force: OK
  11436. 1324.87 s [vector] +++ OK, passed 100 tests.
  11437. 1324.87 s [vector] upd: OK
  11438. 1324.87 s [vector] +++ OK, passed 100 tests.
  11439. 1324.87 s [vector] accum: OK
  11440. 1324.87 s [vector] +++ OK, passed 100 tests.
  11441. 1324.87 s [vector] reverse: OK
  11442. 1324.87 s [vector] +++ OK, passed 100 tests.
  11443. 1324.87 s [vector] backpermute: OK
  11444. 1324.88 s [vector] +++ OK, passed 100 tests.
  11445. 1324.88 s [vector] map: OK
  11446. 1324.88 s [vector] +++ OK, passed 100 tests.
  11447. 1324.89 s [vector] imap: OK
  11448. 1324.89 s [vector] +++ OK, passed 100 tests.
  11449. 1324.89 s [vector] concatMap: OK
  11450. 1324.89 s [vector] +++ OK, passed 100 tests.
  11451. 1324.90 s [vector] mapM: OK
  11452. 1324.90 s [vector] +++ OK, passed 100 tests.
  11453. 1324.90 s [vector] mapM_: OK (0.02s)
  11454. 1324.90 s [vector] +++ OK, passed 100 tests.
  11455. 1324.91 s [vector] forM: OK
  11456. 1324.91 s [vector] +++ OK, passed 100 tests.
  11457. 1324.92 s [vector] forM_: OK (0.02s)
  11458. 1324.93 s [vector] +++ OK, passed 100 tests.
  11459. 1324.93 s [vector] imapM: OK
  11460. 1324.93 s [vector] +++ OK, passed 100 tests.
  11461. 1324.94 s [vector] imapM_: OK (0.02s)
  11462. 1324.94 s [vector] +++ OK, passed 100 tests.
  11463. 1324.94 s [vector] zipWith: OK
  11464. 1324.94 s [vector] +++ OK, passed 100 tests.
  11465. 1324.94 s [vector] zipWith3: OK
  11466. 1324.94 s [vector] +++ OK, passed 100 tests.
  11467. 1324.94 s [vector] izipWith: OK
  11468. 1324.94 s [vector] +++ OK, passed 100 tests.
  11469. 1324.95 s [vector] izipWith3: OK
  11470. 1324.95 s [vector] +++ OK, passed 100 tests.
  11471. 1324.95 s [vector] izipWithM: OK
  11472. 1324.95 s [vector] +++ OK, passed 100 tests.
  11473. 1324.96 s [vector] izipWithM_: OK (0.01s)
  11474. 1324.97 s [vector] +++ OK, passed 100 tests.
  11475. 1324.97 s [vector] zipWithM: OK
  11476. 1324.97 s [vector] +++ OK, passed 100 tests.
  11477. 1324.98 s [vector] zipWithM_: OK (0.01s)
  11478. 1324.99 s [vector] +++ OK, passed 100 tests.
  11479. 1325.28 s [vector] filter: OK
  11480. 1325.28 s [vector] +++ OK, passed 100 tests.
  11481. 1325.28 s [vector] ifilter: OK
  11482. 1325.28 s [vector] +++ OK, passed 100 tests.
  11483. 1325.28 s [vector] filterM: OK (0.03s)
  11484. 1325.28 s [vector] +++ OK, passed 100 tests.
  11485. 1325.28 s [vector] uniq: OK
  11486. 1325.28 s [vector] +++ OK, passed 100 tests.
  11487. 1325.28 s [vector] mapMaybe: OK
  11488. 1325.28 s [vector] +++ OK, passed 100 tests.
  11489. 1325.28 s [vector] imapMaybe: OK
  11490. 1325.28 s [vector] +++ OK, passed 100 tests.
  11491. 1325.28 s [vector] takeWhile: OK
  11492. 1325.28 s [vector] +++ OK, passed 100 tests.
  11493. 1325.28 s [vector] dropWhile: OK
  11494. 1325.28 s [vector] +++ OK, passed 100 tests.
  11495. 1325.28 s [vector] partition: OK
  11496. 1325.28 s [vector] +++ OK, passed 100 tests.
  11497. 1325.28 s [vector] partitionWith: OK
  11498. 1325.28 s [vector] +++ OK, passed 100 tests.
  11499. 1325.28 s [vector] span: OK
  11500. 1325.28 s [vector] +++ OK, passed 100 tests.
  11501. 1325.28 s [vector] break: OK
  11502. 1325.28 s [vector] +++ OK, passed 100 tests.
  11503. 1325.28 s [vector] spanR: OK
  11504. 1325.28 s [vector] +++ OK, passed 100 tests.
  11505. 1325.28 s [vector] breakR: OK
  11506. 1325.28 s [vector] +++ OK, passed 100 tests.
  11507. 1325.28 s [vector] groupBy: OK
  11508. 1325.28 s [vector] +++ OK, passed 100 tests.
  11509. 1325.28 s [vector] elem: OK
  11510. 1325.28 s [vector] +++ OK, passed 100 tests.
  11511. 1325.28 s [vector] notElem: OK
  11512. 1325.28 s [vector] +++ OK, passed 100 tests.
  11513. 1325.28 s [vector] find: OK
  11514. 1325.28 s [vector] +++ OK, passed 100 tests.
  11515. 1325.28 s [vector] findIndex: OK
  11516. 1325.28 s [vector] +++ OK, passed 100 tests.
  11517. 1325.28 s [vector] findIndexR: OK
  11518. 1325.28 s [vector] +++ OK, passed 100 tests.
  11519. 1325.28 s [vector] findIndices: OK
  11520. 1325.28 s [vector] +++ OK, passed 100 tests.
  11521. 1325.28 s [vector] elemIndex: OK
  11522. 1325.28 s [vector] +++ OK, passed 100 tests.
  11523. 1325.28 s [vector] elemIndices: OK
  11524. 1325.28 s [vector] +++ OK, passed 100 tests.
  11525. 1325.28 s [vector] foldl: OK
  11526. 1325.28 s [vector] +++ OK, passed 100 tests.
  11527. 1325.28 s [vector] foldl1: OK
  11528. 1325.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11529. 1325.28 s [vector] foldl': OK
  11530. 1325.28 s [vector] +++ OK, passed 100 tests.
  11531. 1325.28 s [vector] foldl1': OK
  11532. 1325.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11533. 1325.28 s [vector] foldr: OK
  11534. 1325.28 s [vector] +++ OK, passed 100 tests.
  11535. 1325.28 s [vector] foldr1: OK
  11536. 1325.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11537. 1325.28 s [vector] foldr': OK
  11538. 1325.28 s [vector] +++ OK, passed 100 tests.
  11539. 1325.28 s [vector] foldr1': OK
  11540. 1325.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11541. 1325.28 s [vector] ifoldl: OK
  11542. 1325.28 s [vector] +++ OK, passed 100 tests.
  11543. 1325.28 s [vector] ifoldl': OK
  11544. 1325.28 s [vector] +++ OK, passed 100 tests.
  11545. 1325.28 s [vector] ifoldr: OK
  11546. 1325.28 s [vector] +++ OK, passed 100 tests.
  11547. 1325.28 s [vector] ifoldr': OK
  11548. 1325.28 s [vector] +++ OK, passed 100 tests.
  11549. 1325.28 s [vector] ifoldM: OK
  11550. 1325.28 s [vector] +++ OK, passed 100 tests.
  11551. 1325.28 s [vector] ifoldM': OK
  11552. 1325.28 s [vector] +++ OK, passed 100 tests.
  11553. 1325.28 s [vector] ifoldM_: OK (0.02s)
  11554. 1325.28 s [vector] +++ OK, passed 100 tests.
  11555. 1325.28 s [vector] ifoldM'_: OK (0.02s)
  11556. 1325.28 s [vector] +++ OK, passed 100 tests.
  11557. 1325.28 s [vector] all: OK
  11558. 1325.28 s [vector] +++ OK, passed 100 tests.
  11559. 1325.28 s [vector] any: OK
  11560. 1325.28 s [vector] +++ OK, passed 100 tests.
  11561. 1325.28 s [vector] prescanl: OK
  11562. 1325.28 s [vector] +++ OK, passed 100 tests.
  11563. 1325.28 s [vector] prescanl': OK
  11564. 1325.28 s [vector] +++ OK, passed 100 tests.
  11565. 1325.28 s [vector] postscanl: OK
  11566. 1325.28 s [vector] +++ OK, passed 100 tests.
  11567. 1325.28 s [vector] postscanl': OK
  11568. 1325.28 s [vector] +++ OK, passed 100 tests.
  11569. 1325.28 s [vector] scanl: OK
  11570. 1325.28 s [vector] +++ OK, passed 100 tests.
  11571. 1325.28 s [vector] scanl': OK
  11572. 1325.28 s [vector] +++ OK, passed 100 tests.
  11573. 1325.28 s [vector] scanl1: OK
  11574. 1325.28 s [vector] +++ OK, passed 100 tests.
  11575. 1325.28 s [vector] scanl1': OK
  11576. 1325.28 s [vector] +++ OK, passed 100 tests.
  11577. 1325.28 s [vector] iscanl: OK
  11578. 1325.28 s [vector] +++ OK, passed 100 tests.
  11579. 1325.28 s [vector] iscanl': OK
  11580. 1325.28 s [vector] +++ OK, passed 100 tests.
  11581. 1325.28 s [vector] prescanr: OK
  11582. 1325.28 s [vector] +++ OK, passed 100 tests.
  11583. 1325.28 s [vector] prescanr': OK
  11584. 1325.28 s [vector] +++ OK, passed 100 tests.
  11585. 1325.28 s [vector] postscanr: OK
  11586. 1325.28 s [vector] +++ OK, passed 100 tests.
  11587. 1325.28 s [vector] postscanr': OK
  11588. 1325.28 s [vector] +++ OK, passed 100 tests.
  11589. 1325.28 s [vector] scanr: OK
  11590. 1325.28 s [vector] +++ OK, passed 100 tests.
  11591. 1325.28 s [vector] scanr': OK
  11592. 1325.28 s [vector] +++ OK, passed 100 tests.
  11593. 1325.28 s [vector] scanr1: OK
  11594. 1325.28 s [vector] +++ OK, passed 100 tests.
  11595. 1325.28 s [vector] scanr1': OK
  11596. 1325.28 s [vector] +++ OK, passed 100 tests.
  11597. 1325.28 s [vector] iscanr: OK
  11598. 1325.28 s [vector] +++ OK, passed 100 tests.
  11599. 1325.28 s [vector] iscanr': OK
  11600. 1325.29 s [vector] +++ OK, passed 100 tests.
  11601. 1325.29 s [vector] mut_read: OK
  11602. 1325.29 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11603. 1325.29 s [vector] mut_write: OK
  11604. 1325.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11605. 1325.29 s [vector] mut_modify: OK
  11606. 1325.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11607. 1325.29 s [vector] mut_generate: OK
  11608. 1325.29 s [vector] +++ OK, passed 100 tests.
  11609. 1325.29 s [vector] mut_generateM: OK (0.02s)
  11610. 1325.29 s [vector] +++ OK, passed 100 tests.
  11611. 1325.29 s [vector] mut_mapM_: OK (0.02s)
  11612. 1325.29 s [vector] +++ OK, passed 100 tests.
  11613. 1325.29 s [vector] mut_imapM_: OK (0.01s)
  11614. 1325.29 s [vector] +++ OK, passed 100 tests.
  11615. 1325.29 s [vector] mut_forM_: OK (0.02s)
  11616. 1325.29 s [vector] +++ OK, passed 100 tests.
  11617. 1325.29 s [vector] mut_iforM_: OK (0.02s)
  11618. 1325.29 s [vector] +++ OK, passed 100 tests.
  11619. 1325.29 s [vector] mut_foldr: OK
  11620. 1325.29 s [vector] +++ OK, passed 100 tests.
  11621. 1325.30 s [vector] mut_foldr': OK
  11622. 1325.30 s [vector] +++ OK, passed 100 tests.
  11623. 1325.30 s [vector] mut_foldl: OK
  11624. 1325.30 s [vector] +++ OK, passed 100 tests.
  11625. 1325.30 s [vector] mut_foldl': OK
  11626. 1325.30 s [vector] +++ OK, passed 100 tests.
  11627. 1325.30 s [vector] mut_ifoldr: OK
  11628. 1325.30 s [vector] +++ OK, passed 100 tests.
  11629. 1325.30 s [vector] mut_ifoldr': OK
  11630. 1325.30 s [vector] +++ OK, passed 100 tests.
  11631. 1325.31 s [vector] mut_ifoldl: OK
  11632. 1325.31 s [vector] +++ OK, passed 100 tests.
  11633. 1325.32 s [vector] mut_ifoldl': OK
  11634. 1325.32 s [vector] +++ OK, passed 100 tests.
  11635. 1325.32 s [vector] mut_foldM: OK
  11636. 1325.32 s [vector] +++ OK, passed 100 tests.
  11637. 1325.32 s [vector] mut_foldM': OK
  11638. 1325.32 s [vector] +++ OK, passed 100 tests.
  11639. 1325.33 s [vector] mut_foldrM: OK
  11640. 1325.33 s [vector] +++ OK, passed 100 tests.
  11641. 1325.33 s [vector] mut_foldrM': OK
  11642. 1325.33 s [vector] +++ OK, passed 100 tests.
  11643. 1325.33 s [vector] mut_ifoldM: OK
  11644. 1325.33 s [vector] +++ OK, passed 100 tests.
  11645. 1325.33 s [vector] mut_ifoldM': OK
  11646. 1325.33 s [vector] +++ OK, passed 100 tests.
  11647. 1325.33 s [vector] mut_ifoldrM: OK
  11648. 1325.33 s [vector] +++ OK, passed 100 tests.
  11649. 1325.33 s [vector] mut_ifoldrM': OK
  11650. 1325.33 s [vector] +++ OK, passed 100 tests.
  11651. 1325.34 s [vector] compare: OK
  11652. 1325.34 s [vector] +++ OK, passed 100 tests.
  11653. 1325.34 s [vector] maximum: OK
  11654. 1325.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11655. 1325.34 s [vector] minimum: OK
  11656. 1325.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11657. 1325.34 s [vector] minIndex: OK
  11658. 1325.34 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11659. 1325.34 s [vector] maxIndex: OK
  11660. 1325.34 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11661. 1325.34 s [vector] maximumBy: OK
  11662. 1325.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11663. 1325.34 s [vector] minimumBy: OK
  11664. 1325.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11665. 1325.34 s [vector] maximumOn: OK
  11666. 1325.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11667. 1325.34 s [vector] minimumOn: OK
  11668. 1325.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11669. 1325.34 s [vector] maxIndexBy: OK
  11670. 1325.34 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11671. 1325.34 s [vector] minIndexBy: OK
  11672. 1325.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11673. 1325.34 s [vector] ListFirstMaxIndexWins: OK
  11674. 1325.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11675. 1325.34 s [vector] FalseListFirstMaxIndexWins: OK
  11676. 1325.34 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11677. 1325.34 s [vector] []
  11678. 1325.34 s [vector] mempty: OK
  11679. 1325.34 s [vector] +++ OK, passed 100 tests.
  11680. 1325.34 s [vector] mappend: OK
  11681. 1325.34 s [vector] +++ OK, passed 100 tests.
  11682. 1325.37 s [vector] mconcat: OK (0.02s)
  11683. 1325.37 s [vector] +++ OK, passed 100 tests.
  11684. 1325.37 s [vector] glength: OK
  11685. 1325.37 s [vector] +++ OK, passed 100 tests.
  11686. 1325.37 s [vector] sum: OK
  11687. 1325.37 s [vector] +++ OK, passed 100 tests.
  11688. 1325.37 s [vector] product: OK
  11689. 1325.37 s [vector] +++ OK, passed 100 tests.
  11690. 1325.37 s [vector] enumFromN: OK
  11691. 1325.37 s [vector] +++ OK, passed 100 tests.
  11692. 1325.37 s [vector] enumFromThenN: OK
  11693. 1325.37 s [vector] +++ OK, passed 100 tests.
  11694. 1325.37 s [vector] enumFromTo: OK
  11695. 1325.37 s [vector] +++ OK, passed 100 tests.
  11696. 1325.37 s [vector] enumFromThenTo: OK
  11697. 1325.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11698. 1325.37 s [vector] Double
  11699. 1325.38 s [vector] fromList.toList == id: OK
  11700. 1325.38 s [vector] +++ OK, passed 100 tests.
  11701. 1325.38 s [vector] toList.fromList == id: OK
  11702. 1325.38 s [vector] +++ OK, passed 100 tests.
  11703. 1325.38 s [vector] unstream.stream == id: OK
  11704. 1325.38 s [vector] +++ OK, passed 100 tests.
  11705. 1325.38 s [vector] stream.unstream == id: OK
  11706. 1325.38 s [vector] +++ OK, passed 100 tests.
  11707. 1325.38 s [vector] eq: OK
  11708. 1325.38 s [vector] +++ OK, passed 100 tests.
  11709. 1325.38 s [vector] length: OK
  11710. 1325.38 s [vector] +++ OK, passed 100 tests.
  11711. 1325.38 s [vector] null: OK
  11712. 1325.38 s [vector] +++ OK, passed 100 tests.
  11713. 1325.38 s [vector] index: OK
  11714. 1325.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11715. 1325.38 s [vector] safeIndex: OK
  11716. 1325.38 s [vector] +++ OK, passed 100 tests.
  11717. 1325.38 s [vector] head: OK
  11718. 1325.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11719. 1325.38 s [vector] last: OK
  11720. 1325.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11721. 1325.38 s [vector] unsafeIndex: OK
  11722. 1325.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11723. 1325.38 s [vector] unsafeHead: OK
  11724. 1325.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11725. 1325.38 s [vector] unsafeLast: OK
  11726. 1325.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11727. 1325.38 s [vector] slice: OK
  11728. 1325.38 s [vector] +++ OK, passed 100 tests.
  11729. 1325.38 s [vector] init: OK
  11730. 1325.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11731. 1325.39 s [vector] tail: OK
  11732. 1325.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11733. 1325.39 s [vector] take: OK
  11734. 1325.39 s [vector] +++ OK, passed 100 tests.
  11735. 1325.39 s [vector] drop: OK
  11736. 1325.39 s [vector] +++ OK, passed 100 tests.
  11737. 1325.39 s [vector] splitAt: OK
  11738. 1325.39 s [vector] +++ OK, passed 100 tests.
  11739. 1325.39 s [vector] empty: OK
  11740. 1325.39 s [vector] +++ OK, passed 100 tests.
  11741. 1325.39 s [vector] singleton: OK
  11742. 1325.39 s [vector] +++ OK, passed 100 tests.
  11743. 1325.39 s [vector] replicate: OK
  11744. 1325.39 s [vector] +++ OK, passed 100 tests.
  11745. 1325.39 s [vector] generate: OK
  11746. 1325.39 s [vector] +++ OK, passed 100 tests.
  11747. 1325.40 s [vector] iterateN: OK
  11748. 1325.41 s [vector] +++ OK, passed 100 tests.
  11749. 1325.43 s [vector] iterateNM: OK (0.02s)
  11750. 1325.43 s [vector] +++ OK, passed 100 tests.
  11751. 1325.45 s [vector] generateM: OK (0.03s)
  11752. 1325.45 s [vector] +++ OK, passed 100 tests.
  11753. 1325.46 s [vector] replicateM: OK
  11754. 1325.46 s [vector] +++ OK, passed 100 tests.
  11755. 1325.46 s [vector] create: OK
  11756. 1325.46 s [vector] +++ OK, passed 100 tests.
  11757. 1325.46 s [vector] createT: OK
  11758. 1325.46 s [vector] +++ OK, passed 100 tests.
  11759. 1325.46 s [vector] unfoldr: OK
  11760. 1325.46 s [vector] +++ OK, passed 100 tests.
  11761. 1325.46 s [vector] unfoldrN: OK
  11762. 1325.46 s [vector] +++ OK, passed 100 tests.
  11763. 1325.47 s [vector] unfoldrExactN: OK
  11764. 1325.47 s [vector] +++ OK, passed 100 tests.
  11765. 1325.47 s [vector] unfoldrM: OK
  11766. 1325.47 s [vector] +++ OK, passed 100 tests.
  11767. 1325.47 s [vector] unfoldrNM: OK
  11768. 1325.47 s [vector] +++ OK, passed 100 tests.
  11769. 1325.49 s [vector] unfoldrExactNM: OK (0.02s)
  11770. 1325.49 s [vector] +++ OK, passed 100 tests.
  11771. 1325.51 s [vector] constructN: OK (0.01s)
  11772. 1325.51 s [vector] +++ OK, passed 100 tests.
  11773. 1325.52 s [vector] constructrN: OK (0.02s)
  11774. 1325.52 s [vector] +++ OK, passed 100 tests.
  11775. 1325.52 s [vector] cons: OK
  11776. 1325.52 s [vector] +++ OK, passed 100 tests.
  11777. 1325.52 s [vector] snoc: OK
  11778. 1325.52 s [vector] +++ OK, passed 100 tests.
  11779. 1325.52 s [vector] append: OK
  11780. 1325.53 s [vector] +++ OK, passed 100 tests.
  11781. 1325.55 s [vector] concat: OK (0.02s)
  11782. 1325.55 s [vector] +++ OK, passed 100 tests.
  11783. 1325.55 s [vector] force: OK
  11784. 1325.55 s [vector] +++ OK, passed 100 tests.
  11785. 1325.55 s [vector] upd: OK
  11786. 1325.55 s [vector] +++ OK, passed 100 tests.
  11787. 1325.57 s [vector] accum: OK (0.02s)
  11788. 1325.57 s [vector] +++ OK, passed 100 tests.
  11789. 1325.57 s [vector] reverse: OK
  11790. 1325.57 s [vector] +++ OK, passed 100 tests.
  11791. 1325.57 s [vector] backpermute: OK
  11792. 1325.57 s [vector] +++ OK, passed 100 tests.
  11793. 1325.59 s [vector] map: OK
  11794. 1325.59 s [vector] +++ OK, passed 100 tests.
  11795. 1325.60 s [vector] imap: OK (0.01s)
  11796. 1325.60 s [vector] +++ OK, passed 100 tests.
  11797. 1325.61 s [vector] concatMap: OK (0.01s)
  11798. 1325.61 s [vector] +++ OK, passed 100 tests.
  11799. 1325.63 s [vector] mapM: OK (0.01s)
  11800. 1325.63 s [vector] +++ OK, passed 100 tests.
  11801. 1325.67 s [vector] mapM_: OK (0.06s)
  11802. 1325.67 s [vector] +++ OK, passed 100 tests.
  11803. 1325.69 s [vector] forM: OK (0.01s)
  11804. 1325.69 s [vector] +++ OK, passed 100 tests.
  11805. 1325.73 s [vector] forM_: OK (0.04s)
  11806. 1325.73 s [vector] +++ OK, passed 100 tests.
  11807. 1325.73 s [vector] imapM: OK
  11808. 1325.73 s [vector] +++ OK, passed 100 tests.
  11809. 1325.76 s [vector] imapM_: OK (0.04s)
  11810. 1325.76 s [vector] +++ OK, passed 100 tests.
  11811. 1325.79 s [vector] zipWith: OK
  11812. 1325.79 s [vector] +++ OK, passed 100 tests.
  11813. 1325.80 s [vector] zipWith3: OK (0.01s)
  11814. 1325.80 s [vector] +++ OK, passed 100 tests.
  11815. 1325.80 s [vector] izipWith: OK (0.01s)
  11816. 1325.80 s [vector] +++ OK, passed 100 tests.
  11817. 1325.81 s [vector] izipWith3: OK
  11818. 1325.81 s [vector] +++ OK, passed 100 tests.
  11819. 1325.83 s [vector] izipWithM: OK (0.01s)
  11820. 1325.83 s [vector] +++ OK, passed 100 tests.
  11821. 1325.85 s [vector] izipWithM_: OK (0.03s)
  11822. 1325.85 s [vector] +++ OK, passed 100 tests.
  11823. 1325.87 s [vector] zipWithM: OK
  11824. 1325.87 s [vector] +++ OK, passed 100 tests.
  11825. 1325.89 s [vector] zipWithM_: OK (0.03s)
  11826. 1325.89 s [vector] +++ OK, passed 100 tests.
  11827. 1325.90 s [vector] filter: OK
  11828. 1325.90 s [vector] +++ OK, passed 100 tests.
  11829. 1325.91 s [vector] ifilter: OK
  11830. 1325.91 s [vector] +++ OK, passed 100 tests.
  11831. 1325.96 s [vector] filterM: OK (0.05s)
  11832. 1325.96 s [vector] +++ OK, passed 100 tests.
  11833. 1325.97 s [vector] uniq: OK
  11834. 1325.97 s [vector] +++ OK, passed 100 tests.
  11835. 1325.97 s [vector] mapMaybe: OK
  11836. 1325.97 s [vector] +++ OK, passed 100 tests.
  11837. 1325.97 s [vector] imapMaybe: OK
  11838. 1325.98 s [vector] +++ OK, passed 100 tests.
  11839. 1325.98 s [vector] takeWhile: OK
  11840. 1325.98 s [vector] +++ OK, passed 100 tests.
  11841. 1325.98 s [vector] dropWhile: OK
  11842. 1325.98 s [vector] +++ OK, passed 100 tests.
  11843. 1325.99 s [vector] partition: OK
  11844. 1325.99 s [vector] +++ OK, passed 100 tests.
  11845. 1325.99 s [vector] partitionWith: OK
  11846. 1325.99 s [vector] +++ OK, passed 100 tests.
  11847. 1325.99 s [vector] span: OK
  11848. 1325.99 s [vector] +++ OK, passed 100 tests.
  11849. 1325.99 s [vector] break: OK
  11850. 1325.99 s [vector] +++ OK, passed 100 tests.
  11851. 1326.00 s [vector] spanR: OK
  11852. 1326.01 s [vector] +++ OK, passed 100 tests.
  11853. 1326.01 s [vector] breakR: OK
  11854. 1326.01 s [vector] +++ OK, passed 100 tests.
  11855. 1326.01 s [vector] groupBy: OK
  11856. 1326.01 s [vector] +++ OK, passed 100 tests.
  11857. 1326.01 s [vector] elem: OK
  11858. 1326.01 s [vector] +++ OK, passed 100 tests.
  11859. 1326.01 s [vector] notElem: OK
  11860. 1326.01 s [vector] +++ OK, passed 100 tests.
  11861. 1326.01 s [vector] find: OK
  11862. 1326.01 s [vector] +++ OK, passed 100 tests.
  11863. 1326.01 s [vector] findIndex: OK
  11864. 1326.01 s [vector] +++ OK, passed 100 tests.
  11865. 1326.01 s [vector] findIndexR: OK
  11866. 1326.01 s [vector] +++ OK, passed 100 tests.
  11867. 1326.02 s [vector] findIndices: OK
  11868. 1326.02 s [vector] +++ OK, passed 100 tests.
  11869. 1326.02 s [vector] elemIndex: OK
  11870. 1326.02 s [vector] +++ OK, passed 100 tests.
  11871. 1326.03 s [vector] elemIndices: OK
  11872. 1326.03 s [vector] +++ OK, passed 100 tests.
  11873. 1326.05 s [vector] foldl: OK (0.01s)
  11874. 1326.05 s [vector] +++ OK, passed 100 tests.
  11875. 1326.06 s [vector] foldl1: OK (0.01s)
  11876. 1326.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11877. 1326.07 s [vector] foldl': OK (0.01s)
  11878. 1326.08 s [vector] +++ OK, passed 100 tests.
  11879. 1326.09 s [vector] foldl1': OK (0.01s)
  11880. 1326.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11881. 1326.10 s [vector] foldr: OK (0.02s)
  11882. 1326.10 s [vector] +++ OK, passed 100 tests.
  11883. 1326.12 s [vector] foldr1: OK
  11884. 1326.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11885. 1326.14 s [vector] foldr': OK
  11886. 1326.14 s [vector] +++ OK, passed 100 tests.
  11887. 1326.17 s [vector] foldr1': OK (0.02s)
  11888. 1326.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11889. 1326.19 s [vector] ifoldl: OK (0.02s)
  11890. 1326.19 s [vector] +++ OK, passed 100 tests.
  11891. 1326.21 s [vector] ifoldl': OK (0.02s)
  11892. 1326.21 s [vector] +++ OK, passed 100 tests.
  11893. 1326.23 s [vector] ifoldr: OK (0.02s)
  11894. 1326.23 s [vector] +++ OK, passed 100 tests.
  11895. 1326.23 s [vector] ifoldr': OK (0.02s)
  11896. 1326.23 s [vector] +++ OK, passed 100 tests.
  11897. 1326.25 s [vector] ifoldM: OK (0.02s)
  11898. 1326.25 s [vector] +++ OK, passed 100 tests.
  11899. 1326.27 s [vector] ifoldM': OK (0.01s)
  11900. 1326.27 s [vector] +++ OK, passed 100 tests.
  11901. 1326.31 s [vector] ifoldM_: OK (0.03s)
  11902. 1326.31 s [vector] +++ OK, passed 100 tests.
  11903. 1326.33 s [vector] ifoldM'_: OK (0.03s)
  11904. 1326.33 s [vector] +++ OK, passed 100 tests.
  11905. 1326.33 s [vector] all: OK
  11906. 1326.33 s [vector] +++ OK, passed 100 tests.
  11907. 1326.35 s [vector] any: OK
  11908. 1326.35 s [vector] +++ OK, passed 100 tests.
  11909. 1326.36 s [vector] prescanl: OK (0.01s)
  11910. 1326.37 s [vector] +++ OK, passed 100 tests.
  11911. 1326.37 s [vector] prescanl': OK (0.01s)
  11912. 1326.37 s [vector] +++ OK, passed 100 tests.
  11913. 1326.38 s [vector] postscanl: OK (0.02s)
  11914. 1326.38 s [vector] +++ OK, passed 100 tests.
  11915. 1326.39 s [vector] postscanl': OK
  11916. 1326.39 s [vector] +++ OK, passed 100 tests.
  11917. 1326.41 s [vector] scanl: OK (0.01s)
  11918. 1326.41 s [vector] +++ OK, passed 100 tests.
  11919. 1326.43 s [vector] scanl': OK (0.02s)
  11920. 1326.43 s [vector] +++ OK, passed 100 tests.
  11921. 1326.45 s [vector] scanl1: OK (0.01s)
  11922. 1326.45 s [vector] +++ OK, passed 100 tests.
  11923. 1326.45 s [vector] scanl1': OK (0.01s)
  11924. 1326.45 s [vector] +++ OK, passed 100 tests.
  11925. 1326.47 s [vector] iscanl: OK (0.02s)
  11926. 1326.47 s [vector] +++ OK, passed 100 tests.
  11927. 1326.49 s [vector] iscanl': OK (0.02s)
  11928. 1326.49 s [vector] +++ OK, passed 100 tests.
  11929. 1326.51 s [vector] prescanr: OK (0.02s)
  11930. 1326.52 s [vector] +++ OK, passed 100 tests.
  11931. 1326.53 s [vector] prescanr': OK (0.02s)
  11932. 1326.53 s [vector] +++ OK, passed 100 tests.
  11933. 1326.55 s [vector] postscanr: OK (0.02s)
  11934. 1326.55 s [vector] +++ OK, passed 100 tests.
  11935. 1326.56 s [vector] postscanr': OK (0.01s)
  11936. 1326.56 s [vector] +++ OK, passed 100 tests.
  11937. 1326.57 s [vector] scanr: OK (0.02s)
  11938. 1326.58 s [vector] +++ OK, passed 100 tests.
  11939. 1326.61 s [vector] scanr': OK (0.03s)
  11940. 1326.61 s [vector] +++ OK, passed 100 tests.
  11941. 1326.61 s [vector] scanr1: OK (0.02s)
  11942. 1326.61 s [vector] +++ OK, passed 100 tests.
  11943. 1326.63 s [vector] scanr1': OK (0.01s)
  11944. 1326.63 s [vector] +++ OK, passed 100 tests.
  11945. 1326.65 s [vector] iscanr: OK (0.01s)
  11946. 1326.65 s [vector] +++ OK, passed 100 tests.
  11947. 1326.65 s [vector] iscanr': OK (0.01s)
  11948. 1326.65 s [vector] +++ OK, passed 100 tests.
  11949. 1326.65 s [vector] mut_read: OK
  11950. 1326.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11951. 1326.66 s [vector] mut_write: OK
  11952. 1326.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11953. 1326.66 s [vector] mut_modify: OK
  11954. 1326.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11955. 1326.66 s [vector] mut_generate: OK
  11956. 1326.67 s [vector] +++ OK, passed 100 tests.
  11957. 1326.67 s [vector] mut_generateM: OK (0.01s)
  11958. 1326.67 s [vector] +++ OK, passed 100 tests.
  11959. 1326.71 s [vector] mut_mapM_: OK (0.03s)
  11960. 1326.71 s [vector] +++ OK, passed 100 tests.
  11961. 1326.75 s [vector] mut_imapM_: OK (0.05s)
  11962. 1326.75 s [vector] +++ OK, passed 100 tests.
  11963. 1326.79 s [vector] mut_forM_: OK (0.04s)
  11964. 1326.79 s [vector] +++ OK, passed 100 tests.
  11965. 1326.83 s [vector] mut_iforM_: OK (0.05s)
  11966. 1326.83 s [vector] +++ OK, passed 100 tests.
  11967. 1326.85 s [vector] mut_foldr: OK (0.02s)
  11968. 1326.85 s [vector] +++ OK, passed 100 tests.
  11969. 1326.87 s [vector] mut_foldr': OK (0.02s)
  11970. 1326.88 s [vector] +++ OK, passed 100 tests.
  11971. 1326.89 s [vector] mut_foldl: OK (0.02s)
  11972. 1326.89 s [vector] +++ OK, passed 100 tests.
  11973. 1326.91 s [vector] mut_foldl': OK (0.02s)
  11974. 1326.91 s [vector] +++ OK, passed 100 tests.
  11975. 1326.93 s [vector] mut_ifoldr: OK (0.02s)
  11976. 1326.93 s [vector] +++ OK, passed 100 tests.
  11977. 1326.95 s [vector] mut_ifoldr': OK (0.02s)
  11978. 1326.95 s [vector] +++ OK, passed 100 tests.
  11979. 1326.97 s [vector] mut_ifoldl: OK (0.01s)
  11980. 1326.97 s [vector] +++ OK, passed 100 tests.
  11981. 1326.99 s [vector] mut_ifoldl': OK (0.01s)
  11982. 1326.99 s [vector] +++ OK, passed 100 tests.
  11983. 1326.99 s [vector] mut_foldM: OK (0.01s)
  11984. 1326.99 s [vector] +++ OK, passed 100 tests.
  11985. 1327.01 s [vector] mut_foldM': OK (0.01s)
  11986. 1327.01 s [vector] +++ OK, passed 100 tests.
  11987. 1327.03 s [vector] mut_foldrM: OK (0.01s)
  11988. 1327.03 s [vector] +++ OK, passed 100 tests.
  11989. 1327.03 s [vector] mut_foldrM': OK (0.01s)
  11990. 1327.03 s [vector] +++ OK, passed 100 tests.
  11991. 1327.05 s [vector] mut_ifoldM: OK (0.02s)
  11992. 1327.05 s [vector] +++ OK, passed 100 tests.
  11993. 1327.06 s [vector] mut_ifoldM': OK
  11994. 1327.06 s [vector] +++ OK, passed 100 tests.
  11995. 1327.08 s [vector] mut_ifoldrM: OK (0.02s)
  11996. 1327.08 s [vector] +++ OK, passed 100 tests.
  11997. 1327.10 s [vector] mut_ifoldrM': OK
  11998. 1327.10 s [vector] +++ OK, passed 100 tests.
  11999. 1327.10 s [vector] compare: OK
  12000. 1327.10 s [vector] +++ OK, passed 100 tests.
  12001. 1327.10 s [vector] maximum: OK
  12002. 1327.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12003. 1327.10 s [vector] minimum: OK
  12004. 1327.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12005. 1327.10 s [vector] minIndex: OK
  12006. 1327.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12007. 1327.10 s [vector] maxIndex: OK
  12008. 1327.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12009. 1327.10 s [vector] maximumBy: OK
  12010. 1327.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12011. 1327.10 s [vector] minimumBy: OK
  12012. 1327.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12013. 1327.10 s [vector] maximumOn: OK
  12014. 1327.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12015. 1327.10 s [vector] minimumOn: OK
  12016. 1327.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12017. 1327.10 s [vector] maxIndexBy: OK
  12018. 1327.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12019. 1327.10 s [vector] minIndexBy: OK
  12020. 1327.10 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12021. 1327.10 s [vector] ListFirstMaxIndexWins: OK
  12022. 1327.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12023. 1327.10 s [vector] FalseListFirstMaxIndexWins: OK
  12024. 1327.10 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12025. 1327.11 s [vector] []
  12026. 1327.11 s [vector] mempty: OK
  12027. 1327.11 s [vector] +++ OK, passed 100 tests.
  12028. 1327.12 s [vector] mappend: OK
  12029. 1327.12 s [vector] +++ OK, passed 100 tests.
  12030. 1327.13 s [vector] mconcat: OK (0.02s)
  12031. 1327.13 s [vector] +++ OK, passed 100 tests.
  12032. 1327.13 s [vector] glength: OK
  12033. 1327.13 s [vector] +++ OK, passed 100 tests.
  12034. 1327.13 s [vector] sum: OK
  12035. 1327.13 s [vector] +++ OK, passed 100 tests.
  12036. 1327.13 s [vector] product: OK
  12037. 1327.13 s [vector] +++ OK, passed 100 tests.
  12038. 1327.13 s [vector] enumFromN: OK
  12039. 1327.13 s [vector] +++ OK, passed 100 tests.
  12040. 1327.14 s [vector] enumFromThenN: OK
  12041. 1327.14 s [vector] +++ OK, passed 100 tests.
  12042. 1327.14 s [vector] enumFromTo: OK
  12043. 1327.14 s [vector] +++ OK, passed 100 tests.
  12044. 1327.14 s [vector] enumFromThenTo: OK
  12045. 1327.14 s [vector] +++ OK, passed 100 tests; 2 discarded.
  12046. 1327.14 s [vector] unstream
  12047. 1327.14 s [vector] unstream == vunstream (exact): OK
  12048. 1327.14 s [vector] +++ OK, passed 100 tests.
  12049. 1327.14 s [vector] unstream == vunstream (unknown): OK
  12050. 1327.14 s [vector] +++ OK, passed 100 tests.
  12051. 1327.14 s [vector] unstreamR ~= vunstream (exact): OK
  12052. 1327.14 s [vector] +++ OK, passed 100 tests.
  12053. 1327.14 s [vector] unstreamR ~= vunstream (unknown): OK
  12054. 1327.14 s [vector] +++ OK, passed 100 tests.
  12055. 1327.14 s [vector] Tests.Vector.Storable
  12056. 1327.14 s [vector] Data.Vector.Storable.Vector (Int)
  12057. 1327.15 s [vector] fromList.toList == id: OK
  12058. 1327.15 s [vector] +++ OK, passed 100 tests.
  12059. 1327.15 s [vector] toList.fromList == id: OK
  12060. 1327.15 s [vector] +++ OK, passed 100 tests.
  12061. 1327.15 s [vector] unstream.stream == id: OK
  12062. 1327.15 s [vector] +++ OK, passed 100 tests.
  12063. 1327.15 s [vector] stream.unstream == id: OK
  12064. 1327.15 s [vector] +++ OK, passed 100 tests.
  12065. 1327.15 s [vector] eq: OK
  12066. 1327.15 s [vector] +++ OK, passed 100 tests.
  12067. 1327.15 s [vector] length: OK
  12068. 1327.15 s [vector] +++ OK, passed 100 tests.
  12069. 1327.15 s [vector] null: OK
  12070. 1327.15 s [vector] +++ OK, passed 100 tests.
  12071. 1327.15 s [vector] index: OK
  12072. 1327.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12073. 1327.15 s [vector] safeIndex: OK
  12074. 1327.15 s [vector] +++ OK, passed 100 tests.
  12075. 1327.15 s [vector] head: OK
  12076. 1327.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12077. 1327.15 s [vector] last: OK
  12078. 1327.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12079. 1327.15 s [vector] unsafeIndex: OK
  12080. 1327.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12081. 1327.15 s [vector] unsafeHead: OK
  12082. 1327.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12083. 1327.15 s [vector] unsafeLast: OK
  12084. 1327.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12085. 1327.15 s [vector] slice: OK
  12086. 1327.15 s [vector] +++ OK, passed 100 tests.
  12087. 1327.16 s [vector] init: OK
  12088. 1327.16 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12089. 1327.16 s [vector] tail: OK
  12090. 1327.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12091. 1327.16 s [vector] take: OK
  12092. 1327.16 s [vector] +++ OK, passed 100 tests.
  12093. 1327.16 s [vector] drop: OK
  12094. 1327.16 s [vector] +++ OK, passed 100 tests.
  12095. 1327.16 s [vector] splitAt: OK
  12096. 1327.16 s [vector] +++ OK, passed 100 tests.
  12097. 1327.16 s [vector] empty: OK
  12098. 1327.16 s [vector] +++ OK, passed 100 tests.
  12099. 1327.16 s [vector] singleton: OK
  12100. 1327.16 s [vector] +++ OK, passed 100 tests.
  12101. 1327.16 s [vector] replicate: OK
  12102. 1327.16 s [vector] +++ OK, passed 100 tests.
  12103. 1327.16 s [vector] generate: OK
  12104. 1327.16 s [vector] +++ OK, passed 100 tests.
  12105. 1327.16 s [vector] iterateN: OK
  12106. 1327.16 s [vector] +++ OK, passed 100 tests.
  12107. 1327.21 s [vector] iterateNM: OK (0.02s)
  12108. 1327.21 s [vector] +++ OK, passed 100 tests.
  12109. 1327.24 s [vector] generateM: OK (0.03s)
  12110. 1327.24 s [vector] +++ OK, passed 100 tests.
  12111. 1327.25 s [vector] replicateM: OK (0.02s)
  12112. 1327.25 s [vector] +++ OK, passed 100 tests.
  12113. 1327.25 s [vector] create: OK
  12114. 1327.25 s [vector] +++ OK, passed 100 tests.
  12115. 1327.25 s [vector] createT: OK
  12116. 1327.25 s [vector] +++ OK, passed 100 tests.
  12117. 1327.25 s [vector] unfoldr: OK
  12118. 1327.25 s [vector] +++ OK, passed 100 tests.
  12119. 1327.26 s [vector] unfoldrN: OK
  12120. 1327.26 s [vector] +++ OK, passed 100 tests.
  12121. 1327.26 s [vector] unfoldrExactN: OK
  12122. 1327.26 s [vector] +++ OK, passed 100 tests.
  12123. 1327.26 s [vector] unfoldrM: OK
  12124. 1327.26 s [vector] +++ OK, passed 100 tests.
  12125. 1327.26 s [vector] unfoldrNM: OK
  12126. 1327.27 s [vector] +++ OK, passed 100 tests.
  12127. 1327.29 s [vector] unfoldrExactNM: OK (0.02s)
  12128. 1327.29 s [vector] +++ OK, passed 100 tests.
  12129. 1327.29 s [vector] constructN: OK
  12130. 1327.29 s [vector] +++ OK, passed 100 tests.
  12131. 1327.29 s [vector] constructrN: OK
  12132. 1327.30 s [vector] +++ OK, passed 100 tests.
  12133. 1327.30 s [vector] cons: OK
  12134. 1327.30 s [vector] +++ OK, passed 100 tests.
  12135. 1327.30 s [vector] snoc: OK
  12136. 1327.30 s [vector] +++ OK, passed 100 tests.
  12137. 1327.30 s [vector] append: OK
  12138. 1327.31 s [vector] +++ OK, passed 100 tests.
  12139. 1327.31 s [vector] concat: OK (0.02s)
  12140. 1327.31 s [vector] +++ OK, passed 100 tests.
  12141. 1327.32 s [vector] force: OK
  12142. 1327.32 s [vector] +++ OK, passed 100 tests.
  12143. 1327.32 s [vector] upd: OK
  12144. 1327.32 s [vector] +++ OK, passed 100 tests.
  12145. 1327.32 s [vector] accum: OK
  12146. 1327.32 s [vector] +++ OK, passed 100 tests.
  12147. 1327.32 s [vector] reverse: OK
  12148. 1327.32 s [vector] +++ OK, passed 100 tests.
  12149. 1327.32 s [vector] backpermute: OK
  12150. 1327.32 s [vector] +++ OK, passed 100 tests.
  12151. 1327.33 s [vector] map: OK
  12152. 1327.33 s [vector] +++ OK, passed 100 tests.
  12153. 1327.34 s [vector] imap: OK
  12154. 1327.34 s [vector] +++ OK, passed 100 tests.
  12155. 1327.34 s [vector] concatMap: OK
  12156. 1327.34 s [vector] +++ OK, passed 100 tests.
  12157. 1327.34 s [vector] mapM: OK
  12158. 1327.35 s [vector] +++ OK, passed 100 tests.
  12159. 1327.35 s [vector] mapM_: OK (0.02s)
  12160. 1327.35 s [vector] +++ OK, passed 100 tests.
  12161. 1327.36 s [vector] forM: OK
  12162. 1327.36 s [vector] +++ OK, passed 100 tests.
  12163. 1327.38 s [vector] forM_: OK (0.02s)
  12164. 1327.38 s [vector] +++ OK, passed 100 tests.
  12165. 1327.39 s [vector] imapM: OK
  12166. 1327.39 s [vector] +++ OK, passed 100 tests.
  12167. 1327.40 s [vector] imapM_: OK (0.02s)
  12168. 1327.40 s [vector] +++ OK, passed 100 tests.
  12169. 1327.40 s [vector] zipWith: OK
  12170. 1327.40 s [vector] +++ OK, passed 100 tests.
  12171. 1327.40 s [vector] zipWith3: OK
  12172. 1327.41 s [vector] +++ OK, passed 100 tests.
  12173. 1327.41 s [vector] izipWith: OK
  12174. 1327.41 s [vector] +++ OK, passed 100 tests.
  12175. 1327.41 s [vector] izipWith3: OK
  12176. 1327.41 s [vector] +++ OK, passed 100 tests.
  12177. 1327.41 s [vector] izipWithM: OK
  12178. 1327.41 s [vector] +++ OK, passed 100 tests.
  12179. 1327.43 s [vector] izipWithM_: OK (0.01s)
  12180. 1327.43 s [vector] +++ OK, passed 100 tests.
  12181. 1327.43 s [vector] zipWithM: OK
  12182. 1327.43 s [vector] +++ OK, passed 100 tests.
  12183. 1327.45 s [vector] zipWithM_: OK (0.01s)
  12184. 1327.45 s [vector] +++ OK, passed 100 tests.
  12185. 1327.45 s [vector] filter: OK
  12186. 1327.45 s [vector] +++ OK, passed 100 tests.
  12187. 1327.45 s [vector] ifilter: OK
  12188. 1327.45 s [vector] +++ OK, passed 100 tests.
  12189. 1327.48 s [vector] filterM: OK (0.03s)
  12190. 1327.48 s [vector] +++ OK, passed 100 tests.
  12191. 1327.48 s [vector] uniq: OK
  12192. 1327.48 s [vector] +++ OK, passed 100 tests.
  12193. 1327.48 s [vector] mapMaybe: OK
  12194. 1327.48 s [vector] +++ OK, passed 100 tests.
  12195. 1327.48 s [vector] imapMaybe: OK
  12196. 1327.48 s [vector] +++ OK, passed 100 tests.
  12197. 1327.49 s [vector] takeWhile: OK
  12198. 1327.49 s [vector] +++ OK, passed 100 tests.
  12199. 1327.49 s [vector] dropWhile: OK
  12200. 1327.49 s [vector] +++ OK, passed 100 tests.
  12201. 1327.49 s [vector] partition: OK
  12202. 1327.49 s [vector] +++ OK, passed 100 tests.
  12203. 1327.49 s [vector] partitionWith: OK
  12204. 1327.49 s [vector] +++ OK, passed 100 tests.
  12205. 1327.49 s [vector] span: OK
  12206. 1327.49 s [vector] +++ OK, passed 100 tests.
  12207. 1327.49 s [vector] break: OK
  12208. 1327.49 s [vector] +++ OK, passed 100 tests.
  12209. 1327.49 s [vector] spanR: OK
  12210. 1327.49 s [vector] +++ OK, passed 100 tests.
  12211. 1327.50 s [vector] breakR: OK
  12212. 1327.50 s [vector] +++ OK, passed 100 tests.
  12213. 1327.50 s [vector] groupBy: OK
  12214. 1327.50 s [vector] +++ OK, passed 100 tests.
  12215. 1327.50 s [vector] elem: OK
  12216. 1327.50 s [vector] +++ OK, passed 100 tests.
  12217. 1327.50 s [vector] notElem: OK
  12218. 1327.50 s [vector] +++ OK, passed 100 tests.
  12219. 1327.50 s [vector] find: OK
  12220. 1327.50 s [vector] +++ OK, passed 100 tests.
  12221. 1327.50 s [vector] findIndex: OK
  12222. 1327.50 s [vector] +++ OK, passed 100 tests.
  12223. 1327.50 s [vector] findIndexR: OK
  12224. 1327.51 s [vector] +++ OK, passed 100 tests.
  12225. 1327.51 s [vector] findIndices: OK
  12226. 1327.51 s [vector] +++ OK, passed 100 tests.
  12227. 1327.51 s [vector] elemIndex: OK
  12228. 1327.51 s [vector] +++ OK, passed 100 tests.
  12229. 1327.51 s [vector] elemIndices: OK
  12230. 1327.51 s [vector] +++ OK, passed 100 tests.
  12231. 1327.51 s [vector] foldl: OK
  12232. 1327.52 s [vector] +++ OK, passed 100 tests.
  12233. 1327.52 s [vector] foldl1: OK
  12234. 1327.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12235. 1327.52 s [vector] foldl': OK
  12236. 1327.53 s [vector] +++ OK, passed 100 tests.
  12237. 1327.53 s [vector] foldl1': OK
  12238. 1327.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12239. 1327.53 s [vector] foldr: OK
  12240. 1327.53 s [vector] +++ OK, passed 100 tests.
  12241. 1327.54 s [vector] foldr1: OK
  12242. 1327.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12243. 1327.54 s [vector] foldr': OK
  12244. 1327.54 s [vector] +++ OK, passed 100 tests.
  12245. 1327.55 s [vector] foldr1': OK
  12246. 1327.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12247. 1327.55 s [vector] ifoldl: OK
  12248. 1327.55 s [vector] +++ OK, passed 100 tests.
  12249. 1327.55 s [vector] ifoldl': OK
  12250. 1327.55 s [vector] +++ OK, passed 100 tests.
  12251. 1327.57 s [vector] ifoldr: OK
  12252. 1327.57 s [vector] +++ OK, passed 100 tests.
  12253. 1327.57 s [vector] ifoldr': OK
  12254. 1327.57 s [vector] +++ OK, passed 100 tests.
  12255. 1327.57 s [vector] ifoldM: OK
  12256. 1327.57 s [vector] +++ OK, passed 100 tests.
  12257. 1327.58 s [vector] ifoldM': OK
  12258. 1327.58 s [vector] +++ OK, passed 100 tests.
  12259. 1327.61 s [vector] ifoldM_: OK (0.02s)
  12260. 1327.61 s [vector] +++ OK, passed 100 tests.
  12261. 1327.63 s [vector] ifoldM'_: OK (0.03s)
  12262. 1327.63 s [vector] +++ OK, passed 100 tests.
  12263. 1327.63 s [vector] all: OK
  12264. 1327.63 s [vector] +++ OK, passed 100 tests.
  12265. 1327.63 s [vector] any: OK
  12266. 1327.63 s [vector] +++ OK, passed 100 tests.
  12267. 1327.64 s [vector] prescanl: OK
  12268. 1327.64 s [vector] +++ OK, passed 100 tests.
  12269. 1327.65 s [vector] prescanl': OK
  12270. 1327.65 s [vector] +++ OK, passed 100 tests.
  12271. 1327.65 s [vector] postscanl: OK
  12272. 1327.65 s [vector] +++ OK, passed 100 tests.
  12273. 1327.65 s [vector] postscanl': OK
  12274. 1327.65 s [vector] +++ OK, passed 100 tests.
  12275. 1327.66 s [vector] scanl: OK
  12276. 1327.66 s [vector] +++ OK, passed 100 tests.
  12277. 1327.66 s [vector] scanl': OK
  12278. 1327.66 s [vector] +++ OK, passed 100 tests.
  12279. 1327.66 s [vector] scanl1: OK
  12280. 1327.67 s [vector] +++ OK, passed 100 tests.
  12281. 1327.67 s [vector] scanl1': OK
  12282. 1327.67 s [vector] +++ OK, passed 100 tests.
  12283. 1327.68 s [vector] iscanl: OK
  12284. 1327.68 s [vector] +++ OK, passed 100 tests.
  12285. 1327.68 s [vector] iscanl': OK
  12286. 1327.68 s [vector] +++ OK, passed 100 tests.
  12287. 1327.69 s [vector] prescanr: OK
  12288. 1327.69 s [vector] +++ OK, passed 100 tests.
  12289. 1327.69 s [vector] prescanr': OK
  12290. 1327.69 s [vector] +++ OK, passed 100 tests.
  12291. 1327.69 s [vector] postscanr: OK
  12292. 1327.70 s [vector] +++ OK, passed 100 tests.
  12293. 1327.70 s [vector] postscanr': OK
  12294. 1327.71 s [vector] +++ OK, passed 100 tests.
  12295. 1327.71 s [vector] scanr: OK
  12296. 1327.71 s [vector] +++ OK, passed 100 tests.
  12297. 1327.71 s [vector] scanr': OK
  12298. 1327.71 s [vector] +++ OK, passed 100 tests.
  12299. 1327.71 s [vector] scanr1: OK
  12300. 1327.71 s [vector] +++ OK, passed 100 tests.
  12301. 1327.72 s [vector] scanr1': OK
  12302. 1327.73 s [vector] +++ OK, passed 100 tests.
  12303. 1327.73 s [vector] iscanr: OK
  12304. 1327.73 s [vector] +++ OK, passed 100 tests.
  12305. 1327.73 s [vector] iscanr': OK
  12306. 1327.73 s [vector] +++ OK, passed 100 tests.
  12307. 1327.73 s [vector] mut_read: OK
  12308. 1327.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12309. 1327.73 s [vector] mut_write: OK
  12310. 1327.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12311. 1327.73 s [vector] mut_modify: OK
  12312. 1327.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12313. 1327.75 s [vector] mut_generate: OK
  12314. 1327.75 s [vector] +++ OK, passed 100 tests.
  12315. 1327.75 s [vector] mut_generateM: OK (0.02s)
  12316. 1327.75 s [vector] +++ OK, passed 100 tests.
  12317. 1327.79 s [vector] mut_mapM_: OK (0.02s)
  12318. 1327.79 s [vector] +++ OK, passed 100 tests.
  12319. 1327.79 s [vector] mut_imapM_: OK (0.01s)
  12320. 1327.79 s [vector] +++ OK, passed 100 tests.
  12321. 1327.81 s [vector] mut_forM_: OK (0.01s)
  12322. 1327.81 s [vector] +++ OK, passed 100 tests.
  12323. 1327.82 s [vector] mut_iforM_: OK (0.02s)
  12324. 1327.82 s [vector] +++ OK, passed 100 tests.
  12325. 1327.82 s [vector] mut_foldr: OK
  12326. 1327.83 s [vector] +++ OK, passed 100 tests.
  12327. 1327.83 s [vector] mut_foldr': OK
  12328. 1327.83 s [vector] +++ OK, passed 100 tests.
  12329. 1327.84 s [vector] mut_foldl: OK
  12330. 1327.84 s [vector] +++ OK, passed 100 tests.
  12331. 1327.84 s [vector] mut_foldl': OK
  12332. 1327.84 s [vector] +++ OK, passed 100 tests.
  12333. 1327.84 s [vector] mut_ifoldr: OK
  12334. 1327.85 s [vector] +++ OK, passed 100 tests.
  12335. 1327.85 s [vector] mut_ifoldr': OK
  12336. 1327.86 s [vector] +++ OK, passed 100 tests.
  12337. 1327.86 s [vector] mut_ifoldl: OK
  12338. 1327.86 s [vector] +++ OK, passed 100 tests.
  12339. 1327.86 s [vector] mut_ifoldl': OK
  12340. 1327.86 s [vector] +++ OK, passed 100 tests.
  12341. 1327.86 s [vector] mut_foldM: OK
  12342. 1327.87 s [vector] +++ OK, passed 100 tests.
  12343. 1327.87 s [vector] mut_foldM': OK
  12344. 1327.88 s [vector] +++ OK, passed 100 tests.
  12345. 1327.88 s [vector] mut_foldrM: OK
  12346. 1327.88 s [vector] +++ OK, passed 100 tests.
  12347. 1327.88 s [vector] mut_foldrM': OK
  12348. 1327.88 s [vector] +++ OK, passed 100 tests.
  12349. 1327.89 s [vector] mut_ifoldM: OK
  12350. 1327.89 s [vector] +++ OK, passed 100 tests.
  12351. 1327.89 s [vector] mut_ifoldM': OK
  12352. 1327.89 s [vector] +++ OK, passed 100 tests.
  12353. 1327.89 s [vector] mut_ifoldrM: OK
  12354. 1327.89 s [vector] +++ OK, passed 100 tests.
  12355. 1327.89 s [vector] mut_ifoldrM': OK
  12356. 1327.89 s [vector] +++ OK, passed 100 tests.
  12357. 1327.90 s [vector] compare: OK
  12358. 1327.90 s [vector] +++ OK, passed 100 tests.
  12359. 1327.90 s [vector] maximum: OK
  12360. 1327.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12361. 1327.90 s [vector] minimum: OK
  12362. 1327.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12363. 1327.90 s [vector] minIndex: OK
  12364. 1327.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12365. 1327.90 s [vector] maxIndex: OK
  12366. 1327.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12367. 1327.90 s [vector] maximumBy: OK
  12368. 1327.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12369. 1327.90 s [vector] minimumBy: OK
  12370. 1327.90 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12371. 1327.90 s [vector] maximumOn: OK
  12372. 1327.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12373. 1327.90 s [vector] minimumOn: OK
  12374. 1327.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12375. 1327.90 s [vector] maxIndexBy: OK
  12376. 1327.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12377. 1327.90 s [vector] minIndexBy: OK
  12378. 1327.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12379. 1327.90 s [vector] ListFirstMaxIndexWins: OK
  12380. 1327.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12381. 1327.90 s [vector] FalseListFirstMaxIndexWins: OK
  12382. 1327.90 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12383. 1327.90 s [vector] []
  12384. 1327.90 s [vector] mempty: OK
  12385. 1327.90 s [vector] +++ OK, passed 100 tests.
  12386. 1327.91 s [vector] mappend: OK
  12387. 1327.91 s [vector] +++ OK, passed 100 tests.
  12388. 1327.92 s [vector] mconcat: OK (0.01s)
  12389. 1327.92 s [vector] +++ OK, passed 100 tests.
  12390. 1327.92 s [vector] glength: OK
  12391. 1327.92 s [vector] +++ OK, passed 100 tests.
  12392. 1327.92 s [vector] sum: OK
  12393. 1327.92 s [vector] +++ OK, passed 100 tests.
  12394. 1327.92 s [vector] product: OK
  12395. 1327.92 s [vector] +++ OK, passed 100 tests.
  12396. 1327.92 s [vector] enumFromN: OK
  12397. 1327.92 s [vector] +++ OK, passed 100 tests.
  12398. 1327.92 s [vector] enumFromThenN: OK
  12399. 1327.92 s [vector] +++ OK, passed 100 tests.
  12400. 1327.92 s [vector] enumFromTo: OK
  12401. 1327.92 s [vector] +++ OK, passed 100 tests.
  12402. 1327.92 s [vector] enumFromThenTo: OK
  12403. 1327.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12404. 1327.92 s [vector] Data.Vector.Storable.Vector (Double)
  12405. 1327.92 s [vector] fromList.toList == id: OK
  12406. 1327.92 s [vector] +++ OK, passed 100 tests.
  12407. 1327.92 s [vector] toList.fromList == id: OK
  12408. 1327.92 s [vector] +++ OK, passed 100 tests.
  12409. 1327.93 s [vector] unstream.stream == id: OK
  12410. 1327.93 s [vector] +++ OK, passed 100 tests.
  12411. 1327.93 s [vector] stream.unstream == id: OK
  12412. 1327.93 s [vector] +++ OK, passed 100 tests.
  12413. 1327.93 s [vector] eq: OK
  12414. 1327.93 s [vector] +++ OK, passed 100 tests.
  12415. 1327.93 s [vector] length: OK
  12416. 1327.93 s [vector] +++ OK, passed 100 tests.
  12417. 1327.93 s [vector] null: OK
  12418. 1327.93 s [vector] +++ OK, passed 100 tests.
  12419. 1327.93 s [vector] index: OK
  12420. 1327.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12421. 1327.93 s [vector] safeIndex: OK
  12422. 1327.93 s [vector] +++ OK, passed 100 tests.
  12423. 1327.93 s [vector] head: OK
  12424. 1327.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12425. 1327.94 s [vector] last: OK
  12426. 1327.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12427. 1327.94 s [vector] unsafeIndex: OK
  12428. 1327.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12429. 1327.94 s [vector] unsafeHead: OK
  12430. 1327.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12431. 1327.94 s [vector] unsafeLast: OK
  12432. 1327.94 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12433. 1327.94 s [vector] slice: OK
  12434. 1327.94 s [vector] +++ OK, passed 100 tests.
  12435. 1327.94 s [vector] init: OK
  12436. 1327.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12437. 1327.94 s [vector] tail: OK
  12438. 1327.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12439. 1327.94 s [vector] take: OK
  12440. 1327.94 s [vector] +++ OK, passed 100 tests.
  12441. 1327.94 s [vector] drop: OK
  12442. 1327.94 s [vector] +++ OK, passed 100 tests.
  12443. 1327.94 s [vector] splitAt: OK
  12444. 1327.94 s [vector] +++ OK, passed 100 tests.
  12445. 1327.94 s [vector] empty: OK
  12446. 1327.94 s [vector] +++ OK, passed 100 tests.
  12447. 1327.94 s [vector] singleton: OK
  12448. 1327.94 s [vector] +++ OK, passed 100 tests.
  12449. 1327.94 s [vector] replicate: OK
  12450. 1327.94 s [vector] +++ OK, passed 100 tests.
  12451. 1327.94 s [vector] generate: OK
  12452. 1327.94 s [vector] +++ OK, passed 100 tests.
  12453. 1327.95 s [vector] iterateN: OK
  12454. 1327.95 s [vector] +++ OK, passed 100 tests.
  12455. 1327.96 s [vector] iterateNM: OK (0.02s)
  12456. 1327.96 s [vector] +++ OK, passed 100 tests.
  12457. 1328.00 s [vector] generateM: OK (0.02s)
  12458. 1328.00 s [vector] +++ OK, passed 100 tests.
  12459. 1328.00 s [vector] replicateM: OK
  12460. 1328.00 s [vector] +++ OK, passed 100 tests.
  12461. 1328.00 s [vector] create: OK
  12462. 1328.00 s [vector] +++ OK, passed 100 tests.
  12463. 1328.01 s [vector] createT: OK
  12464. 1328.01 s [vector] +++ OK, passed 100 tests.
  12465. 1328.01 s [vector] unfoldr: OK
  12466. 1328.01 s [vector] +++ OK, passed 100 tests.
  12467. 1328.01 s [vector] unfoldrN: OK
  12468. 1328.01 s [vector] +++ OK, passed 100 tests.
  12469. 1328.01 s [vector] unfoldrExactN: OK
  12470. 1328.01 s [vector] +++ OK, passed 100 tests.
  12471. 1328.01 s [vector] unfoldrM: OK
  12472. 1328.01 s [vector] +++ OK, passed 100 tests.
  12473. 1328.01 s [vector] unfoldrNM: OK
  12474. 1328.01 s [vector] +++ OK, passed 100 tests.
  12475. 1328.05 s [vector] unfoldrExactNM: OK (0.03s)
  12476. 1328.05 s [vector] +++ OK, passed 100 tests.
  12477. 1328.07 s [vector] constructN: OK (0.02s)
  12478. 1328.07 s [vector] +++ OK, passed 100 tests.
  12479. 1328.07 s [vector] constructrN: OK (0.01s)
  12480. 1328.07 s [vector] +++ OK, passed 100 tests.
  12481. 1328.07 s [vector] cons: OK
  12482. 1328.08 s [vector] +++ OK, passed 100 tests.
  12483. 1328.08 s [vector] snoc: OK
  12484. 1328.08 s [vector] +++ OK, passed 100 tests.
  12485. 1328.08 s [vector] append: OK
  12486. 1328.08 s [vector] +++ OK, passed 100 tests.
  12487. 1328.10 s [vector] concat: OK (0.02s)
  12488. 1328.10 s [vector] +++ OK, passed 100 tests.
  12489. 1328.10 s [vector] force: OK
  12490. 1328.10 s [vector] +++ OK, passed 100 tests.
  12491. 1328.11 s [vector] upd: OK
  12492. 1328.11 s [vector] +++ OK, passed 100 tests.
  12493. 1328.11 s [vector] accum: OK (0.01s)
  12494. 1328.12 s [vector] +++ OK, passed 100 tests.
  12495. 1328.12 s [vector] reverse: OK
  12496. 1328.12 s [vector] +++ OK, passed 100 tests.
  12497. 1328.12 s [vector] backpermute: OK
  12498. 1328.12 s [vector] +++ OK, passed 100 tests.
  12499. 1328.13 s [vector] map: OK
  12500. 1328.13 s [vector] +++ OK, passed 100 tests.
  12501. 1328.14 s [vector] imap: OK (0.01s)
  12502. 1328.14 s [vector] +++ OK, passed 100 tests.
  12503. 1328.15 s [vector] concatMap: OK
  12504. 1328.15 s [vector] +++ OK, passed 100 tests.
  12505. 1328.16 s [vector] mapM: OK
  12506. 1328.16 s [vector] +++ OK, passed 100 tests.
  12507. 1328.21 s [vector] mapM_: OK (0.04s)
  12508. 1328.21 s [vector] +++ OK, passed 100 tests.
  12509. 1328.21 s [vector] forM: OK
  12510. 1328.21 s [vector] +++ OK, passed 100 tests.
  12511. 1328.27 s [vector] forM_: OK (0.06s)
  12512. 1328.28 s [vector] +++ OK, passed 100 tests.
  12513. 1328.29 s [vector] imapM: OK (0.02s)
  12514. 1328.30 s [vector] +++ OK, passed 100 tests.
  12515. 1328.35 s [vector] imapM_: OK (0.05s)
  12516. 1328.35 s [vector] +++ OK, passed 100 tests.
  12517. 1328.35 s [vector] zipWith: OK (0.01s)
  12518. 1328.35 s [vector] +++ OK, passed 100 tests.
  12519. 1328.37 s [vector] zipWith3: OK (0.01s)
  12520. 1328.37 s [vector] +++ OK, passed 100 tests.
  12521. 1328.38 s [vector] izipWith: OK
  12522. 1328.38 s [vector] +++ OK, passed 100 tests.
  12523. 1328.39 s [vector] izipWith3: OK (0.01s)
  12524. 1328.39 s [vector] +++ OK, passed 100 tests.
  12525. 1328.39 s [vector] izipWithM: OK (0.01s)
  12526. 1328.39 s [vector] +++ OK, passed 100 tests.
  12527. 1328.43 s [vector] izipWithM_: OK (0.04s)
  12528. 1328.43 s [vector] +++ OK, passed 100 tests.
  12529. 1328.43 s [vector] zipWithM: OK
  12530. 1328.45 s [vector] +++ OK, passed 100 tests.
  12531. 1328.46 s [vector] zipWithM_: OK (0.03s)
  12532. 1328.46 s [vector] +++ OK, passed 100 tests.
  12533. 1328.47 s [vector] filter: OK
  12534. 1328.47 s [vector] +++ OK, passed 100 tests.
  12535. 1328.49 s [vector] ifilter: OK
  12536. 1328.49 s [vector] +++ OK, passed 100 tests.
  12537. 1328.52 s [vector] filterM: OK (0.04s)
  12538. 1328.52 s [vector] +++ OK, passed 100 tests.
  12539. 1328.52 s [vector] uniq: OK
  12540. 1328.52 s [vector] +++ OK, passed 100 tests.
  12541. 1328.53 s [vector] mapMaybe: OK
  12542. 1328.53 s [vector] +++ OK, passed 100 tests.
  12543. 1328.54 s [vector] imapMaybe: OK
  12544. 1328.54 s [vector] +++ OK, passed 100 tests.
  12545. 1328.55 s [vector] takeWhile: OK
  12546. 1328.55 s [vector] +++ OK, passed 100 tests.
  12547. 1328.55 s [vector] dropWhile: OK
  12548. 1328.55 s [vector] +++ OK, passed 100 tests.
  12549. 1328.55 s [vector] partition: OK
  12550. 1328.57 s [vector] +++ OK, passed 100 tests.
  12551. 1328.57 s [vector] partitionWith: OK (0.01s)
  12552. 1328.57 s [vector] +++ OK, passed 100 tests.
  12553. 1328.57 s [vector] span: OK
  12554. 1328.57 s [vector] +++ OK, passed 100 tests.
  12555. 1328.57 s [vector] break: OK
  12556. 1328.57 s [vector] +++ OK, passed 100 tests.
  12557. 1328.58 s [vector] spanR: OK
  12558. 1328.58 s [vector] +++ OK, passed 100 tests.
  12559. 1328.58 s [vector] breakR: OK
  12560. 1328.58 s [vector] +++ OK, passed 100 tests.
  12561. 1328.59 s [vector] groupBy: OK (0.01s)
  12562. 1328.59 s [vector] +++ OK, passed 100 tests.
  12563. 1328.59 s [vector] elem: OK
  12564. 1328.59 s [vector] +++ OK, passed 100 tests.
  12565. 1328.59 s [vector] notElem: OK
  12566. 1328.60 s [vector] +++ OK, passed 100 tests.
  12567. 1328.60 s [vector] find: OK
  12568. 1328.60 s [vector] +++ OK, passed 100 tests.
  12569. 1328.60 s [vector] findIndex: OK
  12570. 1328.60 s [vector] +++ OK, passed 100 tests.
  12571. 1328.61 s [vector] findIndexR: OK
  12572. 1328.61 s [vector] +++ OK, passed 100 tests.
  12573. 1328.61 s [vector] findIndices: OK
  12574. 1328.61 s [vector] +++ OK, passed 100 tests.
  12575. 1328.61 s [vector] elemIndex: OK
  12576. 1328.61 s [vector] +++ OK, passed 100 tests.
  12577. 1328.61 s [vector] elemIndices: OK
  12578. 1328.61 s [vector] +++ OK, passed 100 tests.
  12579. 1328.63 s [vector] foldl: OK (0.01s)
  12580. 1328.63 s [vector] +++ OK, passed 100 tests.
  12581. 1328.64 s [vector] foldl1: OK (0.01s)
  12582. 1328.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12583. 1328.65 s [vector] foldl': OK (0.01s)
  12584. 1328.65 s [vector] +++ OK, passed 100 tests.
  12585. 1328.67 s [vector] foldl1': OK (0.01s)
  12586. 1328.67 s [vector] +++ OK, passed 100 tests; 10 discarded.
  12587. 1328.68 s [vector] foldr: OK (0.01s)
  12588. 1328.68 s [vector] +++ OK, passed 100 tests.
  12589. 1328.69 s [vector] foldr1: OK (0.01s)
  12590. 1328.69 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12591. 1328.71 s [vector] foldr': OK (0.01s)
  12592. 1328.71 s [vector] +++ OK, passed 100 tests.
  12593. 1328.71 s [vector] foldr1': OK (0.01s)
  12594. 1328.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12595. 1328.73 s [vector] ifoldl: OK (0.02s)
  12596. 1328.73 s [vector] +++ OK, passed 100 tests.
  12597. 1328.75 s [vector] ifoldl': OK (0.01s)
  12598. 1328.75 s [vector] +++ OK, passed 100 tests.
  12599. 1328.77 s [vector] ifoldr: OK (0.02s)
  12600. 1328.77 s [vector] +++ OK, passed 100 tests.
  12601. 1328.79 s [vector] ifoldr': OK (0.03s)
  12602. 1328.79 s [vector] +++ OK, passed 100 tests.
  12603. 1328.81 s [vector] ifoldM: OK (0.03s)
  12604. 1328.81 s [vector] +++ OK, passed 100 tests.
  12605. 1328.83 s [vector] ifoldM': OK (0.02s)
  12606. 1328.83 s [vector] +++ OK, passed 100 tests.
  12607. 1328.89 s [vector] ifoldM_: OK (0.05s)
  12608. 1328.89 s [vector] +++ OK, passed 100 tests.
  12609. 1328.92 s [vector] ifoldM'_: OK (0.04s)
  12610. 1328.92 s [vector] +++ OK, passed 100 tests.
  12611. 1328.92 s [vector] all: OK
  12612. 1328.92 s [vector] +++ OK, passed 100 tests.
  12613. 1328.93 s [vector] any: OK
  12614. 1328.94 s [vector] +++ OK, passed 100 tests.
  12615. 1328.95 s [vector] prescanl: OK (0.02s)
  12616. 1328.95 s [vector] +++ OK, passed 100 tests.
  12617. 1328.97 s [vector] prescanl': OK (0.02s)
  12618. 1328.98 s [vector] +++ OK, passed 100 tests.
  12619. 1328.99 s [vector] postscanl: OK (0.02s)
  12620. 1329.00 s [vector] +++ OK, passed 100 tests.
  12621. 1329.01 s [vector] postscanl': OK (0.02s)
  12622. 1329.02 s [vector] +++ OK, passed 100 tests.
  12623. 1329.02 s [vector] scanl: OK (0.01s)
  12624. 1329.02 s [vector] +++ OK, passed 100 tests.
  12625. 1329.03 s [vector] scanl': OK (0.01s)
  12626. 1329.04 s [vector] +++ OK, passed 100 tests.
  12627. 1329.05 s [vector] scanl1: OK (0.01s)
  12628. 1329.05 s [vector] +++ OK, passed 100 tests.
  12629. 1329.06 s [vector] scanl1': OK (0.02s)
  12630. 1329.06 s [vector] +++ OK, passed 100 tests.
  12631. 1329.07 s [vector] iscanl: OK (0.02s)
  12632. 1329.08 s [vector] +++ OK, passed 100 tests.
  12633. 1329.09 s [vector] iscanl': OK (0.02s)
  12634. 1329.09 s [vector] +++ OK, passed 100 tests.
  12635. 1329.11 s [vector] prescanr: OK (0.02s)
  12636. 1329.11 s [vector] +++ OK, passed 100 tests.
  12637. 1329.13 s [vector] prescanr': OK (0.01s)
  12638. 1329.13 s [vector] +++ OK, passed 100 tests.
  12639. 1329.13 s [vector] postscanr: OK (0.02s)
  12640. 1329.13 s [vector] +++ OK, passed 100 tests.
  12641. 1329.15 s [vector] postscanr': OK (0.01s)
  12642. 1329.15 s [vector] +++ OK, passed 100 tests.
  12643. 1329.17 s [vector] scanr: OK (0.01s)
  12644. 1329.17 s [vector] +++ OK, passed 100 tests.
  12645. 1329.17 s [vector] scanr': OK (0.01s)
  12646. 1329.17 s [vector] +++ OK, passed 100 tests.
  12647. 1329.19 s [vector] scanr1: OK (0.01s)
  12648. 1329.19 s [vector] +++ OK, passed 100 tests.
  12649. 1329.21 s [vector] scanr1': OK (0.01s)
  12650. 1329.21 s [vector] +++ OK, passed 100 tests.
  12651. 1329.22 s [vector] iscanr: OK (0.02s)
  12652. 1329.22 s [vector] +++ OK, passed 100 tests.
  12653. 1329.23 s [vector] iscanr': OK (0.02s)
  12654. 1329.23 s [vector] +++ OK, passed 100 tests.
  12655. 1329.23 s [vector] mut_read: OK
  12656. 1329.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12657. 1329.23 s [vector] mut_write: OK
  12658. 1329.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12659. 1329.23 s [vector] mut_modify: OK
  12660. 1329.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12661. 1329.23 s [vector] mut_generate: OK
  12662. 1329.23 s [vector] +++ OK, passed 100 tests.
  12663. 1329.25 s [vector] mut_generateM: OK (0.01s)
  12664. 1329.25 s [vector] +++ OK, passed 100 tests.
  12665. 1329.29 s [vector] mut_mapM_: OK (0.04s)
  12666. 1329.29 s [vector] +++ OK, passed 100 tests.
  12667. 1329.33 s [vector] mut_imapM_: OK (0.03s)
  12668. 1329.33 s [vector] +++ OK, passed 100 tests.
  12669. 1329.35 s [vector] mut_forM_: OK (0.04s)
  12670. 1329.35 s [vector] +++ OK, passed 100 tests.
  12671. 1329.39 s [vector] mut_iforM_: OK (0.03s)
  12672. 1329.39 s [vector] +++ OK, passed 100 tests.
  12673. 1329.41 s [vector] mut_foldr: OK (0.01s)
  12674. 1329.41 s [vector] +++ OK, passed 100 tests.
  12675. 1329.42 s [vector] mut_foldr': OK (0.01s)
  12676. 1329.42 s [vector] +++ OK, passed 100 tests.
  12677. 1329.43 s [vector] mut_foldl: OK (0.02s)
  12678. 1329.44 s [vector] +++ OK, passed 100 tests.
  12679. 1329.45 s [vector] mut_foldl': OK (0.02s)
  12680. 1329.45 s [vector] +++ OK, passed 100 tests.
  12681. 1329.47 s [vector] mut_ifoldr: OK (0.02s)
  12682. 1329.47 s [vector] +++ OK, passed 100 tests.
  12683. 1329.49 s [vector] mut_ifoldr': OK (0.02s)
  12684. 1329.49 s [vector] +++ OK, passed 100 tests.
  12685. 1329.51 s [vector] mut_ifoldl: OK (0.02s)
  12686. 1329.51 s [vector] +++ OK, passed 100 tests.
  12687. 1329.51 s [vector] mut_ifoldl': OK (0.01s)
  12688. 1329.51 s [vector] +++ OK, passed 100 tests.
  12689. 1329.53 s [vector] mut_foldM: OK (0.01s)
  12690. 1329.53 s [vector] +++ OK, passed 100 tests.
  12691. 1329.55 s [vector] mut_foldM': OK (0.01s)
  12692. 1329.55 s [vector] +++ OK, passed 100 tests.
  12693. 1329.56 s [vector] mut_foldrM: OK (0.01s)
  12694. 1329.56 s [vector] +++ OK, passed 100 tests.
  12695. 1329.56 s [vector] mut_foldrM': OK (0.02s)
  12696. 1329.57 s [vector] +++ OK, passed 100 tests.
  12697. 1329.59 s [vector] mut_ifoldM: OK (0.02s)
  12698. 1329.60 s [vector] +++ OK, passed 100 tests.
  12699. 1329.61 s [vector] mut_ifoldM': OK (0.01s)
  12700. 1329.61 s [vector] +++ OK, passed 100 tests.
  12701. 1329.61 s [vector] mut_ifoldrM: OK (0.01s)
  12702. 1329.61 s [vector] +++ OK, passed 100 tests.
  12703. 1329.63 s [vector] mut_ifoldrM': OK (0.02s)
  12704. 1329.63 s [vector] +++ OK, passed 100 tests.
  12705. 1329.63 s [vector] compare: OK
  12706. 1329.63 s [vector] +++ OK, passed 100 tests.
  12707. 1329.63 s [vector] maximum: OK
  12708. 1329.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12709. 1329.63 s [vector] minimum: OK
  12710. 1329.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12711. 1329.63 s [vector] minIndex: OK
  12712. 1329.63 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12713. 1329.63 s [vector] maxIndex: OK
  12714. 1329.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12715. 1329.63 s [vector] maximumBy: OK
  12716. 1329.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12717. 1329.63 s [vector] minimumBy: OK
  12718. 1329.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12719. 1329.63 s [vector] maximumOn: OK
  12720. 1329.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12721. 1329.64 s [vector] minimumOn: OK
  12722. 1329.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12723. 1329.64 s [vector] maxIndexBy: OK
  12724. 1329.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12725. 1329.64 s [vector] minIndexBy: OK
  12726. 1329.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12727. 1329.64 s [vector] ListFirstMaxIndexWins: OK
  12728. 1329.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12729. 1329.64 s [vector] FalseListFirstMaxIndexWins: OK
  12730. 1329.64 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12731. 1329.64 s [vector] []
  12732. 1329.64 s [vector] mempty: OK
  12733. 1329.64 s [vector] +++ OK, passed 100 tests.
  12734. 1329.65 s [vector] mappend: OK
  12735. 1329.65 s [vector] +++ OK, passed 100 tests.
  12736. 1329.66 s [vector] mconcat: OK (0.02s)
  12737. 1329.66 s [vector] +++ OK, passed 100 tests.
  12738. 1329.67 s [vector] glength: OK
  12739. 1329.67 s [vector] +++ OK, passed 100 tests.
  12740. 1329.67 s [vector] sum: OK
  12741. 1329.67 s [vector] +++ OK, passed 100 tests.
  12742. 1329.67 s [vector] product: OK
  12743. 1329.67 s [vector] +++ OK, passed 100 tests.
  12744. 1329.67 s [vector] enumFromN: OK
  12745. 1329.67 s [vector] +++ OK, passed 100 tests.
  12746. 1329.67 s [vector] enumFromThenN: OK
  12747. 1329.67 s [vector] +++ OK, passed 100 tests.
  12748. 1329.67 s [vector] enumFromTo: OK
  12749. 1329.67 s [vector] +++ OK, passed 100 tests.
  12750. 1329.67 s [vector] enumFromThenTo: OK
  12751. 1329.67 s [vector] +++ OK, passed 100 tests; 1 discarded.
  12752. 1329.67 s [vector] unstream
  12753. 1329.67 s [vector] unstream == vunstream (exact): OK
  12754. 1329.67 s [vector] +++ OK, passed 100 tests.
  12755. 1329.67 s [vector] unstream == vunstream (unknown): OK
  12756. 1329.67 s [vector] +++ OK, passed 100 tests.
  12757. 1329.67 s [vector] unstreamR ~= vunstream (exact): OK
  12758. 1329.67 s [vector] +++ OK, passed 100 tests.
  12759. 1329.67 s [vector] unstreamR ~= vunstream (unknown): OK
  12760. 1329.67 s [vector] +++ OK, passed 100 tests.
  12761. 1329.67 s [vector] Tests.Vector.Strict
  12762. 1329.67 s [vector] Bool
  12763. 1329.67 s [vector] fromList.toList == id: OK
  12764. 1329.67 s [vector] +++ OK, passed 100 tests.
  12765. 1329.67 s [vector] toList.fromList == id: OK
  12766. 1329.67 s [vector] +++ OK, passed 100 tests.
  12767. 1329.67 s [vector] unstream.stream == id: OK
  12768. 1329.67 s [vector] +++ OK, passed 100 tests.
  12769. 1329.67 s [vector] stream.unstream == id: OK
  12770. 1329.67 s [vector] +++ OK, passed 100 tests.
  12771. 1329.67 s [vector] eq: OK
  12772. 1329.67 s [vector] +++ OK, passed 100 tests.
  12773. 1329.67 s [vector] length: OK
  12774. 1329.67 s [vector] +++ OK, passed 100 tests.
  12775. 1329.67 s [vector] null: OK
  12776. 1329.67 s [vector] +++ OK, passed 100 tests.
  12777. 1329.68 s [vector] index: OK
  12778. 1329.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12779. 1329.68 s [vector] safeIndex: OK
  12780. 1329.68 s [vector] +++ OK, passed 100 tests.
  12781. 1329.68 s [vector] head: OK
  12782. 1329.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12783. 1329.68 s [vector] last: OK
  12784. 1329.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12785. 1329.68 s [vector] unsafeIndex: OK
  12786. 1329.68 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12787. 1329.68 s [vector] unsafeHead: OK
  12788. 1329.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12789. 1329.68 s [vector] unsafeLast: OK
  12790. 1329.68 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12791. 1329.68 s [vector] slice: OK
  12792. 1329.68 s [vector] +++ OK, passed 100 tests.
  12793. 1329.68 s [vector] init: OK
  12794. 1329.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12795. 1329.68 s [vector] tail: OK
  12796. 1329.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12797. 1329.68 s [vector] take: OK
  12798. 1329.68 s [vector] +++ OK, passed 100 tests.
  12799. 1329.68 s [vector] drop: OK
  12800. 1329.68 s [vector] +++ OK, passed 100 tests.
  12801. 1329.68 s [vector] splitAt: OK
  12802. 1329.68 s [vector] +++ OK, passed 100 tests.
  12803. 1329.68 s [vector] empty: OK
  12804. 1329.68 s [vector] +++ OK, passed 100 tests.
  12805. 1329.68 s [vector] singleton: OK
  12806. 1329.68 s [vector] +++ OK, passed 100 tests.
  12807. 1329.68 s [vector] replicate: OK
  12808. 1329.68 s [vector] +++ OK, passed 100 tests.
  12809. 1329.68 s [vector] generate: OK
  12810. 1329.68 s [vector] +++ OK, passed 100 tests.
  12811. 1329.68 s [vector] iterateN: OK
  12812. 1329.68 s [vector] +++ OK, passed 100 tests.
  12813. 1329.72 s [vector] iterateNM: OK (0.02s)
  12814. 1329.72 s [vector] +++ OK, passed 100 tests.
  12815. 1329.73 s [vector] generateM: OK (0.03s)
  12816. 1329.73 s [vector] +++ OK, passed 100 tests.
  12817. 1329.75 s [vector] replicateM: OK (0.02s)
  12818. 1329.75 s [vector] +++ OK, passed 100 tests.
  12819. 1329.75 s [vector] create: OK
  12820. 1329.75 s [vector] +++ OK, passed 100 tests.
  12821. 1329.75 s [vector] createT: OK
  12822. 1329.75 s [vector] +++ OK, passed 100 tests.
  12823. 1329.75 s [vector] unfoldr: OK
  12824. 1329.76 s [vector] +++ OK, passed 100 tests.
  12825. 1329.76 s [vector] unfoldrN: OK
  12826. 1329.76 s [vector] +++ OK, passed 100 tests.
  12827. 1329.76 s [vector] unfoldrExactN: OK
  12828. 1329.76 s [vector] +++ OK, passed 100 tests.
  12829. 1329.76 s [vector] unfoldrM: OK
  12830. 1329.76 s [vector] +++ OK, passed 100 tests.
  12831. 1329.76 s [vector] unfoldrNM: OK
  12832. 1329.76 s [vector] +++ OK, passed 100 tests.
  12833. 1329.78 s [vector] unfoldrExactNM: OK (0.01s)
  12834. 1329.78 s [vector] +++ OK, passed 100 tests.
  12835. 1329.78 s [vector] constructN: OK
  12836. 1329.78 s [vector] +++ OK, passed 100 tests.
  12837. 1329.78 s [vector] constructrN: OK
  12838. 1329.78 s [vector] +++ OK, passed 100 tests.
  12839. 1329.78 s [vector] cons: OK
  12840. 1329.78 s [vector] +++ OK, passed 100 tests.
  12841. 1329.78 s [vector] snoc: OK
  12842. 1329.78 s [vector] +++ OK, passed 100 tests.
  12843. 1329.79 s [vector] append: OK
  12844. 1329.79 s [vector] +++ OK, passed 100 tests.
  12845. 1329.79 s [vector] concat: OK
  12846. 1329.79 s [vector] +++ OK, passed 100 tests.
  12847. 1329.79 s [vector] force: OK
  12848. 1329.79 s [vector] +++ OK, passed 100 tests.
  12849. 1329.79 s [vector] upd: OK
  12850. 1329.79 s [vector] +++ OK, passed 100 tests.
  12851. 1329.79 s [vector] accum: OK
  12852. 1329.79 s [vector] +++ OK, passed 100 tests.
  12853. 1329.79 s [vector] reverse: OK
  12854. 1329.80 s [vector] +++ OK, passed 100 tests.
  12855. 1329.80 s [vector] backpermute: OK
  12856. 1329.80 s [vector] +++ OK, passed 100 tests.
  12857. 1329.80 s [vector] map: OK
  12858. 1329.80 s [vector] +++ OK, passed 100 tests.
  12859. 1329.80 s [vector] imap: OK
  12860. 1329.80 s [vector] +++ OK, passed 100 tests.
  12861. 1329.81 s [vector] concatMap: OK
  12862. 1329.81 s [vector] +++ OK, passed 100 tests.
  12863. 1329.81 s [vector] mapM: OK
  12864. 1329.81 s [vector] +++ OK, passed 100 tests.
  12865. 1329.81 s [vector] mapM_: OK (0.01s)
  12866. 1329.81 s [vector] +++ OK, passed 100 tests.
  12867. 1329.81 s [vector] forM: OK
  12868. 1329.82 s [vector] +++ OK, passed 100 tests.
  12869. 1329.83 s [vector] forM_: OK
  12870. 1329.83 s [vector] +++ OK, passed 100 tests.
  12871. 1329.83 s [vector] imapM: OK
  12872. 1329.83 s [vector] +++ OK, passed 100 tests.
  12873. 1329.84 s [vector] imapM_: OK (0.01s)
  12874. 1329.84 s [vector] +++ OK, passed 100 tests.
  12875. 1329.84 s [vector] zipWith: OK
  12876. 1329.84 s [vector] +++ OK, passed 100 tests.
  12877. 1329.84 s [vector] zipWith3: OK
  12878. 1329.84 s [vector] +++ OK, passed 100 tests.
  12879. 1329.85 s [vector] izipWith: OK
  12880. 1329.85 s [vector] +++ OK, passed 100 tests.
  12881. 1329.85 s [vector] izipWith3: OK
  12882. 1329.86 s [vector] +++ OK, passed 100 tests.
  12883. 1329.86 s [vector] izipWithM: OK
  12884. 1329.87 s [vector] +++ OK, passed 100 tests.
  12885. 1329.87 s [vector] izipWithM_: OK
  12886. 1329.87 s [vector] +++ OK, passed 100 tests.
  12887. 1329.87 s [vector] zipWithM: OK
  12888. 1329.87 s [vector] +++ OK, passed 100 tests.
  12889. 1329.87 s [vector] zipWithM_: OK
  12890. 1329.87 s [vector] +++ OK, passed 100 tests.
  12891. 1329.88 s [vector] filter: OK
  12892. 1329.88 s [vector] +++ OK, passed 100 tests.
  12893. 1329.88 s [vector] ifilter: OK
  12894. 1329.88 s [vector] +++ OK, passed 100 tests.
  12895. 1329.88 s [vector] filterM: OK (0.02s)
  12896. 1329.89 s [vector] +++ OK, passed 100 tests.
  12897. 1329.89 s [vector] uniq: OK
  12898. 1329.89 s [vector] +++ OK, passed 100 tests.
  12899. 1329.89 s [vector] mapMaybe: OK
  12900. 1329.89 s [vector] +++ OK, passed 100 tests.
  12901. 1329.89 s [vector] imapMaybe: OK
  12902. 1329.89 s [vector] +++ OK, passed 100 tests.
  12903. 1329.90 s [vector] takeWhile: OK
  12904. 1329.90 s [vector] +++ OK, passed 100 tests.
  12905. 1329.90 s [vector] dropWhile: OK
  12906. 1329.90 s [vector] +++ OK, passed 100 tests.
  12907. 1329.91 s [vector] partition: OK
  12908. 1329.91 s [vector] +++ OK, passed 100 tests.
  12909. 1329.91 s [vector] partitionWith: OK
  12910. 1329.91 s [vector] +++ OK, passed 100 tests.
  12911. 1329.91 s [vector] span: OK
  12912. 1329.92 s [vector] +++ OK, passed 100 tests.
  12913. 1329.92 s [vector] break: OK
  12914. 1329.92 s [vector] +++ OK, passed 100 tests.
  12915. 1329.92 s [vector] spanR: OK
  12916. 1329.92 s [vector] +++ OK, passed 100 tests.
  12917. 1329.92 s [vector] breakR: OK
  12918. 1329.92 s [vector] +++ OK, passed 100 tests.
  12919. 1329.92 s [vector] groupBy: OK
  12920. 1329.92 s [vector] +++ OK, passed 100 tests.
  12921. 1329.92 s [vector] elem: OK
  12922. 1329.92 s [vector] +++ OK, passed 100 tests.
  12923. 1329.92 s [vector] notElem: OK
  12924. 1329.92 s [vector] +++ OK, passed 100 tests.
  12925. 1329.92 s [vector] find: OK
  12926. 1329.92 s [vector] +++ OK, passed 100 tests.
  12927. 1329.92 s [vector] findIndex: OK
  12928. 1329.92 s [vector] +++ OK, passed 100 tests.
  12929. 1329.92 s [vector] findIndexR: OK
  12930. 1329.92 s [vector] +++ OK, passed 100 tests.
  12931. 1329.92 s [vector] findIndices: OK
  12932. 1329.93 s [vector] +++ OK, passed 100 tests.
  12933. 1329.93 s [vector] elemIndex: OK
  12934. 1329.93 s [vector] +++ OK, passed 100 tests.
  12935. 1329.93 s [vector] elemIndices: OK
  12936. 1329.93 s [vector] +++ OK, passed 100 tests.
  12937. 1329.93 s [vector] foldl: OK
  12938. 1329.93 s [vector] +++ OK, passed 100 tests.
  12939. 1329.93 s [vector] foldl1: OK
  12940. 1329.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12941. 1329.93 s [vector] foldl': OK
  12942. 1329.93 s [vector] +++ OK, passed 100 tests.
  12943. 1329.93 s [vector] foldl1': OK
  12944. 1329.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12945. 1329.93 s [vector] foldr: OK
  12946. 1329.94 s [vector] +++ OK, passed 100 tests.
  12947. 1329.94 s [vector] foldr1: OK
  12948. 1329.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12949. 1329.94 s [vector] foldr': OK
  12950. 1329.94 s [vector] +++ OK, passed 100 tests.
  12951. 1329.94 s [vector] foldr1': OK
  12952. 1329.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12953. 1329.94 s [vector] ifoldl: OK
  12954. 1329.94 s [vector] +++ OK, passed 100 tests.
  12955. 1329.95 s [vector] ifoldl': OK
  12956. 1329.95 s [vector] +++ OK, passed 100 tests.
  12957. 1329.95 s [vector] ifoldr: OK
  12958. 1329.95 s [vector] +++ OK, passed 100 tests.
  12959. 1329.95 s [vector] ifoldr': OK
  12960. 1329.95 s [vector] +++ OK, passed 100 tests.
  12961. 1329.95 s [vector] ifoldM: OK
  12962. 1329.95 s [vector] +++ OK, passed 100 tests.
  12963. 1329.95 s [vector] ifoldM': OK
  12964. 1329.97 s [vector] +++ OK, passed 100 tests.
  12965. 1329.98 s [vector] ifoldM_: OK (0.02s)
  12966. 1329.98 s [vector] +++ OK, passed 100 tests.
  12967. 1329.98 s [vector] ifoldM'_: OK (0.01s)
  12968. 1329.98 s [vector] +++ OK, passed 100 tests.
  12969. 1329.98 s [vector] all: OK
  12970. 1329.99 s [vector] +++ OK, passed 100 tests.
  12971. 1329.99 s [vector] any: OK
  12972. 1329.99 s [vector] +++ OK, passed 100 tests.
  12973. 1329.99 s [vector] prescanl: OK
  12974. 1329.99 s [vector] +++ OK, passed 100 tests.
  12975. 1329.99 s [vector] prescanl': OK
  12976. 1329.99 s [vector] +++ OK, passed 100 tests.
  12977. 1329.99 s [vector] postscanl: OK
  12978. 1329.99 s [vector] +++ OK, passed 100 tests.
  12979. 1329.99 s [vector] postscanl': OK
  12980. 1329.99 s [vector] +++ OK, passed 100 tests.
  12981. 1329.99 s [vector] scanl: OK
  12982. 1329.99 s [vector] +++ OK, passed 100 tests.
  12983. 1329.99 s [vector] scanl': OK
  12984. 1329.99 s [vector] +++ OK, passed 100 tests.
  12985. 1329.99 s [vector] scanl1: OK
  12986. 1330.20 s [vector] +++ OK, passed 100 tests.
  12987. 1330.20 s [vector] scanl1': OK
  12988. 1330.20 s [vector] +++ OK, passed 100 tests.
  12989. 1330.20 s [vector] iscanl: OK
  12990. 1330.20 s [vector] +++ OK, passed 100 tests.
  12991. 1330.20 s [vector] iscanl': OK
  12992. 1330.20 s [vector] +++ OK, passed 100 tests.
  12993. 1330.20 s [vector] prescanr: OK
  12994. 1330.20 s [vector] +++ OK, passed 100 tests.
  12995. 1330.20 s [vector] prescanr': OK
  12996. 1330.20 s [vector] +++ OK, passed 100 tests.
  12997. 1330.20 s [vector] postscanr: OK
  12998. 1330.20 s [vector] +++ OK, passed 100 tests.
  12999. 1330.20 s [vector] postscanr': OK
  13000. 1330.20 s [vector] +++ OK, passed 100 tests.
  13001. 1330.20 s [vector] scanr: OK
  13002. 1330.20 s [vector] +++ OK, passed 100 tests.
  13003. 1330.20 s [vector] scanr': OK
  13004. 1330.20 s [vector] +++ OK, passed 100 tests.
  13005. 1330.20 s [vector] scanr1: OK
  13006. 1330.20 s [vector] +++ OK, passed 100 tests.
  13007. 1330.20 s [vector] scanr1': OK
  13008. 1330.20 s [vector] +++ OK, passed 100 tests.
  13009. 1330.20 s [vector] iscanr: OK
  13010. 1330.20 s [vector] +++ OK, passed 100 tests.
  13011. 1330.20 s [vector] iscanr': OK
  13012. 1330.20 s [vector] +++ OK, passed 100 tests.
  13013. 1330.20 s [vector] mut_read: OK
  13014. 1330.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13015. 1330.20 s [vector] mut_write: OK
  13016. 1330.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13017. 1330.20 s [vector] mut_modify: OK
  13018. 1330.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13019. 1330.20 s [vector] mut_generate: OK
  13020. 1330.20 s [vector] +++ OK, passed 100 tests.
  13021. 1330.20 s [vector] mut_generateM: OK (0.01s)
  13022. 1330.20 s [vector] +++ OK, passed 100 tests.
  13023. 1330.20 s [vector] mut_mapM_: OK
  13024. 1330.20 s [vector] +++ OK, passed 100 tests.
  13025. 1330.20 s [vector] mut_imapM_: OK (0.01s)
  13026. 1330.20 s [vector] +++ OK, passed 100 tests.
  13027. 1330.20 s [vector] mut_forM_: OK (0.01s)
  13028. 1330.20 s [vector] +++ OK, passed 100 tests.
  13029. 1330.20 s [vector] mut_iforM_: OK (0.01s)
  13030. 1330.20 s [vector] +++ OK, passed 100 tests.
  13031. 1330.20 s [vector] mut_foldr: OK
  13032. 1330.20 s [vector] +++ OK, passed 100 tests.
  13033. 1330.20 s [vector] mut_foldr': OK
  13034. 1330.20 s [vector] +++ OK, passed 100 tests.
  13035. 1330.20 s [vector] mut_foldl: OK
  13036. 1330.20 s [vector] +++ OK, passed 100 tests.
  13037. 1330.20 s [vector] mut_foldl': OK
  13038. 1330.20 s [vector] +++ OK, passed 100 tests.
  13039. 1330.20 s [vector] mut_ifoldr: OK
  13040. 1330.20 s [vector] +++ OK, passed 100 tests.
  13041. 1330.20 s [vector] mut_ifoldr': OK
  13042. 1330.20 s [vector] +++ OK, passed 100 tests.
  13043. 1330.20 s [vector] mut_ifoldl: OK
  13044. 1330.20 s [vector] +++ OK, passed 100 tests.
  13045. 1330.20 s [vector] mut_ifoldl': OK
  13046. 1330.20 s [vector] +++ OK, passed 100 tests.
  13047. 1330.20 s [vector] mut_foldM: OK
  13048. 1330.20 s [vector] +++ OK, passed 100 tests.
  13049. 1330.20 s [vector] mut_foldM': OK
  13050. 1330.20 s [vector] +++ OK, passed 100 tests.
  13051. 1330.20 s [vector] mut_foldrM: OK
  13052. 1330.20 s [vector] +++ OK, passed 100 tests.
  13053. 1330.20 s [vector] mut_foldrM': OK
  13054. 1330.20 s [vector] +++ OK, passed 100 tests.
  13055. 1330.20 s [vector] mut_ifoldM: OK
  13056. 1330.20 s [vector] +++ OK, passed 100 tests.
  13057. 1330.20 s [vector] mut_ifoldM': OK
  13058. 1330.20 s [vector] +++ OK, passed 100 tests.
  13059. 1330.20 s [vector] mut_ifoldrM: OK
  13060. 1330.20 s [vector] +++ OK, passed 100 tests.
  13061. 1330.20 s [vector] mut_ifoldrM': OK
  13062. 1330.20 s [vector] +++ OK, passed 100 tests.
  13063. 1330.20 s [vector] compare: OK
  13064. 1330.20 s [vector] +++ OK, passed 100 tests.
  13065. 1330.20 s [vector] maximum: OK
  13066. 1330.20 s [vector] +++ OK, passed 100 tests; 10 discarded.
  13067. 1330.20 s [vector] minimum: OK
  13068. 1330.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13069. 1330.20 s [vector] minIndex: OK
  13070. 1330.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13071. 1330.20 s [vector] maxIndex: OK
  13072. 1330.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13073. 1330.20 s [vector] maximumBy: OK
  13074. 1330.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13075. 1330.20 s [vector] minimumBy: OK
  13076. 1330.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13077. 1330.20 s [vector] maximumOn: OK
  13078. 1330.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13079. 1330.20 s [vector] minimumOn: OK
  13080. 1330.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13081. 1330.20 s [vector] maxIndexBy: OK
  13082. 1330.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13083. 1330.20 s [vector] minIndexBy: OK
  13084. 1330.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13085. 1330.20 s [vector] ListFirstMaxIndexWins: OK
  13086. 1330.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13087. 1330.20 s [vector] FalseListFirstMaxIndexWins: OK
  13088. 1330.20 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  13089. 1330.20 s [vector] []
  13090. 1330.20 s [vector] zip: OK
  13091. 1330.20 s [vector] +++ OK, passed 100 tests.
  13092. 1330.20 s [vector] zip3: OK
  13093. 1330.20 s [vector] +++ OK, passed 100 tests.
  13094. 1330.20 s [vector] unzip: OK
  13095. 1330.20 s [vector] +++ OK, passed 100 tests.
  13096. 1330.20 s [vector] unzip3: OK
  13097. 1330.20 s [vector] +++ OK, passed 100 tests.
  13098. 1330.20 s [vector] indexed: OK
  13099. 1330.20 s [vector] +++ OK, passed 100 tests.
  13100. 1330.20 s [vector] update: OK
  13101. 1330.20 s [vector] +++ OK, passed 100 tests.
  13102. 1330.20 s [vector] concat: OK
  13103. 1330.20 s [vector] +++ OK, passed 100 tests.
  13104. 1330.20 s [vector] mempty: OK
  13105. 1330.20 s [vector] +++ OK, passed 100 tests.
  13106. 1330.20 s [vector] mappend: OK
  13107. 1330.20 s [vector] +++ OK, passed 100 tests.
  13108. 1330.20 s [vector] mconcat: OK
  13109. 1330.20 s [vector] +++ OK, passed 100 tests.
  13110. 1330.20 s [vector] fmap: OK
  13111. 1330.20 s [vector] +++ OK, passed 100 tests.
  13112. 1330.20 s [vector] return: OK
  13113. 1330.20 s [vector] +++ OK, passed 100 tests.
  13114. 1330.20 s [vector] bind: OK (0.01s)
  13115. 1330.20 s [vector] +++ OK, passed 100 tests.
  13116. 1330.20 s [vector] mzip: OK
  13117. 1330.20 s [vector] +++ OK, passed 100 tests.
  13118. 1330.20 s [vector] munzip: OK
  13119. 1330.20 s [vector] +++ OK, passed 100 tests.
  13120. 1330.20 s [vector] applicative_pure: OK
  13121. 1330.20 s [vector] +++ OK, passed 100 tests.
  13122. 1330.20 s [vector] applicative_appl: OK (0.01s)
  13123. 1330.20 s [vector] +++ OK, passed 100 tests.
  13124. 1330.20 s [vector] alternative_empty: OK
  13125. 1330.20 s [vector] +++ OK, passed 100 tests.
  13126. 1330.20 s [vector] alternative_or: OK
  13127. 1330.20 s [vector] +++ OK, passed 100 tests.
  13128. 1330.20 s [vector] sequence: OK (0.03s)
  13129. 1330.20 s [vector] +++ OK, passed 100 tests.
  13130. 1330.20 s [vector] sequence_: OK
  13131. 1330.20 s [vector] +++ OK, passed 100 tests.
  13132. 1330.20 s [vector] glength: OK
  13133. 1330.20 s [vector] +++ OK, passed 100 tests.
  13134. 1330.20 s [vector] and: OK
  13135. 1330.20 s [vector] +++ OK, passed 100 tests.
  13136. 1330.20 s [vector] or: OK
  13137. 1330.20 s [vector] +++ OK, passed 100 tests.
  13138. 1330.20 s [vector] Int
  13139. 1330.20 s [vector] fromList.toList == id: OK
  13140. 1330.20 s [vector] +++ OK, passed 100 tests.
  13141. 1330.20 s [vector] toList.fromList == id: OK
  13142. 1330.20 s [vector] +++ OK, passed 100 tests.
  13143. 1330.20 s [vector] unstream.stream == id: OK
  13144. 1330.20 s [vector] +++ OK, passed 100 tests.
  13145. 1330.20 s [vector] stream.unstream == id: OK
  13146. 1330.20 s [vector] +++ OK, passed 100 tests.
  13147. 1330.20 s [vector] eq: OK
  13148. 1330.20 s [vector] +++ OK, passed 100 tests.
  13149. 1330.20 s [vector] length: OK
  13150. 1330.20 s [vector] +++ OK, passed 100 tests.
  13151. 1330.20 s [vector] null: OK
  13152. 1330.20 s [vector] +++ OK, passed 100 tests.
  13153. 1330.20 s [vector] index: OK
  13154. 1330.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13155. 1330.20 s [vector] safeIndex: OK
  13156. 1330.20 s [vector] +++ OK, passed 100 tests.
  13157. 1330.20 s [vector] head: OK
  13158. 1330.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13159. 1330.20 s [vector] last: OK
  13160. 1330.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13161. 1330.20 s [vector] unsafeIndex: OK
  13162. 1330.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13163. 1330.20 s [vector] unsafeHead: OK
  13164. 1330.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13165. 1330.20 s [vector] unsafeLast: OK
  13166. 1330.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13167. 1330.20 s [vector] slice: OK
  13168. 1330.20 s [vector] +++ OK, passed 100 tests.
  13169. 1330.20 s [vector] init: OK
  13170. 1330.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13171. 1330.20 s [vector] tail: OK
  13172. 1330.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13173. 1330.20 s [vector] take: OK
  13174. 1330.20 s [vector] +++ OK, passed 100 tests.
  13175. 1330.20 s [vector] drop: OK
  13176. 1330.20 s [vector] +++ OK, passed 100 tests.
  13177. 1330.20 s [vector] splitAt: OK
  13178. 1330.20 s [vector] +++ OK, passed 100 tests.
  13179. 1330.20 s [vector] empty: OK
  13180. 1330.20 s [vector] +++ OK, passed 100 tests.
  13181. 1330.20 s [vector] singleton: OK
  13182. 1330.20 s [vector] +++ OK, passed 100 tests.
  13183. 1330.20 s [vector] replicate: OK
  13184. 1330.20 s [vector] +++ OK, passed 100 tests.
  13185. 1330.20 s [vector] generate: OK
  13186. 1330.21 s [vector] +++ OK, passed 100 tests.
  13187. 1330.21 s [vector] iterateN: OK
  13188. 1330.21 s [vector] +++ OK, passed 100 tests.
  13189. 1330.21 s [vector] iterateNM: OK (0.01s)
  13190. 1330.21 s [vector] +++ OK, passed 100 tests.
  13191. 1330.25 s [vector] generateM: OK (0.03s)
  13192. 1330.25 s [vector] +++ OK, passed 100 tests.
  13193. 1330.25 s [vector] replicateM: OK (0.02s)
  13194. 1330.25 s [vector] +++ OK, passed 100 tests.
  13195. 1330.25 s [vector] create: OK
  13196. 1330.25 s [vector] +++ OK, passed 100 tests.
  13197. 1330.25 s [vector] createT: OK
  13198. 1330.25 s [vector] +++ OK, passed 100 tests.
  13199. 1330.25 s [vector] unfoldr: OK
  13200. 1330.25 s [vector] +++ OK, passed 100 tests.
  13201. 1330.26 s [vector] unfoldrN: OK
  13202. 1330.26 s [vector] +++ OK, passed 100 tests.
  13203. 1330.26 s [vector] unfoldrExactN: OK
  13204. 1330.26 s [vector] +++ OK, passed 100 tests.
  13205. 1330.26 s [vector] unfoldrM: OK
  13206. 1330.26 s [vector] +++ OK, passed 100 tests.
  13207. 1330.26 s [vector] unfoldrNM: OK
  13208. 1330.27 s [vector] +++ OK, passed 100 tests.
  13209. 1330.29 s [vector] unfoldrExactNM: OK (0.02s)
  13210. 1330.29 s [vector] +++ OK, passed 100 tests.
  13211. 1330.29 s [vector] constructN: OK
  13212. 1330.29 s [vector] +++ OK, passed 100 tests.
  13213. 1330.29 s [vector] constructrN: OK
  13214. 1330.29 s [vector] +++ OK, passed 100 tests.
  13215. 1330.29 s [vector] cons: OK
  13216. 1330.29 s [vector] +++ OK, passed 100 tests.
  13217. 1330.29 s [vector] snoc: OK
  13218. 1330.29 s [vector] +++ OK, passed 100 tests.
  13219. 1330.29 s [vector] append: OK
  13220. 1330.29 s [vector] +++ OK, passed 100 tests.
  13221. 1330.30 s [vector] concat: OK (0.01s)
  13222. 1330.30 s [vector] +++ OK, passed 100 tests.
  13223. 1330.31 s [vector] force: OK
  13224. 1330.31 s [vector] +++ OK, passed 100 tests.
  13225. 1330.31 s [vector] upd: OK
  13226. 1330.31 s [vector] +++ OK, passed 100 tests.
  13227. 1330.31 s [vector] accum: OK
  13228. 1330.31 s [vector] +++ OK, passed 100 tests.
  13229. 1330.31 s [vector] reverse: OK
  13230. 1330.31 s [vector] +++ OK, passed 100 tests.
  13231. 1330.33 s [vector] backpermute: OK
  13232. 1330.33 s [vector] +++ OK, passed 100 tests.
  13233. 1330.33 s [vector] map: OK
  13234. 1330.33 s [vector] +++ OK, passed 100 tests.
  13235. 1330.33 s [vector] imap: OK
  13236. 1330.33 s [vector] +++ OK, passed 100 tests.
  13237. 1330.33 s [vector] concatMap: OK
  13238. 1330.33 s [vector] +++ OK, passed 100 tests.
  13239. 1330.33 s [vector] mapM: OK
  13240. 1330.34 s [vector] +++ OK, passed 100 tests.
  13241. 1330.34 s [vector] mapM_: OK (0.02s)
  13242. 1330.34 s [vector] +++ OK, passed 100 tests.
  13243. 1330.35 s [vector] forM: OK
  13244. 1330.35 s [vector] +++ OK, passed 100 tests.
  13245. 1330.35 s [vector] forM_: OK (0.02s)
  13246. 1330.35 s [vector] +++ OK, passed 100 tests.
  13247. 1330.35 s [vector] imapM: OK
  13248. 1330.35 s [vector] +++ OK, passed 100 tests.
  13249. 1330.37 s [vector] imapM_: OK (0.02s)
  13250. 1330.37 s [vector] +++ OK, passed 100 tests.
  13251. 1330.37 s [vector] zipWith: OK
  13252. 1330.37 s [vector] +++ OK, passed 100 tests.
  13253. 1330.38 s [vector] zipWith3: OK
  13254. 1330.38 s [vector] +++ OK, passed 100 tests.
  13255. 1330.38 s [vector] izipWith: OK
  13256. 1330.38 s [vector] +++ OK, passed 100 tests.
  13257. 1330.38 s [vector] izipWith3: OK
  13258. 1330.38 s [vector] +++ OK, passed 100 tests.
  13259. 1330.39 s [vector] izipWithM: OK
  13260. 1330.39 s [vector] +++ OK, passed 100 tests.
  13261. 1330.40 s [vector] izipWithM_: OK (0.01s)
  13262. 1330.40 s [vector] +++ OK, passed 100 tests.
  13263. 1330.41 s [vector] zipWithM: OK
  13264. 1330.41 s [vector] +++ OK, passed 100 tests.
  13265. 1330.41 s [vector] zipWithM_: OK (0.01s)
  13266. 1330.41 s [vector] +++ OK, passed 100 tests.
  13267. 1330.41 s [vector] filter: OK
  13268. 1330.41 s [vector] +++ OK, passed 100 tests.
  13269. 1330.41 s [vector] ifilter: OK
  13270. 1330.41 s [vector] +++ OK, passed 100 tests.
  13271. 1330.44 s [vector] filterM: OK (0.03s)
  13272. 1330.44 s [vector] +++ OK, passed 100 tests.
  13273. 1330.44 s [vector] uniq: OK
  13274. 1330.44 s [vector] +++ OK, passed 100 tests.
  13275. 1330.44 s [vector] mapMaybe: OK
  13276. 1330.44 s [vector] +++ OK, passed 100 tests.
  13277. 1330.44 s [vector] imapMaybe: OK
  13278. 1330.45 s [vector] +++ OK, passed 100 tests.
  13279. 1330.45 s [vector] takeWhile: OK
  13280. 1330.45 s [vector] +++ OK, passed 100 tests.
  13281. 1330.45 s [vector] dropWhile: OK
  13282. 1330.45 s [vector] +++ OK, passed 100 tests.
  13283. 1330.45 s [vector] partition: OK
  13284. 1330.45 s [vector] +++ OK, passed 100 tests.
  13285. 1330.45 s [vector] partitionWith: OK
  13286. 1330.45 s [vector] +++ OK, passed 100 tests.
  13287. 1330.45 s [vector] span: OK
  13288. 1330.45 s [vector] +++ OK, passed 100 tests.
  13289. 1330.45 s [vector] break: OK
  13290. 1330.45 s [vector] +++ OK, passed 100 tests.
  13291. 1330.45 s [vector] spanR: OK
  13292. 1330.45 s [vector] +++ OK, passed 100 tests.
  13293. 1330.45 s [vector] breakR: OK
  13294. 1330.45 s [vector] +++ OK, passed 100 tests.
  13295. 1330.45 s [vector] groupBy: OK
  13296. 1330.45 s [vector] +++ OK, passed 100 tests.
  13297. 1330.45 s [vector] elem: OK
  13298. 1330.45 s [vector] +++ OK, passed 100 tests.
  13299. 1330.46 s [vector] notElem: OK
  13300. 1330.46 s [vector] +++ OK, passed 100 tests.
  13301. 1330.46 s [vector] find: OK
  13302. 1330.46 s [vector] +++ OK, passed 100 tests.
  13303. 1330.46 s [vector] findIndex: OK
  13304. 1330.46 s [vector] +++ OK, passed 100 tests.
  13305. 1330.46 s [vector] findIndexR: OK
  13306. 1330.46 s [vector] +++ OK, passed 100 tests.
  13307. 1330.46 s [vector] findIndices: OK
  13308. 1330.46 s [vector] +++ OK, passed 100 tests.
  13309. 1330.46 s [vector] elemIndex: OK
  13310. 1330.46 s [vector] +++ OK, passed 100 tests.
  13311. 1330.46 s [vector] elemIndices: OK
  13312. 1330.46 s [vector] +++ OK, passed 100 tests.
  13313. 1330.46 s [vector] foldl: OK
  13314. 1330.46 s [vector] +++ OK, passed 100 tests.
  13315. 1330.46 s [vector] foldl1: OK
  13316. 1330.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13317. 1330.47 s [vector] foldl': OK
  13318. 1330.47 s [vector] +++ OK, passed 100 tests.
  13319. 1330.47 s [vector] foldl1': OK
  13320. 1330.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13321. 1330.47 s [vector] foldr: OK
  13322. 1330.47 s [vector] +++ OK, passed 100 tests.
  13323. 1330.47 s [vector] foldr1: OK
  13324. 1330.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13325. 1330.48 s [vector] foldr': OK
  13326. 1330.48 s [vector] +++ OK, passed 100 tests.
  13327. 1330.48 s [vector] foldr1': OK
  13328. 1330.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13329. 1330.49 s [vector] ifoldl: OK
  13330. 1330.49 s [vector] +++ OK, passed 100 tests.
  13331. 1330.49 s [vector] ifoldl': OK
  13332. 1330.49 s [vector] +++ OK, passed 100 tests.
  13333. 1330.49 s [vector] ifoldr: OK
  13334. 1330.49 s [vector] +++ OK, passed 100 tests.
  13335. 1330.49 s [vector] ifoldr': OK
  13336. 1330.49 s [vector] +++ OK, passed 100 tests.
  13337. 1330.49 s [vector] ifoldM: OK
  13338. 1330.49 s [vector] +++ OK, passed 100 tests.
  13339. 1330.49 s [vector] ifoldM': OK
  13340. 1330.49 s [vector] +++ OK, passed 100 tests.
  13341. 1330.53 s [vector] ifoldM_: OK
  13342. 1330.53 s [vector] +++ OK, passed 100 tests.
  13343. 1330.53 s [vector] ifoldM'_: OK (0.01s)
  13344. 1330.53 s [vector] +++ OK, passed 100 tests.
  13345. 1330.53 s [vector] all: OK
  13346. 1330.53 s [vector] +++ OK, passed 100 tests.
  13347. 1330.53 s [vector] any: OK
  13348. 1330.53 s [vector] +++ OK, passed 100 tests.
  13349. 1330.53 s [vector] prescanl: OK
  13350. 1330.53 s [vector] +++ OK, passed 100 tests.
  13351. 1330.53 s [vector] prescanl': OK
  13352. 1330.53 s [vector] +++ OK, passed 100 tests.
  13353. 1330.54 s [vector] postscanl: OK
  13354. 1330.54 s [vector] +++ OK, passed 100 tests.
  13355. 1330.54 s [vector] postscanl': OK
  13356. 1330.54 s [vector] +++ OK, passed 100 tests.
  13357. 1330.55 s [vector] scanl: OK
  13358. 1330.55 s [vector] +++ OK, passed 100 tests.
  13359. 1330.55 s [vector] scanl': OK
  13360. 1330.55 s [vector] +++ OK, passed 100 tests.
  13361. 1330.55 s [vector] scanl1: OK
  13362. 1330.55 s [vector] +++ OK, passed 100 tests.
  13363. 1330.56 s [vector] scanl1': OK
  13364. 1330.56 s [vector] +++ OK, passed 100 tests.
  13365. 1330.56 s [vector] iscanl: OK
  13366. 1330.56 s [vector] +++ OK, passed 100 tests.
  13367. 1330.56 s [vector] iscanl': OK
  13368. 1330.56 s [vector] +++ OK, passed 100 tests.
  13369. 1330.56 s [vector] prescanr: OK
  13370. 1330.57 s [vector] +++ OK, passed 100 tests.
  13371. 1330.57 s [vector] prescanr': OK
  13372. 1330.57 s [vector] +++ OK, passed 100 tests.
  13373. 1330.57 s [vector] postscanr: OK
  13374. 1330.57 s [vector] +++ OK, passed 100 tests.
  13375. 1330.57 s [vector] postscanr': OK
  13376. 1330.58 s [vector] +++ OK, passed 100 tests.
  13377. 1330.58 s [vector] scanr: OK
  13378. 1330.58 s [vector] +++ OK, passed 100 tests.
  13379. 1330.58 s [vector] scanr': OK
  13380. 1330.58 s [vector] +++ OK, passed 100 tests.
  13381. 1330.59 s [vector] scanr1: OK
  13382. 1330.59 s [vector] +++ OK, passed 100 tests.
  13383. 1330.59 s [vector] scanr1': OK
  13384. 1330.59 s [vector] +++ OK, passed 100 tests.
  13385. 1330.60 s [vector] iscanr: OK
  13386. 1330.60 s [vector] +++ OK, passed 100 tests.
  13387. 1330.60 s [vector] iscanr': OK
  13388. 1330.60 s [vector] +++ OK, passed 100 tests.
  13389. 1330.60 s [vector] mut_read: OK
  13390. 1330.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13391. 1330.60 s [vector] mut_write: OK
  13392. 1330.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13393. 1330.61 s [vector] mut_modify: OK
  13394. 1330.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13395. 1330.63 s [vector] mut_generate: OK
  13396. 1330.63 s [vector] +++ OK, passed 100 tests.
  13397. 1330.63 s [vector] mut_generateM: OK (0.01s)
  13398. 1330.63 s [vector] +++ OK, passed 100 tests.
  13399. 1330.63 s [vector] mut_mapM_: OK (0.01s)
  13400. 1330.63 s [vector] +++ OK, passed 100 tests.
  13401. 1330.65 s [vector] mut_imapM_: OK (0.01s)
  13402. 1330.65 s [vector] +++ OK, passed 100 tests.
  13403. 1330.66 s [vector] mut_forM_: OK (0.02s)
  13404. 1330.66 s [vector] +++ OK, passed 100 tests.
  13405. 1330.68 s [vector] mut_iforM_: OK
  13406. 1330.68 s [vector] +++ OK, passed 100 tests.
  13407. 1330.68 s [vector] mut_foldr: OK
  13408. 1330.68 s [vector] +++ OK, passed 100 tests.
  13409. 1330.69 s [vector] mut_foldr': OK
  13410. 1330.69 s [vector] +++ OK, passed 100 tests.
  13411. 1330.69 s [vector] mut_foldl: OK
  13412. 1330.69 s [vector] +++ OK, passed 100 tests.
  13413. 1330.69 s [vector] mut_foldl': OK
  13414. 1330.69 s [vector] +++ OK, passed 100 tests.
  13415. 1330.69 s [vector] mut_ifoldr: OK
  13416. 1330.69 s [vector] +++ OK, passed 100 tests.
  13417. 1330.69 s [vector] mut_ifoldr': OK
  13418. 1330.69 s [vector] +++ OK, passed 100 tests.
  13419. 1330.69 s [vector] mut_ifoldl: OK
  13420. 1330.69 s [vector] +++ OK, passed 100 tests.
  13421. 1330.70 s [vector] mut_ifoldl': OK
  13422. 1330.70 s [vector] +++ OK, passed 100 tests.
  13423. 1330.70 s [vector] mut_foldM: OK
  13424. 1330.70 s [vector] +++ OK, passed 100 tests.
  13425. 1330.71 s [vector] mut_foldM': OK
  13426. 1330.71 s [vector] +++ OK, passed 100 tests.
  13427. 1330.71 s [vector] mut_foldrM: OK
  13428. 1330.71 s [vector] +++ OK, passed 100 tests.
  13429. 1330.71 s [vector] mut_foldrM': OK
  13430. 1330.71 s [vector] +++ OK, passed 100 tests.
  13431. 1330.71 s [vector] mut_ifoldM: OK
  13432. 1330.71 s [vector] +++ OK, passed 100 tests.
  13433. 1330.72 s [vector] mut_ifoldM': OK
  13434. 1330.72 s [vector] +++ OK, passed 100 tests.
  13435. 1330.73 s [vector] mut_ifoldrM: OK
  13436. 1330.73 s [vector] +++ OK, passed 100 tests.
  13437. 1330.73 s [vector] mut_ifoldrM': OK
  13438. 1330.73 s [vector] +++ OK, passed 100 tests.
  13439. 1330.73 s [vector] compare: OK
  13440. 1330.73 s [vector] +++ OK, passed 100 tests.
  13441. 1330.73 s [vector] maximum: OK
  13442. 1330.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13443. 1330.73 s [vector] minimum: OK
  13444. 1330.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13445. 1330.73 s [vector] minIndex: OK
  13446. 1330.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13447. 1330.73 s [vector] maxIndex: OK
  13448. 1330.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13449. 1330.73 s [vector] maximumBy: OK
  13450. 1330.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13451. 1330.73 s [vector] minimumBy: OK
  13452. 1330.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13453. 1330.73 s [vector] maximumOn: OK
  13454. 1330.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13455. 1330.73 s [vector] minimumOn: OK
  13456. 1330.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13457. 1330.73 s [vector] maxIndexBy: OK
  13458. 1330.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13459. 1330.73 s [vector] minIndexBy: OK
  13460. 1330.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13461. 1330.74 s [vector] ListFirstMaxIndexWins: OK
  13462. 1330.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13463. 1330.74 s [vector] FalseListFirstMaxIndexWins: OK
  13464. 1330.74 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  13465. 1330.74 s [vector] []
  13466. 1330.74 s [vector] zip: OK
  13467. 1330.74 s [vector] +++ OK, passed 100 tests.
  13468. 1330.74 s [vector] zip3: OK
  13469. 1330.74 s [vector] +++ OK, passed 100 tests.
  13470. 1330.74 s [vector] unzip: OK
  13471. 1330.74 s [vector] +++ OK, passed 100 tests.
  13472. 1330.74 s [vector] unzip3: OK
  13473. 1330.74 s [vector] +++ OK, passed 100 tests.
  13474. 1330.74 s [vector] indexed: OK
  13475. 1330.74 s [vector] +++ OK, passed 100 tests.
  13476. 1330.75 s [vector] update: OK
  13477. 1330.75 s [vector] +++ OK, passed 100 tests.
  13478. 1330.76 s [vector] concat: OK (0.01s)
  13479. 1330.76 s [vector] +++ OK, passed 100 tests.
  13480. 1330.77 s [vector] mempty: OK
  13481. 1330.77 s [vector] +++ OK, passed 100 tests.
  13482. 1330.77 s [vector] mappend: OK
  13483. 1330.77 s [vector] +++ OK, passed 100 tests.
  13484. 1330.78 s [vector] mconcat: OK (0.01s)
  13485. 1330.78 s [vector] +++ OK, passed 100 tests.
  13486. 1330.78 s [vector] fmap: OK
  13487. 1330.78 s [vector] +++ OK, passed 100 tests.
  13488. 1330.79 s [vector] return: OK
  13489. 1330.79 s [vector] +++ OK, passed 100 tests.
  13490. 1330.80 s [vector] bind: OK (0.02s)
  13491. 1330.80 s [vector] +++ OK, passed 100 tests.
  13492. 1330.80 s [vector] mzip: OK
  13493. 1330.81 s [vector] +++ OK, passed 100 tests.
  13494. 1330.82 s [vector] munzip: OK
  13495. 1330.82 s [vector] +++ OK, passed 100 tests.
  13496. 1330.82 s [vector] applicative_pure: OK
  13497. 1330.82 s [vector] +++ OK, passed 100 tests.
  13498. 1330.83 s [vector] applicative_appl: OK (0.03s)
  13499. 1330.83 s [vector] +++ OK, passed 100 tests.
  13500. 1330.85 s [vector] alternative_empty: OK
  13501. 1330.85 s [vector] +++ OK, passed 100 tests.
  13502. 1330.85 s [vector] alternative_or: OK
  13503. 1330.85 s [vector] +++ OK, passed 100 tests.
  13504. 1330.87 s [vector] sequence: OK (0.02s)
  13505. 1330.87 s [vector] +++ OK, passed 100 tests.
  13506. 1330.87 s [vector] sequence_: OK (0.01s)
  13507. 1330.87 s [vector] +++ OK, passed 100 tests.
  13508. 1330.87 s [vector] glength: OK
  13509. 1330.87 s [vector] +++ OK, passed 100 tests.
  13510. 1330.87 s [vector] sum: OK
  13511. 1330.87 s [vector] +++ OK, passed 100 tests.
  13512. 1330.87 s [vector] product: OK
  13513. 1330.87 s [vector] +++ OK, passed 100 tests.
  13514. 1330.87 s [vector] enumFromN: OK
  13515. 1330.87 s [vector] +++ OK, passed 100 tests.
  13516. 1330.87 s [vector] enumFromThenN: OK
  13517. 1330.87 s [vector] +++ OK, passed 100 tests.
  13518. 1330.87 s [vector] enumFromTo: OK
  13519. 1330.87 s [vector] +++ OK, passed 100 tests.
  13520. 1330.87 s [vector] enumFromThenTo: OK
  13521. 1330.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13522. 1330.87 s [vector] unstream
  13523. 1330.87 s [vector] unstream == vunstream (exact): OK
  13524. 1330.87 s [vector] +++ OK, passed 100 tests.
  13525. 1330.87 s [vector] unstream == vunstream (unknown): OK
  13526. 1330.87 s [vector] +++ OK, passed 100 tests.
  13527. 1330.87 s [vector] unstreamR ~= vunstream (exact): OK
  13528. 1330.87 s [vector] +++ OK, passed 100 tests.
  13529. 1330.87 s [vector] unstreamR ~= vunstream (unknown): OK
  13530. 1330.87 s [vector] +++ OK, passed 100 tests.
  13531. 1330.87 s [vector] Tests.Vector.Unboxed
  13532. 1330.87 s [vector] ()
  13533. 1330.87 s [vector] fromList.toList == id: OK
  13534. 1330.87 s [vector] +++ OK, passed 100 tests.
  13535. 1330.87 s [vector] toList.fromList == id: OK
  13536. 1330.87 s [vector] +++ OK, passed 100 tests.
  13537. 1330.87 s [vector] unstream.stream == id: OK
  13538. 1330.87 s [vector] +++ OK, passed 100 tests.
  13539. 1330.87 s [vector] stream.unstream == id: OK
  13540. 1330.87 s [vector] +++ OK, passed 100 tests.
  13541. 1330.87 s [vector] eq: OK
  13542. 1330.87 s [vector] +++ OK, passed 100 tests.
  13543. 1330.87 s [vector] length: OK
  13544. 1330.87 s [vector] +++ OK, passed 100 tests.
  13545. 1330.87 s [vector] null: OK
  13546. 1330.87 s [vector] +++ OK, passed 100 tests.
  13547. 1330.87 s [vector] index: OK
  13548. 1330.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13549. 1330.87 s [vector] safeIndex: OK
  13550. 1330.87 s [vector] +++ OK, passed 100 tests.
  13551. 1330.87 s [vector] head: OK
  13552. 1330.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13553. 1330.88 s [vector] last: OK
  13554. 1330.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13555. 1330.88 s [vector] unsafeIndex: OK
  13556. 1330.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13557. 1330.88 s [vector] unsafeHead: OK
  13558. 1330.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13559. 1330.88 s [vector] unsafeLast: OK
  13560. 1330.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13561. 1330.88 s [vector] slice: OK
  13562. 1330.88 s [vector] +++ OK, passed 100 tests.
  13563. 1330.88 s [vector] init: OK
  13564. 1330.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13565. 1330.88 s [vector] tail: OK
  13566. 1330.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13567. 1330.88 s [vector] take: OK
  13568. 1330.88 s [vector] +++ OK, passed 100 tests.
  13569. 1330.88 s [vector] drop: OK
  13570. 1330.88 s [vector] +++ OK, passed 100 tests.
  13571. 1330.88 s [vector] splitAt: OK
  13572. 1330.88 s [vector] +++ OK, passed 100 tests.
  13573. 1330.88 s [vector] empty: OK
  13574. 1330.88 s [vector] +++ OK, passed 100 tests.
  13575. 1330.88 s [vector] singleton: OK
  13576. 1330.88 s [vector] +++ OK, passed 100 tests.
  13577. 1330.88 s [vector] replicate: OK
  13578. 1330.88 s [vector] +++ OK, passed 100 tests.
  13579. 1330.89 s [vector] generate: OK
  13580. 1330.89 s [vector] +++ OK, passed 100 tests.
  13581. 1330.89 s [vector] iterateN: OK
  13582. 1330.89 s [vector] +++ OK, passed 100 tests.
  13583. 1330.91 s [vector] iterateNM: OK (0.03s)
  13584. 1330.91 s [vector] +++ OK, passed 100 tests.
  13585. 1330.91 s [vector] generateM: OK
  13586. 1330.91 s [vector] +++ OK, passed 100 tests.
  13587. 1330.92 s [vector] replicateM: OK
  13588. 1330.92 s [vector] +++ OK, passed 100 tests.
  13589. 1330.92 s [vector] create: OK
  13590. 1330.92 s [vector] +++ OK, passed 100 tests.
  13591. 1330.92 s [vector] createT: OK
  13592. 1330.92 s [vector] +++ OK, passed 100 tests.
  13593. 1330.92 s [vector] unfoldr: OK
  13594. 1330.92 s [vector] +++ OK, passed 100 tests.
  13595. 1330.92 s [vector] unfoldrN: OK
  13596. 1330.92 s [vector] +++ OK, passed 100 tests.
  13597. 1330.92 s [vector] unfoldrExactN: OK
  13598. 1330.92 s [vector] +++ OK, passed 100 tests.
  13599. 1330.93 s [vector] unfoldrM: OK
  13600. 1330.93 s [vector] +++ OK, passed 100 tests.
  13601. 1330.93 s [vector] unfoldrNM: OK
  13602. 1330.93 s [vector] +++ OK, passed 100 tests.
  13603. 1330.95 s [vector] unfoldrExactNM: OK (0.02s)
  13604. 1330.95 s [vector] +++ OK, passed 100 tests.
  13605. 1330.95 s [vector] constructN: OK
  13606. 1330.95 s [vector] +++ OK, passed 100 tests.
  13607. 1330.95 s [vector] constructrN: OK
  13608. 1330.95 s [vector] +++ OK, passed 100 tests.
  13609. 1330.95 s [vector] cons: OK
  13610. 1330.95 s [vector] +++ OK, passed 100 tests.
  13611. 1330.95 s [vector] snoc: OK
  13612. 1330.95 s [vector] +++ OK, passed 100 tests.
  13613. 1330.97 s [vector] append: OK
  13614. 1330.97 s [vector] +++ OK, passed 100 tests.
  13615. 1330.97 s [vector] concat: OK (0.01s)
  13616. 1330.97 s [vector] +++ OK, passed 100 tests.
  13617. 1330.97 s [vector] force: OK
  13618. 1330.97 s [vector] +++ OK, passed 100 tests.
  13619. 1330.97 s [vector] upd: OK
  13620. 1330.97 s [vector] +++ OK, passed 100 tests.
  13621. 1330.97 s [vector] accum: OK
  13622. 1330.97 s [vector] +++ OK, passed 100 tests.
  13623. 1330.97 s [vector] reverse: OK
  13624. 1330.97 s [vector] +++ OK, passed 100 tests.
  13625. 1330.97 s [vector] backpermute: OK
  13626. 1330.97 s [vector] +++ OK, passed 100 tests.
  13627. 1330.97 s [vector] map: OK
  13628. 1330.97 s [vector] +++ OK, passed 100 tests.
  13629. 1330.97 s [vector] imap: OK
  13630. 1330.97 s [vector] +++ OK, passed 100 tests.
  13631. 1330.98 s [vector] concatMap: OK
  13632. 1330.99 s [vector] +++ OK, passed 100 tests.
  13633. 1330.99 s [vector] mapM: OK
  13634. 1330.99 s [vector] +++ OK, passed 100 tests.
  13635. 1330.99 s [vector] mapM_: OK
  13636. 1330.99 s [vector] +++ OK, passed 100 tests.
  13637. 1330.99 s [vector] forM: OK
  13638. 1330.99 s [vector] +++ OK, passed 100 tests.
  13639. 1330.99 s [vector] forM_: OK
  13640. 1331.00 s [vector] +++ OK, passed 100 tests.
  13641. 1331.00 s [vector] imapM: OK
  13642. 1331.00 s [vector] +++ OK, passed 100 tests.
  13643. 1331.01 s [vector] imapM_: OK
  13644. 1331.01 s [vector] +++ OK, passed 100 tests.
  13645. 1331.01 s [vector] zipWith: OK
  13646. 1331.01 s [vector] +++ OK, passed 100 tests.
  13647. 1331.01 s [vector] zipWith3: OK
  13648. 1331.01 s [vector] +++ OK, passed 100 tests.
  13649. 1331.01 s [vector] izipWith: OK
  13650. 1331.01 s [vector] +++ OK, passed 100 tests.
  13651. 1331.01 s [vector] izipWith3: OK
  13652. 1331.01 s [vector] +++ OK, passed 100 tests.
  13653. 1331.01 s [vector] izipWithM: OK
  13654. 1331.01 s [vector] +++ OK, passed 100 tests.
  13655. 1331.02 s [vector] izipWithM_: OK
  13656. 1331.02 s [vector] +++ OK, passed 100 tests.
  13657. 1331.02 s [vector] zipWithM: OK
  13658. 1331.02 s [vector] +++ OK, passed 100 tests.
  13659. 1331.02 s [vector] zipWithM_: OK
  13660. 1331.02 s [vector] +++ OK, passed 100 tests.
  13661. 1331.02 s [vector] filter: OK
  13662. 1331.02 s [vector] +++ OK, passed 100 tests.
  13663. 1331.02 s [vector] ifilter: OK
  13664. 1331.02 s [vector] +++ OK, passed 100 tests.
  13665. 1331.05 s [vector] filterM: OK (0.02s)
  13666. 1331.05 s [vector] +++ OK, passed 100 tests.
  13667. 1331.05 s [vector] uniq: OK
  13668. 1331.05 s [vector] +++ OK, passed 100 tests.
  13669. 1331.05 s [vector] mapMaybe: OK
  13670. 1331.05 s [vector] +++ OK, passed 100 tests.
  13671. 1331.05 s [vector] imapMaybe: OK
  13672. 1331.05 s [vector] +++ OK, passed 100 tests.
  13673. 1331.05 s [vector] takeWhile: OK
  13674. 1331.05 s [vector] +++ OK, passed 100 tests.
  13675. 1331.05 s [vector] dropWhile: OK
  13676. 1331.05 s [vector] +++ OK, passed 100 tests.
  13677. 1331.05 s [vector] partition: OK
  13678. 1331.05 s [vector] +++ OK, passed 100 tests.
  13679. 1331.05 s [vector] partitionWith: OK
  13680. 1331.05 s [vector] +++ OK, passed 100 tests.
  13681. 1331.05 s [vector] span: OK
  13682. 1331.05 s [vector] +++ OK, passed 100 tests.
  13683. 1331.05 s [vector] break: OK
  13684. 1331.05 s [vector] +++ OK, passed 100 tests.
  13685. 1331.05 s [vector] spanR: OK
  13686. 1331.05 s [vector] +++ OK, passed 100 tests.
  13687. 1331.05 s [vector] breakR: OK
  13688. 1331.05 s [vector] +++ OK, passed 100 tests.
  13689. 1331.05 s [vector] groupBy: OK
  13690. 1331.06 s [vector] +++ OK, passed 100 tests.
  13691. 1331.06 s [vector] elem: OK
  13692. 1331.06 s [vector] +++ OK, passed 100 tests.
  13693. 1331.06 s [vector] notElem: OK
  13694. 1331.06 s [vector] +++ OK, passed 100 tests.
  13695. 1331.06 s [vector] find: OK
  13696. 1331.06 s [vector] +++ OK, passed 100 tests.
  13697. 1331.06 s [vector] findIndex: OK
  13698. 1331.06 s [vector] +++ OK, passed 100 tests.
  13699. 1331.06 s [vector] findIndexR: OK
  13700. 1331.06 s [vector] +++ OK, passed 100 tests.
  13701. 1331.06 s [vector] findIndices: OK
  13702. 1331.06 s [vector] +++ OK, passed 100 tests.
  13703. 1331.06 s [vector] elemIndex: OK
  13704. 1331.06 s [vector] +++ OK, passed 100 tests.
  13705. 1331.06 s [vector] elemIndices: OK
  13706. 1331.06 s [vector] +++ OK, passed 100 tests.
  13707. 1331.06 s [vector] foldl: OK
  13708. 1331.06 s [vector] +++ OK, passed 100 tests.
  13709. 1331.06 s [vector] foldl1: OK
  13710. 1331.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13711. 1331.06 s [vector] foldl': OK
  13712. 1331.06 s [vector] +++ OK, passed 100 tests.
  13713. 1331.06 s [vector] foldl1': OK
  13714. 1331.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13715. 1331.06 s [vector] foldr: OK
  13716. 1331.06 s [vector] +++ OK, passed 100 tests.
  13717. 1331.06 s [vector] foldr1: OK
  13718. 1331.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13719. 1331.06 s [vector] foldr': OK
  13720. 1331.06 s [vector] +++ OK, passed 100 tests.
  13721. 1331.06 s [vector] foldr1': OK
  13722. 1331.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13723. 1331.06 s [vector] ifoldl: OK
  13724. 1331.06 s [vector] +++ OK, passed 100 tests.
  13725. 1331.06 s [vector] ifoldl': OK
  13726. 1331.06 s [vector] +++ OK, passed 100 tests.
  13727. 1331.06 s [vector] ifoldr: OK
  13728. 1331.06 s [vector] +++ OK, passed 100 tests.
  13729. 1331.06 s [vector] ifoldr': OK
  13730. 1331.06 s [vector] +++ OK, passed 100 tests.
  13731. 1331.06 s [vector] ifoldM: OK
  13732. 1331.06 s [vector] +++ OK, passed 100 tests.
  13733. 1331.07 s [vector] ifoldM': OK
  13734. 1331.07 s [vector] +++ OK, passed 100 tests.
  13735. 1331.07 s [vector] ifoldM_: OK
  13736. 1331.07 s [vector] +++ OK, passed 100 tests.
  13737. 1331.08 s [vector] ifoldM'_: OK
  13738. 1331.08 s [vector] +++ OK, passed 100 tests.
  13739. 1331.08 s [vector] all: OK
  13740. 1331.08 s [vector] +++ OK, passed 100 tests.
  13741. 1331.08 s [vector] any: OK
  13742. 1331.08 s [vector] +++ OK, passed 100 tests.
  13743. 1331.08 s [vector] prescanl: OK
  13744. 1331.08 s [vector] +++ OK, passed 100 tests.
  13745. 1331.08 s [vector] prescanl': OK
  13746. 1331.08 s [vector] +++ OK, passed 100 tests.
  13747. 1331.08 s [vector] postscanl: OK
  13748. 1331.08 s [vector] +++ OK, passed 100 tests.
  13749. 1331.08 s [vector] postscanl': OK
  13750. 1331.08 s [vector] +++ OK, passed 100 tests.
  13751. 1331.08 s [vector] scanl: OK
  13752. 1331.08 s [vector] +++ OK, passed 100 tests.
  13753. 1331.09 s [vector] scanl': OK
  13754. 1331.09 s [vector] +++ OK, passed 100 tests.
  13755. 1331.09 s [vector] scanl1: OK
  13756. 1331.09 s [vector] +++ OK, passed 100 tests.
  13757. 1331.09 s [vector] scanl1': OK
  13758. 1331.09 s [vector] +++ OK, passed 100 tests.
  13759. 1331.09 s [vector] iscanl: OK
  13760. 1331.09 s [vector] +++ OK, passed 100 tests.
  13761. 1331.09 s [vector] iscanl': OK
  13762. 1331.09 s [vector] +++ OK, passed 100 tests.
  13763. 1331.09 s [vector] prescanr: OK
  13764. 1331.09 s [vector] +++ OK, passed 100 tests.
  13765. 1331.09 s [vector] prescanr': OK
  13766. 1331.09 s [vector] +++ OK, passed 100 tests.
  13767. 1331.09 s [vector] postscanr: OK
  13768. 1331.09 s [vector] +++ OK, passed 100 tests.
  13769. 1331.09 s [vector] postscanr': OK
  13770. 1331.09 s [vector] +++ OK, passed 100 tests.
  13771. 1331.09 s [vector] scanr: OK
  13772. 1331.09 s [vector] +++ OK, passed 100 tests.
  13773. 1331.09 s [vector] scanr': OK
  13774. 1331.09 s [vector] +++ OK, passed 100 tests.
  13775. 1331.10 s [vector] scanr1: OK
  13776. 1331.10 s [vector] +++ OK, passed 100 tests.
  13777. 1331.10 s [vector] scanr1': OK
  13778. 1331.10 s [vector] +++ OK, passed 100 tests.
  13779. 1331.10 s [vector] iscanr: OK
  13780. 1331.10 s [vector] +++ OK, passed 100 tests.
  13781. 1331.10 s [vector] iscanr': OK
  13782. 1331.10 s [vector] +++ OK, passed 100 tests.
  13783. 1331.10 s [vector] mut_read: OK
  13784. 1331.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13785. 1331.10 s [vector] mut_write: OK
  13786. 1331.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13787. 1331.10 s [vector] mut_modify: OK
  13788. 1331.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13789. 1331.10 s [vector] mut_generate: OK
  13790. 1331.10 s [vector] +++ OK, passed 100 tests.
  13791. 1331.11 s [vector] mut_generateM: OK
  13792. 1331.11 s [vector] +++ OK, passed 100 tests.
  13793. 1331.11 s [vector] mut_mapM_: OK
  13794. 1331.12 s [vector] +++ OK, passed 100 tests.
  13795. 1331.13 s [vector] mut_imapM_: OK
  13796. 1331.13 s [vector] +++ OK, passed 100 tests.
  13797. 1331.13 s [vector] mut_forM_: OK
  13798. 1331.13 s [vector] +++ OK, passed 100 tests.
  13799. 1331.13 s [vector] mut_iforM_: OK
  13800. 1331.14 s [vector] +++ OK, passed 100 tests.
  13801. 1331.14 s [vector] mut_foldr: OK
  13802. 1331.14 s [vector] +++ OK, passed 100 tests.
  13803. 1331.14 s [vector] mut_foldr': OK
  13804. 1331.14 s [vector] +++ OK, passed 100 tests.
  13805. 1331.14 s [vector] mut_foldl: OK
  13806. 1331.14 s [vector] +++ OK, passed 100 tests.
  13807. 1331.14 s [vector] mut_foldl': OK
  13808. 1331.14 s [vector] +++ OK, passed 100 tests.
  13809. 1331.14 s [vector] mut_ifoldr: OK
  13810. 1331.14 s [vector] +++ OK, passed 100 tests.
  13811. 1331.14 s [vector] mut_ifoldr': OK
  13812. 1331.14 s [vector] +++ OK, passed 100 tests.
  13813. 1331.14 s [vector] mut_ifoldl: OK
  13814. 1331.14 s [vector] +++ OK, passed 100 tests.
  13815. 1331.14 s [vector] mut_ifoldl': OK
  13816. 1331.14 s [vector] +++ OK, passed 100 tests.
  13817. 1331.14 s [vector] mut_foldM: OK
  13818. 1331.14 s [vector] +++ OK, passed 100 tests.
  13819. 1331.14 s [vector] mut_foldM': OK
  13820. 1331.14 s [vector] +++ OK, passed 100 tests.
  13821. 1331.14 s [vector] mut_foldrM: OK
  13822. 1331.14 s [vector] +++ OK, passed 100 tests.
  13823. 1331.14 s [vector] mut_foldrM': OK
  13824. 1331.14 s [vector] +++ OK, passed 100 tests.
  13825. 1331.14 s [vector] mut_ifoldM: OK
  13826. 1331.14 s [vector] +++ OK, passed 100 tests.
  13827. 1331.14 s [vector] mut_ifoldM': OK
  13828. 1331.14 s [vector] +++ OK, passed 100 tests.
  13829. 1331.14 s [vector] mut_ifoldrM: OK
  13830. 1331.15 s [vector] +++ OK, passed 100 tests.
  13831. 1331.15 s [vector] mut_ifoldrM': OK
  13832. 1331.15 s [vector] +++ OK, passed 100 tests.
  13833. 1331.15 s [vector] compare: OK
  13834. 1331.15 s [vector] +++ OK, passed 100 tests.
  13835. 1331.15 s [vector] maximum: OK
  13836. 1331.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13837. 1331.15 s [vector] minimum: OK
  13838. 1331.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13839. 1331.15 s [vector] minIndex: OK
  13840. 1331.15 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13841. 1331.15 s [vector] maxIndex: OK
  13842. 1331.15 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13843. 1331.15 s [vector] maximumBy: OK
  13844. 1331.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13845. 1331.15 s [vector] minimumBy: OK
  13846. 1331.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13847. 1331.15 s [vector] maximumOn: OK
  13848. 1331.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13849. 1331.15 s [vector] minimumOn: OK
  13850. 1331.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13851. 1331.15 s [vector] maxIndexBy: OK
  13852. 1331.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13853. 1331.17 s [vector] minIndexBy: OK
  13854. 1331.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13855. 1331.17 s [vector] ListFirstMaxIndexWins: OK
  13856. 1331.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13857. 1331.17 s [vector] FalseListFirstMaxIndexWins: OK
  13858. 1331.17 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  13859. 1331.17 s [vector] []
  13860. 1331.17 s [vector] zip: OK
  13861. 1331.17 s [vector] +++ OK, passed 100 tests.
  13862. 1331.17 s [vector] zip3: OK
  13863. 1331.17 s [vector] +++ OK, passed 100 tests.
  13864. 1331.17 s [vector] unzip: OK
  13865. 1331.17 s [vector] +++ OK, passed 100 tests.
  13866. 1331.17 s [vector] unzip3: OK
  13867. 1331.17 s [vector] +++ OK, passed 100 tests.
  13868. 1331.17 s [vector] indexed: OK
  13869. 1331.17 s [vector] +++ OK, passed 100 tests.
  13870. 1331.17 s [vector] update: OK
  13871. 1331.17 s [vector] +++ OK, passed 100 tests.
  13872. 1331.17 s [vector] mempty: OK
  13873. 1331.17 s [vector] +++ OK, passed 100 tests.
  13874. 1331.17 s [vector] mappend: OK
  13875. 1331.17 s [vector] +++ OK, passed 100 tests.
  13876. 1331.17 s [vector] mconcat: OK (0.01s)
  13877. 1331.17 s [vector] +++ OK, passed 100 tests.
  13878. 1331.17 s [vector] glength: OK
  13879. 1331.17 s [vector] +++ OK, passed 100 tests.
  13880. 1331.17 s [vector] (Bool)
  13881. 1331.17 s [vector] fromList.toList == id: OK
  13882. 1331.17 s [vector] +++ OK, passed 100 tests.
  13883. 1331.17 s [vector] toList.fromList == id: OK
  13884. 1331.17 s [vector] +++ OK, passed 100 tests.
  13885. 1331.17 s [vector] unstream.stream == id: OK
  13886. 1331.17 s [vector] +++ OK, passed 100 tests.
  13887. 1331.17 s [vector] stream.unstream == id: OK
  13888. 1331.17 s [vector] +++ OK, passed 100 tests.
  13889. 1331.17 s [vector] eq: OK
  13890. 1331.17 s [vector] +++ OK, passed 100 tests.
  13891. 1331.17 s [vector] length: OK
  13892. 1331.17 s [vector] +++ OK, passed 100 tests.
  13893. 1331.17 s [vector] null: OK
  13894. 1331.17 s [vector] +++ OK, passed 100 tests.
  13895. 1331.17 s [vector] index: OK
  13896. 1331.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13897. 1331.17 s [vector] safeIndex: OK
  13898. 1331.17 s [vector] +++ OK, passed 100 tests.
  13899. 1331.17 s [vector] head: OK
  13900. 1331.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13901. 1331.17 s [vector] last: OK
  13902. 1331.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13903. 1331.17 s [vector] unsafeIndex: OK
  13904. 1331.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13905. 1331.17 s [vector] unsafeHead: OK
  13906. 1331.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13907. 1331.17 s [vector] unsafeLast: OK
  13908. 1331.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13909. 1331.18 s [vector] slice: OK
  13910. 1331.18 s [vector] +++ OK, passed 100 tests.
  13911. 1331.18 s [vector] init: OK
  13912. 1331.18 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13913. 1331.18 s [vector] tail: OK
  13914. 1331.18 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13915. 1331.18 s [vector] take: OK
  13916. 1331.18 s [vector] +++ OK, passed 100 tests.
  13917. 1331.18 s [vector] drop: OK
  13918. 1331.18 s [vector] +++ OK, passed 100 tests.
  13919. 1331.18 s [vector] splitAt: OK
  13920. 1331.18 s [vector] +++ OK, passed 100 tests.
  13921. 1331.18 s [vector] empty: OK
  13922. 1331.18 s [vector] +++ OK, passed 100 tests.
  13923. 1331.18 s [vector] singleton: OK
  13924. 1331.18 s [vector] +++ OK, passed 100 tests.
  13925. 1331.19 s [vector] replicate: OK
  13926. 1331.19 s [vector] +++ OK, passed 100 tests.
  13927. 1331.19 s [vector] generate: OK
  13928. 1331.19 s [vector] +++ OK, passed 100 tests.
  13929. 1331.19 s [vector] iterateN: OK
  13930. 1331.19 s [vector] +++ OK, passed 100 tests.
  13931. 1331.21 s [vector] iterateNM: OK (0.03s)
  13932. 1331.21 s [vector] +++ OK, passed 100 tests.
  13933. 1331.23 s [vector] generateM: OK (0.01s)
  13934. 1331.23 s [vector] +++ OK, passed 100 tests.
  13935. 1331.24 s [vector] replicateM: OK (0.02s)
  13936. 1331.24 s [vector] +++ OK, passed 100 tests.
  13937. 1331.24 s [vector] create: OK
  13938. 1331.24 s [vector] +++ OK, passed 100 tests.
  13939. 1331.24 s [vector] createT: OK
  13940. 1331.24 s [vector] +++ OK, passed 100 tests.
  13941. 1331.24 s [vector] unfoldr: OK
  13942. 1331.24 s [vector] +++ OK, passed 100 tests.
  13943. 1331.24 s [vector] unfoldrN: OK
  13944. 1331.24 s [vector] +++ OK, passed 100 tests.
  13945. 1331.24 s [vector] unfoldrExactN: OK
  13946. 1331.24 s [vector] +++ OK, passed 100 tests.
  13947. 1331.25 s [vector] unfoldrM: OK
  13948. 1331.25 s [vector] +++ OK, passed 100 tests.
  13949. 1331.25 s [vector] unfoldrNM: OK
  13950. 1331.25 s [vector] +++ OK, passed 100 tests.
  13951. 1331.26 s [vector] unfoldrExactNM: OK (0.01s)
  13952. 1331.26 s [vector] +++ OK, passed 100 tests.
  13953. 1331.27 s [vector] constructN: OK
  13954. 1331.27 s [vector] +++ OK, passed 100 tests.
  13955. 1331.27 s [vector] constructrN: OK
  13956. 1331.27 s [vector] +++ OK, passed 100 tests.
  13957. 1331.27 s [vector] cons: OK
  13958. 1331.27 s [vector] +++ OK, passed 100 tests.
  13959. 1331.27 s [vector] snoc: OK
  13960. 1331.27 s [vector] +++ OK, passed 100 tests.
  13961. 1331.27 s [vector] append: OK
  13962. 1331.27 s [vector] +++ OK, passed 100 tests.
  13963. 1331.28 s [vector] concat: OK (0.01s)
  13964. 1331.28 s [vector] +++ OK, passed 100 tests.
  13965. 1331.28 s [vector] force: OK
  13966. 1331.28 s [vector] +++ OK, passed 100 tests.
  13967. 1331.28 s [vector] upd: OK
  13968. 1331.28 s [vector] +++ OK, passed 100 tests.
  13969. 1331.29 s [vector] accum: OK
  13970. 1331.29 s [vector] +++ OK, passed 100 tests.
  13971. 1331.29 s [vector] reverse: OK
  13972. 1331.29 s [vector] +++ OK, passed 100 tests.
  13973. 1331.29 s [vector] backpermute: OK
  13974. 1331.29 s [vector] +++ OK, passed 100 tests.
  13975. 1331.29 s [vector] map: OK
  13976. 1331.29 s [vector] +++ OK, passed 100 tests.
  13977. 1331.29 s [vector] imap: OK
  13978. 1331.29 s [vector] +++ OK, passed 100 tests.
  13979. 1331.30 s [vector] concatMap: OK
  13980. 1331.31 s [vector] +++ OK, passed 100 tests.
  13981. 1331.31 s [vector] mapM: OK
  13982. 1331.31 s [vector] +++ OK, passed 100 tests.
  13983. 1331.31 s [vector] mapM_: OK (0.01s)
  13984. 1331.31 s [vector] +++ OK, passed 100 tests.
  13985. 1331.31 s [vector] forM: OK
  13986. 1331.31 s [vector] +++ OK, passed 100 tests.
  13987. 1331.33 s [vector] forM_: OK (0.02s)
  13988. 1331.33 s [vector] +++ OK, passed 100 tests.
  13989. 1331.33 s [vector] imapM: OK
  13990. 1331.33 s [vector] +++ OK, passed 100 tests.
  13991. 1331.34 s [vector] imapM_: OK (0.01s)
  13992. 1331.34 s [vector] +++ OK, passed 100 tests.
  13993. 1331.34 s [vector] zipWith: OK
  13994. 1331.34 s [vector] +++ OK, passed 100 tests.
  13995. 1331.35 s [vector] zipWith3: OK
  13996. 1331.35 s [vector] +++ OK, passed 100 tests.
  13997. 1331.35 s [vector] izipWith: OK
  13998. 1331.35 s [vector] +++ OK, passed 100 tests.
  13999. 1331.35 s [vector] izipWith3: OK
  14000. 1331.35 s [vector] +++ OK, passed 100 tests.
  14001. 1331.35 s [vector] izipWithM: OK
  14002. 1331.35 s [vector] +++ OK, passed 100 tests.
  14003. 1331.36 s [vector] izipWithM_: OK
  14004. 1331.36 s [vector] +++ OK, passed 100 tests.
  14005. 1331.36 s [vector] zipWithM: OK
  14006. 1331.36 s [vector] +++ OK, passed 100 tests.
  14007. 1331.37 s [vector] zipWithM_: OK
  14008. 1331.37 s [vector] +++ OK, passed 100 tests.
  14009. 1331.37 s [vector] filter: OK
  14010. 1331.37 s [vector] +++ OK, passed 100 tests.
  14011. 1331.37 s [vector] ifilter: OK
  14012. 1331.37 s [vector] +++ OK, passed 100 tests.
  14013. 1331.39 s [vector] filterM: OK (0.02s)
  14014. 1331.39 s [vector] +++ OK, passed 100 tests.
  14015. 1331.39 s [vector] uniq: OK
  14016. 1331.39 s [vector] +++ OK, passed 100 tests.
  14017. 1331.39 s [vector] mapMaybe: OK
  14018. 1331.39 s [vector] +++ OK, passed 100 tests.
  14019. 1331.39 s [vector] imapMaybe: OK
  14020. 1331.39 s [vector] +++ OK, passed 100 tests.
  14021. 1331.39 s [vector] takeWhile: OK
  14022. 1331.40 s [vector] +++ OK, passed 100 tests.
  14023. 1331.40 s [vector] dropWhile: OK
  14024. 1331.40 s [vector] +++ OK, passed 100 tests.
  14025. 1331.40 s [vector] partition: OK
  14026. 1331.40 s [vector] +++ OK, passed 100 tests.
  14027. 1331.40 s [vector] partitionWith: OK
  14028. 1331.40 s [vector] +++ OK, passed 100 tests.
  14029. 1331.40 s [vector] span: OK
  14030. 1331.40 s [vector] +++ OK, passed 100 tests.
  14031. 1331.40 s [vector] break: OK
  14032. 1331.40 s [vector] +++ OK, passed 100 tests.
  14033. 1331.40 s [vector] spanR: OK
  14034. 1331.40 s [vector] +++ OK, passed 100 tests.
  14035. 1331.40 s [vector] breakR: OK
  14036. 1331.40 s [vector] +++ OK, passed 100 tests.
  14037. 1331.40 s [vector] groupBy: OK
  14038. 1331.40 s [vector] +++ OK, passed 100 tests.
  14039. 1331.40 s [vector] elem: OK
  14040. 1331.40 s [vector] +++ OK, passed 100 tests.
  14041. 1331.40 s [vector] notElem: OK
  14042. 1331.40 s [vector] +++ OK, passed 100 tests.
  14043. 1331.40 s [vector] find: OK
  14044. 1331.40 s [vector] +++ OK, passed 100 tests.
  14045. 1331.40 s [vector] findIndex: OK
  14046. 1331.41 s [vector] +++ OK, passed 100 tests.
  14047. 1331.41 s [vector] findIndexR: OK
  14048. 1331.41 s [vector] +++ OK, passed 100 tests.
  14049. 1331.41 s [vector] findIndices: OK
  14050. 1331.41 s [vector] +++ OK, passed 100 tests.
  14051. 1331.41 s [vector] elemIndex: OK
  14052. 1331.41 s [vector] +++ OK, passed 100 tests.
  14053. 1331.41 s [vector] elemIndices: OK
  14054. 1331.41 s [vector] +++ OK, passed 100 tests.
  14055. 1331.41 s [vector] foldl: OK
  14056. 1331.41 s [vector] +++ OK, passed 100 tests.
  14057. 1331.41 s [vector] foldl1: OK
  14058. 1331.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14059. 1331.41 s [vector] foldl': OK
  14060. 1331.41 s [vector] +++ OK, passed 100 tests.
  14061. 1331.41 s [vector] foldl1': OK
  14062. 1331.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14063. 1331.41 s [vector] foldr: OK
  14064. 1331.41 s [vector] +++ OK, passed 100 tests.
  14065. 1331.41 s [vector] foldr1: OK
  14066. 1331.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14067. 1331.41 s [vector] foldr': OK
  14068. 1331.41 s [vector] +++ OK, passed 100 tests.
  14069. 1331.42 s [vector] foldr1': OK
  14070. 1331.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14071. 1331.42 s [vector] ifoldl: OK
  14072. 1331.42 s [vector] +++ OK, passed 100 tests.
  14073. 1331.42 s [vector] ifoldl': OK
  14074. 1331.42 s [vector] +++ OK, passed 100 tests.
  14075. 1331.42 s [vector] ifoldr: OK
  14076. 1331.42 s [vector] +++ OK, passed 100 tests.
  14077. 1331.42 s [vector] ifoldr': OK
  14078. 1331.42 s [vector] +++ OK, passed 100 tests.
  14079. 1331.42 s [vector] ifoldM: OK
  14080. 1331.43 s [vector] +++ OK, passed 100 tests.
  14081. 1331.43 s [vector] ifoldM': OK
  14082. 1331.43 s [vector] +++ OK, passed 100 tests.
  14083. 1331.45 s [vector] ifoldM_: OK (0.01s)
  14084. 1331.45 s [vector] +++ OK, passed 100 tests.
  14085. 1331.45 s [vector] ifoldM'_: OK
  14086. 1331.45 s [vector] +++ OK, passed 100 tests.
  14087. 1331.45 s [vector] all: OK
  14088. 1331.45 s [vector] +++ OK, passed 100 tests.
  14089. 1331.45 s [vector] any: OK
  14090. 1331.45 s [vector] +++ OK, passed 100 tests.
  14091. 1331.45 s [vector] prescanl: OK
  14092. 1331.45 s [vector] +++ OK, passed 100 tests.
  14093. 1331.45 s [vector] prescanl': OK
  14094. 1331.45 s [vector] +++ OK, passed 100 tests.
  14095. 1331.45 s [vector] postscanl: OK
  14096. 1331.45 s [vector] +++ OK, passed 100 tests.
  14097. 1331.45 s [vector] postscanl': OK
  14098. 1331.45 s [vector] +++ OK, passed 100 tests.
  14099. 1331.45 s [vector] scanl: OK
  14100. 1331.45 s [vector] +++ OK, passed 100 tests.
  14101. 1331.46 s [vector] scanl': OK
  14102. 1331.46 s [vector] +++ OK, passed 100 tests.
  14103. 1331.46 s [vector] scanl1: OK
  14104. 1331.46 s [vector] +++ OK, passed 100 tests.
  14105. 1331.47 s [vector] scanl1': OK
  14106. 1331.47 s [vector] +++ OK, passed 100 tests.
  14107. 1331.47 s [vector] iscanl: OK
  14108. 1331.47 s [vector] +++ OK, passed 100 tests.
  14109. 1331.47 s [vector] iscanl': OK
  14110. 1331.47 s [vector] +++ OK, passed 100 tests.
  14111. 1331.47 s [vector] prescanr: OK
  14112. 1331.47 s [vector] +++ OK, passed 100 tests.
  14113. 1331.47 s [vector] prescanr': OK
  14114. 1331.47 s [vector] +++ OK, passed 100 tests.
  14115. 1331.47 s [vector] postscanr: OK
  14116. 1331.47 s [vector] +++ OK, passed 100 tests.
  14117. 1331.47 s [vector] postscanr': OK
  14118. 1331.47 s [vector] +++ OK, passed 100 tests.
  14119. 1331.47 s [vector] scanr: OK
  14120. 1331.47 s [vector] +++ OK, passed 100 tests.
  14121. 1331.47 s [vector] scanr': OK
  14122. 1331.47 s [vector] +++ OK, passed 100 tests.
  14123. 1331.47 s [vector] scanr1: OK
  14124. 1331.47 s [vector] +++ OK, passed 100 tests.
  14125. 1331.48 s [vector] scanr1': OK
  14126. 1331.48 s [vector] +++ OK, passed 100 tests.
  14127. 1331.48 s [vector] iscanr: OK
  14128. 1331.48 s [vector] +++ OK, passed 100 tests.
  14129. 1331.48 s [vector] iscanr': OK
  14130. 1331.48 s [vector] +++ OK, passed 100 tests.
  14131. 1331.48 s [vector] mut_read: OK
  14132. 1331.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14133. 1331.48 s [vector] mut_write: OK
  14134. 1331.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14135. 1331.49 s [vector] mut_modify: OK
  14136. 1331.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14137. 1331.49 s [vector] mut_generate: OK
  14138. 1331.49 s [vector] +++ OK, passed 100 tests.
  14139. 1331.49 s [vector] mut_generateM: OK
  14140. 1331.49 s [vector] +++ OK, passed 100 tests.
  14141. 1331.50 s [vector] mut_mapM_: OK
  14142. 1331.50 s [vector] +++ OK, passed 100 tests.
  14143. 1331.51 s [vector] mut_imapM_: OK (0.01s)
  14144. 1331.51 s [vector] +++ OK, passed 100 tests.
  14145. 1331.53 s [vector] mut_forM_: OK
  14146. 1331.53 s [vector] +++ OK, passed 100 tests.
  14147. 1331.53 s [vector] mut_iforM_: OK (0.01s)
  14148. 1331.53 s [vector] +++ OK, passed 100 tests.
  14149. 1331.53 s [vector] mut_foldr: OK
  14150. 1331.53 s [vector] +++ OK, passed 100 tests.
  14151. 1331.54 s [vector] mut_foldr': OK
  14152. 1331.54 s [vector] +++ OK, passed 100 tests.
  14153. 1331.54 s [vector] mut_foldl: OK
  14154. 1331.54 s [vector] +++ OK, passed 100 tests.
  14155. 1331.54 s [vector] mut_foldl': OK
  14156. 1331.54 s [vector] +++ OK, passed 100 tests.
  14157. 1331.54 s [vector] mut_ifoldr: OK
  14158. 1331.54 s [vector] +++ OK, passed 100 tests.
  14159. 1331.54 s [vector] mut_ifoldr': OK
  14160. 1331.54 s [vector] +++ OK, passed 100 tests.
  14161. 1331.54 s [vector] mut_ifoldl: OK
  14162. 1331.55 s [vector] +++ OK, passed 100 tests.
  14163. 1331.55 s [vector] mut_ifoldl': OK
  14164. 1331.55 s [vector] +++ OK, passed 100 tests.
  14165. 1331.55 s [vector] mut_foldM: OK
  14166. 1331.55 s [vector] +++ OK, passed 100 tests.
  14167. 1331.55 s [vector] mut_foldM': OK
  14168. 1331.55 s [vector] +++ OK, passed 100 tests.
  14169. 1331.55 s [vector] mut_foldrM: OK
  14170. 1331.55 s [vector] +++ OK, passed 100 tests.
  14171. 1331.55 s [vector] mut_foldrM': OK
  14172. 1331.55 s [vector] +++ OK, passed 100 tests.
  14173. 1331.55 s [vector] mut_ifoldM: OK
  14174. 1331.55 s [vector] +++ OK, passed 100 tests.
  14175. 1331.55 s [vector] mut_ifoldM': OK
  14176. 1331.55 s [vector] +++ OK, passed 100 tests.
  14177. 1331.55 s [vector] mut_ifoldrM: OK
  14178. 1331.55 s [vector] +++ OK, passed 100 tests.
  14179. 1331.55 s [vector] mut_ifoldrM': OK
  14180. 1331.55 s [vector] +++ OK, passed 100 tests.
  14181. 1331.55 s [vector] compare: OK
  14182. 1331.55 s [vector] +++ OK, passed 100 tests.
  14183. 1331.55 s [vector] maximum: OK
  14184. 1331.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14185. 1331.55 s [vector] minimum: OK
  14186. 1331.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14187. 1331.56 s [vector] minIndex: OK
  14188. 1331.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14189. 1331.56 s [vector] maxIndex: OK
  14190. 1331.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14191. 1331.56 s [vector] maximumBy: OK
  14192. 1331.56 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14193. 1331.56 s [vector] minimumBy: OK
  14194. 1331.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14195. 1331.56 s [vector] maximumOn: OK
  14196. 1331.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14197. 1331.56 s [vector] minimumOn: OK
  14198. 1331.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14199. 1331.56 s [vector] maxIndexBy: OK
  14200. 1331.56 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14201. 1331.56 s [vector] minIndexBy: OK
  14202. 1331.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14203. 1331.56 s [vector] ListFirstMaxIndexWins: OK
  14204. 1331.56 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14205. 1331.56 s [vector] FalseListFirstMaxIndexWins: OK
  14206. 1331.56 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  14207. 1331.56 s [vector] []
  14208. 1331.56 s [vector] zip: OK
  14209. 1331.56 s [vector] +++ OK, passed 100 tests.
  14210. 1331.56 s [vector] zip3: OK
  14211. 1331.56 s [vector] +++ OK, passed 100 tests.
  14212. 1331.56 s [vector] unzip: OK
  14213. 1331.56 s [vector] +++ OK, passed 100 tests.
  14214. 1331.57 s [vector] unzip3: OK
  14215. 1331.57 s [vector] +++ OK, passed 100 tests.
  14216. 1331.57 s [vector] indexed: OK
  14217. 1331.57 s [vector] +++ OK, passed 100 tests.
  14218. 1331.57 s [vector] update: OK
  14219. 1331.57 s [vector] +++ OK, passed 100 tests.
  14220. 1331.57 s [vector] mempty: OK
  14221. 1331.57 s [vector] +++ OK, passed 100 tests.
  14222. 1331.57 s [vector] mappend: OK
  14223. 1331.57 s [vector] +++ OK, passed 100 tests.
  14224. 1331.59 s [vector] mconcat: OK (0.01s)
  14225. 1331.59 s [vector] +++ OK, passed 100 tests.
  14226. 1331.59 s [vector] glength: OK
  14227. 1331.59 s [vector] +++ OK, passed 100 tests.
  14228. 1331.59 s [vector] and: OK
  14229. 1331.59 s [vector] +++ OK, passed 100 tests.
  14230. 1331.59 s [vector] or: OK
  14231. 1331.59 s [vector] +++ OK, passed 100 tests.
  14232. 1331.59 s [vector] (Int)
  14233. 1331.59 s [vector] fromList.toList == id: OK
  14234. 1331.59 s [vector] +++ OK, passed 100 tests.
  14235. 1331.59 s [vector] toList.fromList == id: OK
  14236. 1331.59 s [vector] +++ OK, passed 100 tests.
  14237. 1331.59 s [vector] unstream.stream == id: OK
  14238. 1331.59 s [vector] +++ OK, passed 100 tests.
  14239. 1331.59 s [vector] stream.unstream == id: OK
  14240. 1331.59 s [vector] +++ OK, passed 100 tests.
  14241. 1331.59 s [vector] eq: OK
  14242. 1331.59 s [vector] +++ OK, passed 100 tests.
  14243. 1331.59 s [vector] length: OK
  14244. 1331.59 s [vector] +++ OK, passed 100 tests.
  14245. 1331.59 s [vector] null: OK
  14246. 1331.59 s [vector] +++ OK, passed 100 tests.
  14247. 1331.59 s [vector] index: OK
  14248. 1331.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14249. 1331.59 s [vector] safeIndex: OK
  14250. 1331.59 s [vector] +++ OK, passed 100 tests.
  14251. 1331.59 s [vector] head: OK
  14252. 1331.59 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14253. 1331.59 s [vector] last: OK
  14254. 1331.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14255. 1331.59 s [vector] unsafeIndex: OK
  14256. 1331.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14257. 1331.60 s [vector] unsafeHead: OK
  14258. 1331.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14259. 1331.60 s [vector] unsafeLast: OK
  14260. 1331.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14261. 1331.60 s [vector] slice: OK
  14262. 1331.60 s [vector] +++ OK, passed 100 tests.
  14263. 1331.60 s [vector] init: OK
  14264. 1331.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14265. 1331.60 s [vector] tail: OK
  14266. 1331.60 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14267. 1331.60 s [vector] take: OK
  14268. 1331.60 s [vector] +++ OK, passed 100 tests.
  14269. 1331.60 s [vector] drop: OK
  14270. 1331.60 s [vector] +++ OK, passed 100 tests.
  14271. 1331.60 s [vector] splitAt: OK
  14272. 1331.60 s [vector] +++ OK, passed 100 tests.
  14273. 1331.60 s [vector] empty: OK
  14274. 1331.60 s [vector] +++ OK, passed 100 tests.
  14275. 1331.60 s [vector] singleton: OK
  14276. 1331.60 s [vector] +++ OK, passed 100 tests.
  14277. 1331.60 s [vector] replicate: OK
  14278. 1331.60 s [vector] +++ OK, passed 100 tests.
  14279. 1331.60 s [vector] generate: OK
  14280. 1331.60 s [vector] +++ OK, passed 100 tests.
  14281. 1331.60 s [vector] iterateN: OK
  14282. 1331.60 s [vector] +++ OK, passed 100 tests.
  14283. 1331.63 s [vector] iterateNM: OK (0.01s)
  14284. 1331.63 s [vector] +++ OK, passed 100 tests.
  14285. 1331.65 s [vector] generateM: OK (0.01s)
  14286. 1331.65 s [vector] +++ OK, passed 100 tests.
  14287. 1331.65 s [vector] replicateM: OK (0.01s)
  14288. 1331.65 s [vector] +++ OK, passed 100 tests.
  14289. 1331.65 s [vector] create: OK
  14290. 1331.65 s [vector] +++ OK, passed 100 tests.
  14291. 1331.65 s [vector] createT: OK
  14292. 1331.65 s [vector] +++ OK, passed 100 tests.
  14293. 1331.66 s [vector] unfoldr: OK
  14294. 1331.66 s [vector] +++ OK, passed 100 tests.
  14295. 1331.66 s [vector] unfoldrN: OK
  14296. 1331.67 s [vector] +++ OK, passed 100 tests.
  14297. 1331.67 s [vector] unfoldrExactN: OK
  14298. 1331.67 s [vector] +++ OK, passed 100 tests.
  14299. 1331.67 s [vector] unfoldrM: OK
  14300. 1331.67 s [vector] +++ OK, passed 100 tests.
  14301. 1331.67 s [vector] unfoldrNM: OK
  14302. 1331.67 s [vector] +++ OK, passed 100 tests.
  14303. 1331.69 s [vector] unfoldrExactNM: OK (0.02s)
  14304. 1331.69 s [vector] +++ OK, passed 100 tests.
  14305. 1331.69 s [vector] constructN: OK
  14306. 1331.69 s [vector] +++ OK, passed 100 tests.
  14307. 1331.69 s [vector] constructrN: OK
  14308. 1331.70 s [vector] +++ OK, passed 100 tests.
  14309. 1331.70 s [vector] cons: OK
  14310. 1331.71 s [vector] +++ OK, passed 100 tests.
  14311. 1331.71 s [vector] snoc: OK
  14312. 1331.71 s [vector] +++ OK, passed 100 tests.
  14313. 1331.71 s [vector] append: OK
  14314. 1331.71 s [vector] +++ OK, passed 100 tests.
  14315. 1331.71 s [vector] concat: OK (0.02s)
  14316. 1331.71 s [vector] +++ OK, passed 100 tests.
  14317. 1331.71 s [vector] force: OK
  14318. 1331.71 s [vector] +++ OK, passed 100 tests.
  14319. 1331.72 s [vector] upd: OK
  14320. 1331.72 s [vector] +++ OK, passed 100 tests.
  14321. 1331.72 s [vector] accum: OK
  14322. 1331.73 s [vector] +++ OK, passed 100 tests.
  14323. 1331.73 s [vector] reverse: OK
  14324. 1331.73 s [vector] +++ OK, passed 100 tests.
  14325. 1331.73 s [vector] backpermute: OK
  14326. 1331.73 s [vector] +++ OK, passed 100 tests.
  14327. 1331.73 s [vector] map: OK
  14328. 1331.73 s [vector] +++ OK, passed 100 tests.
  14329. 1331.73 s [vector] imap: OK
  14330. 1331.73 s [vector] +++ OK, passed 100 tests.
  14331. 1331.73 s [vector] concatMap: OK
  14332. 1331.74 s [vector] +++ OK, passed 100 tests.
  14333. 1331.74 s [vector] mapM: OK
  14334. 1331.74 s [vector] +++ OK, passed 100 tests.
  14335. 1331.76 s [vector] mapM_: OK (0.03s)
  14336. 1331.77 s [vector] +++ OK, passed 100 tests.
  14337. 1331.77 s [vector] forM: OK
  14338. 1331.77 s [vector] +++ OK, passed 100 tests.
  14339. 1331.79 s [vector] forM_: OK (0.03s)
  14340. 1331.79 s [vector] +++ OK, passed 100 tests.
  14341. 1331.81 s [vector] imapM: OK
  14342. 1331.81 s [vector] +++ OK, passed 100 tests.
  14343. 1331.83 s [vector] imapM_: OK (0.03s)
  14344. 1331.83 s [vector] +++ OK, passed 100 tests.
  14345. 1331.83 s [vector] zipWith: OK
  14346. 1331.83 s [vector] +++ OK, passed 100 tests.
  14347. 1331.83 s [vector] zipWith3: OK
  14348. 1331.83 s [vector] +++ OK, passed 100 tests.
  14349. 1331.83 s [vector] izipWith: OK
  14350. 1331.83 s [vector] +++ OK, passed 100 tests.
  14351. 1331.85 s [vector] izipWith3: OK
  14352. 1331.85 s [vector] +++ OK, passed 100 tests.
  14353. 1331.85 s [vector] izipWithM: OK
  14354. 1331.85 s [vector] +++ OK, passed 100 tests.
  14355. 1331.87 s [vector] izipWithM_: OK (0.02s)
  14356. 1331.87 s [vector] +++ OK, passed 100 tests.
  14357. 1331.87 s [vector] zipWithM: OK
  14358. 1331.87 s [vector] +++ OK, passed 100 tests.
  14359. 1331.89 s [vector] zipWithM_: OK (0.02s)
  14360. 1331.89 s [vector] +++ OK, passed 100 tests.
  14361. 1331.89 s [vector] filter: OK
  14362. 1331.89 s [vector] +++ OK, passed 100 tests.
  14363. 1331.89 s [vector] ifilter: OK
  14364. 1331.89 s [vector] +++ OK, passed 100 tests.
  14365. 1331.93 s [vector] filterM: OK (0.03s)
  14366. 1331.93 s [vector] +++ OK, passed 100 tests.
  14367. 1331.93 s [vector] uniq: OK
  14368. 1331.93 s [vector] +++ OK, passed 100 tests.
  14369. 1331.93 s [vector] mapMaybe: OK
  14370. 1331.93 s [vector] +++ OK, passed 100 tests.
  14371. 1331.93 s [vector] imapMaybe: OK
  14372. 1331.93 s [vector] +++ OK, passed 100 tests.
  14373. 1331.93 s [vector] takeWhile: OK
  14374. 1331.93 s [vector] +++ OK, passed 100 tests.
  14375. 1331.93 s [vector] dropWhile: OK
  14376. 1331.94 s [vector] +++ OK, passed 100 tests.
  14377. 1331.94 s [vector] partition: OK
  14378. 1331.94 s [vector] +++ OK, passed 100 tests.
  14379. 1331.94 s [vector] partitionWith: OK
  14380. 1331.94 s [vector] +++ OK, passed 100 tests.
  14381. 1331.94 s [vector] span: OK
  14382. 1331.94 s [vector] +++ OK, passed 100 tests.
  14383. 1331.95 s [vector] break: OK
  14384. 1331.95 s [vector] +++ OK, passed 100 tests.
  14385. 1331.95 s [vector] spanR: OK
  14386. 1331.95 s [vector] +++ OK, passed 100 tests.
  14387. 1331.95 s [vector] breakR: OK
  14388. 1331.95 s [vector] +++ OK, passed 100 tests.
  14389. 1331.95 s [vector] groupBy: OK
  14390. 1331.95 s [vector] +++ OK, passed 100 tests.
  14391. 1331.95 s [vector] elem: OK
  14392. 1331.95 s [vector] +++ OK, passed 100 tests.
  14393. 1331.95 s [vector] notElem: OK
  14394. 1331.95 s [vector] +++ OK, passed 100 tests.
  14395. 1331.95 s [vector] find: OK
  14396. 1331.95 s [vector] +++ OK, passed 100 tests.
  14397. 1331.95 s [vector] findIndex: OK
  14398. 1331.95 s [vector] +++ OK, passed 100 tests.
  14399. 1331.95 s [vector] findIndexR: OK
  14400. 1331.95 s [vector] +++ OK, passed 100 tests.
  14401. 1331.95 s [vector] findIndices: OK
  14402. 1331.95 s [vector] +++ OK, passed 100 tests.
  14403. 1331.95 s [vector] elemIndex: OK
  14404. 1331.95 s [vector] +++ OK, passed 100 tests.
  14405. 1331.95 s [vector] elemIndices: OK
  14406. 1331.95 s [vector] +++ OK, passed 100 tests.
  14407. 1331.95 s [vector] foldl: OK
  14408. 1331.96 s [vector] +++ OK, passed 100 tests.
  14409. 1331.96 s [vector] foldl1: OK
  14410. 1331.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14411. 1331.97 s [vector] foldl': OK
  14412. 1331.97 s [vector] +++ OK, passed 100 tests.
  14413. 1331.97 s [vector] foldl1': OK
  14414. 1331.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14415. 1331.98 s [vector] foldr: OK
  14416. 1331.98 s [vector] +++ OK, passed 100 tests.
  14417. 1331.99 s [vector] foldr1: OK
  14418. 1331.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14419. 1331.99 s [vector] foldr': OK
  14420. 1332.00 s [vector] +++ OK, passed 100 tests.
  14421. 1332.01 s [vector] foldr1': OK
  14422. 1332.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14423. 1332.03 s [vector] ifoldl: OK
  14424. 1332.03 s [vector] +++ OK, passed 100 tests.
  14425. 1332.03 s [vector] ifoldl': OK
  14426. 1332.03 s [vector] +++ OK, passed 100 tests.
  14427. 1332.03 s [vector] ifoldr: OK
  14428. 1332.03 s [vector] +++ OK, passed 100 tests.
  14429. 1332.03 s [vector] ifoldr': OK
  14430. 1332.03 s [vector] +++ OK, passed 100 tests.
  14431. 1332.03 s [vector] ifoldM: OK
  14432. 1332.03 s [vector] +++ OK, passed 100 tests.
  14433. 1332.03 s [vector] ifoldM': OK
  14434. 1332.03 s [vector] +++ OK, passed 100 tests.
  14435. 1332.03 s [vector] ifoldM_: OK (0.02s)
  14436. 1332.04 s [vector] +++ OK, passed 100 tests.
  14437. 1332.04 s [vector] ifoldM'_: OK (0.02s)
  14438. 1332.04 s [vector] +++ OK, passed 100 tests.
  14439. 1332.04 s [vector] all: OK
  14440. 1332.04 s [vector] +++ OK, passed 100 tests.
  14441. 1332.04 s [vector] any: OK
  14442. 1332.04 s [vector] +++ OK, passed 100 tests.
  14443. 1332.04 s [vector] prescanl: OK
  14444. 1332.04 s [vector] +++ OK, passed 100 tests.
  14445. 1332.04 s [vector] prescanl': OK
  14446. 1332.05 s [vector] +++ OK, passed 100 tests.
  14447. 1332.05 s [vector] postscanl: OK
  14448. 1332.05 s [vector] +++ OK, passed 100 tests.
  14449. 1332.06 s [vector] postscanl': OK
  14450. 1332.06 s [vector] +++ OK, passed 100 tests.
  14451. 1332.07 s [vector] scanl: OK (0.01s)
  14452. 1332.07 s [vector] +++ OK, passed 100 tests.
  14453. 1332.07 s [vector] scanl': OK
  14454. 1332.07 s [vector] +++ OK, passed 100 tests.
  14455. 1332.07 s [vector] scanl1: OK
  14456. 1332.07 s [vector] +++ OK, passed 100 tests.
  14457. 1332.07 s [vector] scanl1': OK
  14458. 1332.07 s [vector] +++ OK, passed 100 tests.
  14459. 1332.08 s [vector] iscanl: OK
  14460. 1332.08 s [vector] +++ OK, passed 100 tests.
  14461. 1332.08 s [vector] iscanl': OK
  14462. 1332.09 s [vector] +++ OK, passed 100 tests.
  14463. 1332.09 s [vector] prescanr: OK
  14464. 1332.09 s [vector] +++ OK, passed 100 tests.
  14465. 1332.09 s [vector] prescanr': OK
  14466. 1332.09 s [vector] +++ OK, passed 100 tests.
  14467. 1332.09 s [vector] postscanr: OK
  14468. 1332.09 s [vector] +++ OK, passed 100 tests.
  14469. 1332.09 s [vector] postscanr': OK
  14470. 1332.09 s [vector] +++ OK, passed 100 tests.
  14471. 1332.09 s [vector] scanr: OK
  14472. 1332.10 s [vector] +++ OK, passed 100 tests.
  14473. 1332.10 s [vector] scanr': OK
  14474. 1332.10 s [vector] +++ OK, passed 100 tests.
  14475. 1332.10 s [vector] scanr1: OK
  14476. 1332.10 s [vector] +++ OK, passed 100 tests.
  14477. 1332.11 s [vector] scanr1': OK
  14478. 1332.11 s [vector] +++ OK, passed 100 tests.
  14479. 1332.12 s [vector] iscanr: OK
  14480. 1332.12 s [vector] +++ OK, passed 100 tests.
  14481. 1332.12 s [vector] iscanr': OK
  14482. 1332.12 s [vector] +++ OK, passed 100 tests.
  14483. 1332.12 s [vector] mut_read: OK
  14484. 1332.13 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14485. 1332.13 s [vector] mut_write: OK
  14486. 1332.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14487. 1332.13 s [vector] mut_modify: OK
  14488. 1332.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14489. 1332.13 s [vector] mut_generate: OK
  14490. 1332.13 s [vector] +++ OK, passed 100 tests.
  14491. 1332.13 s [vector] mut_generateM: OK (0.01s)
  14492. 1332.14 s [vector] +++ OK, passed 100 tests.
  14493. 1332.16 s [vector] mut_mapM_: OK
  14494. 1332.16 s [vector] +++ OK, passed 100 tests.
  14495. 1332.17 s [vector] mut_imapM_: OK (0.02s)
  14496. 1332.17 s [vector] +++ OK, passed 100 tests.
  14497. 1332.21 s [vector] mut_forM_: OK
  14498. 1332.21 s [vector] +++ OK, passed 100 tests.
  14499. 1332.22 s [vector] mut_iforM_: OK (0.02s)
  14500. 1332.22 s [vector] +++ OK, passed 100 tests.
  14501. 1332.22 s [vector] mut_foldr: OK
  14502. 1332.22 s [vector] +++ OK, passed 100 tests.
  14503. 1332.23 s [vector] mut_foldr': OK
  14504. 1332.23 s [vector] +++ OK, passed 100 tests.
  14505. 1332.23 s [vector] mut_foldl: OK
  14506. 1332.23 s [vector] +++ OK, passed 100 tests.
  14507. 1332.23 s [vector] mut_foldl': OK
  14508. 1332.23 s [vector] +++ OK, passed 100 tests.
  14509. 1332.23 s [vector] mut_ifoldr: OK
  14510. 1332.23 s [vector] +++ OK, passed 100 tests.
  14511. 1332.23 s [vector] mut_ifoldr': OK
  14512. 1332.23 s [vector] +++ OK, passed 100 tests.
  14513. 1332.23 s [vector] mut_ifoldl: OK
  14514. 1332.23 s [vector] +++ OK, passed 100 tests.
  14515. 1332.23 s [vector] mut_ifoldl': OK
  14516. 1332.23 s [vector] +++ OK, passed 100 tests.
  14517. 1332.24 s [vector] mut_foldM: OK
  14518. 1332.24 s [vector] +++ OK, passed 100 tests.
  14519. 1332.25 s [vector] mut_foldM': OK
  14520. 1332.25 s [vector] +++ OK, passed 100 tests.
  14521. 1332.25 s [vector] mut_foldrM: OK
  14522. 1332.25 s [vector] +++ OK, passed 100 tests.
  14523. 1332.25 s [vector] mut_foldrM': OK
  14524. 1332.25 s [vector] +++ OK, passed 100 tests.
  14525. 1332.25 s [vector] mut_ifoldM: OK
  14526. 1332.25 s [vector] +++ OK, passed 100 tests.
  14527. 1332.25 s [vector] mut_ifoldM': OK
  14528. 1332.25 s [vector] +++ OK, passed 100 tests.
  14529. 1332.25 s [vector] mut_ifoldrM: OK
  14530. 1332.25 s [vector] +++ OK, passed 100 tests.
  14531. 1332.25 s [vector] mut_ifoldrM': OK
  14532. 1332.25 s [vector] +++ OK, passed 100 tests.
  14533. 1332.25 s [vector] compare: OK
  14534. 1332.25 s [vector] +++ OK, passed 100 tests.
  14535. 1332.25 s [vector] maximum: OK
  14536. 1332.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14537. 1332.26 s [vector] minimum: OK
  14538. 1332.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14539. 1332.26 s [vector] minIndex: OK
  14540. 1332.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14541. 1332.26 s [vector] maxIndex: OK
  14542. 1332.26 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14543. 1332.26 s [vector] maximumBy: OK
  14544. 1332.26 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14545. 1332.26 s [vector] minimumBy: OK
  14546. 1332.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14547. 1332.26 s [vector] maximumOn: OK
  14548. 1332.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14549. 1332.26 s [vector] minimumOn: OK
  14550. 1332.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14551. 1332.26 s [vector] maxIndexBy: OK
  14552. 1332.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14553. 1332.26 s [vector] minIndexBy: OK
  14554. 1332.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14555. 1332.26 s [vector] ListFirstMaxIndexWins: OK
  14556. 1332.26 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14557. 1332.26 s [vector] FalseListFirstMaxIndexWins: OK
  14558. 1332.27 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  14559. 1332.27 s [vector] []
  14560. 1332.27 s [vector] zip: OK
  14561. 1332.27 s [vector] +++ OK, passed 100 tests.
  14562. 1332.27 s [vector] zip3: OK
  14563. 1332.27 s [vector] +++ OK, passed 100 tests.
  14564. 1332.27 s [vector] unzip: OK
  14565. 1332.27 s [vector] +++ OK, passed 100 tests.
  14566. 1332.27 s [vector] unzip3: OK
  14567. 1332.27 s [vector] +++ OK, passed 100 tests.
  14568. 1332.27 s [vector] indexed: OK
  14569. 1332.27 s [vector] +++ OK, passed 100 tests.
  14570. 1332.27 s [vector] update: OK
  14571. 1332.27 s [vector] +++ OK, passed 100 tests.
  14572. 1332.27 s [vector] mempty: OK
  14573. 1332.27 s [vector] +++ OK, passed 100 tests.
  14574. 1332.27 s [vector] mappend: OK
  14575. 1332.27 s [vector] +++ OK, passed 100 tests.
  14576. 1332.29 s [vector] mconcat: OK (0.02s)
  14577. 1332.29 s [vector] +++ OK, passed 100 tests.
  14578. 1332.29 s [vector] glength: OK
  14579. 1332.29 s [vector] +++ OK, passed 100 tests.
  14580. 1332.29 s [vector] sum: OK
  14581. 1332.29 s [vector] +++ OK, passed 100 tests.
  14582. 1332.29 s [vector] product: OK
  14583. 1332.29 s [vector] +++ OK, passed 100 tests.
  14584. 1332.29 s [vector] enumFromN: OK
  14585. 1332.29 s [vector] +++ OK, passed 100 tests.
  14586. 1332.29 s [vector] enumFromThenN: OK
  14587. 1332.29 s [vector] +++ OK, passed 100 tests.
  14588. 1332.29 s [vector] enumFromTo: OK
  14589. 1332.29 s [vector] +++ OK, passed 100 tests.
  14590. 1332.29 s [vector] enumFromThenTo: OK
  14591. 1332.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14592. 1332.29 s [vector] (Float)
  14593. 1332.29 s [vector] fromList.toList == id: OK
  14594. 1332.29 s [vector] +++ OK, passed 100 tests.
  14595. 1332.29 s [vector] toList.fromList == id: OK
  14596. 1332.29 s [vector] +++ OK, passed 100 tests.
  14597. 1332.30 s [vector] unstream.stream == id: OK
  14598. 1332.30 s [vector] +++ OK, passed 100 tests.
  14599. 1332.30 s [vector] stream.unstream == id: OK
  14600. 1332.30 s [vector] +++ OK, passed 100 tests.
  14601. 1332.30 s [vector] eq: OK
  14602. 1332.30 s [vector] +++ OK, passed 100 tests.
  14603. 1332.30 s [vector] length: OK
  14604. 1332.30 s [vector] +++ OK, passed 100 tests.
  14605. 1332.30 s [vector] null: OK
  14606. 1332.30 s [vector] +++ OK, passed 100 tests.
  14607. 1332.30 s [vector] index: OK
  14608. 1332.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14609. 1332.30 s [vector] safeIndex: OK
  14610. 1332.30 s [vector] +++ OK, passed 100 tests.
  14611. 1332.30 s [vector] head: OK
  14612. 1332.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14613. 1332.30 s [vector] last: OK
  14614. 1332.30 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14615. 1332.30 s [vector] unsafeIndex: OK
  14616. 1332.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14617. 1332.30 s [vector] unsafeHead: OK
  14618. 1332.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14619. 1332.30 s [vector] unsafeLast: OK
  14620. 1332.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14621. 1332.30 s [vector] slice: OK
  14622. 1332.30 s [vector] +++ OK, passed 100 tests.
  14623. 1332.31 s [vector] init: OK
  14624. 1332.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14625. 1332.31 s [vector] tail: OK
  14626. 1332.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14627. 1332.31 s [vector] take: OK
  14628. 1332.31 s [vector] +++ OK, passed 100 tests.
  14629. 1332.31 s [vector] drop: OK
  14630. 1332.31 s [vector] +++ OK, passed 100 tests.
  14631. 1332.31 s [vector] splitAt: OK
  14632. 1332.31 s [vector] +++ OK, passed 100 tests.
  14633. 1332.31 s [vector] empty: OK
  14634. 1332.31 s [vector] +++ OK, passed 100 tests.
  14635. 1332.31 s [vector] singleton: OK
  14636. 1332.31 s [vector] +++ OK, passed 100 tests.
  14637. 1332.31 s [vector] replicate: OK
  14638. 1332.31 s [vector] +++ OK, passed 100 tests.
  14639. 1332.31 s [vector] generate: OK
  14640. 1332.33 s [vector] +++ OK, passed 100 tests.
  14641. 1332.34 s [vector] iterateN: OK
  14642. 1332.34 s [vector] +++ OK, passed 100 tests.
  14643. 1332.35 s [vector] iterateNM: OK (0.02s)
  14644. 1332.35 s [vector] +++ OK, passed 100 tests.
  14645. 1332.36 s [vector] generateM: OK (0.03s)
  14646. 1332.36 s [vector] +++ OK, passed 100 tests.
  14647. 1332.37 s [vector] replicateM: OK
  14648. 1332.37 s [vector] +++ OK, passed 100 tests.
  14649. 1332.38 s [vector] create: OK
  14650. 1332.38 s [vector] +++ OK, passed 100 tests.
  14651. 1332.38 s [vector] createT: OK
  14652. 1332.38 s [vector] +++ OK, passed 100 tests.
  14653. 1332.38 s [vector] unfoldr: OK
  14654. 1332.38 s [vector] +++ OK, passed 100 tests.
  14655. 1332.39 s [vector] unfoldrN: OK
  14656. 1332.39 s [vector] +++ OK, passed 100 tests.
  14657. 1332.39 s [vector] unfoldrExactN: OK
  14658. 1332.39 s [vector] +++ OK, passed 100 tests.
  14659. 1332.39 s [vector] unfoldrM: OK
  14660. 1332.39 s [vector] +++ OK, passed 100 tests.
  14661. 1332.40 s [vector] unfoldrNM: OK
  14662. 1332.40 s [vector] +++ OK, passed 100 tests.
  14663. 1332.42 s [vector] unfoldrExactNM: OK
  14664. 1332.42 s [vector] +++ OK, passed 100 tests.
  14665. 1332.45 s [vector] constructN: OK (0.02s)
  14666. 1332.45 s [vector] +++ OK, passed 100 tests.
  14667. 1332.46 s [vector] constructrN: OK (0.02s)
  14668. 1332.46 s [vector] +++ OK, passed 100 tests.
  14669. 1332.46 s [vector] cons: OK
  14670. 1332.47 s [vector] +++ OK, passed 100 tests.
  14671. 1332.47 s [vector] snoc: OK
  14672. 1332.47 s [vector] +++ OK, passed 100 tests.
  14673. 1332.47 s [vector] append: OK
  14674. 1332.47 s [vector] +++ OK, passed 100 tests.
  14675. 1332.51 s [vector] concat: OK (0.03s)
  14676. 1332.51 s [vector] +++ OK, passed 100 tests.
  14677. 1332.51 s [vector] force: OK
  14678. 1332.51 s [vector] +++ OK, passed 100 tests.
  14679. 1332.52 s [vector] upd: OK
  14680. 1332.52 s [vector] +++ OK, passed 100 tests.
  14681. 1332.52 s [vector] accum: OK (0.01s)
  14682. 1332.52 s [vector] +++ OK, passed 100 tests.
  14683. 1332.52 s [vector] reverse: OK
  14684. 1332.52 s [vector] +++ OK, passed 100 tests.
  14685. 1332.53 s [vector] backpermute: OK
  14686. 1332.53 s [vector] +++ OK, passed 100 tests.
  14687. 1332.53 s [vector] map: OK
  14688. 1332.53 s [vector] +++ OK, passed 100 tests.
  14689. 1332.54 s [vector] imap: OK
  14690. 1332.54 s [vector] +++ OK, passed 100 tests.
  14691. 1332.54 s [vector] concatMap: OK
  14692. 1332.54 s [vector] +++ OK, passed 100 tests.
  14693. 1332.55 s [vector] mapM: OK
  14694. 1332.55 s [vector] +++ OK, passed 100 tests.
  14695. 1332.59 s [vector] mapM_: OK (0.03s)
  14696. 1332.59 s [vector] +++ OK, passed 100 tests.
  14697. 1332.59 s [vector] forM: OK
  14698. 1332.60 s [vector] +++ OK, passed 100 tests.
  14699. 1332.63 s [vector] forM_: OK (0.03s)
  14700. 1332.63 s [vector] +++ OK, passed 100 tests.
  14701. 1332.63 s [vector] imapM: OK
  14702. 1332.64 s [vector] +++ OK, passed 100 tests.
  14703. 1332.67 s [vector] imapM_: OK (0.03s)
  14704. 1332.67 s [vector] +++ OK, passed 100 tests.
  14705. 1332.68 s [vector] zipWith: OK
  14706. 1332.69 s [vector] +++ OK, passed 100 tests.
  14707. 1332.69 s [vector] zipWith3: OK
  14708. 1332.69 s [vector] +++ OK, passed 100 tests.
  14709. 1332.69 s [vector] izipWith: OK
  14710. 1332.69 s [vector] +++ OK, passed 100 tests.
  14711. 1332.69 s [vector] izipWith3: OK
  14712. 1332.69 s [vector] +++ OK, passed 100 tests.
  14713. 1332.69 s [vector] izipWithM: OK
  14714. 1332.71 s [vector] +++ OK, passed 100 tests.
  14715. 1332.73 s [vector] izipWithM_: OK (0.03s)
  14716. 1332.73 s [vector] +++ OK, passed 100 tests.
  14717. 1332.73 s [vector] zipWithM: OK
  14718. 1332.74 s [vector] +++ OK, passed 100 tests.
  14719. 1332.76 s [vector] zipWithM_: OK (0.03s)
  14720. 1332.76 s [vector] +++ OK, passed 100 tests.
  14721. 1332.77 s [vector] filter: OK
  14722. 1332.77 s [vector] +++ OK, passed 100 tests.
  14723. 1332.77 s [vector] ifilter: OK
  14724. 1332.77 s [vector] +++ OK, passed 100 tests.
  14725. 1332.82 s [vector] filterM: OK (0.05s)
  14726. 1332.83 s [vector] +++ OK, passed 100 tests.
  14727. 1332.83 s [vector] uniq: OK
  14728. 1332.83 s [vector] +++ OK, passed 100 tests.
  14729. 1332.83 s [vector] mapMaybe: OK
  14730. 1332.83 s [vector] +++ OK, passed 100 tests.
  14731. 1332.83 s [vector] imapMaybe: OK
  14732. 1332.84 s [vector] +++ OK, passed 100 tests.
  14733. 1332.84 s [vector] takeWhile: OK
  14734. 1332.84 s [vector] +++ OK, passed 100 tests.
  14735. 1332.84 s [vector] dropWhile: OK
  14736. 1332.84 s [vector] +++ OK, passed 100 tests.
  14737. 1332.85 s [vector] partition: OK
  14738. 1332.85 s [vector] +++ OK, passed 100 tests.
  14739. 1332.85 s [vector] partitionWith: OK
  14740. 1332.85 s [vector] +++ OK, passed 100 tests.
  14741. 1332.86 s [vector] span: OK
  14742. 1332.86 s [vector] +++ OK, passed 100 tests.
  14743. 1332.86 s [vector] break: OK
  14744. 1332.86 s [vector] +++ OK, passed 100 tests.
  14745. 1332.86 s [vector] spanR: OK
  14746. 1332.87 s [vector] +++ OK, passed 100 tests.
  14747. 1332.87 s [vector] breakR: OK
  14748. 1332.87 s [vector] +++ OK, passed 100 tests.
  14749. 1332.87 s [vector] groupBy: OK
  14750. 1332.87 s [vector] +++ OK, passed 100 tests.
  14751. 1332.87 s [vector] elem: OK
  14752. 1332.87 s [vector] +++ OK, passed 100 tests.
  14753. 1332.87 s [vector] notElem: OK
  14754. 1332.87 s [vector] +++ OK, passed 100 tests.
  14755. 1332.87 s [vector] find: OK
  14756. 1332.87 s [vector] +++ OK, passed 100 tests.
  14757. 1332.87 s [vector] findIndex: OK
  14758. 1332.87 s [vector] +++ OK, passed 100 tests.
  14759. 1332.87 s [vector] findIndexR: OK
  14760. 1332.87 s [vector] +++ OK, passed 100 tests.
  14761. 1332.88 s [vector] findIndices: OK
  14762. 1332.88 s [vector] +++ OK, passed 100 tests.
  14763. 1332.88 s [vector] elemIndex: OK
  14764. 1332.88 s [vector] +++ OK, passed 100 tests.
  14765. 1332.88 s [vector] elemIndices: OK
  14766. 1332.88 s [vector] +++ OK, passed 100 tests.
  14767. 1332.88 s [vector] foldl: OK
  14768. 1332.88 s [vector] +++ OK, passed 100 tests.
  14769. 1332.89 s [vector] foldl1: OK
  14770. 1332.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14771. 1332.89 s [vector] foldl': OK
  14772. 1332.89 s [vector] +++ OK, passed 100 tests.
  14773. 1332.90 s [vector] foldl1': OK
  14774. 1332.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14775. 1332.91 s [vector] foldr: OK
  14776. 1332.91 s [vector] +++ OK, passed 100 tests.
  14777. 1332.92 s [vector] foldr1: OK
  14778. 1332.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14779. 1332.93 s [vector] foldr': OK
  14780. 1332.94 s [vector] +++ OK, passed 100 tests.
  14781. 1332.95 s [vector] foldr1': OK
  14782. 1332.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14783. 1332.96 s [vector] ifoldl: OK
  14784. 1332.97 s [vector] +++ OK, passed 100 tests.
  14785. 1332.97 s [vector] ifoldl': OK
  14786. 1332.98 s [vector] +++ OK, passed 100 tests.
  14787. 1332.98 s [vector] ifoldr: OK
  14788. 1332.99 s [vector] +++ OK, passed 100 tests.
  14789. 1332.99 s [vector] ifoldr': OK (0.01s)
  14790. 1333.00 s [vector] +++ OK, passed 100 tests.
  14791. 1333.00 s [vector] ifoldM: OK
  14792. 1333.00 s [vector] +++ OK, passed 100 tests.
  14793. 1333.00 s [vector] ifoldM': OK
  14794. 1333.00 s [vector] +++ OK, passed 100 tests.
  14795. 1333.03 s [vector] ifoldM_: OK (0.04s)
  14796. 1333.03 s [vector] +++ OK, passed 100 tests.
  14797. 1333.06 s [vector] ifoldM'_: OK (0.03s)
  14798. 1333.06 s [vector] +++ OK, passed 100 tests.
  14799. 1333.07 s [vector] all: OK
  14800. 1333.07 s [vector] +++ OK, passed 100 tests.
  14801. 1333.07 s [vector] any: OK
  14802. 1333.07 s [vector] +++ OK, passed 100 tests.
  14803. 1333.09 s [vector] prescanl: OK
  14804. 1333.09 s [vector] +++ OK, passed 100 tests.
  14805. 1333.10 s [vector] prescanl': OK
  14806. 1333.10 s [vector] +++ OK, passed 100 tests.
  14807. 1333.10 s [vector] postscanl: OK
  14808. 1333.10 s [vector] +++ OK, passed 100 tests.
  14809. 1333.10 s [vector] postscanl': OK
  14810. 1333.10 s [vector] +++ OK, passed 100 tests.
  14811. 1333.10 s [vector] scanl: OK
  14812. 1333.10 s [vector] +++ OK, passed 100 tests.
  14813. 1333.11 s [vector] scanl': OK
  14814. 1333.11 s [vector] +++ OK, passed 100 tests.
  14815. 1333.11 s [vector] scanl1: OK
  14816. 1333.11 s [vector] +++ OK, passed 100 tests.
  14817. 1333.13 s [vector] scanl1': OK
  14818. 1333.13 s [vector] +++ OK, passed 100 tests.
  14819. 1333.13 s [vector] iscanl: OK
  14820. 1333.13 s [vector] +++ OK, passed 100 tests.
  14821. 1333.15 s [vector] iscanl': OK (0.01s)
  14822. 1333.15 s [vector] +++ OK, passed 100 tests.
  14823. 1333.16 s [vector] prescanr: OK (0.01s)
  14824. 1333.16 s [vector] +++ OK, passed 100 tests.
  14825. 1333.16 s [vector] prescanr': OK
  14826. 1333.17 s [vector] +++ OK, passed 100 tests.
  14827. 1333.17 s [vector] postscanr: OK (0.01s)
  14828. 1333.18 s [vector] +++ OK, passed 100 tests.
  14829. 1333.18 s [vector] postscanr': OK
  14830. 1333.18 s [vector] +++ OK, passed 100 tests.
  14831. 1333.19 s [vector] scanr: OK
  14832. 1333.19 s [vector] +++ OK, passed 100 tests.
  14833. 1333.21 s [vector] scanr': OK (0.01s)
  14834. 1333.21 s [vector] +++ OK, passed 100 tests.
  14835. 1333.23 s [vector] scanr1: OK (0.02s)
  14836. 1333.23 s [vector] +++ OK, passed 100 tests.
  14837. 1333.25 s [vector] scanr1': OK (0.02s)
  14838. 1333.26 s [vector] +++ OK, passed 100 tests.
  14839. 1333.27 s [vector] iscanr: OK (0.02s)
  14840. 1333.27 s [vector] +++ OK, passed 100 tests.
  14841. 1333.27 s [vector] iscanr': OK (0.01s)
  14842. 1333.27 s [vector] +++ OK, passed 100 tests.
  14843. 1333.27 s [vector] mut_read: OK
  14844. 1333.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14845. 1333.28 s [vector] mut_write: OK
  14846. 1333.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14847. 1333.28 s [vector] mut_modify: OK
  14848. 1333.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14849. 1333.29 s [vector] mut_generate: OK
  14850. 1333.29 s [vector] +++ OK, passed 100 tests.
  14851. 1333.31 s [vector] mut_generateM: OK (0.03s)
  14852. 1333.31 s [vector] +++ OK, passed 100 tests.
  14853. 1333.37 s [vector] mut_mapM_: OK (0.05s)
  14854. 1333.37 s [vector] +++ OK, passed 100 tests.
  14855. 1333.41 s [vector] mut_imapM_: OK (0.05s)
  14856. 1333.41 s [vector] +++ OK, passed 100 tests.
  14857. 1333.47 s [vector] mut_forM_: OK (0.05s)
  14858. 1333.47 s [vector] +++ OK, passed 100 tests.
  14859. 1333.49 s [vector] mut_iforM_: OK (0.03s)
  14860. 1333.49 s [vector] +++ OK, passed 100 tests.
  14861. 1333.49 s [vector] mut_foldr: OK
  14862. 1333.49 s [vector] +++ OK, passed 100 tests.
  14863. 1333.51 s [vector] mut_foldr': OK
  14864. 1333.51 s [vector] +++ OK, passed 100 tests.
  14865. 1333.52 s [vector] mut_foldl: OK
  14866. 1333.52 s [vector] +++ OK, passed 100 tests.
  14867. 1333.52 s [vector] mut_foldl': OK
  14868. 1333.52 s [vector] +++ OK, passed 100 tests.
  14869. 1333.53 s [vector] mut_ifoldr: OK
  14870. 1333.53 s [vector] +++ OK, passed 100 tests.
  14871. 1333.54 s [vector] mut_ifoldr': OK
  14872. 1333.54 s [vector] +++ OK, passed 100 tests.
  14873. 1333.55 s [vector] mut_ifoldl: OK
  14874. 1333.55 s [vector] +++ OK, passed 100 tests.
  14875. 1333.56 s [vector] mut_ifoldl': OK
  14876. 1333.56 s [vector] +++ OK, passed 100 tests.
  14877. 1333.57 s [vector] mut_foldM: OK
  14878. 1333.57 s [vector] +++ OK, passed 100 tests.
  14879. 1333.58 s [vector] mut_foldM': OK (0.01s)
  14880. 1333.58 s [vector] +++ OK, passed 100 tests.
  14881. 1333.61 s [vector] mut_foldrM: OK
  14882. 1333.61 s [vector] +++ OK, passed 100 tests.
  14883. 1333.61 s [vector] mut_foldrM': OK (0.01s)
  14884. 1333.62 s [vector] +++ OK, passed 100 tests.
  14885. 1333.63 s [vector] mut_ifoldM: OK
  14886. 1333.63 s [vector] +++ OK, passed 100 tests.
  14887. 1333.64 s [vector] mut_ifoldM': OK
  14888. 1333.64 s [vector] +++ OK, passed 100 tests.
  14889. 1333.64 s [vector] mut_ifoldrM: OK
  14890. 1333.64 s [vector] +++ OK, passed 100 tests.
  14891. 1333.64 s [vector] mut_ifoldrM': OK
  14892. 1333.64 s [vector] +++ OK, passed 100 tests.
  14893. 1333.64 s [vector] compare: OK
  14894. 1333.64 s [vector] +++ OK, passed 100 tests.
  14895. 1333.64 s [vector] maximum: OK
  14896. 1333.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14897. 1333.64 s [vector] minimum: OK
  14898. 1333.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14899. 1333.64 s [vector] minIndex: OK
  14900. 1333.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14901. 1333.65 s [vector] maxIndex: OK
  14902. 1333.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14903. 1333.65 s [vector] maximumBy: OK
  14904. 1333.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14905. 1333.65 s [vector] minimumBy: OK
  14906. 1333.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14907. 1333.65 s [vector] maximumOn: OK
  14908. 1333.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14909. 1333.65 s [vector] minimumOn: OK
  14910. 1333.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14911. 1333.65 s [vector] maxIndexBy: OK
  14912. 1333.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14913. 1333.65 s [vector] minIndexBy: OK
  14914. 1333.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14915. 1333.65 s [vector] ListFirstMaxIndexWins: OK
  14916. 1333.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14917. 1333.65 s [vector] FalseListFirstMaxIndexWins: OK
  14918. 1333.65 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  14919. 1333.65 s [vector] []
  14920. 1333.65 s [vector] zip: OK
  14921. 1333.65 s [vector] +++ OK, passed 100 tests.
  14922. 1333.65 s [vector] zip3: OK
  14923. 1333.65 s [vector] +++ OK, passed 100 tests.
  14924. 1333.65 s [vector] unzip: OK
  14925. 1333.65 s [vector] +++ OK, passed 100 tests.
  14926. 1333.65 s [vector] unzip3: OK
  14927. 1333.65 s [vector] +++ OK, passed 100 tests.
  14928. 1333.66 s [vector] indexed: OK
  14929. 1333.66 s [vector] +++ OK, passed 100 tests.
  14930. 1333.66 s [vector] update: OK
  14931. 1333.66 s [vector] +++ OK, passed 100 tests.
  14932. 1333.66 s [vector] mempty: OK
  14933. 1333.66 s [vector] +++ OK, passed 100 tests.
  14934. 1333.66 s [vector] mappend: OK
  14935. 1333.66 s [vector] +++ OK, passed 100 tests.
  14936. 1333.68 s [vector] mconcat: OK (0.01s)
  14937. 1333.69 s [vector] +++ OK, passed 100 tests.
  14938. 1333.69 s [vector] glength: OK
  14939. 1333.69 s [vector] +++ OK, passed 100 tests.
  14940. 1333.69 s [vector] sum: OK
  14941. 1333.69 s [vector] +++ OK, passed 100 tests.
  14942. 1333.69 s [vector] product: OK
  14943. 1333.69 s [vector] +++ OK, passed 100 tests.
  14944. 1333.69 s [vector] enumFromN: OK
  14945. 1333.69 s [vector] +++ OK, passed 100 tests.
  14946. 1333.69 s [vector] enumFromThenN: OK
  14947. 1333.69 s [vector] +++ OK, passed 100 tests.
  14948. 1333.69 s [vector] enumFromTo: OK
  14949. 1333.69 s [vector] +++ OK, passed 100 tests.
  14950. 1333.69 s [vector] enumFromThenTo: OK
  14951. 1333.69 s [vector] +++ OK, passed 100 tests; 2 discarded.
  14952. 1333.69 s [vector] (Double)
  14953. 1333.69 s [vector] fromList.toList == id: OK
  14954. 1333.69 s [vector] +++ OK, passed 100 tests.
  14955. 1333.69 s [vector] toList.fromList == id: OK
  14956. 1333.69 s [vector] +++ OK, passed 100 tests.
  14957. 1333.69 s [vector] unstream.stream == id: OK
  14958. 1333.69 s [vector] +++ OK, passed 100 tests.
  14959. 1333.69 s [vector] stream.unstream == id: OK
  14960. 1333.69 s [vector] +++ OK, passed 100 tests.
  14961. 1333.69 s [vector] eq: OK
  14962. 1333.69 s [vector] +++ OK, passed 100 tests.
  14963. 1333.70 s [vector] length: OK
  14964. 1333.70 s [vector] +++ OK, passed 100 tests.
  14965. 1333.70 s [vector] null: OK
  14966. 1333.70 s [vector] +++ OK, passed 100 tests.
  14967. 1333.70 s [vector] index: OK
  14968. 1333.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14969. 1333.70 s [vector] safeIndex: OK
  14970. 1333.70 s [vector] +++ OK, passed 100 tests.
  14971. 1333.70 s [vector] head: OK
  14972. 1333.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14973. 1333.70 s [vector] last: OK
  14974. 1333.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14975. 1333.70 s [vector] unsafeIndex: OK
  14976. 1333.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14977. 1333.70 s [vector] unsafeHead: OK
  14978. 1333.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14979. 1333.70 s [vector] unsafeLast: OK
  14980. 1333.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14981. 1333.70 s [vector] slice: OK
  14982. 1333.70 s [vector] +++ OK, passed 100 tests.
  14983. 1333.70 s [vector] init: OK
  14984. 1333.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14985. 1333.70 s [vector] tail: OK
  14986. 1333.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14987. 1333.71 s [vector] take: OK
  14988. 1333.71 s [vector] +++ OK, passed 100 tests.
  14989. 1333.71 s [vector] drop: OK
  14990. 1333.71 s [vector] +++ OK, passed 100 tests.
  14991. 1333.71 s [vector] splitAt: OK
  14992. 1333.71 s [vector] +++ OK, passed 100 tests.
  14993. 1333.71 s [vector] empty: OK
  14994. 1333.71 s [vector] +++ OK, passed 100 tests.
  14995. 1333.71 s [vector] singleton: OK
  14996. 1333.71 s [vector] +++ OK, passed 100 tests.
  14997. 1333.71 s [vector] replicate: OK
  14998. 1333.71 s [vector] +++ OK, passed 100 tests.
  14999. 1333.71 s [vector] generate: OK
  15000. 1333.71 s [vector] +++ OK, passed 100 tests.
  15001. 1333.71 s [vector] iterateN: OK
  15002. 1333.71 s [vector] +++ OK, passed 100 tests.
  15003. 1333.75 s [vector] iterateNM: OK (0.02s)
  15004. 1333.75 s [vector] +++ OK, passed 100 tests.
  15005. 1333.77 s [vector] generateM: OK (0.03s)
  15006. 1333.77 s [vector] +++ OK, passed 100 tests.
  15007. 1333.79 s [vector] replicateM: OK (0.02s)
  15008. 1333.79 s [vector] +++ OK, passed 100 tests.
  15009. 1333.79 s [vector] create: OK
  15010. 1333.79 s [vector] +++ OK, passed 100 tests.
  15011. 1333.79 s [vector] createT: OK
  15012. 1333.79 s [vector] +++ OK, passed 100 tests.
  15013. 1333.79 s [vector] unfoldr: OK
  15014. 1333.79 s [vector] +++ OK, passed 100 tests.
  15015. 1333.79 s [vector] unfoldrN: OK
  15016. 1333.79 s [vector] +++ OK, passed 100 tests.
  15017. 1333.79 s [vector] unfoldrExactN: OK
  15018. 1333.79 s [vector] +++ OK, passed 100 tests.
  15019. 1333.80 s [vector] unfoldrM: OK
  15020. 1333.81 s [vector] +++ OK, passed 100 tests.
  15021. 1333.81 s [vector] unfoldrNM: OK
  15022. 1333.81 s [vector] +++ OK, passed 100 tests.
  15023. 1333.82 s [vector] unfoldrExactNM: OK (0.01s)
  15024. 1333.82 s [vector] +++ OK, passed 100 tests.
  15025. 1333.83 s [vector] constructN: OK (0.02s)
  15026. 1333.83 s [vector] +++ OK, passed 100 tests.
  15027. 1333.84 s [vector] constructrN: OK
  15028. 1333.84 s [vector] +++ OK, passed 100 tests.
  15029. 1333.84 s [vector] cons: OK
  15030. 1333.84 s [vector] +++ OK, passed 100 tests.
  15031. 1333.85 s [vector] snoc: OK
  15032. 1333.85 s [vector] +++ OK, passed 100 tests.
  15033. 1333.86 s [vector] append: OK
  15034. 1333.86 s [vector] +++ OK, passed 100 tests.
  15035. 1333.87 s [vector] concat: OK (0.03s)
  15036. 1333.87 s [vector] +++ OK, passed 100 tests.
  15037. 1333.87 s [vector] force: OK
  15038. 1333.87 s [vector] +++ OK, passed 100 tests.
  15039. 1333.87 s [vector] upd: OK
  15040. 1333.87 s [vector] +++ OK, passed 100 tests.
  15041. 1333.89 s [vector] accum: OK (0.01s)
  15042. 1333.89 s [vector] +++ OK, passed 100 tests.
  15043. 1333.89 s [vector] reverse: OK
  15044. 1333.89 s [vector] +++ OK, passed 100 tests.
  15045. 1333.90 s [vector] backpermute: OK
  15046. 1333.91 s [vector] +++ OK, passed 100 tests.
  15047. 1333.91 s [vector] map: OK
  15048. 1333.92 s [vector] +++ OK, passed 100 tests.
  15049. 1333.93 s [vector] imap: OK
  15050. 1333.93 s [vector] +++ OK, passed 100 tests.
  15051. 1333.93 s [vector] concatMap: OK
  15052. 1333.93 s [vector] +++ OK, passed 100 tests.
  15053. 1333.93 s [vector] mapM: OK
  15054. 1333.93 s [vector] +++ OK, passed 100 tests.
  15055. 1333.97 s [vector] mapM_: OK (0.05s)
  15056. 1333.98 s [vector] +++ OK, passed 100 tests.
  15057. 1333.99 s [vector] forM: OK (0.01s)
  15058. 1333.99 s [vector] +++ OK, passed 100 tests.
  15059. 1334.02 s [vector] forM_: OK (0.04s)
  15060. 1334.02 s [vector] +++ OK, passed 100 tests.
  15061. 1334.03 s [vector] imapM: OK
  15062. 1334.03 s [vector] +++ OK, passed 100 tests.
  15063. 1334.07 s [vector] imapM_: OK (0.04s)
  15064. 1334.07 s [vector] +++ OK, passed 100 tests.
  15065. 1334.09 s [vector] zipWith: OK (0.01s)
  15066. 1334.09 s [vector] +++ OK, passed 100 tests.
  15067. 1334.09 s [vector] zipWith3: OK (0.01s)
  15068. 1334.09 s [vector] +++ OK, passed 100 tests.
  15069. 1334.11 s [vector] izipWith: OK (0.02s)
  15070. 1334.11 s [vector] +++ OK, passed 100 tests.
  15071. 1334.13 s [vector] izipWith3: OK (0.02s)
  15072. 1334.14 s [vector] +++ OK, passed 100 tests.
  15073. 1334.15 s [vector] izipWithM: OK (0.01s)
  15074. 1334.15 s [vector] +++ OK, passed 100 tests.
  15075. 1334.17 s [vector] izipWithM_: OK (0.03s)
  15076. 1334.17 s [vector] +++ OK, passed 100 tests.
  15077. 1334.19 s [vector] zipWithM: OK (0.01s)
  15078. 1334.19 s [vector] +++ OK, passed 100 tests.
  15079. 1334.22 s [vector] zipWithM_: OK (0.04s)
  15080. 1334.23 s [vector] +++ OK, passed 100 tests.
  15081. 1334.23 s [vector] filter: OK
  15082. 1334.23 s [vector] +++ OK, passed 100 tests.
  15083. 1334.24 s [vector] ifilter: OK
  15084. 1334.24 s [vector] +++ OK, passed 100 tests.
  15085. 1334.29 s [vector] filterM: OK (0.06s)
  15086. 1334.29 s [vector] +++ OK, passed 100 tests.
  15087. 1334.29 s [vector] uniq: OK
  15088. 1334.29 s [vector] +++ OK, passed 100 tests.
  15089. 1334.31 s [vector] mapMaybe: OK (0.01s)
  15090. 1334.31 s [vector] +++ OK, passed 100 tests.
  15091. 1334.32 s [vector] imapMaybe: OK (0.02s)
  15092. 1334.33 s [vector] +++ OK, passed 100 tests.
  15093. 1334.33 s [vector] takeWhile: OK
  15094. 1334.33 s [vector] +++ OK, passed 100 tests.
  15095. 1334.33 s [vector] dropWhile: OK
  15096. 1334.33 s [vector] +++ OK, passed 100 tests.
  15097. 1334.35 s [vector] partition: OK (0.02s)
  15098. 1334.36 s [vector] +++ OK, passed 100 tests.
  15099. 1334.36 s [vector] partitionWith: OK (0.02s)
  15100. 1334.36 s [vector] +++ OK, passed 100 tests.
  15101. 1334.37 s [vector] span: OK
  15102. 1334.37 s [vector] +++ OK, passed 100 tests.
  15103. 1334.37 s [vector] break: OK
  15104. 1334.37 s [vector] +++ OK, passed 100 tests.
  15105. 1334.39 s [vector] spanR: OK
  15106. 1334.39 s [vector] +++ OK, passed 100 tests.
  15107. 1334.39 s [vector] breakR: OK
  15108. 1334.39 s [vector] +++ OK, passed 100 tests.
  15109. 1334.39 s [vector] groupBy: OK (0.02s)
  15110. 1334.39 s [vector] +++ OK, passed 100 tests.
  15111. 1334.40 s [vector] elem: OK
  15112. 1334.40 s [vector] +++ OK, passed 100 tests.
  15113. 1334.40 s [vector] notElem: OK
  15114. 1334.40 s [vector] +++ OK, passed 100 tests.
  15115. 1334.40 s [vector] find: OK
  15116. 1334.40 s [vector] +++ OK, passed 100 tests.
  15117. 1334.40 s [vector] findIndex: OK
  15118. 1334.40 s [vector] +++ OK, passed 100 tests.
  15119. 1334.41 s [vector] findIndexR: OK
  15120. 1334.41 s [vector] +++ OK, passed 100 tests.
  15121. 1334.43 s [vector] findIndices: OK (0.02s)
  15122. 1334.43 s [vector] +++ OK, passed 100 tests.
  15123. 1334.43 s [vector] elemIndex: OK
  15124. 1334.43 s [vector] +++ OK, passed 100 tests.
  15125. 1334.43 s [vector] elemIndices: OK
  15126. 1334.43 s [vector] +++ OK, passed 100 tests.
  15127. 1334.47 s [vector] foldl: OK (0.03s)
  15128. 1334.48 s [vector] +++ OK, passed 100 tests.
  15129. 1334.52 s [vector] foldl1: OK (0.04s)
  15130. 1334.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15131. 1334.55 s [vector] foldl': OK (0.04s)
  15132. 1334.56 s [vector] +++ OK, passed 100 tests.
  15133. 1334.59 s [vector] foldl1': OK (0.04s)
  15134. 1334.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15135. 1334.61 s [vector] foldr: OK (0.03s)
  15136. 1334.61 s [vector] +++ OK, passed 100 tests.
  15137. 1334.65 s [vector] foldr1: OK (0.03s)
  15138. 1334.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15139. 1334.67 s [vector] foldr': OK (0.02s)
  15140. 1334.68 s [vector] +++ OK, passed 100 tests.
  15141. 1334.69 s [vector] foldr1': OK (0.03s)
  15142. 1334.69 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15143. 1334.71 s [vector] ifoldl: OK (0.03s)
  15144. 1334.71 s [vector] +++ OK, passed 100 tests.
  15145. 1334.75 s [vector] ifoldl': OK (0.02s)
  15146. 1334.76 s [vector] +++ OK, passed 100 tests.
  15147. 1334.77 s [vector] ifoldr: OK (0.02s)
  15148. 1334.77 s [vector] +++ OK, passed 100 tests.
  15149. 1334.78 s [vector] ifoldr': OK (0.02s)
  15150. 1334.78 s [vector] +++ OK, passed 100 tests.
  15151. 1334.79 s [vector] ifoldM: OK (0.02s)
  15152. 1334.79 s [vector] +++ OK, passed 100 tests.
  15153. 1334.81 s [vector] ifoldM': OK (0.02s)
  15154. 1334.81 s [vector] +++ OK, passed 100 tests.
  15155. 1334.85 s [vector] ifoldM_: OK (0.04s)
  15156. 1334.86 s [vector] +++ OK, passed 100 tests.
  15157. 1334.90 s [vector] ifoldM'_: OK (0.06s)
  15158. 1334.90 s [vector] +++ OK, passed 100 tests.
  15159. 1334.90 s [vector] all: OK
  15160. 1334.90 s [vector] +++ OK, passed 100 tests.
  15161. 1334.90 s [vector] any: OK
  15162. 1334.90 s [vector] +++ OK, passed 100 tests.
  15163. 1334.93 s [vector] prescanl: OK
  15164. 1334.93 s [vector] +++ OK, passed 100 tests.
  15165. 1334.94 s [vector] prescanl': OK (0.01s)
  15166. 1334.94 s [vector] +++ OK, passed 100 tests.
  15167. 1334.97 s [vector] postscanl: OK (0.02s)
  15168. 1334.97 s [vector] +++ OK, passed 100 tests.
  15169. 1334.99 s [vector] postscanl': OK (0.02s)
  15170. 1334.99 s [vector] +++ OK, passed 100 tests.
  15171. 1335.01 s [vector] scanl: OK (0.03s)
  15172. 1335.32 s [vector] +++ OK, passed 100 tests.
  15173. 1335.32 s [vector] scanl': OK (0.02s)
  15174. 1335.32 s [vector] +++ OK, passed 100 tests.
  15175. 1335.32 s [vector] scanl1: OK (0.01s)
  15176. 1335.32 s [vector] +++ OK, passed 100 tests.
  15177. 1335.32 s [vector] scanl1': OK (0.02s)
  15178. 1335.32 s [vector] +++ OK, passed 100 tests.
  15179. 1335.32 s [vector] iscanl: OK (0.02s)
  15180. 1335.32 s [vector] +++ OK, passed 100 tests.
  15181. 1335.32 s [vector] iscanl': OK (0.02s)
  15182. 1335.32 s [vector] +++ OK, passed 100 tests.
  15183. 1335.32 s [vector] prescanr: OK (0.01s)
  15184. 1335.32 s [vector] +++ OK, passed 100 tests.
  15185. 1335.32 s [vector] prescanr': OK
  15186. 1335.32 s [vector] +++ OK, passed 100 tests.
  15187. 1335.32 s [vector] postscanr: OK (0.02s)
  15188. 1335.32 s [vector] +++ OK, passed 100 tests.
  15189. 1335.32 s [vector] postscanr': OK (0.02s)
  15190. 1335.32 s [vector] +++ OK, passed 100 tests.
  15191. 1335.32 s [vector] scanr: OK (0.02s)
  15192. 1335.32 s [vector] +++ OK, passed 100 tests.
  15193. 1335.32 s [vector] scanr': OK (0.02s)
  15194. 1335.32 s [vector] +++ OK, passed 100 tests.
  15195. 1335.32 s [vector] scanr1: OK (0.02s)
  15196. 1335.32 s [vector] +++ OK, passed 100 tests.
  15197. 1335.32 s [vector] scanr1': OK (0.01s)
  15198. 1335.32 s [vector] +++ OK, passed 100 tests.
  15199. 1335.32 s [vector] iscanr: OK (0.03s)
  15200. 1335.32 s [vector] +++ OK, passed 100 tests.
  15201. 1335.32 s [vector] iscanr': OK (0.02s)
  15202. 1335.32 s [vector] +++ OK, passed 100 tests.
  15203. 1335.32 s [vector] mut_read: OK
  15204. 1335.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15205. 1335.32 s [vector] mut_write: OK
  15206. 1335.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15207. 1335.32 s [vector] mut_modify: OK
  15208. 1335.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15209. 1335.32 s [vector] mut_generate: OK
  15210. 1335.32 s [vector] +++ OK, passed 100 tests.
  15211. 1335.32 s [vector] mut_generateM: OK (0.02s)
  15212. 1335.32 s [vector] +++ OK, passed 100 tests.
  15213. 1335.37 s [vector] mut_mapM_: OK (0.04s)
  15214. 1335.37 s [vector] +++ OK, passed 100 tests.
  15215. 1335.41 s [vector] mut_imapM_: OK (0.04s)
  15216. 1335.41 s [vector] +++ OK, passed 100 tests.
  15217. 1335.45 s [vector] mut_forM_: OK (0.04s)
  15218. 1335.45 s [vector] +++ OK, passed 100 tests.
  15219. 1335.49 s [vector] mut_iforM_: OK (0.04s)
  15220. 1335.49 s [vector] +++ OK, passed 100 tests.
  15221. 1335.50 s [vector] mut_foldr: OK (0.02s)
  15222. 1335.50 s [vector] +++ OK, passed 100 tests.
  15223. 1335.51 s [vector] mut_foldr': OK (0.02s)
  15224. 1335.51 s [vector] +++ OK, passed 100 tests.
  15225. 1335.53 s [vector] mut_foldl: OK (0.01s)
  15226. 1335.54 s [vector] +++ OK, passed 100 tests.
  15227. 1335.55 s [vector] mut_foldl': OK (0.02s)
  15228. 1335.55 s [vector] +++ OK, passed 100 tests.
  15229. 1335.57 s [vector] mut_ifoldr: OK (0.03s)
  15230. 1335.58 s [vector] +++ OK, passed 100 tests.
  15231. 1335.59 s [vector] mut_ifoldr': OK (0.02s)
  15232. 1335.59 s [vector] +++ OK, passed 100 tests.
  15233. 1335.63 s [vector] mut_ifoldl: OK (0.02s)
  15234. 1335.63 s [vector] +++ OK, passed 100 tests.
  15235. 1335.65 s [vector] mut_ifoldl': OK (0.03s)
  15236. 1335.65 s [vector] +++ OK, passed 100 tests.
  15237. 1335.67 s [vector] mut_foldM: OK (0.02s)
  15238. 1335.67 s [vector] +++ OK, passed 100 tests.
  15239. 1335.69 s [vector] mut_foldM': OK (0.02s)
  15240. 1335.69 s [vector] +++ OK, passed 100 tests.
  15241. 1335.71 s [vector] mut_foldrM: OK (0.02s)
  15242. 1335.71 s [vector] +++ OK, passed 100 tests.
  15243. 1335.73 s [vector] mut_foldrM': OK (0.02s)
  15244. 1335.73 s [vector] +++ OK, passed 100 tests.
  15245. 1335.75 s [vector] mut_ifoldM: OK (0.03s)
  15246. 1335.75 s [vector] +++ OK, passed 100 tests.
  15247. 1335.79 s [vector] mut_ifoldM': OK (0.02s)
  15248. 1335.79 s [vector] +++ OK, passed 100 tests.
  15249. 1335.81 s [vector] mut_ifoldrM: OK (0.02s)
  15250. 1335.81 s [vector] +++ OK, passed 100 tests.
  15251. 1335.82 s [vector] mut_ifoldrM': OK (0.02s)
  15252. 1335.82 s [vector] +++ OK, passed 100 tests.
  15253. 1335.82 s [vector] compare: OK
  15254. 1335.82 s [vector] +++ OK, passed 100 tests.
  15255. 1335.82 s [vector] maximum: OK
  15256. 1335.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15257. 1335.83 s [vector] minimum: OK
  15258. 1335.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15259. 1335.83 s [vector] minIndex: OK
  15260. 1335.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15261. 1335.83 s [vector] maxIndex: OK
  15262. 1335.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15263. 1335.83 s [vector] maximumBy: OK
  15264. 1335.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15265. 1335.83 s [vector] minimumBy: OK
  15266. 1335.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15267. 1335.83 s [vector] maximumOn: OK
  15268. 1335.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15269. 1335.83 s [vector] minimumOn: OK
  15270. 1335.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15271. 1335.84 s [vector] maxIndexBy: OK
  15272. 1335.84 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15273. 1335.84 s [vector] minIndexBy: OK
  15274. 1335.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15275. 1335.84 s [vector] ListFirstMaxIndexWins: OK
  15276. 1335.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15277. 1335.84 s [vector] FalseListFirstMaxIndexWins: OK
  15278. 1335.84 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  15279. 1335.84 s [vector] []
  15280. 1335.84 s [vector] zip: OK
  15281. 1335.84 s [vector] +++ OK, passed 100 tests.
  15282. 1335.85 s [vector] zip3: OK
  15283. 1335.85 s [vector] +++ OK, passed 100 tests.
  15284. 1335.85 s [vector] unzip: OK
  15285. 1335.86 s [vector] +++ OK, passed 100 tests.
  15286. 1335.86 s [vector] unzip3: OK
  15287. 1335.86 s [vector] +++ OK, passed 100 tests.
  15288. 1335.86 s [vector] indexed: OK
  15289. 1335.86 s [vector] +++ OK, passed 100 tests.
  15290. 1335.87 s [vector] update: OK
  15291. 1335.87 s [vector] +++ OK, passed 100 tests.
  15292. 1335.87 s [vector] mempty: OK
  15293. 1335.87 s [vector] +++ OK, passed 100 tests.
  15294. 1335.88 s [vector] mappend: OK
  15295. 1335.88 s [vector] +++ OK, passed 100 tests.
  15296. 1335.92 s [vector] mconcat: OK (0.05s)
  15297. 1335.92 s [vector] +++ OK, passed 100 tests.
  15298. 1335.92 s [vector] glength: OK
  15299. 1335.92 s [vector] +++ OK, passed 100 tests.
  15300. 1335.93 s [vector] sum: OK
  15301. 1335.93 s [vector] +++ OK, passed 100 tests.
  15302. 1335.93 s [vector] product: OK
  15303. 1335.93 s [vector] +++ OK, passed 100 tests.
  15304. 1335.93 s [vector] enumFromN: OK
  15305. 1335.93 s [vector] +++ OK, passed 100 tests.
  15306. 1335.93 s [vector] enumFromThenN: OK
  15307. 1335.93 s [vector] +++ OK, passed 100 tests.
  15308. 1335.93 s [vector] enumFromTo: OK
  15309. 1335.93 s [vector] +++ OK, passed 100 tests.
  15310. 1335.93 s [vector] enumFromThenTo: OK
  15311. 1335.93 s [vector] +++ OK, passed 100 tests; 1 discarded.
  15312. 1335.93 s [vector] (Int,Bool)
  15313. 1335.93 s [vector] fromList.toList == id: OK
  15314. 1335.93 s [vector] +++ OK, passed 100 tests.
  15315. 1335.93 s [vector] toList.fromList == id: OK
  15316. 1335.94 s [vector] +++ OK, passed 100 tests.
  15317. 1335.94 s [vector] unstream.stream == id: OK
  15318. 1335.94 s [vector] +++ OK, passed 100 tests.
  15319. 1335.94 s [vector] stream.unstream == id: OK
  15320. 1335.94 s [vector] +++ OK, passed 100 tests.
  15321. 1335.94 s [vector] eq: OK
  15322. 1335.94 s [vector] +++ OK, passed 100 tests.
  15323. 1335.94 s [vector] length: OK
  15324. 1335.94 s [vector] +++ OK, passed 100 tests.
  15325. 1335.94 s [vector] null: OK
  15326. 1335.94 s [vector] +++ OK, passed 100 tests.
  15327. 1335.94 s [vector] index: OK
  15328. 1335.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15329. 1335.95 s [vector] safeIndex: OK
  15330. 1335.95 s [vector] +++ OK, passed 100 tests.
  15331. 1335.95 s [vector] head: OK
  15332. 1335.95 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15333. 1335.95 s [vector] last: OK
  15334. 1335.95 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15335. 1335.95 s [vector] unsafeIndex: OK
  15336. 1335.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15337. 1335.95 s [vector] unsafeHead: OK
  15338. 1335.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15339. 1335.95 s [vector] unsafeLast: OK
  15340. 1335.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15341. 1335.96 s [vector] slice: OK
  15342. 1335.96 s [vector] +++ OK, passed 100 tests.
  15343. 1335.97 s [vector] init: OK
  15344. 1335.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15345. 1335.97 s [vector] tail: OK
  15346. 1335.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15347. 1335.97 s [vector] take: OK
  15348. 1335.97 s [vector] +++ OK, passed 100 tests.
  15349. 1335.97 s [vector] drop: OK
  15350. 1335.97 s [vector] +++ OK, passed 100 tests.
  15351. 1335.97 s [vector] splitAt: OK
  15352. 1335.97 s [vector] +++ OK, passed 100 tests.
  15353. 1335.97 s [vector] empty: OK
  15354. 1335.97 s [vector] +++ OK, passed 100 tests.
  15355. 1335.97 s [vector] singleton: OK
  15356. 1335.97 s [vector] +++ OK, passed 100 tests.
  15357. 1335.97 s [vector] replicate: OK
  15358. 1335.97 s [vector] +++ OK, passed 100 tests.
  15359. 1335.97 s [vector] generate: OK
  15360. 1335.98 s [vector] +++ OK, passed 100 tests.
  15361. 1335.99 s [vector] iterateN: OK
  15362. 1335.99 s [vector] +++ OK, passed 100 tests.
  15363. 1336.01 s [vector] iterateNM: OK (0.02s)
  15364. 1336.01 s [vector] +++ OK, passed 100 tests.
  15365. 1336.05 s [vector] generateM: OK (0.04s)
  15366. 1336.05 s [vector] +++ OK, passed 100 tests.
  15367. 1336.06 s [vector] replicateM: OK (0.02s)
  15368. 1336.06 s [vector] +++ OK, passed 100 tests.
  15369. 1336.06 s [vector] create: OK
  15370. 1336.06 s [vector] +++ OK, passed 100 tests.
  15371. 1336.06 s [vector] createT: OK
  15372. 1336.06 s [vector] +++ OK, passed 100 tests.
  15373. 1336.06 s [vector] unfoldr: OK
  15374. 1336.06 s [vector] +++ OK, passed 100 tests.
  15375. 1336.06 s [vector] unfoldrN: OK
  15376. 1336.06 s [vector] +++ OK, passed 100 tests.
  15377. 1336.07 s [vector] unfoldrExactN: OK
  15378. 1336.07 s [vector] +++ OK, passed 100 tests.
  15379. 1336.07 s [vector] unfoldrM: OK
  15380. 1336.07 s [vector] +++ OK, passed 100 tests.
  15381. 1336.07 s [vector] unfoldrNM: OK
  15382. 1336.07 s [vector] +++ OK, passed 100 tests.
  15383. 1336.11 s [vector] unfoldrExactNM: OK (0.03s)
  15384. 1336.11 s [vector] +++ OK, passed 100 tests.
  15385. 1336.11 s [vector] constructN: OK (0.01s)
  15386. 1336.11 s [vector] +++ OK, passed 100 tests.
  15387. 1336.12 s [vector] constructrN: OK
  15388. 1336.12 s [vector] +++ OK, passed 100 tests.
  15389. 1336.12 s [vector] cons: OK
  15390. 1336.12 s [vector] +++ OK, passed 100 tests.
  15391. 1336.13 s [vector] snoc: OK
  15392. 1336.13 s [vector] +++ OK, passed 100 tests.
  15393. 1336.13 s [vector] append: OK
  15394. 1336.13 s [vector] +++ OK, passed 100 tests.
  15395. 1336.20 s [vector] concat: OK (0.07s)
  15396. 1336.21 s [vector] +++ OK, passed 100 tests.
  15397. 1336.21 s [vector] force: OK
  15398. 1336.21 s [vector] +++ OK, passed 100 tests.
  15399. 1336.22 s [vector] upd: OK
  15400. 1336.22 s [vector] +++ OK, passed 100 tests.
  15401. 1336.22 s [vector] accum: OK (0.01s)
  15402. 1336.22 s [vector] +++ OK, passed 100 tests.
  15403. 1336.22 s [vector] reverse: OK
  15404. 1336.22 s [vector] +++ OK, passed 100 tests.
  15405. 1336.23 s [vector] backpermute: OK
  15406. 1336.23 s [vector] +++ OK, passed 100 tests.
  15407. 1336.23 s [vector] map: OK
  15408. 1336.23 s [vector] +++ OK, passed 100 tests.
  15409. 1336.25 s [vector] imap: OK
  15410. 1336.25 s [vector] +++ OK, passed 100 tests.
  15411. 1336.25 s [vector] concatMap: OK
  15412. 1336.25 s [vector] +++ OK, passed 100 tests.
  15413. 1336.25 s [vector] mapM: OK
  15414. 1336.25 s [vector] +++ OK, passed 100 tests.
  15415. 1336.30 s [vector] mapM_: OK (0.04s)
  15416. 1336.30 s [vector] +++ OK, passed 100 tests.
  15417. 1336.30 s [vector] forM: OK
  15418. 1336.30 s [vector] +++ OK, passed 100 tests.
  15419. 1336.34 s [vector] forM_: OK (0.03s)
  15420. 1336.35 s [vector] +++ OK, passed 100 tests.
  15421. 1336.35 s [vector] imapM: OK
  15422. 1336.35 s [vector] +++ OK, passed 100 tests.
  15423. 1336.37 s [vector] imapM_: OK (0.03s)
  15424. 1336.37 s [vector] +++ OK, passed 100 tests.
  15425. 1336.37 s [vector] zipWith: OK
  15426. 1336.37 s [vector] +++ OK, passed 100 tests.
  15427. 1336.38 s [vector] zipWith3: OK
  15428. 1336.39 s [vector] +++ OK, passed 100 tests.
  15429. 1336.39 s [vector] izipWith: OK
  15430. 1336.39 s [vector] +++ OK, passed 100 tests.
  15431. 1336.39 s [vector] izipWith3: OK
  15432. 1336.39 s [vector] +++ OK, passed 100 tests.
  15433. 1336.39 s [vector] izipWithM: OK
  15434. 1336.39 s [vector] +++ OK, passed 100 tests.
  15435. 1336.42 s [vector] izipWithM_: OK (0.02s)
  15436. 1336.43 s [vector] +++ OK, passed 100 tests.
  15437. 1336.43 s [vector] zipWithM: OK
  15438. 1336.43 s [vector] +++ OK, passed 100 tests.
  15439. 1336.44 s [vector] zipWithM_: OK (0.02s)
  15440. 1336.45 s [vector] +++ OK, passed 100 tests.
  15441. 1336.45 s [vector] filter: OK
  15442. 1336.45 s [vector] +++ OK, passed 100 tests.
  15443. 1336.45 s [vector] ifilter: OK
  15444. 1336.45 s [vector] +++ OK, passed 100 tests.
  15445. 1336.51 s [vector] filterM: OK (0.06s)
  15446. 1336.51 s [vector] +++ OK, passed 100 tests.
  15447. 1336.51 s [vector] uniq: OK
  15448. 1336.51 s [vector] +++ OK, passed 100 tests.
  15449. 1336.51 s [vector] mapMaybe: OK
  15450. 1336.51 s [vector] +++ OK, passed 100 tests.
  15451. 1336.52 s [vector] imapMaybe: OK
  15452. 1336.52 s [vector] +++ OK, passed 100 tests.
  15453. 1336.52 s [vector] takeWhile: OK
  15454. 1336.52 s [vector] +++ OK, passed 100 tests.
  15455. 1336.52 s [vector] dropWhile: OK
  15456. 1336.53 s [vector] +++ OK, passed 100 tests.
  15457. 1336.53 s [vector] partition: OK
  15458. 1336.53 s [vector] +++ OK, passed 100 tests.
  15459. 1336.53 s [vector] partitionWith: OK
  15460. 1336.53 s [vector] +++ OK, passed 100 tests.
  15461. 1336.53 s [vector] span: OK
  15462. 1336.53 s [vector] +++ OK, passed 100 tests.
  15463. 1336.53 s [vector] break: OK
  15464. 1336.54 s [vector] +++ OK, passed 100 tests.
  15465. 1336.54 s [vector] spanR: OK
  15466. 1336.54 s [vector] +++ OK, passed 100 tests.
  15467. 1336.54 s [vector] breakR: OK
  15468. 1336.54 s [vector] +++ OK, passed 100 tests.
  15469. 1336.54 s [vector] groupBy: OK
  15470. 1336.54 s [vector] +++ OK, passed 100 tests.
  15471. 1336.54 s [vector] elem: OK
  15472. 1336.54 s [vector] +++ OK, passed 100 tests.
  15473. 1336.54 s [vector] notElem: OK
  15474. 1336.54 s [vector] +++ OK, passed 100 tests.
  15475. 1336.54 s [vector] find: OK
  15476. 1336.54 s [vector] +++ OK, passed 100 tests.
  15477. 1336.54 s [vector] findIndex: OK
  15478. 1336.54 s [vector] +++ OK, passed 100 tests.
  15479. 1336.54 s [vector] findIndexR: OK
  15480. 1336.55 s [vector] +++ OK, passed 100 tests.
  15481. 1336.55 s [vector] findIndices: OK
  15482. 1336.55 s [vector] +++ OK, passed 100 tests.
  15483. 1336.55 s [vector] elemIndex: OK
  15484. 1336.55 s [vector] +++ OK, passed 100 tests.
  15485. 1336.55 s [vector] elemIndices: OK
  15486. 1336.56 s [vector] +++ OK, passed 100 tests.
  15487. 1336.56 s [vector] foldl: OK
  15488. 1336.56 s [vector] +++ OK, passed 100 tests.
  15489. 1336.57 s [vector] foldl1: OK
  15490. 1336.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15491. 1336.57 s [vector] foldl': OK
  15492. 1336.57 s [vector] +++ OK, passed 100 tests.
  15493. 1336.57 s [vector] foldl1': OK
  15494. 1336.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15495. 1336.57 s [vector] foldr: OK
  15496. 1336.57 s [vector] +++ OK, passed 100 tests.
  15497. 1336.57 s [vector] foldr1: OK
  15498. 1336.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15499. 1336.57 s [vector] foldr': OK
  15500. 1336.58 s [vector] +++ OK, passed 100 tests.
  15501. 1336.58 s [vector] foldr1': OK
  15502. 1336.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15503. 1336.59 s [vector] ifoldl: OK
  15504. 1336.59 s [vector] +++ OK, passed 100 tests.
  15505. 1336.59 s [vector] ifoldl': OK
  15506. 1336.59 s [vector] +++ OK, passed 100 tests.
  15507. 1336.59 s [vector] ifoldr: OK
  15508. 1336.59 s [vector] +++ OK, passed 100 tests.
  15509. 1336.60 s [vector] ifoldr': OK
  15510. 1336.60 s [vector] +++ OK, passed 100 tests.
  15511. 1336.60 s [vector] ifoldM: OK
  15512. 1336.60 s [vector] +++ OK, passed 100 tests.
  15513. 1336.60 s [vector] ifoldM': OK
  15514. 1336.60 s [vector] +++ OK, passed 100 tests.
  15515. 1336.63 s [vector] ifoldM_: OK (0.03s)
  15516. 1336.63 s [vector] +++ OK, passed 100 tests.
  15517. 1336.66 s [vector] ifoldM'_: OK (0.03s)
  15518. 1336.66 s [vector] +++ OK, passed 100 tests.
  15519. 1336.66 s [vector] all: OK
  15520. 1336.66 s [vector] +++ OK, passed 100 tests.
  15521. 1336.66 s [vector] any: OK
  15522. 1336.66 s [vector] +++ OK, passed 100 tests.
  15523. 1336.66 s [vector] prescanl: OK
  15524. 1336.66 s [vector] +++ OK, passed 100 tests.
  15525. 1336.67 s [vector] prescanl': OK
  15526. 1336.67 s [vector] +++ OK, passed 100 tests.
  15527. 1336.67 s [vector] postscanl: OK
  15528. 1336.68 s [vector] +++ OK, passed 100 tests.
  15529. 1336.68 s [vector] postscanl': OK
  15530. 1336.68 s [vector] +++ OK, passed 100 tests.
  15531. 1336.68 s [vector] scanl: OK
  15532. 1336.68 s [vector] +++ OK, passed 100 tests.
  15533. 1336.69 s [vector] scanl': OK
  15534. 1336.69 s [vector] +++ OK, passed 100 tests.
  15535. 1336.69 s [vector] scanl1: OK
  15536. 1336.69 s [vector] +++ OK, passed 100 tests.
  15537. 1336.69 s [vector] scanl1': OK
  15538. 1336.69 s [vector] +++ OK, passed 100 tests.
  15539. 1336.70 s [vector] iscanl: OK
  15540. 1336.71 s [vector] +++ OK, passed 100 tests.
  15541. 1336.71 s [vector] iscanl': OK
  15542. 1336.72 s [vector] +++ OK, passed 100 tests.
  15543. 1336.73 s [vector] prescanr: OK
  15544. 1336.73 s [vector] +++ OK, passed 100 tests.
  15545. 1336.73 s [vector] prescanr': OK
  15546. 1336.73 s [vector] +++ OK, passed 100 tests.
  15547. 1336.73 s [vector] postscanr: OK
  15548. 1336.73 s [vector] +++ OK, passed 100 tests.
  15549. 1336.73 s [vector] postscanr': OK
  15550. 1336.73 s [vector] +++ OK, passed 100 tests.
  15551. 1336.74 s [vector] scanr: OK
  15552. 1336.75 s [vector] +++ OK, passed 100 tests.
  15553. 1336.75 s [vector] scanr': OK
  15554. 1336.75 s [vector] +++ OK, passed 100 tests.
  15555. 1336.75 s [vector] scanr1: OK
  15556. 1336.75 s [vector] +++ OK, passed 100 tests.
  15557. 1336.75 s [vector] scanr1': OK
  15558. 1336.75 s [vector] +++ OK, passed 100 tests.
  15559. 1336.75 s [vector] iscanr: OK
  15560. 1336.75 s [vector] +++ OK, passed 100 tests.
  15561. 1336.75 s [vector] iscanr': OK
  15562. 1336.75 s [vector] +++ OK, passed 100 tests.
  15563. 1336.75 s [vector] mut_read: OK
  15564. 1336.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15565. 1336.76 s [vector] mut_write: OK
  15566. 1336.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15567. 1336.76 s [vector] mut_modify: OK
  15568. 1336.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15569. 1336.77 s [vector] mut_generate: OK
  15570. 1336.77 s [vector] +++ OK, passed 100 tests.
  15571. 1336.79 s [vector] mut_generateM: OK (0.02s)
  15572. 1336.79 s [vector] +++ OK, passed 100 tests.
  15573. 1336.81 s [vector] mut_mapM_: OK (0.03s)
  15574. 1336.81 s [vector] +++ OK, passed 100 tests.
  15575. 1336.85 s [vector] mut_imapM_: OK (0.03s)
  15576. 1336.85 s [vector] +++ OK, passed 100 tests.
  15577. 1336.87 s [vector] mut_forM_: OK (0.03s)
  15578. 1336.87 s [vector] +++ OK, passed 100 tests.
  15579. 1336.90 s [vector] mut_iforM_: OK (0.03s)
  15580. 1336.90 s [vector] +++ OK, passed 100 tests.
  15581. 1336.90 s [vector] mut_foldr: OK
  15582. 1336.90 s [vector] +++ OK, passed 100 tests.
  15583. 1336.91 s [vector] mut_foldr': OK
  15584. 1336.91 s [vector] +++ OK, passed 100 tests.
  15585. 1336.91 s [vector] mut_foldl: OK (0.01s)
  15586. 1336.91 s [vector] +++ OK, passed 100 tests.
  15587. 1336.92 s [vector] mut_foldl': OK
  15588. 1336.92 s [vector] +++ OK, passed 100 tests.
  15589. 1336.93 s [vector] mut_ifoldr: OK
  15590. 1336.93 s [vector] +++ OK, passed 100 tests.
  15591. 1336.93 s [vector] mut_ifoldr': OK
  15592. 1336.93 s [vector] +++ OK, passed 100 tests.
  15593. 1336.94 s [vector] mut_ifoldl: OK
  15594. 1336.94 s [vector] +++ OK, passed 100 tests.
  15595. 1336.95 s [vector] mut_ifoldl': OK
  15596. 1336.95 s [vector] +++ OK, passed 100 tests.
  15597. 1336.96 s [vector] mut_foldM: OK
  15598. 1336.96 s [vector] +++ OK, passed 100 tests.
  15599. 1336.96 s [vector] mut_foldM': OK
  15600. 1336.96 s [vector] +++ OK, passed 100 tests.
  15601. 1336.96 s [vector] mut_foldrM: OK
  15602. 1336.97 s [vector] +++ OK, passed 100 tests.
  15603. 1336.97 s [vector] mut_foldrM': OK
  15604. 1336.97 s [vector] +++ OK, passed 100 tests.
  15605. 1336.97 s [vector] mut_ifoldM: OK
  15606. 1336.97 s [vector] +++ OK, passed 100 tests.
  15607. 1336.97 s [vector] mut_ifoldM': OK
  15608. 1336.97 s [vector] +++ OK, passed 100 tests.
  15609. 1336.97 s [vector] mut_ifoldrM: OK
  15610. 1336.97 s [vector] +++ OK, passed 100 tests.
  15611. 1336.97 s [vector] mut_ifoldrM': OK
  15612. 1336.97 s [vector] +++ OK, passed 100 tests.
  15613. 1336.97 s [vector] compare: OK
  15614. 1336.97 s [vector] +++ OK, passed 100 tests.
  15615. 1336.97 s [vector] maximum: OK
  15616. 1336.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15617. 1336.97 s [vector] minimum: OK
  15618. 1336.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15619. 1336.98 s [vector] minIndex: OK
  15620. 1336.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15621. 1336.98 s [vector] maxIndex: OK
  15622. 1336.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15623. 1336.98 s [vector] maximumBy: OK
  15624. 1336.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15625. 1336.98 s [vector] minimumBy: OK
  15626. 1336.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15627. 1336.99 s [vector] maximumOn: OK
  15628. 1336.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15629. 1336.99 s [vector] minimumOn: OK
  15630. 1336.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15631. 1336.99 s [vector] maxIndexBy: OK
  15632. 1336.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15633. 1336.99 s [vector] minIndexBy: OK
  15634. 1336.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15635. 1336.99 s [vector] ListFirstMaxIndexWins: OK
  15636. 1336.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15637. 1337.00 s [vector] FalseListFirstMaxIndexWins: OK
  15638. 1337.00 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  15639. 1337.00 s [vector] []
  15640. 1337.00 s [vector] zip: OK
  15641. 1337.00 s [vector] +++ OK, passed 100 tests.
  15642. 1337.00 s [vector] zip3: OK
  15643. 1337.00 s [vector] +++ OK, passed 100 tests.
  15644. 1337.00 s [vector] unzip: OK
  15645. 1337.00 s [vector] +++ OK, passed 100 tests.
  15646. 1337.00 s [vector] unzip3: OK
  15647. 1337.01 s [vector] +++ OK, passed 100 tests.
  15648. 1337.01 s [vector] indexed: OK
  15649. 1337.01 s [vector] +++ OK, passed 100 tests.
  15650. 1337.01 s [vector] update: OK
  15651. 1337.01 s [vector] +++ OK, passed 100 tests.
  15652. 1337.01 s [vector] mempty: OK
  15653. 1337.01 s [vector] +++ OK, passed 100 tests.
  15654. 1337.01 s [vector] mappend: OK
  15655. 1337.01 s [vector] +++ OK, passed 100 tests.
  15656. 1337.04 s [vector] mconcat: OK (0.05s)
  15657. 1337.04 s [vector] +++ OK, passed 100 tests.
  15658. 1337.04 s [vector] glength: OK
  15659. 1337.04 s [vector] +++ OK, passed 100 tests.
  15660. 1337.04 s [vector] (Int,Bool,Int)
  15661. 1337.04 s [vector] fromList.toList == id: OK
  15662. 1337.04 s [vector] +++ OK, passed 100 tests.
  15663. 1337.04 s [vector] toList.fromList == id: OK
  15664. 1337.04 s [vector] +++ OK, passed 100 tests.
  15665. 1337.04 s [vector] unstream.stream == id: OK
  15666. 1337.04 s [vector] +++ OK, passed 100 tests.
  15667. 1337.04 s [vector] stream.unstream == id: OK
  15668. 1337.04 s [vector] +++ OK, passed 100 tests.
  15669. 1337.04 s [vector] eq: OK
  15670. 1337.04 s [vector] +++ OK, passed 100 tests.
  15671. 1337.05 s [vector] length: OK
  15672. 1337.05 s [vector] +++ OK, passed 100 tests.
  15673. 1337.05 s [vector] null: OK
  15674. 1337.05 s [vector] +++ OK, passed 100 tests.
  15675. 1337.05 s [vector] index: OK
  15676. 1337.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15677. 1337.05 s [vector] safeIndex: OK
  15678. 1337.05 s [vector] +++ OK, passed 100 tests.
  15679. 1337.05 s [vector] head: OK
  15680. 1337.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15681. 1337.05 s [vector] last: OK
  15682. 1337.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15683. 1337.05 s [vector] unsafeIndex: OK
  15684. 1337.05 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15685. 1337.05 s [vector] unsafeHead: OK
  15686. 1337.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15687. 1337.06 s [vector] unsafeLast: OK
  15688. 1337.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15689. 1337.06 s [vector] slice: OK
  15690. 1337.06 s [vector] +++ OK, passed 100 tests.
  15691. 1337.06 s [vector] init: OK
  15692. 1337.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15693. 1337.06 s [vector] tail: OK
  15694. 1337.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15695. 1337.06 s [vector] take: OK
  15696. 1337.06 s [vector] +++ OK, passed 100 tests.
  15697. 1337.07 s [vector] drop: OK
  15698. 1337.07 s [vector] +++ OK, passed 100 tests.
  15699. 1337.07 s [vector] splitAt: OK
  15700. 1337.07 s [vector] +++ OK, passed 100 tests.
  15701. 1337.07 s [vector] empty: OK
  15702. 1337.07 s [vector] +++ OK, passed 100 tests.
  15703. 1337.07 s [vector] singleton: OK
  15704. 1337.07 s [vector] +++ OK, passed 100 tests.
  15705. 1337.07 s [vector] replicate: OK
  15706. 1337.07 s [vector] +++ OK, passed 100 tests.
  15707. 1337.07 s [vector] generate: OK
  15708. 1337.07 s [vector] +++ OK, passed 100 tests.
  15709. 1337.09 s [vector] iterateN: OK
  15710. 1337.09 s [vector] +++ OK, passed 100 tests.
  15711. 1337.11 s [vector] iterateNM: OK (0.02s)
  15712. 1337.11 s [vector] +++ OK, passed 100 tests.
  15713. 1337.11 s [vector] generateM: OK (0.01s)
  15714. 1337.11 s [vector] +++ OK, passed 100 tests.
  15715. 1337.12 s [vector] replicateM: OK
  15716. 1337.12 s [vector] +++ OK, passed 100 tests.
  15717. 1337.12 s [vector] create: OK
  15718. 1337.13 s [vector] +++ OK, passed 100 tests.
  15719. 1337.13 s [vector] createT: OK
  15720. 1337.13 s [vector] +++ OK, passed 100 tests.
  15721. 1337.13 s [vector] unfoldr: OK
  15722. 1337.14 s [vector] +++ OK, passed 100 tests.
  15723. 1337.14 s [vector] unfoldrN: OK
  15724. 1337.14 s [vector] +++ OK, passed 100 tests.
  15725. 1337.14 s [vector] unfoldrExactN: OK
  15726. 1337.14 s [vector] +++ OK, passed 100 tests.
  15727. 1337.15 s [vector] unfoldrM: OK
  15728. 1337.15 s [vector] +++ OK, passed 100 tests.
  15729. 1337.15 s [vector] unfoldrNM: OK
  15730. 1337.15 s [vector] +++ OK, passed 100 tests.
  15731. 1337.17 s [vector] unfoldrExactNM: OK (0.01s)
  15732. 1337.17 s [vector] +++ OK, passed 100 tests.
  15733. 1337.17 s [vector] constructN: OK
  15734. 1337.17 s [vector] +++ OK, passed 100 tests.
  15735. 1337.18 s [vector] constructrN: OK
  15736. 1337.18 s [vector] +++ OK, passed 100 tests.
  15737. 1337.19 s [vector] cons: OK
  15738. 1337.19 s [vector] +++ OK, passed 100 tests.
  15739. 1337.19 s [vector] snoc: OK
  15740. 1337.19 s [vector] +++ OK, passed 100 tests.
  15741. 1337.21 s [vector] append: OK
  15742. 1337.21 s [vector] +++ OK, passed 100 tests.
  15743. 1337.26 s [vector] concat: OK (0.06s)
  15744. 1337.26 s [vector] +++ OK, passed 100 tests.
  15745. 1337.26 s [vector] force: OK
  15746. 1337.26 s [vector] +++ OK, passed 100 tests.
  15747. 1337.26 s [vector] upd: OK
  15748. 1337.26 s [vector] +++ OK, passed 100 tests.
  15749. 1337.27 s [vector] accum: OK
  15750. 1337.27 s [vector] +++ OK, passed 100 tests.
  15751. 1337.27 s [vector] reverse: OK
  15752. 1337.28 s [vector] +++ OK, passed 100 tests.
  15753. 1337.28 s [vector] backpermute: OK
  15754. 1337.29 s [vector] +++ OK, passed 100 tests.
  15755. 1337.29 s [vector] map: OK
  15756. 1337.29 s [vector] +++ OK, passed 100 tests.
  15757. 1337.29 s [vector] imap: OK
  15758. 1337.29 s [vector] +++ OK, passed 100 tests.
  15759. 1337.30 s [vector] concatMap: OK
  15760. 1337.30 s [vector] +++ OK, passed 100 tests.
  15761. 1337.30 s [vector] mapM: OK
  15762. 1337.30 s [vector] +++ OK, passed 100 tests.
  15763. 1337.35 s [vector] mapM_: OK (0.04s)
  15764. 1337.35 s [vector] +++ OK, passed 100 tests.
  15765. 1337.35 s [vector] forM: OK
  15766. 1337.35 s [vector] +++ OK, passed 100 tests.
  15767. 1337.40 s [vector] forM_: OK (0.05s)
  15768. 1337.41 s [vector] +++ OK, passed 100 tests.
  15769. 1337.41 s [vector] imapM: OK
  15770. 1337.41 s [vector] +++ OK, passed 100 tests.
  15771. 1337.46 s [vector] imapM_: OK (0.05s)
  15772. 1337.47 s [vector] +++ OK, passed 100 tests.
  15773. 1337.47 s [vector] zipWith: OK
  15774. 1337.48 s [vector] +++ OK, passed 100 tests.
  15775. 1337.48 s [vector] zipWith3: OK
  15776. 1337.48 s [vector] +++ OK, passed 100 tests.
  15777. 1337.48 s [vector] izipWith: OK
  15778. 1337.48 s [vector] +++ OK, passed 100 tests.
  15779. 1337.49 s [vector] izipWith3: OK
  15780. 1337.49 s [vector] +++ OK, passed 100 tests.
  15781. 1337.51 s [vector] izipWithM: OK (0.01s)
  15782. 1337.51 s [vector] +++ OK, passed 100 tests.
  15783. 1337.52 s [vector] izipWithM_: OK (0.03s)
  15784. 1337.52 s [vector] +++ OK, passed 100 tests.
  15785. 1337.53 s [vector] zipWithM: OK
  15786. 1337.53 s [vector] +++ OK, passed 100 tests.
  15787. 1337.56 s [vector] zipWithM_: OK (0.03s)
  15788. 1337.56 s [vector] +++ OK, passed 100 tests.
  15789. 1337.57 s [vector] filter: OK
  15790. 1337.57 s [vector] +++ OK, passed 100 tests.
  15791. 1337.57 s [vector] ifilter: OK
  15792. 1337.57 s [vector] +++ OK, passed 100 tests.
  15793. 1337.62 s [vector] filterM: OK (0.05s)
  15794. 1337.63 s [vector] +++ OK, passed 100 tests.
  15795. 1337.63 s [vector] uniq: OK
  15796. 1337.64 s [vector] +++ OK, passed 100 tests.
  15797. 1337.64 s [vector] mapMaybe: OK
  15798. 1337.64 s [vector] +++ OK, passed 100 tests.
  15799. 1337.64 s [vector] imapMaybe: OK
  15800. 1337.64 s [vector] +++ OK, passed 100 tests.
  15801. 1337.65 s [vector] takeWhile: OK
  15802. 1337.65 s [vector] +++ OK, passed 100 tests.
  15803. 1337.65 s [vector] dropWhile: OK
  15804. 1337.65 s [vector] +++ OK, passed 100 tests.
  15805. 1337.65 s [vector] partition: OK
  15806. 1337.65 s [vector] +++ OK, passed 100 tests.
  15807. 1337.65 s [vector] partitionWith: OK
  15808. 1337.65 s [vector] +++ OK, passed 100 tests.
  15809. 1337.66 s [vector] span: OK
  15810. 1337.66 s [vector] +++ OK, passed 100 tests.
  15811. 1337.66 s [vector] break: OK
  15812. 1337.66 s [vector] +++ OK, passed 100 tests.
  15813. 1337.66 s [vector] spanR: OK
  15814. 1337.66 s [vector] +++ OK, passed 100 tests.
  15815. 1337.67 s [vector] breakR: OK
  15816. 1337.67 s [vector] +++ OK, passed 100 tests.
  15817. 1337.67 s [vector] groupBy: OK
  15818. 1337.67 s [vector] +++ OK, passed 100 tests.
  15819. 1337.67 s [vector] elem: OK
  15820. 1337.67 s [vector] +++ OK, passed 100 tests.
  15821. 1337.67 s [vector] notElem: OK
  15822. 1337.68 s [vector] +++ OK, passed 100 tests.
  15823. 1337.68 s [vector] find: OK
  15824. 1337.68 s [vector] +++ OK, passed 100 tests.
  15825. 1337.68 s [vector] findIndex: OK
  15826. 1337.69 s [vector] +++ OK, passed 100 tests.
  15827. 1337.69 s [vector] findIndexR: OK
  15828. 1337.69 s [vector] +++ OK, passed 100 tests.
  15829. 1337.69 s [vector] findIndices: OK
  15830. 1337.69 s [vector] +++ OK, passed 100 tests.
  15831. 1337.69 s [vector] elemIndex: OK
  15832. 1337.69 s [vector] +++ OK, passed 100 tests.
  15833. 1337.69 s [vector] elemIndices: OK
  15834. 1337.69 s [vector] +++ OK, passed 100 tests.
  15835. 1337.70 s [vector] foldl: OK
  15836. 1337.71 s [vector] +++ OK, passed 100 tests.
  15837. 1337.71 s [vector] foldl1: OK
  15838. 1337.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15839. 1337.71 s [vector] foldl': OK
  15840. 1337.71 s [vector] +++ OK, passed 100 tests.
  15841. 1337.72 s [vector] foldl1': OK
  15842. 1337.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15843. 1337.73 s [vector] foldr: OK
  15844. 1337.73 s [vector] +++ OK, passed 100 tests.
  15845. 1337.74 s [vector] foldr1: OK
  15846. 1337.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15847. 1337.75 s [vector] foldr': OK
  15848. 1337.76 s [vector] +++ OK, passed 100 tests.
  15849. 1337.77 s [vector] foldr1': OK
  15850. 1337.77 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15851. 1337.77 s [vector] ifoldl: OK
  15852. 1337.77 s [vector] +++ OK, passed 100 tests.
  15853. 1337.77 s [vector] ifoldl': OK
  15854. 1337.77 s [vector] +++ OK, passed 100 tests.
  15855. 1337.79 s [vector] ifoldr: OK (0.01s)
  15856. 1337.79 s [vector] +++ OK, passed 100 tests.
  15857. 1337.80 s [vector] ifoldr': OK
  15858. 1337.80 s [vector] +++ OK, passed 100 tests.
  15859. 1337.80 s [vector] ifoldM: OK
  15860. 1337.80 s [vector] +++ OK, passed 100 tests.
  15861. 1337.81 s [vector] ifoldM': OK (0.01s)
  15862. 1337.81 s [vector] +++ OK, passed 100 tests.
  15863. 1337.86 s [vector] ifoldM_: OK (0.06s)
  15864. 1337.86 s [vector] +++ OK, passed 100 tests.
  15865. 1337.91 s [vector] ifoldM'_: OK (0.03s)
  15866. 1337.91 s [vector] +++ OK, passed 100 tests.
  15867. 1337.91 s [vector] all: OK
  15868. 1337.91 s [vector] +++ OK, passed 100 tests.
  15869. 1337.91 s [vector] any: OK
  15870. 1337.91 s [vector] +++ OK, passed 100 tests.
  15871. 1337.92 s [vector] prescanl: OK
  15872. 1337.92 s [vector] +++ OK, passed 100 tests.
  15873. 1337.93 s [vector] prescanl': OK (0.01s)
  15874. 1337.93 s [vector] +++ OK, passed 100 tests.
  15875. 1337.95 s [vector] postscanl: OK (0.01s)
  15876. 1337.95 s [vector] +++ OK, passed 100 tests.
  15877. 1337.95 s [vector] postscanl': OK (0.01s)
  15878. 1337.95 s [vector] +++ OK, passed 100 tests.
  15879. 1337.97 s [vector] scanl: OK (0.01s)
  15880. 1337.97 s [vector] +++ OK, passed 100 tests.
  15881. 1337.97 s [vector] scanl': OK
  15882. 1337.98 s [vector] +++ OK, passed 100 tests.
  15883. 1337.99 s [vector] scanl1: OK
  15884. 1337.99 s [vector] +++ OK, passed 100 tests.
  15885. 1337.99 s [vector] scanl1': OK
  15886. 1338.00 s [vector] +++ OK, passed 100 tests.
  15887. 1338.00 s [vector] iscanl: OK
  15888. 1338.00 s [vector] +++ OK, passed 100 tests.
  15889. 1338.00 s [vector] iscanl': OK
  15890. 1338.00 s [vector] +++ OK, passed 100 tests.
  15891. 1338.00 s [vector] prescanr: OK
  15892. 1338.00 s [vector] +++ OK, passed 100 tests.
  15893. 1338.01 s [vector] prescanr': OK
  15894. 1338.01 s [vector] +++ OK, passed 100 tests.
  15895. 1338.02 s [vector] postscanr: OK
  15896. 1338.02 s [vector] +++ OK, passed 100 tests.
  15897. 1338.03 s [vector] postscanr': OK
  15898. 1338.03 s [vector] +++ OK, passed 100 tests.
  15899. 1338.03 s [vector] scanr: OK
  15900. 1338.03 s [vector] +++ OK, passed 100 tests.
  15901. 1338.04 s [vector] scanr': OK
  15902. 1338.04 s [vector] +++ OK, passed 100 tests.
  15903. 1338.05 s [vector] scanr1: OK
  15904. 1338.05 s [vector] +++ OK, passed 100 tests.
  15905. 1338.05 s [vector] scanr1': OK
  15906. 1338.05 s [vector] +++ OK, passed 100 tests.
  15907. 1338.06 s [vector] iscanr: OK
  15908. 1338.06 s [vector] +++ OK, passed 100 tests.
  15909. 1338.07 s [vector] iscanr': OK
  15910. 1338.07 s [vector] +++ OK, passed 100 tests.
  15911. 1338.07 s [vector] mut_read: OK
  15912. 1338.07 s [vector] +++ OK, passed 100 tests; 24 discarded.
  15913. 1338.07 s [vector] mut_write: OK
  15914. 1338.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15915. 1338.07 s [vector] mut_modify: OK
  15916. 1338.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15917. 1338.07 s [vector] mut_generate: OK
  15918. 1338.07 s [vector] +++ OK, passed 100 tests.
  15919. 1338.11 s [vector] mut_generateM: OK (0.02s)
  15920. 1338.11 s [vector] +++ OK, passed 100 tests.
  15921. 1338.17 s [vector] mut_mapM_: OK (0.07s)
  15922. 1338.17 s [vector] +++ OK, passed 100 tests.
  15923. 1338.21 s [vector] mut_imapM_: OK (0.04s)
  15924. 1338.21 s [vector] +++ OK, passed 100 tests.
  15925. 1338.25 s [vector] mut_forM_: OK (0.04s)
  15926. 1338.25 s [vector] +++ OK, passed 100 tests.
  15927. 1338.29 s [vector] mut_iforM_: OK (0.04s)
  15928. 1338.29 s [vector] +++ OK, passed 100 tests.
  15929. 1338.30 s [vector] mut_foldr: OK
  15930. 1338.31 s [vector] +++ OK, passed 100 tests.
  15931. 1338.32 s [vector] mut_foldr': OK
  15932. 1338.32 s [vector] +++ OK, passed 100 tests.
  15933. 1338.32 s [vector] mut_foldl: OK
  15934. 1338.32 s [vector] +++ OK, passed 100 tests.
  15935. 1338.32 s [vector] mut_foldl': OK (0.01s)
  15936. 1338.33 s [vector] +++ OK, passed 100 tests.
  15937. 1338.33 s [vector] mut_ifoldr: OK
  15938. 1338.33 s [vector] +++ OK, passed 100 tests.
  15939. 1338.33 s [vector] mut_ifoldr': OK
  15940. 1338.33 s [vector] +++ OK, passed 100 tests.
  15941. 1338.34 s [vector] mut_ifoldl: OK
  15942. 1338.34 s [vector] +++ OK, passed 100 tests.
  15943. 1338.35 s [vector] mut_ifoldl': OK
  15944. 1338.35 s [vector] +++ OK, passed 100 tests.
  15945. 1338.35 s [vector] mut_foldM: OK
  15946. 1338.36 s [vector] +++ OK, passed 100 tests.
  15947. 1338.36 s [vector] mut_foldM': OK
  15948. 1338.37 s [vector] +++ OK, passed 100 tests.
  15949. 1338.37 s [vector] mut_foldrM: OK
  15950. 1338.37 s [vector] +++ OK, passed 100 tests.
  15951. 1338.38 s [vector] mut_foldrM': OK
  15952. 1338.39 s [vector] +++ OK, passed 100 tests.
  15953. 1338.39 s [vector] mut_ifoldM: OK
  15954. 1338.39 s [vector] +++ OK, passed 100 tests.
  15955. 1338.39 s [vector] mut_ifoldM': OK
  15956. 1338.39 s [vector] +++ OK, passed 100 tests.
  15957. 1338.39 s [vector] mut_ifoldrM: OK
  15958. 1338.39 s [vector] +++ OK, passed 100 tests.
  15959. 1338.40 s [vector] mut_ifoldrM': OK (0.01s)
  15960. 1338.40 s [vector] +++ OK, passed 100 tests.
  15961. 1338.40 s [vector] compare: OK
  15962. 1338.40 s [vector] +++ OK, passed 100 tests.
  15963. 1338.40 s [vector] maximum: OK
  15964. 1338.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15965. 1338.40 s [vector] minimum: OK
  15966. 1338.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15967. 1338.41 s [vector] minIndex: OK
  15968. 1338.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15969. 1338.41 s [vector] maxIndex: OK
  15970. 1338.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15971. 1338.41 s [vector] maximumBy: OK
  15972. 1338.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15973. 1338.41 s [vector] minimumBy: OK
  15974. 1338.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15975. 1338.42 s [vector] maximumOn: OK
  15976. 1338.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15977. 1338.42 s [vector] minimumOn: OK
  15978. 1338.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15979. 1338.42 s [vector] maxIndexBy: OK
  15980. 1338.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15981. 1338.42 s [vector] minIndexBy: OK
  15982. 1338.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15983. 1338.42 s [vector] ListFirstMaxIndexWins: OK
  15984. 1338.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15985. 1338.43 s [vector] FalseListFirstMaxIndexWins: OK
  15986. 1338.43 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  15987. 1338.43 s [vector] []
  15988. 1338.43 s [vector] zip: OK
  15989. 1338.43 s [vector] +++ OK, passed 100 tests.
  15990. 1338.43 s [vector] zip3: OK
  15991. 1338.43 s [vector] +++ OK, passed 100 tests.
  15992. 1338.45 s [vector] unzip: OK
  15993. 1338.45 s [vector] +++ OK, passed 100 tests.
  15994. 1338.45 s [vector] unzip3: OK
  15995. 1338.45 s [vector] +++ OK, passed 100 tests.
  15996. 1338.45 s [vector] indexed: OK
  15997. 1338.45 s [vector] +++ OK, passed 100 tests.
  15998. 1338.46 s [vector] update: OK
  15999. 1338.46 s [vector] +++ OK, passed 100 tests.
  16000. 1338.46 s [vector] mempty: OK
  16001. 1338.46 s [vector] +++ OK, passed 100 tests.
  16002. 1338.46 s [vector] mappend: OK
  16003. 1338.47 s [vector] +++ OK, passed 100 tests.
  16004. 1338.54 s [vector] mconcat: OK (0.07s)
  16005. 1338.54 s [vector] +++ OK, passed 100 tests.
  16006. 1338.54 s [vector] glength: OK
  16007. 1338.54 s [vector] +++ OK, passed 100 tests.
  16008. 1338.54 s [vector] unstream
  16009. 1338.54 s [vector] unstream == vunstream (exact): OK
  16010. 1338.54 s [vector] +++ OK, passed 100 tests.
  16011. 1338.54 s [vector] unstream == vunstream (unknown): OK
  16012. 1338.54 s [vector] +++ OK, passed 100 tests.
  16013. 1338.54 s [vector] unstreamR ~= vunstream (exact): OK
  16014. 1338.54 s [vector] +++ OK, passed 100 tests.
  16015. 1338.54 s [vector] unstreamR ~= vunstream (unknown): OK
  16016. 1338.54 s [vector] +++ OK, passed 100 tests.
  16017. 1338.54 s [vector] Data.Vector.Storable.Vector Alignment
  16018. 1338.54 s [vector] Aligned Double: OK
  16019. 1338.54 s [vector] Aligned Int: OK
  16020. 1338.54 s [vector] Regression tests
  16021. 1338.54 s [vector] enumFromTo crash #188
  16022. 1338.54 s [vector] Word8: OK
  16023. 1338.54 s [vector] Word16: OK
  16024. 1338.54 s [vector] Word32: OK
  16025. 1338.54 s [vector] Word64: OK
  16026. 1338.54 s [vector] Word: OK
  16027. 1338.54 s [vector] Int8: OK
  16028. 1338.54 s [vector] Int16: OK
  16029. 1338.54 s [vector] Int32: OK
  16030. 1338.54 s [vector] Int64: OK
  16031. 1338.54 s [vector] Int: OK
  16032. 1338.54 s [vector] Char: OK
  16033. 1338.54 s [vector] Negative tests
  16034. 1338.54 s [vector] slice out of bounds #257
  16035. 1338.54 s [vector] Boxed
  16036. 1338.54 s [vector] Negative ix: OK
  16037. 1338.54 s [vector] Negative size: OK
  16038. 1338.54 s [vector] Negative ix and size: OK
  16039. 1338.54 s [vector] Too large ix: OK
  16040. 1338.54 s [vector] Too large size: OK
  16041. 1338.54 s [vector] Too large ix and size: OK
  16042. 1338.54 s [vector] Overflow: OK
  16043. 1338.54 s [vector] OutOfMemory: OK
  16044. 1338.54 s [vector] Primitive
  16045. 1338.54 s [vector] Negative ix: OK
  16046. 1338.54 s [vector] Negative size: OK
  16047. 1338.54 s [vector] Negative ix and size: OK
  16048. 1338.54 s [vector] Too large ix: OK
  16049. 1338.54 s [vector] Too large size: OK
  16050. 1338.54 s [vector] Too large ix and size: OK
  16051. 1338.54 s [vector] Overflow: OK
  16052. 1338.54 s [vector] OutOfMemory: OK
  16053. 1338.54 s [vector] Storable
  16054. 1338.54 s [vector] Negative ix: OK
  16055. 1338.54 s [vector] Negative size: OK
  16056. 1338.54 s [vector] Negative ix and size: OK
  16057. 1338.54 s [vector] Too large ix: OK
  16058. 1338.54 s [vector] Too large size: OK
  16059. 1338.54 s [vector] Too large ix and size: OK
  16060. 1338.54 s [vector] Overflow: OK
  16061. 1338.54 s [vector] OutOfMemory: OK
  16062. 1338.54 s [vector] Unboxed
  16063. 1338.54 s [vector] Negative ix: OK
  16064. 1338.54 s [vector] Negative size: OK
  16065. 1338.54 s [vector] Negative ix and size: OK
  16066. 1338.54 s [vector] Too large ix: OK
  16067. 1338.54 s [vector] Too large size: OK
  16068. 1338.54 s [vector] Too large ix and size: OK
  16069. 1338.54 s [vector] Overflow: OK
  16070. 1338.54 s [vector] OutOfMemory: OK
  16071. 1338.54 s [vector] take #282
  16072. 1338.54 s [vector] Boxed: OK
  16073. 1338.54 s [vector] Primitive: OK
  16074. 1338.54 s [vector] Storable: OK
  16075. 1338.54 s [vector] Unboxed: OK
  16076. 1338.54 s [vector] Data.Vector
  16077. 1338.54 s [vector] MonadFix: OK
  16078. 1338.54 s [vector] toFromArray: OK
  16079. 1338.54 s [vector] toFromArraySlice: OK
  16080. 1338.54 s [vector] toFromArraySliceUnsafe: OK
  16081. 1338.55 s [vector] toFromMutableArray: OK
  16082. 1338.55 s [vector] Data.Vector.Mutable (Move): OK
  16083. 1338.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16084. 1338.55 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  16085. 1338.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16086. 1338.55 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  16087. 1338.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16088. 1338.55 s [vector] Data.Vector.Storable.Mutable (Move): OK
  16089. 1338.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16090. 1338.56 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  16091. 1338.57 s [vector] +++ OK, passed 100 tests.
  16092. 1338.57 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  16093. 1338.57 s [vector] +++ OK, passed 100 tests.
  16094. 1338.57 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  16095. 1338.57 s [vector] +++ OK, passed 100 tests.
  16096. 1338.57 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  16097. 1338.57 s [vector] +++ OK, passed 100 tests.
  16098. 1338.57 s [vector]
  16099. 1338.57 s [vector] All 2808 tests passed (15.17s)
  16100. 1338.58 s [vector] Test suite vector-tests-O2: PASS
  16101. 1338.58 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  16102. 1338.58 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  16103. 1338.59 s [vector] checkPhase completed in 34 seconds
  16104. 1338.59 s [vector] Phase: haddockPhase
  16105. 1338.60 s [vector] Phase: installPhase
  16106. 1338.70 s [vector] Installing library in /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  16107. 1339.53 s [vector] Installing internal library benchmarks-O2 in /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/vector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2
  16108. 1339.92 s [vector] Phase: fixupPhase
  16109. 1339.94 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0
  16110. 1339.96 s [vector] shrinking /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSvector-0.13.2.0-DzpOK4ifEbzFlV8SWoFR6G-benchmarks-O2-ghc9.12.2.so
  16111. 1339.97 s [vector] shrinking /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSvector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL-ghc9.12.2.so
  16112. 1340.00 s [vector] checking for references to /build/ in /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0...
  16113. 1340.05 s [vector] patching script interpreter paths in /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0
  16114. 1340.24 s [vector] stripping (with command strip and flags -S -p) in /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0/lib
  16115. 1341.08 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0
  16116. 1341.54 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  16117. 1341.57 s [post-build-hook] Uploading to the NixCI cache: /nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0
  16118. 1341.63 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16119. 1341.66 s [post-build-hook] copying 1 paths...
  16120. 1341.66 s [post-build-hook] copying path '/nix/store/bdbgyswndgalwjbindg52hhyywkqng6g-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  16121. 1358.91 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16122. 1359.06 s [post-build-hook] copying 0 paths...
  16123. 1359.09 s Progress: 9 of 19 built, 165 of 165 downloaded from cache
  16124. 1359.16 s Building nothunks
  16125. 1359.32 s [nothunks] Phase: setupCompilerEnvironmentPhase
  16126. 1359.33 s [nothunks] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  16127. 1359.67 s [nothunks] Phase: unpackPhase
  16128. 1359.67 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  16129. 1359.68 s [nothunks] source root is nothunks-0.3.1
  16130. 1359.69 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  16131. 1359.69 s [nothunks] Phase: patchPhase
  16132. 1359.81 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  16133. 1359.88 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  16134. 1359.97 s [nothunks] Phase: compileBuildDriverPhase
  16135. 1359.98 s [nothunks] setupCompileFlags: -package-db=/build/tmp.ca1rkqcoZs/setup-package.conf.d -threaded
  16136. 1360.09 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.ca1rkqcoZs/Main.o )
  16137. 1360.24 s [nothunks] [2 of 2] Linking Setup
  16138. 1362.34 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  16139. 1362.36 s [nothunks] Phase: configurePhase
  16140. 1362.36 s [nothunks] configureFlags: --verbose --prefix=/nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/gm0c2jixd4lvjf11j328l7ql0a10ingq-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.ca1rkqcoZs/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  16141. 1362.37 s [nothunks] Using Parsec parser
  16142. 1362.37 s [nothunks] Configuring nothunks-0.3.1...
  16143. 1362.43 s [nothunks] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  16144. 1362.43 s [nothunks] 'ghc' version < 9.12):
  16145. 1362.43 s [nothunks] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  16146. 1362.43 s [nothunks] 9.12.2
  16147. 1362.88 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  16148. 1363.33 s [nothunks] Dependency base: using base-4.21.0.0
  16149. 1363.33 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  16150. 1363.33 s [nothunks] Dependency containers: using containers-0.7
  16151. 1363.33 s [nothunks] Dependency ghc-heap: using ghc-heap-9.12.2
  16152. 1363.33 s [nothunks] Dependency stm: using stm-2.5.3.1
  16153. 1363.33 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.2
  16154. 1363.33 s [nothunks] Dependency time: using time-1.14
  16155. 1363.33 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  16156. 1363.33 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  16157. 1363.34 s [nothunks] Dependency base: using base-4.21.0.0
  16158. 1363.34 s [nothunks] Dependency containers: using containers-0.7
  16159. 1363.34 s [nothunks] Dependency ghc-prim: using ghc-prim-0.13.0
  16160. 1363.34 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  16161. 1363.34 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  16162. 1363.34 s [nothunks] Dependency random: using random-1.2.1.3
  16163. 1363.34 s [nothunks] Dependency stm: using stm-2.5.3.1
  16164. 1363.34 s [nothunks] Dependency tasty: using tasty-1.5.3
  16165. 1363.34 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  16166. 1363.34 s [nothunks] Source component graph:
  16167. 1363.34 s [nothunks] component lib
  16168. 1363.34 s [nothunks] component test:nothunks-test dependency lib
  16169. 1363.34 s [nothunks] Configured component graph:
  16170. 1363.34 s [nothunks] component nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16171. 1363.34 s [nothunks] include base-4.21.0.0-d2ce
  16172. 1363.34 s [nothunks] include bytestring-0.12.2.0-19c8
  16173. 1363.34 s [nothunks] include containers-0.7-0a77
  16174. 1363.34 s [nothunks] include ghc-heap-9.12.2-1f40
  16175. 1363.34 s [nothunks] include stm-2.5.3.1-1759
  16176. 1363.34 s [nothunks] include text-2.1.2-783a
  16177. 1363.34 s [nothunks] include time-1.14-6b73
  16178. 1363.34 s [nothunks] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  16179. 1363.34 s [nothunks] include wherefrom-compat-0.1.1.1-2OttYUI1pBZ9hyqzOoJaAI
  16180. 1363.34 s [nothunks] component nothunks-0.3.1-BuL8XlBvYON82grlnVQnRB-nothunks-test
  16181. 1363.34 s [nothunks] include base-4.21.0.0-d2ce
  16182. 1363.34 s [nothunks] include containers-0.7-0a77
  16183. 1363.34 s [nothunks] include ghc-prim-0.13.0-bc01
  16184. 1363.34 s [nothunks] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  16185. 1363.34 s [nothunks] include nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16186. 1363.34 s [nothunks] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  16187. 1363.34 s [nothunks] include stm-2.5.3.1-1759
  16188. 1363.34 s [nothunks] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  16189. 1363.34 s [nothunks] include tasty-hedgehog-1.4.0.2-7ZX9tbH8inHJt1NDEWo275
  16190. 1363.34 s [nothunks] Linked component graph:
  16191. 1363.34 s [nothunks] unit nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16192. 1363.34 s [nothunks] include base-4.21.0.0-d2ce
  16193. 1363.34 s [nothunks] include bytestring-0.12.2.0-19c8
  16194. 1363.34 s [nothunks] include containers-0.7-0a77
  16195. 1363.34 s [nothunks] include ghc-heap-9.12.2-1f40
  16196. 1363.34 s [nothunks] include stm-2.5.3.1-1759
  16197. 1363.34 s [nothunks] include text-2.1.2-783a
  16198. 1363.34 s [nothunks] include time-1.14-6b73
  16199. 1363.34 s [nothunks] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  16200. 1363.34 s [nothunks] include wherefrom-compat-0.1.1.1-2OttYUI1pBZ9hyqzOoJaAI
  16201. 1363.34 s [nothunks] NoThunks.Class=nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t:NoThunks.Class
  16202. 1363.34 s [nothunks] unit nothunks-0.3.1-BuL8XlBvYON82grlnVQnRB-nothunks-test
  16203. 1363.34 s [nothunks] include base-4.21.0.0-d2ce
  16204. 1363.34 s [nothunks] include containers-0.7-0a77
  16205. 1363.34 s [nothunks] include ghc-prim-0.13.0-bc01
  16206. 1363.34 s [nothunks] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  16207. 1363.34 s [nothunks] include nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16208. 1363.34 s [nothunks] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  16209. 1363.34 s [nothunks] include stm-2.5.3.1-1759
  16210. 1363.34 s [nothunks] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  16211. 1363.34 s [nothunks] include tasty-hedgehog-1.4.0.2-7ZX9tbH8inHJt1NDEWo275
  16212. 1363.34 s [nothunks] Ready component graph:
  16213. 1363.34 s [nothunks] definite nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16214. 1363.34 s [nothunks] depends base-4.21.0.0-d2ce
  16215. 1363.34 s [nothunks] depends bytestring-0.12.2.0-19c8
  16216. 1363.34 s [nothunks] depends containers-0.7-0a77
  16217. 1363.34 s [nothunks] depends ghc-heap-9.12.2-1f40
  16218. 1363.34 s [nothunks] depends stm-2.5.3.1-1759
  16219. 1363.34 s [nothunks] depends text-2.1.2-783a
  16220. 1363.34 s [nothunks] depends time-1.14-6b73
  16221. 1363.34 s [nothunks] depends vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  16222. 1363.34 s [nothunks] depends wherefrom-compat-0.1.1.1-2OttYUI1pBZ9hyqzOoJaAI
  16223. 1363.34 s [nothunks] definite nothunks-0.3.1-BuL8XlBvYON82grlnVQnRB-nothunks-test
  16224. 1363.34 s [nothunks] depends base-4.21.0.0-d2ce
  16225. 1363.34 s [nothunks] depends containers-0.7-0a77
  16226. 1363.34 s [nothunks] depends ghc-prim-0.13.0-bc01
  16227. 1363.34 s [nothunks] depends hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  16228. 1363.34 s [nothunks] depends nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16229. 1363.34 s [nothunks] depends random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  16230. 1363.34 s [nothunks] depends stm-2.5.3.1-1759
  16231. 1363.34 s [nothunks] depends tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  16232. 1363.34 s [nothunks] depends tasty-hedgehog-1.4.0.2-7ZX9tbH8inHJt1NDEWo275
  16233. 1363.34 s [nothunks] Using Cabal-3.14.1.0 compiled by ghc-9.12
  16234. 1363.34 s [nothunks] Using compiler: ghc-9.12.2
  16235. 1363.34 s [nothunks] Using install prefix:
  16236. 1363.34 s [nothunks] /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1
  16237. 1363.34 s [nothunks] Executables installed in:
  16238. 1363.34 s [nothunks] /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/bin
  16239. 1363.34 s [nothunks] Libraries installed in:
  16240. 1363.34 s [nothunks] /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16241. 1363.34 s [nothunks] Dynamic Libraries installed in:
  16242. 1363.34 s [nothunks] /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  16243. 1363.34 s [nothunks] Private executables installed in:
  16244. 1363.34 s [nothunks] /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.12.2-e4b2/nothunks-0.3.1
  16245. 1363.34 s [nothunks] Data files installed in:
  16246. 1363.34 s [nothunks] /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/share/x86_64-linux-ghc-9.12.2-e4b2/nothunks-0.3.1
  16247. 1363.34 s [nothunks] Documentation installed in:
  16248. 1363.34 s [nothunks] /nix/store/gm0c2jixd4lvjf11j328l7ql0a10ingq-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  16249. 1363.34 s [nothunks] Configuration files installed in:
  16250. 1363.34 s [nothunks] /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/etc
  16251. 1363.34 s [nothunks] No alex found
  16252. 1363.34 s [nothunks] Using ar found on system at:
  16253. 1363.34 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16254. 1363.34 s [nothunks] No c2hs found
  16255. 1363.34 s [nothunks] No cpphs found
  16256. 1363.34 s [nothunks] No doctest found
  16257. 1363.34 s [nothunks] Using gcc version 14.3.0 given by user at:
  16258. 1363.34 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16259. 1363.34 s [nothunks] Using ghc version 9.12.2 found on system at:
  16260. 1363.34 s [nothunks] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  16261. 1363.34 s [nothunks] Using ghc-pkg version 9.12.2 found on system at:
  16262. 1363.34 s [nothunks] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  16263. 1363.34 s [nothunks] No ghcjs found
  16264. 1363.34 s [nothunks] No ghcjs-pkg found
  16265. 1363.34 s [nothunks] No greencard found
  16266. 1363.34 s [nothunks] Using haddock version 2.30.0 found on system at:
  16267. 1363.34 s [nothunks] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  16268. 1363.34 s [nothunks] No happy found
  16269. 1363.34 s [nothunks] No haskell-suite found
  16270. 1363.34 s [nothunks] No haskell-suite-pkg found
  16271. 1363.34 s [nothunks] No hmake found
  16272. 1363.34 s [nothunks] Using hpc version 0.69 found on system at:
  16273. 1363.34 s [nothunks] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  16274. 1363.34 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  16275. 1363.34 s [nothunks] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  16276. 1363.34 s [nothunks] Using hscolour version 1.25 found on system at:
  16277. 1363.34 s [nothunks] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  16278. 1363.34 s [nothunks] No jhc found
  16279. 1363.34 s [nothunks] Using ld found on system at:
  16280. 1363.34 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  16281. 1363.34 s [nothunks] No pkg-config found
  16282. 1363.34 s [nothunks] Using runghc version 9.12.2 found on system at:
  16283. 1363.34 s [nothunks] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  16284. 1363.34 s [nothunks] Using strip version 2.44 found on system at:
  16285. 1363.34 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16286. 1363.34 s [nothunks] Using tar found on system at:
  16287. 1363.34 s [nothunks] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16288. 1363.34 s [nothunks] No uhc found
  16289. 1363.67 s [nothunks] Phase: buildPhase
  16290. 1363.78 s [nothunks] Preprocessing library for nothunks-0.3.1...
  16291. 1363.78 s [nothunks] Building library for nothunks-0.3.1...
  16292. 1363.98 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  16293. 1367.41 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  16294. 1373.58 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  16295. 1373.58 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  16296. 1373.71 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 )
  16297. 1376.65 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  16298. 1377.19 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  16299. 1378.41 s [nothunks] Phase: checkPhase
  16300. 1378.98 s [nothunks] Running 1 test suites...
  16301. 1378.98 s [nothunks] Test suite nothunks-test: RUNNING...
  16302. 1378.99 s [nothunks] Tests
  16303. 1379.02 s [nothunks] NoThunks.Class
  16304. 1379.02 s [nothunks] Sanity
  16305. 1379.02 s [nothunks] IntNotNF: OK
  16306. 1379.02 s [nothunks] ✓ <interactive> passed 1 test.
  16307. 1379.02 s [nothunks] IntIsNF: OK
  16308. 1379.02 s [nothunks] ✓ <interactive> passed 1 test.
  16309. 1379.02 s [nothunks] Pair: OK
  16310. 1379.02 s [nothunks] ✓ <interactive> passed 1 test.
  16311. 1379.02 s [nothunks] Sum: OK
  16312. 1379.02 s [nothunks] ✓ <interactive> passed 1 test.
  16313. 1379.02 s [nothunks] Fn: OK
  16314. 1379.02 s [nothunks] ✓ <interactive> passed 1 test.
  16315. 1379.02 s [nothunks] IO: OK
  16316. 1379.02 s [nothunks] ✓ <interactive> passed 1 test.
  16317. 1379.02 s [nothunks] InspectHeap
  16318. 1379.02 s [nothunks] Int: OK (0.02s)
  16319. 1379.02 s [nothunks] ✓ <interactive> passed 1000 tests.
  16320. 1379.02 s [nothunks] Just ["Int"] 48% █████████▌··········
  16321. 1379.02 s [nothunks] Nothing 52% ██████████▍·········
  16322. 1379.06 s [nothunks] IntInt: OK (0.02s)
  16323. 1379.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  16324. 1379.06 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  16325. 1379.06 s [nothunks] Just ["Tuple2"] 49% █████████▋··········
  16326. 1379.06 s [nothunks] Nothing 14% ██▋·················
  16327. 1379.08 s [nothunks] SumInt: OK (0.02s)
  16328. 1379.08 s [nothunks] ✓ <interactive> passed 1000 tests.
  16329. 1379.08 s [nothunks] Just ["Either"] 34% ██████▊·············
  16330. 1379.08 s [nothunks] Just ["Int","Either"] 31% ██████▎·············
  16331. 1379.08 s [nothunks] Nothing 35% ██████▉·············
  16332. 1379.10 s [nothunks] ListInt: OK (0.02s)
  16333. 1379.10 s [nothunks] ✓ <interactive> passed 1000 tests.
  16334. 1379.10 s [nothunks] Just ["Int","List"] 23% ████▌···············
  16335. 1379.10 s [nothunks] Just ["List"] 44% ████████▊···········
  16336. 1379.10 s [nothunks] Nothing 33% ██████▌·············
  16337. 1379.11 s [nothunks] IntListInt: OK (0.03s)
  16338. 1379.11 s [nothunks] ✓ <interactive> passed 1000 tests.
  16339. 1379.11 s [nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
  16340. 1379.11 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  16341. 1379.11 s [nothunks] Just ["List","Tuple2"] 12% ██▎·················
  16342. 1379.11 s [nothunks] Just ["Tuple2"] 49% █████████▋··········
  16343. 1379.11 s [nothunks] Nothing 8% █▌··················
  16344. 1379.13 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  16345. 1379.13 s [nothunks] after 12 tests and 1 shrink.
  16346. 1379.13 s [nothunks] shrink path: 12:c
  16347. 1379.13 s [nothunks] Just ["Int","Seq"] 25% █████···············
  16348. 1379.13 s [nothunks] Nothing 67% █████████████▎······
  16349. 1379.13 s [nothunks]
  16350. 1379.13 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  16351. 1379.13 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  16352. 1379.13 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  16353. 1379.13 s [nothunks] 168 ┃ -> Proxy a
  16354. 1379.13 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  16355. 1379.13 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  16356. 1379.13 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  16357. 1379.13 s [nothunks] 172 ┃ -> Property
  16358. 1379.13 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  16359. 1379.13 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  16360. 1379.13 s [nothunks] ┃ │ Wrap
  16361. 1379.13 s [nothunks] ┃ │ { unwrap =
  16362. 1379.13 s [nothunks] ┃ │ SeqEnqueue
  16363. 1379.13 s [nothunks] ┃ │ (IntValue 0)
  16364. 1379.13 s [nothunks] ┃ │ (SeqEnqueue
  16365. 1379.13 s [nothunks] ┃ │ (IntValue 0)
  16366. 1379.13 s [nothunks] ┃ │ (SeqEnqueue
  16367. 1379.13 s [nothunks] ┃ │ (IntValue 0)
  16368. 1379.13 s [nothunks] ┃ │ (SeqEnqueue
  16369. 1379.13 s [nothunks] ┃ │ (IntValue 0)
  16370. 1379.13 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  16371. 1379.13 s [nothunks] ┃ │ }
  16372. 1379.13 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  16373. 1379.13 s [nothunks] 176 ┃ fromModel m $ \a -> do
  16374. 1379.13 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  16375. 1379.13 s [nothunks] ┃ │ IsNF
  16376. 1379.13 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  16377. 1379.13 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  16378. 1379.13 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16379. 1379.13 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  16380. 1379.13 s [nothunks] ┃ │ - Just
  16381. 1379.13 s [nothunks] ┃ │ - ThunkInfo
  16382. 1379.13 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  16383. 1379.13 s [nothunks] ┃ │ + Nothing
  16384. 1379.13 s [nothunks]
  16385. 1379.13 s [nothunks] This failure can be reproduced by running:
  16386. 1379.13 s [nothunks] > recheckAt (Seed 6705567878347855397 8760592997973743045) "12:c" EXPECTED FAILURE
  16387. 1379.13 s [nothunks]
  16388. 1379.14 s [nothunks] OK (0.02s)
  16389. 1379.14 s [nothunks] ✓ <interactive> passed 1 test.
  16390. 1379.14 s [nothunks] Model
  16391. 1379.16 s [nothunks] Int: OK (0.01s)
  16392. 1379.16 s [nothunks] ✓ <interactive> passed 1000 tests.
  16393. 1379.16 s [nothunks] Just ["Int"] 49% █████████▋··········
  16394. 1379.16 s [nothunks] Nothing 51% ██████████▎·········
  16395. 1379.18 s [nothunks] IntInt: OK (0.02s)
  16396. 1379.18 s [nothunks] ✓ <interactive> passed 1000 tests.
  16397. 1379.18 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  16398. 1379.18 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  16399. 1379.18 s [nothunks] Nothing 12% ██▎·················
  16400. 1379.20 s [nothunks] SumInt: OK (0.02s)
  16401. 1379.20 s [nothunks] ✓ <interactive> passed 1000 tests.
  16402. 1379.20 s [nothunks] Just ["Either"] 31% ██████▎·············
  16403. 1379.20 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  16404. 1379.20 s [nothunks] Nothing 34% ██████▉·············
  16405. 1379.22 s [nothunks] ListInt: OK (0.02s)
  16406. 1379.22 s [nothunks] ✓ <interactive> passed 1000 tests.
  16407. 1379.22 s [nothunks] Just ["Int","List"] 22% ████▍···············
  16408. 1379.22 s [nothunks] Just ["List"] 44% ████████▋···········
  16409. 1379.22 s [nothunks] Nothing 34% ██████▊·············
  16410. 1379.24 s [nothunks] IntListInt: OK (0.03s)
  16411. 1379.24 s [nothunks] ✓ <interactive> passed 1000 tests.
  16412. 1379.24 s [nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
  16413. 1379.24 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  16414. 1379.24 s [nothunks] Just ["List","Tuple2"] 11% ██▏·················
  16415. 1379.24 s [nothunks] Just ["Tuple2"] 48% █████████▋··········
  16416. 1379.24 s [nothunks] Nothing 10% █▉··················
  16417. 1379.32 s [nothunks] SeqInt: OK (0.07s)
  16418. 1379.32 s [nothunks] ✓ <interactive> passed 1000 tests.
  16419. 1379.32 s [nothunks] Just ["Int","Seq"] 46% █████████▎··········
  16420. 1379.32 s [nothunks] Nothing 54% ██████████▋·········
  16421. 1379.33 s [nothunks] AllowThunksIn: OK (0.02s)
  16422. 1379.33 s [nothunks] ✓ <interactive> passed 1000 tests.
  16423. 1379.33 s [nothunks] Just ["Int","field2","Record"] 25% █████···············
  16424. 1379.33 s [nothunks] Just ["Record"] 50% ██████████··········
  16425. 1379.33 s [nothunks] Nothing 24% ████▉···············
  16426. 1379.34 s [nothunks] Fn: OK (0.01s)
  16427. 1379.34 s [nothunks] ✓ <interactive> passed 1000 tests.
  16428. 1379.34 s [nothunks] Just ["->"] 27% █████▎··············
  16429. 1379.34 s [nothunks] Nothing 73% ██████████████▋·····
  16430. 1379.36 s [nothunks] IO: OK (0.01s)
  16431. 1379.36 s [nothunks] ✓ <interactive> passed 1000 tests.
  16432. 1379.36 s [nothunks] Just ["IO"] 26% █████▏··············
  16433. 1379.36 s [nothunks] Nothing 74% ██████████████▊·····
  16434. 1379.36 s [nothunks] ThunkFreeFn: OK (0.01s)
  16435. 1379.36 s [nothunks] ✓ <interactive> passed 1000 tests.
  16436. 1379.36 s [nothunks] Just ["->"] 26% █████▏··············
  16437. 1379.36 s [nothunks] Just ["...","->"] 36% ███████▏············
  16438. 1379.36 s [nothunks] Nothing 38% ███████▋············
  16439. 1379.37 s [nothunks] ThunkFreeIO: OK (0.01s)
  16440. 1379.37 s [nothunks] ✓ <interactive> passed 1000 tests.
  16441. 1379.37 s [nothunks] Just ["...","IO"] 38% ███████▋············
  16442. 1379.37 s [nothunks] Just ["IO"] 23% ████▋···············
  16443. 1379.37 s [nothunks] Nothing 38% ███████▋············
  16444. 1379.37 s [nothunks] MutableVars
  16445. 1379.37 s [nothunks] IORef
  16446. 1379.37 s [nothunks] NotNF: OK
  16447. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16448. 1379.37 s [nothunks] NF: OK
  16449. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16450. 1379.37 s [nothunks] NotNFPure: OK
  16451. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16452. 1379.37 s [nothunks] NFPure: OK
  16453. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16454. 1379.37 s [nothunks] NotNFAtomically: OK
  16455. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16456. 1379.37 s [nothunks] NFAtomically: OK
  16457. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16458. 1379.37 s [nothunks] MVar
  16459. 1379.37 s [nothunks] NotNF: OK
  16460. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16461. 1379.37 s [nothunks] NF: OK
  16462. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16463. 1379.37 s [nothunks] NotNFPure: OK
  16464. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16465. 1379.37 s [nothunks] NFPure: OK
  16466. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16467. 1379.37 s [nothunks] NotNFAtomically: OK
  16468. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16469. 1379.37 s [nothunks] NFAtomically: OK
  16470. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16471. 1379.37 s [nothunks] TVar
  16472. 1379.37 s [nothunks] NotNF: OK
  16473. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16474. 1379.37 s [nothunks] NF: OK
  16475. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16476. 1379.37 s [nothunks] NotNFPure: OK
  16477. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16478. 1379.37 s [nothunks] NFPure: OK
  16479. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16480. 1379.37 s [nothunks] NotNFAtomically: OK
  16481. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16482. 1379.37 s [nothunks] NFAtomically: OK
  16483. 1379.37 s [nothunks] ✓ <interactive> passed 1 test.
  16484. 1379.37 s [nothunks]
  16485. 1379.37 s [nothunks] All 41 tests passed (0.38s)
  16486. 1379.37 s [nothunks] Test suite nothunks-test: PASS
  16487. 1379.37 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  16488. 1379.37 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  16489. 1379.39 s [nothunks] Phase: haddockPhase
  16490. 1380.01 s [nothunks] Preprocessing library for nothunks-0.3.1...
  16491. 1380.01 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  16492. 1380.01 s [nothunks] Warning: The documentation for the following packages are not installed. No
  16493. 1380.01 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  16494. 1380.31 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing ) [HIE file is missing]
  16495. 1381.44 s [nothunks] Haddock coverage:
  16496. 1381.44 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  16497. 1381.44 s [nothunks] * at src/NoThunks/Class.hs:230:18
  16498. 1381.44 s [nothunks] * at src/NoThunks/Class.hs:230:1
  16499. 1381.44 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16500. 1381.44 s [nothunks] by specifying the type/value namespace explicitly.
  16501. 1381.44 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  16502. 1381.44 s [nothunks] Warning: 'GHC' is out of scope.
  16503. 1381.44 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16504. 1381.44 s [nothunks] Warning: 'a' is out of scope.
  16505. 1381.44 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16506. 1381.45 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  16507. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:334:48
  16508. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:334:1
  16509. 1381.45 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16510. 1381.45 s [nothunks] by specifying the type/value namespace explicitly.
  16511. 1381.45 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  16512. 1381.45 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  16513. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:353:25
  16514. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:353:1
  16515. 1381.45 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16516. 1381.45 s [nothunks] by specifying the type/value namespace explicitly.
  16517. 1381.45 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  16518. 1381.45 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  16519. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:358:47
  16520. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:358:1
  16521. 1381.45 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16522. 1381.45 s [nothunks] by specifying the type/value namespace explicitly.
  16523. 1381.45 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  16524. 1381.45 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  16525. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:308:27
  16526. 1381.45 s [nothunks] * at src/NoThunks/Class.hs:308:1
  16527. 1381.45 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16528. 1381.45 s [nothunks] by specifying the type/value namespace explicitly.
  16529. 1381.45 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  16530. 1381.59 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  16531. 1381.59 s [nothunks] Missing documentation for:
  16532. 1381.59 s [nothunks] Module header
  16533. 1382.37 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  16534. 1382.37 s [nothunks] - NoThunks.Class.Elem
  16535. 1382.37 s [nothunks] - NoThunks.Class.GShowTypeOf
  16536. 1382.37 s [nothunks] - NoThunks.Class.GWRecordField
  16537. 1382.37 s [nothunks] - NoThunks.Class.HasFields
  16538. 1382.37 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  16539. 1382.37 s [nothunks] - Data.Vector.Vector
  16540. 1382.37 s [nothunks] - NoThunks.Class.checkContainsThunks
  16541. 1388.96 s [nothunks] Documentation created: dist/doc/html/nothunks,
  16542. 1389.01 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  16543. 1389.57 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  16544. 1389.67 s [nothunks] Phase: installPhase
  16545. 1389.78 s [nothunks] Installing library in /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16546. 1390.13 s [nothunks] Phase: fixupPhase
  16547. 1390.15 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1
  16548. 1390.15 s [nothunks] shrinking /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSnothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t-ghc9.12.2.so
  16549. 1390.16 s [nothunks] checking for references to /build/ in /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1...
  16550. 1390.18 s [nothunks] patching script interpreter paths in /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1
  16551. 1390.19 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1/lib
  16552. 1390.27 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/gm0c2jixd4lvjf11j328l7ql0a10ingq-nothunks-0.3.1-doc
  16553. 1390.28 s [nothunks] checking for references to /build/ in /nix/store/gm0c2jixd4lvjf11j328l7ql0a10ingq-nothunks-0.3.1-doc...
  16554. 1390.30 s [nothunks] patching script interpreter paths in /nix/store/gm0c2jixd4lvjf11j328l7ql0a10ingq-nothunks-0.3.1-doc
  16555. 1390.42 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/gm0c2jixd4lvjf11j328l7ql0a10ingq-nothunks-0.3.1-doc /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1
  16556. 1390.93 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  16557. 1390.96 s [post-build-hook] Uploading to the NixCI cache: /nix/store/gm0c2jixd4lvjf11j328l7ql0a10ingq-nothunks-0.3.1-doc /nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1
  16558. 1391.03 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16559. 1391.13 s [post-build-hook] copying 1 paths...
  16560. 1391.13 s [post-build-hook] copying path '/nix/store/rfjlxwn536qq1nrv6i6h25hr4zrhbviz-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  16561. 1391.89 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16562. 1392.03 s [post-build-hook] copying 0 paths...
  16563. 1392.05 s Progress: 10 of 19 built, 165 of 165 downloaded from cache
  16564. 1392.12 s Building unordered-containers
  16565. 1392.24 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  16566. 1392.24 s [unordered-containers] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  16567. 1392.48 s [unordered-containers] Phase: unpackPhase
  16568. 1392.49 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  16569. 1392.49 s [unordered-containers] source root is unordered-containers-0.2.20.1
  16570. 1392.50 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  16571. 1392.51 s [unordered-containers] Phase: patchPhase
  16572. 1392.52 s [unordered-containers] Phase: compileBuildDriverPhase
  16573. 1392.52 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.48jkyc0mkS/setup-package.conf.d -threaded
  16574. 1392.61 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.48jkyc0mkS/Main.o )
  16575. 1392.69 s [unordered-containers] [2 of 2] Linking Setup
  16576. 1394.52 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  16577. 1394.53 s [unordered-containers] Phase: configurePhase
  16578. 1394.54 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/s1cyi6w356vnsasmzmxgg7hlvx1qck5n-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.48jkyc0mkS/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  16579. 1394.59 s [unordered-containers] Using Parsec parser
  16580. 1394.59 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  16581. 1394.59 s [unordered-containers] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  16582. 1394.59 s [unordered-containers] 'ghc' version < 9.12):
  16583. 1394.59 s [unordered-containers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  16584. 1394.59 s [unordered-containers] 9.12.2
  16585. 1394.99 s [unordered-containers] Flags chosen: debug=False
  16586. 1395.32 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.21.0.0
  16587. 1395.32 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
  16588. 1395.32 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  16589. 1395.32 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.23.0.0
  16590. 1395.32 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  16591. 1395.32 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  16592. 1395.32 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  16593. 1395.32 s [unordered-containers] Dependency base: using base-4.21.0.0
  16594. 1395.32 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  16595. 1395.32 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  16596. 1395.32 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  16597. 1395.32 s [unordered-containers] Dependency random: using random-1.2.1.3
  16598. 1395.32 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  16599. 1395.32 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  16600. 1395.32 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  16601. 1395.32 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  16602. 1395.32 s [unordered-containers] Source component graph:
  16603. 1395.32 s [unordered-containers] component lib
  16604. 1395.32 s [unordered-containers] component test:unordered-containers-tests dependency lib
  16605. 1395.32 s [unordered-containers] Configured component graph:
  16606. 1395.32 s [unordered-containers] component unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  16607. 1395.32 s [unordered-containers] include base-4.21.0.0-d2ce
  16608. 1395.32 s [unordered-containers] include deepseq-1.5.1.0-a72f
  16609. 1395.32 s [unordered-containers] include hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  16610. 1395.32 s [unordered-containers] include template-haskell-2.23.0.0-44ec
  16611. 1395.32 s [unordered-containers] component unordered-containers-0.2.20.1-EcA1weFnV0E25QehT2eT2k-unordered-containers-tests
  16612. 1395.32 s [unordered-containers] include ChasingBottoms-1.3.1.17-5G6A5J4lDhBECn2y6YPCBa
  16613. 1395.32 s [unordered-containers] include HUnit-1.6.2.0-GNOJ6Xqc1VSFhiNzfsTga2
  16614. 1395.32 s [unordered-containers] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  16615. 1395.32 s [unordered-containers] include base-4.21.0.0-d2ce
  16616. 1395.32 s [unordered-containers] include containers-0.7-0a77
  16617. 1395.32 s [unordered-containers] include hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  16618. 1395.32 s [unordered-containers] include nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16619. 1395.32 s [unordered-containers] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  16620. 1395.32 s [unordered-containers] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  16621. 1395.32 s [unordered-containers] include tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  16622. 1395.32 s [unordered-containers] include tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  16623. 1395.32 s [unordered-containers] include unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  16624. 1395.32 s [unordered-containers] Linked component graph:
  16625. 1395.32 s [unordered-containers] unit unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  16626. 1395.32 s [unordered-containers] include base-4.21.0.0-d2ce
  16627. 1395.32 s [unordered-containers] include deepseq-1.5.1.0-a72f
  16628. 1395.32 s [unordered-containers] include hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  16629. 1395.32 s [unordered-containers] include template-haskell-2.23.0.0-44ec
  16630. 1395.32 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl:Data.HashSet.Internal
  16631. 1395.32 s [unordered-containers] unit unordered-containers-0.2.20.1-EcA1weFnV0E25QehT2eT2k-unordered-containers-tests
  16632. 1395.32 s [unordered-containers] include ChasingBottoms-1.3.1.17-5G6A5J4lDhBECn2y6YPCBa
  16633. 1395.32 s [unordered-containers] include HUnit-1.6.2.0-GNOJ6Xqc1VSFhiNzfsTga2
  16634. 1395.32 s [unordered-containers] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  16635. 1395.32 s [unordered-containers] include base-4.21.0.0-d2ce
  16636. 1395.32 s [unordered-containers] include containers-0.7-0a77
  16637. 1395.32 s [unordered-containers] include hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  16638. 1395.33 s [unordered-containers] include nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16639. 1395.33 s [unordered-containers] include random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  16640. 1395.33 s [unordered-containers] include tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  16641. 1395.33 s [unordered-containers] include tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  16642. 1395.33 s [unordered-containers] include tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  16643. 1395.33 s [unordered-containers] include unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  16644. 1395.33 s [unordered-containers] Ready component graph:
  16645. 1395.33 s [unordered-containers] definite unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  16646. 1395.33 s [unordered-containers] depends base-4.21.0.0-d2ce
  16647. 1395.33 s [unordered-containers] depends deepseq-1.5.1.0-a72f
  16648. 1395.33 s [unordered-containers] depends hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  16649. 1395.33 s [unordered-containers] depends template-haskell-2.23.0.0-44ec
  16650. 1395.33 s [unordered-containers] definite unordered-containers-0.2.20.1-EcA1weFnV0E25QehT2eT2k-unordered-containers-tests
  16651. 1395.33 s [unordered-containers] depends ChasingBottoms-1.3.1.17-5G6A5J4lDhBECn2y6YPCBa
  16652. 1395.33 s [unordered-containers] depends HUnit-1.6.2.0-GNOJ6Xqc1VSFhiNzfsTga2
  16653. 1395.33 s [unordered-containers] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  16654. 1395.33 s [unordered-containers] depends base-4.21.0.0-d2ce
  16655. 1395.33 s [unordered-containers] depends containers-0.7-0a77
  16656. 1395.33 s [unordered-containers] depends hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  16657. 1395.33 s [unordered-containers] depends nothunks-0.3.1-9rHykjhnkY31uBYPtfxx5t
  16658. 1395.33 s [unordered-containers] depends random-1.2.1.3-HC3nKRUIM4MH7fUtyTvc4G
  16659. 1395.33 s [unordered-containers] depends tasty-1.5.3-2dhTIWhZUIHc3lzXBlonB
  16660. 1395.33 s [unordered-containers] depends tasty-hunit-0.10.2-KCz9anbkqo0BChYXUYyBjy
  16661. 1395.33 s [unordered-containers] depends tasty-quickcheck-0.11.1-7fwAXLkckwvGXmz1B8tjgC
  16662. 1395.33 s [unordered-containers] depends unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  16663. 1395.33 s [unordered-containers] Using Cabal-3.14.1.0 compiled by ghc-9.12
  16664. 1395.33 s [unordered-containers] Using compiler: ghc-9.12.2
  16665. 1395.33 s [unordered-containers] Using install prefix:
  16666. 1395.33 s [unordered-containers] /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1
  16667. 1395.33 s [unordered-containers] Executables installed in:
  16668. 1395.33 s [unordered-containers] /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/bin
  16669. 1395.33 s [unordered-containers] Libraries installed in:
  16670. 1395.33 s [unordered-containers] /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  16671. 1395.33 s [unordered-containers] Dynamic Libraries installed in:
  16672. 1395.33 s [unordered-containers] /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  16673. 1395.33 s [unordered-containers] Private executables installed in:
  16674. 1395.33 s [unordered-containers] /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.12.2-e4b2/unordered-containers-0.2.20.1
  16675. 1395.33 s [unordered-containers] Data files installed in:
  16676. 1395.33 s [unordered-containers] /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.12.2-e4b2/unordered-containers-0.2.20.1
  16677. 1395.33 s [unordered-containers] Documentation installed in:
  16678. 1395.33 s [unordered-containers] /nix/store/s1cyi6w356vnsasmzmxgg7hlvx1qck5n-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  16679. 1395.33 s [unordered-containers] Configuration files installed in:
  16680. 1395.33 s [unordered-containers] /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/etc
  16681. 1395.33 s [unordered-containers] No alex found
  16682. 1395.33 s [unordered-containers] Using ar found on system at:
  16683. 1395.33 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16684. 1395.33 s [unordered-containers] No c2hs found
  16685. 1395.33 s [unordered-containers] No cpphs found
  16686. 1395.33 s [unordered-containers] No doctest found
  16687. 1395.33 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  16688. 1395.33 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16689. 1395.33 s [unordered-containers] Using ghc version 9.12.2 found on system at:
  16690. 1395.33 s [unordered-containers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  16691. 1395.33 s [unordered-containers] Using ghc-pkg version 9.12.2 found on system at:
  16692. 1395.33 s [unordered-containers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  16693. 1395.33 s [unordered-containers] No ghcjs found
  16694. 1395.33 s [unordered-containers] No ghcjs-pkg found
  16695. 1395.33 s [unordered-containers] No greencard found
  16696. 1395.33 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  16697. 1395.33 s [unordered-containers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  16698. 1395.33 s [unordered-containers] No happy found
  16699. 1395.33 s [unordered-containers] No haskell-suite found
  16700. 1395.33 s [unordered-containers] No haskell-suite-pkg found
  16701. 1395.33 s [unordered-containers] No hmake found
  16702. 1395.33 s [unordered-containers] Using hpc version 0.69 found on system at:
  16703. 1395.33 s [unordered-containers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  16704. 1395.33 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  16705. 1395.33 s [unordered-containers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  16706. 1395.33 s [unordered-containers] Using hscolour version 1.25 found on system at:
  16707. 1395.33 s [unordered-containers] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  16708. 1395.33 s [unordered-containers] No jhc found
  16709. 1395.33 s [unordered-containers] Using ld found on system at:
  16710. 1395.33 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  16711. 1395.33 s [unordered-containers] No pkg-config found
  16712. 1395.33 s [unordered-containers] Using runghc version 9.12.2 found on system at:
  16713. 1395.33 s [unordered-containers] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  16714. 1395.33 s [unordered-containers] Using strip version 2.44 found on system at:
  16715. 1395.33 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16716. 1395.33 s [unordered-containers] Using tar found on system at:
  16717. 1395.33 s [unordered-containers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16718. 1395.33 s [unordered-containers] No uhc found
  16719. 1395.48 s [unordered-containers] Phase: buildPhase
  16720. 1395.55 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  16721. 1395.57 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  16722. 1395.67 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16723. 1395.67 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16724. 1395.67 s [unordered-containers] |
  16725. 1395.67 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16726. 1395.67 s [unordered-containers] | ^^^^^^^^^^
  16727. 1395.67 s [unordered-containers]
  16728. 1395.91 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 )
  16729. 1396.11 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16730. 1396.11 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16731. 1396.11 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16732. 1396.11 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16733. 1396.11 s [unordered-containers] |
  16734. 1396.11 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16735. 1396.12 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16736. 1396.12 s [unordered-containers]
  16737. 1396.12 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  16738. 1396.12 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  16739. 1396.12 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  16740. 1396.12 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  16741. 1396.12 s [unordered-containers] |
  16742. 1396.12 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  16743. 1396.12 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16744. 1396.12 s [unordered-containers]
  16745. 1396.84 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 )
  16746. 1396.84 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 )
  16747. 1404.39 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 )
  16748. 1404.76 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 )
  16749. 1406.87 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 )
  16750. 1406.87 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  16751. 1406.87 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 )
  16752. 1406.90 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 )
  16753. 1407.16 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16754. 1407.16 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16755. 1407.16 s [unordered-containers] |
  16756. 1407.16 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16757. 1407.16 s [unordered-containers] | ^^^^^^^^^^
  16758. 1407.16 s [unordered-containers]
  16759. 1407.39 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  16760. 1407.60 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16761. 1407.60 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16762. 1407.60 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16763. 1407.60 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16764. 1407.60 s [unordered-containers] |
  16765. 1407.60 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16766. 1407.60 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16767. 1407.60 s [unordered-containers]
  16768. 1407.60 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  16769. 1407.60 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  16770. 1407.60 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  16771. 1407.60 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  16772. 1407.60 s [unordered-containers] |
  16773. 1407.60 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  16774. 1407.60 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16775. 1407.60 s [unordered-containers]
  16776. 1408.25 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  16777. 1408.25 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  16778. 1417.78 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  16779. 1418.77 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  16780. 1422.20 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  16781. 1422.20 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  16782. 1422.20 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  16783. 1422.33 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  16784. 1424.27 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16785. 1424.27 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16786. 1424.45 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 )
  16787. 1424.71 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  16788. 1424.71 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  16789. 1424.71 s [unordered-containers] In the use of ‘head’
  16790. 1424.71 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  16791. 1424.71 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16792. 1424.71 s [unordered-containers] |
  16793. 1424.71 s [unordered-containers] 93 | k = head keys
  16794. 1424.71 s [unordered-containers] | ^^^^
  16795. 1424.71 s [unordered-containers]
  16796. 1428.92 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 )
  16797. 1428.92 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  16798. 1428.92 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  16799. 1428.92 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  16800. 1428.92 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  16801. 1428.92 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  16802. 1428.92 s [unordered-containers] |
  16803. 1428.92 s [unordered-containers] 7 | import Data.Foldable (foldl')
  16804. 1428.92 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16805. 1428.92 s [unordered-containers]
  16806. 1428.92 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 )
  16807. 1428.92 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 )
  16808. 1435.73 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 )
  16809. 1435.76 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  16810. 1435.76 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  16811. 1436.15 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  16812. 1437.17 s [unordered-containers] buildPhase completed in 41 seconds
  16813. 1437.17 s [unordered-containers] Phase: checkPhase
  16814. 1437.47 s [unordered-containers] Running 1 test suites...
  16815. 1437.47 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  16816. 1437.49 s [unordered-containers] All
  16817. 1437.49 s [unordered-containers] Properties
  16818. 1437.49 s [unordered-containers] Data.HashMap.Lazy
  16819. 1437.49 s [unordered-containers] instances
  16820. 1437.49 s [unordered-containers] Eq
  16821. 1437.53 s [unordered-containers] ==: OK (0.02s)
  16822. 1437.53 s [unordered-containers] +++ OK, passed 100 tests.
  16823. 1437.53 s [unordered-containers] /=: OK (0.01s)
  16824. 1437.53 s [unordered-containers] +++ OK, passed 100 tests.
  16825. 1437.53 s [unordered-containers] Ord
  16826. 1437.53 s [unordered-containers] compare reflexive: OK (0.01s)
  16827. 1437.53 s [unordered-containers] +++ OK, passed 100 tests.
  16828. 1437.53 s [unordered-containers] compare transitive: OK (0.01s)
  16829. 1437.53 s [unordered-containers] +++ OK, passed 100 tests.
  16830. 1437.54 s [unordered-containers] compare antisymmetric: OK (0.02s)
  16831. 1437.54 s [unordered-containers] +++ OK, passed 100 tests.
  16832. 1437.54 s [unordered-containers] Ord => Eq: OK (0.01s)
  16833. 1437.54 s [unordered-containers] +++ OK, passed 100 tests.
  16834. 1437.68 s [unordered-containers] Read/Show: OK (0.15s)
  16835. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16836. 1437.68 s [unordered-containers] Functor: OK (0.04s)
  16837. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16838. 1437.68 s [unordered-containers] Foldable: OK (0.01s)
  16839. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16840. 1437.68 s [unordered-containers] Bifoldable
  16841. 1437.68 s [unordered-containers] bifoldMap: OK
  16842. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16843. 1437.68 s [unordered-containers] bifoldr: OK (0.01s)
  16844. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16845. 1437.68 s [unordered-containers] bifoldl: OK (0.01s)
  16846. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16847. 1437.68 s [unordered-containers] Hashable: OK (0.01s)
  16848. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16849. 1437.68 s [unordered-containers] empty
  16850. 1437.68 s [unordered-containers] valid: OK
  16851. 1437.68 s [unordered-containers] +++ OK, passed 1 test.
  16852. 1437.68 s [unordered-containers] singleton
  16853. 1437.68 s [unordered-containers] valid: OK (0.01s)
  16854. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16855. 1437.68 s [unordered-containers] size: OK (0.02s)
  16856. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16857. 1437.68 s [unordered-containers] member: OK
  16858. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16859. 1437.68 s [unordered-containers] lookup: OK
  16860. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16861. 1437.68 s [unordered-containers] !?: OK (0.01s)
  16862. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16863. 1437.68 s [unordered-containers] insert
  16864. 1437.68 s [unordered-containers] model: OK
  16865. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16866. 1437.68 s [unordered-containers] valid: OK
  16867. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16868. 1437.68 s [unordered-containers] insertWith
  16869. 1437.68 s [unordered-containers] insertWith: OK
  16870. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16871. 1437.68 s [unordered-containers] valid: OK
  16872. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16873. 1437.68 s [unordered-containers] delete
  16874. 1437.68 s [unordered-containers] model: OK
  16875. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16876. 1437.68 s [unordered-containers] valid: OK
  16877. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16878. 1437.68 s [unordered-containers] adjust
  16879. 1437.68 s [unordered-containers] model: OK
  16880. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16881. 1437.68 s [unordered-containers] valid: OK
  16882. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16883. 1437.68 s [unordered-containers] update
  16884. 1437.68 s [unordered-containers] model: OK
  16885. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16886. 1437.68 s [unordered-containers] valid: OK
  16887. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16888. 1437.68 s [unordered-containers] alter
  16889. 1437.68 s [unordered-containers] model: OK
  16890. 1437.68 s [unordered-containers] +++ OK, passed 100 tests.
  16891. 1437.69 s [unordered-containers] valid: OK
  16892. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16893. 1437.69 s [unordered-containers] alterF
  16894. 1437.69 s [unordered-containers] model
  16895. 1437.69 s [unordered-containers] []: OK (0.03s)
  16896. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16897. 1437.69 s [unordered-containers] adjust: OK
  16898. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16899. 1437.69 s [unordered-containers] insert: OK
  16900. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16901. 1437.69 s [unordered-containers] insertWith: OK (0.01s)
  16902. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16903. 1437.69 s [unordered-containers] delete: OK
  16904. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16905. 1437.69 s [unordered-containers] lookup: OK
  16906. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16907. 1437.69 s [unordered-containers] valid: OK (0.02s)
  16908. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16909. 1437.69 s [unordered-containers] isSubmapOf
  16910. 1437.69 s [unordered-containers] model: OK
  16911. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16912. 1437.69 s [unordered-containers] m ⊆ m: OK
  16913. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16914. 1437.69 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.01s)
  16915. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16916. 1437.69 s [unordered-containers] m1\m2 ⊆ m1: OK
  16917. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16918. 1437.69 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK
  16919. 1437.69 s [unordered-containers] +++ OK, passed 100 tests; 146 discarded.
  16920. 1437.69 s [unordered-containers] delete k m ⊆ m: OK
  16921. 1437.69 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  16922. 1437.69 s [unordered-containers] m ⊈ delete k m : OK
  16923. 1437.69 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  16924. 1437.69 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  16925. 1437.69 s [unordered-containers] +++ OK, passed 100 tests; 6 discarded.
  16926. 1437.69 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  16927. 1437.69 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  16928. 1437.69 s [unordered-containers] union
  16929. 1437.69 s [unordered-containers] model: OK
  16930. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16931. 1437.69 s [unordered-containers] valid: OK
  16932. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16933. 1437.69 s [unordered-containers] unionWith
  16934. 1437.69 s [unordered-containers] model: OK (0.06s)
  16935. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16936. 1437.69 s [unordered-containers] valid: OK
  16937. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16938. 1437.69 s [unordered-containers] unionWithKey
  16939. 1437.69 s [unordered-containers] model: OK (0.16s)
  16940. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16941. 1437.69 s [unordered-containers] valid: OK
  16942. 1437.69 s [unordered-containers] +++ OK, passed 100 tests.
  16943. 1437.69 s [unordered-containers] unions
  16944. 1438.40 s [unordered-containers] model: OK (0.89s)
  16945. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16946. 1438.40 s [unordered-containers] valid: OK (0.41s)
  16947. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16948. 1438.40 s [unordered-containers] difference
  16949. 1438.40 s [unordered-containers] model: OK
  16950. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16951. 1438.40 s [unordered-containers] valid: OK
  16952. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16953. 1438.40 s [unordered-containers] differenceWith
  16954. 1438.40 s [unordered-containers] model: OK (0.02s)
  16955. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16956. 1438.40 s [unordered-containers] valid: OK (0.02s)
  16957. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16958. 1438.40 s [unordered-containers] intersection
  16959. 1438.40 s [unordered-containers] model: OK (0.02s)
  16960. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16961. 1438.40 s [unordered-containers] valid: OK
  16962. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16963. 1438.40 s [unordered-containers] intersectionWith
  16964. 1438.40 s [unordered-containers] model: OK (0.03s)
  16965. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16966. 1438.40 s [unordered-containers] valid: OK
  16967. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16968. 1438.40 s [unordered-containers] intersectionWithKey
  16969. 1438.40 s [unordered-containers] model: OK (0.02s)
  16970. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16971. 1438.40 s [unordered-containers] valid: OK
  16972. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16973. 1438.40 s [unordered-containers] compose
  16974. 1438.40 s [unordered-containers] valid: OK
  16975. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16976. 1438.40 s [unordered-containers] map
  16977. 1438.40 s [unordered-containers] model: OK (0.07s)
  16978. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16979. 1438.40 s [unordered-containers] valid: OK
  16980. 1438.40 s [unordered-containers] +++ OK, passed 100 tests.
  16981. 1438.40 s [unordered-containers] traverseWithKey
  16982. 1438.41 s [unordered-containers] model: OK (0.39s)
  16983. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16984. 1438.41 s [unordered-containers] valid: OK
  16985. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16986. 1438.41 s [unordered-containers] mapKeys
  16987. 1438.41 s [unordered-containers] model: OK
  16988. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16989. 1438.41 s [unordered-containers] valid: OK (0.39s)
  16990. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16991. 1438.41 s [unordered-containers] foldr: OK
  16992. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16993. 1438.41 s [unordered-containers] foldl: OK
  16994. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16995. 1438.41 s [unordered-containers] foldrWithKey: OK (0.02s)
  16996. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16997. 1438.41 s [unordered-containers] foldlWithKey: OK (0.01s)
  16998. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  16999. 1438.41 s [unordered-containers] foldrWithKey': OK (0.01s)
  17000. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17001. 1438.41 s [unordered-containers] foldlWithKey': OK (0.01s)
  17002. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17003. 1438.41 s [unordered-containers] foldl': OK (0.01s)
  17004. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17005. 1438.41 s [unordered-containers] foldr': OK (0.01s)
  17006. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17007. 1438.41 s [unordered-containers] foldMapWithKey: OK
  17008. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17009. 1438.41 s [unordered-containers] filter
  17010. 1438.41 s [unordered-containers] model: OK (0.10s)
  17011. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17012. 1438.41 s [unordered-containers] valid: OK (0.06s)
  17013. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17014. 1438.41 s [unordered-containers] filterWithKey
  17015. 1438.41 s [unordered-containers] model: OK (0.76s)
  17016. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17017. 1438.41 s [unordered-containers] valid: OK (0.40s)
  17018. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17019. 1438.41 s [unordered-containers] mapMaybe
  17020. 1438.41 s [unordered-containers] model: OK (0.15s)
  17021. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17022. 1438.41 s [unordered-containers] valid: OK (0.06s)
  17023. 1438.41 s [unordered-containers] +++ OK, passed 100 tests.
  17024. 1438.41 s [unordered-containers] mapMaybeWithKey
  17025. 1438.43 s [unordered-containers] model: OK (0.88s)
  17026. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17027. 1438.43 s [unordered-containers] valid: OK (0.39s)
  17028. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17029. 1438.43 s [unordered-containers] elems: OK (0.05s)
  17030. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17031. 1438.43 s [unordered-containers] keys: OK (0.05s)
  17032. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17033. 1438.43 s [unordered-containers] fromList
  17034. 1438.43 s [unordered-containers] model: OK (0.02s)
  17035. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17036. 1438.43 s [unordered-containers] valid: OK (0.02s)
  17037. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17038. 1438.43 s [unordered-containers] fromListWith
  17039. 1438.43 s [unordered-containers] model: OK (0.03s)
  17040. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17041. 1438.43 s [unordered-containers] valid: OK (0.01s)
  17042. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17043. 1438.43 s [unordered-containers] fromListWithKey
  17044. 1438.43 s [unordered-containers] model: OK (0.03s)
  17045. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17046. 1438.43 s [unordered-containers] valid: OK (0.01s)
  17047. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17048. 1438.43 s [unordered-containers] toList: OK (0.02s)
  17049. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17050. 1438.43 s [unordered-containers] Data.HashMap.Strict
  17051. 1438.43 s [unordered-containers] instances
  17052. 1438.43 s [unordered-containers] Eq
  17053. 1438.43 s [unordered-containers] ==: OK (0.05s)
  17054. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17055. 1438.43 s [unordered-containers] /=: OK (0.03s)
  17056. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17057. 1438.43 s [unordered-containers] Ord
  17058. 1438.43 s [unordered-containers] compare reflexive: OK (0.02s)
  17059. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17060. 1438.43 s [unordered-containers] compare transitive: OK (0.06s)
  17061. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17062. 1438.43 s [unordered-containers] compare antisymmetric: OK (0.03s)
  17063. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17064. 1438.43 s [unordered-containers] Ord => Eq: OK (0.02s)
  17065. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17066. 1438.43 s [unordered-containers] Read/Show: OK (0.28s)
  17067. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17068. 1438.43 s [unordered-containers] Functor: OK (0.10s)
  17069. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17070. 1438.43 s [unordered-containers] Foldable: OK (0.01s)
  17071. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17072. 1438.43 s [unordered-containers] Bifoldable
  17073. 1438.43 s [unordered-containers] bifoldMap: OK (0.02s)
  17074. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17075. 1438.43 s [unordered-containers] bifoldr: OK (0.02s)
  17076. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17077. 1438.43 s [unordered-containers] bifoldl: OK
  17078. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17079. 1438.43 s [unordered-containers] Hashable: OK (0.02s)
  17080. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17081. 1438.43 s [unordered-containers] empty
  17082. 1438.43 s [unordered-containers] valid: OK
  17083. 1438.43 s [unordered-containers] +++ OK, passed 1 test.
  17084. 1438.43 s [unordered-containers] singleton
  17085. 1438.43 s [unordered-containers] valid: OK
  17086. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17087. 1438.43 s [unordered-containers] size: OK (0.01s)
  17088. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17089. 1438.43 s [unordered-containers] member: OK (0.01s)
  17090. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17091. 1438.43 s [unordered-containers] lookup: OK
  17092. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17093. 1438.43 s [unordered-containers] !?: OK
  17094. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17095. 1438.43 s [unordered-containers] insert
  17096. 1438.43 s [unordered-containers] model: OK
  17097. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17098. 1438.43 s [unordered-containers] valid: OK
  17099. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17100. 1438.43 s [unordered-containers] insertWith
  17101. 1438.43 s [unordered-containers] insertWith: OK (0.02s)
  17102. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17103. 1438.43 s [unordered-containers] valid: OK
  17104. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17105. 1438.43 s [unordered-containers] delete
  17106. 1438.43 s [unordered-containers] model: OK (0.01s)
  17107. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17108. 1438.43 s [unordered-containers] valid: OK (0.01s)
  17109. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17110. 1438.43 s [unordered-containers] adjust
  17111. 1438.43 s [unordered-containers] model: OK
  17112. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17113. 1438.43 s [unordered-containers] valid: OK (0.01s)
  17114. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17115. 1438.43 s [unordered-containers] update
  17116. 1438.43 s [unordered-containers] model: OK (0.03s)
  17117. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17118. 1438.43 s [unordered-containers] valid: OK (0.02s)
  17119. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17120. 1438.43 s [unordered-containers] alter
  17121. 1438.43 s [unordered-containers] model: OK (0.02s)
  17122. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17123. 1438.43 s [unordered-containers] valid: OK (0.02s)
  17124. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17125. 1438.43 s [unordered-containers] alterF
  17126. 1438.43 s [unordered-containers] model
  17127. 1438.43 s [unordered-containers] []: OK (0.19s)
  17128. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17129. 1438.43 s [unordered-containers] adjust: OK (0.02s)
  17130. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17131. 1438.43 s [unordered-containers] insert: OK (0.02s)
  17132. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17133. 1438.43 s [unordered-containers] insertWith: OK (0.03s)
  17134. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17135. 1438.43 s [unordered-containers] delete: OK (0.02s)
  17136. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17137. 1438.43 s [unordered-containers] lookup: OK (0.02s)
  17138. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17139. 1438.43 s [unordered-containers] valid: OK (0.05s)
  17140. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17141. 1438.43 s [unordered-containers] isSubmapOf
  17142. 1438.43 s [unordered-containers] model: OK (0.05s)
  17143. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17144. 1438.43 s [unordered-containers] m ⊆ m: OK (0.02s)
  17145. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17146. 1438.43 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.02s)
  17147. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17148. 1438.43 s [unordered-containers] m1\m2 ⊆ m1: OK (0.05s)
  17149. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17150. 1438.43 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.04s)
  17151. 1438.43 s [unordered-containers] +++ OK, passed 100 tests; 195 discarded.
  17152. 1438.43 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  17153. 1438.43 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  17154. 1438.43 s [unordered-containers] m ⊈ delete k m : OK (0.03s)
  17155. 1438.43 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  17156. 1438.43 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.01s)
  17157. 1438.43 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  17158. 1438.43 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  17159. 1438.43 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17160. 1438.43 s [unordered-containers] union
  17161. 1438.43 s [unordered-containers] model: OK (0.05s)
  17162. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17163. 1438.43 s [unordered-containers] valid: OK (0.03s)
  17164. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17165. 1438.43 s [unordered-containers] unionWith
  17166. 1438.43 s [unordered-containers] model: OK (0.08s)
  17167. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17168. 1438.43 s [unordered-containers] valid: OK (0.04s)
  17169. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17170. 1438.43 s [unordered-containers] unionWithKey
  17171. 1438.43 s [unordered-containers] model: OK (0.10s)
  17172. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17173. 1438.43 s [unordered-containers] valid: OK (0.08s)
  17174. 1438.43 s [unordered-containers] +++ OK, passed 100 tests.
  17175. 1438.44 s [unordered-containers] unions
  17176. 1438.52 s [unordered-containers] model: OK (0.67s)
  17177. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17178. 1438.52 s [unordered-containers] valid: OK (0.53s)
  17179. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17180. 1438.52 s [unordered-containers] difference
  17181. 1438.52 s [unordered-containers] model: OK (0.03s)
  17182. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17183. 1438.52 s [unordered-containers] valid: OK (0.02s)
  17184. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17185. 1438.52 s [unordered-containers] differenceWith
  17186. 1438.52 s [unordered-containers] model: OK (0.05s)
  17187. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17188. 1438.52 s [unordered-containers] valid: OK (0.04s)
  17189. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17190. 1438.52 s [unordered-containers] intersection
  17191. 1438.52 s [unordered-containers] model: OK (0.03s)
  17192. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17193. 1438.52 s [unordered-containers] valid: OK (0.02s)
  17194. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17195. 1438.52 s [unordered-containers] intersectionWith
  17196. 1438.52 s [unordered-containers] model: OK (0.04s)
  17197. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17198. 1438.52 s [unordered-containers] valid: OK (0.03s)
  17199. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17200. 1438.52 s [unordered-containers] intersectionWithKey
  17201. 1438.52 s [unordered-containers] model: OK (0.06s)
  17202. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17203. 1438.52 s [unordered-containers] valid: OK (0.05s)
  17204. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17205. 1438.52 s [unordered-containers] compose
  17206. 1438.52 s [unordered-containers] valid: OK (0.02s)
  17207. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17208. 1438.52 s [unordered-containers] map
  17209. 1438.52 s [unordered-containers] model: OK (0.02s)
  17210. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17211. 1438.52 s [unordered-containers] valid: OK (0.03s)
  17212. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17213. 1438.52 s [unordered-containers] traverseWithKey
  17214. 1438.52 s [unordered-containers] model: OK (0.40s)
  17215. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17216. 1438.52 s [unordered-containers] valid: OK (0.03s)
  17217. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17218. 1438.52 s [unordered-containers] mapKeys
  17219. 1438.52 s [unordered-containers] model: OK (0.02s)
  17220. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17221. 1438.52 s [unordered-containers] valid: OK (0.19s)
  17222. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17223. 1438.52 s [unordered-containers] foldr: OK
  17224. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17225. 1438.52 s [unordered-containers] foldl: OK (0.01s)
  17226. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17227. 1438.52 s [unordered-containers] foldrWithKey: OK (0.01s)
  17228. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17229. 1438.52 s [unordered-containers] foldlWithKey: OK (0.01s)
  17230. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17231. 1438.52 s [unordered-containers] foldrWithKey': OK (0.01s)
  17232. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17233. 1438.52 s [unordered-containers] foldlWithKey': OK (0.02s)
  17234. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17235. 1438.52 s [unordered-containers] foldl': OK (0.02s)
  17236. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17237. 1438.52 s [unordered-containers] foldr': OK (0.01s)
  17238. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17239. 1438.52 s [unordered-containers] foldMapWithKey: OK (0.01s)
  17240. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17241. 1438.52 s [unordered-containers] filter
  17242. 1438.52 s [unordered-containers] model: OK (0.06s)
  17243. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17244. 1438.52 s [unordered-containers] valid: OK (0.04s)
  17245. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17246. 1438.52 s [unordered-containers] filterWithKey
  17247. 1438.52 s [unordered-containers] model: OK (0.54s)
  17248. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17249. 1438.52 s [unordered-containers] valid: OK (0.40s)
  17250. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17251. 1438.52 s [unordered-containers] mapMaybe
  17252. 1438.52 s [unordered-containers] model: OK (0.07s)
  17253. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17254. 1438.52 s [unordered-containers] valid: OK (0.04s)
  17255. 1438.52 s [unordered-containers] +++ OK, passed 100 tests.
  17256. 1438.52 s [unordered-containers] mapMaybeWithKey
  17257. 1438.57 s [unordered-containers] model: OK (0.59s)
  17258. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17259. 1438.57 s [unordered-containers] valid: OK (0.28s)
  17260. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17261. 1438.57 s [unordered-containers] elems: OK
  17262. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17263. 1438.57 s [unordered-containers] keys: OK
  17264. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17265. 1438.57 s [unordered-containers] fromList
  17266. 1438.57 s [unordered-containers] model: OK (0.01s)
  17267. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17268. 1438.57 s [unordered-containers] valid: OK (0.01s)
  17269. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17270. 1438.57 s [unordered-containers] fromListWith
  17271. 1438.57 s [unordered-containers] model: OK (0.02s)
  17272. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17273. 1438.57 s [unordered-containers] valid: OK (0.02s)
  17274. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17275. 1438.57 s [unordered-containers] fromListWithKey
  17276. 1438.57 s [unordered-containers] model: OK
  17277. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17278. 1438.57 s [unordered-containers] valid: OK (0.05s)
  17279. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17280. 1438.57 s [unordered-containers] toList: OK (0.04s)
  17281. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17282. 1438.57 s [unordered-containers] Data.HashSet
  17283. 1438.57 s [unordered-containers] instances
  17284. 1438.57 s [unordered-containers] Eq
  17285. 1438.57 s [unordered-containers] ==: OK (0.03s)
  17286. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17287. 1438.57 s [unordered-containers] == permutations: OK (0.01s)
  17288. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17289. 1438.57 s [unordered-containers] /=: OK (0.02s)
  17290. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17291. 1438.57 s [unordered-containers] Ord
  17292. 1438.57 s [unordered-containers] compare reflexive: OK (0.02s)
  17293. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17294. 1438.57 s [unordered-containers] compare transitive: OK (0.02s)
  17295. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17296. 1438.57 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17297. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17298. 1438.57 s [unordered-containers] Ord => Eq: OK (0.02s)
  17299. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17300. 1438.57 s [unordered-containers] Read/Show: OK (0.21s)
  17301. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17302. 1438.57 s [unordered-containers] Foldable: OK (0.02s)
  17303. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17304. 1438.57 s [unordered-containers] Hashable: OK (0.02s)
  17305. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17306. 1438.57 s [unordered-containers] size: OK (0.01s)
  17307. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17308. 1438.57 s [unordered-containers] member: OK
  17309. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17310. 1438.57 s [unordered-containers] insert: OK (0.02s)
  17311. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17312. 1438.57 s [unordered-containers] delete: OK (0.02s)
  17313. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17314. 1438.57 s [unordered-containers] union: OK (0.04s)
  17315. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17316. 1438.57 s [unordered-containers] map: OK (0.41s)
  17317. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17318. 1438.57 s [unordered-containers] foldr: OK (0.02s)
  17319. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17320. 1438.57 s [unordered-containers] foldl': OK (0.01s)
  17321. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17322. 1438.57 s [unordered-containers] filter: OK (0.40s)
  17323. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17324. 1438.57 s [unordered-containers] toList: OK
  17325. 1438.57 s [unordered-containers] +++ OK, passed 100 tests.
  17326. 1438.57 s [unordered-containers] Data.HashMap.Internal.List
  17327. 1438.57 s [unordered-containers] isPermutationBy: OK (0.01s)
  17328. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17329. 1438.58 s [unordered-containers] isPermutationBy of different length: OK
  17330. 1438.58 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17331. 1438.58 s [unordered-containers] pUnorderedCompare: OK (0.05s)
  17332. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17333. 1438.58 s [unordered-containers] modelUnorderedCompare
  17334. 1438.58 s [unordered-containers] reflexive: OK
  17335. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17336. 1438.58 s [unordered-containers] anti-symmetric: OK
  17337. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17338. 1438.58 s [unordered-containers] transitive: OK (0.02s)
  17339. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17340. 1438.58 s [unordered-containers] Regression tests
  17341. 1438.58 s [unordered-containers] issue32: OK
  17342. 1438.58 s [unordered-containers] issue39a: OK
  17343. 1438.58 s [unordered-containers] issue39b: OK
  17344. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17345. 1438.58 s [unordered-containers] issue254 lazy: OK
  17346. 1438.58 s [unordered-containers] issue254 strict: OK
  17347. 1438.58 s [unordered-containers] issue379
  17348. 1438.58 s [unordered-containers] Lazy.unionWith: OK
  17349. 1438.58 s [unordered-containers] union: OK
  17350. 1438.58 s [unordered-containers] Strict.unionWith: OK
  17351. 1438.58 s [unordered-containers] Strict.unionWithKey: OK
  17352. 1438.58 s [unordered-containers] issue381
  17353. 1438.58 s [unordered-containers] mapMaybe: OK
  17354. 1438.58 s [unordered-containers] mapMaybeWithKey: OK
  17355. 1438.58 s [unordered-containers] issue382: OK
  17356. 1438.58 s [unordered-containers] issue383: OK
  17357. 1438.58 s [unordered-containers] issue420: OK
  17358. 1438.58 s [unordered-containers] issue491
  17359. 1438.58 s [unordered-containers] 1: OK
  17360. 1438.58 s [unordered-containers] 2: OK
  17361. 1438.58 s [unordered-containers] 3: OK
  17362. 1438.58 s [unordered-containers] Strictness
  17363. 1438.58 s [unordered-containers] HashMap.Strict
  17364. 1438.58 s [unordered-containers] singleton is key-strict: OK
  17365. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17366. 1438.58 s [unordered-containers] singleton is value-strict: OK
  17367. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17368. 1438.58 s [unordered-containers] member is key-strict: OK
  17369. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17370. 1438.58 s [unordered-containers] lookup is key-strict: OK
  17371. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17372. 1438.58 s [unordered-containers] lookupDefault is key-strict: OK
  17373. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17374. 1438.58 s [unordered-containers] findWithDefault is key-strict: OK
  17375. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17376. 1438.58 s [unordered-containers] ! is key-strict: OK
  17377. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17378. 1438.58 s [unordered-containers] delete is key-strict: OK
  17379. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17380. 1438.58 s [unordered-containers] adjust is key-strict: OK
  17381. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17382. 1438.58 s [unordered-containers] adjust is value-strict: OK (0.01s)
  17383. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17384. 1438.58 s [unordered-containers] insert is key-strict: OK
  17385. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17386. 1438.58 s [unordered-containers] insert is value-strict: OK
  17387. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17388. 1438.58 s [unordered-containers] insertWith is key-strict: OK
  17389. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17390. 1438.58 s [unordered-containers] insertWith is value-strict: OK (0.01s)
  17391. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17392. 1438.58 s [unordered-containers] fromList is key-strict: OK
  17393. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17394. 1438.58 s [unordered-containers] fromList is value-strict: OK
  17395. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17396. 1438.58 s [unordered-containers] fromListWith is key-strict: OK
  17397. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17398. 1438.58 s [unordered-containers] fromListWith is value-strict: OK (0.01s)
  17399. 1438.58 s [unordered-containers] +++ OK, passed 100 tests.
  17400. 1438.58 s [unordered-containers]
  17401. 1438.58 s [unordered-containers] All 257 tests passed (1.09s)
  17402. 1438.59 s [unordered-containers] Test suite unordered-containers-tests: PASS
  17403. 1438.59 s [unordered-containers] Test suite logged to:
  17404. 1438.59 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  17405. 1438.59 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  17406. 1438.60 s [unordered-containers] Phase: haddockPhase
  17407. 1439.12 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  17408. 1439.12 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  17409. 1439.42 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  17410. 1439.42 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17411. 1439.42 s [unordered-containers] |
  17412. 1439.43 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17413. 1439.43 s [unordered-containers] | ^^^^^^^^^^
  17414. 1439.43 s [unordered-containers]
  17415. 1439.58 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing ) [Flags changed]
  17416. 1439.78 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  17417. 1439.78 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17418. 1439.78 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17419. 1439.78 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17420. 1439.78 s [unordered-containers] |
  17421. 1439.78 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17422. 1439.78 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17423. 1439.78 s [unordered-containers]
  17424. 1439.78 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  17425. 1439.78 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  17426. 1439.78 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  17427. 1439.78 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  17428. 1439.78 s [unordered-containers] |
  17429. 1439.78 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  17430. 1439.78 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  17431. 1439.78 s [unordered-containers]
  17432. 1439.78 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing ) [Flags changed]
  17433. 1439.80 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing ) [Flags changed]
  17434. 1440.80 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing ) [Flags changed]
  17435. 1440.93 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing ) [Flags changed]
  17436. 1441.04 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing ) [Flags changed]
  17437. 1441.15 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing ) [Flags changed]
  17438. 1441.15 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing ) [Flags changed]
  17439. 1441.15 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing ) [Flags changed]
  17440. 1441.16 s [unordered-containers] Haddock coverage:
  17441. 1441.22 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  17442. 1441.22 s [unordered-containers] Missing documentation for:
  17443. 1441.22 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  17444. 1441.22 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  17445. 1441.22 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  17446. 1441.22 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  17447. 1441.22 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  17448. 1441.22 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  17449. 1441.22 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  17450. 1441.22 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  17451. 1441.22 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  17452. 1441.22 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  17453. 1441.22 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  17454. 1441.22 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  17455. 1441.22 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  17456. 1441.22 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  17457. 1441.22 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  17458. 1441.22 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  17459. 1441.22 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  17460. 1441.22 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  17461. 1441.22 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  17462. 1441.22 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  17463. 1441.22 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  17464. 1441.22 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  17465. 1441.22 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  17466. 1441.22 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  17467. 1441.22 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  17468. 1441.22 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  17469. 1441.22 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  17470. 1441.22 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  17471. 1441.22 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  17472. 1441.22 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  17473. 1441.22 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  17474. 1441.22 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  17475. 1441.22 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  17476. 1441.22 s [unordered-containers] Missing documentation for:
  17477. 1441.22 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  17478. 1441.22 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  17479. 1441.22 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  17480. 1441.22 s [unordered-containers] Warning: 'at' is out of scope.
  17481. 1441.22 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17482. 1441.22 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  17483. 1441.22 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  17484. 1441.22 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  17485. 1441.22 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17486. 1441.22 s [unordered-containers] by specifying the type/value namespace explicitly.
  17487. 1441.22 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  17488. 1441.23 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  17489. 1441.23 s [unordered-containers] Missing documentation for:
  17490. 1441.23 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  17491. 1441.23 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  17492. 1441.23 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  17493. 1441.23 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  17494. 1441.23 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  17495. 1441.23 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  17496. 1441.23 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  17497. 1441.23 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  17498. 1441.23 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  17499. 1441.23 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  17500. 1441.23 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  17501. 1441.23 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  17502. 1441.24 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  17503. 1441.24 s [unordered-containers] Missing documentation for:
  17504. 1441.24 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  17505. 1441.24 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  17506. 1441.24 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  17507. 1441.24 s [unordered-containers] Warning: 'lookup' is out of scope.
  17508. 1441.24 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17509. 1441.24 s [unordered-containers] Warning: 'at' is out of scope.
  17510. 1441.24 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17511. 1441.24 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  17512. 1441.24 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17513. 1441.24 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17514. 1441.24 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17515. 1441.24 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17516. 1441.24 s [unordered-containers] by specifying the type/value namespace explicitly.
  17517. 1441.24 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17518. 1441.24 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  17519. 1441.25 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17520. 1441.25 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17521. 1441.25 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17522. 1441.25 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17523. 1441.25 s [unordered-containers] by specifying the type/value namespace explicitly.
  17524. 1441.25 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17525. 1441.25 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  17526. 1441.25 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  17527. 1441.25 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  17528. 1441.51 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  17529. 1441.51 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17530. 1441.52 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  17531. 1441.52 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17532. 1441.52 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  17533. 1441.52 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17534. 1441.52 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  17535. 1441.52 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17536. 1441.52 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  17537. 1441.52 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17538. 1441.53 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  17539. 1441.53 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17540. 1447.95 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers,
  17541. 1447.95 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  17542. 1448.59 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  17543. 1448.69 s [unordered-containers] Phase: installPhase
  17544. 1448.78 s [unordered-containers] Installing library in /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  17545. 1449.34 s [unordered-containers] Phase: fixupPhase
  17546. 1449.37 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1
  17547. 1449.37 s [unordered-containers] shrinking /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSunordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl-ghc9.12.2.so
  17548. 1449.39 s [unordered-containers] checking for references to /build/ in /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1...
  17549. 1449.41 s [unordered-containers] patching script interpreter paths in /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1
  17550. 1449.42 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1/lib
  17551. 1449.60 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/s1cyi6w356vnsasmzmxgg7hlvx1qck5n-unordered-containers-0.2.20.1-doc
  17552. 1449.61 s [unordered-containers] checking for references to /build/ in /nix/store/s1cyi6w356vnsasmzmxgg7hlvx1qck5n-unordered-containers-0.2.20.1-doc...
  17553. 1449.63 s [unordered-containers] patching script interpreter paths in /nix/store/s1cyi6w356vnsasmzmxgg7hlvx1qck5n-unordered-containers-0.2.20.1-doc
  17554. 1449.77 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1 /nix/store/s1cyi6w356vnsasmzmxgg7hlvx1qck5n-unordered-containers-0.2.20.1-doc
  17555. 1450.24 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  17556. 1450.26 s [post-build-hook] Uploading to the NixCI cache: /nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1 /nix/store/s1cyi6w356vnsasmzmxgg7hlvx1qck5n-unordered-containers-0.2.20.1-doc
  17557. 1450.32 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17558. 1450.46 s [post-build-hook] copying 1 paths...
  17559. 1450.46 s [post-build-hook] copying path '/nix/store/56l46qg0dhlph7fs2ckclgr6r2w213i2-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  17560. 1453.90 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17561. 1454.03 s [post-build-hook] copying 0 paths...
  17562. 1454.07 s Progress: 11 of 19 built, 165 of 165 downloaded from cache
  17563. 1454.11 s Building quickcheck-instances
  17564. 1454.26 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  17565. 1454.26 s [quickcheck-instances] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  17566. 1454.54 s [quickcheck-instances] Phase: unpackPhase
  17567. 1454.54 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  17568. 1454.55 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  17569. 1454.55 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  17570. 1454.56 s [quickcheck-instances] Phase: patchPhase
  17571. 1454.56 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  17572. 1454.57 s [quickcheck-instances] Phase: compileBuildDriverPhase
  17573. 1454.58 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.UYZs6P9D4m/setup-package.conf.d -threaded
  17574. 1454.63 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.UYZs6P9D4m/Main.o )
  17575. 1454.69 s [quickcheck-instances] [2 of 2] Linking Setup
  17576. 1456.27 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  17577. 1456.34 s [quickcheck-instances] Phase: configurePhase
  17578. 1456.35 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/0hr0jhgqngjspajzb1dy2dll6db2ay9r-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.UYZs6P9D4m/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  17579. 1456.36 s [quickcheck-instances] Using Parsec parser
  17580. 1456.36 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  17581. 1456.41 s [quickcheck-instances] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  17582. 1456.41 s [quickcheck-instances] 'ghc' version < 9.12):
  17583. 1456.41 s [quickcheck-instances] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  17584. 1456.41 s [quickcheck-instances] 9.12.2
  17585. 1457.22 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  17586. 1457.22 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  17587. 1457.22 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  17588. 1457.22 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.21.0.0
  17589. 1457.22 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  17590. 1457.22 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  17591. 1457.22 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  17592. 1457.22 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  17593. 1457.22 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  17594. 1457.22 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  17595. 1457.22 s [quickcheck-instances] integer-logarithms-1.0.4
  17596. 1457.22 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  17597. 1457.22 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  17598. 1457.22 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  17599. 1457.22 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  17600. 1457.22 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  17601. 1457.22 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  17602. 1457.22 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
  17603. 1457.22 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  17604. 1457.22 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  17605. 1457.22 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  17606. 1457.22 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.2
  17607. 1457.22 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  17608. 1457.22 s [quickcheck-instances] unordered-containers-0.2.20.1
  17609. 1457.22 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  17610. 1457.22 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  17611. 1457.22 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  17612. 1457.22 s [quickcheck-instances] Dependency base: using base-4.21.0.0
  17613. 1457.22 s [quickcheck-instances] Dependency containers: using containers-0.7
  17614. 1457.22 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  17615. 1457.22 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  17616. 1457.22 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  17617. 1457.22 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  17618. 1457.22 s [quickcheck-instances] Source component graph:
  17619. 1457.22 s [quickcheck-instances] component lib
  17620. 1457.22 s [quickcheck-instances] component test:self-test dependency lib
  17621. 1457.22 s [quickcheck-instances] Configured component graph:
  17622. 1457.22 s [quickcheck-instances] component quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17623. 1457.22 s [quickcheck-instances] include OneTuple-0.4.2-4rkNJpKmQW52lJEHCmGFCc
  17624. 1457.22 s [quickcheck-instances] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  17625. 1457.22 s [quickcheck-instances] include array-0.5.8.0-afbe
  17626. 1457.22 s [quickcheck-instances] include base-4.21.0.0-d2ce
  17627. 1457.22 s [quickcheck-instances] include bytestring-0.12.2.0-19c8
  17628. 1457.22 s [quickcheck-instances] include case-insensitive-1.2.1.0-Iol0bHug5iBJ1MXg3tBqUd
  17629. 1457.22 s [quickcheck-instances] include containers-0.7-0a77
  17630. 1457.22 s [quickcheck-instances] include data-fix-0.3.4-HSpPc7DsJbRDzlUacSg60C
  17631. 1457.22 s [quickcheck-instances] include hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  17632. 1457.22 s [quickcheck-instances] include integer-logarithms-1.0.4-7YAQXB5e9RWG16XdnkdQ25
  17633. 1457.22 s [quickcheck-instances] include old-time-1.1.0.4-6m7p5sgSatD7sTbuWkGJR4
  17634. 1457.22 s [quickcheck-instances] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  17635. 1457.22 s [quickcheck-instances] include scientific-0.3.8.0-CGFInp5qHCF1KlUg8DUtWM
  17636. 1457.22 s [quickcheck-instances] include splitmix-0.1.3.1-Co9x079GIoR78gRv8km3rX
  17637. 1457.22 s [quickcheck-instances] include strict-0.5.1-6PmLv8dcH3NFMmomrI0Pzg
  17638. 1457.22 s [quickcheck-instances] include tagged-0.8.9-6TMBpzQgruiFFIV80Ds7xw
  17639. 1457.22 s [quickcheck-instances] include text-2.1.2-783a
  17640. 1457.22 s [quickcheck-instances] include text-short-0.1.6-CvDdOucsx4hAe39NhhphJD
  17641. 1457.22 s [quickcheck-instances] include these-1.2.1-ZkHeapfzu4D0csj8ZYNG0
  17642. 1457.22 s [quickcheck-instances] include time-compat-1.9.8-3sHRSuK7oVGDDfnxOgZqdF
  17643. 1457.22 s [quickcheck-instances] include transformers-0.6.1.2-c2d4
  17644. 1457.22 s [quickcheck-instances] include unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  17645. 1457.22 s [quickcheck-instances] include uuid-types-1.0.6-CEox557p9Dw1A3PTMDWUF2
  17646. 1457.22 s [quickcheck-instances] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  17647. 1457.22 s [quickcheck-instances] component quickcheck-instances-0.3.33-705QjHhES8p5WU54dixRXo-self-test
  17648. 1457.22 s [quickcheck-instances] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  17649. 1457.22 s [quickcheck-instances] include base-4.21.0.0-d2ce
  17650. 1457.22 s [quickcheck-instances] include containers-0.7-0a77
  17651. 1457.22 s [quickcheck-instances] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  17652. 1457.22 s [quickcheck-instances] include quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17653. 1457.22 s [quickcheck-instances] include tagged-0.8.9-6TMBpzQgruiFFIV80Ds7xw
  17654. 1457.22 s [quickcheck-instances] include uuid-types-1.0.6-CEox557p9Dw1A3PTMDWUF2
  17655. 1457.22 s [quickcheck-instances] Linked component graph:
  17656. 1457.22 s [quickcheck-instances] unit quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17657. 1457.22 s [quickcheck-instances] include OneTuple-0.4.2-4rkNJpKmQW52lJEHCmGFCc
  17658. 1457.22 s [quickcheck-instances] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  17659. 1457.22 s [quickcheck-instances] include array-0.5.8.0-afbe
  17660. 1457.22 s [quickcheck-instances] include base-4.21.0.0-d2ce
  17661. 1457.22 s [quickcheck-instances] include bytestring-0.12.2.0-19c8
  17662. 1457.22 s [quickcheck-instances] include case-insensitive-1.2.1.0-Iol0bHug5iBJ1MXg3tBqUd
  17663. 1457.22 s [quickcheck-instances] include containers-0.7-0a77
  17664. 1457.22 s [quickcheck-instances] include data-fix-0.3.4-HSpPc7DsJbRDzlUacSg60C
  17665. 1457.22 s [quickcheck-instances] include hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  17666. 1457.22 s [quickcheck-instances] include integer-logarithms-1.0.4-7YAQXB5e9RWG16XdnkdQ25
  17667. 1457.22 s [quickcheck-instances] include old-time-1.1.0.4-6m7p5sgSatD7sTbuWkGJR4
  17668. 1457.22 s [quickcheck-instances] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  17669. 1457.22 s [quickcheck-instances] include scientific-0.3.8.0-CGFInp5qHCF1KlUg8DUtWM
  17670. 1457.22 s [quickcheck-instances] include splitmix-0.1.3.1-Co9x079GIoR78gRv8km3rX
  17671. 1457.22 s [quickcheck-instances] include strict-0.5.1-6PmLv8dcH3NFMmomrI0Pzg
  17672. 1457.22 s [quickcheck-instances] include tagged-0.8.9-6TMBpzQgruiFFIV80Ds7xw
  17673. 1457.22 s [quickcheck-instances] include text-2.1.2-783a
  17674. 1457.22 s [quickcheck-instances] include text-short-0.1.6-CvDdOucsx4hAe39NhhphJD
  17675. 1457.22 s [quickcheck-instances] include these-1.2.1-ZkHeapfzu4D0csj8ZYNG0
  17676. 1457.22 s [quickcheck-instances] include time-compat-1.9.8-3sHRSuK7oVGDDfnxOgZqdF
  17677. 1457.22 s [quickcheck-instances] include transformers-0.6.1.2-c2d4
  17678. 1457.22 s [quickcheck-instances] include unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  17679. 1457.22 s [quickcheck-instances] include uuid-types-1.0.6-CEox557p9Dw1A3PTMDWUF2
  17680. 1457.22 s [quickcheck-instances] include vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  17681. 1457.22 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB:Test.QuickCheck.Instances.Void
  17682. 1457.22 s [quickcheck-instances] unit quickcheck-instances-0.3.33-705QjHhES8p5WU54dixRXo-self-test
  17683. 1457.26 s [quickcheck-instances] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  17684. 1457.26 s [quickcheck-instances] include base-4.21.0.0-d2ce
  17685. 1457.26 s [quickcheck-instances] include containers-0.7-0a77
  17686. 1457.26 s [quickcheck-instances] include primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  17687. 1457.26 s [quickcheck-instances] include quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17688. 1457.26 s [quickcheck-instances] include tagged-0.8.9-6TMBpzQgruiFFIV80Ds7xw
  17689. 1457.26 s [quickcheck-instances] include uuid-types-1.0.6-CEox557p9Dw1A3PTMDWUF2
  17690. 1457.26 s [quickcheck-instances] Ready component graph:
  17691. 1457.26 s [quickcheck-instances] definite quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17692. 1457.26 s [quickcheck-instances] depends OneTuple-0.4.2-4rkNJpKmQW52lJEHCmGFCc
  17693. 1457.26 s [quickcheck-instances] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  17694. 1457.26 s [quickcheck-instances] depends array-0.5.8.0-afbe
  17695. 1457.26 s [quickcheck-instances] depends base-4.21.0.0-d2ce
  17696. 1457.26 s [quickcheck-instances] depends bytestring-0.12.2.0-19c8
  17697. 1457.26 s [quickcheck-instances] depends case-insensitive-1.2.1.0-Iol0bHug5iBJ1MXg3tBqUd
  17698. 1457.26 s [quickcheck-instances] depends containers-0.7-0a77
  17699. 1457.26 s [quickcheck-instances] depends data-fix-0.3.4-HSpPc7DsJbRDzlUacSg60C
  17700. 1457.26 s [quickcheck-instances] depends hashable-1.5.0.0-Hm0noHDcu9RADN1OEYDtCC
  17701. 1457.26 s [quickcheck-instances] depends integer-logarithms-1.0.4-7YAQXB5e9RWG16XdnkdQ25
  17702. 1457.26 s [quickcheck-instances] depends old-time-1.1.0.4-6m7p5sgSatD7sTbuWkGJR4
  17703. 1457.26 s [quickcheck-instances] depends primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  17704. 1457.26 s [quickcheck-instances] depends scientific-0.3.8.0-CGFInp5qHCF1KlUg8DUtWM
  17705. 1457.26 s [quickcheck-instances] depends splitmix-0.1.3.1-Co9x079GIoR78gRv8km3rX
  17706. 1457.26 s [quickcheck-instances] depends strict-0.5.1-6PmLv8dcH3NFMmomrI0Pzg
  17707. 1457.26 s [quickcheck-instances] depends tagged-0.8.9-6TMBpzQgruiFFIV80Ds7xw
  17708. 1457.26 s [quickcheck-instances] depends text-2.1.2-783a
  17709. 1457.26 s [quickcheck-instances] depends text-short-0.1.6-CvDdOucsx4hAe39NhhphJD
  17710. 1457.26 s [quickcheck-instances] depends these-1.2.1-ZkHeapfzu4D0csj8ZYNG0
  17711. 1457.26 s [quickcheck-instances] depends time-compat-1.9.8-3sHRSuK7oVGDDfnxOgZqdF
  17712. 1457.26 s [quickcheck-instances] depends transformers-0.6.1.2-c2d4
  17713. 1457.26 s [quickcheck-instances] depends unordered-containers-0.2.20.1-DnsMIhhb3xNFYZCrtciCyl
  17714. 1457.26 s [quickcheck-instances] depends uuid-types-1.0.6-CEox557p9Dw1A3PTMDWUF2
  17715. 1457.26 s [quickcheck-instances] depends vector-0.13.2.0-Fdhm8vjEqE07K59HN7lQjL
  17716. 1457.26 s [quickcheck-instances] definite quickcheck-instances-0.3.33-705QjHhES8p5WU54dixRXo-self-test
  17717. 1457.26 s [quickcheck-instances] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  17718. 1457.26 s [quickcheck-instances] depends base-4.21.0.0-d2ce
  17719. 1457.26 s [quickcheck-instances] depends containers-0.7-0a77
  17720. 1457.26 s [quickcheck-instances] depends primitive-0.9.1.0-8Y2nPDgNTGbAC1V2Bod1nm
  17721. 1457.26 s [quickcheck-instances] depends quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17722. 1457.26 s [quickcheck-instances] depends tagged-0.8.9-6TMBpzQgruiFFIV80Ds7xw
  17723. 1457.26 s [quickcheck-instances] depends uuid-types-1.0.6-CEox557p9Dw1A3PTMDWUF2
  17724. 1457.26 s [quickcheck-instances] Using Cabal-3.14.1.0 compiled by ghc-9.12
  17725. 1457.26 s [quickcheck-instances] Using compiler: ghc-9.12.2
  17726. 1457.26 s [quickcheck-instances] Using install prefix:
  17727. 1457.26 s [quickcheck-instances] /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33
  17728. 1457.26 s [quickcheck-instances] Executables installed in:
  17729. 1457.26 s [quickcheck-instances] /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/bin
  17730. 1457.26 s [quickcheck-instances] Libraries installed in:
  17731. 1457.26 s [quickcheck-instances] /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17732. 1457.26 s [quickcheck-instances] Dynamic Libraries installed in:
  17733. 1457.26 s [quickcheck-instances] /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  17734. 1457.26 s [quickcheck-instances] Private executables installed in:
  17735. 1457.26 s [quickcheck-instances] /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.12.2-e4b2/quickcheck-instances-0.3.33
  17736. 1457.26 s [quickcheck-instances] Data files installed in:
  17737. 1457.26 s [quickcheck-instances] /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.12.2-e4b2/quickcheck-instances-0.3.33
  17738. 1457.26 s [quickcheck-instances] Documentation installed in:
  17739. 1457.26 s [quickcheck-instances] /nix/store/0hr0jhgqngjspajzb1dy2dll6db2ay9r-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  17740. 1457.26 s [quickcheck-instances] Configuration files installed in:
  17741. 1457.26 s [quickcheck-instances] /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/etc
  17742. 1457.26 s [quickcheck-instances] No alex found
  17743. 1457.26 s [quickcheck-instances] Using ar found on system at:
  17744. 1457.26 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  17745. 1457.26 s [quickcheck-instances] No c2hs found
  17746. 1457.26 s [quickcheck-instances] No cpphs found
  17747. 1457.26 s [quickcheck-instances] No doctest found
  17748. 1457.26 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  17749. 1457.26 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  17750. 1457.26 s [quickcheck-instances] Using ghc version 9.12.2 found on system at:
  17751. 1457.26 s [quickcheck-instances] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  17752. 1457.26 s [quickcheck-instances] Using ghc-pkg version 9.12.2 found on system at:
  17753. 1457.26 s [quickcheck-instances] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  17754. 1457.26 s [quickcheck-instances] No ghcjs found
  17755. 1457.26 s [quickcheck-instances] No ghcjs-pkg found
  17756. 1457.26 s [quickcheck-instances] No greencard found
  17757. 1457.26 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  17758. 1457.26 s [quickcheck-instances] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  17759. 1457.26 s [quickcheck-instances] No happy found
  17760. 1457.26 s [quickcheck-instances] No haskell-suite found
  17761. 1457.26 s [quickcheck-instances] No haskell-suite-pkg found
  17762. 1457.26 s [quickcheck-instances] No hmake found
  17763. 1457.26 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  17764. 1457.26 s [quickcheck-instances] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  17765. 1457.26 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  17766. 1457.26 s [quickcheck-instances] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  17767. 1457.26 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  17768. 1457.26 s [quickcheck-instances] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  17769. 1457.26 s [quickcheck-instances] No jhc found
  17770. 1457.26 s [quickcheck-instances] Using ld found on system at:
  17771. 1457.26 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  17772. 1457.26 s [quickcheck-instances] No pkg-config found
  17773. 1457.26 s [quickcheck-instances] Using runghc version 9.12.2 found on system at:
  17774. 1457.26 s [quickcheck-instances] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  17775. 1457.26 s [quickcheck-instances] Using strip version 2.44 found on system at:
  17776. 1457.26 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  17777. 1457.26 s [quickcheck-instances] Using tar found on system at:
  17778. 1457.26 s [quickcheck-instances] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  17779. 1457.26 s [quickcheck-instances] No uhc found
  17780. 1457.40 s [quickcheck-instances] Phase: buildPhase
  17781. 1457.46 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  17782. 1457.48 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  17783. 1457.61 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 )
  17784. 1457.66 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 )
  17785. 1457.94 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 )
  17786. 1458.03 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 )
  17787. 1458.20 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 )
  17788. 1458.21 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 )
  17789. 1458.21 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 )
  17790. 1458.21 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 )
  17791. 1458.21 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 )
  17792. 1458.21 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 )
  17793. 1458.21 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 )
  17794. 1458.21 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 )
  17795. 1458.21 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 )
  17796. 1458.21 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 )
  17797. 1458.21 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 )
  17798. 1458.37 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 )
  17799. 1458.37 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 )
  17800. 1458.37 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 )
  17801. 1458.37 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 )
  17802. 1458.37 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 )
  17803. 1458.77 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 )
  17804. 1458.77 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 )
  17805. 1458.77 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 )
  17806. 1458.77 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 )
  17807. 1458.77 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 )
  17808. 1458.77 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 )
  17809. 1459.15 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 )
  17810. 1459.32 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 )
  17811. 1459.77 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 )
  17812. 1460.05 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 )
  17813. 1460.15 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 )
  17814. 1460.17 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 )
  17815. 1460.17 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 )
  17816. 1460.17 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 )
  17817. 1460.17 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 )
  17818. 1460.17 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 )
  17819. 1460.17 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 )
  17820. 1460.17 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 )
  17821. 1460.17 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 )
  17822. 1460.17 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 )
  17823. 1460.17 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 )
  17824. 1460.17 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 )
  17825. 1460.17 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 )
  17826. 1460.17 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 )
  17827. 1460.17 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 )
  17828. 1460.17 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 )
  17829. 1460.49 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 )
  17830. 1460.49 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 )
  17831. 1460.49 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 )
  17832. 1460.49 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 )
  17833. 1460.49 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 )
  17834. 1460.49 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  17835. 1462.48 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  17836. 1462.48 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  17837. 1462.54 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  17838. 1462.89 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  17839. 1463.59 s [quickcheck-instances] Phase: checkPhase
  17840. 1463.87 s [quickcheck-instances] Running 1 test suites...
  17841. 1463.87 s [quickcheck-instances] Test suite self-test: RUNNING...
  17842. 1463.88 s [quickcheck-instances] +++ OK, passed 100 tests.
  17843. 1463.88 s [quickcheck-instances] +++ OK, passed 100 tests.
  17844. 1463.88 s [quickcheck-instances] +++ OK, passed 100 tests.
  17845. 1463.88 s [quickcheck-instances] +++ OK, passed 100 tests.
  17846. 1463.88 s [quickcheck-instances] +++ OK, passed 100 tests.
  17847. 1463.89 s [quickcheck-instances] Test suite self-test: PASS
  17848. 1463.89 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  17849. 1463.89 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  17850. 1463.89 s [quickcheck-instances] Phase: haddockPhase
  17851. 1464.51 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  17852. 1464.52 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  17853. 1464.56 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  17854. 1464.56 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  17855. 1464.79 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing ) [HIE file is missing]
  17856. 1464.81 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing ) [HIE file is missing]
  17857. 1464.83 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing ) [HIE file is missing]
  17858. 1464.94 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing ) [HIE file is missing]
  17859. 1464.97 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing ) [HIE file is missing]
  17860. 1464.99 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing ) [HIE file is missing]
  17861. 1465.00 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing ) [HIE file is missing]
  17862. 1465.01 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing ) [HIE file is missing]
  17863. 1465.02 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing ) [HIE file is missing]
  17864. 1465.10 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing ) [HIE file is missing]
  17865. 1465.13 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing ) [HIE file is missing]
  17866. 1465.13 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing ) [HIE file is missing]
  17867. 1465.13 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing ) [HIE file is missing]
  17868. 1465.15 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing ) [HIE file is missing]
  17869. 1465.16 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing ) [HIE file is missing]
  17870. 1465.19 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing ) [HIE file is missing]
  17871. 1465.20 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing ) [HIE file is missing]
  17872. 1465.21 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing ) [HIE file is missing]
  17873. 1465.22 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing ) [HIE file is missing]
  17874. 1465.23 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing ) [HIE file is missing]
  17875. 1465.30 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing ) [HIE file is missing]
  17876. 1465.42 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing ) [HIE file is missing]
  17877. 1465.43 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing ) [HIE file is missing]
  17878. 1465.44 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing ) [HIE file is missing]
  17879. 1465.49 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing ) [HIE file is missing]
  17880. 1465.49 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing ) [HIE file is missing]
  17881. 1465.49 s [quickcheck-instances] Haddock coverage:
  17882. 1465.50 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  17883. 1465.50 s [quickcheck-instances] Missing documentation for:
  17884. 1465.50 s [quickcheck-instances] Module header
  17885. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  17886. 1465.70 s [quickcheck-instances] Missing documentation for:
  17887. 1465.70 s [quickcheck-instances] Module header
  17888. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  17889. 1465.70 s [quickcheck-instances] Missing documentation for:
  17890. 1465.70 s [quickcheck-instances] Module header
  17891. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  17892. 1465.70 s [quickcheck-instances] Missing documentation for:
  17893. 1465.70 s [quickcheck-instances] Module header
  17894. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  17895. 1465.70 s [quickcheck-instances] Missing documentation for:
  17896. 1465.70 s [quickcheck-instances] Module header
  17897. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  17898. 1465.70 s [quickcheck-instances] Missing documentation for:
  17899. 1465.70 s [quickcheck-instances] Module header
  17900. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  17901. 1465.70 s [quickcheck-instances] Missing documentation for:
  17902. 1465.70 s [quickcheck-instances] Module header
  17903. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  17904. 1465.70 s [quickcheck-instances] Missing documentation for:
  17905. 1465.70 s [quickcheck-instances] Module header
  17906. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  17907. 1465.70 s [quickcheck-instances] Missing documentation for:
  17908. 1465.70 s [quickcheck-instances] Module header
  17909. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  17910. 1465.70 s [quickcheck-instances] Missing documentation for:
  17911. 1465.70 s [quickcheck-instances] Module header
  17912. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  17913. 1465.70 s [quickcheck-instances] Missing documentation for:
  17914. 1465.70 s [quickcheck-instances] Module header
  17915. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  17916. 1465.70 s [quickcheck-instances] Missing documentation for:
  17917. 1465.70 s [quickcheck-instances] Module header
  17918. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  17919. 1465.70 s [quickcheck-instances] Missing documentation for:
  17920. 1465.70 s [quickcheck-instances] Module header
  17921. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  17922. 1465.70 s [quickcheck-instances] Missing documentation for:
  17923. 1465.70 s [quickcheck-instances] Module header
  17924. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  17925. 1465.70 s [quickcheck-instances] Missing documentation for:
  17926. 1465.70 s [quickcheck-instances] Module header
  17927. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  17928. 1465.70 s [quickcheck-instances] Missing documentation for:
  17929. 1465.70 s [quickcheck-instances] Module header
  17930. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  17931. 1465.70 s [quickcheck-instances] Missing documentation for:
  17932. 1465.70 s [quickcheck-instances] Module header
  17933. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  17934. 1465.70 s [quickcheck-instances] Missing documentation for:
  17935. 1465.70 s [quickcheck-instances] Module header
  17936. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  17937. 1465.70 s [quickcheck-instances] Missing documentation for:
  17938. 1465.70 s [quickcheck-instances] Module header
  17939. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  17940. 1465.70 s [quickcheck-instances] Missing documentation for:
  17941. 1465.70 s [quickcheck-instances] Module header
  17942. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  17943. 1465.70 s [quickcheck-instances] Missing documentation for:
  17944. 1465.70 s [quickcheck-instances] Module header
  17945. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  17946. 1465.70 s [quickcheck-instances] Missing documentation for:
  17947. 1465.70 s [quickcheck-instances] Module header
  17948. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  17949. 1465.70 s [quickcheck-instances] Missing documentation for:
  17950. 1465.70 s [quickcheck-instances] Module header
  17951. 1465.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  17952. 1465.70 s [quickcheck-instances] Missing documentation for:
  17953. 1465.70 s [quickcheck-instances] Module header
  17954. 1465.71 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  17955. 1466.11 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  17956. 1466.11 s [quickcheck-instances] - Data.Vector.Vector
  17957. 1466.11 s [quickcheck-instances] - Data.Vector.Strict.Vector
  17958. 1466.11 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  17959. 1466.11 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  17960. 1466.11 s [quickcheck-instances] - Data.Vector.Storable.Vector
  17961. 1466.11 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  17962. 1471.31 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances,
  17963. 1471.31 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  17964. 1471.91 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  17965. 1471.99 s [quickcheck-instances] Phase: installPhase
  17966. 1472.04 s [quickcheck-instances] Installing library in /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  17967. 1472.56 s [quickcheck-instances] Phase: fixupPhase
  17968. 1472.58 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33
  17969. 1472.60 s [quickcheck-instances] shrinking /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSquickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB-ghc9.12.2.so
  17970. 1472.61 s [quickcheck-instances] checking for references to /build/ in /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33...
  17971. 1472.65 s [quickcheck-instances] patching script interpreter paths in /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33
  17972. 1472.66 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33/lib
  17973. 1472.83 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/0hr0jhgqngjspajzb1dy2dll6db2ay9r-quickcheck-instances-0.3.33-doc
  17974. 1472.84 s [quickcheck-instances] checking for references to /build/ in /nix/store/0hr0jhgqngjspajzb1dy2dll6db2ay9r-quickcheck-instances-0.3.33-doc...
  17975. 1472.86 s [quickcheck-instances] patching script interpreter paths in /nix/store/0hr0jhgqngjspajzb1dy2dll6db2ay9r-quickcheck-instances-0.3.33-doc
  17976. 1473.04 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/0hr0jhgqngjspajzb1dy2dll6db2ay9r-quickcheck-instances-0.3.33-doc /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33
  17977. 1473.60 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  17978. 1473.62 s [post-build-hook] Uploading to the NixCI cache: /nix/store/0hr0jhgqngjspajzb1dy2dll6db2ay9r-quickcheck-instances-0.3.33-doc /nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33
  17979. 1473.67 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17980. 1473.78 s [post-build-hook] copying 1 paths...
  17981. 1473.78 s [post-build-hook] copying path '/nix/store/p56xb83bq67dd24p9zbjp9j1nylfzis4-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  17982. 1475.57 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17983. 1475.75 s [post-build-hook] copying 0 paths...
  17984. 1475.79 s Progress: 12 of 19 built, 165 of 165 downloaded from cache
  17985. 1475.86 s Building extra
  17986. 1476.08 s [extra] Phase: setupCompilerEnvironmentPhase
  17987. 1476.08 s [extra] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  17988. 1476.31 s [extra] Phase: unpackPhase
  17989. 1476.32 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  17990. 1476.36 s [extra] source root is extra-1.8.1
  17991. 1476.36 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  17992. 1476.36 s [extra] Phase: patchPhase
  17993. 1476.36 s [extra] Phase: compileBuildDriverPhase
  17994. 1476.36 s [extra] setupCompileFlags: -package-db=/build/tmp.JeqALJu1MU/setup-package.conf.d -threaded
  17995. 1476.42 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.JeqALJu1MU/Main.o )
  17996. 1476.49 s [extra] [2 of 2] Linking Setup
  17997. 1477.91 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  17998. 1477.92 s [extra] Phase: configurePhase
  17999. 1477.93 s [extra] configureFlags: --verbose --prefix=/nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/0jcmagahhsay38b0gj7km795p1kh6qq2-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.JeqALJu1MU/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  18000. 1477.93 s [extra] Using Parsec parser
  18001. 1477.93 s [extra] Configuring extra-1.8.1...
  18002. 1478.00 s [extra] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  18003. 1478.00 s [extra] 'ghc' version < 9.12):
  18004. 1478.00 s [extra] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  18005. 1478.00 s [extra] 9.12.2
  18006. 1478.60 s [extra] Dependency base >=4.9 && <5: using base-4.21.0.0
  18007. 1478.60 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18008. 1478.60 s [extra] Dependency directory: using directory-1.3.9.0
  18009. 1478.60 s [extra] Dependency filepath: using filepath-1.5.4.0
  18010. 1478.60 s [extra] Dependency process: using process-1.6.25.0
  18011. 1478.60 s [extra] Dependency time: using time-1.14
  18012. 1478.60 s [extra] Dependency unix: using unix-2.8.6.0
  18013. 1478.60 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18014. 1478.60 s [extra] Dependency base >=4 && <5: using base-4.21.0.0
  18015. 1478.60 s [extra] Dependency directory: using directory-1.3.9.0
  18016. 1478.60 s [extra] Dependency extra: using extra-1.8.1
  18017. 1478.60 s [extra] Dependency filepath: using filepath-1.5.4.0
  18018. 1478.60 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18019. 1478.60 s [extra] Dependency unix: using unix-2.8.6.0
  18020. 1478.60 s [extra] Source component graph:
  18021. 1478.60 s [extra] component lib
  18022. 1478.60 s [extra] component test:extra-test dependency lib
  18023. 1478.60 s [extra] Configured component graph:
  18024. 1478.60 s [extra] component extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18025. 1478.60 s [extra] include base-4.21.0.0-d2ce
  18026. 1478.60 s [extra] include clock-0.8.4-7KuPLRgmU7H5cmBqK7oRMu
  18027. 1478.60 s [extra] include directory-1.3.9.0-7268
  18028. 1478.60 s [extra] include filepath-1.5.4.0-59d1
  18029. 1478.60 s [extra] include process-1.6.25.0-63b2
  18030. 1478.60 s [extra] include time-1.14-6b73
  18031. 1478.60 s [extra] include unix-2.8.6.0-7e3a
  18032. 1478.60 s [extra] component extra-1.8.1-1NAc1qF4FeW5uZPnVDqaL5-extra-test
  18033. 1478.60 s [extra] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  18034. 1478.60 s [extra] include base-4.21.0.0-d2ce
  18035. 1478.60 s [extra] include directory-1.3.9.0-7268
  18036. 1478.60 s [extra] include extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18037. 1478.60 s [extra] include filepath-1.5.4.0-59d1
  18038. 1478.60 s [extra] include quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  18039. 1478.60 s [extra] include unix-2.8.6.0-7e3a
  18040. 1478.60 s [extra] Linked component graph:
  18041. 1478.60 s [extra] unit extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18042. 1478.60 s [extra] include base-4.21.0.0-d2ce
  18043. 1478.60 s [extra] include clock-0.8.4-7KuPLRgmU7H5cmBqK7oRMu
  18044. 1478.60 s [extra] include directory-1.3.9.0-7268
  18045. 1478.60 s [extra] include filepath-1.5.4.0-59d1
  18046. 1478.60 s [extra] include process-1.6.25.0-63b2
  18047. 1478.60 s [extra] include time-1.14-6b73
  18048. 1478.60 s [extra] include unix-2.8.6.0-7e3a
  18049. 1478.60 s [extra] Control.Concurrent.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Data.Version.Extra,Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Extra,Numeric.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Numeric.Extra,System.Directory.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:System.Environment.Extra,System.IO.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:System.IO.Extra,System.Info.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:System.Info.Extra,System.Process.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:System.Process.Extra,System.Time.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:System.Time.Extra,Text.Read.Extra=extra-1.8.1-4BnzJI39thT3T2fi96Q59I:Text.Read.Extra
  18050. 1478.60 s [extra] unit extra-1.8.1-1NAc1qF4FeW5uZPnVDqaL5-extra-test
  18051. 1478.60 s [extra] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  18052. 1478.60 s [extra] include base-4.21.0.0-d2ce
  18053. 1478.60 s [extra] include directory-1.3.9.0-7268
  18054. 1478.60 s [extra] include extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18055. 1478.60 s [extra] include filepath-1.5.4.0-59d1
  18056. 1478.60 s [extra] include quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  18057. 1478.60 s [extra] include unix-2.8.6.0-7e3a
  18058. 1478.60 s [extra] Ready component graph:
  18059. 1478.60 s [extra] definite extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18060. 1478.60 s [extra] depends base-4.21.0.0-d2ce
  18061. 1478.60 s [extra] depends clock-0.8.4-7KuPLRgmU7H5cmBqK7oRMu
  18062. 1478.60 s [extra] depends directory-1.3.9.0-7268
  18063. 1478.60 s [extra] depends filepath-1.5.4.0-59d1
  18064. 1478.60 s [extra] depends process-1.6.25.0-63b2
  18065. 1478.60 s [extra] depends time-1.14-6b73
  18066. 1478.60 s [extra] depends unix-2.8.6.0-7e3a
  18067. 1478.60 s [extra] definite extra-1.8.1-1NAc1qF4FeW5uZPnVDqaL5-extra-test
  18068. 1478.60 s [extra] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  18069. 1478.60 s [extra] depends base-4.21.0.0-d2ce
  18070. 1478.60 s [extra] depends directory-1.3.9.0-7268
  18071. 1478.60 s [extra] depends extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18072. 1478.60 s [extra] depends filepath-1.5.4.0-59d1
  18073. 1478.60 s [extra] depends quickcheck-instances-0.3.33-F4NJtkkv5jc660D0CytSMB
  18074. 1478.60 s [extra] depends unix-2.8.6.0-7e3a
  18075. 1478.60 s [extra] Using Cabal-3.14.1.0 compiled by ghc-9.12
  18076. 1478.60 s [extra] Using compiler: ghc-9.12.2
  18077. 1478.60 s [extra] Using install prefix: /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1
  18078. 1478.60 s [extra] Executables installed in:
  18079. 1478.60 s [extra] /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/bin
  18080. 1478.60 s [extra] Libraries installed in:
  18081. 1478.60 s [extra] /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18082. 1478.60 s [extra] Dynamic Libraries installed in:
  18083. 1478.60 s [extra] /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  18084. 1478.60 s [extra] Private executables installed in:
  18085. 1478.60 s [extra] /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/libexec/x86_64-linux-ghc-9.12.2-e4b2/extra-1.8.1
  18086. 1478.60 s [extra] Data files installed in:
  18087. 1478.60 s [extra] /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/share/x86_64-linux-ghc-9.12.2-e4b2/extra-1.8.1
  18088. 1478.60 s [extra] Documentation installed in:
  18089. 1478.60 s [extra] /nix/store/0jcmagahhsay38b0gj7km795p1kh6qq2-extra-1.8.1-doc/share/doc/extra-1.8.1
  18090. 1478.60 s [extra] Configuration files installed in:
  18091. 1478.60 s [extra] /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/etc
  18092. 1478.60 s [extra] No alex found
  18093. 1478.60 s [extra] Using ar found on system at:
  18094. 1478.60 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  18095. 1478.60 s [extra] No c2hs found
  18096. 1478.60 s [extra] No cpphs found
  18097. 1478.60 s [extra] No doctest found
  18098. 1478.60 s [extra] Using gcc version 14.3.0 given by user at:
  18099. 1478.60 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  18100. 1478.60 s [extra] Using ghc version 9.12.2 found on system at:
  18101. 1478.60 s [extra] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  18102. 1478.60 s [extra] Using ghc-pkg version 9.12.2 found on system at:
  18103. 1478.60 s [extra] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  18104. 1478.60 s [extra] No ghcjs found
  18105. 1478.60 s [extra] No ghcjs-pkg found
  18106. 1478.60 s [extra] No greencard found
  18107. 1478.60 s [extra] Using haddock version 2.30.0 found on system at:
  18108. 1478.60 s [extra] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  18109. 1478.60 s [extra] No happy found
  18110. 1478.60 s [extra] No haskell-suite found
  18111. 1478.60 s [extra] No haskell-suite-pkg found
  18112. 1478.60 s [extra] No hmake found
  18113. 1478.60 s [extra] Using hpc version 0.69 found on system at:
  18114. 1478.60 s [extra] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  18115. 1478.60 s [extra] Using hsc2hs version 0.68.10 found on system at:
  18116. 1478.60 s [extra] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  18117. 1478.60 s [extra] Using hscolour version 1.25 found on system at:
  18118. 1478.60 s [extra] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  18119. 1478.60 s [extra] No jhc found
  18120. 1478.60 s [extra] Using ld found on system at:
  18121. 1478.60 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  18122. 1478.60 s [extra] No pkg-config found
  18123. 1478.60 s [extra] Using runghc version 9.12.2 found on system at:
  18124. 1478.60 s [extra] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  18125. 1478.60 s [extra] Using strip version 2.44 found on system at:
  18126. 1478.60 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  18127. 1478.60 s [extra] Using tar found on system at:
  18128. 1478.60 s [extra] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  18129. 1478.60 s [extra] No uhc found
  18130. 1478.76 s [extra] Phase: buildPhase
  18131. 1478.85 s [extra] Preprocessing library for extra-1.8.1...
  18132. 1478.86 s [extra] Building library for extra-1.8.1...
  18133. 1479.17 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 )
  18134. 1479.34 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 )
  18135. 1479.34 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 )
  18136. 1479.34 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 )
  18137. 1479.34 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18138. 1479.34 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18139. 1479.34 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 )
  18140. 1480.39 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 )
  18141. 1480.46 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 )
  18142. 1480.58 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 )
  18143. 1480.58 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 )
  18144. 1480.58 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 )
  18145. 1480.89 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 )
  18146. 1481.00 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 )
  18147. 1481.18 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 )
  18148. 1481.18 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 )
  18149. 1481.18 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 )
  18150. 1481.37 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 )
  18151. 1481.45 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 )
  18152. 1481.45 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 )
  18153. 1481.45 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18154. 1481.51 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 )
  18155. 1481.94 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18156. 1482.14 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18157. 1482.14 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18158. 1482.18 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18159. 1482.18 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18160. 1482.18 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18161. 1482.18 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18162. 1483.17 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18163. 1483.34 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18164. 1483.40 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18165. 1483.40 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18166. 1483.40 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18167. 1483.70 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18168. 1483.89 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18169. 1484.01 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18170. 1484.01 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18171. 1484.01 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18172. 1484.29 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18173. 1484.29 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18174. 1484.43 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18175. 1484.43 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18176. 1484.58 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18177. 1486.20 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  18178. 1486.20 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  18179. 1486.28 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18180. 1486.66 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18181. 1490.87 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18182. 1490.92 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18183. 1491.17 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18184. 1492.02 s [extra] Phase: checkPhase
  18185. 1492.30 s [extra] Running 1 test suites...
  18186. 1492.30 s [extra] Test suite extra-test: RUNNING...
  18187. 1492.31 s [extra] withTempFile
  18188. 1492.31 s [extra] +++ OK, passed 100 tests.
  18189. 1492.31 s [extra] captureOutput
  18190. 1492.31 s [extra] +++ OK, passed 100 tests.
  18191. 1492.31 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18192. 1492.34 s [extra] +++ OK, passed 100 tests.
  18193. 1492.34 s [extra] \(x :: IO Int) -> join (once x) == x
  18194. 1492.37 s [extra] +++ OK, passed 100 tests.
  18195. 1492.37 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18196. 1492.39 s [extra] +++ OK, passed 100 tests.
  18197. 1492.39 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18198. 1492.45 s [extra] +++ OK, passed 100 tests.
  18199. 1492.45 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18200. 1492.47 s [extra] +++ OK, passed 100 tests.
  18201. 1492.47 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18202. 1492.50 s [extra] +++ OK, passed 100 tests.
  18203. 1492.50 s [extra] stringException "test" == pure "test"
  18204. 1492.50 s [extra] +++ OK, passed 100 tests.
  18205. 1492.50 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18206. 1492.50 s [extra] +++ OK, passed 100 tests.
  18207. 1492.50 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18208. 1492.50 s [extra] +++ OK, passed 100 tests.
  18209. 1492.50 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18210. 1492.50 s [extra] +++ OK, passed 100 tests.
  18211. 1492.50 s [extra] ignore (print 1) == print 1
  18212. 1492.50 s [extra] +++ OK, passed 100 tests.
  18213. 1492.50 s [extra] ignore (fail "die") == pure ()
  18214. 1492.50 s [extra] +++ OK, passed 100 tests.
  18215. 1492.50 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18216. 1492.50 s [extra] +++ OK, passed 100 tests.
  18217. 1492.50 s [extra] seq (errorIO "foo") (print 1) == print 1
  18218. 1492.50 s [extra] +++ OK, passed 100 tests.
  18219. 1492.50 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18220. 1492.50 s [extra] +++ OK, passed 100 tests.
  18221. 1492.50 s [extra] seq (assertIO False) (print 1) == print 1
  18222. 1492.50 s [extra] +++ OK, passed 100 tests.
  18223. 1492.50 s [extra] retry 1 (print "x") == print "x"
  18224. 1492.50 s [extra] +++ OK, passed 100 tests.
  18225. 1492.50 s [extra] retry 3 (fail "die") == fail "die"
  18226. 1492.51 s [extra] +++ OK, passed 100 tests.
  18227. 1492.51 s [extra] whenJust Nothing print == pure ()
  18228. 1492.51 s [extra] +++ OK, passed 100 tests.
  18229. 1492.51 s [extra] whenJust (Just 1) print == print 1
  18230. 1492.51 s [extra] +++ OK, passed 100 tests.
  18231. 1492.51 s [extra] pureIf @Maybe True 5 == Just 5
  18232. 1492.51 s [extra] +++ OK, passed 100 tests.
  18233. 1492.51 s [extra] pureIf @Maybe False 5 == Nothing
  18234. 1492.51 s [extra] +++ OK, passed 100 tests.
  18235. 1492.51 s [extra] pureIf @[] True 5 == [5]
  18236. 1492.51 s [extra] +++ OK, passed 100 tests.
  18237. 1492.51 s [extra] pureIf @[] False 5 == []
  18238. 1492.51 s [extra] +++ OK, passed 100 tests.
  18239. 1492.51 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18240. 1492.51 s [extra] +++ OK, passed 100 tests.
  18241. 1492.51 s [extra] whenMaybe False (print 1) == pure Nothing
  18242. 1492.51 s [extra] +++ OK, passed 100 tests.
  18243. 1492.51 s [extra] \(x :: Maybe ()) -> unit x == x
  18244. 1492.51 s [extra] +++ OK, passed 100 tests.
  18245. 1492.51 s [extra] guarded even 2 == [2]
  18246. 1492.51 s [extra] +++ OK, passed 100 tests.
  18247. 1492.51 s [extra] guarded odd 2 == Nothing
  18248. 1492.51 s [extra] +++ OK, passed 100 tests.
  18249. 1492.51 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18250. 1492.51 s [extra] +++ OK, passed 100 tests.
  18251. 1492.51 s [extra] guardedA (return . even) 42 == Just [42]
  18252. 1492.51 s [extra] +++ OK, passed 100 tests.
  18253. 1492.51 s [extra] guardedA (return . odd) 42 == Just []
  18254. 1492.51 s [extra] +++ OK, passed 100 tests.
  18255. 1492.51 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18256. 1492.51 s [extra] +++ OK, passed 100 tests.
  18257. 1492.51 s [extra] fold1M (\x y -> Just x) [] == undefined
  18258. 1492.51 s [extra] +++ OK, passed 100 tests.
  18259. 1492.51 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18260. 1492.51 s [extra] +++ OK, passed 100 tests.
  18261. 1492.51 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18262. 1492.51 s [extra] +++ OK, passed 100 tests.
  18263. 1492.51 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18264. 1492.51 s [extra] +++ OK, passed 100 tests.
  18265. 1492.51 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18266. 1492.51 s [extra] +++ OK, passed 100 tests.
  18267. 1492.51 s [extra] Just True ||^ undefined == Just True
  18268. 1492.51 s [extra] +++ OK, passed 100 tests.
  18269. 1492.51 s [extra] Just False ||^ Just True == Just True
  18270. 1492.51 s [extra] +++ OK, passed 100 tests.
  18271. 1492.51 s [extra] Just False ||^ Just False == Just False
  18272. 1492.51 s [extra] +++ OK, passed 100 tests.
  18273. 1492.51 s [extra] Just False &&^ undefined == Just False
  18274. 1492.51 s [extra] +++ OK, passed 100 tests.
  18275. 1492.51 s [extra] Just True &&^ Just True == Just True
  18276. 1492.51 s [extra] +++ OK, passed 100 tests.
  18277. 1492.51 s [extra] Just True &&^ Just False == Just False
  18278. 1492.51 s [extra] +++ OK, passed 100 tests.
  18279. 1492.51 s [extra] anyM Just [False,True ,undefined] == Just True
  18280. 1492.51 s [extra] +++ OK, passed 100 tests.
  18281. 1492.51 s [extra] anyM Just [False,False,undefined] == undefined
  18282. 1492.51 s [extra] +++ OK, passed 100 tests.
  18283. 1492.51 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18284. 1492.51 s [extra] +++ OK, passed 100 tests.
  18285. 1492.51 s [extra] allM Just [True,False,undefined] == Just False
  18286. 1492.51 s [extra] +++ OK, passed 100 tests.
  18287. 1492.51 s [extra] allM Just [True,True ,undefined] == undefined
  18288. 1492.51 s [extra] +++ OK, passed 100 tests.
  18289. 1492.51 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18290. 1492.51 s [extra] +++ OK, passed 100 tests.
  18291. 1492.51 s [extra] orM [Just False,Just True ,undefined] == Just True
  18292. 1492.51 s [extra] +++ OK, passed 100 tests.
  18293. 1492.51 s [extra] orM [Just False,Just False,undefined] == undefined
  18294. 1492.51 s [extra] +++ OK, passed 100 tests.
  18295. 1492.51 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18296. 1492.51 s [extra] +++ OK, passed 100 tests.
  18297. 1492.51 s [extra] andM [Just True,Just False,undefined] == Just False
  18298. 1492.51 s [extra] +++ OK, passed 100 tests.
  18299. 1492.51 s [extra] andM [Just True,Just True ,undefined] == undefined
  18300. 1492.51 s [extra] +++ OK, passed 100 tests.
  18301. 1492.51 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18302. 1492.51 s [extra] +++ OK, passed 100 tests.
  18303. 1492.51 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18304. 1492.51 s [extra] +++ OK, passed 100 tests.
  18305. 1492.51 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18306. 1492.51 s [extra] +++ OK, passed 100 tests.
  18307. 1492.51 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18308. 1492.51 s [extra] +++ OK, passed 100 tests.
  18309. 1492.51 s [extra] fromLeft 1 (Left 3) == 3
  18310. 1492.51 s [extra] +++ OK, passed 100 tests.
  18311. 1492.51 s [extra] fromLeft 1 (Right "foo") == 1
  18312. 1492.51 s [extra] +++ OK, passed 100 tests.
  18313. 1492.51 s [extra] fromRight 1 (Right 3) == 3
  18314. 1492.51 s [extra] +++ OK, passed 100 tests.
  18315. 1492.51 s [extra] fromRight 1 (Left "foo") == 1
  18316. 1492.51 s [extra] +++ OK, passed 100 tests.
  18317. 1492.51 s [extra] \x -> fromLeft' (Left x) == x
  18318. 1492.51 s [extra] +++ OK, passed 100 tests.
  18319. 1492.51 s [extra] \x -> fromLeft' (Right x) == undefined
  18320. 1492.52 s [extra] +++ OK, passed 100 tests.
  18321. 1492.52 s [extra] \x -> fromRight' (Right x) == x
  18322. 1492.52 s [extra] +++ OK, passed 100 tests.
  18323. 1492.52 s [extra] \x -> fromRight' (Left x) == undefined
  18324. 1492.52 s [extra] +++ OK, passed 100 tests.
  18325. 1492.52 s [extra] \x -> fromEither (Left x ) == x
  18326. 1492.52 s [extra] +++ OK, passed 100 tests.
  18327. 1492.52 s [extra] \x -> fromEither (Right x) == x
  18328. 1492.52 s [extra] +++ OK, passed 100 tests.
  18329. 1492.52 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18330. 1492.52 s [extra] +++ OK, passed 100 tests.
  18331. 1492.52 s [extra] \a -> maybeToEither a Nothing == Left a
  18332. 1492.52 s [extra] +++ OK, passed 100 tests.
  18333. 1492.52 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18334. 1492.52 s [extra] +++ OK, passed 100 tests.
  18335. 1492.52 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18336. 1492.52 s [extra] +++ OK, passed 100 tests.
  18337. 1492.52 s [extra] mapLeft show (Left 1) == Left "1"
  18338. 1492.52 s [extra] +++ OK, passed 100 tests.
  18339. 1492.52 s [extra] mapLeft show (Right True) == Right True
  18340. 1492.52 s [extra] +++ OK, passed 100 tests.
  18341. 1492.52 s [extra] mapRight show (Left 1) == Left 1
  18342. 1492.52 s [extra] +++ OK, passed 100 tests.
  18343. 1492.52 s [extra] mapRight show (Right True) == Right "True"
  18344. 1492.52 s [extra] +++ OK, passed 100 tests.
  18345. 1492.52 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18346. 1492.52 s [extra] +++ OK, passed 100 tests.
  18347. 1492.52 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18348. 1492.52 s [extra] +++ OK, passed 100 tests.
  18349. 1492.52 s [extra] \xs -> repeatedly line1 xs == lines xs
  18350. 1492.53 s [extra] +++ OK, passed 100 tests.
  18351. 1492.53 s [extra] disjoint [1,2,3] [4,5] == True
  18352. 1492.53 s [extra] +++ OK, passed 100 tests.
  18353. 1492.53 s [extra] disjoint [1,2,3] [4,1] == False
  18354. 1492.53 s [extra] +++ OK, passed 100 tests.
  18355. 1492.53 s [extra] disjointOrd [1,2,3] [4,5] == True
  18356. 1492.53 s [extra] +++ OK, passed 100 tests.
  18357. 1492.53 s [extra] disjointOrd [1,2,3] [4,1] == False
  18358. 1492.53 s [extra] +++ OK, passed 100 tests.
  18359. 1492.53 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18360. 1492.53 s [extra] +++ OK, passed 100 tests.
  18361. 1492.53 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18362. 1492.53 s [extra] +++ OK, passed 100 tests.
  18363. 1492.53 s [extra] anySame [1,1,2] == True
  18364. 1492.53 s [extra] +++ OK, passed 100 tests.
  18365. 1492.53 s [extra] anySame [1,2,3] == False
  18366. 1492.53 s [extra] +++ OK, passed 100 tests.
  18367. 1492.53 s [extra] anySame (1:2:1:undefined) == True
  18368. 1492.53 s [extra] +++ OK, passed 100 tests.
  18369. 1492.53 s [extra] anySame [] == False
  18370. 1492.53 s [extra] +++ OK, passed 100 tests.
  18371. 1492.53 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18372. 1492.53 s [extra] +++ OK, passed 100 tests.
  18373. 1492.53 s [extra] allSame [1,1,2] == False
  18374. 1492.53 s [extra] +++ OK, passed 100 tests.
  18375. 1492.53 s [extra] allSame [1,1,1] == True
  18376. 1492.53 s [extra] +++ OK, passed 100 tests.
  18377. 1492.53 s [extra] allSame [1] == True
  18378. 1492.53 s [extra] +++ OK, passed 100 tests.
  18379. 1492.53 s [extra] allSame [] == True
  18380. 1492.53 s [extra] +++ OK, passed 100 tests.
  18381. 1492.53 s [extra] allSame (1:1:2:undefined) == False
  18382. 1492.53 s [extra] +++ OK, passed 100 tests.
  18383. 1492.53 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18384. 1492.53 s [extra] +++ OK, passed 100 tests.
  18385. 1492.53 s [extra] headDef 1 [] == 1
  18386. 1492.53 s [extra] +++ OK, passed 100 tests.
  18387. 1492.53 s [extra] headDef 1 [2,3,4] == 2
  18388. 1492.53 s [extra] +++ OK, passed 100 tests.
  18389. 1492.53 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18390. 1492.53 s [extra] +++ OK, passed 100 tests.
  18391. 1492.53 s [extra] lastDef 1 [] == 1
  18392. 1492.53 s [extra] +++ OK, passed 100 tests.
  18393. 1492.53 s [extra] lastDef 1 [2,3,4] == 4
  18394. 1492.53 s [extra] +++ OK, passed 100 tests.
  18395. 1492.53 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18396. 1492.53 s [extra] +++ OK, passed 100 tests.
  18397. 1492.53 s [extra] [2,3,4] !? 1 == Just 3
  18398. 1492.53 s [extra] +++ OK, passed 100 tests.
  18399. 1492.53 s [extra] [2,3,4] !? (-1) == Nothing
  18400. 1492.53 s [extra] +++ OK, passed 100 tests.
  18401. 1492.53 s [extra] [] !? 0 == Nothing
  18402. 1492.53 s [extra] +++ OK, passed 100 tests.
  18403. 1492.53 s [extra] notNull [] == False
  18404. 1492.53 s [extra] +++ OK, passed 100 tests.
  18405. 1492.53 s [extra] notNull [1] == True
  18406. 1492.53 s [extra] +++ OK, passed 100 tests.
  18407. 1492.53 s [extra] \xs -> notNull xs == not (null xs)
  18408. 1492.53 s [extra] +++ OK, passed 100 tests.
  18409. 1492.53 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18410. 1492.53 s [extra] +++ OK, passed 100 tests.
  18411. 1492.53 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18412. 1492.53 s [extra] +++ OK, passed 100 tests.
  18413. 1492.53 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  18414. 1492.53 s [extra] +++ OK, passed 100 tests.
  18415. 1492.53 s [extra] unsnoc "test" == Just ("tes",'t')
  18416. 1492.53 s [extra] +++ OK, passed 100 tests.
  18417. 1492.53 s [extra] unsnoc "" == Nothing
  18418. 1492.53 s [extra] +++ OK, passed 100 tests.
  18419. 1492.53 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  18420. 1492.53 s [extra] +++ OK, passed 100 tests.
  18421. 1492.53 s [extra] cons 't' "est" == "test"
  18422. 1492.53 s [extra] +++ OK, passed 100 tests.
  18423. 1492.53 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  18424. 1492.53 s [extra] +++ OK, passed 100 tests.
  18425. 1492.53 s [extra] snoc "tes" 't' == "test"
  18426. 1492.53 s [extra] +++ OK, passed 100 tests.
  18427. 1492.53 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  18428. 1492.53 s [extra] +++ OK, passed 100 tests.
  18429. 1492.53 s [extra] enumerate == [False, True]
  18430. 1492.53 s [extra] +++ OK, passed 100 tests.
  18431. 1492.53 s [extra] takeEnd 3 "hello" == "llo"
  18432. 1492.53 s [extra] +++ OK, passed 100 tests.
  18433. 1492.53 s [extra] takeEnd 5 "bye" == "bye"
  18434. 1492.53 s [extra] +++ OK, passed 100 tests.
  18435. 1492.53 s [extra] takeEnd (-1) "bye" == ""
  18436. 1492.53 s [extra] +++ OK, passed 100 tests.
  18437. 1492.53 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  18438. 1492.53 s [extra] +++ OK, passed 100 tests.
  18439. 1492.53 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  18440. 1492.53 s [extra] +++ OK, passed 100 tests.
  18441. 1492.53 s [extra] dropEnd 3 "hello" == "he"
  18442. 1492.53 s [extra] +++ OK, passed 100 tests.
  18443. 1492.53 s [extra] dropEnd 5 "bye" == ""
  18444. 1492.53 s [extra] +++ OK, passed 100 tests.
  18445. 1492.53 s [extra] dropEnd (-1) "bye" == "bye"
  18446. 1492.53 s [extra] +++ OK, passed 100 tests.
  18447. 1492.53 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  18448. 1492.53 s [extra] +++ OK, passed 100 tests.
  18449. 1492.53 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  18450. 1492.53 s [extra] +++ OK, passed 100 tests.
  18451. 1492.53 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  18452. 1492.53 s [extra] +++ OK, passed 100 tests.
  18453. 1492.53 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  18454. 1492.53 s [extra] +++ OK, passed 100 tests.
  18455. 1492.53 s [extra] splitAtEnd 3 "he" == ("", "he")
  18456. 1492.53 s [extra] +++ OK, passed 100 tests.
  18457. 1492.53 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  18458. 1492.53 s [extra] +++ OK, passed 100 tests.
  18459. 1492.53 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  18460. 1492.53 s [extra] +++ OK, passed 100 tests.
  18461. 1492.53 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  18462. 1492.53 s [extra] +++ OK, passed 100 tests.
  18463. 1492.53 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  18464. 1492.54 s [extra] +++ OK, passed 100 tests.
  18465. 1492.54 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  18466. 1492.54 s [extra] +++ OK, passed 100 tests.
  18467. 1492.54 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  18468. 1492.54 s [extra] +++ OK, passed 100 tests.
  18469. 1492.54 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  18470. 1492.54 s [extra] +++ OK, passed 100 tests.
  18471. 1492.54 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  18472. 1492.54 s [extra] +++ OK, passed 100 tests.
  18473. 1492.54 s [extra] trim " hello " == "hello"
  18474. 1492.54 s [extra] +++ OK, passed 100 tests.
  18475. 1492.54 s [extra] trimStart " hello " == "hello "
  18476. 1492.54 s [extra] +++ OK, passed 100 tests.
  18477. 1492.54 s [extra] trimEnd " hello " == " hello"
  18478. 1492.54 s [extra] +++ OK, passed 100 tests.
  18479. 1492.54 s [extra] \s -> trim s == trimEnd (trimStart s)
  18480. 1492.54 s [extra] +++ OK, passed 100 tests.
  18481. 1492.54 s [extra] lower "This is A TEST" == "this is a test"
  18482. 1492.54 s [extra] +++ OK, passed 100 tests.
  18483. 1492.54 s [extra] lower "" == ""
  18484. 1492.54 s [extra] +++ OK, passed 100 tests.
  18485. 1492.54 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  18486. 1492.54 s [extra] +++ OK, passed 100 tests.
  18487. 1492.54 s [extra] upper "" == ""
  18488. 1492.54 s [extra] +++ OK, passed 100 tests.
  18489. 1492.54 s [extra] word1 "" == ("", "")
  18490. 1492.54 s [extra] +++ OK, passed 100 tests.
  18491. 1492.54 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  18492. 1492.54 s [extra] +++ OK, passed 100 tests.
  18493. 1492.54 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  18494. 1492.54 s [extra] +++ OK, passed 100 tests.
  18495. 1492.54 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  18496. 1492.54 s [extra] +++ OK, passed 100 tests.
  18497. 1492.54 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  18498. 1492.54 s [extra] +++ OK, passed 100 tests.
  18499. 1492.54 s [extra] line1 "" == ("", "")
  18500. 1492.54 s [extra] +++ OK, passed 100 tests.
  18501. 1492.54 s [extra] line1 "test" == ("test","")
  18502. 1492.54 s [extra] +++ OK, passed 100 tests.
  18503. 1492.54 s [extra] line1 "test\n" == ("test","")
  18504. 1492.54 s [extra] +++ OK, passed 100 tests.
  18505. 1492.54 s [extra] line1 "test\nrest" == ("test","rest")
  18506. 1492.54 s [extra] +++ OK, passed 100 tests.
  18507. 1492.54 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  18508. 1492.54 s [extra] +++ OK, passed 100 tests.
  18509. 1492.54 s [extra] escapeHTML "this is a test" == "this is a test"
  18510. 1492.54 s [extra] +++ OK, passed 100 tests.
  18511. 1492.54 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  18512. 1492.54 s [extra] +++ OK, passed 100 tests.
  18513. 1492.54 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  18514. 1492.54 s [extra] +++ OK, passed 100 tests.
  18515. 1492.54 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  18516. 1492.54 s [extra] +++ OK, passed 100 tests.
  18517. 1492.54 s [extra] escapeJSON "this is a test" == "this is a test"
  18518. 1492.54 s [extra] +++ OK, passed 100 tests.
  18519. 1492.54 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  18520. 1492.54 s [extra] +++ OK, passed 100 tests.
  18521. 1492.54 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  18522. 1492.54 s [extra] +++ OK, passed 100 tests.
  18523. 1492.54 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  18524. 1492.54 s [extra] +++ OK, passed 100 tests.
  18525. 1492.54 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  18526. 1492.54 s [extra] +++ OK, passed 100 tests.
  18527. 1492.54 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  18528. 1492.54 s [extra] +++ OK, passed 100 tests.
  18529. 1492.54 s [extra] maximumOn id [] == undefined
  18530. 1492.54 s [extra] +++ OK, passed 100 tests.
  18531. 1492.54 s [extra] maximumOn length ["test","extra","a"] == "extra"
  18532. 1492.54 s [extra] +++ OK, passed 100 tests.
  18533. 1492.54 s [extra] minimumOn id [] == undefined
  18534. 1492.54 s [extra] +++ OK, passed 100 tests.
  18535. 1492.54 s [extra] minimumOn length ["test","extra","a"] == "a"
  18536. 1492.54 s [extra] +++ OK, passed 100 tests.
  18537. 1492.54 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  18538. 1492.54 s [extra] +++ OK, passed 100 tests.
  18539. 1492.54 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  18540. 1492.54 s [extra] +++ OK, passed 100 tests.
  18541. 1492.54 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  18542. 1492.55 s [extra] +++ OK, passed 100 tests.
  18543. 1492.55 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18544. 1492.55 s [extra] +++ OK, passed 100 tests.
  18545. 1492.55 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18546. 1492.55 s [extra] +++ OK, passed 100 tests.
  18547. 1492.55 s [extra] sum' [1, 2, 3] == 6
  18548. 1492.55 s [extra] +++ OK, passed 100 tests.
  18549. 1492.55 s [extra] sumOn' read ["1", "2", "3"] == 6
  18550. 1492.55 s [extra] +++ OK, passed 100 tests.
  18551. 1492.55 s [extra] product' [1, 2, 4] == 8
  18552. 1492.55 s [extra] +++ OK, passed 100 tests.
  18553. 1492.55 s [extra] productOn' read ["1", "2", "4"] == 8
  18554. 1492.55 s [extra] +++ OK, passed 100 tests.
  18555. 1492.55 s [extra] merge "ace" "bd" == "abcde"
  18556. 1492.55 s [extra] +++ OK, passed 100 tests.
  18557. 1492.55 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  18558. 1492.55 s [extra] +++ OK, passed 100 tests.
  18559. 1492.55 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  18560. 1492.55 s [extra] +++ OK, passed 100 tests.
  18561. 1492.55 s [extra] replace "el" "e" "Hello" == "Helo"
  18562. 1492.55 s [extra] +++ OK, passed 100 tests.
  18563. 1492.55 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  18564. 1492.55 s [extra] +++ OK, passed 100 tests.
  18565. 1492.55 s [extra] replace "" "x" "" == "x"
  18566. 1492.55 s [extra] +++ OK, passed 100 tests.
  18567. 1492.55 s [extra] \xs ys -> replace xs xs ys == ys
  18568. 1492.55 s [extra] +++ OK, passed 100 tests.
  18569. 1492.55 s [extra] breakEnd isLower "youRE" == ("you","RE")
  18570. 1492.55 s [extra] +++ OK, passed 100 tests.
  18571. 1492.55 s [extra] breakEnd isLower "youre" == ("youre","")
  18572. 1492.55 s [extra] +++ OK, passed 100 tests.
  18573. 1492.55 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  18574. 1492.55 s [extra] +++ OK, passed 100 tests.
  18575. 1492.55 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  18576. 1492.55 s [extra] +++ OK, passed 100 tests.
  18577. 1492.55 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  18578. 1492.55 s [extra] +++ OK, passed 100 tests.
  18579. 1492.55 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  18580. 1492.55 s [extra] +++ OK, passed 100 tests.
  18581. 1492.55 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  18582. 1492.55 s [extra] +++ OK, passed 100 tests.
  18583. 1492.55 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  18584. 1492.55 s [extra] +++ OK, passed 100 tests.
  18585. 1492.55 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  18586. 1492.55 s [extra] +++ OK, passed 100 tests.
  18587. 1492.55 s [extra] \s -> wordsBy isSpace s == words s
  18588. 1492.55 s [extra] +++ OK, passed 100 tests.
  18589. 1492.55 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  18590. 1492.55 s [extra] +++ OK, passed 100 tests.
  18591. 1492.55 s [extra] \s -> linesBy (== '\n') s == lines s
  18592. 1492.55 s [extra] +++ OK, passed 100 tests.
  18593. 1492.55 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  18594. 1492.55 s [extra] +++ OK, passed 100 tests.
  18595. 1492.55 s [extra] firstJust id [Nothing,Just 3] == Just 3
  18596. 1492.55 s [extra] +++ OK, passed 100 tests.
  18597. 1492.55 s [extra] firstJust id [Nothing,Nothing] == Nothing
  18598. 1492.55 s [extra] +++ OK, passed 100 tests.
  18599. 1492.55 s [extra] drop1 "" == ""
  18600. 1492.55 s [extra] +++ OK, passed 100 tests.
  18601. 1492.55 s [extra] drop1 "test" == "est"
  18602. 1492.55 s [extra] +++ OK, passed 100 tests.
  18603. 1492.55 s [extra] \xs -> drop 1 xs == drop1 xs
  18604. 1492.55 s [extra] +++ OK, passed 100 tests.
  18605. 1492.55 s [extra] dropEnd1 "" == ""
  18606. 1492.55 s [extra] +++ OK, passed 100 tests.
  18607. 1492.55 s [extra] dropEnd1 "test" == "tes"
  18608. 1492.55 s [extra] +++ OK, passed 100 tests.
  18609. 1492.55 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  18610. 1492.55 s [extra] +++ OK, passed 100 tests.
  18611. 1492.55 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  18612. 1492.55 s [extra] +++ OK, passed 100 tests.
  18613. 1492.55 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  18614. 1492.57 s [extra] +++ OK, passed 100 tests.
  18615. 1492.57 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  18616. 1492.57 s [extra] +++ OK, passed 100 tests.
  18617. 1492.57 s [extra] breakOn "/" "foobar" == ("foobar", "")
  18618. 1492.57 s [extra] +++ OK, passed 100 tests.
  18619. 1492.57 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  18620. 1492.57 s [extra] +++ OK, passed 100 tests.
  18621. 1492.57 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  18622. 1492.57 s [extra] +++ OK, passed 100 tests.
  18623. 1492.57 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  18624. 1492.57 s [extra] +++ OK, passed 100 tests.
  18625. 1492.57 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  18626. 1492.57 s [extra] +++ OK, passed 100 tests.
  18627. 1492.57 s [extra] splitOn "x" "x" == ["",""]
  18628. 1492.57 s [extra] +++ OK, passed 100 tests.
  18629. 1492.57 s [extra] splitOn "x" "" == [""]
  18630. 1492.57 s [extra] +++ OK, passed 100 tests.
  18631. 1492.57 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  18632. 1492.57 s [extra] +++ OK, passed 100 tests; 18 discarded.
  18633. 1492.57 s [extra] \c x -> splitOn [c] x == split (==c) x
  18634. 1492.57 s [extra] +++ OK, passed 100 tests.
  18635. 1492.57 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  18636. 1492.57 s [extra] +++ OK, passed 100 tests.
  18637. 1492.57 s [extra] split (== 'a') "" == [""]
  18638. 1492.57 s [extra] +++ OK, passed 100 tests.
  18639. 1492.57 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  18640. 1492.57 s [extra] +++ OK, passed 100 tests.
  18641. 1492.57 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  18642. 1492.57 s [extra] +++ OK, passed 100 tests.
  18643. 1492.57 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  18644. 1492.57 s [extra] +++ OK, passed 100 tests.
  18645. 1492.57 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  18646. 1492.57 s [extra] +++ OK, passed 100 tests.
  18647. 1492.57 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  18648. 1492.57 s [extra] +++ OK, passed 100 tests.
  18649. 1492.57 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  18650. 1492.57 s [extra] +++ OK, passed 100 tests.
  18651. 1492.57 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  18652. 1492.57 s [extra] +++ OK, passed 100 tests.
  18653. 1492.57 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  18654. 1492.57 s [extra] +++ OK, passed 100 tests.
  18655. 1492.57 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  18656. 1492.57 s [extra] +++ OK, passed 100 tests.
  18657. 1492.57 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  18658. 1492.57 s [extra] +++ OK, passed 100 tests.
  18659. 1492.57 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  18660. 1492.57 s [extra] +++ OK, passed 100 tests.
  18661. 1492.57 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  18662. 1492.57 s [extra] +++ OK, passed 100 tests.
  18663. 1492.57 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  18664. 1492.57 s [extra] +++ OK, passed 100 tests.
  18665. 1492.57 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  18666. 1492.57 s [extra] +++ OK, passed 100 tests.
  18667. 1492.57 s [extra] stripSuffix "" "baz" == Just "baz"
  18668. 1492.57 s [extra] +++ OK, passed 100 tests.
  18669. 1492.57 s [extra] stripSuffix "foo" "quux" == Nothing
  18670. 1492.57 s [extra] +++ OK, passed 100 tests.
  18671. 1492.57 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  18672. 1492.57 s [extra] +++ OK, passed 100 tests.
  18673. 1492.57 s [extra] stripInfix "/" "foobar" == Nothing
  18674. 1492.57 s [extra] +++ OK, passed 100 tests.
  18675. 1492.57 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  18676. 1492.57 s [extra] +++ OK, passed 100 tests.
  18677. 1492.57 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  18678. 1492.57 s [extra] +++ OK, passed 100 tests.
  18679. 1492.57 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  18680. 1492.57 s [extra] +++ OK, passed 100 tests.
  18681. 1492.57 s [extra] chunksOf 8 "" == []
  18682. 1492.57 s [extra] +++ OK, passed 100 tests.
  18683. 1492.57 s [extra] chunksOf 0 "test" == undefined
  18684. 1492.57 s [extra] +++ OK, passed 100 tests.
  18685. 1492.57 s [extra] nubSort "this is a test" == " aehist"
  18686. 1492.57 s [extra] +++ OK, passed 100 tests.
  18687. 1492.57 s [extra] \xs -> nubSort xs == nub (sort xs)
  18688. 1492.57 s [extra] +++ OK, passed 100 tests.
  18689. 1492.57 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  18690. 1492.57 s [extra] +++ OK, passed 100 tests.
  18691. 1492.57 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  18692. 1492.57 s [extra] +++ OK, passed 100 tests.
  18693. 1492.57 s [extra] nubOrd "this is a test" == "this ae"
  18694. 1492.57 s [extra] +++ OK, passed 100 tests.
  18695. 1492.57 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  18696. 1492.57 s [extra] +++ OK, passed 100 tests.
  18697. 1492.57 s [extra] \xs -> nubOrd xs == nub xs
  18698. 1492.57 s [extra] +++ OK, passed 100 tests.
  18699. 1492.57 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  18700. 1492.57 s [extra] +++ OK, passed 100 tests.
  18701. 1492.57 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  18702. 1492.57 s [extra] +++ OK, passed 100 tests.
  18703. 1492.57 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  18704. 1492.57 s [extra] +++ OK, passed 100 tests.
  18705. 1492.57 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  18706. 1492.57 s [extra] +++ OK, passed 100 tests.
  18707. 1492.57 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  18708. 1492.57 s [extra] +++ OK, passed 100 tests.
  18709. 1492.57 s [extra] comparingLength [1,2,3] [False] == GT
  18710. 1492.57 s [extra] +++ OK, passed 100 tests.
  18711. 1492.57 s [extra] comparingLength [1,2] "ab" == EQ
  18712. 1492.57 s [extra] +++ OK, passed 100 tests.
  18713. 1492.58 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  18714. 1492.58 s [extra] +++ OK, passed 100 tests.
  18715. 1492.58 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  18716. 1492.58 s [extra] +++ OK, passed 100 tests.
  18717. 1492.58 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  18718. 1492.58 s [extra] +++ OK, passed 100 tests.
  18719. 1492.58 s [extra] mwhen True "test" == "test"
  18720. 1492.58 s [extra] +++ OK, passed 100 tests.
  18721. 1492.58 s [extra] mwhen False "test" == ""
  18722. 1492.58 s [extra] +++ OK, passed 100 tests.
  18723. 1492.58 s [extra] first succ (1,"test") == (2,"test")
  18724. 1492.58 s [extra] +++ OK, passed 100 tests.
  18725. 1492.58 s [extra] second reverse (1,"test") == (1,"tset")
  18726. 1492.58 s [extra] +++ OK, passed 100 tests.
  18727. 1492.58 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  18728. 1492.58 s [extra] +++ OK, passed 100 tests.
  18729. 1492.58 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  18730. 1492.58 s [extra] +++ OK, passed 100 tests.
  18731. 1492.58 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  18732. 1492.58 s [extra] +++ OK, passed 100 tests.
  18733. 1492.58 s [extra] (succ &&& pred) 1 == (2,0)
  18734. 1492.58 s [extra] +++ OK, passed 100 tests.
  18735. 1492.58 s [extra] dupe 12 == (12, 12)
  18736. 1492.58 s [extra] +++ OK, passed 100 tests.
  18737. 1492.58 s [extra] both succ (1,2) == (2,3)
  18738. 1492.58 s [extra] +++ OK, passed 100 tests.
  18739. 1492.58 s [extra] first3 succ (1,1,1) == (2,1,1)
  18740. 1492.58 s [extra] +++ OK, passed 100 tests.
  18741. 1492.58 s [extra] second3 succ (1,1,1) == (1,2,1)
  18742. 1492.58 s [extra] +++ OK, passed 100 tests.
  18743. 1492.58 s [extra] third3 succ (1,1,1) == (1,1,2)
  18744. 1492.58 s [extra] +++ OK, passed 100 tests.
  18745. 1492.58 s [extra] \x -> readVersion (showVersion x) == x
  18746. 1492.58 s [extra] +++ OK, passed 100 tests.
  18747. 1492.58 s [extra] readVersion "hello" == undefined
  18748. 1492.58 s [extra] +++ OK, passed 100 tests.
  18749. 1492.58 s [extra] showDP 4 pi == "3.1416"
  18750. 1492.58 s [extra] +++ OK, passed 100 tests.
  18751. 1492.58 s [extra] showDP 0 pi == "3"
  18752. 1492.58 s [extra] +++ OK, passed 100 tests.
  18753. 1492.58 s [extra] showDP 2 3 == "3.00"
  18754. 1492.58 s [extra] +++ OK, passed 100 tests.
  18755. 1492.58 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  18756. 1492.58 s [extra] +++ OK, passed 100 tests.
  18757. 1492.58 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  18758. 1492.58 s [extra] +++ OK, passed 100 tests.
  18759. 1492.58 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  18760. 1492.58 s [extra] +++ OK, passed 100 tests.
  18761. 1492.58 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  18762. 1492.58 s [extra] +++ OK, passed 100 tests.
  18763. 1492.58 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  18764. 1492.58 s [extra] +++ OK, passed 100 tests.
  18765. 1492.58 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18766. 1492.58 s [extra] +++ OK, passed 100 tests.
  18767. 1492.58 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18768. 1492.58 s [extra] +++ OK, passed 100 tests.
  18769. 1492.58 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  18770. 1492.58 s [extra] +++ OK, passed 100 tests.
  18771. 1492.58 s [extra] isWindows == (os == "mingw32")
  18772. 1492.58 s [extra] +++ OK, passed 100 tests.
  18773. 1492.58 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  18774. 1492.60 s [extra] +++ OK, passed 100 tests.
  18775. 1492.60 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  18776. 1492.61 s [extra] +++ OK, passed 100 tests.
  18777. 1492.61 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  18778. 1492.63 s [extra] +++ OK, passed 100 tests.
  18779. 1492.63 s [extra] captureOutput (print 1) == pure ("1\n",())
  18780. 1492.63 s [extra] +++ OK, passed 100 tests.
  18781. 1492.63 s [extra] withTempFile doesFileExist == pure True
  18782. 1492.63 s [extra] +++ OK, passed 100 tests.
  18783. 1492.63 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  18784. 1492.63 s [extra] +++ OK, passed 100 tests.
  18785. 1492.63 s [extra] withTempFile readFile' == pure ""
  18786. 1492.63 s [extra] +++ OK, passed 100 tests.
  18787. 1492.63 s [extra] withTempDir doesDirectoryExist == pure True
  18788. 1492.63 s [extra] +++ OK, passed 100 tests.
  18789. 1492.63 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  18790. 1492.63 s [extra] +++ OK, passed 100 tests.
  18791. 1492.63 s [extra] withTempDir listFiles == pure []
  18792. 1492.63 s [extra] +++ OK, passed 100 tests.
  18793. 1492.63 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  18794. 1492.63 s [extra] +++ OK, passed 100 tests.
  18795. 1492.63 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  18796. 1492.63 s [extra] +++ OK, passed 100 tests.
  18797. 1492.63 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  18798. 1492.63 s [extra] +++ OK, passed 100 tests.
  18799. 1492.63 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  18800. 1492.63 s [extra] +++ OK, passed 100 tests.
  18801. 1492.63 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  18802. 1492.63 s [extra] +++ OK, passed 100 tests.
  18803. 1492.63 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  18804. 1492.63 s [extra] +++ OK, passed 100 tests.
  18805. 1492.63 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  18806. 1493.63 s [extra] +++ OK, passed 100 tests.
  18807. 1493.63 s [extra] timeout (-3) (print 1) == pure Nothing
  18808. 1493.63 s [extra] +++ OK, passed 100 tests.
  18809. 1493.63 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  18810. 1493.63 s [extra] +++ OK, passed 100 tests.
  18811. 1493.63 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  18812. 1493.74 s [extra] 0.10190894
  18813. 1493.74 s [extra] +++ OK, passed 100 tests.
  18814. 1493.74 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  18815. 1493.84 s [extra] +++ OK, passed 100 tests.
  18816. 1493.84 s [extra] showDuration 3.435 == "3.44s"
  18817. 1493.84 s [extra] +++ OK, passed 100 tests.
  18818. 1493.84 s [extra] showDuration 623.8 == "10m24s"
  18819. 1493.84 s [extra] +++ OK, passed 100 tests.
  18820. 1493.84 s [extra] showDuration 62003.8 == "17h13m"
  18821. 1493.84 s [extra] +++ OK, passed 100 tests.
  18822. 1493.84 s [extra] showDuration 1e8 == "27777h47m"
  18823. 1493.84 s [extra] +++ OK, passed 100 tests.
  18824. 1493.84 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  18825. 1493.84 s [extra] +++ OK, passed 100 tests.
  18826. 1493.84 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  18827. 1494.84 s [extra] +++ OK, passed 100 tests.
  18828. 1494.84 s [extra] Extra export
  18829. 1494.84 s [extra] +++ OK, passed 100 tests.
  18830. 1494.84 s [extra] withTempFile
  18831. 1494.85 s [extra] ....done
  18832. 1494.85 s [extra] withTempDir
  18833. 1494.87 s [extra] ....done
  18834. 1494.87 s [extra] retry
  18835. 1494.87 s [extra] +++ OK, passed 100 tests.
  18836. 1494.87 s [extra] barrier
  18837. 1494.87 s [extra] Success (325 tests)
  18838. 1494.89 s [extra] Test suite extra-test: PASS
  18839. 1494.89 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  18840. 1494.89 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  18841. 1494.90 s [extra] Phase: haddockPhase
  18842. 1495.33 s [extra] Preprocessing library for extra-1.8.1...
  18843. 1495.33 s [extra] Running Haddock on library for extra-1.8.1...
  18844. 1495.73 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing ) [HIE file is missing]
  18845. 1495.85 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing ) [HIE file is missing]
  18846. 1495.86 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing ) [HIE file is missing]
  18847. 1496.00 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing ) [HIE file is missing]
  18848. 1496.15 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing ) [HIE file is missing]
  18849. 1496.15 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing ) [HIE file is missing]
  18850. 1496.15 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing ) [HIE file is missing]
  18851. 1496.47 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing ) [HIE file is missing]
  18852. 1496.48 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing ) [HIE file is missing]
  18853. 1496.51 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing ) [HIE file is missing]
  18854. 1496.52 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing ) [HIE file is missing]
  18855. 1496.63 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing ) [HIE file is missing]
  18856. 1496.69 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing ) [HIE file is missing]
  18857. 1496.71 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing ) [HIE file is missing]
  18858. 1496.75 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing ) [HIE file is missing]
  18859. 1496.78 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing ) [HIE file is missing]
  18860. 1496.79 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing ) [HIE file is missing]
  18861. 1496.92 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing ) [HIE file is missing]
  18862. 1496.92 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing ) [HIE file is missing]
  18863. 1496.94 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing ) [HIE file is missing]
  18864. 1496.98 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing ) [HIE file is missing]
  18865. 1497.14 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing ) [HIE file is missing]
  18866. 1497.14 s [extra] Haddock coverage:
  18867. 1497.36 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  18868. 1497.36 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  18869. 1497.36 s [extra] Warning: 'Arrow' is out of scope.
  18870. 1497.36 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18871. 1497.36 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  18872. 1497.36 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  18873. 1497.36 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  18874. 1497.36 s [extra] Warning: 'unzip' is ambiguous. It is defined
  18875. 1497.36 s [extra] * in ‘GHC.Internal.Data.Functor’
  18876. 1497.36 s [extra] * in ‘GHC.Internal.List’
  18877. 1497.36 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18878. 1497.36 s [extra] by specifying the type/value namespace explicitly.
  18879. 1497.36 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  18880. 1497.36 s [extra] Warning: '(:)' is out of scope.
  18881. 1497.36 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18882. 1497.36 s [extra] Warning: 'firstJustM' is out of scope.
  18883. 1497.36 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18884. 1497.37 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  18885. 1497.37 s [extra] Warning: 'Version' is ambiguous. It is defined
  18886. 1497.37 s [extra] * in ‘GHC.Internal.Data.Version’
  18887. 1497.37 s [extra] * in ‘GHC.Internal.Data.Version’
  18888. 1497.37 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18889. 1497.37 s [extra] by specifying the type/value namespace explicitly.
  18890. 1497.37 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  18891. 1497.37 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  18892. 1497.37 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  18893. 1497.37 s [extra] Warning: 'fromJust' is out of scope.
  18894. 1497.37 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18895. 1497.37 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  18896. 1497.37 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  18897. 1497.37 s [extra] * in ‘GHC.Internal.IO.Exception’
  18898. 1497.37 s [extra] * in ‘GHC.Internal.IO.Exception’
  18899. 1497.37 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18900. 1497.37 s [extra] by specifying the type/value namespace explicitly.
  18901. 1497.37 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  18902. 1497.38 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  18903. 1497.38 s [extra] * in ‘GHC.Internal.Exception.Type’
  18904. 1497.38 s [extra] * in ‘GHC.Internal.Exception.Type’
  18905. 1497.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18906. 1497.38 s [extra] by specifying the type/value namespace explicitly.
  18907. 1497.38 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  18908. 1497.38 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  18909. 1497.38 s [extra] * in ‘GHC.Internal.Exception’
  18910. 1497.38 s [extra] * in ‘GHC.Internal.Exception’
  18911. 1497.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18912. 1497.38 s [extra] by specifying the type/value namespace explicitly.
  18913. 1497.38 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  18914. 1497.38 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  18915. 1497.38 s [extra] Warning: 'find' is out of scope.
  18916. 1497.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18917. 1497.38 s [extra] Warning: 'mconcatMap' is out of scope.
  18918. 1497.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18919. 1497.38 s [extra] Warning: 'partition' is out of scope.
  18920. 1497.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18921. 1497.38 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  18922. 1497.38 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  18923. 1497.38 s [extra] Missing documentation for:
  18924. 1497.38 s [extra] Module header
  18925. 1497.38 s [extra] Warning: 'Lock' is ambiguous. It is defined
  18926. 1497.38 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  18927. 1497.38 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  18928. 1497.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18929. 1497.38 s [extra] by specifying the type/value namespace explicitly.
  18930. 1497.38 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  18931. 1497.38 s [extra] Warning: 'Var' is ambiguous. It is defined
  18932. 1497.38 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  18933. 1497.38 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  18934. 1497.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18935. 1497.38 s [extra] by specifying the type/value namespace explicitly.
  18936. 1497.38 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  18937. 1497.38 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  18938. 1497.38 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  18939. 1497.38 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  18940. 1497.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18941. 1497.38 s [extra] by specifying the type/value namespace explicitly.
  18942. 1497.38 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  18943. 1497.39 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  18944. 1497.39 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  18945. 1497.39 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  18946. 1497.39 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  18947. 1497.39 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  18948. 1497.39 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  18949. 1497.39 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  18950. 1497.40 s [extra] 100% (270 /270) in 'Extra'
  18951. 1497.40 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  18952. 1497.59 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  18953. 1497.59 s [extra] - GHC.Internal.Generics.Rep1_Solo
  18954. 1497.59 s [extra] - GHC.Internal.Generics.Rep_Solo
  18955. 1503.00 s [extra] Documentation created: dist/doc/html/extra, dist/doc/html/extra/extra.txt
  18956. 1503.45 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  18957. 1503.51 s [extra] Phase: installPhase
  18958. 1503.64 s [extra] Installing library in /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  18959. 1504.27 s [extra] Phase: fixupPhase
  18960. 1504.29 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1
  18961. 1504.30 s [extra] shrinking /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSextra-1.8.1-4BnzJI39thT3T2fi96Q59I-ghc9.12.2.so
  18962. 1504.32 s [extra] checking for references to /build/ in /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1...
  18963. 1504.36 s [extra] patching script interpreter paths in /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1
  18964. 1504.38 s [extra] stripping (with command strip and flags -S -p) in /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1/lib
  18965. 1504.54 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/0jcmagahhsay38b0gj7km795p1kh6qq2-extra-1.8.1-doc
  18966. 1504.56 s [extra] checking for references to /build/ in /nix/store/0jcmagahhsay38b0gj7km795p1kh6qq2-extra-1.8.1-doc...
  18967. 1504.60 s [extra] patching script interpreter paths in /nix/store/0jcmagahhsay38b0gj7km795p1kh6qq2-extra-1.8.1-doc
  18968. 1504.79 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/0jcmagahhsay38b0gj7km795p1kh6qq2-extra-1.8.1-doc /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1
  18969. 1512.19 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  18970. 1512.21 s [post-build-hook] Uploading to the NixCI cache: /nix/store/0jcmagahhsay38b0gj7km795p1kh6qq2-extra-1.8.1-doc /nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1
  18971. 1512.25 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18972. 1512.41 s [post-build-hook] copying 1 paths...
  18973. 1512.41 s [post-build-hook] copying path '/nix/store/wlfc2n4m22syyks0azwa1xpds2lcz3mz-extra-1.8.1' to 'https://cache.nix-ci.com'...
  18974. 1514.14 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18975. 1514.34 s [post-build-hook] copying 0 paths...
  18976. 1514.39 s Progress: 13 of 19 built, 165 of 165 downloaded from cache
  18977. 1514.44 s Building algebraic-graphs
  18978. 1514.54 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  18979. 1514.55 s [algebraic-graphs] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  18980. 1514.86 s [algebraic-graphs] Phase: unpackPhase
  18981. 1514.87 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  18982. 1514.88 s [algebraic-graphs] source root is algebraic-graphs-0.7
  18983. 1514.89 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  18984. 1514.90 s [algebraic-graphs] Phase: patchPhase
  18985. 1514.90 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  18986. 1514.91 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  18987. 1514.91 s [algebraic-graphs] patching file algebraic-graphs.cabal
  18988. 1514.92 s [algebraic-graphs] Phase: compileBuildDriverPhase
  18989. 1514.92 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.fzvKOeHcRg/setup-package.conf.d -threaded
  18990. 1515.04 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.fzvKOeHcRg/Main.o )
  18991. 1515.17 s [algebraic-graphs] [2 of 2] Linking Setup
  18992. 1517.59 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  18993. 1517.60 s [algebraic-graphs] Phase: configurePhase
  18994. 1517.61 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.fzvKOeHcRg/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/lib
  18995. 1517.65 s [algebraic-graphs] Using Parsec parser
  18996. 1517.65 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  18997. 1517.66 s [algebraic-graphs] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  18998. 1517.66 s [algebraic-graphs] 'ghc' version < 9.12):
  18999. 1517.66 s [algebraic-graphs] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  19000. 1517.66 s [algebraic-graphs] 9.12.2
  19001. 1518.39 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19002. 1518.39 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  19003. 1518.39 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  19004. 1518.39 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  19005. 1518.39 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  19006. 1518.39 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19007. 1518.39 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19008. 1518.39 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19009. 1518.39 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  19010. 1518.39 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  19011. 1518.39 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  19012. 1518.39 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19013. 1518.39 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19014. 1518.39 s [algebraic-graphs] inspection-testing-0.6.2
  19015. 1518.39 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  19016. 1518.39 s [algebraic-graphs] Source component graph:
  19017. 1518.39 s [algebraic-graphs] component lib
  19018. 1518.39 s [algebraic-graphs] component test:main dependency lib
  19019. 1518.39 s [algebraic-graphs] Configured component graph:
  19020. 1518.39 s [algebraic-graphs] component algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  19021. 1518.39 s [algebraic-graphs] include array-0.5.8.0-afbe
  19022. 1518.39 s [algebraic-graphs] include base-4.21.0.0-d2ce
  19023. 1518.39 s [algebraic-graphs] include containers-0.7-0a77
  19024. 1518.39 s [algebraic-graphs] include deepseq-1.5.1.0-a72f
  19025. 1518.39 s [algebraic-graphs] include transformers-0.6.1.2-c2d4
  19026. 1518.39 s [algebraic-graphs] component algebraic-graphs-0.7-B1Sv6q8qk0KybXWUN66kr-main
  19027. 1518.39 s [algebraic-graphs] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  19028. 1518.39 s [algebraic-graphs] include algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  19029. 1518.39 s [algebraic-graphs] include array-0.5.8.0-afbe
  19030. 1518.39 s [algebraic-graphs] include base-4.21.0.0-d2ce
  19031. 1518.39 s [algebraic-graphs] include containers-0.7-0a77
  19032. 1518.39 s [algebraic-graphs] include deepseq-1.5.1.0-a72f
  19033. 1518.39 s [algebraic-graphs] include extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  19034. 1518.39 s [algebraic-graphs] include inspection-testing-0.6.2-4m0OtMcaKly48aOUdExPK2
  19035. 1518.39 s [algebraic-graphs] include transformers-0.6.1.2-c2d4
  19036. 1518.39 s [algebraic-graphs] Linked component graph:
  19037. 1518.39 s [algebraic-graphs] unit algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  19038. 1518.39 s [algebraic-graphs] include array-0.5.8.0-afbe
  19039. 1518.39 s [algebraic-graphs] include base-4.21.0.0-d2ce
  19040. 1518.39 s [algebraic-graphs] include containers-0.7-0a77
  19041. 1518.39 s [algebraic-graphs] include deepseq-1.5.1.0-a72f
  19042. 1518.39 s [algebraic-graphs] include transformers-0.6.1.2-c2d4
  19043. 1518.39 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x:Data.Graph.Typed
  19044. 1518.39 s [algebraic-graphs] unit algebraic-graphs-0.7-B1Sv6q8qk0KybXWUN66kr-main
  19045. 1518.39 s [algebraic-graphs] include QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  19046. 1518.39 s [algebraic-graphs] include algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  19047. 1518.39 s [algebraic-graphs] include array-0.5.8.0-afbe
  19048. 1518.39 s [algebraic-graphs] include base-4.21.0.0-d2ce
  19049. 1518.39 s [algebraic-graphs] include containers-0.7-0a77
  19050. 1518.39 s [algebraic-graphs] include deepseq-1.5.1.0-a72f
  19051. 1518.39 s [algebraic-graphs] include extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  19052. 1518.39 s [algebraic-graphs] include inspection-testing-0.6.2-4m0OtMcaKly48aOUdExPK2
  19053. 1518.39 s [algebraic-graphs] include transformers-0.6.1.2-c2d4
  19054. 1518.39 s [algebraic-graphs] Ready component graph:
  19055. 1518.39 s [algebraic-graphs] definite algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  19056. 1518.39 s [algebraic-graphs] depends array-0.5.8.0-afbe
  19057. 1518.39 s [algebraic-graphs] depends base-4.21.0.0-d2ce
  19058. 1518.39 s [algebraic-graphs] depends containers-0.7-0a77
  19059. 1518.39 s [algebraic-graphs] depends deepseq-1.5.1.0-a72f
  19060. 1518.39 s [algebraic-graphs] depends transformers-0.6.1.2-c2d4
  19061. 1518.39 s [algebraic-graphs] definite algebraic-graphs-0.7-B1Sv6q8qk0KybXWUN66kr-main
  19062. 1518.39 s [algebraic-graphs] depends QuickCheck-2.15.0.1-LVSXRR9x75RElVtun4lcBT
  19063. 1518.39 s [algebraic-graphs] depends algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  19064. 1518.39 s [algebraic-graphs] depends array-0.5.8.0-afbe
  19065. 1518.39 s [algebraic-graphs] depends base-4.21.0.0-d2ce
  19066. 1518.39 s [algebraic-graphs] depends containers-0.7-0a77
  19067. 1518.39 s [algebraic-graphs] depends deepseq-1.5.1.0-a72f
  19068. 1518.39 s [algebraic-graphs] depends extra-1.8.1-4BnzJI39thT3T2fi96Q59I
  19069. 1518.39 s [algebraic-graphs] depends inspection-testing-0.6.2-4m0OtMcaKly48aOUdExPK2
  19070. 1518.39 s [algebraic-graphs] depends transformers-0.6.1.2-c2d4
  19071. 1518.39 s [algebraic-graphs] Using Cabal-3.14.1.0 compiled by ghc-9.12
  19072. 1518.39 s [algebraic-graphs] Using compiler: ghc-9.12.2
  19073. 1518.39 s [algebraic-graphs] Using install prefix:
  19074. 1518.39 s [algebraic-graphs] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  19075. 1518.39 s [algebraic-graphs] Executables installed in:
  19076. 1518.39 s [algebraic-graphs] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/bin
  19077. 1518.39 s [algebraic-graphs] Libraries installed in:
  19078. 1518.39 s [algebraic-graphs] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  19079. 1518.39 s [algebraic-graphs] Dynamic Libraries installed in:
  19080. 1518.39 s [algebraic-graphs] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  19081. 1518.39 s [algebraic-graphs] Private executables installed in:
  19082. 1518.39 s [algebraic-graphs] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graphs-0.7
  19083. 1518.39 s [algebraic-graphs] Data files installed in:
  19084. 1518.39 s [algebraic-graphs] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graphs-0.7
  19085. 1518.39 s [algebraic-graphs] Documentation installed in:
  19086. 1518.39 s [algebraic-graphs] /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19087. 1518.39 s [algebraic-graphs] Configuration files installed in:
  19088. 1518.39 s [algebraic-graphs] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/etc
  19089. 1518.39 s [algebraic-graphs] No alex found
  19090. 1518.39 s [algebraic-graphs] Using ar found on system at:
  19091. 1518.39 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  19092. 1518.39 s [algebraic-graphs] No c2hs found
  19093. 1518.39 s [algebraic-graphs] No cpphs found
  19094. 1518.39 s [algebraic-graphs] No doctest found
  19095. 1518.39 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19096. 1518.39 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  19097. 1518.39 s [algebraic-graphs] Using ghc version 9.12.2 found on system at:
  19098. 1518.39 s [algebraic-graphs] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  19099. 1518.39 s [algebraic-graphs] Using ghc-pkg version 9.12.2 found on system at:
  19100. 1518.39 s [algebraic-graphs] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  19101. 1518.39 s [algebraic-graphs] No ghcjs found
  19102. 1518.39 s [algebraic-graphs] No ghcjs-pkg found
  19103. 1518.40 s [algebraic-graphs] No greencard found
  19104. 1518.40 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  19105. 1518.40 s [algebraic-graphs] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  19106. 1518.40 s [algebraic-graphs] No happy found
  19107. 1518.40 s [algebraic-graphs] No haskell-suite found
  19108. 1518.40 s [algebraic-graphs] No haskell-suite-pkg found
  19109. 1518.40 s [algebraic-graphs] No hmake found
  19110. 1518.40 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  19111. 1518.40 s [algebraic-graphs] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  19112. 1518.40 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  19113. 1518.41 s [algebraic-graphs] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  19114. 1518.41 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19115. 1518.41 s [algebraic-graphs] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  19116. 1518.41 s [algebraic-graphs] No jhc found
  19117. 1518.41 s [algebraic-graphs] Using ld found on system at:
  19118. 1518.41 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  19119. 1518.41 s [algebraic-graphs] No pkg-config found
  19120. 1518.41 s [algebraic-graphs] Using runghc version 9.12.2 found on system at:
  19121. 1518.41 s [algebraic-graphs] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  19122. 1518.41 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19123. 1518.41 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  19124. 1518.41 s [algebraic-graphs] Using tar found on system at:
  19125. 1518.41 s [algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  19126. 1518.41 s [algebraic-graphs] No uhc found
  19127. 1518.56 s [algebraic-graphs] Phase: buildPhase
  19128. 1518.63 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  19129. 1518.63 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  19130. 1518.80 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 )
  19131. 1519.92 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 )
  19132. 1520.80 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 )
  19133. 1521.16 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 )
  19134. 1521.16 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19135. 1522.67 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 )
  19136. 1522.98 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 )
  19137. 1523.63 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 )
  19138. 1524.88 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 )
  19139. 1524.88 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 )
  19140. 1524.88 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 )
  19141. 1524.88 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19142. 1524.88 s [algebraic-graphs] In the use of ‘head’
  19143. 1524.88 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19144. 1524.88 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19145. 1524.88 s [algebraic-graphs] |
  19146. 1524.88 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19147. 1524.88 s [algebraic-graphs] | ^^^^
  19148. 1524.88 s [algebraic-graphs]
  19149. 1524.88 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19150. 1524.88 s [algebraic-graphs] In the use of ‘tail’
  19151. 1524.88 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19152. 1524.88 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19153. 1524.88 s [algebraic-graphs] |
  19154. 1524.88 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19155. 1524.88 s [algebraic-graphs] | ^^^^
  19156. 1524.88 s [algebraic-graphs]
  19157. 1524.88 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19158. 1524.88 s [algebraic-graphs] In the use of ‘head’
  19159. 1524.88 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19160. 1524.88 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19161. 1524.88 s [algebraic-graphs] |
  19162. 1524.88 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19163. 1524.88 s [algebraic-graphs] | ^^^^
  19164. 1524.88 s [algebraic-graphs]
  19165. 1524.88 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19166. 1524.88 s [algebraic-graphs] In the use of ‘tail’
  19167. 1524.88 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19168. 1524.88 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19169. 1524.88 s [algebraic-graphs] |
  19170. 1524.88 s [algebraic-graphs] 397 | bnd' = tail bnd
  19171. 1524.88 s [algebraic-graphs] | ^^^^
  19172. 1524.89 s [algebraic-graphs]
  19173. 1524.89 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
  19174. 1524.89 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
  19175. 1524.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19176. 1524.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19177. 1524.89 s [algebraic-graphs] will become an error in a future GHC release.
  19178. 1524.89 s [algebraic-graphs] Suggested fix:
  19179. 1524.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19180. 1524.89 s [algebraic-graphs] |
  19181. 1524.89 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19182. 1524.89 s [algebraic-graphs] | ^
  19183. 1524.89 s [algebraic-graphs]
  19184. 1524.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19185. 1524.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19186. 1524.89 s [algebraic-graphs] will become an error in a future GHC release.
  19187. 1524.89 s [algebraic-graphs] Suggested fix:
  19188. 1524.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19189. 1524.89 s [algebraic-graphs] |
  19190. 1524.89 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19191. 1524.89 s [algebraic-graphs] | ^
  19192. 1524.89 s [algebraic-graphs]
  19193. 1524.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19194. 1524.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19195. 1524.89 s [algebraic-graphs] will become an error in a future GHC release.
  19196. 1524.89 s [algebraic-graphs] Suggested fix:
  19197. 1524.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19198. 1524.89 s [algebraic-graphs] |
  19199. 1524.89 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19200. 1524.89 s [algebraic-graphs] | ^
  19201. 1524.89 s [algebraic-graphs]
  19202. 1524.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19203. 1524.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19204. 1524.89 s [algebraic-graphs] will become an error in a future GHC release.
  19205. 1524.89 s [algebraic-graphs] Suggested fix:
  19206. 1524.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19207. 1524.89 s [algebraic-graphs] |
  19208. 1524.89 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19209. 1524.89 s [algebraic-graphs] | ^
  19210. 1524.89 s [algebraic-graphs]
  19211. 1524.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19212. 1524.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19213. 1524.89 s [algebraic-graphs] will become an error in a future GHC release.
  19214. 1524.89 s [algebraic-graphs] Suggested fix:
  19215. 1524.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19216. 1524.89 s [algebraic-graphs] |
  19217. 1524.89 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19218. 1524.89 s [algebraic-graphs] | ^
  19219. 1524.89 s [algebraic-graphs]
  19220. 1524.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19221. 1524.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19222. 1524.89 s [algebraic-graphs] will become an error in a future GHC release.
  19223. 1524.89 s [algebraic-graphs] Suggested fix:
  19224. 1524.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19225. 1524.89 s [algebraic-graphs] |
  19226. 1524.89 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19227. 1524.89 s [algebraic-graphs] | ^
  19228. 1524.89 s [algebraic-graphs]
  19229. 1524.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19230. 1524.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19231. 1524.89 s [algebraic-graphs] will become an error in a future GHC release.
  19232. 1524.89 s [algebraic-graphs] Suggested fix:
  19233. 1524.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19234. 1524.89 s [algebraic-graphs] |
  19235. 1524.89 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19236. 1524.89 s [algebraic-graphs] | ^
  19237. 1524.89 s [algebraic-graphs]
  19238. 1524.89 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 )
  19239. 1524.90 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 )
  19240. 1525.56 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 )
  19241. 1525.56 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 )
  19242. 1525.56 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 )
  19243. 1526.66 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 )
  19244. 1527.31 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 )
  19245. 1527.42 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 )
  19246. 1527.42 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19247. 1527.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19248. 1527.42 s [algebraic-graphs] will become an error in a future GHC release.
  19249. 1527.42 s [algebraic-graphs] Suggested fix:
  19250. 1527.42 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19251. 1527.42 s [algebraic-graphs] |
  19252. 1527.42 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19253. 1527.42 s [algebraic-graphs] | ^
  19254. 1527.42 s [algebraic-graphs]
  19255. 1527.42 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 )
  19256. 1527.42 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19257. 1527.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19258. 1527.42 s [algebraic-graphs] will become an error in a future GHC release.
  19259. 1527.42 s [algebraic-graphs] Suggested fix:
  19260. 1527.42 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19261. 1527.42 s [algebraic-graphs] |
  19262. 1527.42 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19263. 1527.42 s [algebraic-graphs] | ^
  19264. 1527.42 s [algebraic-graphs]
  19265. 1527.42 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19266. 1527.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19267. 1527.42 s [algebraic-graphs] will become an error in a future GHC release.
  19268. 1527.42 s [algebraic-graphs] Suggested fix:
  19269. 1527.42 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19270. 1527.42 s [algebraic-graphs] |
  19271. 1527.42 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19272. 1527.42 s [algebraic-graphs] | ^
  19273. 1527.42 s [algebraic-graphs]
  19274. 1527.42 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 )
  19275. 1527.42 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 )
  19276. 1527.42 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 )
  19277. 1527.54 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 )
  19278. 1527.54 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 )
  19279. 1527.54 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 )
  19280. 1527.60 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
  19281. 1528.07 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19282. 1529.57 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19283. 1530.30 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 )
  19284. 1530.90 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19285. 1530.90 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19286. 1532.45 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 )
  19287. 1532.81 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 )
  19288. 1533.43 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 )
  19289. 1534.44 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19290. 1534.44 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 )
  19291. 1534.44 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 )
  19292. 1534.44 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19293. 1534.45 s [algebraic-graphs] In the use of ‘head’
  19294. 1534.45 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19295. 1534.45 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19296. 1534.45 s [algebraic-graphs] |
  19297. 1534.45 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19298. 1534.45 s [algebraic-graphs] | ^^^^
  19299. 1534.45 s [algebraic-graphs]
  19300. 1534.45 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19301. 1534.45 s [algebraic-graphs] In the use of ‘tail’
  19302. 1534.45 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19303. 1534.45 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19304. 1534.45 s [algebraic-graphs] |
  19305. 1534.45 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19306. 1534.45 s [algebraic-graphs] | ^^^^
  19307. 1534.45 s [algebraic-graphs]
  19308. 1534.45 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19309. 1534.45 s [algebraic-graphs] In the use of ‘head’
  19310. 1534.45 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19311. 1534.45 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19312. 1534.45 s [algebraic-graphs] |
  19313. 1534.45 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19314. 1534.45 s [algebraic-graphs] | ^^^^
  19315. 1534.45 s [algebraic-graphs]
  19316. 1534.45 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19317. 1534.45 s [algebraic-graphs] In the use of ‘tail’
  19318. 1534.45 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19319. 1534.45 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19320. 1534.45 s [algebraic-graphs] |
  19321. 1534.45 s [algebraic-graphs] 397 | bnd' = tail bnd
  19322. 1534.45 s [algebraic-graphs] | ^^^^
  19323. 1534.45 s [algebraic-graphs]
  19324. 1534.45 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 )
  19325. 1534.45 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19326. 1534.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19327. 1534.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19328. 1534.45 s [algebraic-graphs] will become an error in a future GHC release.
  19329. 1534.45 s [algebraic-graphs] Suggested fix:
  19330. 1534.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19331. 1534.45 s [algebraic-graphs] |
  19332. 1534.45 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19333. 1534.45 s [algebraic-graphs] | ^
  19334. 1534.45 s [algebraic-graphs]
  19335. 1534.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19336. 1534.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19337. 1534.45 s [algebraic-graphs] will become an error in a future GHC release.
  19338. 1534.45 s [algebraic-graphs] Suggested fix:
  19339. 1534.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19340. 1534.45 s [algebraic-graphs] |
  19341. 1534.45 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19342. 1534.45 s [algebraic-graphs] | ^
  19343. 1534.45 s [algebraic-graphs]
  19344. 1534.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19345. 1534.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19346. 1534.45 s [algebraic-graphs] will become an error in a future GHC release.
  19347. 1534.45 s [algebraic-graphs] Suggested fix:
  19348. 1534.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19349. 1534.45 s [algebraic-graphs] |
  19350. 1534.45 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19351. 1534.45 s [algebraic-graphs] | ^
  19352. 1534.45 s [algebraic-graphs]
  19353. 1534.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19354. 1534.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19355. 1534.45 s [algebraic-graphs] will become an error in a future GHC release.
  19356. 1534.45 s [algebraic-graphs] Suggested fix:
  19357. 1534.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19358. 1534.45 s [algebraic-graphs] |
  19359. 1534.45 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19360. 1534.45 s [algebraic-graphs] | ^
  19361. 1534.45 s [algebraic-graphs]
  19362. 1534.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19363. 1534.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19364. 1534.45 s [algebraic-graphs] will become an error in a future GHC release.
  19365. 1534.45 s [algebraic-graphs] Suggested fix:
  19366. 1534.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19367. 1534.45 s [algebraic-graphs] |
  19368. 1534.45 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19369. 1534.45 s [algebraic-graphs] | ^
  19370. 1534.45 s [algebraic-graphs]
  19371. 1534.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19372. 1534.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19373. 1534.45 s [algebraic-graphs] will become an error in a future GHC release.
  19374. 1534.45 s [algebraic-graphs] Suggested fix:
  19375. 1534.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19376. 1534.45 s [algebraic-graphs] |
  19377. 1534.45 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19378. 1534.45 s [algebraic-graphs] | ^
  19379. 1534.45 s [algebraic-graphs]
  19380. 1534.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19381. 1534.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19382. 1534.45 s [algebraic-graphs] will become an error in a future GHC release.
  19383. 1534.45 s [algebraic-graphs] Suggested fix:
  19384. 1534.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19385. 1534.45 s [algebraic-graphs] |
  19386. 1534.45 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19387. 1534.45 s [algebraic-graphs] | ^
  19388. 1534.45 s [algebraic-graphs]
  19389. 1534.45 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19390. 1534.45 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 )
  19391. 1534.90 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19392. 1534.90 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 )
  19393. 1534.90 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19394. 1535.61 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 )
  19395. 1536.05 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 )
  19396. 1536.39 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19397. 1536.39 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19398. 1536.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19399. 1536.39 s [algebraic-graphs] will become an error in a future GHC release.
  19400. 1536.39 s [algebraic-graphs] Suggested fix:
  19401. 1536.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19402. 1536.39 s [algebraic-graphs] |
  19403. 1536.39 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19404. 1536.39 s [algebraic-graphs] | ^
  19405. 1536.39 s [algebraic-graphs]
  19406. 1536.39 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 )
  19407. 1536.39 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19408. 1536.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19409. 1536.39 s [algebraic-graphs] will become an error in a future GHC release.
  19410. 1536.39 s [algebraic-graphs] Suggested fix:
  19411. 1536.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19412. 1536.39 s [algebraic-graphs] |
  19413. 1536.39 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19414. 1536.39 s [algebraic-graphs] | ^
  19415. 1536.39 s [algebraic-graphs]
  19416. 1536.39 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19417. 1536.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19418. 1536.39 s [algebraic-graphs] will become an error in a future GHC release.
  19419. 1536.39 s [algebraic-graphs] Suggested fix:
  19420. 1536.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19421. 1536.39 s [algebraic-graphs] |
  19422. 1536.39 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19423. 1536.39 s [algebraic-graphs] | ^
  19424. 1536.39 s [algebraic-graphs]
  19425. 1536.39 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19426. 1536.39 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19427. 1536.39 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 )
  19428. 1536.57 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 )
  19429. 1536.57 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 )
  19430. 1536.57 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 )
  19431. 1536.63 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19432. 1538.12 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  19433. 1538.13 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  19434. 1538.26 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 )
  19435. 1540.06 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 )
  19436. 1542.86 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 )
  19437. 1542.86 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 )
  19438. 1542.98 s [algebraic-graphs] [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
  19439. 1542.98 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:71: warning: [GHC-00834] [-Wview-pattern-signatures]
  19440. 1542.98 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19441. 1542.98 s [algebraic-graphs] • This code might stop working in a future GHC release
  19442. 1542.98 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19443. 1542.98 s [algebraic-graphs] unless the view function is an endofunction.
  19444. 1542.98 s [algebraic-graphs] • Current parse: ‘apply -> (f1 :: Int -> Int)’
  19445. 1542.98 s [algebraic-graphs] Future parse: ‘(apply -> f1) :: Int -> Int’
  19446. 1542.98 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19447. 1542.98 s [algebraic-graphs] |
  19448. 1542.98 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19449. 1542.98 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19450. 1542.98 s [algebraic-graphs]
  19451. 1542.98 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:99: warning: [GHC-00834] [-Wview-pattern-signatures]
  19452. 1542.98 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19453. 1542.98 s [algebraic-graphs] • This code might stop working in a future GHC release
  19454. 1542.98 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19455. 1542.98 s [algebraic-graphs] unless the view function is an endofunction.
  19456. 1542.98 s [algebraic-graphs] • Current parse: ‘apply -> (g1 :: Int -> Int)’
  19457. 1542.98 s [algebraic-graphs] Future parse: ‘(apply -> g1) :: Int -> Int’
  19458. 1542.98 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19459. 1542.98 s [algebraic-graphs] |
  19460. 1542.98 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19461. 1542.98 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19462. 1542.98 s [algebraic-graphs]
  19463. 1542.98 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:127: warning: [GHC-00834] [-Wview-pattern-signatures]
  19464. 1542.98 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19465. 1542.98 s [algebraic-graphs] • This code might stop working in a future GHC release
  19466. 1542.98 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19467. 1542.98 s [algebraic-graphs] unless the view function is an endofunction.
  19468. 1542.98 s [algebraic-graphs] • Current parse: ‘apply -> (f2 :: Int -> Int)’
  19469. 1542.98 s [algebraic-graphs] Future parse: ‘(apply -> f2) :: Int -> Int’
  19470. 1542.98 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19471. 1542.98 s [algebraic-graphs] |
  19472. 1542.98 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19473. 1542.98 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19474. 1542.98 s [algebraic-graphs]
  19475. 1542.98 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:155: warning: [GHC-00834] [-Wview-pattern-signatures]
  19476. 1542.98 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19477. 1542.98 s [algebraic-graphs] • This code might stop working in a future GHC release
  19478. 1542.98 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19479. 1542.98 s [algebraic-graphs] unless the view function is an endofunction.
  19480. 1542.98 s [algebraic-graphs] • Current parse: ‘apply -> (g2 :: Int -> Int)’
  19481. 1542.98 s [algebraic-graphs] Future parse: ‘(apply -> g2) :: Int -> Int’
  19482. 1542.98 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19483. 1542.98 s [algebraic-graphs] |
  19484. 1542.98 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19485. 1542.98 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19486. 1542.98 s [algebraic-graphs]
  19487. 1544.66 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 )
  19488. 1544.66 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 )
  19489. 1544.66 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 )
  19490. 1544.66 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:50: warning: [GHC-00834] [-Wview-pattern-signatures]
  19491. 1544.66 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19492. 1544.66 s [algebraic-graphs] • This code might stop working in a future GHC release
  19493. 1544.66 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19494. 1544.66 s [algebraic-graphs] unless the view function is an endofunction.
  19495. 1544.66 s [algebraic-graphs] • Current parse: ‘apply -> (f :: Int -> Int)’
  19496. 1544.66 s [algebraic-graphs] Future parse: ‘(apply -> f) :: Int -> Int’
  19497. 1544.66 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19498. 1544.66 s [algebraic-graphs] |
  19499. 1544.66 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  19500. 1544.66 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  19501. 1544.66 s [algebraic-graphs]
  19502. 1544.66 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:77: warning: [GHC-00834] [-Wview-pattern-signatures]
  19503. 1544.66 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19504. 1544.66 s [algebraic-graphs] • This code might stop working in a future GHC release
  19505. 1544.66 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19506. 1544.66 s [algebraic-graphs] unless the view function is an endofunction.
  19507. 1544.66 s [algebraic-graphs] • Current parse: ‘apply -> (g :: Int -> Int)’
  19508. 1544.66 s [algebraic-graphs] Future parse: ‘(apply -> g) :: Int -> Int’
  19509. 1544.66 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19510. 1544.66 s [algebraic-graphs] |
  19511. 1544.66 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  19512. 1544.66 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  19513. 1544.66 s [algebraic-graphs]
  19514. 1549.14 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 )
  19515. 1549.33 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 )
  19516. 1549.33 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 )
  19517. 1550.05 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 )
  19518. 1550.05 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 )
  19519. 1550.05 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 )
  19520. 1551.06 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 )
  19521. 1551.06 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 )
  19522. 1551.06 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 )
  19523. 1551.06 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 )
  19524. 1551.06 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 )
  19525. 1551.06 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 )
  19526. 1551.06 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19527. 1551.06 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19528. 1551.06 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19529. 1551.06 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19530. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19531. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19532. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19533. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19534. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19535. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19536. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19537. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19538. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19539. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19540. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19541. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19542. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19543. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19544. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19545. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19546. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19547. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19548. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19549. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19550. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19551. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19552. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19553. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19554. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19555. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19556. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19557. 1551.07 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19558. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19559. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19560. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19561. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19562. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19563. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19564. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19565. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19566. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19567. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19568. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19569. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19570. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19571. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19572. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19573. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19574. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19575. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19576. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19577. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19578. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19579. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19580. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19581. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19582. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19583. 1551.08 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19584. 1551.08 s [algebraic-graphs] inspection testing successful
  19585. 1551.08 s [algebraic-graphs] expected successes: 58
  19586. 1551.08 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 )
  19587. 1551.08 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 )
  19588. 1551.08 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 )
  19589. 1552.00 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19590. 1553.34 s [algebraic-graphs] buildPhase completed in 34 seconds
  19591. 1553.34 s [algebraic-graphs] Phase: checkPhase
  19592. 1553.71 s [algebraic-graphs] Running 1 test suites...
  19593. 1553.71 s [algebraic-graphs] Test suite main: RUNNING...
  19594. 1562.59 s [algebraic-graphs]
  19595. 1562.59 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19596. 1562.63 s [algebraic-graphs] OK: show empty == "empty"
  19597. 1562.63 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19598. 1562.63 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19599. 1562.63 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19600. 1562.63 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19601. 1562.63 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19602. 1562.63 s [algebraic-graphs]
  19603. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19604. 1562.63 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19605. 1562.63 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19606. 1562.63 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19607. 1562.63 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19608. 1562.63 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19609. 1562.63 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19610. 1562.63 s [algebraic-graphs]
  19611. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19612. 1562.63 s [algebraic-graphs] OK: isEmpty empty == True
  19613. 1562.63 s [algebraic-graphs] OK: hasVertex x empty == False
  19614. 1562.63 s [algebraic-graphs] OK: vertexCount empty == 0
  19615. 1562.63 s [algebraic-graphs] OK: edgeCount empty == 0
  19616. 1562.63 s [algebraic-graphs]
  19617. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19618. 1562.63 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19619. 1562.63 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19620. 1562.63 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19621. 1562.63 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19622. 1562.63 s [algebraic-graphs]
  19623. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19624. 1562.63 s [algebraic-graphs] OK: vertices [] == empty
  19625. 1562.63 s [algebraic-graphs] OK: vertices [x] == vertex x
  19626. 1562.63 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19627. 1562.63 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19628. 1562.63 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19629. 1562.63 s [algebraic-graphs]
  19630. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  19631. 1562.63 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  19632. 1562.63 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  19633. 1562.63 s [algebraic-graphs]
  19634. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  19635. 1562.63 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  19636. 1562.63 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  19637. 1562.63 s [algebraic-graphs]
  19638. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  19639. 1562.63 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19640. 1562.63 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19641. 1562.63 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19642. 1562.63 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  19643. 1562.63 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19644. 1562.63 s [algebraic-graphs]
  19645. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  19646. 1562.63 s [algebraic-graphs] OK: isEmpty empty == True
  19647. 1562.63 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19648. 1562.63 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19649. 1562.63 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  19650. 1562.63 s [algebraic-graphs]
  19651. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  19652. 1562.63 s [algebraic-graphs] OK: hasVertex x empty == False
  19653. 1562.63 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19654. 1562.63 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19655. 1562.63 s [algebraic-graphs]
  19656. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  19657. 1562.63 s [algebraic-graphs] OK: hasEdge x y empty == False
  19658. 1562.63 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19659. 1562.63 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  19660. 1562.63 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19661. 1562.63 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19662. 1562.63 s [algebraic-graphs]
  19663. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  19664. 1562.63 s [algebraic-graphs] OK: vertexCount empty == 0
  19665. 1562.63 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19666. 1562.63 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19667. 1562.63 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19668. 1562.63 s [algebraic-graphs]
  19669. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  19670. 1562.63 s [algebraic-graphs] OK: edgeCount empty == 0
  19671. 1562.63 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19672. 1562.63 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  19673. 1562.63 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19674. 1562.63 s [algebraic-graphs]
  19675. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  19676. 1562.63 s [algebraic-graphs] OK: vertexList empty == []
  19677. 1562.63 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19678. 1562.63 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19679. 1562.63 s [algebraic-graphs]
  19680. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  19681. 1562.63 s [algebraic-graphs] OK: edgeList empty == []
  19682. 1562.63 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19683. 1562.63 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  19684. 1562.63 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19685. 1562.63 s [algebraic-graphs]
  19686. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  19687. 1562.63 s [algebraic-graphs] OK: adjacencyList empty == []
  19688. 1562.63 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19689. 1562.63 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  19690. 1562.63 s [algebraic-graphs]
  19691. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  19692. 1562.63 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19693. 1562.63 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19694. 1562.63 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19695. 1562.63 s [algebraic-graphs]
  19696. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  19697. 1562.63 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19698. 1562.63 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19699. 1562.63 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  19700. 1562.63 s [algebraic-graphs]
  19701. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  19702. 1562.63 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19703. 1562.63 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19704. 1562.63 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  19705. 1562.63 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  19706. 1562.63 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  19707. 1562.63 s [algebraic-graphs]
  19708. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  19709. 1562.63 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19710. 1562.63 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19711. 1562.63 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  19712. 1562.63 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  19713. 1562.63 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  19714. 1562.63 s [algebraic-graphs]
  19715. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  19716. 1562.63 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19717. 1562.63 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19718. 1562.63 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  19719. 1562.63 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19720. 1562.63 s [algebraic-graphs]
  19721. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  19722. 1562.63 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  19723. 1562.63 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19724. 1562.63 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19725. 1562.63 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  19726. 1562.63 s [algebraic-graphs]
  19727. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  19728. 1562.63 s [algebraic-graphs] OK: transpose empty == empty
  19729. 1562.63 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19730. 1562.63 s [algebraic-graphs] OK: transpose . transpose == id
  19731. 1562.63 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19732. 1562.63 s [algebraic-graphs]
  19733. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  19734. 1562.63 s [algebraic-graphs] OK: induce (const True ) x == x
  19735. 1562.63 s [algebraic-graphs] OK: induce (const False) x == empty
  19736. 1562.63 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19737. 1562.63 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19738. 1562.63 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19739. 1562.63 s [algebraic-graphs]
  19740. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  19741. 1562.63 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19742. 1562.63 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  19743. 1562.63 s [algebraic-graphs]
  19744. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  19745. 1562.63 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  19746. 1562.63 s [algebraic-graphs]
  19747. 1562.63 s [algebraic-graphs] OK: box x y ~~ box y x
  19748. 1562.63 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19749. 1562.63 s [algebraic-graphs] OK: box x empty ~~ empty
  19750. 1562.63 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19751. 1562.63 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19752. 1562.63 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19753. 1562.63 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19754. 1562.63 s [algebraic-graphs]
  19755. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  19756. 1562.63 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19757. 1562.63 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19758. 1562.63 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  19759. 1562.63 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19760. 1562.63 s [algebraic-graphs]
  19761. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  19762. 1562.63 s [algebraic-graphs] OK: topSort empty == []
  19763. 1562.63 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  19764. 1562.63 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  19765. 1562.63 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  19766. 1562.63 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  19767. 1562.63 s [algebraic-graphs]
  19768. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  19769. 1562.63 s [algebraic-graphs] OK: scc empty == empty
  19770. 1562.63 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  19771. 1562.63 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  19772. 1562.63 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  19773. 1562.63 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  19774. 1562.63 s [algebraic-graphs]
  19775. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  19776. 1562.63 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  19777. 1562.63 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  19778. 1562.63 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  19779. 1562.63 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  19780. 1562.63 s [algebraic-graphs]
  19781. 1562.63 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  19782. 1562.63 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  19783. 1562.63 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  19784. 1562.63 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  19785. 1562.63 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  19786. 1562.63 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  19787. 1562.63 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  19788. 1566.39 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  19789. 1566.39 s [algebraic-graphs]
  19790. 1566.39 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  19791. 1566.39 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  19792. 1566.39 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  19793. 1566.39 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  19794. 1566.39 s [algebraic-graphs]
  19795. 1566.39 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  19796. 1566.39 s [algebraic-graphs] OK: Arbitrary
  19797. 1566.39 s [algebraic-graphs] OK: empty
  19798. 1566.39 s [algebraic-graphs] OK: vertex
  19799. 1566.39 s [algebraic-graphs] OK: vertices
  19800. 1566.39 s [algebraic-graphs] OK: union
  19801. 1566.39 s [algebraic-graphs] OK: join
  19802. 1566.39 s [algebraic-graphs] OK: transpose
  19803. 1566.39 s [algebraic-graphs] OK: box
  19804. 1566.39 s [algebraic-graphs] OK: transitiveClosure
  19805. 1566.39 s [algebraic-graphs] OK: scc
  19806. 1566.39 s [algebraic-graphs] OK: toAcyclic
  19807. 1566.39 s [algebraic-graphs] OK: toAcyclicOrd
  19808. 1566.39 s [algebraic-graphs]
  19809. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap ============
  19810. 1566.39 s [algebraic-graphs] OK: Axioms of graphs
  19811. 1566.39 s [algebraic-graphs]
  19812. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  19813. 1566.39 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  19814. 1566.39 s [algebraic-graphs]
  19815. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  19816. 1566.39 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  19817. 1566.39 s [algebraic-graphs]
  19818. 1566.39 s [algebraic-graphs] OK: consistent empty == True
  19819. 1566.39 s [algebraic-graphs] OK: consistent (vertex x) == True
  19820. 1566.39 s [algebraic-graphs] OK: consistent (overlay x y) == True
  19821. 1566.39 s [algebraic-graphs] OK: consistent (connect x y) == True
  19822. 1566.39 s [algebraic-graphs] OK: consistent (edge x y) == True
  19823. 1566.39 s [algebraic-graphs] OK: consistent (edges xs) == True
  19824. 1566.39 s [algebraic-graphs] OK: consistent (stars xs) == True
  19825. 1566.39 s [algebraic-graphs]
  19826. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  19827. 1566.39 s [algebraic-graphs] OK: show (empty ) == "empty"
  19828. 1566.39 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19829. 1566.39 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19830. 1566.39 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19831. 1566.39 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19832. 1566.39 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19833. 1566.39 s [algebraic-graphs]
  19834. 1566.39 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19835. 1566.39 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19836. 1566.39 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19837. 1566.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19838. 1566.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19839. 1566.39 s [algebraic-graphs]
  19840. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  19841. 1566.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19842. 1566.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19843. 1566.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19844. 1566.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19845. 1566.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19846. 1566.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19847. 1566.39 s [algebraic-graphs] OK: x <= x + y
  19848. 1566.39 s [algebraic-graphs] OK: x + y <= x * y
  19849. 1566.39 s [algebraic-graphs]
  19850. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  19851. 1566.39 s [algebraic-graphs] OK: isEmpty empty == True
  19852. 1566.39 s [algebraic-graphs] OK: hasVertex x empty == False
  19853. 1566.39 s [algebraic-graphs] OK: vertexCount empty == 0
  19854. 1566.39 s [algebraic-graphs] OK: edgeCount empty == 0
  19855. 1566.39 s [algebraic-graphs]
  19856. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  19857. 1566.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19858. 1566.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19859. 1566.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19860. 1566.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19861. 1566.39 s [algebraic-graphs]
  19862. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  19863. 1566.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19864. 1566.39 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19865. 1566.39 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19866. 1566.39 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19867. 1566.39 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19868. 1566.39 s [algebraic-graphs]
  19869. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  19870. 1566.39 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19871. 1566.39 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19872. 1566.39 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19873. 1566.39 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19874. 1566.39 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19875. 1566.39 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19876. 1566.39 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19877. 1566.39 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19878. 1566.39 s [algebraic-graphs]
  19879. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  19880. 1566.39 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19881. 1566.39 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19882. 1566.39 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19883. 1566.39 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19884. 1566.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19885. 1566.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19886. 1566.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19887. 1566.39 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19888. 1566.39 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19889. 1566.39 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19890. 1566.39 s [algebraic-graphs]
  19891. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  19892. 1566.39 s [algebraic-graphs] OK: vertices [] == empty
  19893. 1566.39 s [algebraic-graphs] OK: vertices [x] == vertex x
  19894. 1566.39 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19895. 1566.39 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19896. 1566.39 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19897. 1566.39 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19898. 1566.39 s [algebraic-graphs]
  19899. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  19900. 1566.39 s [algebraic-graphs] OK: edges [] == empty
  19901. 1566.39 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19902. 1566.39 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19903. 1566.39 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19904. 1566.39 s [algebraic-graphs]
  19905. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  19906. 1566.39 s [algebraic-graphs] OK: overlays [] == empty
  19907. 1566.39 s [algebraic-graphs] OK: overlays [x] == x
  19908. 1566.39 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19909. 1566.39 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19910. 1566.39 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19911. 1566.39 s [algebraic-graphs]
  19912. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  19913. 1566.39 s [algebraic-graphs] OK: connects [] == empty
  19914. 1566.39 s [algebraic-graphs] OK: connects [x] == x
  19915. 1566.39 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19916. 1566.39 s [algebraic-graphs] OK: connects == foldr connect empty
  19917. 1566.39 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19918. 1566.39 s [algebraic-graphs]
  19919. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  19920. 1566.39 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  19921. 1566.39 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  19922. 1566.39 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  19923. 1566.39 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  19924. 1566.39 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  19925. 1566.39 s [algebraic-graphs]
  19926. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  19927. 1566.39 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19928. 1566.39 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19929. 1566.39 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19930. 1566.39 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19931. 1566.39 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19932. 1566.39 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19933. 1566.39 s [algebraic-graphs]
  19934. 1566.39 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  19935. 1566.40 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19936. 1566.40 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19937. 1566.40 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19938. 1566.40 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19939. 1566.40 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19940. 1566.40 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19941. 1566.40 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19942. 1566.40 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19943. 1566.40 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19944. 1566.40 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19945. 1566.40 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19946. 1566.40 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19947. 1566.40 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19948. 1566.40 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19949. 1566.40 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19950. 1566.40 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19951. 1566.40 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19952. 1566.40 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19953. 1566.40 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19954. 1566.40 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19955. 1566.40 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19956. 1566.40 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19957. 1566.40 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19958. 1566.40 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19959. 1566.40 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19960. 1566.40 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19961. 1566.40 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19962. 1566.40 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19963. 1566.40 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19964. 1566.40 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19965. 1566.40 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19966. 1566.40 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19967. 1566.40 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19968. 1566.40 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19969. 1567.15 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19970. 1567.15 s [algebraic-graphs]
  19971. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  19972. 1567.15 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19973. 1567.15 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19974. 1567.15 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19975. 1567.15 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19976. 1567.15 s [algebraic-graphs]
  19977. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  19978. 1567.15 s [algebraic-graphs] OK: isEmpty empty == True
  19979. 1567.15 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19980. 1567.15 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19981. 1567.15 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19982. 1567.15 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19983. 1567.15 s [algebraic-graphs]
  19984. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  19985. 1567.15 s [algebraic-graphs] OK: hasVertex x empty == False
  19986. 1567.15 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19987. 1567.15 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19988. 1567.15 s [algebraic-graphs]
  19989. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  19990. 1567.15 s [algebraic-graphs] OK: hasEdge x y empty == False
  19991. 1567.15 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19992. 1567.15 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19993. 1567.15 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19994. 1567.15 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19995. 1567.15 s [algebraic-graphs]
  19996. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  19997. 1567.15 s [algebraic-graphs] OK: vertexCount empty == 0
  19998. 1567.15 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19999. 1567.15 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20000. 1567.15 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20001. 1567.15 s [algebraic-graphs]
  20002. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20003. 1567.15 s [algebraic-graphs] OK: edgeCount empty == 0
  20004. 1567.15 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20005. 1567.15 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20006. 1567.15 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20007. 1567.15 s [algebraic-graphs]
  20008. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20009. 1567.15 s [algebraic-graphs] OK: vertexList empty == []
  20010. 1567.15 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20011. 1567.15 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20012. 1567.15 s [algebraic-graphs]
  20013. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20014. 1567.15 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20015. 1567.15 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20016. 1567.15 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20017. 1567.15 s [algebraic-graphs]
  20018. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20019. 1567.15 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20020. 1567.15 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20021. 1567.15 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20022. 1567.15 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20023. 1567.15 s [algebraic-graphs]
  20024. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20025. 1567.15 s [algebraic-graphs] OK: edgeList empty == []
  20026. 1567.15 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20027. 1567.15 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20028. 1567.15 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20029. 1567.15 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20030. 1567.15 s [algebraic-graphs]
  20031. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20032. 1567.15 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20033. 1567.15 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20034. 1567.15 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20035. 1567.15 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20036. 1567.15 s [algebraic-graphs]
  20037. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20038. 1567.15 s [algebraic-graphs] OK: adjacencyList empty == []
  20039. 1567.15 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20040. 1567.15 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20041. 1567.15 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20042. 1567.15 s [algebraic-graphs]
  20043. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20044. 1567.15 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20045. 1567.15 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20046. 1567.15 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20047. 1567.15 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20048. 1567.15 s [algebraic-graphs]
  20049. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20050. 1567.15 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20051. 1567.15 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20052. 1567.15 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20053. 1567.15 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20054. 1567.15 s [algebraic-graphs]
  20055. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20056. 1567.15 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20057. 1567.15 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20058. 1567.15 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20059. 1567.15 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20060. 1567.15 s [algebraic-graphs]
  20061. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20062. 1567.15 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20063. 1567.15 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20064. 1567.15 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20065. 1567.15 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20066. 1567.15 s [algebraic-graphs]
  20067. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20068. 1567.15 s [algebraic-graphs] OK: path [] == empty
  20069. 1567.15 s [algebraic-graphs] OK: path [x] == vertex x
  20070. 1567.15 s [algebraic-graphs] OK: path [x,y] == edge x y
  20071. 1567.15 s [algebraic-graphs]
  20072. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20073. 1567.15 s [algebraic-graphs] OK: circuit [] == empty
  20074. 1567.15 s [algebraic-graphs] OK: circuit [x] == edge x x
  20075. 1567.15 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20076. 1567.15 s [algebraic-graphs]
  20077. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20078. 1567.15 s [algebraic-graphs] OK: clique [] == empty
  20079. 1567.15 s [algebraic-graphs] OK: clique [x] == vertex x
  20080. 1567.15 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20081. 1567.15 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20082. 1567.15 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20083. 1567.15 s [algebraic-graphs]
  20084. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20085. 1567.15 s [algebraic-graphs] OK: biclique [] [] == empty
  20086. 1567.15 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20087. 1567.15 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20088. 1567.15 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20089. 1567.15 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20090. 1567.15 s [algebraic-graphs]
  20091. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20092. 1567.15 s [algebraic-graphs] OK: star x [] == vertex x
  20093. 1567.15 s [algebraic-graphs] OK: star x [y] == edge x y
  20094. 1567.15 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20095. 1567.15 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20096. 1567.15 s [algebraic-graphs]
  20097. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20098. 1567.15 s [algebraic-graphs] OK: stars [] == empty
  20099. 1567.15 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20100. 1567.15 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20101. 1567.15 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20102. 1567.15 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20103. 1567.15 s [algebraic-graphs] OK: stars . adjacencyList == id
  20104. 1567.15 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20105. 1567.15 s [algebraic-graphs]
  20106. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20107. 1567.15 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20108. 1567.15 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20109. 1567.15 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20110. 1567.15 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20111. 1567.15 s [algebraic-graphs]
  20112. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20113. 1567.15 s [algebraic-graphs] OK: forest [] == empty
  20114. 1567.15 s [algebraic-graphs] OK: forest [x] == tree x
  20115. 1567.15 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20116. 1567.15 s [algebraic-graphs] OK: forest == overlays . map tree
  20117. 1567.15 s [algebraic-graphs]
  20118. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20119. 1567.15 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20120. 1567.15 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20121. 1567.15 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20122. 1567.15 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20123. 1567.15 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20124. 1567.15 s [algebraic-graphs]
  20125. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20126. 1567.15 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20127. 1567.15 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20128. 1567.15 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20129. 1567.15 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20130. 1567.15 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20131. 1567.15 s [algebraic-graphs]
  20132. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20133. 1567.15 s [algebraic-graphs] OK: replaceVertex x x == id
  20134. 1567.15 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20135. 1567.15 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20136. 1567.15 s [algebraic-graphs]
  20137. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20138. 1567.15 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20139. 1567.15 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20140. 1567.15 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20141. 1567.15 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20142. 1567.15 s [algebraic-graphs]
  20143. 1567.15 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20144. 1567.16 s [algebraic-graphs] OK: transpose empty == empty
  20145. 1567.16 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20146. 1567.16 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20147. 1567.16 s [algebraic-graphs] OK: transpose . transpose == id
  20148. 1567.16 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20149. 1567.16 s [algebraic-graphs]
  20150. 1567.16 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20151. 1567.16 s [algebraic-graphs] OK: gmap f empty == empty
  20152. 1567.16 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20153. 1567.16 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20154. 1567.16 s [algebraic-graphs] OK: gmap id == id
  20155. 1567.16 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20156. 1567.16 s [algebraic-graphs]
  20157. 1567.16 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20158. 1567.16 s [algebraic-graphs] OK: induce (const True ) x == x
  20159. 1567.16 s [algebraic-graphs] OK: induce (const False) x == empty
  20160. 1567.16 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20161. 1567.16 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20162. 1567.16 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20163. 1567.16 s [algebraic-graphs]
  20164. 1567.16 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20165. 1567.16 s [algebraic-graphs] OK: compose empty x == empty
  20166. 1567.16 s [algebraic-graphs] OK: compose x empty == empty
  20167. 1567.16 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20168. 1567.16 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20169. 1567.16 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20170. 1567.16 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20171. 1567.39 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20172. 1567.39 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20173. 1567.39 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20174. 1567.39 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20175. 1567.39 s [algebraic-graphs]
  20176. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20177. 1567.39 s [algebraic-graphs] OK: closure empty == empty
  20178. 1567.39 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20179. 1567.39 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20180. 1567.39 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20181. 1567.39 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20182. 1567.39 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20183. 1567.39 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20184. 1567.39 s [algebraic-graphs] OK: closure . closure == closure
  20185. 1567.39 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20186. 1567.39 s [algebraic-graphs]
  20187. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20188. 1567.39 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20189. 1567.39 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20190. 1567.39 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20191. 1567.39 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20192. 1567.39 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20193. 1567.39 s [algebraic-graphs]
  20194. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20195. 1567.39 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20196. 1567.39 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20197. 1567.39 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20198. 1567.39 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20199. 1567.39 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20200. 1567.39 s [algebraic-graphs]
  20201. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20202. 1567.39 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20203. 1567.39 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20204. 1567.39 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20205. 1567.39 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20206. 1567.39 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20207. 1567.39 s [algebraic-graphs]
  20208. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20209. 1567.39 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20210. 1567.39 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20211. 1567.39 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20212. 1567.39 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20213. 1567.39 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20214. 1567.39 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20215. 1567.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20216. 1567.39 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20217. 1567.39 s [algebraic-graphs] OK: bfsForest x [] == []
  20218. 1567.39 s [algebraic-graphs] OK: bfsForest empty vs == []
  20219. 1567.39 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20220. 1567.39 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20221. 1567.39 s [algebraic-graphs]
  20222. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20223. 1567.39 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20224. 1567.39 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20225. 1567.39 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20226. 1567.39 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20227. 1567.39 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20228. 1567.39 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20229. 1567.39 s [algebraic-graphs] OK: bfs empty vs == []
  20230. 1567.39 s [algebraic-graphs] OK: bfs x [] == []
  20231. 1567.39 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20232. 1567.39 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20233. 1567.39 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20234. 1567.39 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20235. 1567.39 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20236. 1567.39 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20237. 1567.39 s [algebraic-graphs]
  20238. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20239. 1567.39 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20240. 1567.39 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20241. 1567.39 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20242. 1567.39 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20243. 1567.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20244. 1567.39 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20245. 1567.39 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20246. 1567.39 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20247. 1567.39 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20248. 1567.39 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20249. 1567.39 s [algebraic-graphs]
  20250. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20251. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20252. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20253. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20254. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20255. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20256. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20257. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20258. 1567.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20259. 1567.39 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20260. 1567.39 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20261. 1567.39 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20262. 1567.39 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20263. 1567.39 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20264. 1567.39 s [algebraic-graphs]
  20265. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20266. 1567.39 s [algebraic-graphs] OK: dfs empty vs == []
  20267. 1567.39 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20268. 1567.39 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20269. 1567.39 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20270. 1567.39 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20271. 1567.39 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20272. 1567.39 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20273. 1567.39 s [algebraic-graphs] OK: dfs x [] == []
  20274. 1567.39 s [algebraic-graphs]
  20275. 1567.39 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20276. 1567.39 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20277. 1567.39 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20278. 1567.39 s [algebraic-graphs]
  20279. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20280. 1567.39 s [algebraic-graphs] OK: reachable empty x == []
  20281. 1567.39 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20282. 1567.39 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20283. 1567.39 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20284. 1567.39 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20285. 1567.39 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20286. 1567.39 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20287. 1567.39 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20288. 1567.39 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20289. 1567.39 s [algebraic-graphs]
  20290. 1567.39 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20291. 1567.39 s [algebraic-graphs]
  20292. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20293. 1567.39 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20294. 1567.39 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20295. 1567.39 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20296. 1567.39 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20297. 1567.39 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20298. 1567.39 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20299. 1567.39 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20300. 1567.39 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20301. 1567.39 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20302. 1567.39 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20303. 1567.39 s [algebraic-graphs]
  20304. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20305. 1567.39 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20306. 1567.39 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20307. 1567.39 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20308. 1567.39 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20309. 1567.39 s [algebraic-graphs]
  20310. 1567.39 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20311. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20312. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20313. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20314. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20315. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20316. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20317. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20318. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20319. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20320. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20321. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20322. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20323. 1567.39 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20324. 1572.04 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20325. 1572.04 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20326. 1572.19 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20327. 1572.19 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20328. 1572.19 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20329. 1572.19 s [algebraic-graphs]
  20330. 1572.19 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20331. 1572.19 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20332. 1572.19 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20333. 1572.19 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20334. 1572.19 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20335. 1572.19 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20336. 1572.19 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20337. 1572.19 s [algebraic-graphs]
  20338. 1572.19 s [algebraic-graphs] ============ AdjacencyMap ============
  20339. 1572.19 s [algebraic-graphs] OK: Axioms of graphs
  20340. 1572.19 s [algebraic-graphs]
  20341. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20342. 1572.19 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20343. 1572.19 s [algebraic-graphs]
  20344. 1572.19 s [algebraic-graphs] OK: consistent empty == True
  20345. 1572.19 s [algebraic-graphs] OK: consistent (vertex x) == True
  20346. 1572.19 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20347. 1572.19 s [algebraic-graphs] OK: consistent (connect x y) == True
  20348. 1572.19 s [algebraic-graphs] OK: consistent (edge x y) == True
  20349. 1572.19 s [algebraic-graphs] OK: consistent (edges xs) == True
  20350. 1572.19 s [algebraic-graphs] OK: consistent (stars xs) == True
  20351. 1572.19 s [algebraic-graphs]
  20352. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20353. 1572.19 s [algebraic-graphs] OK: show (empty ) == "empty"
  20354. 1572.19 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20355. 1572.19 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20356. 1572.19 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20357. 1572.19 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20358. 1572.19 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20359. 1572.19 s [algebraic-graphs]
  20360. 1572.19 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20361. 1572.19 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20362. 1572.19 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20363. 1572.19 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20364. 1572.19 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20365. 1572.19 s [algebraic-graphs]
  20366. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20367. 1572.19 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20368. 1572.19 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20369. 1572.19 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20370. 1572.19 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20371. 1572.19 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20372. 1572.19 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20373. 1572.19 s [algebraic-graphs] OK: x <= x + y
  20374. 1572.19 s [algebraic-graphs] OK: x + y <= x * y
  20375. 1572.19 s [algebraic-graphs]
  20376. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20377. 1572.19 s [algebraic-graphs] OK: isEmpty empty == True
  20378. 1572.19 s [algebraic-graphs] OK: hasVertex x empty == False
  20379. 1572.19 s [algebraic-graphs] OK: vertexCount empty == 0
  20380. 1572.19 s [algebraic-graphs] OK: edgeCount empty == 0
  20381. 1572.19 s [algebraic-graphs]
  20382. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20383. 1572.19 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20384. 1572.19 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20385. 1572.19 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20386. 1572.19 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20387. 1572.19 s [algebraic-graphs]
  20388. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20389. 1572.19 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20390. 1572.19 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20391. 1572.19 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20392. 1572.19 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20393. 1572.19 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20394. 1572.19 s [algebraic-graphs]
  20395. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20396. 1572.19 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20397. 1572.19 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20398. 1572.19 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20399. 1572.19 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20400. 1572.19 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20401. 1572.19 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20402. 1572.19 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20403. 1572.19 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20404. 1572.19 s [algebraic-graphs]
  20405. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20406. 1572.19 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20407. 1572.19 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20408. 1572.19 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20409. 1572.19 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20410. 1572.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20411. 1572.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20412. 1572.19 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20413. 1572.19 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20414. 1572.19 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20415. 1572.19 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20416. 1572.19 s [algebraic-graphs]
  20417. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20418. 1572.19 s [algebraic-graphs] OK: vertices [] == empty
  20419. 1572.19 s [algebraic-graphs] OK: vertices [x] == vertex x
  20420. 1572.19 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20421. 1572.19 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20422. 1572.19 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20423. 1572.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20424. 1572.19 s [algebraic-graphs]
  20425. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20426. 1572.19 s [algebraic-graphs] OK: edges [] == empty
  20427. 1572.19 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20428. 1572.19 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20429. 1572.19 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20430. 1572.19 s [algebraic-graphs]
  20431. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20432. 1572.19 s [algebraic-graphs] OK: overlays [] == empty
  20433. 1572.19 s [algebraic-graphs] OK: overlays [x] == x
  20434. 1572.19 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20435. 1572.19 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20436. 1572.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20437. 1572.19 s [algebraic-graphs]
  20438. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20439. 1572.19 s [algebraic-graphs] OK: connects [] == empty
  20440. 1572.19 s [algebraic-graphs] OK: connects [x] == x
  20441. 1572.19 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20442. 1572.19 s [algebraic-graphs] OK: connects == foldr connect empty
  20443. 1572.19 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20444. 1572.19 s [algebraic-graphs]
  20445. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20446. 1572.19 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20447. 1572.19 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20448. 1572.19 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20449. 1572.19 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20450. 1572.19 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20451. 1572.19 s [algebraic-graphs]
  20452. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20453. 1572.19 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20454. 1572.19 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20455. 1572.19 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20456. 1572.19 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20457. 1572.19 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20458. 1572.19 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20459. 1572.19 s [algebraic-graphs]
  20460. 1572.19 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20461. 1572.19 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20462. 1572.19 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20463. 1572.19 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20464. 1572.19 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20465. 1572.19 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20466. 1572.19 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20467. 1572.19 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20468. 1572.19 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20469. 1572.19 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20470. 1572.19 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20471. 1572.19 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20472. 1572.19 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20473. 1572.19 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20474. 1572.19 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20475. 1572.19 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20476. 1572.19 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20477. 1572.19 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20478. 1572.19 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20479. 1572.19 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20480. 1572.19 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20481. 1572.19 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20482. 1572.19 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20483. 1572.19 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20484. 1572.19 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20485. 1572.19 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20486. 1572.19 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20487. 1572.19 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20488. 1572.19 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20489. 1572.19 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20490. 1572.19 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20491. 1572.19 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20492. 1572.19 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20493. 1572.19 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20494. 1573.73 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20495. 1573.73 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20496. 1573.73 s [algebraic-graphs]
  20497. 1573.73 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20498. 1573.73 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20499. 1573.73 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20500. 1573.73 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20501. 1573.73 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20502. 1573.74 s [algebraic-graphs]
  20503. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20504. 1573.74 s [algebraic-graphs] OK: isEmpty empty == True
  20505. 1573.74 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20506. 1573.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20507. 1573.74 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20508. 1573.74 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20509. 1573.74 s [algebraic-graphs]
  20510. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20511. 1573.74 s [algebraic-graphs] OK: hasVertex x empty == False
  20512. 1573.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20513. 1573.74 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20514. 1573.74 s [algebraic-graphs]
  20515. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20516. 1573.74 s [algebraic-graphs] OK: hasEdge x y empty == False
  20517. 1573.74 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20518. 1573.74 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20519. 1573.74 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20520. 1573.74 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20521. 1573.74 s [algebraic-graphs]
  20522. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20523. 1573.74 s [algebraic-graphs] OK: vertexCount empty == 0
  20524. 1573.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20525. 1573.74 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20526. 1573.74 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20527. 1573.74 s [algebraic-graphs]
  20528. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20529. 1573.74 s [algebraic-graphs] OK: edgeCount empty == 0
  20530. 1573.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20531. 1573.74 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20532. 1573.74 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20533. 1573.74 s [algebraic-graphs]
  20534. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20535. 1573.74 s [algebraic-graphs] OK: vertexList empty == []
  20536. 1573.74 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20537. 1573.74 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20538. 1573.74 s [algebraic-graphs]
  20539. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20540. 1573.74 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20541. 1573.74 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20542. 1573.74 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20543. 1573.74 s [algebraic-graphs]
  20544. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20545. 1573.74 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20546. 1573.74 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20547. 1573.74 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20548. 1573.74 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20549. 1573.74 s [algebraic-graphs]
  20550. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20551. 1573.74 s [algebraic-graphs] OK: edgeList empty == []
  20552. 1573.74 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20553. 1573.74 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20554. 1573.74 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20555. 1573.74 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20556. 1573.74 s [algebraic-graphs]
  20557. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20558. 1573.74 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20559. 1573.74 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20560. 1573.74 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20561. 1573.74 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20562. 1573.74 s [algebraic-graphs]
  20563. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20564. 1573.74 s [algebraic-graphs] OK: adjacencyList empty == []
  20565. 1573.74 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20566. 1573.74 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20567. 1573.74 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20568. 1573.74 s [algebraic-graphs]
  20569. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20570. 1573.74 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20571. 1573.74 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20572. 1573.74 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20573. 1573.74 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20574. 1573.74 s [algebraic-graphs]
  20575. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20576. 1573.74 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20577. 1573.74 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20578. 1573.74 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20579. 1573.74 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20580. 1573.74 s [algebraic-graphs]
  20581. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20582. 1573.74 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20583. 1573.74 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20584. 1573.74 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20585. 1573.74 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20586. 1573.74 s [algebraic-graphs]
  20587. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20588. 1573.74 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20589. 1573.74 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20590. 1573.74 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20591. 1573.74 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20592. 1573.74 s [algebraic-graphs]
  20593. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20594. 1573.74 s [algebraic-graphs] OK: path [] == empty
  20595. 1573.74 s [algebraic-graphs] OK: path [x] == vertex x
  20596. 1573.74 s [algebraic-graphs] OK: path [x,y] == edge x y
  20597. 1573.74 s [algebraic-graphs]
  20598. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20599. 1573.74 s [algebraic-graphs] OK: circuit [] == empty
  20600. 1573.74 s [algebraic-graphs] OK: circuit [x] == edge x x
  20601. 1573.74 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20602. 1573.74 s [algebraic-graphs]
  20603. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20604. 1573.74 s [algebraic-graphs] OK: clique [] == empty
  20605. 1573.74 s [algebraic-graphs] OK: clique [x] == vertex x
  20606. 1573.74 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20607. 1573.74 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20608. 1573.74 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20609. 1573.74 s [algebraic-graphs]
  20610. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20611. 1573.74 s [algebraic-graphs] OK: biclique [] [] == empty
  20612. 1573.74 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20613. 1573.74 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20614. 1573.74 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20615. 1573.74 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20616. 1573.74 s [algebraic-graphs]
  20617. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20618. 1573.74 s [algebraic-graphs] OK: star x [] == vertex x
  20619. 1573.74 s [algebraic-graphs] OK: star x [y] == edge x y
  20620. 1573.74 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20621. 1573.74 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20622. 1573.74 s [algebraic-graphs]
  20623. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20624. 1573.74 s [algebraic-graphs] OK: stars [] == empty
  20625. 1573.74 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20626. 1573.74 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20627. 1573.74 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20628. 1573.74 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20629. 1573.74 s [algebraic-graphs] OK: stars . adjacencyList == id
  20630. 1573.74 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20631. 1573.74 s [algebraic-graphs]
  20632. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  20633. 1573.74 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20634. 1573.74 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20635. 1573.74 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20636. 1573.74 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20637. 1573.74 s [algebraic-graphs]
  20638. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  20639. 1573.74 s [algebraic-graphs] OK: forest [] == empty
  20640. 1573.74 s [algebraic-graphs] OK: forest [x] == tree x
  20641. 1573.74 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20642. 1573.74 s [algebraic-graphs] OK: forest == overlays . map tree
  20643. 1573.74 s [algebraic-graphs]
  20644. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  20645. 1573.74 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20646. 1573.74 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20647. 1573.74 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20648. 1573.74 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20649. 1573.74 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20650. 1573.74 s [algebraic-graphs]
  20651. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  20652. 1573.74 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20653. 1573.74 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20654. 1573.74 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20655. 1573.74 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20656. 1573.74 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20657. 1573.74 s [algebraic-graphs]
  20658. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  20659. 1573.74 s [algebraic-graphs] OK: replaceVertex x x == id
  20660. 1573.74 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20661. 1573.74 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20662. 1573.74 s [algebraic-graphs]
  20663. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  20664. 1573.74 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20665. 1573.74 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20666. 1573.74 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20667. 1573.74 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20668. 1573.74 s [algebraic-graphs]
  20669. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  20670. 1573.74 s [algebraic-graphs] OK: transpose empty == empty
  20671. 1573.74 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20672. 1573.74 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20673. 1573.74 s [algebraic-graphs] OK: transpose . transpose == id
  20674. 1573.74 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20675. 1573.74 s [algebraic-graphs]
  20676. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  20677. 1573.74 s [algebraic-graphs] OK: gmap f empty == empty
  20678. 1573.74 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20679. 1573.74 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20680. 1573.74 s [algebraic-graphs] OK: gmap id == id
  20681. 1573.74 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20682. 1573.74 s [algebraic-graphs]
  20683. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  20684. 1573.74 s [algebraic-graphs] OK: induce (const True ) x == x
  20685. 1573.74 s [algebraic-graphs] OK: induce (const False) x == empty
  20686. 1573.74 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20687. 1573.74 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20688. 1573.74 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20689. 1573.74 s [algebraic-graphs]
  20690. 1573.74 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  20691. 1573.74 s [algebraic-graphs] OK: compose empty x == empty
  20692. 1573.74 s [algebraic-graphs] OK: compose x empty == empty
  20693. 1573.74 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20694. 1573.74 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20695. 1573.74 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20696. 1573.74 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20697. 1576.14 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20698. 1576.14 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20699. 1576.14 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20700. 1576.14 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20701. 1576.14 s [algebraic-graphs]
  20702. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  20703. 1576.14 s [algebraic-graphs] OK: closure empty == empty
  20704. 1576.14 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20705. 1576.14 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20706. 1576.14 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20707. 1576.14 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20708. 1576.14 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20709. 1576.14 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20710. 1576.14 s [algebraic-graphs] OK: closure . closure == closure
  20711. 1576.14 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20712. 1576.14 s [algebraic-graphs]
  20713. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  20714. 1576.14 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20715. 1576.14 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20716. 1576.14 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20717. 1576.14 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20718. 1576.14 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20719. 1576.14 s [algebraic-graphs]
  20720. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  20721. 1576.14 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20722. 1576.14 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20723. 1576.14 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20724. 1576.14 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20725. 1576.14 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20726. 1576.14 s [algebraic-graphs]
  20727. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  20728. 1576.14 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20729. 1576.14 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20730. 1576.14 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20731. 1576.14 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20732. 1576.14 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20733. 1576.14 s [algebraic-graphs]
  20734. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.box ============
  20735. 1576.14 s [algebraic-graphs] OK: box x y ~~ box y x
  20736. 1576.14 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20737. 1576.14 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20738. 1576.14 s [algebraic-graphs] OK: box x empty ~~ empty
  20739. 1576.14 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20740. 1576.14 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20741. 1576.14 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20742. 1576.14 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20743. 1576.14 s [algebraic-graphs]
  20744. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  20745. 1576.14 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20746. 1576.14 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20747. 1576.14 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20748. 1576.14 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20749. 1576.14 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20750. 1576.14 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20751. 1576.14 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20752. 1576.14 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20753. 1576.14 s [algebraic-graphs] OK: bfsForest x [] == []
  20754. 1576.14 s [algebraic-graphs] OK: bfsForest empty vs == []
  20755. 1576.14 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20756. 1576.14 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20757. 1576.14 s [algebraic-graphs]
  20758. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  20759. 1576.14 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20760. 1576.14 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20761. 1576.14 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20762. 1576.14 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20763. 1576.14 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20764. 1576.14 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20765. 1576.14 s [algebraic-graphs] OK: bfs empty vs == []
  20766. 1576.14 s [algebraic-graphs] OK: bfs x [] == []
  20767. 1576.14 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20768. 1576.14 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20769. 1576.14 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20770. 1576.14 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20771. 1576.14 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20772. 1576.14 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20773. 1576.14 s [algebraic-graphs]
  20774. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  20775. 1576.14 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20776. 1576.14 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20777. 1576.14 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20778. 1576.14 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20779. 1576.14 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20780. 1576.14 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20781. 1576.14 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20782. 1576.14 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20783. 1576.14 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20784. 1576.14 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20785. 1576.14 s [algebraic-graphs]
  20786. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  20787. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20788. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20789. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20790. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20791. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20792. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20793. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20794. 1576.14 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20795. 1576.14 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20796. 1576.14 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20797. 1576.14 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20798. 1576.14 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20799. 1576.14 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20800. 1576.14 s [algebraic-graphs]
  20801. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20802. 1576.14 s [algebraic-graphs] OK: dfs empty vs == []
  20803. 1576.14 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20804. 1576.14 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20805. 1576.14 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20806. 1576.14 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20807. 1576.14 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20808. 1576.14 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20809. 1576.14 s [algebraic-graphs] OK: dfs x [] == []
  20810. 1576.14 s [algebraic-graphs]
  20811. 1576.14 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20812. 1576.14 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20813. 1576.14 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20814. 1576.14 s [algebraic-graphs]
  20815. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20816. 1576.14 s [algebraic-graphs] OK: reachable empty x == []
  20817. 1576.14 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20818. 1576.14 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20819. 1576.14 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20820. 1576.14 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20821. 1576.14 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20822. 1576.14 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20823. 1576.14 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20824. 1576.14 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20825. 1576.14 s [algebraic-graphs]
  20826. 1576.14 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20827. 1576.14 s [algebraic-graphs]
  20828. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  20829. 1576.14 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20830. 1576.14 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20831. 1576.14 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20832. 1576.14 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20833. 1576.14 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20834. 1576.14 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20835. 1576.14 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20836. 1576.14 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20837. 1576.14 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20838. 1576.14 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20839. 1576.14 s [algebraic-graphs]
  20840. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  20841. 1576.14 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20842. 1576.14 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20843. 1576.14 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20844. 1576.14 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20845. 1576.14 s [algebraic-graphs]
  20846. 1576.14 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  20847. 1576.14 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20848. 1576.14 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20849. 1576.14 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20850. 1576.14 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20851. 1576.14 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20852. 1576.14 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20853. 1576.14 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20854. 1581.68 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20855. 1581.68 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20856. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20857. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20858. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20859. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20860. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20861. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20862. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20863. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20864. 1581.72 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20865. 1581.72 s [algebraic-graphs]
  20866. 1581.72 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  20867. 1581.72 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20868. 1581.72 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20869. 1581.72 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20870. 1581.72 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20871. 1581.72 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20872. 1581.72 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20873. 1581.72 s [algebraic-graphs]
  20874. 1581.72 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  20875. 1581.72 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20876. 1581.72 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20877. 1581.72 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20878. 1581.72 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20879. 1581.72 s [algebraic-graphs]
  20880. 1581.72 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  20881. 1581.72 s [algebraic-graphs] OK: scc empty == empty
  20882. 1581.72 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20883. 1581.72 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  20884. 1581.72 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20885. 1581.72 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  20886. 1581.72 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  20887. 1581.72 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20888. 1581.72 s [algebraic-graphs] OK: isAcyclic . scc == const True
  20889. 1581.72 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  20890. 1581.72 s [algebraic-graphs] OK: scc g == KL.scc g
  20891. 1581.72 s [algebraic-graphs]
  20892. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  20893. 1581.72 s [algebraic-graphs] OK: 0 == rightVertex 0
  20894. 1581.72 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  20895. 1581.72 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  20896. 1581.72 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  20897. 1581.72 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  20898. 1581.72 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  20899. 1581.72 s [algebraic-graphs]
  20900. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  20901. 1581.72 s [algebraic-graphs] OK: show empty == "empty"
  20902. 1581.72 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  20903. 1581.72 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  20904. 1581.72 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  20905. 1581.72 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  20906. 1581.72 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  20907. 1581.72 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  20908. 1581.72 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  20909. 1581.72 s [algebraic-graphs]
  20910. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  20911. 1581.72 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  20912. 1581.72 s [algebraic-graphs]
  20913. 1581.72 s [algebraic-graphs] OK: x + y == y + x
  20914. 1581.72 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  20915. 1581.72 s [algebraic-graphs] OK: x * empty == x
  20916. 1581.72 s [algebraic-graphs] OK: empty * x == x
  20917. 1581.72 s [algebraic-graphs] OK: x * y == y * x
  20918. 1581.72 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  20919. 1581.72 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  20920. 1581.72 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  20921. 1581.72 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  20922. 1581.72 s [algebraic-graphs] OK: x + empty == x
  20923. 1581.72 s [algebraic-graphs] OK: empty + x == x
  20924. 1581.72 s [algebraic-graphs] OK: x + x == x
  20925. 1581.72 s [algebraic-graphs] OK: x * y + x + y == x * y
  20926. 1581.72 s [algebraic-graphs] OK: x * x * x == x * x
  20927. 1581.72 s [algebraic-graphs]
  20928. 1581.72 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  20929. 1581.72 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  20930. 1581.72 s [algebraic-graphs]
  20931. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  20932. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20933. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20934. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20935. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20936. 1581.72 s [algebraic-graphs]
  20937. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  20938. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20939. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20940. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20941. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20942. 1581.72 s [algebraic-graphs]
  20943. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  20944. 1581.72 s [algebraic-graphs] OK: isEmpty empty == True
  20945. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20946. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20947. 1581.72 s [algebraic-graphs] OK: hasVertex x empty == False
  20948. 1581.72 s [algebraic-graphs]
  20949. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  20950. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20951. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20952. 1581.72 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  20953. 1581.72 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  20954. 1581.72 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  20955. 1581.72 s [algebraic-graphs]
  20956. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  20957. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20958. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20959. 1581.72 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  20960. 1581.72 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  20961. 1581.72 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  20962. 1581.72 s [algebraic-graphs]
  20963. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  20964. 1581.72 s [algebraic-graphs] OK: vertex . Left == leftVertex
  20965. 1581.72 s [algebraic-graphs] OK: vertex . Right == rightVertex
  20966. 1581.72 s [algebraic-graphs]
  20967. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  20968. 1581.72 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  20969. 1581.72 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20970. 1581.72 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20971. 1581.72 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20972. 1581.72 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  20973. 1581.72 s [algebraic-graphs]
  20974. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  20975. 1581.72 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20976. 1581.72 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20977. 1581.72 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20978. 1581.72 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20979. 1581.72 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20980. 1581.72 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20981. 1581.72 s [algebraic-graphs]
  20982. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  20983. 1581.72 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  20984. 1581.72 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  20985. 1581.72 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  20986. 1581.72 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  20987. 1581.72 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  20988. 1581.72 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20989. 1581.72 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20990. 1581.72 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20991. 1581.72 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20992. 1581.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20993. 1581.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  20994. 1581.72 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  20995. 1581.72 s [algebraic-graphs]
  20996. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  20997. 1581.72 s [algebraic-graphs] OK: vertices [] [] == empty
  20998. 1581.72 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  20999. 1581.72 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21000. 1581.72 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21001. 1581.72 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21002. 1581.72 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21003. 1581.72 s [algebraic-graphs]
  21004. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21005. 1581.72 s [algebraic-graphs] OK: edges [] == empty
  21006. 1581.72 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21007. 1581.72 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21008. 1581.72 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21009. 1581.72 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21010. 1581.72 s [algebraic-graphs]
  21011. 1581.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21012. 1581.72 s [algebraic-graphs] OK: overlays [] == empty
  21013. 1581.72 s [algebraic-graphs] OK: overlays [x] == x
  21014. 1581.72 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21015. 1581.72 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21016. 1581.72 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21017. 1581.73 s [algebraic-graphs]
  21018. 1581.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21019. 1581.73 s [algebraic-graphs] OK: connects [] == empty
  21020. 1581.73 s [algebraic-graphs] OK: connects [x] == x
  21021. 1581.73 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21022. 1581.73 s [algebraic-graphs] OK: connects == foldr connect empty
  21023. 1581.73 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21024. 1581.73 s [algebraic-graphs]
  21025. 1581.73 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21026. 1582.87 s [algebraic-graphs] OK: swap empty == empty
  21027. 1582.87 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21028. 1582.87 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21029. 1582.87 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21030. 1582.87 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21031. 1582.87 s [algebraic-graphs] OK: swap . swap == id
  21032. 1582.87 s [algebraic-graphs]
  21033. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21034. 1582.87 s [algebraic-graphs] OK: toBipartite empty == empty
  21035. 1582.87 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21036. 1582.87 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21037. 1582.87 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21038. 1582.87 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21039. 1582.87 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21040. 1582.87 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21041. 1582.87 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21042. 1582.87 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21043. 1582.87 s [algebraic-graphs]
  21044. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21045. 1582.87 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21046. 1582.87 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21047. 1582.87 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21048. 1582.87 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21049. 1582.87 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21050. 1582.87 s [algebraic-graphs]
  21051. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21052. 1582.87 s [algebraic-graphs] OK: fromBipartite empty == empty
  21053. 1582.87 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21054. 1582.87 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21055. 1582.87 s [algebraic-graphs]
  21056. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21057. 1582.87 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21058. 1582.87 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21059. 1582.87 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21060. 1582.87 s [algebraic-graphs]
  21061. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21062. 1582.87 s [algebraic-graphs] OK: isEmpty empty == True
  21063. 1582.87 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21064. 1582.87 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21065. 1582.87 s [algebraic-graphs] OK: isEmpty == (==) empty
  21066. 1582.87 s [algebraic-graphs]
  21067. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21068. 1582.87 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21069. 1582.87 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21070. 1582.87 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21071. 1582.87 s [algebraic-graphs]
  21072. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21073. 1582.87 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21074. 1582.87 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21075. 1582.87 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21076. 1582.87 s [algebraic-graphs]
  21077. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21078. 1582.87 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21079. 1582.87 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21080. 1582.87 s [algebraic-graphs]
  21081. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21082. 1582.87 s [algebraic-graphs] OK: hasEdge x y empty == False
  21083. 1582.87 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21084. 1582.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21085. 1582.87 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21086. 1582.87 s [algebraic-graphs]
  21087. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21088. 1582.87 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21089. 1582.87 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21090. 1582.87 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21091. 1582.87 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21092. 1582.87 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21093. 1582.87 s [algebraic-graphs]
  21094. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21095. 1582.87 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21096. 1582.87 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21097. 1582.87 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21098. 1582.87 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21099. 1582.87 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21100. 1582.87 s [algebraic-graphs]
  21101. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21102. 1582.87 s [algebraic-graphs] OK: vertexCount empty == 0
  21103. 1582.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21104. 1582.87 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21105. 1582.87 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21106. 1582.87 s [algebraic-graphs]
  21107. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21108. 1582.87 s [algebraic-graphs] OK: edgeCount empty == 0
  21109. 1582.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21110. 1582.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21111. 1582.87 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21112. 1582.87 s [algebraic-graphs]
  21113. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21114. 1582.87 s [algebraic-graphs] OK: leftVertexList empty == []
  21115. 1582.87 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21116. 1582.87 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21117. 1582.87 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21118. 1582.87 s [algebraic-graphs]
  21119. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21120. 1582.87 s [algebraic-graphs] OK: rightVertexList empty == []
  21121. 1582.87 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21122. 1582.87 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21123. 1582.87 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21124. 1582.87 s [algebraic-graphs]
  21125. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21126. 1582.87 s [algebraic-graphs] OK: vertexList empty == []
  21127. 1582.87 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21128. 1582.87 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21129. 1582.87 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21130. 1582.87 s [algebraic-graphs]
  21131. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21132. 1582.87 s [algebraic-graphs] OK: edgeList empty == []
  21133. 1582.87 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21134. 1582.87 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21135. 1582.87 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21136. 1582.87 s [algebraic-graphs]
  21137. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21138. 1582.87 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21139. 1582.87 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21140. 1582.87 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21141. 1582.87 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21142. 1582.87 s [algebraic-graphs]
  21143. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21144. 1582.87 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21145. 1582.87 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21146. 1582.87 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21147. 1582.87 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21148. 1582.87 s [algebraic-graphs]
  21149. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21150. 1582.87 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21151. 1582.87 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21152. 1582.87 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21153. 1582.87 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21154. 1582.87 s [algebraic-graphs]
  21155. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21156. 1582.87 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21157. 1582.87 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21158. 1582.87 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21159. 1582.87 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21160. 1582.87 s [algebraic-graphs]
  21161. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21162. 1582.87 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21163. 1582.87 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21164. 1582.87 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21165. 1582.87 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21166. 1582.87 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21167. 1582.87 s [algebraic-graphs]
  21168. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21169. 1582.87 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21170. 1582.87 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21171. 1582.87 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21172. 1582.87 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21173. 1582.87 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21174. 1582.87 s [algebraic-graphs]
  21175. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21176. 1582.87 s [algebraic-graphs] OK: evenList [] == Nil
  21177. 1582.87 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21178. 1582.87 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21179. 1582.87 s [algebraic-graphs]
  21180. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21181. 1582.87 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21182. 1582.87 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21183. 1582.87 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21184. 1582.87 s [algebraic-graphs]
  21185. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21186. 1582.87 s [algebraic-graphs] OK: path Nil == empty
  21187. 1582.87 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21188. 1582.87 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21189. 1582.87 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21190. 1582.87 s [algebraic-graphs]
  21191. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21192. 1582.87 s [algebraic-graphs] OK: circuit [] == empty
  21193. 1582.87 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21194. 1582.87 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21195. 1582.87 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21196. 1582.87 s [algebraic-graphs]
  21197. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21198. 1582.87 s [algebraic-graphs] OK: biclique [] [] == empty
  21199. 1582.87 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21200. 1582.87 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21201. 1582.87 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21202. 1582.87 s [algebraic-graphs]
  21203. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21204. 1582.87 s [algebraic-graphs] OK: star x [] == leftVertex x
  21205. 1582.87 s [algebraic-graphs] OK: star x [y] == edge x y
  21206. 1582.87 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21207. 1582.87 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21208. 1582.87 s [algebraic-graphs]
  21209. 1582.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21210. 1582.87 s [algebraic-graphs] OK: stars [] == empty
  21211. 1582.87 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21212. 1582.87 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21213. 1582.87 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21214. 1600.01 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21215. 1600.05 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21216. 1600.05 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21217. 1600.05 s [algebraic-graphs]
  21218. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21219. 1600.05 s [algebraic-graphs] OK: mesh xs [] == empty
  21220. 1600.05 s [algebraic-graphs] OK: mesh [] ys == empty
  21221. 1600.05 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21222. 1600.05 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21223. 1600.05 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21224. 1600.05 s [algebraic-graphs]
  21225. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21226. 1600.05 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21227. 1600.05 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21228. 1600.05 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21229. 1600.05 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21230. 1600.05 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21231. 1600.05 s [algebraic-graphs]
  21232. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21233. 1600.05 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21234. 1600.05 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21235. 1600.05 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21236. 1600.05 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21237. 1600.05 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21238. 1600.05 s [algebraic-graphs]
  21239. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21240. 1600.05 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21241. 1600.05 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21242. 1600.05 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21243. 1600.05 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21244. 1600.05 s [algebraic-graphs]
  21245. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21246. 1600.05 s [algebraic-graphs] OK: bimap f g empty == empty
  21247. 1600.05 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21248. 1600.05 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21249. 1600.05 s [algebraic-graphs] OK: bimap id id == id
  21250. 1600.05 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21251. 1600.05 s [algebraic-graphs]
  21252. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21253. 1600.05 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21254. 1600.05 s [algebraic-graphs]
  21255. 1600.05 s [algebraic-graphs] OK: box x y ~~ box y x
  21256. 1600.05 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21257. 1600.05 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21258. 1600.05 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21259. 1600.05 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21260. 1600.05 s [algebraic-graphs] OK: box x empty ~~ empty
  21261. 1600.05 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21262. 1600.05 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21263. 1600.05 s [algebraic-graphs]
  21264. 1600.05 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21265. 1600.05 s [algebraic-graphs]
  21266. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21267. 1600.05 s [algebraic-graphs] OK: consistent empty == True
  21268. 1600.05 s [algebraic-graphs] OK: consistent (vertex x) == True
  21269. 1600.05 s [algebraic-graphs] OK: consistent (edge x y) == True
  21270. 1600.05 s [algebraic-graphs] OK: consistent (edges x) == True
  21271. 1600.05 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21272. 1600.05 s [algebraic-graphs] OK: consistent (swap x) == True
  21273. 1600.05 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21274. 1600.05 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21275. 1600.05 s [algebraic-graphs]
  21276. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21277. 1600.05 s [algebraic-graphs] OK: detectParts empty == Right empty
  21278. 1600.05 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21279. 1600.05 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21280. 1600.05 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21281. 1600.05 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21282. 1600.05 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21283. 1600.05 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21284. 1600.05 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21285. 1600.05 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21286. 1600.05 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21287. 1600.05 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21288. 1600.05 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21289. 1600.05 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21290. 1600.05 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21291. 1600.05 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21292. 1600.05 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21293. 1600.05 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21294. 1600.05 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21295. 1600.05 s [algebraic-graphs]
  21296. 1600.05 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21297. 1600.05 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21298. 1600.05 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21299. 1600.05 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21300. 1600.05 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21301. 1600.05 s [algebraic-graphs]
  21302. 1600.05 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21303. 1600.05 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21304. 1600.05 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21305. 1600.05 s [algebraic-graphs]
  21306. 1600.05 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21307. 1600.05 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21308. 1600.05 s [algebraic-graphs]
  21309. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21310. 1600.05 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21311. 1600.05 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21312. 1600.05 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21313. 1600.05 s [algebraic-graphs]
  21314. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21315. 1600.05 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21316. 1600.05 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21317. 1600.05 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21318. 1600.05 s [algebraic-graphs]
  21319. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21320. 1600.05 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21321. 1600.05 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21322. 1600.05 s [algebraic-graphs]
  21323. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21324. 1600.05 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21325. 1600.05 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21326. 1600.05 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21327. 1600.05 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21328. 1600.05 s [algebraic-graphs]
  21329. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21330. 1600.05 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21331. 1600.05 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21332. 1600.05 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21333. 1600.05 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21334. 1600.05 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21335. 1600.05 s [algebraic-graphs]
  21336. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21337. 1600.05 s [algebraic-graphs] OK: maxMatching empty == matching []
  21338. 1600.05 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21339. 1600.05 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21340. 1600.05 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21341. 1600.05 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21342. 1600.05 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21343. 1600.05 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21344. 1600.05 s [algebraic-graphs]
  21345. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21346. 1600.05 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21347. 1600.05 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21348. 1600.05 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21349. 1600.05 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21350. 1600.05 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21351. 1600.05 s [algebraic-graphs]
  21352. 1600.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21353. 1600.05 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21354. 1602.05 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21355. 1602.05 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21356. 1602.05 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21357. 1602.05 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21358. 1602.05 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21359. 1602.05 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21360. 1602.05 s [algebraic-graphs]
  21361. 1602.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21362. 1602.05 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21363. 1602.05 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21364. 1602.05 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21365. 1602.05 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21366. 1602.05 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21367. 1602.05 s [algebraic-graphs]
  21368. 1602.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21369. 1602.05 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21370. 1602.05 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21371. 1602.05 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21372. 1602.05 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21373. 1602.05 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21374. 1602.05 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21375. 1602.05 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21376. 1602.05 s [algebraic-graphs]
  21377. 1602.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21378. 1602.05 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21379. 1602.05 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21380. 1602.05 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21381. 1602.05 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21382. 1602.05 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21383. 1602.05 s [algebraic-graphs]
  21384. 1602.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21385. 1602.05 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21386. 1602.05 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21387. 1602.05 s [algebraic-graphs]
  21388. 1602.05 s [algebraic-graphs] ============ Export.Eq ============
  21389. 1602.05 s [algebraic-graphs] OK: mempty /= literal ""
  21390. 1602.05 s [algebraic-graphs]
  21391. 1602.05 s [algebraic-graphs] ============ Export.Ord ============
  21392. 1602.05 s [algebraic-graphs] OK: mempty < literal ""
  21393. 1602.05 s [algebraic-graphs]
  21394. 1602.05 s [algebraic-graphs] ============ Export.isEmpty ============
  21395. 1602.05 s [algebraic-graphs] OK: isEmpty mempty == True
  21396. 1602.05 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21397. 1602.05 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21398. 1602.05 s [algebraic-graphs]
  21399. 1602.05 s [algebraic-graphs] ============ Export.literal ============
  21400. 1602.05 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21401. 1602.05 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21402. 1602.05 s [algebraic-graphs] OK: render . literal == id
  21403. 1602.05 s [algebraic-graphs]
  21404. 1602.05 s [algebraic-graphs] ============ Export.render ============
  21405. 1602.05 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21406. 1602.05 s [algebraic-graphs] OK: render mempty == mempty
  21407. 1602.05 s [algebraic-graphs]
  21408. 1602.05 s [algebraic-graphs] ============ Export.<+> ============
  21409. 1602.05 s [algebraic-graphs] OK: x <+> mempty == x
  21410. 1602.05 s [algebraic-graphs] OK: mempty <+> x == x
  21411. 1602.05 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21412. 1602.05 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21413. 1602.05 s [algebraic-graphs]
  21414. 1602.05 s [algebraic-graphs] ============ Export.brackets ============
  21415. 1602.05 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21416. 1602.05 s [algebraic-graphs] OK: brackets mempty == "[]"
  21417. 1602.05 s [algebraic-graphs]
  21418. 1602.05 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21419. 1602.05 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21420. 1602.05 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21421. 1602.05 s [algebraic-graphs]
  21422. 1602.05 s [algebraic-graphs] ============ Export.indent ============
  21423. 1602.05 s [algebraic-graphs] OK: indent 0 == id
  21424. 1602.05 s [algebraic-graphs] OK: indent 1 mempty == " "
  21425. 1602.06 s [algebraic-graphs]
  21426. 1602.06 s [algebraic-graphs] ============ Export.unlines ============
  21427. 1602.06 s [algebraic-graphs] OK: unlines [] == mempty
  21428. 1602.06 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21429. 1602.06 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21430. 1602.06 s [algebraic-graphs]
  21431. 1602.06 s [algebraic-graphs] ============ Export.export ============
  21432. 1602.06 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21433. 1602.06 s [algebraic-graphs]
  21434. 1602.06 s [algebraic-graphs] ============ Export.Dot.export ============
  21435. 1602.06 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21436. 1602.06 s [algebraic-graphs]
  21437. 1602.06 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21438. 1602.06 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21439. 1602.06 s [algebraic-graphs]
  21440. 1602.06 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21441. 1602.06 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21442. 1602.06 s [algebraic-graphs]
  21443. 1602.06 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21444. 1602.06 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21445. 1602.06 s [algebraic-graphs]
  21446. 1602.06 s [algebraic-graphs] ============ Graph ============
  21447. 1602.06 s [algebraic-graphs] OK: Axioms of graphs
  21448. 1602.06 s [algebraic-graphs] OK: Theorems of graphs
  21449. 1602.06 s [algebraic-graphs]
  21450. 1602.06 s [algebraic-graphs] ============ Graph.Ord ============
  21451. 1602.06 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21452. 1602.06 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21453. 1602.06 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21454. 1602.06 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21455. 1602.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21456. 1602.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21457. 1602.06 s [algebraic-graphs] OK: x <= x + y
  21458. 1602.06 s [algebraic-graphs] OK: x + y <= x * y
  21459. 1602.06 s [algebraic-graphs]
  21460. 1602.06 s [algebraic-graphs] ============ Graph.empty ============
  21461. 1602.06 s [algebraic-graphs] OK: isEmpty empty == True
  21462. 1602.06 s [algebraic-graphs] OK: hasVertex x empty == False
  21463. 1602.06 s [algebraic-graphs] OK: vertexCount empty == 0
  21464. 1602.06 s [algebraic-graphs] OK: edgeCount empty == 0
  21465. 1602.06 s [algebraic-graphs]
  21466. 1602.06 s [algebraic-graphs] ============ Graph.vertex ============
  21467. 1602.06 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21468. 1602.06 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21469. 1602.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21470. 1602.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21471. 1602.06 s [algebraic-graphs]
  21472. 1602.06 s [algebraic-graphs] ============ Graph.edge ============
  21473. 1602.06 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21474. 1602.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21475. 1602.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21476. 1602.06 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21477. 1602.06 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21478. 1602.06 s [algebraic-graphs]
  21479. 1602.06 s [algebraic-graphs] ============ Graph.overlay ============
  21480. 1602.06 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21481. 1602.06 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21482. 1602.06 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21483. 1602.06 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21484. 1602.06 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21485. 1602.06 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21486. 1602.06 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21487. 1602.06 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21488. 1602.06 s [algebraic-graphs]
  21489. 1602.06 s [algebraic-graphs] ============ Graph.connect ============
  21490. 1602.06 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21491. 1602.06 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21492. 1602.06 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21493. 1602.06 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21494. 1602.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21495. 1602.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21496. 1602.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21497. 1602.06 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21498. 1602.06 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21499. 1602.06 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21500. 1602.06 s [algebraic-graphs]
  21501. 1602.06 s [algebraic-graphs] ============ Graph.vertices ============
  21502. 1602.06 s [algebraic-graphs] OK: vertices [] == empty
  21503. 1602.06 s [algebraic-graphs] OK: vertices [x] == vertex x
  21504. 1602.06 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21505. 1602.06 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21506. 1602.06 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21507. 1602.06 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21508. 1602.06 s [algebraic-graphs]
  21509. 1602.06 s [algebraic-graphs] ============ Graph.edges ============
  21510. 1602.06 s [algebraic-graphs] OK: edges [] == empty
  21511. 1602.06 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21512. 1602.06 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21513. 1602.06 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21514. 1602.06 s [algebraic-graphs]
  21515. 1602.06 s [algebraic-graphs] ============ Graph.overlays ============
  21516. 1602.06 s [algebraic-graphs] OK: overlays [] == empty
  21517. 1602.06 s [algebraic-graphs] OK: overlays [x] == x
  21518. 1602.06 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21519. 1602.06 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21520. 1602.06 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21521. 1602.06 s [algebraic-graphs]
  21522. 1602.06 s [algebraic-graphs] ============ Graph.connects ============
  21523. 1602.06 s [algebraic-graphs] OK: connects [] == empty
  21524. 1602.06 s [algebraic-graphs] OK: connects [x] == x
  21525. 1602.06 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21526. 1602.06 s [algebraic-graphs] OK: connects == foldr connect empty
  21527. 1602.06 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21528. 1602.06 s [algebraic-graphs]
  21529. 1602.06 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21530. 1602.06 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21531. 1602.06 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21532. 1602.06 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21533. 1602.06 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21534. 1602.06 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21535. 1602.06 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21536. 1602.06 s [algebraic-graphs]
  21537. 1602.06 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21538. 1602.06 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21539. 1602.06 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21540. 1602.06 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21541. 1602.06 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21542. 1602.06 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21543. 1602.06 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21544. 1602.06 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21545. 1602.06 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21546. 1602.06 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21547. 1602.76 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21548. 1602.76 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21549. 1602.76 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21550. 1602.76 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21551. 1602.76 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21552. 1602.76 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21553. 1602.76 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21554. 1602.76 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21555. 1602.76 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21556. 1602.76 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21557. 1602.76 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21558. 1602.76 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21559. 1602.76 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21560. 1602.76 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21561. 1602.76 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21562. 1602.76 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21563. 1602.76 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21564. 1602.76 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21565. 1602.76 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21566. 1602.76 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21567. 1602.76 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21568. 1602.76 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21569. 1602.76 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21570. 1602.76 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21571. 1602.77 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21572. 1602.77 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21573. 1602.77 s [algebraic-graphs]
  21574. 1602.77 s [algebraic-graphs] ============ Graph.foldg ============
  21575. 1602.77 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21576. 1602.77 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21577. 1602.77 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21578. 1602.77 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21579. 1602.77 s [algebraic-graphs]
  21580. 1602.77 s [algebraic-graphs] ============ Graph.isEmpty ============
  21581. 1602.77 s [algebraic-graphs] OK: isEmpty empty == True
  21582. 1602.77 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21583. 1602.77 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21584. 1602.77 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21585. 1602.77 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21586. 1602.77 s [algebraic-graphs]
  21587. 1602.77 s [algebraic-graphs] ============ Graph.hasVertex ============
  21588. 1602.77 s [algebraic-graphs] OK: hasVertex x empty == False
  21589. 1602.77 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21590. 1602.77 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21591. 1602.77 s [algebraic-graphs]
  21592. 1602.77 s [algebraic-graphs] ============ Graph.hasEdge ============
  21593. 1602.77 s [algebraic-graphs] OK: hasEdge x y empty == False
  21594. 1602.77 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21595. 1602.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21596. 1602.77 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21597. 1602.77 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21598. 1602.77 s [algebraic-graphs]
  21599. 1602.77 s [algebraic-graphs] ============ Graph.vertexCount ============
  21600. 1602.77 s [algebraic-graphs] OK: vertexCount empty == 0
  21601. 1602.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21602. 1602.77 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21603. 1602.77 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21604. 1602.77 s [algebraic-graphs]
  21605. 1602.77 s [algebraic-graphs] ============ Graph.edgeCount ============
  21606. 1602.77 s [algebraic-graphs] OK: edgeCount empty == 0
  21607. 1602.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21608. 1602.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21609. 1602.77 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21610. 1602.77 s [algebraic-graphs]
  21611. 1602.77 s [algebraic-graphs] ============ Graph.vertexList ============
  21612. 1602.77 s [algebraic-graphs] OK: vertexList empty == []
  21613. 1602.77 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21614. 1602.77 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21615. 1602.77 s [algebraic-graphs]
  21616. 1602.77 s [algebraic-graphs] ============ Graph.vertexSet ============
  21617. 1602.77 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21618. 1602.77 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21619. 1602.77 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21620. 1602.77 s [algebraic-graphs]
  21621. 1602.77 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21622. 1602.77 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21623. 1602.77 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21624. 1602.77 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21625. 1602.77 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21626. 1602.77 s [algebraic-graphs]
  21627. 1602.77 s [algebraic-graphs] ============ Graph.edgeList ============
  21628. 1602.77 s [algebraic-graphs] OK: edgeList empty == []
  21629. 1602.77 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21630. 1602.77 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21631. 1602.77 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21632. 1602.77 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21633. 1602.77 s [algebraic-graphs]
  21634. 1602.77 s [algebraic-graphs] ============ Graph.edgeSet ============
  21635. 1602.77 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21636. 1602.77 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21637. 1602.77 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21638. 1602.77 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21639. 1602.77 s [algebraic-graphs]
  21640. 1602.77 s [algebraic-graphs] ============ Graph.adjacencyList ============
  21641. 1602.77 s [algebraic-graphs] OK: adjacencyList empty == []
  21642. 1602.77 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21643. 1602.77 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21644. 1602.77 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21645. 1602.77 s [algebraic-graphs]
  21646. 1602.77 s [algebraic-graphs] ============ Graph.preSet ============
  21647. 1602.77 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21648. 1602.77 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21649. 1602.77 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21650. 1602.77 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21651. 1602.77 s [algebraic-graphs]
  21652. 1602.77 s [algebraic-graphs] ============ Graph.preIntSet ============
  21653. 1602.77 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21654. 1602.77 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21655. 1602.77 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21656. 1602.77 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21657. 1602.77 s [algebraic-graphs]
  21658. 1602.77 s [algebraic-graphs] ============ Graph.postSet ============
  21659. 1602.77 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21660. 1602.77 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21661. 1602.77 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21662. 1602.77 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21663. 1602.77 s [algebraic-graphs]
  21664. 1602.77 s [algebraic-graphs] ============ Graph.postIntSet ============
  21665. 1602.77 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21666. 1602.77 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21667. 1602.77 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21668. 1602.77 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21669. 1602.77 s [algebraic-graphs]
  21670. 1602.77 s [algebraic-graphs] ============ Graph.size ============
  21671. 1602.77 s [algebraic-graphs] OK: size empty == 1
  21672. 1602.77 s [algebraic-graphs] OK: size (vertex x) == 1
  21673. 1602.77 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  21674. 1602.77 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  21675. 1602.77 s [algebraic-graphs] OK: size x >= 1
  21676. 1602.77 s [algebraic-graphs] OK: size x >= vertexCount x
  21677. 1602.77 s [algebraic-graphs]
  21678. 1602.77 s [algebraic-graphs] ============ Graph.path ============
  21679. 1602.77 s [algebraic-graphs] OK: path [] == empty
  21680. 1602.77 s [algebraic-graphs] OK: path [x] == vertex x
  21681. 1602.77 s [algebraic-graphs] OK: path [x,y] == edge x y
  21682. 1602.77 s [algebraic-graphs]
  21683. 1602.77 s [algebraic-graphs] ============ Graph.circuit ============
  21684. 1602.77 s [algebraic-graphs] OK: circuit [] == empty
  21685. 1602.77 s [algebraic-graphs] OK: circuit [x] == edge x x
  21686. 1602.77 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21687. 1602.77 s [algebraic-graphs]
  21688. 1602.77 s [algebraic-graphs] ============ Graph.clique ============
  21689. 1602.77 s [algebraic-graphs] OK: clique [] == empty
  21690. 1602.77 s [algebraic-graphs] OK: clique [x] == vertex x
  21691. 1602.77 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21692. 1602.77 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21693. 1602.77 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21694. 1602.77 s [algebraic-graphs]
  21695. 1602.77 s [algebraic-graphs] ============ Graph.biclique ============
  21696. 1602.77 s [algebraic-graphs] OK: biclique [] [] == empty
  21697. 1602.77 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21698. 1602.77 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21699. 1602.77 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21700. 1602.77 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21701. 1602.77 s [algebraic-graphs]
  21702. 1602.77 s [algebraic-graphs] ============ Graph.star ============
  21703. 1602.77 s [algebraic-graphs] OK: star x [] == vertex x
  21704. 1602.77 s [algebraic-graphs] OK: star x [y] == edge x y
  21705. 1602.77 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21706. 1602.77 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21707. 1602.77 s [algebraic-graphs]
  21708. 1602.77 s [algebraic-graphs] ============ Graph.stars ============
  21709. 1602.77 s [algebraic-graphs] OK: stars [] == empty
  21710. 1602.77 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21711. 1602.77 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21712. 1602.77 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21713. 1602.77 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21714. 1602.77 s [algebraic-graphs] OK: stars . adjacencyList == id
  21715. 1602.77 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21716. 1602.77 s [algebraic-graphs]
  21717. 1602.77 s [algebraic-graphs] ============ Graph.tree ============
  21718. 1602.77 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21719. 1602.77 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21720. 1602.77 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21721. 1602.77 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21722. 1602.77 s [algebraic-graphs]
  21723. 1602.77 s [algebraic-graphs] ============ Graph.forest ============
  21724. 1602.77 s [algebraic-graphs] OK: forest [] == empty
  21725. 1602.77 s [algebraic-graphs] OK: forest [x] == tree x
  21726. 1602.77 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21727. 1602.77 s [algebraic-graphs] OK: forest == overlays . map tree
  21728. 1602.77 s [algebraic-graphs]
  21729. 1602.77 s [algebraic-graphs] ============ Graph.removeVertex ============
  21730. 1606.17 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21731. 1606.17 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21732. 1606.17 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21733. 1606.29 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21734. 1606.29 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21735. 1606.29 s [algebraic-graphs]
  21736. 1606.29 s [algebraic-graphs] ============ Graph.removeEdge ============
  21737. 1606.29 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21738. 1606.29 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21739. 1606.29 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21740. 1606.29 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21741. 1606.29 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21742. 1606.29 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  21743. 1606.29 s [algebraic-graphs]
  21744. 1606.29 s [algebraic-graphs] ============ Graph.replaceVertex ============
  21745. 1606.29 s [algebraic-graphs] OK: replaceVertex x x == id
  21746. 1606.29 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21747. 1606.29 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21748. 1606.29 s [algebraic-graphs]
  21749. 1606.29 s [algebraic-graphs] ============ Graph.mergeVertices ============
  21750. 1606.29 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21751. 1606.29 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21752. 1606.29 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21753. 1606.29 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21754. 1606.29 s [algebraic-graphs]
  21755. 1606.29 s [algebraic-graphs] ============ Graph.transpose ============
  21756. 1606.29 s [algebraic-graphs] OK: transpose empty == empty
  21757. 1606.29 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21758. 1606.29 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21759. 1606.29 s [algebraic-graphs] OK: transpose . transpose == id
  21760. 1606.29 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21761. 1606.29 s [algebraic-graphs]
  21762. 1606.29 s [algebraic-graphs] ============ Graph.gmap ============
  21763. 1606.29 s [algebraic-graphs] OK: gmap f empty == empty
  21764. 1606.29 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21765. 1606.29 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21766. 1606.29 s [algebraic-graphs] OK: gmap id == id
  21767. 1606.29 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21768. 1606.29 s [algebraic-graphs]
  21769. 1606.29 s [algebraic-graphs] ============ Graph.induce ============
  21770. 1606.29 s [algebraic-graphs] OK: induce (const True ) x == x
  21771. 1606.29 s [algebraic-graphs] OK: induce (const False) x == empty
  21772. 1606.29 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21773. 1606.29 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21774. 1606.29 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21775. 1606.29 s [algebraic-graphs]
  21776. 1606.29 s [algebraic-graphs] ============ Graph.induceJust ============
  21777. 1606.29 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21778. 1606.29 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21779. 1606.29 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21780. 1606.29 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21781. 1606.29 s [algebraic-graphs]
  21782. 1606.29 s [algebraic-graphs] ============ Graph.compose ============
  21783. 1606.29 s [algebraic-graphs] OK: compose empty x == empty
  21784. 1606.29 s [algebraic-graphs] OK: compose x empty == empty
  21785. 1606.29 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21786. 1606.29 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21787. 1606.29 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21788. 1606.29 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21789. 1606.29 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21790. 1606.29 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21791. 1606.29 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21792. 1606.29 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21793. 1606.29 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  21794. 1606.29 s [algebraic-graphs]
  21795. 1606.29 s [algebraic-graphs] ============ Graph.(===) ============
  21796. 1606.29 s [algebraic-graphs] OK: x === x == True
  21797. 1606.29 s [algebraic-graphs] OK: x === x + empty == False
  21798. 1606.29 s [algebraic-graphs] OK: x + y === x + y == True
  21799. 1606.29 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  21800. 1606.29 s [algebraic-graphs] OK: x + y === x * y == False
  21801. 1606.29 s [algebraic-graphs]
  21802. 1606.29 s [algebraic-graphs] ============ Graph.mesh ============
  21803. 1606.29 s [algebraic-graphs] OK: mesh xs [] == empty
  21804. 1606.29 s [algebraic-graphs] OK: mesh [] ys == empty
  21805. 1606.29 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  21806. 1606.29 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  21807. 1606.29 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  21808. 1606.29 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  21809. 1606.29 s [algebraic-graphs]
  21810. 1606.29 s [algebraic-graphs] ============ Graph.torus ============
  21811. 1606.29 s [algebraic-graphs] OK: torus xs [] == empty
  21812. 1606.29 s [algebraic-graphs] OK: torus [] ys == empty
  21813. 1606.30 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  21814. 1606.30 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  21815. 1606.30 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  21816. 1606.30 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  21817. 1606.30 s [algebraic-graphs]
  21818. 1606.30 s [algebraic-graphs] ============ Graph.deBruijn ============
  21819. 1606.30 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  21820. 1606.30 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  21821. 1606.30 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  21822. 1606.30 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  21823. 1606.30 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  21824. 1606.30 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  21825. 1606.30 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  21826. 1606.30 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  21827. 1606.30 s [algebraic-graphs]
  21828. 1606.30 s [algebraic-graphs] ============ Graph.splitVertex ============
  21829. 1606.30 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  21830. 1606.30 s [algebraic-graphs] OK: splitVertex x [x] == id
  21831. 1606.30 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  21832. 1606.30 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  21833. 1606.30 s [algebraic-graphs]
  21834. 1606.30 s [algebraic-graphs] ============ Graph.bind ============
  21835. 1606.30 s [algebraic-graphs] OK: bind empty f == empty
  21836. 1606.30 s [algebraic-graphs] OK: bind (vertex x) f == f x
  21837. 1606.30 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  21838. 1606.30 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  21839. 1606.30 s [algebraic-graphs] OK: bind x (const empty) == empty
  21840. 1606.30 s [algebraic-graphs] OK: bind x vertex == x
  21841. 1606.30 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  21842. 1606.30 s [algebraic-graphs]
  21843. 1606.30 s [algebraic-graphs] ============ Graph.simplify ============
  21844. 1606.30 s [algebraic-graphs] OK: simplify == id
  21845. 1606.30 s [algebraic-graphs] OK: size (simplify x) <= size x
  21846. 1606.30 s [algebraic-graphs]
  21847. 1606.30 s [algebraic-graphs] ============ Graph.box ============
  21848. 1606.30 s [algebraic-graphs] OK: box x y ~~ box y x
  21849. 1606.30 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21850. 1606.30 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21851. 1606.30 s [algebraic-graphs] OK: box x empty ~~ empty
  21852. 1606.30 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21853. 1606.30 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21854. 1606.30 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21855. 1606.30 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21856. 1606.30 s [algebraic-graphs]
  21857. 1606.30 s [algebraic-graphs] ============ Graph.sparsify ============
  21858. 1606.30 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  21859. 1606.30 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  21860. 1606.30 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  21861. 1606.30 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  21862. 1606.30 s [algebraic-graphs]
  21863. 1606.30 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  21864. 1606.30 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  21865. 1606.30 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  21866. 1606.30 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  21867. 1606.30 s [algebraic-graphs]
  21868. 1606.30 s [algebraic-graphs] ============ Graph.context ============
  21869. 1606.30 s [algebraic-graphs] OK: context (const False) x == Nothing
  21870. 1606.30 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  21871. 1606.30 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  21872. 1606.30 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  21873. 1606.30 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  21874. 1606.30 s [algebraic-graphs]
  21875. 1606.30 s [algebraic-graphs] ============ Graph.buildg ============
  21876. 1606.30 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  21877. 1606.30 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  21878. 1606.30 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
  21879. 1606.30 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
  21880. 1606.30 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  21881. 1606.30 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  21882. 1606.30 s [algebraic-graphs]
  21883. 1606.30 s [algebraic-graphs] ============ Internal.List ============
  21884. 1606.30 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  21885. 1606.30 s [algebraic-graphs]
  21886. 1606.30 s [algebraic-graphs] ============ Graph.Label ============
  21887. 1606.30 s [algebraic-graphs]
  21888. 1606.30 s [algebraic-graphs] ============ Any: instances ============
  21889. 1606.30 s [algebraic-graphs] OK: Semiring
  21890. 1606.30 s [algebraic-graphs] OK: StarSemiring
  21891. 1606.30 s [algebraic-graphs] OK: Dioid
  21892. 1606.30 s [algebraic-graphs]
  21893. 1606.30 s [algebraic-graphs] ============ Distance Int: instances ============
  21894. 1606.30 s [algebraic-graphs] OK: Semiring
  21895. 1606.30 s [algebraic-graphs] OK: StarSemiring
  21896. 1606.30 s [algebraic-graphs] OK: Dioid
  21897. 1606.30 s [algebraic-graphs]
  21898. 1606.30 s [algebraic-graphs] ============ Capacity Int: instances ============
  21899. 1606.30 s [algebraic-graphs] OK: Semiring
  21900. 1606.30 s [algebraic-graphs] OK: StarSemiring
  21901. 1606.30 s [algebraic-graphs] OK: Dioid
  21902. 1606.30 s [algebraic-graphs]
  21903. 1606.30 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  21904. 1606.30 s [algebraic-graphs] OK: LeftNearRing
  21905. 1606.30 s [algebraic-graphs]
  21906. 1606.30 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  21907. 1606.30 s [algebraic-graphs] OK: Semiring
  21908. 1606.30 s [algebraic-graphs] OK: Dioid
  21909. 1606.30 s [algebraic-graphs]
  21910. 1606.30 s [algebraic-graphs] ============ Count Int: instances ============
  21911. 1606.30 s [algebraic-graphs] OK: Semiring
  21912. 1606.30 s [algebraic-graphs] OK: StarSemiring
  21913. 1606.30 s [algebraic-graphs]
  21914. 1606.30 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  21915. 1606.30 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  21916. 1606.30 s [algebraic-graphs] OK: empty
  21917. 1606.30 s [algebraic-graphs] OK: vertex
  21918. 1606.30 s [algebraic-graphs] OK: edge
  21919. 1606.30 s [algebraic-graphs] OK: overlay
  21920. 1606.30 s [algebraic-graphs] OK: connect
  21921. 1606.30 s [algebraic-graphs] OK: vertices
  21922. 1606.30 s [algebraic-graphs] OK: edges
  21923. 1606.30 s [algebraic-graphs] OK: overlays
  21924. 1606.30 s [algebraic-graphs] OK: fromAdjacencyMaps
  21925. 1606.30 s [algebraic-graphs] OK: removeVertex
  21926. 1606.30 s [algebraic-graphs] OK: removeEdge
  21927. 1606.30 s [algebraic-graphs] OK: replaceVertex
  21928. 1606.30 s [algebraic-graphs] OK: replaceEdge
  21929. 1606.30 s [algebraic-graphs] OK: transpose
  21930. 1606.30 s [algebraic-graphs] OK: gmap
  21931. 1606.30 s [algebraic-graphs] OK: emap
  21932. 1606.30 s [algebraic-graphs] OK: induce
  21933. 1606.30 s [algebraic-graphs] OK: closure
  21934. 1606.30 s [algebraic-graphs] OK: reflexiveClosure
  21935. 1606.30 s [algebraic-graphs] OK: symmetricClosure
  21936. 1606.30 s [algebraic-graphs] OK: transitiveClosure
  21937. 1606.30 s [algebraic-graphs]
  21938. 1606.30 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  21939. 1606.30 s [algebraic-graphs] OK: isEmpty empty == True
  21940. 1606.30 s [algebraic-graphs] OK: hasVertex x empty == False
  21941. 1606.30 s [algebraic-graphs] OK: vertexCount empty == 0
  21942. 1606.30 s [algebraic-graphs] OK: edgeCount empty == 0
  21943. 1606.30 s [algebraic-graphs]
  21944. 1606.30 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  21945. 1606.30 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21946. 1606.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21947. 1606.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21948. 1606.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21949. 1606.30 s [algebraic-graphs]
  21950. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  21951. 1608.82 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  21952. 1608.82 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  21953. 1608.82 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  21954. 1608.82 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  21955. 1608.82 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  21956. 1608.82 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  21957. 1608.82 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  21958. 1608.82 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  21959. 1608.82 s [algebraic-graphs]
  21960. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  21961. 1608.82 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21962. 1608.82 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21963. 1608.82 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21964. 1608.82 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21965. 1608.82 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21966. 1608.82 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21967. 1608.82 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21968. 1608.82 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21969. 1608.82 s [algebraic-graphs]
  21970. 1608.82 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  21971. 1608.82 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  21972. 1608.82 s [algebraic-graphs]
  21973. 1608.82 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  21974. 1608.82 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  21975. 1608.82 s [algebraic-graphs]
  21976. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  21977. 1608.82 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  21978. 1608.82 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  21979. 1608.82 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  21980. 1608.82 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  21981. 1608.82 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21982. 1608.82 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  21983. 1608.82 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  21984. 1608.82 s [algebraic-graphs]
  21985. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  21986. 1608.82 s [algebraic-graphs] OK: vertices [] == empty
  21987. 1608.82 s [algebraic-graphs] OK: vertices [x] == vertex x
  21988. 1608.82 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21989. 1608.82 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21990. 1608.82 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21991. 1608.82 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21992. 1608.82 s [algebraic-graphs]
  21993. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  21994. 1608.82 s [algebraic-graphs] OK: edges [] == empty
  21995. 1608.82 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  21996. 1608.82 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  21997. 1608.82 s [algebraic-graphs]
  21998. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  21999. 1608.82 s [algebraic-graphs] OK: overlays [] == empty
  22000. 1608.82 s [algebraic-graphs] OK: overlays [x] == x
  22001. 1608.82 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22002. 1608.82 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22003. 1608.82 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22004. 1608.82 s [algebraic-graphs]
  22005. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22006. 1608.82 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22007. 1608.82 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22008. 1608.82 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22009. 1608.82 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22010. 1608.82 s [algebraic-graphs]
  22011. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22012. 1608.82 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22013. 1608.82 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22014. 1608.82 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22015. 1608.82 s [algebraic-graphs]
  22016. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22017. 1608.82 s [algebraic-graphs] OK: isEmpty empty == True
  22018. 1608.82 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22019. 1608.82 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22020. 1608.82 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22021. 1608.82 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22022. 1608.82 s [algebraic-graphs]
  22023. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22024. 1608.82 s [algebraic-graphs] OK: hasVertex x empty == False
  22025. 1608.82 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22026. 1608.82 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22027. 1608.82 s [algebraic-graphs]
  22028. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22029. 1608.82 s [algebraic-graphs] OK: hasEdge x y empty == False
  22030. 1608.82 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22031. 1608.82 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22032. 1608.82 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22033. 1608.82 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22034. 1608.82 s [algebraic-graphs]
  22035. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22036. 1608.82 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22037. 1608.82 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22038. 1608.82 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22039. 1608.82 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22040. 1608.82 s [algebraic-graphs]
  22041. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22042. 1608.82 s [algebraic-graphs] OK: vertexCount empty == 0
  22043. 1608.82 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22044. 1608.82 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22045. 1608.82 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22046. 1608.82 s [algebraic-graphs]
  22047. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22048. 1608.82 s [algebraic-graphs] OK: edgeCount empty == 0
  22049. 1608.82 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22050. 1608.82 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22051. 1608.82 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22052. 1608.82 s [algebraic-graphs]
  22053. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22054. 1608.82 s [algebraic-graphs] OK: vertexList empty == []
  22055. 1608.82 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22056. 1608.82 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22057. 1608.82 s [algebraic-graphs]
  22058. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22059. 1608.82 s [algebraic-graphs] OK: edgeList empty == []
  22060. 1608.82 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22061. 1608.82 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22062. 1608.82 s [algebraic-graphs]
  22063. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22064. 1608.82 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22065. 1608.82 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22066. 1608.82 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22067. 1608.82 s [algebraic-graphs]
  22068. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22069. 1608.82 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22070. 1608.82 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22071. 1608.82 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22072. 1608.82 s [algebraic-graphs]
  22073. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22074. 1608.82 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22075. 1608.82 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22076. 1608.82 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22077. 1608.82 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22078. 1608.82 s [algebraic-graphs]
  22079. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22080. 1608.82 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22081. 1608.82 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22082. 1608.82 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22083. 1608.82 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22084. 1608.82 s [algebraic-graphs]
  22085. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22086. 1608.82 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22087. 1608.82 s [algebraic-graphs]
  22088. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22089. 1608.82 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22090. 1608.82 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22091. 1608.82 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22092. 1608.82 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22093. 1608.82 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22094. 1608.82 s [algebraic-graphs]
  22095. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22096. 1608.82 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22097. 1608.82 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22098. 1608.82 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22099. 1608.82 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22100. 1608.82 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22101. 1608.82 s [algebraic-graphs]
  22102. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22103. 1608.82 s [algebraic-graphs] OK: replaceVertex x x == id
  22104. 1608.82 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22105. 1608.82 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22106. 1608.82 s [algebraic-graphs]
  22107. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22108. 1608.82 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22109. 1608.82 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22110. 1608.82 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22111. 1608.82 s [algebraic-graphs]
  22112. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22113. 1608.82 s [algebraic-graphs] OK: transpose empty == empty
  22114. 1608.82 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22115. 1608.82 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22116. 1608.82 s [algebraic-graphs] OK: transpose . transpose == id
  22117. 1608.82 s [algebraic-graphs]
  22118. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22119. 1608.82 s [algebraic-graphs] OK: gmap f empty == empty
  22120. 1608.82 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22121. 1608.82 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22122. 1608.82 s [algebraic-graphs] OK: gmap id == id
  22123. 1608.82 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22124. 1608.82 s [algebraic-graphs]
  22125. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22126. 1608.82 s [algebraic-graphs] OK: emap h empty == empty
  22127. 1608.82 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22128. 1608.82 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22129. 1608.82 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22130. 1608.82 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22131. 1608.82 s [algebraic-graphs] OK: emap id == id
  22132. 1608.82 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22133. 1608.82 s [algebraic-graphs]
  22134. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22135. 1608.82 s [algebraic-graphs] OK: induce (const True ) x == x
  22136. 1608.82 s [algebraic-graphs] OK: induce (const False) x == empty
  22137. 1608.82 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22138. 1608.82 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22139. 1608.82 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22140. 1608.82 s [algebraic-graphs]
  22141. 1608.82 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22142. 1609.97 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22143. 1609.97 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22144. 1609.97 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22145. 1609.97 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22146. 1609.97 s [algebraic-graphs]
  22147. 1609.97 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22148. 1609.97 s [algebraic-graphs] OK: closure empty == empty
  22149. 1609.97 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22150. 1609.97 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22151. 1609.97 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22152. 1609.97 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22153. 1609.97 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22154. 1609.97 s [algebraic-graphs] OK: closure . closure == closure
  22155. 1609.97 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22156. 1609.97 s [algebraic-graphs]
  22157. 1609.97 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22158. 1609.97 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22159. 1609.97 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22160. 1609.97 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22161. 1609.97 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22162. 1609.97 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22163. 1609.97 s [algebraic-graphs]
  22164. 1609.97 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22165. 1609.97 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22166. 1609.97 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22167. 1609.97 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22168. 1609.97 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22169. 1609.97 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22170. 1609.97 s [algebraic-graphs]
  22171. 1609.97 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22172. 1609.97 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22173. 1609.97 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22174. 1609.97 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22175. 1609.97 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22176. 1609.97 s [algebraic-graphs]
  22177. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22178. 1609.97 s [algebraic-graphs] OK: isEmpty empty == True
  22179. 1609.97 s [algebraic-graphs] OK: hasVertex x empty == False
  22180. 1609.97 s [algebraic-graphs] OK: vertexCount empty == 0
  22181. 1609.97 s [algebraic-graphs] OK: edgeCount empty == 0
  22182. 1609.97 s [algebraic-graphs]
  22183. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22184. 1609.97 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22185. 1609.97 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22186. 1609.97 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22187. 1609.97 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22188. 1609.97 s [algebraic-graphs]
  22189. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22190. 1609.97 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22191. 1609.97 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22192. 1609.97 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22193. 1609.97 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22194. 1609.97 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22195. 1609.97 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22196. 1609.97 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22197. 1609.97 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22198. 1609.97 s [algebraic-graphs]
  22199. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22200. 1609.97 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22201. 1609.97 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22202. 1609.97 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22203. 1609.97 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22204. 1609.97 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22205. 1609.97 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22206. 1609.97 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22207. 1609.97 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22208. 1609.97 s [algebraic-graphs]
  22209. 1609.97 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22210. 1609.97 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22211. 1609.97 s [algebraic-graphs]
  22212. 1609.97 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22213. 1609.97 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22214. 1609.97 s [algebraic-graphs]
  22215. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22216. 1609.97 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22217. 1609.97 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22218. 1609.97 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22219. 1609.97 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22220. 1609.97 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22221. 1609.97 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22222. 1609.97 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22223. 1609.97 s [algebraic-graphs]
  22224. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22225. 1609.97 s [algebraic-graphs] OK: vertices [] == empty
  22226. 1609.97 s [algebraic-graphs] OK: vertices [x] == vertex x
  22227. 1609.97 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22228. 1609.97 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22229. 1609.97 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22230. 1609.97 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22231. 1609.97 s [algebraic-graphs]
  22232. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22233. 1609.97 s [algebraic-graphs] OK: edges [] == empty
  22234. 1609.97 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22235. 1609.97 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22236. 1609.97 s [algebraic-graphs]
  22237. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22238. 1609.97 s [algebraic-graphs] OK: overlays [] == empty
  22239. 1609.97 s [algebraic-graphs] OK: overlays [x] == x
  22240. 1609.97 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22241. 1609.97 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22242. 1609.97 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22243. 1609.97 s [algebraic-graphs]
  22244. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22245. 1609.97 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22246. 1609.97 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22247. 1609.97 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22248. 1609.97 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22249. 1609.97 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22250. 1609.97 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22251. 1609.97 s [algebraic-graphs]
  22252. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22253. 1609.97 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22254. 1609.97 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22255. 1609.97 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22256. 1609.97 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22257. 1609.97 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22258. 1609.97 s [algebraic-graphs]
  22259. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22260. 1609.97 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22261. 1609.97 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22262. 1609.97 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22263. 1609.97 s [algebraic-graphs]
  22264. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22265. 1609.97 s [algebraic-graphs] OK: isEmpty empty == True
  22266. 1609.97 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22267. 1609.97 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22268. 1609.97 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22269. 1609.97 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22270. 1609.97 s [algebraic-graphs]
  22271. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22272. 1609.97 s [algebraic-graphs] OK: size empty == 1
  22273. 1609.97 s [algebraic-graphs] OK: size (vertex x) == 1
  22274. 1609.97 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22275. 1609.97 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22276. 1609.97 s [algebraic-graphs] OK: size x >= 1
  22277. 1609.97 s [algebraic-graphs] OK: size x >= vertexCount x
  22278. 1609.97 s [algebraic-graphs]
  22279. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22280. 1609.97 s [algebraic-graphs] OK: hasVertex x empty == False
  22281. 1609.97 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22282. 1609.97 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22283. 1609.97 s [algebraic-graphs]
  22284. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22285. 1609.97 s [algebraic-graphs] OK: hasEdge x y empty == False
  22286. 1609.97 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22287. 1609.97 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22288. 1609.97 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22289. 1609.97 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22290. 1609.97 s [algebraic-graphs]
  22291. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22292. 1609.97 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22293. 1609.97 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22294. 1609.97 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22295. 1609.97 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22296. 1609.97 s [algebraic-graphs]
  22297. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22298. 1609.97 s [algebraic-graphs] OK: vertexCount empty == 0
  22299. 1609.97 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22300. 1609.97 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22301. 1609.97 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22302. 1609.97 s [algebraic-graphs]
  22303. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22304. 1609.97 s [algebraic-graphs] OK: edgeCount empty == 0
  22305. 1609.97 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22306. 1609.97 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22307. 1609.97 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22308. 1609.97 s [algebraic-graphs]
  22309. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22310. 1609.97 s [algebraic-graphs] OK: vertexList empty == []
  22311. 1609.97 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22312. 1609.97 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22313. 1609.97 s [algebraic-graphs]
  22314. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22315. 1609.97 s [algebraic-graphs] OK: edgeList empty == []
  22316. 1609.97 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22317. 1609.97 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22318. 1609.97 s [algebraic-graphs]
  22319. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22320. 1609.97 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22321. 1609.97 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22322. 1609.97 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22323. 1609.97 s [algebraic-graphs]
  22324. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22325. 1609.97 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22326. 1609.97 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22327. 1609.97 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22328. 1609.97 s [algebraic-graphs]
  22329. 1609.97 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22330. 1609.97 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22331. 1609.97 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22332. 1612.91 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22333. 1613.04 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22334. 1613.04 s [algebraic-graphs]
  22335. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22336. 1613.04 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22337. 1613.04 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22338. 1613.04 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22339. 1613.04 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22340. 1613.04 s [algebraic-graphs]
  22341. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22342. 1613.04 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22343. 1613.04 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22344. 1613.04 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22345. 1613.04 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22346. 1613.04 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22347. 1613.04 s [algebraic-graphs]
  22348. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22349. 1613.04 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22350. 1613.04 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22351. 1613.04 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22352. 1613.04 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22353. 1613.04 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22354. 1613.04 s [algebraic-graphs]
  22355. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22356. 1613.04 s [algebraic-graphs] OK: replaceVertex x x == id
  22357. 1613.04 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22358. 1613.04 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22359. 1613.04 s [algebraic-graphs]
  22360. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22361. 1613.04 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22362. 1613.04 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22363. 1613.04 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22364. 1613.04 s [algebraic-graphs]
  22365. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22366. 1613.04 s [algebraic-graphs] OK: transpose empty == empty
  22367. 1613.04 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22368. 1613.04 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22369. 1613.04 s [algebraic-graphs] OK: transpose . transpose == id
  22370. 1613.04 s [algebraic-graphs]
  22371. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22372. 1613.04 s [algebraic-graphs] OK: fmap f empty == empty
  22373. 1613.04 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22374. 1613.04 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22375. 1613.04 s [algebraic-graphs] OK: fmap id == id
  22376. 1613.04 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22377. 1613.04 s [algebraic-graphs]
  22378. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22379. 1613.04 s [algebraic-graphs] OK: emap h empty == empty
  22380. 1613.04 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22381. 1613.04 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22382. 1613.04 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22383. 1613.04 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22384. 1613.04 s [algebraic-graphs] OK: emap id == id
  22385. 1613.04 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22386. 1613.04 s [algebraic-graphs]
  22387. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22388. 1613.04 s [algebraic-graphs] OK: induce (const True ) x == x
  22389. 1613.04 s [algebraic-graphs] OK: induce (const False) x == empty
  22390. 1613.04 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22391. 1613.04 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22392. 1613.04 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22393. 1613.04 s [algebraic-graphs]
  22394. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22395. 1613.04 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22396. 1613.04 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22397. 1613.04 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22398. 1613.04 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22399. 1613.04 s [algebraic-graphs]
  22400. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22401. 1613.04 s [algebraic-graphs] OK: closure empty == empty
  22402. 1613.04 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22403. 1613.04 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22404. 1613.04 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22405. 1613.04 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22406. 1613.04 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22407. 1613.04 s [algebraic-graphs] OK: closure . closure == closure
  22408. 1613.04 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22409. 1613.04 s [algebraic-graphs]
  22410. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22411. 1613.04 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22412. 1613.04 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22413. 1613.04 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22414. 1613.04 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22415. 1613.04 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22416. 1613.04 s [algebraic-graphs]
  22417. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22418. 1613.04 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22419. 1613.04 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22420. 1613.04 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22421. 1613.04 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22422. 1613.04 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22423. 1613.04 s [algebraic-graphs]
  22424. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22425. 1613.04 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22426. 1613.04 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22427. 1613.04 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22428. 1613.04 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22429. 1613.04 s [algebraic-graphs]
  22430. 1613.04 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22431. 1613.04 s [algebraic-graphs] OK: context (const False) x == Nothing
  22432. 1613.04 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22433. 1613.04 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22434. 1613.04 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22435. 1613.04 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22436. 1613.04 s [algebraic-graphs]
  22437. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22438. 1613.04 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22439. 1613.04 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22440. 1613.04 s [algebraic-graphs]
  22441. 1613.04 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22442. 1613.04 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22443. 1613.04 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22444. 1613.04 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22445. 1613.04 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22446. 1613.04 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22447. 1613.04 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22448. 1613.04 s [algebraic-graphs] OK: x <= x + y
  22449. 1613.04 s [algebraic-graphs] OK: x + y <= x * y
  22450. 1613.04 s [algebraic-graphs]
  22451. 1613.04 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22452. 1613.04 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22453. 1613.04 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22454. 1613.04 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22455. 1613.04 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22456. 1613.04 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22457. 1613.04 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22458. 1613.04 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22459. 1613.04 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22460. 1613.04 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22461. 1613.04 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22462. 1613.04 s [algebraic-graphs]
  22463. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22464. 1613.04 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22465. 1613.04 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22466. 1613.04 s [algebraic-graphs]
  22467. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22468. 1613.04 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22469. 1613.04 s [algebraic-graphs]
  22470. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22471. 1613.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22472. 1613.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22473. 1613.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22474. 1613.04 s [algebraic-graphs]
  22475. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22476. 1613.04 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22477. 1613.04 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22478. 1613.04 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22479. 1613.04 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22480. 1613.04 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22481. 1613.04 s [algebraic-graphs]
  22482. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22483. 1613.04 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22484. 1613.04 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22485. 1613.04 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22486. 1613.04 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22487. 1613.04 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22488. 1613.04 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22489. 1613.04 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22490. 1613.04 s [algebraic-graphs]
  22491. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22492. 1613.04 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22493. 1613.04 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22494. 1613.04 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22495. 1613.04 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22496. 1613.04 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22497. 1613.04 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22498. 1613.04 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22499. 1613.04 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22500. 1613.04 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22501. 1613.04 s [algebraic-graphs]
  22502. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22503. 1613.04 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22504. 1613.04 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22505. 1613.04 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22506. 1613.04 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22507. 1613.04 s [algebraic-graphs]
  22508. 1613.04 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22509. 1613.04 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22510. 1613.04 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22511. 1613.04 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22512. 1613.04 s [algebraic-graphs]
  22513. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22514. 1616.03 s [algebraic-graphs] OK: overlays1 [x] == x
  22515. 1616.03 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22516. 1616.03 s [algebraic-graphs]
  22517. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22518. 1616.03 s [algebraic-graphs] OK: connects1 [x] == x
  22519. 1616.03 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22520. 1616.03 s [algebraic-graphs]
  22521. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22522. 1616.03 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22523. 1616.03 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22524. 1616.03 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22525. 1616.03 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22526. 1616.03 s [algebraic-graphs]
  22527. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22528. 1616.03 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22529. 1616.03 s [algebraic-graphs]
  22530. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22531. 1616.03 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22532. 1616.03 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22533. 1616.03 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22534. 1616.03 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22535. 1616.03 s [algebraic-graphs]
  22536. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22537. 1616.03 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22538. 1616.03 s [algebraic-graphs] OK: vertexCount x >= 1
  22539. 1616.03 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22540. 1616.03 s [algebraic-graphs]
  22541. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22542. 1616.03 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22543. 1616.03 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22544. 1616.03 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22545. 1616.03 s [algebraic-graphs]
  22546. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22547. 1616.03 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22548. 1616.03 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22549. 1616.03 s [algebraic-graphs]
  22550. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22551. 1616.03 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22552. 1616.03 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22553. 1616.03 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22554. 1616.03 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22555. 1616.03 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22556. 1616.03 s [algebraic-graphs]
  22557. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22558. 1616.03 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22559. 1616.03 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22560. 1616.03 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22561. 1616.03 s [algebraic-graphs]
  22562. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22563. 1616.03 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22564. 1616.03 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22565. 1616.03 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22566. 1616.03 s [algebraic-graphs]
  22567. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22568. 1616.03 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22569. 1616.03 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22570. 1616.03 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22571. 1616.03 s [algebraic-graphs]
  22572. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22573. 1616.03 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22574. 1616.03 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22575. 1616.03 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22576. 1616.03 s [algebraic-graphs]
  22577. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22578. 1616.03 s [algebraic-graphs] OK: path1 [x] == vertex x
  22579. 1616.03 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22580. 1616.03 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22581. 1616.03 s [algebraic-graphs]
  22582. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22583. 1616.03 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22584. 1616.03 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22585. 1616.03 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22586. 1616.03 s [algebraic-graphs]
  22587. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22588. 1616.03 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22589. 1616.03 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22590. 1616.03 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22591. 1616.03 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22592. 1616.03 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22593. 1616.03 s [algebraic-graphs]
  22594. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22595. 1616.03 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22596. 1616.03 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22597. 1616.03 s [algebraic-graphs]
  22598. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22599. 1616.03 s [algebraic-graphs] OK: star x [] == vertex x
  22600. 1616.03 s [algebraic-graphs] OK: star x [y] == edge x y
  22601. 1616.03 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22602. 1616.03 s [algebraic-graphs]
  22603. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22604. 1616.03 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22605. 1616.03 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22606. 1616.03 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22607. 1616.03 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22608. 1616.03 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22609. 1616.03 s [algebraic-graphs]
  22610. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22611. 1616.03 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22612. 1616.03 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22613. 1616.03 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22614. 1616.03 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22615. 1616.03 s [algebraic-graphs]
  22616. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22617. 1616.03 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22618. 1616.03 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22619. 1616.03 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22620. 1616.03 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22621. 1616.03 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22622. 1616.03 s [algebraic-graphs]
  22623. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  22624. 1616.03 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22625. 1616.03 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22626. 1616.03 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22627. 1616.03 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22628. 1616.03 s [algebraic-graphs]
  22629. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  22630. 1616.03 s [algebraic-graphs] OK: replaceVertex x x == id
  22631. 1616.03 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22632. 1616.03 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22633. 1616.03 s [algebraic-graphs]
  22634. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  22635. 1616.03 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22636. 1616.03 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22637. 1616.03 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22638. 1616.03 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22639. 1616.03 s [algebraic-graphs]
  22640. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  22641. 1616.03 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22642. 1616.03 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22643. 1616.03 s [algebraic-graphs] OK: transpose . transpose == id
  22644. 1616.03 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22645. 1616.03 s [algebraic-graphs]
  22646. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  22647. 1616.03 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22648. 1616.03 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22649. 1616.03 s [algebraic-graphs] OK: gmap id == id
  22650. 1616.03 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22651. 1616.03 s [algebraic-graphs]
  22652. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  22653. 1616.03 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22654. 1616.03 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22655. 1616.03 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22656. 1616.03 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22657. 1616.03 s [algebraic-graphs]
  22658. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  22659. 1616.03 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22660. 1616.03 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22661. 1616.03 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  22662. 1616.03 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  22663. 1616.03 s [algebraic-graphs]
  22664. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  22665. 1616.03 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  22666. 1616.03 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  22667. 1616.03 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22668. 1616.03 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  22669. 1616.03 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22670. 1616.03 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22671. 1616.03 s [algebraic-graphs] OK: closure . closure == closure
  22672. 1616.03 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22673. 1616.03 s [algebraic-graphs]
  22674. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  22675. 1616.03 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  22676. 1616.03 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  22677. 1616.03 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22678. 1616.03 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22679. 1616.03 s [algebraic-graphs]
  22680. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  22681. 1616.03 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22682. 1616.03 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  22683. 1616.03 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22684. 1616.03 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22685. 1616.03 s [algebraic-graphs]
  22686. 1616.03 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  22687. 1616.03 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22688. 1616.03 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  22689. 1616.03 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  22690. 1616.03 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22691. 1616.03 s [algebraic-graphs]
  22692. 1616.03 s [algebraic-graphs] ============ NonEmpty.Graph.============
  22693. 1616.03 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22694. 1616.03 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22695. 1616.03 s [algebraic-graphs]
  22696. 1616.03 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  22697. 1616.03 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22698. 1616.03 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22699. 1616.03 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22700. 1616.03 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22701. 1616.03 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22702. 1616.03 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22703. 1616.03 s [algebraic-graphs] OK: x <= x + y
  22704. 1616.03 s [algebraic-graphs] OK: x + y <= x * y
  22705. 1616.03 s [algebraic-graphs]
  22706. 1616.03 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  22707. 1616.03 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22708. 1616.03 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  22709. 1616.03 s [algebraic-graphs] OK: fmap id == id
  22710. 1616.03 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22711. 1616.03 s [algebraic-graphs]
  22712. 1616.03 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  22713. 1616.03 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  22714. 1617.54 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  22715. 1617.54 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  22716. 1617.54 s [algebraic-graphs] OK: (x >>= vertex) == x
  22717. 1617.54 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  22718. 1617.54 s [algebraic-graphs]
  22719. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  22720. 1617.54 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22721. 1617.54 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  22722. 1617.54 s [algebraic-graphs]
  22723. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  22724. 1617.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22725. 1617.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22726. 1617.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22727. 1617.54 s [algebraic-graphs] OK: size (vertex x) == 1
  22728. 1617.54 s [algebraic-graphs]
  22729. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  22730. 1617.54 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22731. 1617.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22732. 1617.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22733. 1617.54 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22734. 1617.54 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22735. 1617.54 s [algebraic-graphs]
  22736. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  22737. 1617.54 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22738. 1617.54 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22739. 1617.54 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22740. 1617.54 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22741. 1617.54 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22742. 1617.54 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22743. 1617.54 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22744. 1617.54 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22745. 1617.54 s [algebraic-graphs]
  22746. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  22747. 1617.54 s [algebraic-graphs] OK: overlay1 empty x == x
  22748. 1617.54 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  22749. 1617.54 s [algebraic-graphs]
  22750. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  22751. 1617.54 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22752. 1617.54 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22753. 1617.54 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22754. 1617.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22755. 1617.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22756. 1617.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22757. 1617.54 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22758. 1617.54 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22759. 1617.54 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22760. 1617.54 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22761. 1617.54 s [algebraic-graphs]
  22762. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  22763. 1617.54 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22764. 1617.54 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22765. 1617.54 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22766. 1617.54 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22767. 1617.54 s [algebraic-graphs]
  22768. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  22769. 1617.54 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22770. 1617.54 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22771. 1617.54 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22772. 1617.54 s [algebraic-graphs]
  22773. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  22774. 1617.54 s [algebraic-graphs] OK: overlays1 [x] == x
  22775. 1617.54 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22776. 1617.54 s [algebraic-graphs]
  22777. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  22778. 1617.54 s [algebraic-graphs] OK: connects1 [x] == x
  22779. 1617.54 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22780. 1617.54 s [algebraic-graphs]
  22781. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  22782. 1617.54 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  22783. 1617.54 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  22784. 1617.54 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  22785. 1617.54 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  22786. 1617.54 s [algebraic-graphs]
  22787. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  22788. 1617.54 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22789. 1617.54 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22790. 1617.54 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22791. 1617.54 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22792. 1617.54 s [algebraic-graphs]
  22793. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  22794. 1617.54 s [algebraic-graphs] OK: x === x == True
  22795. 1617.54 s [algebraic-graphs] OK: x + y === x + y == True
  22796. 1617.54 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22797. 1617.54 s [algebraic-graphs] OK: x + y === x * y == False
  22798. 1617.54 s [algebraic-graphs]
  22799. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  22800. 1617.54 s [algebraic-graphs] OK: size (vertex x) == 1
  22801. 1617.54 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22802. 1617.54 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22803. 1617.54 s [algebraic-graphs] OK: size x >= 1
  22804. 1617.54 s [algebraic-graphs] OK: size x >= vertexCount x
  22805. 1617.54 s [algebraic-graphs]
  22806. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  22807. 1617.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22808. 1617.54 s [algebraic-graphs]
  22809. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  22810. 1617.54 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22811. 1617.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22812. 1617.54 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22813. 1617.54 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22814. 1617.54 s [algebraic-graphs]
  22815. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  22816. 1617.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22817. 1617.54 s [algebraic-graphs] OK: vertexCount x >= 1
  22818. 1617.54 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22819. 1617.54 s [algebraic-graphs]
  22820. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  22821. 1617.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22822. 1617.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22823. 1617.54 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22824. 1617.54 s [algebraic-graphs]
  22825. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  22826. 1617.54 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22827. 1617.54 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22828. 1617.54 s [algebraic-graphs]
  22829. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  22830. 1617.54 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22831. 1617.54 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22832. 1617.54 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22833. 1617.54 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22834. 1617.54 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22835. 1617.54 s [algebraic-graphs]
  22836. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  22837. 1617.54 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22838. 1617.54 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22839. 1617.54 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22840. 1617.54 s [algebraic-graphs]
  22841. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  22842. 1617.54 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22843. 1617.54 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22844. 1617.54 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22845. 1617.54 s [algebraic-graphs]
  22846. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  22847. 1617.54 s [algebraic-graphs] OK: path1 [x] == vertex x
  22848. 1617.54 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22849. 1617.54 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22850. 1617.54 s [algebraic-graphs]
  22851. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  22852. 1617.54 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22853. 1617.54 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22854. 1617.54 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22855. 1617.54 s [algebraic-graphs]
  22856. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  22857. 1617.54 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22858. 1617.54 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22859. 1617.54 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22860. 1617.54 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22861. 1617.54 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22862. 1617.54 s [algebraic-graphs]
  22863. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  22864. 1617.54 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22865. 1617.54 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22866. 1617.54 s [algebraic-graphs]
  22867. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  22868. 1617.54 s [algebraic-graphs] OK: star x [] == vertex x
  22869. 1617.54 s [algebraic-graphs] OK: star x [y] == edge x y
  22870. 1617.54 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22871. 1617.54 s [algebraic-graphs]
  22872. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  22873. 1617.54 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22874. 1617.54 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22875. 1617.54 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22876. 1617.54 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22877. 1617.54 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22878. 1617.54 s [algebraic-graphs]
  22879. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  22880. 1617.54 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22881. 1617.54 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22882. 1617.54 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22883. 1617.54 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22884. 1617.54 s [algebraic-graphs]
  22885. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  22886. 1617.54 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  22887. 1617.54 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  22888. 1617.54 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  22889. 1617.54 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22890. 1617.54 s [algebraic-graphs]
  22891. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  22892. 1617.54 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  22893. 1617.54 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  22894. 1617.54 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  22895. 1617.54 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  22896. 1617.54 s [algebraic-graphs]
  22897. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  22898. 1617.54 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22899. 1617.54 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22900. 1617.54 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22901. 1617.54 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22902. 1617.54 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22903. 1617.54 s [algebraic-graphs]
  22904. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  22905. 1617.54 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22906. 1617.54 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22907. 1617.54 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22908. 1617.54 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22909. 1617.54 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22910. 1617.54 s [algebraic-graphs]
  22911. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  22912. 1617.54 s [algebraic-graphs] OK: replaceVertex x x == id
  22913. 1617.54 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22914. 1617.54 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22915. 1617.54 s [algebraic-graphs]
  22916. 1617.54 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  22917. 1617.54 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22918. 1623.87 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22919. 1623.87 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22920. 1623.91 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22921. 1623.91 s [algebraic-graphs]
  22922. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  22923. 1623.91 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  22924. 1623.91 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  22925. 1623.91 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22926. 1623.91 s [algebraic-graphs]
  22927. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  22928. 1623.91 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22929. 1623.91 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22930. 1623.91 s [algebraic-graphs] OK: transpose . transpose == id
  22931. 1623.91 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22932. 1623.91 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22933. 1623.91 s [algebraic-graphs]
  22934. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  22935. 1623.91 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22936. 1623.91 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22937. 1623.91 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22938. 1623.91 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22939. 1623.91 s [algebraic-graphs]
  22940. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  22941. 1623.91 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22942. 1623.91 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22943. 1623.91 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  22944. 1623.91 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  22945. 1623.91 s [algebraic-graphs]
  22946. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  22947. 1623.91 s [algebraic-graphs] OK: simplify == id
  22948. 1623.91 s [algebraic-graphs] OK: size (simplify x) <= size x
  22949. 1623.91 s [algebraic-graphs] OK: simplify 1 === 1
  22950. 1623.91 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  22951. 1623.91 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  22952. 1623.91 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  22953. 1623.91 s [algebraic-graphs]
  22954. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  22955. 1623.91 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22956. 1623.91 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22957. 1623.91 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22958. 1623.91 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22959. 1623.91 s [algebraic-graphs]
  22960. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  22961. 1623.91 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22962. 1623.91 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22963. 1623.91 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22964. 1623.91 s [algebraic-graphs]
  22965. 1623.91 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  22966. 1623.91 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  22967. 1623.91 s [algebraic-graphs] OK: box x y ~~ box y x
  22968. 1623.91 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22969. 1623.91 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22970. 1623.91 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22971. 1623.91 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22972. 1623.91 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22973. 1623.91 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22974. 1623.91 s [algebraic-graphs]
  22975. 1623.91 s [algebraic-graphs] ============ Relation ============
  22976. 1623.91 s [algebraic-graphs] OK: Axioms of graphs
  22977. 1623.91 s [algebraic-graphs]
  22978. 1623.91 s [algebraic-graphs] ============ Relation.consistent ============
  22979. 1623.91 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  22980. 1623.91 s [algebraic-graphs]
  22981. 1623.91 s [algebraic-graphs] OK: consistent empty == True
  22982. 1623.91 s [algebraic-graphs] OK: consistent (vertex x) == True
  22983. 1623.91 s [algebraic-graphs] OK: consistent (overlay x y) == True
  22984. 1623.91 s [algebraic-graphs] OK: consistent (connect x y) == True
  22985. 1623.91 s [algebraic-graphs] OK: consistent (edge x y) == True
  22986. 1623.91 s [algebraic-graphs] OK: consistent (edges xs) == True
  22987. 1623.91 s [algebraic-graphs] OK: consistent (stars xs) == True
  22988. 1623.91 s [algebraic-graphs]
  22989. 1623.91 s [algebraic-graphs] ============ Relation.Show ============
  22990. 1623.91 s [algebraic-graphs] OK: show (empty ) == "empty"
  22991. 1623.91 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  22992. 1623.91 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  22993. 1623.91 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  22994. 1623.91 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  22995. 1623.91 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  22996. 1623.91 s [algebraic-graphs]
  22997. 1623.91 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  22998. 1623.91 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  22999. 1623.91 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23000. 1623.91 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23001. 1623.91 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23002. 1623.91 s [algebraic-graphs]
  23003. 1623.91 s [algebraic-graphs] ============ Relation.Ord ============
  23004. 1623.91 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23005. 1623.91 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23006. 1623.91 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23007. 1623.91 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23008. 1623.91 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23009. 1623.91 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23010. 1623.91 s [algebraic-graphs] OK: x <= x + y
  23011. 1623.91 s [algebraic-graphs] OK: x + y <= x * y
  23012. 1623.91 s [algebraic-graphs]
  23013. 1623.91 s [algebraic-graphs] ============ Relation.empty ============
  23014. 1623.91 s [algebraic-graphs] OK: isEmpty empty == True
  23015. 1623.91 s [algebraic-graphs] OK: hasVertex x empty == False
  23016. 1623.91 s [algebraic-graphs] OK: vertexCount empty == 0
  23017. 1623.91 s [algebraic-graphs] OK: edgeCount empty == 0
  23018. 1623.91 s [algebraic-graphs]
  23019. 1623.91 s [algebraic-graphs] ============ Relation.vertex ============
  23020. 1623.91 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23021. 1623.91 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23022. 1623.91 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23023. 1623.91 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23024. 1623.91 s [algebraic-graphs]
  23025. 1623.91 s [algebraic-graphs] ============ Relation.edge ============
  23026. 1623.91 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23027. 1623.91 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23028. 1623.91 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23029. 1623.91 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23030. 1623.91 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23031. 1623.91 s [algebraic-graphs]
  23032. 1623.91 s [algebraic-graphs] ============ Relation.overlay ============
  23033. 1623.91 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23034. 1623.91 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23035. 1623.91 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23036. 1623.91 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23037. 1623.91 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23038. 1623.91 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23039. 1623.91 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23040. 1623.91 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23041. 1623.91 s [algebraic-graphs]
  23042. 1623.91 s [algebraic-graphs] ============ Relation.connect ============
  23043. 1623.91 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23044. 1623.91 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23045. 1623.91 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23046. 1623.91 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23047. 1623.91 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23048. 1623.91 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23049. 1623.91 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23050. 1623.91 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23051. 1623.91 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23052. 1623.91 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23053. 1623.91 s [algebraic-graphs]
  23054. 1623.91 s [algebraic-graphs] ============ Relation.vertices ============
  23055. 1623.91 s [algebraic-graphs] OK: vertices [] == empty
  23056. 1623.91 s [algebraic-graphs] OK: vertices [x] == vertex x
  23057. 1623.91 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23058. 1623.91 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23059. 1623.91 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23060. 1623.91 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23061. 1623.91 s [algebraic-graphs]
  23062. 1623.91 s [algebraic-graphs] ============ Relation.edges ============
  23063. 1623.91 s [algebraic-graphs] OK: edges [] == empty
  23064. 1623.91 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23065. 1623.91 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23066. 1623.91 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23067. 1623.91 s [algebraic-graphs]
  23068. 1623.91 s [algebraic-graphs] ============ Relation.overlays ============
  23069. 1623.91 s [algebraic-graphs] OK: overlays [] == empty
  23070. 1623.91 s [algebraic-graphs] OK: overlays [x] == x
  23071. 1623.91 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23072. 1623.91 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23073. 1623.91 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23074. 1623.91 s [algebraic-graphs]
  23075. 1623.91 s [algebraic-graphs] ============ Relation.connects ============
  23076. 1623.91 s [algebraic-graphs] OK: connects [] == empty
  23077. 1623.91 s [algebraic-graphs] OK: connects [x] == x
  23078. 1623.91 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23079. 1623.91 s [algebraic-graphs] OK: connects == foldr connect empty
  23080. 1623.91 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23081. 1623.91 s [algebraic-graphs]
  23082. 1623.91 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23083. 1623.91 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23084. 1623.91 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23085. 1623.91 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23086. 1623.91 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23087. 1623.91 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23088. 1623.91 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23089. 1623.91 s [algebraic-graphs]
  23090. 1623.91 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23091. 1623.91 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23092. 1623.91 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23093. 1623.91 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23094. 1623.91 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23095. 1623.91 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23096. 1623.91 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23097. 1623.91 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23098. 1623.91 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23099. 1623.91 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23100. 1623.91 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23101. 1623.91 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23102. 1623.91 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23103. 1623.92 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23104. 1623.92 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23105. 1623.92 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23106. 1623.92 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23107. 1623.92 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23108. 1627.02 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23109. 1627.02 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23110. 1627.02 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23111. 1627.02 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23112. 1627.02 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23113. 1627.02 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23114. 1627.02 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23115. 1627.02 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23116. 1627.02 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23117. 1627.02 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23118. 1627.02 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23119. 1627.02 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23120. 1627.02 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23121. 1627.02 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23122. 1627.02 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23123. 1627.02 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23124. 1627.02 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23125. 1627.02 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23126. 1627.02 s [algebraic-graphs]
  23127. 1627.02 s [algebraic-graphs] ============ Relation.foldg ============
  23128. 1627.02 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23129. 1627.02 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23130. 1627.02 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23131. 1627.02 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23132. 1627.02 s [algebraic-graphs]
  23133. 1627.02 s [algebraic-graphs] ============ Relation.isEmpty ============
  23134. 1627.02 s [algebraic-graphs] OK: isEmpty empty == True
  23135. 1627.02 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23136. 1627.02 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23137. 1627.02 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23138. 1627.02 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23139. 1627.02 s [algebraic-graphs]
  23140. 1627.02 s [algebraic-graphs] ============ Relation.hasVertex ============
  23141. 1627.02 s [algebraic-graphs] OK: hasVertex x empty == False
  23142. 1627.02 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23143. 1627.02 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23144. 1627.02 s [algebraic-graphs]
  23145. 1627.02 s [algebraic-graphs] ============ Relation.hasEdge ============
  23146. 1627.02 s [algebraic-graphs] OK: hasEdge x y empty == False
  23147. 1627.02 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23148. 1627.02 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23149. 1627.02 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23150. 1627.02 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23151. 1627.02 s [algebraic-graphs]
  23152. 1627.02 s [algebraic-graphs] ============ Relation.vertexCount ============
  23153. 1627.02 s [algebraic-graphs] OK: vertexCount empty == 0
  23154. 1627.02 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23155. 1627.02 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23156. 1627.02 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23157. 1627.02 s [algebraic-graphs]
  23158. 1627.02 s [algebraic-graphs] ============ Relation.edgeCount ============
  23159. 1627.02 s [algebraic-graphs] OK: edgeCount empty == 0
  23160. 1627.02 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23161. 1627.02 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23162. 1627.02 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23163. 1627.02 s [algebraic-graphs]
  23164. 1627.02 s [algebraic-graphs] ============ Relation.vertexList ============
  23165. 1627.02 s [algebraic-graphs] OK: vertexList empty == []
  23166. 1627.02 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23167. 1627.02 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23168. 1627.02 s [algebraic-graphs]
  23169. 1627.02 s [algebraic-graphs] ============ Relation.vertexSet ============
  23170. 1627.02 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23171. 1627.02 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23172. 1627.02 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23173. 1627.02 s [algebraic-graphs]
  23174. 1627.02 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23175. 1627.02 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23176. 1627.02 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23177. 1627.02 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23178. 1627.02 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23179. 1627.02 s [algebraic-graphs]
  23180. 1627.02 s [algebraic-graphs] ============ Relation.edgeList ============
  23181. 1627.02 s [algebraic-graphs] OK: edgeList empty == []
  23182. 1627.02 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23183. 1627.02 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23184. 1627.02 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23185. 1627.02 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23186. 1627.02 s [algebraic-graphs]
  23187. 1627.02 s [algebraic-graphs] ============ Relation.edgeSet ============
  23188. 1627.02 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23189. 1627.02 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23190. 1627.02 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23191. 1627.02 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23192. 1627.02 s [algebraic-graphs]
  23193. 1627.02 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23194. 1627.02 s [algebraic-graphs] OK: adjacencyList empty == []
  23195. 1627.02 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23196. 1627.02 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23197. 1627.02 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23198. 1627.02 s [algebraic-graphs]
  23199. 1627.02 s [algebraic-graphs] ============ Relation.preSet ============
  23200. 1627.02 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23201. 1627.02 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23202. 1627.02 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23203. 1627.02 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23204. 1627.02 s [algebraic-graphs]
  23205. 1627.02 s [algebraic-graphs] ============ Relation.preIntSet ============
  23206. 1627.02 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23207. 1627.02 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23208. 1627.02 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23209. 1627.02 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23210. 1627.02 s [algebraic-graphs]
  23211. 1627.02 s [algebraic-graphs] ============ Relation.postSet ============
  23212. 1627.02 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23213. 1627.02 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23214. 1627.02 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23215. 1627.02 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23216. 1627.02 s [algebraic-graphs]
  23217. 1627.02 s [algebraic-graphs] ============ Relation.postIntSet ============
  23218. 1627.02 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23219. 1627.02 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23220. 1627.02 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23221. 1627.02 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23222. 1627.02 s [algebraic-graphs]
  23223. 1627.02 s [algebraic-graphs] ============ Relation.path ============
  23224. 1627.02 s [algebraic-graphs] OK: path [] == empty
  23225. 1627.02 s [algebraic-graphs] OK: path [x] == vertex x
  23226. 1627.02 s [algebraic-graphs] OK: path [x,y] == edge x y
  23227. 1627.02 s [algebraic-graphs]
  23228. 1627.02 s [algebraic-graphs] ============ Relation.circuit ============
  23229. 1627.02 s [algebraic-graphs] OK: circuit [] == empty
  23230. 1627.02 s [algebraic-graphs] OK: circuit [x] == edge x x
  23231. 1627.02 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23232. 1627.02 s [algebraic-graphs]
  23233. 1627.02 s [algebraic-graphs] ============ Relation.clique ============
  23234. 1627.02 s [algebraic-graphs] OK: clique [] == empty
  23235. 1627.02 s [algebraic-graphs] OK: clique [x] == vertex x
  23236. 1627.02 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23237. 1627.02 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23238. 1627.02 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23239. 1627.02 s [algebraic-graphs]
  23240. 1627.02 s [algebraic-graphs] ============ Relation.biclique ============
  23241. 1627.02 s [algebraic-graphs] OK: biclique [] [] == empty
  23242. 1627.02 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23243. 1627.02 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23244. 1627.02 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23245. 1627.02 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23246. 1627.02 s [algebraic-graphs]
  23247. 1627.02 s [algebraic-graphs] ============ Relation.star ============
  23248. 1627.02 s [algebraic-graphs] OK: star x [] == vertex x
  23249. 1627.02 s [algebraic-graphs] OK: star x [y] == edge x y
  23250. 1627.02 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23251. 1627.02 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23252. 1627.02 s [algebraic-graphs]
  23253. 1627.02 s [algebraic-graphs] ============ Relation.stars ============
  23254. 1627.02 s [algebraic-graphs] OK: stars [] == empty
  23255. 1627.02 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23256. 1627.02 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23257. 1627.02 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23258. 1627.02 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23259. 1627.02 s [algebraic-graphs] OK: stars . adjacencyList == id
  23260. 1627.02 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23261. 1627.02 s [algebraic-graphs]
  23262. 1627.02 s [algebraic-graphs] ============ Relation.tree ============
  23263. 1627.02 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23264. 1627.02 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23265. 1627.02 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23266. 1627.02 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23267. 1627.02 s [algebraic-graphs]
  23268. 1627.02 s [algebraic-graphs] ============ Relation.forest ============
  23269. 1627.02 s [algebraic-graphs] OK: forest [] == empty
  23270. 1627.02 s [algebraic-graphs] OK: forest [x] == tree x
  23271. 1627.02 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23272. 1627.02 s [algebraic-graphs] OK: forest == overlays . map tree
  23273. 1627.02 s [algebraic-graphs]
  23274. 1627.02 s [algebraic-graphs] ============ Relation.removeVertex ============
  23275. 1627.02 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23276. 1627.02 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23277. 1627.02 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23278. 1627.02 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23279. 1627.02 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23280. 1627.02 s [algebraic-graphs]
  23281. 1627.02 s [algebraic-graphs] ============ Relation.removeEdge ============
  23282. 1627.02 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23283. 1627.02 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23284. 1627.02 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23285. 1627.02 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23286. 1627.02 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23287. 1627.02 s [algebraic-graphs]
  23288. 1627.02 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23289. 1627.02 s [algebraic-graphs] OK: replaceVertex x x == id
  23290. 1627.02 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23291. 1627.02 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23292. 1627.02 s [algebraic-graphs]
  23293. 1627.02 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23294. 1627.02 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23295. 1649.12 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23296. 1649.12 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23297. 1649.16 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23298. 1649.16 s [algebraic-graphs]
  23299. 1649.16 s [algebraic-graphs] ============ Relation.transpose ============
  23300. 1649.16 s [algebraic-graphs] OK: transpose empty == empty
  23301. 1649.16 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23302. 1649.16 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23303. 1649.16 s [algebraic-graphs] OK: transpose . transpose == id
  23304. 1649.16 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23305. 1649.16 s [algebraic-graphs]
  23306. 1649.16 s [algebraic-graphs] ============ Relation.gmap ============
  23307. 1649.16 s [algebraic-graphs] OK: gmap f empty == empty
  23308. 1649.16 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23309. 1649.16 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23310. 1649.16 s [algebraic-graphs] OK: gmap id == id
  23311. 1649.16 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23312. 1649.16 s [algebraic-graphs]
  23313. 1649.16 s [algebraic-graphs] ============ Relation.induce ============
  23314. 1649.16 s [algebraic-graphs] OK: induce (const True ) x == x
  23315. 1649.16 s [algebraic-graphs] OK: induce (const False) x == empty
  23316. 1649.16 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23317. 1649.16 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23318. 1649.16 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23319. 1649.16 s [algebraic-graphs]
  23320. 1649.16 s [algebraic-graphs] ============ Relation.compose ============
  23321. 1649.16 s [algebraic-graphs] OK: compose empty x == empty
  23322. 1649.16 s [algebraic-graphs] OK: compose x empty == empty
  23323. 1649.16 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23324. 1649.16 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23325. 1649.16 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23326. 1649.16 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23327. 1649.16 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23328. 1649.16 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23329. 1649.16 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23330. 1649.16 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23331. 1649.16 s [algebraic-graphs]
  23332. 1649.16 s [algebraic-graphs] ============ Relation.closure ============
  23333. 1649.16 s [algebraic-graphs] OK: closure empty == empty
  23334. 1649.16 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23335. 1649.16 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23336. 1649.16 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23337. 1649.16 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23338. 1649.16 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23339. 1649.16 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23340. 1649.16 s [algebraic-graphs] OK: closure . closure == closure
  23341. 1649.16 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23342. 1649.16 s [algebraic-graphs]
  23343. 1649.16 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23344. 1649.16 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23345. 1649.16 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23346. 1649.16 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23347. 1649.16 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23348. 1649.16 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23349. 1649.16 s [algebraic-graphs]
  23350. 1649.16 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23351. 1649.16 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23352. 1649.16 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23353. 1649.16 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23354. 1649.16 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23355. 1649.16 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23356. 1649.16 s [algebraic-graphs]
  23357. 1649.16 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23358. 1649.16 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23359. 1649.16 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23360. 1649.16 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23361. 1649.16 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23362. 1649.16 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23363. 1649.16 s [algebraic-graphs]
  23364. 1649.16 s [algebraic-graphs] ============ Relation.induceJust ============
  23365. 1649.16 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23366. 1649.16 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23367. 1649.16 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23368. 1649.16 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23369. 1649.16 s [algebraic-graphs]
  23370. 1649.16 s [algebraic-graphs] ============ ReflexiveRelation ============
  23371. 1649.16 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23372. 1649.16 s [algebraic-graphs]
  23373. 1649.16 s [algebraic-graphs] ============ TransitiveRelation ============
  23374. 1649.16 s [algebraic-graphs] OK: Axioms of transitive graphs
  23375. 1649.16 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23376. 1649.16 s [algebraic-graphs]
  23377. 1649.16 s [algebraic-graphs] ============ PreorderRelation ============
  23378. 1649.16 s [algebraic-graphs] OK: Axioms of preorder graphs
  23379. 1649.16 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23380. 1649.16 s [algebraic-graphs]
  23381. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation ============
  23382. 1649.16 s [algebraic-graphs] OK: Axioms of undirected graphs
  23383. 1649.16 s [algebraic-graphs]
  23384. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23385. 1649.16 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23386. 1649.16 s [algebraic-graphs]
  23387. 1649.16 s [algebraic-graphs] OK: consistent empty == True
  23388. 1649.16 s [algebraic-graphs] OK: consistent (vertex x) == True
  23389. 1649.16 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23390. 1649.16 s [algebraic-graphs] OK: consistent (connect x y) == True
  23391. 1649.16 s [algebraic-graphs] OK: consistent (edge x y) == True
  23392. 1649.16 s [algebraic-graphs] OK: consistent (edges xs) == True
  23393. 1649.16 s [algebraic-graphs] OK: consistent (stars xs) == True
  23394. 1649.16 s [algebraic-graphs]
  23395. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23396. 1649.16 s [algebraic-graphs] OK: show (empty ) == "empty"
  23397. 1649.16 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23398. 1649.16 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23399. 1649.16 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23400. 1649.16 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23401. 1649.16 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23402. 1649.16 s [algebraic-graphs]
  23403. 1649.16 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23404. 1649.16 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23405. 1649.16 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23406. 1649.16 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23407. 1649.16 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23408. 1649.16 s [algebraic-graphs]
  23409. 1649.16 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23410. 1649.16 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23411. 1649.16 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23412. 1649.16 s [algebraic-graphs]
  23413. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23414. 1649.16 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23415. 1649.16 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23416. 1649.16 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23417. 1649.16 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23418. 1649.16 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23419. 1649.16 s [algebraic-graphs]
  23420. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23421. 1649.16 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23422. 1649.16 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23423. 1649.16 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23424. 1649.16 s [algebraic-graphs]
  23425. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23426. 1649.16 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23427. 1649.16 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23428. 1649.16 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23429. 1649.16 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23430. 1649.16 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23431. 1649.16 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23432. 1649.16 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23433. 1649.16 s [algebraic-graphs] OK: x <= x + y
  23434. 1649.16 s [algebraic-graphs] OK: x + y <= x * y
  23435. 1649.16 s [algebraic-graphs]
  23436. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23437. 1649.16 s [algebraic-graphs] OK: isEmpty empty == True
  23438. 1649.16 s [algebraic-graphs] OK: hasVertex x empty == False
  23439. 1649.16 s [algebraic-graphs] OK: vertexCount empty == 0
  23440. 1649.16 s [algebraic-graphs] OK: edgeCount empty == 0
  23441. 1649.16 s [algebraic-graphs]
  23442. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23443. 1649.16 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23444. 1649.16 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23445. 1649.16 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23446. 1649.16 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23447. 1649.16 s [algebraic-graphs]
  23448. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23449. 1649.16 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23450. 1649.16 s [algebraic-graphs] OK: edge x y == edge y x
  23451. 1649.16 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23452. 1649.16 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23453. 1649.16 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23454. 1649.16 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23455. 1649.16 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23456. 1649.16 s [algebraic-graphs]
  23457. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23458. 1649.16 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23459. 1649.16 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23460. 1649.16 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23461. 1649.16 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23462. 1649.16 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23463. 1649.16 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23464. 1649.16 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23465. 1649.16 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23466. 1649.16 s [algebraic-graphs]
  23467. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23468. 1649.16 s [algebraic-graphs] OK: connect x y == connect y x
  23469. 1649.16 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23470. 1649.16 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23471. 1649.16 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23472. 1649.16 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23473. 1649.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23474. 1649.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23475. 1649.16 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23476. 1649.16 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23477. 1649.16 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23478. 1649.16 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23479. 1649.16 s [algebraic-graphs]
  23480. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23481. 1649.16 s [algebraic-graphs] OK: vertices [] == empty
  23482. 1649.16 s [algebraic-graphs] OK: vertices [x] == vertex x
  23483. 1649.16 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23484. 1649.16 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23485. 1649.16 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23486. 1649.16 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23487. 1649.16 s [algebraic-graphs]
  23488. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23489. 1649.16 s [algebraic-graphs] OK: edges [] == empty
  23490. 1649.16 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23491. 1649.16 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23492. 1649.16 s [algebraic-graphs]
  23493. 1649.16 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23494. 1649.16 s [algebraic-graphs] OK: overlays [] == empty
  23495. 1659.69 s [algebraic-graphs] OK: overlays [x] == x
  23496. 1659.72 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23497. 1659.72 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23498. 1659.72 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23499. 1659.72 s [algebraic-graphs]
  23500. 1659.72 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23501. 1659.72 s [algebraic-graphs] OK: connects [] == empty
  23502. 1659.72 s [algebraic-graphs] OK: connects [x] == x
  23503. 1659.72 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23504. 1659.72 s [algebraic-graphs] OK: connects == foldr connect empty
  23505. 1659.72 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23506. 1659.72 s [algebraic-graphs] OK: connects == connects . reverse
  23507. 1659.72 s [algebraic-graphs]
  23508. 1659.72 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23509. 1659.72 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23510. 1659.72 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23511. 1659.72 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23512. 1659.72 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23513. 1659.72 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23514. 1659.72 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23515. 1659.72 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23516. 1659.72 s [algebraic-graphs]
  23517. 1659.72 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23518. 1659.72 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23519. 1659.72 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23520. 1659.72 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23521. 1659.72 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23522. 1659.72 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23523. 1659.72 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23524. 1659.72 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23525. 1659.72 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23526. 1659.72 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23527. 1659.72 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23528. 1659.72 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23529. 1659.72 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23530. 1659.72 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23531. 1659.72 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23532. 1659.72 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23533. 1659.72 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23534. 1659.72 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23535. 1659.72 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23536. 1659.72 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23537. 1659.72 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23538. 1659.72 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23539. 1659.72 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23540. 1659.72 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23541. 1659.72 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23542. 1659.72 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23543. 1659.72 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23544. 1659.72 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23545. 1659.72 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23546. 1659.72 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23547. 1659.72 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23548. 1659.72 s [algebraic-graphs]
  23549. 1659.72 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23550. 1659.72 s [algebraic-graphs] OK: isEmpty empty == True
  23551. 1659.72 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23552. 1659.72 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23553. 1659.72 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23554. 1659.72 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23555. 1659.72 s [algebraic-graphs]
  23556. 1659.72 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23557. 1659.72 s [algebraic-graphs] OK: hasVertex x empty == False
  23558. 1659.72 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23559. 1659.72 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23560. 1659.72 s [algebraic-graphs]
  23561. 1659.72 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23562. 1659.72 s [algebraic-graphs] OK: hasEdge x y empty == False
  23563. 1659.72 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23564. 1659.72 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23565. 1659.73 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23566. 1659.73 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23567. 1659.73 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23568. 1659.73 s [algebraic-graphs]
  23569. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23570. 1659.73 s [algebraic-graphs] OK: vertexCount empty == 0
  23571. 1659.73 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23572. 1659.73 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23573. 1659.73 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23574. 1659.73 s [algebraic-graphs]
  23575. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23576. 1659.73 s [algebraic-graphs] OK: edgeCount empty == 0
  23577. 1659.73 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23578. 1659.73 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23579. 1659.73 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23580. 1659.73 s [algebraic-graphs]
  23581. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23582. 1659.73 s [algebraic-graphs] OK: vertexList empty == []
  23583. 1659.73 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23584. 1659.73 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23585. 1659.73 s [algebraic-graphs]
  23586. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23587. 1659.73 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23588. 1659.73 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23589. 1659.73 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23590. 1659.73 s [algebraic-graphs]
  23591. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23592. 1659.73 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23593. 1659.73 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23594. 1659.73 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23595. 1659.73 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23596. 1659.73 s [algebraic-graphs]
  23597. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23598. 1659.73 s [algebraic-graphs] OK: edgeList empty == []
  23599. 1659.73 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23600. 1659.73 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23601. 1659.73 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23602. 1659.73 s [algebraic-graphs]
  23603. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23604. 1659.73 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23605. 1659.73 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23606. 1659.73 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23607. 1659.73 s [algebraic-graphs]
  23608. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23609. 1659.73 s [algebraic-graphs] OK: adjacencyList empty == []
  23610. 1659.73 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23611. 1659.73 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23612. 1659.73 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23613. 1659.73 s [algebraic-graphs]
  23614. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23615. 1659.73 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23616. 1659.73 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23617. 1659.73 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23618. 1659.73 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23619. 1659.73 s [algebraic-graphs]
  23620. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23621. 1659.73 s [algebraic-graphs] OK: path [] == empty
  23622. 1659.73 s [algebraic-graphs] OK: path [x] == vertex x
  23623. 1659.73 s [algebraic-graphs] OK: path [x,y] == edge x y
  23624. 1659.73 s [algebraic-graphs] OK: path == path . reverse
  23625. 1659.73 s [algebraic-graphs]
  23626. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  23627. 1659.73 s [algebraic-graphs] OK: circuit [] == empty
  23628. 1659.73 s [algebraic-graphs] OK: circuit [x] == edge x x
  23629. 1659.73 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23630. 1659.73 s [algebraic-graphs] OK: circuit == circuit . reverse
  23631. 1659.73 s [algebraic-graphs]
  23632. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  23633. 1659.73 s [algebraic-graphs] OK: clique [] == empty
  23634. 1659.73 s [algebraic-graphs] OK: clique [x] == vertex x
  23635. 1659.73 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23636. 1659.73 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23637. 1659.73 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23638. 1659.73 s [algebraic-graphs] OK: clique == clique . reverse
  23639. 1659.73 s [algebraic-graphs]
  23640. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  23641. 1659.73 s [algebraic-graphs] OK: biclique [] [] == empty
  23642. 1659.73 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23643. 1659.73 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23644. 1659.73 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23645. 1659.73 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23646. 1659.73 s [algebraic-graphs]
  23647. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  23648. 1659.73 s [algebraic-graphs] OK: star x [] == vertex x
  23649. 1659.73 s [algebraic-graphs] OK: star x [y] == edge x y
  23650. 1659.73 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23651. 1659.73 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23652. 1659.73 s [algebraic-graphs]
  23653. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  23654. 1659.73 s [algebraic-graphs] OK: stars [] == empty
  23655. 1659.73 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23656. 1659.73 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23657. 1659.73 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23658. 1659.73 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23659. 1659.73 s [algebraic-graphs] OK: stars . adjacencyList == id
  23660. 1659.73 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23661. 1659.73 s [algebraic-graphs]
  23662. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  23663. 1659.73 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23664. 1659.73 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23665. 1659.73 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23666. 1659.73 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23667. 1659.73 s [algebraic-graphs]
  23668. 1659.73 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  23669. 1659.73 s [algebraic-graphs] OK: forest [] == empty
  23670. 1665.68 s [algebraic-graphs] OK: forest [x] == tree x
  23671. 1665.68 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23672. 1665.72 s [algebraic-graphs] OK: forest == overlays . map tree
  23673. 1665.72 s [algebraic-graphs]
  23674. 1665.72 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  23675. 1665.72 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23676. 1665.72 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23677. 1665.72 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23678. 1665.72 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23679. 1665.72 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23680. 1665.72 s [algebraic-graphs]
  23681. 1665.72 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  23682. 1665.72 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23683. 1665.72 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23684. 1665.72 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23685. 1665.72 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23686. 1665.72 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23687. 1665.72 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23688. 1665.72 s [algebraic-graphs]
  23689. 1665.72 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  23690. 1665.72 s [algebraic-graphs] OK: replaceVertex x x == id
  23691. 1665.72 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23692. 1665.72 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23693. 1665.72 s [algebraic-graphs]
  23694. 1665.72 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  23695. 1665.72 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23696. 1665.72 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23697. 1665.72 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23698. 1665.72 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23699. 1665.72 s [algebraic-graphs]
  23700. 1665.72 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  23701. 1665.72 s [algebraic-graphs] OK: gmap f empty == empty
  23702. 1665.72 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23703. 1665.72 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23704. 1665.72 s [algebraic-graphs] OK: gmap id == id
  23705. 1665.72 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23706. 1665.72 s [algebraic-graphs]
  23707. 1665.72 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  23708. 1665.72 s [algebraic-graphs] OK: induce (const True ) x == x
  23709. 1665.72 s [algebraic-graphs] OK: induce (const False) x == empty
  23710. 1665.72 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23711. 1665.72 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23712. 1665.72 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23713. 1665.72 s [algebraic-graphs]
  23714. 1665.72 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  23715. 1665.72 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23716. 1665.72 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23717. 1665.72 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23718. 1665.72 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23719. 1665.72 s [algebraic-graphs]
  23720. 1665.72 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  23721. 1665.72 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  23722. 1665.72 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  23723. 1665.72 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  23724. 1665.72 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  23725. 1665.72 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  23726. 1665.72 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  23727. 1665.72 s [algebraic-graphs]
  23728. 1665.72 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  23729. 1665.72 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  23730. 1665.72 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  23731. 1665.72 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  23732. 1665.72 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  23733. 1665.72 s [algebraic-graphs]
  23734. 1665.72 s [algebraic-graphs] ============ Typed ============
  23735. 1665.72 s [algebraic-graphs]
  23736. 1665.72 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  23737. 1665.72 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23738. 1665.72 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23739. 1665.72 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  23740. 1665.72 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23741. 1665.72 s [algebraic-graphs]
  23742. 1665.72 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  23743. 1665.72 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23744. 1665.72 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23745. 1665.72 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  23746. 1665.72 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23747. 1665.72 s [algebraic-graphs]
  23748. 1665.72 s [algebraic-graphs] ============ Typed.dfsForest ============
  23749. 1665.72 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  23750. 1665.72 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  23751. 1665.72 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  23752. 1665.72 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  23753. 1665.72 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  23754. 1665.72 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  23755. 1665.72 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  23756. 1665.72 s [algebraic-graphs]
  23757. 1665.72 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  23758. 1665.72 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  23759. 1665.72 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  23760. 1665.72 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  23761. 1665.72 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  23762. 1665.72 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  23763. 1665.72 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  23764. 1665.72 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  23765. 1665.72 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  23766. 1665.72 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  23767. 1665.72 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  23768. 1665.72 s [algebraic-graphs]
  23769. 1665.72 s [algebraic-graphs] ============ Typed.dfs ============
  23770. 1665.72 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  23771. 1665.72 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  23772. 1665.72 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  23773. 1665.72 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  23774. 1665.72 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  23775. 1665.72 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  23776. 1665.72 s [algebraic-graphs] OK: dfs % x $ [] == []
  23777. 1665.72 s [algebraic-graphs]
  23778. 1665.72 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  23779. 1665.72 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  23780. 1665.72 s [algebraic-graphs]
  23781. 1665.72 s [algebraic-graphs] ============ Typed.topSort ============
  23782. 1665.72 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  23783. 1665.72 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  23784. 1665.72 s [algebraic-graphs]
  23785. 1665.72 s [algebraic-graphs] ============ Graph.Undirected ============
  23786. 1665.72 s [algebraic-graphs] OK: Axioms of undirected graphs
  23787. 1665.72 s [algebraic-graphs]
  23788. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  23789. 1665.72 s [algebraic-graphs] OK: show (empty ) == "empty"
  23790. 1665.72 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23791. 1665.72 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23792. 1665.72 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23793. 1665.72 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23794. 1665.72 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23795. 1665.72 s [algebraic-graphs]
  23796. 1665.72 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23797. 1665.72 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23798. 1665.72 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23799. 1665.72 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23800. 1665.72 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23801. 1665.72 s [algebraic-graphs]
  23802. 1665.72 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23803. 1665.72 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23804. 1665.72 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23805. 1665.72 s [algebraic-graphs]
  23806. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  23807. 1665.72 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  23808. 1665.72 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23809. 1665.72 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  23810. 1665.72 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  23811. 1665.72 s [algebraic-graphs]
  23812. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  23813. 1665.72 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  23814. 1665.72 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23815. 1665.72 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  23816. 1665.72 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  23817. 1665.72 s [algebraic-graphs]
  23818. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  23819. 1665.72 s [algebraic-graphs] OK: complement empty == empty
  23820. 1665.72 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  23821. 1665.72 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  23822. 1665.72 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  23823. 1665.72 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  23824. 1665.72 s [algebraic-graphs] OK: complement . complement == id
  23825. 1665.72 s [algebraic-graphs]
  23826. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  23827. 1665.72 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23828. 1665.72 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23829. 1665.72 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23830. 1665.72 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23831. 1665.72 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23832. 1665.72 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23833. 1665.72 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23834. 1665.72 s [algebraic-graphs] OK: x <= x + y
  23835. 1665.72 s [algebraic-graphs] OK: x + y <= x * y
  23836. 1665.72 s [algebraic-graphs]
  23837. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  23838. 1665.72 s [algebraic-graphs] OK: isEmpty empty == True
  23839. 1665.72 s [algebraic-graphs] OK: hasVertex x empty == False
  23840. 1665.72 s [algebraic-graphs] OK: vertexCount empty == 0
  23841. 1665.72 s [algebraic-graphs] OK: edgeCount empty == 0
  23842. 1665.72 s [algebraic-graphs]
  23843. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  23844. 1665.72 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23845. 1665.72 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23846. 1665.72 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23847. 1665.72 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23848. 1665.72 s [algebraic-graphs]
  23849. 1665.72 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  23850. 1665.72 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23851. 1665.72 s [algebraic-graphs] OK: edge x y == edge y x
  23852. 1673.29 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23853. 1673.29 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23854. 1673.29 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23855. 1673.32 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23856. 1673.32 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23857. 1673.32 s [algebraic-graphs]
  23858. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  23859. 1673.32 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23860. 1673.32 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23861. 1673.32 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23862. 1673.32 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23863. 1673.32 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23864. 1673.32 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23865. 1673.32 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23866. 1673.32 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23867. 1673.32 s [algebraic-graphs]
  23868. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  23869. 1673.32 s [algebraic-graphs] OK: connect x y == connect y x
  23870. 1673.32 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23871. 1673.32 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23872. 1673.32 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23873. 1673.32 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23874. 1673.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23875. 1673.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23876. 1673.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23877. 1673.32 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23878. 1673.32 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23879. 1673.32 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23880. 1673.32 s [algebraic-graphs]
  23881. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  23882. 1673.32 s [algebraic-graphs] OK: vertices [] == empty
  23883. 1673.32 s [algebraic-graphs] OK: vertices [x] == vertex x
  23884. 1673.32 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23885. 1673.32 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23886. 1673.32 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23887. 1673.32 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23888. 1673.32 s [algebraic-graphs]
  23889. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  23890. 1673.32 s [algebraic-graphs] OK: edges [] == empty
  23891. 1673.32 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23892. 1673.32 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23893. 1673.32 s [algebraic-graphs]
  23894. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  23895. 1673.32 s [algebraic-graphs] OK: overlays [] == empty
  23896. 1673.32 s [algebraic-graphs] OK: overlays [x] == x
  23897. 1673.32 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23898. 1673.32 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23899. 1673.32 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23900. 1673.32 s [algebraic-graphs]
  23901. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  23902. 1673.32 s [algebraic-graphs] OK: connects [] == empty
  23903. 1673.32 s [algebraic-graphs] OK: connects [x] == x
  23904. 1673.32 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23905. 1673.32 s [algebraic-graphs] OK: connects == foldr connect empty
  23906. 1673.32 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23907. 1673.32 s [algebraic-graphs] OK: connects == connects . reverse
  23908. 1673.32 s [algebraic-graphs]
  23909. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  23910. 1673.32 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23911. 1673.32 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23912. 1673.32 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23913. 1673.32 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23914. 1673.32 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23915. 1673.32 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23916. 1673.32 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23917. 1673.32 s [algebraic-graphs]
  23918. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.path ============
  23919. 1673.32 s [algebraic-graphs] OK: path [] == empty
  23920. 1673.32 s [algebraic-graphs] OK: path [x] == vertex x
  23921. 1673.32 s [algebraic-graphs] OK: path [x,y] == edge x y
  23922. 1673.32 s [algebraic-graphs] OK: path == path . reverse
  23923. 1673.32 s [algebraic-graphs]
  23924. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  23925. 1673.32 s [algebraic-graphs] OK: circuit [] == empty
  23926. 1673.32 s [algebraic-graphs] OK: circuit [x] == edge x x
  23927. 1673.32 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23928. 1673.32 s [algebraic-graphs] OK: circuit == circuit . reverse
  23929. 1673.32 s [algebraic-graphs]
  23930. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  23931. 1673.32 s [algebraic-graphs] OK: clique [] == empty
  23932. 1673.32 s [algebraic-graphs] OK: clique [x] == vertex x
  23933. 1673.32 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23934. 1673.32 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23935. 1673.32 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23936. 1673.32 s [algebraic-graphs] OK: clique == clique . reverse
  23937. 1673.32 s [algebraic-graphs]
  23938. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  23939. 1673.32 s [algebraic-graphs] OK: biclique [] [] == empty
  23940. 1673.32 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23941. 1673.32 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23942. 1673.32 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23943. 1673.32 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23944. 1673.32 s [algebraic-graphs]
  23945. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.star ============
  23946. 1673.32 s [algebraic-graphs] OK: star x [] == vertex x
  23947. 1673.32 s [algebraic-graphs] OK: star x [y] == edge x y
  23948. 1673.32 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23949. 1673.32 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23950. 1673.32 s [algebraic-graphs]
  23951. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  23952. 1673.32 s [algebraic-graphs] OK: stars [] == empty
  23953. 1673.32 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23954. 1673.32 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23955. 1673.32 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23956. 1673.32 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23957. 1673.32 s [algebraic-graphs] OK: stars . adjacencyList == id
  23958. 1673.32 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23959. 1673.32 s [algebraic-graphs]
  23960. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  23961. 1673.32 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23962. 1673.32 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23963. 1673.32 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23964. 1673.32 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23965. 1673.32 s [algebraic-graphs]
  23966. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  23967. 1673.32 s [algebraic-graphs] OK: forest [] == empty
  23968. 1673.32 s [algebraic-graphs] OK: forest [x] == tree x
  23969. 1673.32 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23970. 1673.32 s [algebraic-graphs] OK: forest == overlays . map tree
  23971. 1673.32 s [algebraic-graphs]
  23972. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  23973. 1673.32 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23974. 1673.32 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23975. 1673.32 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23976. 1673.32 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23977. 1673.32 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23978. 1673.32 s [algebraic-graphs]
  23979. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  23980. 1673.32 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23981. 1673.32 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23982. 1673.32 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23983. 1673.32 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23984. 1673.32 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23985. 1673.32 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23986. 1673.32 s [algebraic-graphs]
  23987. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  23988. 1673.32 s [algebraic-graphs] OK: replaceVertex x x == id
  23989. 1673.32 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23990. 1673.32 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23991. 1673.32 s [algebraic-graphs]
  23992. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  23993. 1673.32 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23994. 1673.32 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23995. 1673.32 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23996. 1673.32 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23997. 1673.32 s [algebraic-graphs]
  23998. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  23999. 1673.32 s [algebraic-graphs] OK: gmap f empty == empty
  24000. 1673.32 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24001. 1673.32 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24002. 1673.32 s [algebraic-graphs] OK: gmap id == id
  24003. 1673.32 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24004. 1673.32 s [algebraic-graphs]
  24005. 1673.32 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24006. 1673.32 s [algebraic-graphs] OK: induce (const True ) x == x
  24007. 1673.32 s [algebraic-graphs] OK: induce (const False) x == empty
  24008. 1673.32 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24009. 1673.32 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24010. 1673.32 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24011. 1673.32 s [algebraic-graphs]
  24012. 1673.33 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24013. 1673.33 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24014. 1673.33 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24015. 1673.33 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24016. 1673.33 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24017. 1673.33 s [algebraic-graphs] Test suite main: PASS
  24018. 1673.33 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24019. 1673.33 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24020. 1673.33 s [algebraic-graphs] checkPhase completed in 2 minutes 0 seconds
  24021. 1673.33 s [algebraic-graphs] Phase: haddockPhase
  24022. 1673.89 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  24023. 1673.89 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  24024. 1674.04 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24025. 1674.32 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [HIE file is missing]
  24026. 1674.39 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [HIE file is missing]
  24027. 1674.44 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [HIE file is missing]
  24028. 1674.54 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [HIE file is missing]
  24029. 1674.74 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [HIE file is missing]
  24030. 1674.77 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24031. 1674.88 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  24032. 1675.03 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [HIE file is missing]
  24033. 1675.17 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24034. 1675.28 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  24035. 1675.36 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  24036. 1675.36 s [algebraic-graphs] In the use of ‘head’
  24037. 1675.36 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24038. 1675.36 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24039. 1675.36 s [algebraic-graphs] |
  24040. 1675.36 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  24041. 1675.36 s [algebraic-graphs] | ^^^^
  24042. 1675.36 s [algebraic-graphs]
  24043. 1675.36 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  24044. 1675.36 s [algebraic-graphs] In the use of ‘tail’
  24045. 1675.36 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24046. 1675.36 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24047. 1675.36 s [algebraic-graphs] |
  24048. 1675.36 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  24049. 1675.37 s [algebraic-graphs] | ^^^^
  24050. 1675.37 s [algebraic-graphs]
  24051. 1675.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  24052. 1675.37 s [algebraic-graphs] In the use of ‘head’
  24053. 1675.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24054. 1675.37 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24055. 1675.37 s [algebraic-graphs] |
  24056. 1675.37 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  24057. 1675.37 s [algebraic-graphs] | ^^^^
  24058. 1675.37 s [algebraic-graphs]
  24059. 1675.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  24060. 1675.37 s [algebraic-graphs] In the use of ‘tail’
  24061. 1675.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24062. 1675.37 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24063. 1675.37 s [algebraic-graphs] |
  24064. 1675.37 s [algebraic-graphs] 397 | bnd' = tail bnd
  24065. 1675.37 s [algebraic-graphs] | ^^^^
  24066. 1675.37 s [algebraic-graphs]
  24067. 1675.37 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24068. 1675.41 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [HIE file is missing]
  24069. 1675.52 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24070. 1675.52 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24071. 1675.52 s [algebraic-graphs] will become an error in a future GHC release.
  24072. 1675.52 s [algebraic-graphs] Suggested fix:
  24073. 1675.52 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24074. 1675.52 s [algebraic-graphs] |
  24075. 1675.52 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24076. 1675.52 s [algebraic-graphs] | ^
  24077. 1675.52 s [algebraic-graphs]
  24078. 1675.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24079. 1675.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24080. 1675.53 s [algebraic-graphs] will become an error in a future GHC release.
  24081. 1675.53 s [algebraic-graphs] Suggested fix:
  24082. 1675.53 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24083. 1675.53 s [algebraic-graphs] |
  24084. 1675.53 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24085. 1675.53 s [algebraic-graphs] | ^
  24086. 1675.53 s [algebraic-graphs]
  24087. 1675.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24088. 1675.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24089. 1675.53 s [algebraic-graphs] will become an error in a future GHC release.
  24090. 1675.53 s [algebraic-graphs] Suggested fix:
  24091. 1675.53 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24092. 1675.53 s [algebraic-graphs] |
  24093. 1675.53 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24094. 1675.53 s [algebraic-graphs] | ^
  24095. 1675.53 s [algebraic-graphs]
  24096. 1675.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24097. 1675.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24098. 1675.53 s [algebraic-graphs] will become an error in a future GHC release.
  24099. 1675.53 s [algebraic-graphs] Suggested fix:
  24100. 1675.53 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24101. 1675.53 s [algebraic-graphs] |
  24102. 1675.53 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24103. 1675.53 s [algebraic-graphs] | ^
  24104. 1675.53 s [algebraic-graphs]
  24105. 1675.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24106. 1675.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24107. 1675.53 s [algebraic-graphs] will become an error in a future GHC release.
  24108. 1675.53 s [algebraic-graphs] Suggested fix:
  24109. 1675.53 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24110. 1675.53 s [algebraic-graphs] |
  24111. 1675.53 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24112. 1675.53 s [algebraic-graphs] | ^
  24113. 1675.53 s [algebraic-graphs]
  24114. 1675.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24115. 1675.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24116. 1675.53 s [algebraic-graphs] will become an error in a future GHC release.
  24117. 1675.53 s [algebraic-graphs] Suggested fix:
  24118. 1675.53 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24119. 1675.53 s [algebraic-graphs] |
  24120. 1675.53 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24121. 1675.54 s [algebraic-graphs] | ^
  24122. 1675.54 s [algebraic-graphs]
  24123. 1675.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24124. 1675.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24125. 1675.54 s [algebraic-graphs] will become an error in a future GHC release.
  24126. 1675.54 s [algebraic-graphs] Suggested fix:
  24127. 1675.54 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24128. 1675.54 s [algebraic-graphs] |
  24129. 1675.54 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24130. 1675.54 s [algebraic-graphs] | ^
  24131. 1675.54 s [algebraic-graphs]
  24132. 1675.54 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [HIE file is missing]
  24133. 1675.63 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [HIE file is missing]
  24134. 1675.70 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [HIE file is missing]
  24135. 1675.89 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24136. 1676.02 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [HIE file is missing]
  24137. 1676.18 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [HIE file is missing]
  24138. 1676.19 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [HIE file is missing]
  24139. 1676.21 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [HIE file is missing]
  24140. 1676.23 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24141. 1676.23 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24142. 1676.23 s [algebraic-graphs] will become an error in a future GHC release.
  24143. 1676.23 s [algebraic-graphs] Suggested fix:
  24144. 1676.23 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24145. 1676.23 s [algebraic-graphs] |
  24146. 1676.23 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24147. 1676.23 s [algebraic-graphs] | ^
  24148. 1676.23 s [algebraic-graphs]
  24149. 1676.24 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [HIE file is missing]
  24150. 1676.26 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24151. 1676.26 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24152. 1676.26 s [algebraic-graphs] will become an error in a future GHC release.
  24153. 1676.26 s [algebraic-graphs] Suggested fix:
  24154. 1676.26 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24155. 1676.26 s [algebraic-graphs] |
  24156. 1676.26 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24157. 1676.26 s [algebraic-graphs] | ^
  24158. 1676.26 s [algebraic-graphs]
  24159. 1676.26 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24160. 1676.26 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24161. 1676.26 s [algebraic-graphs] will become an error in a future GHC release.
  24162. 1676.26 s [algebraic-graphs] Suggested fix:
  24163. 1676.26 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24164. 1676.26 s [algebraic-graphs] |
  24165. 1676.26 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24166. 1676.26 s [algebraic-graphs] | ^
  24167. 1676.26 s [algebraic-graphs]
  24168. 1676.26 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [HIE file is missing]
  24169. 1676.32 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [HIE file is missing]
  24170. 1676.42 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [HIE file is missing]
  24171. 1676.44 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [HIE file is missing]
  24172. 1676.45 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [HIE file is missing]
  24173. 1676.46 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [HIE file is missing]
  24174. 1676.48 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) [HIE file is missing]
  24175. 1676.49 s [algebraic-graphs] Haddock coverage:
  24176. 1676.50 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24177. 1676.50 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24178. 1676.50 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24179. 1676.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24180. 1676.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24181. 1676.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24182. 1676.56 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24183. 1676.57 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24184. 1676.57 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24185. 1676.57 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24186. 1676.57 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24187. 1676.57 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24188. 1676.57 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24189. 1676.58 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24190. 1676.59 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24191. 1676.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24192. 1676.59 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24193. 1676.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24194. 1676.59 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24195. 1676.59 s [algebraic-graphs] Missing documentation for:
  24196. 1676.59 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24197. 1676.59 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  24198. 1676.59 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  24199. 1676.59 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  24200. 1676.59 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24201. 1676.59 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24202. 1676.59 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  24203. 1676.59 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24204. 1676.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24205. 1676.60 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24206. 1676.60 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24207. 1676.60 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  24208. 1676.60 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  24209. 1676.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24210. 1676.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24211. 1676.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  24212. 1676.60 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24213. 1676.60 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24214. 1676.60 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24215. 1676.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24216. 1676.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24217. 1676.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  24218. 1676.71 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24219. 1676.71 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24220. 1676.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24221. 1676.71 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24222. 1676.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24223. 1676.71 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24224. 1676.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24225. 1676.71 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24226. 1676.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24227. 1676.71 s [algebraic-graphs] Warning: 'box' is out of scope.
  24228. 1676.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24229. 1676.72 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24230. 1676.72 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24231. 1676.72 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24232. 1676.72 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24233. 1676.72 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24234. 1676.72 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24235. 1676.72 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24236. 1676.72 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24237. 1676.72 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24238. 1676.72 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  24239. 1676.72 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24240. 1676.72 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  24241. 1676.72 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24242. 1676.72 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24243. 1676.72 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24244. 1676.73 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24245. 1676.73 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24246. 1676.73 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24247. 1676.73 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24248. 1676.73 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24249. 1676.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24250. 1676.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24251. 1676.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24252. 1676.74 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24253. 1676.74 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24254. 1676.74 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24255. 1676.74 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24256. 1676.74 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24257. 1676.74 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24258. 1676.74 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24259. 1676.74 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24260. 1676.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24261. 1676.74 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  24262. 1676.74 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  24263. 1676.74 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24264. 1676.74 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24265. 1676.74 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24266. 1676.74 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24267. 1676.75 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24268. 1676.75 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  24269. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  24270. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  24271. 1676.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24272. 1676.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24273. 1676.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  24274. 1676.75 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  24275. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  24276. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  24277. 1676.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24278. 1676.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24279. 1676.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  24280. 1676.75 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  24281. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  24282. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  24283. 1676.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24284. 1676.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24285. 1676.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  24286. 1676.75 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  24287. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  24288. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  24289. 1676.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24290. 1676.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24291. 1676.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  24292. 1676.75 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  24293. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  24294. 1676.75 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  24295. 1676.75 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24296. 1676.75 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24297. 1676.75 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  24298. 1676.75 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24299. 1676.76 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24300. 1676.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24301. 1676.76 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24302. 1676.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24303. 1676.76 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24304. 1676.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24305. 1676.76 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  24306. 1676.76 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  24307. 1676.76 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24308. 1676.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24309. 1676.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24310. 1676.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24311. 1676.76 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24312. 1676.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24313. 1676.76 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24314. 1676.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24315. 1676.76 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24316. 1676.76 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24317. 1676.77 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24318. 1676.78 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24319. 1676.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24320. 1676.78 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24321. 1676.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24322. 1676.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24323. 1676.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24324. 1676.78 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24325. 1676.78 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  24326. 1676.78 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24327. 1676.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24328. 1676.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24329. 1676.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24330. 1676.78 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24331. 1676.78 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24332. 1676.78 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24333. 1676.78 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24334. 1676.78 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24335. 1676.78 s [algebraic-graphs] Missing documentation for:
  24336. 1676.78 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24337. 1676.78 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24338. 1676.78 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24339. 1676.78 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24340. 1676.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24341. 1676.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24342. 1676.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24343. 1676.79 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24344. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  24345. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24346. 1676.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24347. 1676.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24348. 1676.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24349. 1676.79 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24350. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  24351. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24352. 1676.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24353. 1676.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24354. 1676.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24355. 1676.79 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24356. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  24357. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24358. 1676.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24359. 1676.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24360. 1676.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24361. 1676.79 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24362. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  24363. 1676.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24364. 1676.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24365. 1676.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24366. 1676.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24367. 1676.79 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24368. 1676.80 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  24369. 1676.80 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  24370. 1676.80 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  24371. 1676.80 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24372. 1676.80 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24373. 1676.80 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  24374. 1676.80 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24375. 1676.80 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  24376. 1676.80 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  24377. 1676.80 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  24378. 1676.80 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24379. 1676.80 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24380. 1676.80 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  24381. 1676.80 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24382. 1676.80 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24383. 1676.80 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24384. 1676.80 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24385. 1676.80 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24386. 1676.80 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24387. 1676.81 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24388. 1676.81 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24389. 1676.81 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24390. 1676.82 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24391. 1676.82 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24392. 1676.82 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24393. 1676.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24394. 1676.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24395. 1676.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24396. 1676.83 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24397. 1676.83 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  24398. 1676.83 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24399. 1676.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24400. 1676.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24401. 1676.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24402. 1676.83 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24403. 1676.83 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  24404. 1676.83 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24405. 1676.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24406. 1676.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24407. 1676.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24408. 1676.83 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24409. 1676.84 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24410. 1676.84 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24411. 1676.85 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24412. 1676.85 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24413. 1676.85 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24414. 1676.85 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24415. 1676.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24416. 1676.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24417. 1676.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24418. 1676.86 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  24419. 1676.86 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  24420. 1676.86 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24421. 1676.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24422. 1676.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24423. 1676.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24424. 1676.86 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24425. 1676.87 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24426. 1676.87 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  24427. 1676.87 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  24428. 1676.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24429. 1676.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24430. 1676.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  24431. 1676.87 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24432. 1676.87 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  24433. 1676.87 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24434. 1676.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24435. 1676.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24436. 1676.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  24437. 1676.88 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  24438. 1676.88 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  24439. 1676.88 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  24440. 1676.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24441. 1676.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24442. 1676.88 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  24443. 1676.88 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24444. 1676.88 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24445. 1676.88 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24446. 1676.88 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  24447. 1676.88 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  24448. 1676.88 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  24449. 1676.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24450. 1676.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24451. 1676.88 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  24452. 1676.88 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24453. 1676.89 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  24454. 1676.89 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  24455. 1676.89 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  24456. 1676.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24457. 1676.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24458. 1676.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  24459. 1676.89 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24460. 1676.89 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24461. 1676.89 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24462. 1676.89 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24463. 1676.89 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24464. 1676.89 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24465. 1676.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24466. 1676.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24467. 1676.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24468. 1676.90 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24469. 1676.91 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24470. 1676.91 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  24471. 1676.91 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  24472. 1676.91 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24473. 1676.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24474. 1676.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24475. 1676.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24476. 1676.91 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24477. 1676.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24478. 1676.91 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24479. 1676.91 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  24480. 1676.91 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  24481. 1676.91 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24482. 1676.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24483. 1676.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24484. 1676.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24485. 1676.91 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24486. 1676.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24487. 1676.91 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24488. 1676.91 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  24489. 1676.91 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  24490. 1676.91 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24491. 1676.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24492. 1676.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24493. 1676.91 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24494. 1676.91 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24495. 1676.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24496. 1676.91 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24497. 1676.91 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24498. 1676.91 s [algebraic-graphs] Missing documentation for:
  24499. 1676.91 s [algebraic-graphs] Module header
  24500. 1676.91 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24501. 1676.91 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  24502. 1676.91 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  24503. 1676.91 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  24504. 1676.91 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  24505. 1676.91 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  24506. 1676.91 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  24507. 1676.91 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  24508. 1676.91 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  24509. 1676.91 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  24510. 1676.91 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24511. 1676.91 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24512. 1676.91 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  24513. 1676.92 s [algebraic-graphs] Warning: 'array' is out of scope.
  24514. 1676.92 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24515. 1676.92 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24516. 1676.92 s [algebraic-graphs] Missing documentation for:
  24517. 1676.92 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  24518. 1677.09 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  24519. 1677.09 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  24520. 1677.09 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24521. 1677.09 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24522. 1677.09 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  24523. 1677.09 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  24524. 1677.09 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24525. 1677.09 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24526. 1677.10 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  24527. 1677.10 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  24528. 1677.11 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  24529. 1677.11 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  24530. 1677.11 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24531. 1677.11 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24532. 1677.12 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  24533. 1677.12 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  24534. 1677.12 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  24535. 1677.12 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  24536. 1677.12 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  24537. 1677.12 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  24538. 1677.12 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  24539. 1677.12 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  24540. 1677.12 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  24541. 1677.13 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  24542. 1677.13 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  24543. 1677.13 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24544. 1677.14 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  24545. 1677.14 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24546. 1677.14 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24547. 1677.14 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24548. 1677.14 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24549. 1677.14 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24550. 1677.14 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24551. 1677.14 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24552. 1677.14 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24553. 1677.14 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24554. 1677.15 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  24555. 1677.15 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24556. 1677.15 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24557. 1677.15 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  24558. 1677.15 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24559. 1677.15 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24560. 1677.16 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  24561. 1677.16 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24562. 1677.16 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  24563. 1677.16 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  24564. 1677.16 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24565. 1677.16 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24566. 1677.17 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24567. 1677.17 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  24568. 1677.17 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24569. 1677.17 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24570. 1677.18 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  24571. 1677.18 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  24572. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24573. 1677.18 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  24574. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24575. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24576. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24577. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  24578. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24579. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24580. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24581. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  24582. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24583. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24584. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  24585. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  24586. 1677.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  24587. 1677.18 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24588. 1677.18 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24589. 1677.18 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24590. 1677.18 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24591. 1677.18 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  24592. 1677.18 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24593. 1677.18 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  24594. 1677.18 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24595. 1677.18 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  24596. 1677.18 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24597. 1677.18 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  24598. 1677.18 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24599. 1682.17 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs,
  24600. 1682.33 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24601. 1682.81 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  24602. 1682.90 s [algebraic-graphs] Phase: installPhase
  24603. 1682.96 s [algebraic-graphs] Installing library in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  24604. 1683.69 s [algebraic-graphs] Phase: fixupPhase
  24605. 1683.71 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  24606. 1683.74 s [algebraic-graphs] shrinking /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSalgebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x-ghc9.12.2.so
  24607. 1683.75 s [algebraic-graphs] checking for references to /build/ in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7...
  24608. 1683.79 s [algebraic-graphs] patching script interpreter paths in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  24609. 1683.80 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/lib
  24610. 1684.09 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc
  24611. 1684.11 s [algebraic-graphs] checking for references to /build/ in /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc...
  24612. 1684.14 s [algebraic-graphs] patching script interpreter paths in /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc
  24613. 1684.32 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  24614. 1684.89 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  24615. 1684.91 s [post-build-hook] Uploading to the NixCI cache: /nix/store/7b4xhi7nq9chn00y1ginjw82sqkkzp67-algebraic-graphs-0.7-doc /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7
  24616. 1684.95 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24617. 1685.07 s [post-build-hook] copying 1 paths...
  24618. 1685.07 s [post-build-hook] copying path '/nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24619. 1691.47 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24620. 1691.63 s [post-build-hook] copying 0 paths...
  24621. 1691.65 s Progress: 14 of 19 built, 165 of 165 downloaded from cache
  24622. 1691.71 s Building algebraic-graph-duoids
  24623. 1691.87 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  24624. 1691.88 s [algebraic-graph-duoids] Build with /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2.
  24625. 1692.15 s [algebraic-graph-duoids] Phase: unpackPhase
  24626. 1692.16 s [algebraic-graph-duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./algebraic-graphs
  24627. 1692.16 s [algebraic-graph-duoids] source root is algebraic-graphs
  24628. 1692.17 s [algebraic-graph-duoids] Phase: patchPhase
  24629. 1692.18 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  24630. 1692.19 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.TfTQnmkwvy/setup-package.conf.d -threaded
  24631. 1692.25 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.TfTQnmkwvy/Main.o )
  24632. 1692.31 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  24633. 1693.64 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  24634. 1693.65 s [algebraic-graph-duoids] Phase: configurePhase
  24635. 1693.66 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.TfTQnmkwvy/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/lib
  24636. 1693.67 s [algebraic-graph-duoids] Using Parsec parser
  24637. 1693.67 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  24638. 1693.72 s [algebraic-graph-duoids] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  24639. 1693.72 s [algebraic-graph-duoids] 'ghc' version < 9.12):
  24640. 1693.72 s [algebraic-graph-duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc is version
  24641. 1693.72 s [algebraic-graph-duoids] 9.12.2
  24642. 1694.03 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  24643. 1694.32 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24644. 1694.32 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24645. 1694.32 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  24646. 1694.32 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  24647. 1694.32 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24648. 1694.32 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24649. 1694.32 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24650. 1694.32 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24651. 1694.32 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  24652. 1694.32 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  24653. 1694.32 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24654. 1694.32 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  24655. 1694.32 s [algebraic-graph-duoids] hedgehog-1.5
  24656. 1694.32 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24657. 1694.32 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24658. 1694.32 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.21.0.0
  24659. 1694.32 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  24660. 1694.32 s [algebraic-graph-duoids] <0.25: using doctest-0.24.2
  24661. 1694.32 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24662. 1694.32 s [algebraic-graph-duoids] Source component graph:
  24663. 1694.32 s [algebraic-graph-duoids] component lib
  24664. 1694.32 s [algebraic-graph-duoids] component test:doctests dependency lib
  24665. 1694.32 s [algebraic-graph-duoids] component test:laws dependency lib
  24666. 1694.32 s [algebraic-graph-duoids] Configured component graph:
  24667. 1694.32 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24668. 1694.32 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  24669. 1694.32 s [algebraic-graph-duoids] include base-4.21.0.0-d2ce
  24670. 1694.32 s [algebraic-graph-duoids] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  24671. 1694.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24672. 1694.32 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-7xRAFDdohxe13lcjZWT9VE-doctests
  24673. 1694.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24674. 1694.32 s [algebraic-graph-duoids] include base-4.21.0.0-d2ce
  24675. 1694.32 s [algebraic-graph-duoids] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  24676. 1694.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24677. 1694.32 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BtfLGzIZUiGBgI5hCNDlxL-laws
  24678. 1694.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24679. 1694.32 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  24680. 1694.32 s [algebraic-graph-duoids] include base-4.21.0.0-d2ce
  24681. 1694.32 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  24682. 1694.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24683. 1694.32 s [algebraic-graph-duoids] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  24684. 1694.32 s [algebraic-graph-duoids] Linked component graph:
  24685. 1694.32 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24686. 1694.32 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  24687. 1694.32 s [algebraic-graph-duoids] include base-4.21.0.0-d2ce
  24688. 1694.32 s [algebraic-graph-duoids] include duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  24689. 1694.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24690. 1694.32 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM:Algebra.Graph.Duoid.Orphans
  24691. 1694.32 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-7xRAFDdohxe13lcjZWT9VE-doctests
  24692. 1694.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24693. 1694.32 s [algebraic-graph-duoids] include base-4.21.0.0-d2ce
  24694. 1694.32 s [algebraic-graph-duoids] include doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  24695. 1694.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24696. 1694.32 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BtfLGzIZUiGBgI5hCNDlxL-laws
  24697. 1694.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24698. 1694.32 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  24699. 1694.32 s [algebraic-graph-duoids] include base-4.21.0.0-d2ce
  24700. 1694.32 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  24701. 1694.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24702. 1694.32 s [algebraic-graph-duoids] include hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  24703. 1694.32 s [algebraic-graph-duoids] Ready component graph:
  24704. 1694.32 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24705. 1694.32 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  24706. 1694.32 s [algebraic-graph-duoids] depends base-4.21.0.0-d2ce
  24707. 1694.32 s [algebraic-graph-duoids] depends duoids-0.0.1.0-IuBFxch686P4VjwWLKvuLP
  24708. 1694.32 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24709. 1694.32 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BtfLGzIZUiGBgI5hCNDlxL-laws
  24710. 1694.32 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24711. 1694.32 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-FExsROwW0T59iodXbrHh2x
  24712. 1694.32 s [algebraic-graph-duoids] depends base-4.21.0.0-d2ce
  24713. 1694.32 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-1mHNUrhg7f0578C6ht6MwF
  24714. 1694.32 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24715. 1694.32 s [algebraic-graph-duoids] depends hedgehog-1.5-HUP4AhU7QzdBP2TFfvNTUP
  24716. 1694.32 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-7xRAFDdohxe13lcjZWT9VE-doctests
  24717. 1694.32 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24718. 1694.32 s [algebraic-graph-duoids] depends base-4.21.0.0-d2ce
  24719. 1694.32 s [algebraic-graph-duoids] depends doctest-0.24.2-3Vtwe1LFUfT5tbL259GL9x
  24720. 1694.32 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-1J8rBhspjymFYLbIMQRv8V
  24721. 1694.32 s [algebraic-graph-duoids] Using Cabal-3.14.1.0 compiled by ghc-9.12
  24722. 1694.32 s [algebraic-graph-duoids] Using compiler: ghc-9.12.2
  24723. 1694.32 s [algebraic-graph-duoids] Using install prefix:
  24724. 1694.32 s [algebraic-graph-duoids] /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0
  24725. 1694.32 s [algebraic-graph-duoids] Executables installed in:
  24726. 1694.32 s [algebraic-graph-duoids] /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/bin
  24727. 1694.32 s [algebraic-graph-duoids] Libraries installed in:
  24728. 1694.32 s [algebraic-graph-duoids] /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24729. 1694.32 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  24730. 1694.32 s [algebraic-graph-duoids] /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2
  24731. 1694.32 s [algebraic-graph-duoids] Private executables installed in:
  24732. 1694.32 s [algebraic-graph-duoids] /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graph-duoids-0.0.1.0
  24733. 1694.32 s [algebraic-graph-duoids] Data files installed in:
  24734. 1694.32 s [algebraic-graph-duoids] /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graph-duoids-0.0.1.0
  24735. 1694.32 s [algebraic-graph-duoids] Documentation installed in:
  24736. 1694.32 s [algebraic-graph-duoids] /nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  24737. 1694.32 s [algebraic-graph-duoids] Configuration files installed in:
  24738. 1694.32 s [algebraic-graph-duoids] /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/etc
  24739. 1694.32 s [algebraic-graph-duoids] No alex found
  24740. 1694.32 s [algebraic-graph-duoids] Using ar found on system at:
  24741. 1694.32 s [algebraic-graph-duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  24742. 1694.32 s [algebraic-graph-duoids] No c2hs found
  24743. 1694.32 s [algebraic-graph-duoids] No cpphs found
  24744. 1694.32 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  24745. 1694.32 s [algebraic-graph-duoids] /nix/store/ipijqnpysrfmqbr0wn40g9sljakkm866-doctest-0.24.2/bin/doctest
  24746. 1694.32 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  24747. 1694.32 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  24748. 1694.32 s [algebraic-graph-duoids] Using ghc version 9.12.2 found on system at:
  24749. 1694.32 s [algebraic-graph-duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc
  24750. 1694.32 s [algebraic-graph-duoids] Using ghc-pkg version 9.12.2 found on system at:
  24751. 1694.32 s [algebraic-graph-duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/ghc-pkg-9.12.2
  24752. 1694.32 s [algebraic-graph-duoids] No ghcjs found
  24753. 1694.32 s [algebraic-graph-duoids] No ghcjs-pkg found
  24754. 1694.32 s [algebraic-graph-duoids] No greencard found
  24755. 1694.32 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  24756. 1694.32 s [algebraic-graph-duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/haddock-ghc-9.12.2
  24757. 1694.32 s [algebraic-graph-duoids] No happy found
  24758. 1694.32 s [algebraic-graph-duoids] No haskell-suite found
  24759. 1694.32 s [algebraic-graph-duoids] No haskell-suite-pkg found
  24760. 1694.32 s [algebraic-graph-duoids] No hmake found
  24761. 1694.32 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  24762. 1694.32 s [algebraic-graph-duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hpc-ghc-9.12.2
  24763. 1694.32 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  24764. 1694.32 s [algebraic-graph-duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  24765. 1694.32 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  24766. 1694.32 s [algebraic-graph-duoids] /nix/store/2v3bj5c3hw4sl2k1aissf6967f73c0fq-hscolour-1.25/bin/HsColour
  24767. 1694.32 s [algebraic-graph-duoids] No jhc found
  24768. 1694.32 s [algebraic-graph-duoids] Using ld found on system at:
  24769. 1694.32 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  24770. 1694.32 s [algebraic-graph-duoids] No pkg-config found
  24771. 1694.32 s [algebraic-graph-duoids] Using runghc version 9.12.2 found on system at:
  24772. 1694.32 s [algebraic-graph-duoids] /nix/store/cy4xxly1khfbvxgrnhy50hfwdz0dd2nv-ghc-9.12.2/bin/runghc-9.12.2
  24773. 1694.32 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  24774. 1694.32 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  24775. 1694.32 s [algebraic-graph-duoids] Using tar found on system at:
  24776. 1694.32 s [algebraic-graph-duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  24777. 1694.32 s [algebraic-graph-duoids] No uhc found
  24778. 1694.53 s [algebraic-graph-duoids] Phase: buildPhase
  24779. 1694.59 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24780. 1694.59 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  24781. 1694.70 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 )
  24782. 1695.13 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 )
  24783. 1696.01 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  24784. 1696.51 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 )
  24785. 1701.27 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24786. 1701.27 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24787. 1701.40 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  24788. 1702.44 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  24789. 1703.46 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24790. 1703.46 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24791. 1703.56 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 )
  24792. 1704.01 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  24793. 1704.70 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  24794. 1708.71 s [algebraic-graph-duoids] Phase: checkPhase
  24795. 1709.11 s [algebraic-graph-duoids] Running 2 test suites...
  24796. 1709.11 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  24797. 1709.15 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  24798. 1709.15 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  24799. 1709.15 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  24800. 1709.15 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  24801. 1709.15 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  24802. 1709.15 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  24803. 1709.15 s [algebraic-graph-duoids] ✓ 5 succeeded.
  24804. 1709.15 s [algebraic-graph-duoids] Test suite laws: PASS
  24805. 1709.15 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  24806. 1709.15 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  24807. 1709.72 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  24808. 1709.76 s [algebraic-graph-duoids] NameLib Nothing
  24809. 1709.76 s [algebraic-graph-duoids] ----------------------------------------
  24810. 1709.78 s [algebraic-graph-duoids] Test suite doctests: PASS
  24811. 1709.78 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  24812. 1709.78 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  24813. 1709.78 s [algebraic-graph-duoids] Phase: haddockPhase
  24814. 1711.37 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24815. 1711.37 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  24816. 1711.78 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing ) [HIE file is missing]
  24817. 1712.21 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing ) [HIE file is missing]
  24818. 1712.47 s [algebraic-graph-duoids] Haddock coverage:
  24819. 1712.81 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  24820. 1712.81 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  24821. 1721.78 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids,
  24822. 1721.78 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  24823. 1723.39 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24824. 1725.08 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24825. 1725.33 s [algebraic-graph-duoids] Phase: installPhase
  24826. 1725.42 s [algebraic-graph-duoids] Installing library in /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/algebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM
  24827. 1725.65 s [algebraic-graph-duoids] Phase: fixupPhase
  24828. 1725.67 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0
  24829. 1725.68 s [algebraic-graph-duoids] shrinking /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-e4b2/libHSalgebraic-graph-duoids-0.0.1.0-LGAv3eFg9TxKckTxw5kM-ghc9.12.2.so
  24830. 1725.68 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0...
  24831. 1725.70 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0
  24832. 1725.70 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/lib
  24833. 1725.75 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc
  24834. 1725.75 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc...
  24835. 1725.77 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc
  24836. 1725.93 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0
  24837. 1726.44 s [post-build-hook] Pushing 2 paths (76 are already present) using zstd to cache sellout ⏳
  24838. 1726.44 s [post-build-hook]
  24839. 1726.84 s [post-build-hook] Pushing /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0 (1.24 MiB)
  24840. 1726.89 s [post-build-hook] Pushing /nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc (540.03 KiB)
  24841. 1727.92 s [post-build-hook]
  24842. 1727.92 s [post-build-hook] All done.
  24843. 1727.94 s [post-build-hook] Uploading to the NixCI cache: /nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0
  24844. 1727.98 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24845. 1727.99 s [post-build-hook] copying 2 paths...
  24846. 1727.99 s [post-build-hook] copying path '/nix/store/1ikdqdrigpvs2dad1q51yywh0yxs5518-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  24847. 1728.37 s [post-build-hook] copying path '/nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  24848. 1728.89 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24849. 1729.13 s [post-build-hook] copying 1 paths...
  24850. 1729.13 s [post-build-hook] copying path '/nix/store/bwx4mw2762wv1g1mnb65cml645hhkr1d-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  24851. 1729.36 s Progress: 15 of 19 built, 165 of 165 downloaded from cache
  24852. 1729.40 s Building ghc-9.12.2-with-packages
  24853. 1729.45 s [ghc-9.12.2-with-packages] /nix/store/8y11s6khk2wkdvf4r1lya9h3rnwc4cha-duoidal-transformers-0.0.1.0/nix-support:
  24854. 1729.45 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24855. 1729.46 s [ghc-9.12.2-with-packages] /nix/store/631n724m0cwchh4p7hz0chl18b2namh8-duoids-0.0.1.0/nix-support:
  24856. 1729.46 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24857. 1729.46 s [ghc-9.12.2-with-packages] /nix/store/ipz5s4mcg2ps3jrq18jv84ny3naclswa-duoids-hedgehog-0.0.1.0/nix-support:
  24858. 1729.46 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24859. 1729.46 s [ghc-9.12.2-with-packages] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support:
  24860. 1729.46 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24861. 1729.47 s [ghc-9.12.2-with-packages] /nix/store/pkvxklf83q25x4is7x57ilrc82xlgiid-algebraic-graphs-0.7/nix-support:
  24862. 1729.47 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24863. 1729.48 s [ghc-9.12.2-with-packages] /nix/store/ss1j3dr9hhfd794ry1lhky68vxdxjcma-ghc-compat-plugin-0.1.0.1/nix-support:
  24864. 1729.48 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24865. 1729.48 s [ghc-9.12.2-with-packages] /nix/store/ss1j3dr9hhfd794ry1lhky68vxdxjcma-ghc-compat-plugin-0.1.0.1/nix-support:
  24866. 1729.48 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24867. 1729.48 s [ghc-9.12.2-with-packages] /nix/store/aqhascsacrlbmj9c0z17lz86fq5m88sq-hedgehog-1.5/nix-support:
  24868. 1729.48 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24869. 1729.49 s [ghc-9.12.2-with-packages] /nix/store/aqhascsacrlbmj9c0z17lz86fq5m88sq-hedgehog-1.5/nix-support:
  24870. 1729.49 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24871. 1729.49 s [ghc-9.12.2-with-packages] /nix/store/rdrf9wf8vaw856ms410wd2dkrhs7nk07-ansi-terminal-1.1.3/nix-support:
  24872. 1729.49 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24873. 1729.49 s [ghc-9.12.2-with-packages] /nix/store/rdrf9wf8vaw856ms410wd2dkrhs7nk07-ansi-terminal-1.1.3/nix-support:
  24874. 1729.49 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24875. 1729.49 s [ghc-9.12.2-with-packages] /nix/store/0kcziz05cx0sa6d25jvwx1f80h2hnr85-async-2.2.5/nix-support:
  24876. 1729.49 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24877. 1729.50 s [ghc-9.12.2-with-packages] /nix/store/0kcziz05cx0sa6d25jvwx1f80h2hnr85-async-2.2.5/nix-support:
  24878. 1729.50 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24879. 1729.50 s [ghc-9.12.2-with-packages] /nix/store/y5i90fy047kzypa8livcfy04lwp82594-barbies-2.1.1.0/nix-support:
  24880. 1729.50 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24881. 1729.50 s [ghc-9.12.2-with-packages] /nix/store/y5i90fy047kzypa8livcfy04lwp82594-barbies-2.1.1.0/nix-support:
  24882. 1729.50 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24883. 1729.51 s [ghc-9.12.2-with-packages] /nix/store/nnr0h9v86bz86ca1zsfbi9m0d57v2vmj-concurrent-output-1.10.21/nix-support:
  24884. 1729.51 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24885. 1729.51 s [ghc-9.12.2-with-packages] /nix/store/nnr0h9v86bz86ca1zsfbi9m0d57v2vmj-concurrent-output-1.10.21/nix-support:
  24886. 1729.51 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24887. 1729.52 s [ghc-9.12.2-with-packages] /nix/store/la712y9pixdihfyzny0mizmmawa82wd7-lifted-async-0.10.2.7/nix-support:
  24888. 1729.52 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24889. 1729.52 s [ghc-9.12.2-with-packages] /nix/store/la712y9pixdihfyzny0mizmmawa82wd7-lifted-async-0.10.2.7/nix-support:
  24890. 1729.52 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24891. 1729.52 s [ghc-9.12.2-with-packages] /nix/store/gn0swws787bdlynagc22pjnnam68mwsq-mmorph-1.2.1/nix-support:
  24892. 1729.52 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24893. 1729.52 s [ghc-9.12.2-with-packages] /nix/store/gn0swws787bdlynagc22pjnnam68mwsq-mmorph-1.2.1/nix-support:
  24894. 1729.52 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24895. 1729.53 s [ghc-9.12.2-with-packages] /nix/store/xqhwh9nazhhvs17x4smcjm70na922gac-monad-control-1.0.3.1/nix-support:
  24896. 1729.53 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24897. 1729.53 s [ghc-9.12.2-with-packages] /nix/store/xqhwh9nazhhvs17x4smcjm70na922gac-monad-control-1.0.3.1/nix-support:
  24898. 1729.53 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24899. 1729.53 s [ghc-9.12.2-with-packages] /nix/store/4yh5b7mayccdj8w61h4hf34qz49x0ajs-pretty-show-1.10/nix-support:
  24900. 1729.53 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24901. 1729.53 s [ghc-9.12.2-with-packages] /nix/store/4yh5b7mayccdj8w61h4hf34qz49x0ajs-pretty-show-1.10/nix-support:
  24902. 1729.53 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24903. 1729.53 s [ghc-9.12.2-with-packages] /nix/store/vxgfgs1mvp21gl6l47iph3lrpan1rsd4-primitive-0.9.1.0/nix-support:
  24904. 1729.53 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24905. 1729.54 s [ghc-9.12.2-with-packages] /nix/store/vxgfgs1mvp21gl6l47iph3lrpan1rsd4-primitive-0.9.1.0/nix-support:
  24906. 1729.54 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24907. 1729.54 s [ghc-9.12.2-with-packages] /nix/store/j42bsxi8bhrkaicyh8an4yx8frakiv3d-random-1.2.1.3/nix-support:
  24908. 1729.54 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24909. 1729.55 s [ghc-9.12.2-with-packages] /nix/store/j42bsxi8bhrkaicyh8an4yx8frakiv3d-random-1.2.1.3/nix-support:
  24910. 1729.55 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24911. 1729.55 s [ghc-9.12.2-with-packages] /nix/store/vnf0h1rs116sgy0v0bw6mkjfcpsm0qkx-resourcet-1.3.0/nix-support:
  24912. 1729.55 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24913. 1729.55 s [ghc-9.12.2-with-packages] /nix/store/vnf0h1rs116sgy0v0bw6mkjfcpsm0qkx-resourcet-1.3.0/nix-support:
  24914. 1729.55 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24915. 1729.55 s [ghc-9.12.2-with-packages] /nix/store/f4h9q57z55mxmqxk1jajl5mcpw1cq811-safe-exceptions-0.1.7.4/nix-support:
  24916. 1729.55 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24917. 1729.56 s [ghc-9.12.2-with-packages] /nix/store/f4h9q57z55mxmqxk1jajl5mcpw1cq811-safe-exceptions-0.1.7.4/nix-support:
  24918. 1729.56 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24919. 1729.56 s [ghc-9.12.2-with-packages] /nix/store/a43444ms5j0gl0y1rk2s3n4bcs8wk84m-transformers-base-0.4.6/nix-support:
  24920. 1729.56 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24921. 1729.56 s [ghc-9.12.2-with-packages] /nix/store/a43444ms5j0gl0y1rk2s3n4bcs8wk84m-transformers-base-0.4.6/nix-support:
  24922. 1729.56 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24923. 1729.56 s [ghc-9.12.2-with-packages] /nix/store/j61fzi5z4sk7xzac1k503p538mbyy8xp-wl-pprint-annotated-0.1.0.1/nix-support:
  24924. 1729.56 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24925. 1729.56 s [ghc-9.12.2-with-packages] /nix/store/j61fzi5z4sk7xzac1k503p538mbyy8xp-wl-pprint-annotated-0.1.0.1/nix-support:
  24926. 1729.56 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24927. 1729.57 s [ghc-9.12.2-with-packages] /nix/store/9b4jlw09ib7h2ncky9vxlzgggj1jl2c6-ansi-terminal-types-1.1.3/nix-support:
  24928. 1729.57 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24929. 1729.57 s [ghc-9.12.2-with-packages] /nix/store/9b4jlw09ib7h2ncky9vxlzgggj1jl2c6-ansi-terminal-types-1.1.3/nix-support:
  24930. 1729.57 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24931. 1729.58 s [ghc-9.12.2-with-packages] /nix/store/zaazzzs7dc11djb0p2i37756as7slpz2-hashable-1.5.0.0/nix-support:
  24932. 1729.58 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24933. 1729.58 s [ghc-9.12.2-with-packages] /nix/store/zaazzzs7dc11djb0p2i37756as7slpz2-hashable-1.5.0.0/nix-support:
  24934. 1729.58 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24935. 1729.58 s [ghc-9.12.2-with-packages] /nix/store/xnqdi5caq1ynkbyg2qfi1b6zhv3fn501-distributive-0.6.2.1/nix-support:
  24936. 1729.58 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24937. 1729.59 s [ghc-9.12.2-with-packages] /nix/store/xnqdi5caq1ynkbyg2qfi1b6zhv3fn501-distributive-0.6.2.1/nix-support:
  24938. 1729.59 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24939. 1729.59 s [ghc-9.12.2-with-packages] /nix/store/bqshylnkz6gcl2zm7s3r5hlp439mrfal-constraints-0.14.2/nix-support:
  24940. 1729.59 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24941. 1729.60 s [ghc-9.12.2-with-packages] /nix/store/bqshylnkz6gcl2zm7s3r5hlp439mrfal-constraints-0.14.2/nix-support:
  24942. 1729.60 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24943. 1729.60 s [ghc-9.12.2-with-packages] /nix/store/0p3i1fm1by4kjbcassf6hj7lmpc0bp9c-lifted-base-0.2.3.12/nix-support:
  24944. 1729.60 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24945. 1729.60 s [ghc-9.12.2-with-packages] /nix/store/0p3i1fm1by4kjbcassf6hj7lmpc0bp9c-lifted-base-0.2.3.12/nix-support:
  24946. 1729.60 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24947. 1729.61 s [ghc-9.12.2-with-packages] /nix/store/kbxc407a7shgwq4hrmdasaq12n1cmmsf-transformers-compat-0.7.2/nix-support:
  24948. 1729.61 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24949. 1729.61 s [ghc-9.12.2-with-packages] /nix/store/kbxc407a7shgwq4hrmdasaq12n1cmmsf-transformers-compat-0.7.2/nix-support:
  24950. 1729.61 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24951. 1729.62 s [ghc-9.12.2-with-packages] /nix/store/jmj6n9l5505xm5pkzp0q5k882rcy6z7q-splitmix-0.1.3.1/nix-support:
  24952. 1729.62 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24953. 1729.62 s [ghc-9.12.2-with-packages] /nix/store/jmj6n9l5505xm5pkzp0q5k882rcy6z7q-splitmix-0.1.3.1/nix-support:
  24954. 1729.62 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24955. 1729.62 s [ghc-9.12.2-with-packages] /nix/store/swra9l1w3ac4rjhjls6rqy8fq6b9jglb-unliftio-core-0.2.1.0/nix-support:
  24956. 1729.62 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24957. 1729.62 s [ghc-9.12.2-with-packages] /nix/store/swra9l1w3ac4rjhjls6rqy8fq6b9jglb-unliftio-core-0.2.1.0/nix-support:
  24958. 1729.62 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24959. 1729.63 s [ghc-9.12.2-with-packages] /nix/store/4xa8hgl67kialh4br8rdba8hr1p0cgng-base-orphans-0.9.3/nix-support:
  24960. 1729.63 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24961. 1729.63 s [ghc-9.12.2-with-packages] /nix/store/4xa8hgl67kialh4br8rdba8hr1p0cgng-base-orphans-0.9.3/nix-support:
  24962. 1729.63 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24963. 1729.63 s [ghc-9.12.2-with-packages] /nix/store/8kai39lr0v65gqyj2dciy46cb0gillpc-tagged-0.8.9/nix-support:
  24964. 1729.63 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24965. 1729.63 s [ghc-9.12.2-with-packages] /nix/store/8kai39lr0v65gqyj2dciy46cb0gillpc-tagged-0.8.9/nix-support:
  24966. 1729.63 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24967. 1729.63 s [ghc-9.12.2-with-packages] /nix/store/0b32nbwf2nzblavd6dx29z6ibyv29snv-boring-0.2.2/nix-support:
  24968. 1729.63 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24969. 1729.64 s [ghc-9.12.2-with-packages] /nix/store/0b32nbwf2nzblavd6dx29z6ibyv29snv-boring-0.2.2/nix-support:
  24970. 1729.64 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/xzz3y96bkzkcmi4s81g3dzvmhryg4sfx-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24971. 1731.92 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/2jhrv8j08738m63dxb4v1dbxg86vzydy-ghc-9.12.2-with-packages
  24972. 1732.47 s [post-build-hook] Pushing 1 paths (144 are already present) using zstd to cache sellout ⏳
  24973. 1732.54 s [post-build-hook]
  24974. 1732.90 s [post-build-hook] Pushing /nix/store/2jhrv8j08738m63dxb4v1dbxg86vzydy-ghc-9.12.2-with-packages (6.04 MiB)
  24975. 1734.76 s [post-build-hook]
  24976. 1734.76 s [post-build-hook] All done.
  24977. 1734.78 s [post-build-hook] Uploading to the NixCI cache: /nix/store/2jhrv8j08738m63dxb4v1dbxg86vzydy-ghc-9.12.2-with-packages
  24978. 1734.82 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1735.03 s [post-build-hook] copying 1 paths...
  24980. 1735.03 s [post-build-hook] copying path '/nix/store/2jhrv8j08738m63dxb4v1dbxg86vzydy-ghc-9.12.2-with-packages' to 'https://cache.nix-ci.com'...
  24981. 1736.38 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24982. 1736.62 s [post-build-hook] copying 1 paths...
  24983. 1736.62 s [post-build-hook] copying path '/nix/store/2vlc0bw8hd5swz76p1174r417k1p4bcx-ghc-9.12.2-with-packages.drv' to 'https://cache.nix-ci.com'...
  24984. 1736.85 s Progress: 16 of 18 built, 165 of 165 downloaded from cache
  24985. 1736.91 s Building all-packages
  24986. 1736.97 s [all-packages] created 3 symlinks in user environment
  24987. 1737.00 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/fn2nmc26lz4i2r7xyln028n7yl4q4lls-all-packages
  24988. 1737.55 s [post-build-hook] Pushing 1 paths (145 are already present) using zstd to cache sellout ⏳
  24989. 1737.59 s [post-build-hook]
  24990. 1737.99 s [post-build-hook] Pushing /nix/store/fn2nmc26lz4i2r7xyln028n7yl4q4lls-all-packages (872.00 B)
  24991. 1739.34 s [post-build-hook]
  24992. 1739.34 s [post-build-hook] All done.
  24993. 1739.35 s [post-build-hook] Uploading to the NixCI cache: /nix/store/fn2nmc26lz4i2r7xyln028n7yl4q4lls-all-packages
  24994. 1739.39 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1739.59 s [post-build-hook] copying 1 paths...
  24996. 1739.59 s [post-build-hook] copying path '/nix/store/fn2nmc26lz4i2r7xyln028n7yl4q4lls-all-packages' to 'https://cache.nix-ci.com'...
  24997. 1739.84 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24998. 1740.10 s [post-build-hook] copying 1 paths...
  24999. 1740.10 s [post-build-hook] copying path '/nix/store/9rl8b99686g7rzb8waf9s1marl9i6fb5-all-packages.drv' to 'https://cache.nix-ci.com'...
  25000. 1740.32 s Progress: 17 of 18 built, 165 of 165 downloaded from cache
Tail Raw Logs