1. 1074.25 s [hls-test-utils] [5 of 5] Compiling Test.Hls ( src/Test/Hls.hs, dist/build/Test/Hls.o, dist/build/Test/Hls.dyn_o )
  2. 1074.25 s [hls-test-utils] [1 of 5] Compiling Development.IDE.Test.Diagnostic ( src/Development/IDE/Test/Diagnostic.hs, dist/build/Development/IDE/Test/Diagnostic.p_o )
  3. 1074.25 s [hls-test-utils] [2 of 5] Compiling Development.IDE.Test ( src/Development/IDE/Test.hs, dist/build/Development/IDE/Test.p_o )
  4. 1074.25 s [hls-test-utils] [3 of 5] Compiling Test.Hls.FileSystem ( src/Test/Hls/FileSystem.hs, dist/build/Test/Hls/FileSystem.p_o )
  5. 1074.25 s [hls-test-utils] [4 of 5] Compiling Test.Hls.Util ( src/Test/Hls/Util.hs, dist/build/Test/Hls/Util.p_o )
  6. 1074.25 s [hls-test-utils] [5 of 5] Compiling Test.Hls ( src/Test/Hls.hs, dist/build/Test/Hls.p_o )
  7. 1074.25 s [hls-test-utils] Phase: checkPhase
  8. 1074.25 s [hls-test-utils] Package has no test suites.
  9. 1074.25 s [hls-test-utils] Phase: haddockPhase
  10. 1074.25 s [hls-test-utils] Preprocessing library for hls-test-utils-2.12.0.0..
  11. 1074.25 s [hls-test-utils] Running Haddock on library for hls-test-utils-2.12.0.0..
  12. 1074.25 s [hls-test-utils] Warning: The documentation for the following packages are not installed. No
  13. 1074.25 s [hls-test-utils] links will be generated to these packages: attoparsec-0.14.4,
  14. 1074.25 s [hls-test-utils] attoparsec-0.14.4, libyaml-clib-0.2.5, lsp-types-2.3.0.1, vector-0.13.2.0
  15. 1074.25 s [hls-test-utils] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  16. 1074.25 s [hls-test-utils] 37% ( 3 / 8) in 'Development.IDE.Test.Diagnostic'
  17. 1074.25 s [hls-test-utils] Missing documentation for:
  18. 1074.25 s [hls-test-utils] Module header
  19. 1074.25 s [hls-test-utils] cursorPosition (src/Development/IDE/Test/Diagnostic.hs:14)
  20. 1074.25 s [hls-test-utils] ErrorMsg (src/Development/IDE/Test/Diagnostic.hs:17)
  21. 1074.25 s [hls-test-utils] requireDiagnostic (src/Development/IDE/Test/Diagnostic.hs:48)
  22. 1074.25 s [hls-test-utils] standardizeQuotes (src/Development/IDE/Test/Diagnostic.hs:81)
  23. 1074.25 s [hls-test-utils] 21% ( 6 / 28) in 'Development.IDE.Test'
  24. 1074.25 s [hls-test-utils] Missing documentation for:
  25. 1074.25 s [hls-test-utils] Module header
  26. 1074.25 s [hls-test-utils] cursorPosition (src/Development/IDE/Test/Diagnostic.hs:14)
  27. 1074.25 s [hls-test-utils] requireDiagnostic (src/Development/IDE/Test/Diagnostic.hs:48)
  28. 1074.25 s [hls-test-utils] diagnostic (src/Development/IDE/Test.hs:192)
  29. 1074.25 s [hls-test-utils] expectDiagnosticsWithTags (src/Development/IDE/Test.hs:130)
  30. 1074.25 s [hls-test-utils] expectMessages (src/Development/IDE/Test.hs:93)
  31. 1074.25 s [hls-test-utils] expectCurrentDiagnostics (src/Development/IDE/Test.hs:178)
  32. 1074.25 s [hls-test-utils] checkDiagnosticsForDoc (src/Development/IDE/Test.hs:183)
  33. 1074.25 s [hls-test-utils] canonicalizeUri (src/Development/IDE/Test.hs:189)
  34. 1074.25 s [hls-test-utils] standardizeQuotes (src/Development/IDE/Test/Diagnostic.hs:81)
  35. 1074.25 s [hls-test-utils] flushMessages (src/Development/IDE/Test.hs:109)
  36. 1074.25 s [hls-test-utils] waitForAction (src/Development/IDE/Test.hs:214)
  37. 1074.25 s [hls-test-utils] getInterfaceFilesDir (src/Development/IDE/Test.hs:218)
  38. 1074.25 s [hls-test-utils] garbageCollectDirtyKeys (src/Development/IDE/Test.hs:221)
  39. 1074.25 s [hls-test-utils] getFilesOfInterest (src/Development/IDE/Test.hs:233)
  40. 1074.25 s [hls-test-utils] waitForTypecheck (src/Development/IDE/Test.hs:227)
  41. 1074.25 s [hls-test-utils] waitForBuildQueue (src/Development/IDE/Test.hs:230)
  42. 1074.25 s [hls-test-utils] getStoredKeys (src/Development/IDE/Test.hs:224)
  43. 1074.25 s [hls-test-utils] waitForCustomMessage (src/Development/IDE/Test.hs:236)
  44. 1074.25 s [hls-test-utils] waitForGC (src/Development/IDE/Test.hs:243)
  45. 1074.25 s [hls-test-utils] configureCheckProject (src/Development/IDE/Test.hs:249)
  46. 1074.25 s [hls-test-utils] referenceReady (src/Development/IDE/Test.hs:256)
  47. 1074.25 s [hls-test-utils] Warning: 'rootDir' is out of scope.
  48. 1074.25 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  49. 1074.25 s [hls-test-utils] Warning: 'virtualFileTree' is out of scope.
  50. 1074.25 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  51. 1074.25 s [hls-test-utils] 63% ( 21 / 33) in 'Test.Hls.FileSystem'
  52. 1074.25 s [hls-test-utils] Missing documentation for:
  53. 1074.25 s [hls-test-utils] Module header
  54. 1074.25 s [hls-test-utils] FileTree (src/Test/Hls/FileSystem.hs:73)
  55. 1074.25 s [hls-test-utils] Content (src/Test/Hls/FileSystem.hs:79)
  56. 1074.25 s [hls-test-utils] readFileFS (src/Test/Hls/FileSystem.hs:88)
  57. 1074.25 s [hls-test-utils] writeFileFS (src/Test/Hls/FileSystem.hs:92)
  58. 1074.25 s [hls-test-utils] mkVirtualFileTree (src/Test/Hls/FileSystem.hs:141)
  59. 1074.25 s [hls-test-utils] toNfp (src/Test/Hls/FileSystem.hs:151)
  60. 1074.25 s [hls-test-utils] toAbsFp (src/Test/Hls/FileSystem.hs:148)
  61. 1074.25 s [hls-test-utils] directory (src/Test/Hls/FileSystem.hs:178)
  62. 1074.25 s [hls-test-utils] atomicFileWriteString (src/Test/Hls/FileSystem.hs:263)
  63. 1074.25 s [hls-test-utils] atomicFileWriteStringUTF8 (src/Test/Hls/FileSystem.hs:267)
  64. 1074.25 s [hls-test-utils] atomicFileWriteText (src/Test/Hls/FileSystem.hs:271)
  65. 1074.25 s [hls-test-utils] Warning: 'src' is out of scope.
  66. 1074.25 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  67. 1074.25 s [hls-test-utils] Warning: 'ignored' is out of scope.
  68. 1074.25 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  69. 1074.25 s [hls-test-utils] Warning: 'dst' is out of scope.
  70. 1074.25 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  71. 1074.25 s [hls-test-utils] Warning: 'bar' is out of scope.
  72. 1074.25 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  73. 1074.25 s [hls-test-utils] Warning: 'cons' is out of scope.
  74. 1074.25 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  75. 1074.25 s [hls-test-utils] 38% ( 18 / 47) in 'Test.Hls.Util'
  76. 1074.25 s [hls-test-utils] Missing documentation for:
  77. 1074.25 s [hls-test-utils] Module header
  78. 1074.25 s [hls-test-utils] codeActionResolveCaps (src/Test/Hls/Util.hs:103)
  79. 1074.25 s [hls-test-utils] codeActionNoResolveCaps (src/Test/Hls/Util.hs:108)
  80. 1074.25 s [hls-test-utils] codeActionNoInlayHintsCaps (src/Test/Hls/Util.hs:113)
  81. 1074.25 s [hls-test-utils] codeActionSupportCaps (src/Test/Hls/Util.hs:96)
  82. 1074.25 s [hls-test-utils] expectCodeAction (src/Test/Hls/Util.hs:264)
  83. 1074.25 s [hls-test-utils] ghcVersion
  84. 1074.25 s [hls-test-utils] GhcVersion
  85. 1074.25 s [hls-test-utils] hostOS (src/Test/Hls/Util.hs:132)
  86. 1074.25 s [hls-test-utils] OS (src/Test/Hls/Util.hs:129)
  87. 1074.25 s [hls-test-utils] matchesCurrentEnv (src/Test/Hls/Util.hs:125)
  88. 1074.25 s [hls-test-utils] EnvSpec (src/Test/Hls/Util.hs:122)
  89. 1074.25 s [hls-test-utils] ignoreForGhcVersions (src/Test/Hls/Util.hs:162)
  90. 1074.25 s [hls-test-utils] knownBrokenOnWindows (src/Test/Hls/Util.hs:150)
  91. 1074.25 s [hls-test-utils] knownBrokenForGhcVersions (src/Test/Hls/Util.hs:153)
  92. 1074.25 s [hls-test-utils] fromAction (src/Test/Hls/Util.hs:232)
  93. 1074.25 s [hls-test-utils] fromCommand (src/Test/Hls/Util.hs:236)
  94. 1074.25 s [hls-test-utils] dontExpectCodeAction (src/Test/Hls/Util.hs:267)
  95. 1074.25 s [hls-test-utils] expectDiagnostic (src/Test/Hls/Util.hs:255)
  96. 1074.25 s [hls-test-utils] failIfSessionTimeout (src/Test/Hls/Util.hs:332)
  97. 1074.25 s [hls-test-utils] getCompletionByLabel (src/Test/Hls/Util.hs:339)
  98. 1074.25 s [hls-test-utils] noLiteralCaps (src/Test/Hls/Util.hs:90)
  99. 1074.25 s [hls-test-utils] inspectCodeAction (src/Test/Hls/Util.hs:258)
  100. 1074.25 s [hls-test-utils] inspectCommand (src/Test/Hls/Util.hs:275)
  101. 1074.25 s [hls-test-utils] inspectDiagnostic (src/Test/Hls/Util.hs:247)
  102. 1074.25 s [hls-test-utils] inspectDiagnosticAny (src/Test/Hls/Util.hs:251)
  103. 1074.25 s [hls-test-utils] waitForDiagnosticsFrom (src/Test/Hls/Util.hs:281)
  104. 1074.25 s [hls-test-utils] waitForDiagnosticsFromSource (src/Test/Hls/Util.hs:289)
  105. 1074.25 s [hls-test-utils] withCanonicalTempDir (src/Test/Hls/Util.hs:349)
  106. 1074.40 s [vector] Phase: setupCompilerEnvironmentPhase
  107. 1074.41 s [vector] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  108. 1074.71 s [vector] Phase: unpackPhase
  109. 1074.72 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  110. 1074.74 s [vector] source root is vector-0.13.2.0
  111. 1074.75 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  112. 1074.77 s [vector] Phase: patchPhase
  113. 1074.77 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  114. 1074.78 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  115. 1074.83 s [vector] Phase: compileBuildDriverPhase
  116. 1074.83 s [vector] setupCompileFlags: -package-db=/build/tmp.XnNmgE1EY0/setup-package.conf.d -threaded
  117. 1074.95 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.XnNmgE1EY0/Main.o )
  118. 1074.96 s [hls-test-utils] Warning: '^' is ambiguous. It is defined
  119. 1074.97 s [hls-test-utils] * in ‘GHC.Real’
  120. 1074.97 s [hls-test-utils] * in ‘GHC.TypeNats’
  121. 1074.97 s [hls-test-utils] You may be able to disambiguate the identifier by qualifying it or
  122. 1074.97 s [hls-test-utils] by specifying the type/value namespace explicitly.
  123. 1074.97 s [hls-test-utils] Defaulting to the one defined in ‘GHC.TypeNats’
  124. 1074.97 s [hls-test-utils] Warning: 'findFunctionNameUnderCursor' is out of scope.
  125. 1074.97 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  126. 1074.97 s [hls-test-utils] Warning: 'runSessionWithServer'' is out of scope.
  127. 1074.97 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  128. 1074.98 s [hls-test-utils] Warning: 'XDG_CACHE_HOME' is out of scope.
  129. 1074.98 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  130. 1074.98 s [hls-test-utils] Warning: 'ghcide' is out of scope.
  131. 1074.98 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  132. 1074.98 s [hls-test-utils] Warning: 'TASTY_PATTERN' is out of scope.
  133. 1074.98 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  134. 1074.98 s [hls-test-utils] Warning: 'LSP_TIMEOUT' is out of scope.
  135. 1074.98 s [hls-test-utils] If you qualify the identifier, haddock can try to link it anyway.
  136. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Pattern
  137. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export UInt
  138. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Color
  139. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Location
  140. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Position
  141. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Diagnostic
  142. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Range
  143. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export NormalizedUri
  144. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticSeverity
  145. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export NormalizedFilePath
  146. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Uri
  147. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export Command
  148. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceEdit
  149. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionKind
  150. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticTag
  151. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export AnnotatedTextEdit
  152. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ApplyWorkspaceEditParams
  153. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ApplyWorkspaceEditResult
  154. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export BaseSymbolInformation
  155. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyClientCapabilities
  156. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyIncomingCall
  157. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyIncomingCallsParams
  158. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyItem
  159. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyOptions
  160. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyOutgoingCall
  161. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyOutgoingCallsParams
  162. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyPrepareParams
  163. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CallHierarchyRegistrationOptions
  164. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export CancelParams
  165. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ChangeAnnotation
  166. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ChangeAnnotationIdentifier
  167. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ChangeAnnotationsSupportOptions
  168. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCapabilities
  169. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCodeActionKindOptions
  170. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCodeActionLiteralOptions
  171. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCodeActionResolveOptions
  172. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCompletionItemInsertTextModeOptions
  173. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCompletionItemOptions
  174. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCompletionItemOptionsKind
  175. 1075.00 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientCompletionItemResolveOptions
  176. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientDiagnosticsTagOptions
  177. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientFoldingRangeKindOptions
  178. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientFoldingRangeOptions
  179. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientInfo
  180. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientInlayHintResolveOptions
  181. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientSemanticTokensRequestFullDelta
  182. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientSemanticTokensRequestOptions
  183. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientShowMessageActionItemOptions
  184. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientSignatureInformationOptions
  185. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientSignatureParameterInformationOptions
  186. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientSymbolKindOptions
  187. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientSymbolResolveOptions
  188. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ClientSymbolTagOptions
  189. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeAction
  190. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionClientCapabilities
  191. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionContext
  192. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionDisabled
  193. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionOptions
  194. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionParams
  195. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionRegistrationOptions
  196. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeActionTriggerKind
  197. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeDescription
  198. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeLens
  199. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeLensClientCapabilities
  200. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeLensOptions
  201. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeLensParams
  202. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeLensRegistrationOptions
  203. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CodeLensWorkspaceClientCapabilities
  204. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ColorInformation
  205. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ColorPresentation
  206. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ColorPresentationParams
  207. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionClientCapabilities
  208. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionContext
  209. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionItem
  210. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionItemDefaults
  211. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionItemKind
  212. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionItemLabelDetails
  213. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionItemTag
  214. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionItemTagOptions
  215. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionList
  216. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionListCapabilities
  217. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionOptions
  218. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionParams
  219. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionRegistrationOptions
  220. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CompletionTriggerKind
  221. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ConfigurationItem
  222. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export ConfigurationParams
  223. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CreateFile
  224. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CreateFileOptions
  225. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export CreateFilesParams
  226. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export Declaration
  227. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeclarationClientCapabilities
  228. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeclarationLink
  229. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeclarationOptions
  230. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeclarationParams
  231. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeclarationRegistrationOptions
  232. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export Definition
  233. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DefinitionClientCapabilities
  234. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DefinitionLink
  235. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DefinitionOptions
  236. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DefinitionParams
  237. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DefinitionRegistrationOptions
  238. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeleteFile
  239. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeleteFileOptions
  240. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DeleteFilesParams
  241. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticClientCapabilities
  242. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticOptions
  243. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticRegistrationOptions
  244. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticRelatedInformation
  245. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticServerCancellationData
  246. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DiagnosticWorkspaceClientCapabilities
  247. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeConfigurationClientCapabilities
  248. 1075.01 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeConfigurationParams
  249. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeConfigurationRegistrationOptions
  250. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeNotebookDocumentParams
  251. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeTextDocumentParams
  252. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeWatchedFilesClientCapabilities
  253. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeWatchedFilesParams
  254. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeWatchedFilesRegistrationOptions
  255. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidChangeWorkspaceFoldersParams
  256. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidCloseNotebookDocumentParams
  257. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidCloseTextDocumentParams
  258. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidOpenNotebookDocumentParams
  259. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidOpenTextDocumentParams
  260. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidSaveNotebookDocumentParams
  261. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DidSaveTextDocumentParams
  262. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentColorClientCapabilities
  263. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentColorOptions
  264. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentColorParams
  265. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentColorRegistrationOptions
  266. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentDiagnosticParams
  267. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentDiagnosticReport
  268. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentDiagnosticReportKind
  269. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentDiagnosticReportPartialResult
  270. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentFilter
  271. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentFormattingClientCapabilities
  272. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentFormattingOptions
  273. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentFormattingParams
  274. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentFormattingRegistrationOptions
  275. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentHighlight
  276. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentHighlightClientCapabilities
  277. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentHighlightKind
  278. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentHighlightOptions
  279. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentHighlightParams
  280. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentHighlightRegistrationOptions
  281. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentLink
  282. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentLinkClientCapabilities
  283. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentLinkOptions
  284. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentLinkParams
  285. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentLinkRegistrationOptions
  286. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentOnTypeFormattingClientCapabilities
  287. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentOnTypeFormattingOptions
  288. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentOnTypeFormattingParams
  289. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentOnTypeFormattingRegistrationOptions
  290. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentRangeFormattingClientCapabilities
  291. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentRangeFormattingOptions
  292. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentRangeFormattingParams
  293. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentRangeFormattingRegistrationOptions
  294. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentSelector
  295. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentSymbol
  296. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentSymbolClientCapabilities
  297. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentSymbolOptions
  298. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentSymbolParams
  299. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentSymbolRegistrationOptions
  300. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export EditRangeWithInsertReplace
  301. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ErrorCodes
  302. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ExecuteCommandClientCapabilities
  303. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ExecuteCommandOptions
  304. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ExecuteCommandParams
  305. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ExecuteCommandRegistrationOptions
  306. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ExecutionSummary
  307. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FailureHandlingKind
  308. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileChangeType
  309. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileCreate
  310. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileDelete
  311. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileEvent
  312. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileOperationClientCapabilities
  313. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileOperationFilter
  314. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileOperationOptions
  315. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileOperationPattern
  316. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileOperationPatternKind
  317. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileOperationPatternOptions
  318. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileOperationRegistrationOptions
  319. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileRename
  320. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FileSystemWatcher
  321. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FoldingRange
  322. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FoldingRangeClientCapabilities
  323. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FoldingRangeKind
  324. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FoldingRangeOptions
  325. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FoldingRangeParams
  326. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FoldingRangeRegistrationOptions
  327. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FormattingOptions
  328. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export FullDocumentDiagnosticReport
  329. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export GeneralClientCapabilities
  330. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export GlobPattern
  331. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export Hover
  332. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export HoverClientCapabilities
  333. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export HoverOptions
  334. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export HoverParams
  335. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export HoverRegistrationOptions
  336. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ImplementationClientCapabilities
  337. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ImplementationOptions
  338. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ImplementationParams
  339. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export ImplementationRegistrationOptions
  340. 1075.02 s [hls-test-utils] Warning: Couldn't find .haddock for export InitializeError
  341. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InitializeParams
  342. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InitializeResult
  343. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InitializedParams
  344. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHint
  345. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHintClientCapabilities
  346. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHintKind
  347. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHintLabelPart
  348. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHintOptions
  349. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHintParams
  350. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHintRegistrationOptions
  351. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlayHintWorkspaceClientCapabilities
  352. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValue
  353. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueClientCapabilities
  354. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueContext
  355. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueEvaluatableExpression
  356. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueOptions
  357. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueParams
  358. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueRegistrationOptions
  359. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueText
  360. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueVariableLookup
  361. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InlineValueWorkspaceClientCapabilities
  362. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InsertReplaceEdit
  363. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InsertTextFormat
  364. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export InsertTextMode
  365. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LSPErrorCodes
  366. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LanguageKind
  367. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LinkedEditingRangeClientCapabilities
  368. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LinkedEditingRangeOptions
  369. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LinkedEditingRangeParams
  370. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LinkedEditingRangeRegistrationOptions
  371. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LinkedEditingRanges
  372. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LocationLink
  373. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LocationUriOnly
  374. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LogMessageParams
  375. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export LogTraceParams
  376. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MarkdownClientCapabilities
  377. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MarkedString
  378. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MarkedStringWithLanguage
  379. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MarkupContent
  380. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MarkupKind
  381. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MessageActionItem
  382. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MessageType
  383. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export Moniker
  384. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MonikerClientCapabilities
  385. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MonikerKind
  386. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MonikerOptions
  387. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MonikerParams
  388. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export MonikerRegistrationOptions
  389. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookCell
  390. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookCellArrayChange
  391. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookCellKind
  392. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookCellLanguage
  393. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookCellTextDocumentFilter
  394. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocument
  395. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentCellChangeStructure
  396. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentCellChanges
  397. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentCellContentChanges
  398. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentChangeEvent
  399. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentClientCapabilities
  400. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentFilter
  401. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentFilterNotebookType
  402. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentFilterPattern
  403. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentFilterScheme
  404. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentFilterWithCells
  405. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentFilterWithNotebook
  406. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentIdentifier
  407. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentSyncClientCapabilities
  408. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentSyncOptions
  409. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export NotebookDocumentSyncRegistrationOptions
  410. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export OptionalVersionedTextDocumentIdentifier
  411. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ParameterInformation
  412. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PartialResultParams
  413. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PositionEncodingKind
  414. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PrepareRenameDefaultBehavior
  415. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PrepareRenameParams
  416. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PrepareRenamePlaceholder
  417. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PrepareRenameResult
  418. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PrepareSupportDefaultBehavior
  419. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PreviousResultId
  420. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ProgressParams
  421. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ProgressToken
  422. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PublishDiagnosticsClientCapabilities
  423. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export PublishDiagnosticsParams
  424. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ReferenceClientCapabilities
  425. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ReferenceContext
  426. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ReferenceOptions
  427. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ReferenceParams
  428. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ReferenceRegistrationOptions
  429. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export Registration
  430. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RegistrationParams
  431. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RegularExpressionEngineKind
  432. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RegularExpressionsClientCapabilities
  433. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RelatedFullDocumentDiagnosticReport
  434. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RelatedUnchangedDocumentDiagnosticReport
  435. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RelativePattern
  436. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RenameClientCapabilities
  437. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RenameFile
  438. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RenameFileOptions
  439. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RenameFilesParams
  440. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RenameOptions
  441. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RenameParams
  442. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export RenameRegistrationOptions
  443. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ResourceOperation
  444. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export ResourceOperationKind
  445. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SaveOptions
  446. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SelectionRange
  447. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SelectionRangeClientCapabilities
  448. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SelectionRangeOptions
  449. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SelectionRangeParams
  450. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SelectionRangeRegistrationOptions
  451. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokenModifiers
  452. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokenTypes
  453. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokens
  454. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensClientCapabilities
  455. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensDelta
  456. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensDeltaParams
  457. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensDeltaPartialResult
  458. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensEdit
  459. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensFullDelta
  460. 1075.03 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensLegend
  461. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensOptions
  462. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensParams
  463. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensPartialResult
  464. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensRangeParams
  465. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensRegistrationOptions
  466. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokensWorkspaceClientCapabilities
  467. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ServerCapabilities
  468. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ServerCompletionItemOptions
  469. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ServerInfo
  470. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SetTraceParams
  471. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ShowDocumentClientCapabilities
  472. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ShowDocumentParams
  473. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ShowDocumentResult
  474. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ShowMessageParams
  475. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ShowMessageRequestClientCapabilities
  476. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export ShowMessageRequestParams
  477. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureHelp
  478. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureHelpClientCapabilities
  479. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureHelpContext
  480. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureHelpOptions
  481. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureHelpParams
  482. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureHelpRegistrationOptions
  483. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureHelpTriggerKind
  484. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SignatureInformation
  485. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export StaleRequestSupportOptions
  486. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export StaticRegistrationOptions
  487. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SymbolInformation
  488. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SymbolKind
  489. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export SymbolTag
  490. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentChangeRegistrationOptions
  491. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentClientCapabilities
  492. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentContentChangeEvent
  493. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentContentChangePartial
  494. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentContentChangeWholeDocument
  495. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentEdit
  496. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentFilter
  497. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentFilterLanguage
  498. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentFilterPattern
  499. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentFilterScheme
  500. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentIdentifier
  501. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentItem
  502. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentPositionParams
  503. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentRegistrationOptions
  504. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentSaveReason
  505. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentSaveRegistrationOptions
  506. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentSyncClientCapabilities
  507. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentSyncKind
  508. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextDocumentSyncOptions
  509. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TextEdit
  510. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TokenFormat
  511. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TraceValue
  512. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeDefinitionClientCapabilities
  513. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeDefinitionOptions
  514. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeDefinitionParams
  515. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeDefinitionRegistrationOptions
  516. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeHierarchyClientCapabilities
  517. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeHierarchyItem
  518. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeHierarchyOptions
  519. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeHierarchyPrepareParams
  520. 1075.04 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeHierarchyRegistrationOptions
  521. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeHierarchySubtypesParams
  522. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export TypeHierarchySupertypesParams
  523. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export UInitializeParams
  524. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export UnchangedDocumentDiagnosticReport
  525. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export UniquenessLevel
  526. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export Unregistration
  527. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export UnregistrationParams
  528. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export VersionedNotebookDocumentIdentifier
  529. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export VersionedTextDocumentIdentifier
  530. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WatchKind
  531. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WillSaveTextDocumentParams
  532. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WindowClientCapabilities
  533. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkDoneProgressBegin
  534. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkDoneProgressCancelParams
  535. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkDoneProgressCreateParams
  536. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkDoneProgressEnd
  537. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkDoneProgressOptions
  538. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkDoneProgressParams
  539. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkDoneProgressReport
  540. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceClientCapabilities
  541. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceDiagnosticParams
  542. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceDiagnosticReport
  543. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceDiagnosticReportPartialResult
  544. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceDocumentDiagnosticReport
  545. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceEditClientCapabilities
  546. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceFolder
  547. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceFoldersChangeEvent
  548. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceFoldersInitializeParams
  549. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceFoldersServerCapabilities
  550. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceFullDocumentDiagnosticReport
  551. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceOptions
  552. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceSymbol
  553. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceSymbolClientCapabilities
  554. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceSymbolOptions
  555. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceSymbolParams
  556. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceSymbolRegistrationOptions
  557. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export WorkspaceUnchangedDocumentDiagnosticReport
  558. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export |?
  559. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export DocumentChange
  560. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export AsLspEnum
  561. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export LspEnum
  562. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export EnumBaseType
  563. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export LspOpenEnum
  564. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export Edit
  565. 1075.05 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokenAbsolute
  566. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export SemanticTokenRelative
  567. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export AString
  568. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export AnInteger
  569. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export fromNormalizedFilePath
  570. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export fromNormalizedUri
  571. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export toNormalizedUri
  572. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export positionInRange
  573. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export toNormalizedFilePath
  574. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export codeActionKindSubsumes
  575. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export .:!?
  576. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export .=?
  577. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export _L
  578. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export _R
  579. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export absorbNull
  580. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export maybeToNull
  581. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export nullToMaybe
  582. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export toEither
  583. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export _versionedTextDocumentIdentifier
  584. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export applyTextEdit
  585. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export editTextEdit
  586. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export isSubrangeOf
  587. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export mkRange
  588. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export mkMarkdown
  589. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export mkMarkdownCodeBlock
  590. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export mkPlainText
  591. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export plainTextToMarkdown
  592. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export sectionSeparator
  593. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export _workDoneProgressBegin
  594. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export _workDoneProgressEnd
  595. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export _workDoneProgressReport
  596. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export absolutizeTokens
  597. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export computeEdits
  598. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export defaultSemanticTokensLegend
  599. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export encodeTokens
  600. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export makeSemanticTokens
  601. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export makeSemanticTokensDelta
  602. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export relativizeTokens
  603. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export emptyNormalizedFilePath
  604. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export filePathToUri
  605. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export normalizedFilePathToUri
  606. 1075.06 s [hls-test-utils] Warning: Couldn't find .haddock for export platformAwareFilePathToUri
  607. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export platformAwareUriToFilePath
  608. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export uriToFilePath
  609. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export uriToNormalizedFilePath
  610. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export normalizedFilePathToOsPath
  611. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export osPathToNormalizedFilePath
  612. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export combineWatchKinds
  613. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export containsChange
  614. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export containsCreate
  615. 1075.07 s [hls-test-utils] Warning: Couldn't find .haddock for export containsDelete
  616. 1075.07 s [hls-test-utils] Warning: Test.Hls: Could not find documentation for exported module: Language.LSP.Protocol.Message
  617. 1075.07 s [hls-test-utils] Warning: Test.Hls: Could not find documentation for exported module: Language.LSP.Protocol.Message
  618. 1075.08 s [hls-test-utils] 8% ( 45 /556) in 'Test.Hls'
  619. 1075.08 s [hls-test-utils] Missing documentation for:
  620. 1075.08 s [hls-test-utils] Module header
  621. 1075.08 s [hls-test-utils] NoTimeout
  622. 1075.08 s [hls-test-utils] Pattern
  623. 1075.08 s [hls-test-utils] UInt
  624. 1075.08 s [hls-test-utils] Color
  625. 1075.08 s [hls-test-utils] Location
  626. 1075.08 s [hls-test-utils] Position
  627. 1075.08 s [hls-test-utils] EncodingException
  628. 1075.08 s [hls-test-utils] Diagnostic
  629. 1075.08 s [hls-test-utils] Range
  630. 1075.08 s [hls-test-utils] NormalizedUri
  631. 1075.08 s [hls-test-utils] DiagnosticSeverity
  632. 1075.08 s [hls-test-utils] NormalizedFilePath
  633. 1075.08 s [hls-test-utils] Uri
  634. 1075.09 s [hls-test-utils] Command
  635. 1075.09 s [hls-test-utils] WorkspaceEdit
  636. 1075.09 s [hls-test-utils] CodeActionKind
  637. 1075.09 s [hls-test-utils] DiagnosticTag
  638. 1075.09 s [hls-test-utils] AnnotatedTextEdit
  639. 1075.09 s [hls-test-utils] ApplyWorkspaceEditParams
  640. 1075.09 s [hls-test-utils] ApplyWorkspaceEditResult
  641. 1075.09 s [hls-test-utils] BaseSymbolInformation
  642. 1075.09 s [hls-test-utils] CallHierarchyClientCapabilities
  643. 1075.09 s [hls-test-utils] CallHierarchyIncomingCall
  644. 1075.09 s [hls-test-utils] CallHierarchyIncomingCallsParams
  645. 1075.09 s [hls-test-utils] CallHierarchyItem
  646. 1075.09 s [hls-test-utils] CallHierarchyOptions
  647. 1075.09 s [hls-test-utils] CallHierarchyOutgoingCall
  648. 1075.09 s [hls-test-utils] CallHierarchyOutgoingCallsParams
  649. 1075.09 s [hls-test-utils] CallHierarchyPrepareParams
  650. 1075.09 s [hls-test-utils] CallHierarchyRegistrationOptions
  651. 1075.09 s [hls-test-utils] CancelParams
  652. 1075.09 s [hls-test-utils] ChangeAnnotation
  653. 1075.09 s [hls-test-utils] ChangeAnnotationIdentifier
  654. 1075.09 s [hls-test-utils] ChangeAnnotationsSupportOptions
  655. 1075.09 s [hls-test-utils] ClientCapabilities
  656. 1075.09 s [hls-test-utils] ClientCodeActionKindOptions
  657. 1075.09 s [hls-test-utils] ClientCodeActionLiteralOptions
  658. 1075.09 s [hls-test-utils] ClientCodeActionResolveOptions
  659. 1075.09 s [hls-test-utils] ClientCompletionItemInsertTextModeOptions
  660. 1075.09 s [hls-test-utils] ClientCompletionItemOptions
  661. 1075.09 s [hls-test-utils] ClientCompletionItemOptionsKind
  662. 1075.09 s [hls-test-utils] ClientCompletionItemResolveOptions
  663. 1075.09 s [hls-test-utils] ClientDiagnosticsTagOptions
  664. 1075.09 s [hls-test-utils] ClientFoldingRangeKindOptions
  665. 1075.09 s [hls-test-utils] ClientFoldingRangeOptions
  666. 1075.09 s [hls-test-utils] ClientInfo
  667. 1075.09 s [hls-test-utils] ClientInlayHintResolveOptions
  668. 1075.09 s [hls-test-utils] ClientSemanticTokensRequestFullDelta
  669. 1075.09 s [hls-test-utils] ClientSemanticTokensRequestOptions
  670. 1075.09 s [hls-test-utils] ClientShowMessageActionItemOptions
  671. 1075.09 s [hls-test-utils] ClientSignatureInformationOptions
  672. 1075.09 s [hls-test-utils] ClientSignatureParameterInformationOptions
  673. 1075.09 s [hls-test-utils] ClientSymbolKindOptions
  674. 1075.09 s [hls-test-utils] ClientSymbolResolveOptions
  675. 1075.09 s [hls-test-utils] ClientSymbolTagOptions
  676. 1075.09 s [hls-test-utils] CodeAction
  677. 1075.09 s [hls-test-utils] CodeActionClientCapabilities
  678. 1075.09 s [hls-test-utils] CodeActionContext
  679. 1075.09 s [hls-test-utils] CodeActionDisabled
  680. 1075.09 s [hls-test-utils] CodeActionOptions
  681. 1075.09 s [hls-test-utils] CodeActionParams
  682. 1075.09 s [hls-test-utils] CodeActionRegistrationOptions
  683. 1075.09 s [hls-test-utils] CodeActionTriggerKind
  684. 1075.09 s [hls-test-utils] CodeDescription
  685. 1075.09 s [hls-test-utils] CodeLens
  686. 1075.09 s [hls-test-utils] CodeLensClientCapabilities
  687. 1075.09 s [hls-test-utils] CodeLensOptions
  688. 1075.09 s [hls-test-utils] CodeLensParams
  689. 1075.09 s [hls-test-utils] CodeLensRegistrationOptions
  690. 1075.09 s [hls-test-utils] CodeLensWorkspaceClientCapabilities
  691. 1075.09 s [hls-test-utils] ColorInformation
  692. 1075.09 s [hls-test-utils] ColorPresentation
  693. 1075.09 s [hls-test-utils] ColorPresentationParams
  694. 1075.09 s [hls-test-utils] CompletionClientCapabilities
  695. 1075.09 s [hls-test-utils] CompletionContext
  696. 1075.09 s [hls-test-utils] CompletionItem
  697. 1075.09 s [hls-test-utils] CompletionItemDefaults
  698. 1075.09 s [hls-test-utils] CompletionItemKind
  699. 1075.09 s [hls-test-utils] CompletionItemLabelDetails
  700. 1075.09 s [hls-test-utils] CompletionItemTag
  701. 1075.09 s [hls-test-utils] CompletionItemTagOptions
  702. 1075.09 s [hls-test-utils] CompletionList
  703. 1075.09 s [hls-test-utils] CompletionListCapabilities
  704. 1075.09 s [hls-test-utils] CompletionOptions
  705. 1075.09 s [hls-test-utils] CompletionParams
  706. 1075.09 s [hls-test-utils] CompletionRegistrationOptions
  707. 1075.09 s [hls-test-utils] CompletionTriggerKind
  708. 1075.09 s [hls-test-utils] ConfigurationItem
  709. 1075.09 s [hls-test-utils] ConfigurationParams
  710. 1075.09 s [hls-test-utils] CreateFile
  711. 1075.09 s [hls-test-utils] CreateFileOptions
  712. 1075.09 s [hls-test-utils] CreateFilesParams
  713. 1075.09 s [hls-test-utils] Declaration
  714. 1075.09 s [hls-test-utils] DeclarationClientCapabilities
  715. 1075.09 s [hls-test-utils] DeclarationLink
  716. 1075.09 s [hls-test-utils] DeclarationOptions
  717. 1075.09 s [hls-test-utils] DeclarationParams
  718. 1075.09 s [hls-test-utils] DeclarationRegistrationOptions
  719. 1075.09 s [hls-test-utils] Definition
  720. 1075.09 s [hls-test-utils] DefinitionClientCapabilities
  721. 1075.09 s [hls-test-utils] DefinitionLink
  722. 1075.09 s [hls-test-utils] DefinitionOptions
  723. 1075.09 s [hls-test-utils] DefinitionParams
  724. 1075.09 s [hls-test-utils] DefinitionRegistrationOptions
  725. 1075.09 s [hls-test-utils] DeleteFile
  726. 1075.09 s [hls-test-utils] DeleteFileOptions
  727. 1075.09 s [hls-test-utils] DeleteFilesParams
  728. 1075.09 s [hls-test-utils] DiagnosticClientCapabilities
  729. 1075.09 s [hls-test-utils] DiagnosticOptions
  730. 1075.09 s [hls-test-utils] DiagnosticRegistrationOptions
  731. 1075.09 s [hls-test-utils] DiagnosticRelatedInformation
  732. 1075.09 s [hls-test-utils] DiagnosticServerCancellationData
  733. 1075.09 s [hls-test-utils] DiagnosticWorkspaceClientCapabilities
  734. 1075.09 s [hls-test-utils] DidChangeConfigurationClientCapabilities
  735. 1075.10 s [hls-test-utils] DidChangeConfigurationParams
  736. 1075.10 s [hls-test-utils] DidChangeConfigurationRegistrationOptions
  737. 1075.10 s [hls-test-utils] DidChangeNotebookDocumentParams
  738. 1075.10 s [hls-test-utils] DidChangeTextDocumentParams
  739. 1075.10 s [hls-test-utils] DidChangeWatchedFilesClientCapabilities
  740. 1075.10 s [hls-test-utils] DidChangeWatchedFilesParams
  741. 1075.10 s [hls-test-utils] DidChangeWatchedFilesRegistrationOptions
  742. 1075.10 s [hls-test-utils] DidChangeWorkspaceFoldersParams
  743. 1075.10 s [hls-test-utils] DidCloseNotebookDocumentParams
  744. 1075.10 s [hls-test-utils] DidCloseTextDocumentParams
  745. 1075.10 s [hls-test-utils] DidOpenNotebookDocumentParams
  746. 1075.10 s [hls-test-utils] DidOpenTextDocumentParams
  747. 1075.10 s [hls-test-utils] DidSaveNotebookDocumentParams
  748. 1075.10 s [hls-test-utils] DidSaveTextDocumentParams
  749. 1075.10 s [hls-test-utils] DocumentColorClientCapabilities
  750. 1075.10 s [hls-test-utils] DocumentColorOptions
  751. 1075.10 s [hls-test-utils] DocumentColorParams
  752. 1075.10 s [hls-test-utils] DocumentColorRegistrationOptions
  753. 1075.10 s [hls-test-utils] DocumentDiagnosticParams
  754. 1075.10 s [hls-test-utils] DocumentDiagnosticReport
  755. 1075.10 s [hls-test-utils] DocumentDiagnosticReportKind
  756. 1075.10 s [hls-test-utils] DocumentDiagnosticReportPartialResult
  757. 1075.10 s [hls-test-utils] DocumentFilter
  758. 1075.10 s [hls-test-utils] DocumentFormattingClientCapabilities
  759. 1075.10 s [hls-test-utils] DocumentFormattingOptions
  760. 1075.10 s [hls-test-utils] DocumentFormattingParams
  761. 1075.10 s [hls-test-utils] DocumentFormattingRegistrationOptions
  762. 1075.10 s [hls-test-utils] DocumentHighlight
  763. 1075.10 s [hls-test-utils] DocumentHighlightClientCapabilities
  764. 1075.10 s [hls-test-utils] DocumentHighlightKind
  765. 1075.10 s [hls-test-utils] DocumentHighlightOptions
  766. 1075.10 s [hls-test-utils] DocumentHighlightParams
  767. 1075.10 s [hls-test-utils] DocumentHighlightRegistrationOptions
  768. 1075.10 s [hls-test-utils] DocumentLink
  769. 1075.10 s [hls-test-utils] DocumentLinkClientCapabilities
  770. 1075.10 s [hls-test-utils] DocumentLinkOptions
  771. 1075.10 s [hls-test-utils] DocumentLinkParams
  772. 1075.10 s [hls-test-utils] DocumentLinkRegistrationOptions
  773. 1075.10 s [hls-test-utils] DocumentOnTypeFormattingClientCapabilities
  774. 1075.10 s [hls-test-utils] DocumentOnTypeFormattingOptions
  775. 1075.10 s [hls-test-utils] DocumentOnTypeFormattingParams
  776. 1075.10 s [hls-test-utils] DocumentOnTypeFormattingRegistrationOptions
  777. 1075.10 s [hls-test-utils] DocumentRangeFormattingClientCapabilities
  778. 1075.10 s [hls-test-utils] DocumentRangeFormattingOptions
  779. 1075.10 s [hls-test-utils] DocumentRangeFormattingParams
  780. 1075.10 s [hls-test-utils] DocumentRangeFormattingRegistrationOptions
  781. 1075.10 s [hls-test-utils] DocumentSelector
  782. 1075.10 s [hls-test-utils] DocumentSymbol
  783. 1075.10 s [hls-test-utils] DocumentSymbolClientCapabilities
  784. 1075.10 s [hls-test-utils] DocumentSymbolOptions
  785. 1075.10 s [hls-test-utils] DocumentSymbolParams
  786. 1075.10 s [hls-test-utils] DocumentSymbolRegistrationOptions
  787. 1075.10 s [hls-test-utils] EditRangeWithInsertReplace
  788. 1075.10 s [hls-test-utils] ErrorCodes
  789. 1075.10 s [hls-test-utils] ExecuteCommandClientCapabilities
  790. 1075.10 s [hls-test-utils] ExecuteCommandOptions
  791. 1075.10 s [hls-test-utils] ExecuteCommandParams
  792. 1075.10 s [hls-test-utils] ExecuteCommandRegistrationOptions
  793. 1075.10 s [hls-test-utils] ExecutionSummary
  794. 1075.10 s [hls-test-utils] FailureHandlingKind
  795. 1075.10 s [hls-test-utils] FileChangeType
  796. 1075.10 s [hls-test-utils] FileCreate
  797. 1075.10 s [hls-test-utils] FileDelete
  798. 1075.10 s [hls-test-utils] FileEvent
  799. 1075.10 s [hls-test-utils] FileOperationClientCapabilities
  800. 1075.10 s [hls-test-utils] FileOperationFilter
  801. 1075.10 s [hls-test-utils] FileOperationOptions
  802. 1075.10 s [hls-test-utils] FileOperationPattern
  803. 1075.10 s [hls-test-utils] FileOperationPatternKind
  804. 1075.10 s [hls-test-utils] FileOperationPatternOptions
  805. 1075.10 s [hls-test-utils] FileOperationRegistrationOptions
  806. 1075.10 s [hls-test-utils] FileRename
  807. 1075.10 s [hls-test-utils] FileSystemWatcher
  808. 1075.10 s [hls-test-utils] FoldingRange
  809. 1075.10 s [hls-test-utils] FoldingRangeClientCapabilities
  810. 1075.10 s [hls-test-utils] FoldingRangeKind
  811. 1075.10 s [hls-test-utils] FoldingRangeOptions
  812. 1075.10 s [hls-test-utils] FoldingRangeParams
  813. 1075.10 s [hls-test-utils] FoldingRangeRegistrationOptions
  814. 1075.10 s [hls-test-utils] FormattingOptions
  815. 1075.10 s [hls-test-utils] FullDocumentDiagnosticReport
  816. 1075.10 s [hls-test-utils] GeneralClientCapabilities
  817. 1075.10 s [hls-test-utils] GlobPattern
  818. 1075.10 s [hls-test-utils] Hover
  819. 1075.10 s [hls-test-utils] HoverClientCapabilities
  820. 1075.10 s [hls-test-utils] HoverOptions
  821. 1075.10 s [hls-test-utils] HoverParams
  822. 1075.10 s [hls-test-utils] HoverRegistrationOptions
  823. 1075.10 s [hls-test-utils] ImplementationClientCapabilities
  824. 1075.10 s [hls-test-utils] ImplementationOptions
  825. 1075.10 s [hls-test-utils] ImplementationParams
  826. 1075.10 s [hls-test-utils] ImplementationRegistrationOptions
  827. 1075.10 s [hls-test-utils] InitializeError
  828. 1075.10 s [hls-test-utils] InitializeParams
  829. 1075.10 s [hls-test-utils] InitializeResult
  830. 1075.10 s [hls-test-utils] InitializedParams
  831. 1075.10 s [hls-test-utils] InlayHint
  832. 1075.10 s [hls-test-utils] InlayHintClientCapabilities
  833. 1075.10 s [hls-test-utils] InlayHintKind
  834. 1075.10 s [hls-test-utils] InlayHintLabelPart
  835. 1075.10 s [hls-test-utils] InlayHintOptions
  836. 1075.10 s [hls-test-utils] InlayHintParams
  837. 1075.10 s [hls-test-utils] InlayHintRegistrationOptions
  838. 1075.10 s [hls-test-utils] InlayHintWorkspaceClientCapabilities
  839. 1075.10 s [hls-test-utils] InlineValue
  840. 1075.10 s [hls-test-utils] InlineValueClientCapabilities
  841. 1075.10 s [hls-test-utils] InlineValueContext
  842. 1075.10 s [hls-test-utils] InlineValueEvaluatableExpression
  843. 1075.10 s [hls-test-utils] InlineValueOptions
  844. 1075.10 s [hls-test-utils] InlineValueParams
  845. 1075.10 s [hls-test-utils] InlineValueRegistrationOptions
  846. 1075.10 s [hls-test-utils] InlineValueText
  847. 1075.10 s [hls-test-utils] InlineValueVariableLookup
  848. 1075.10 s [hls-test-utils] InlineValueWorkspaceClientCapabilities
  849. 1075.10 s [hls-test-utils] InsertReplaceEdit
  850. 1075.10 s [hls-test-utils] InsertTextFormat
  851. 1075.10 s [hls-test-utils] InsertTextMode
  852. 1075.10 s [hls-test-utils] LSPErrorCodes
  853. 1075.10 s [hls-test-utils] LanguageKind
  854. 1075.10 s [hls-test-utils] LinkedEditingRangeClientCapabilities
  855. 1075.10 s [hls-test-utils] LinkedEditingRangeOptions
  856. 1075.10 s [hls-test-utils] LinkedEditingRangeParams
  857. 1075.10 s [hls-test-utils] LinkedEditingRangeRegistrationOptions
  858. 1075.10 s [hls-test-utils] LinkedEditingRanges
  859. 1075.10 s [hls-test-utils] LocationLink
  860. 1075.10 s [hls-test-utils] LocationUriOnly
  861. 1075.10 s [hls-test-utils] LogMessageParams
  862. 1075.10 s [hls-test-utils] LogTraceParams
  863. 1075.10 s [hls-test-utils] MarkdownClientCapabilities
  864. 1075.10 s [hls-test-utils] MarkedString
  865. 1075.10 s [hls-test-utils] MarkedStringWithLanguage
  866. 1075.10 s [hls-test-utils] MarkupContent
  867. 1075.10 s [hls-test-utils] MarkupKind
  868. 1075.10 s [hls-test-utils] MessageActionItem
  869. 1075.10 s [hls-test-utils] MessageType
  870. 1075.10 s [hls-test-utils] Moniker
  871. 1075.10 s [hls-test-utils] MonikerClientCapabilities
  872. 1075.10 s [hls-test-utils] MonikerKind
  873. 1075.10 s [hls-test-utils] MonikerOptions
  874. 1075.10 s [hls-test-utils] MonikerParams
  875. 1075.10 s [hls-test-utils] MonikerRegistrationOptions
  876. 1075.10 s [hls-test-utils] NotebookCell
  877. 1075.10 s [hls-test-utils] NotebookCellArrayChange
  878. 1075.10 s [hls-test-utils] NotebookCellKind
  879. 1075.10 s [hls-test-utils] NotebookCellLanguage
  880. 1075.10 s [hls-test-utils] NotebookCellTextDocumentFilter
  881. 1075.11 s [hls-test-utils] NotebookDocument
  882. 1075.11 s [hls-test-utils] NotebookDocumentCellChangeStructure
  883. 1075.11 s [hls-test-utils] NotebookDocumentCellChanges
  884. 1075.11 s [hls-test-utils] NotebookDocumentCellContentChanges
  885. 1075.11 s [hls-test-utils] NotebookDocumentChangeEvent
  886. 1075.11 s [hls-test-utils] NotebookDocumentClientCapabilities
  887. 1075.11 s [hls-test-utils] NotebookDocumentFilter
  888. 1075.11 s [hls-test-utils] NotebookDocumentFilterNotebookType
  889. 1075.11 s [hls-test-utils] NotebookDocumentFilterPattern
  890. 1075.11 s [hls-test-utils] NotebookDocumentFilterScheme
  891. 1075.11 s [hls-test-utils] NotebookDocumentFilterWithCells
  892. 1075.11 s [hls-test-utils] NotebookDocumentFilterWithNotebook
  893. 1075.11 s [hls-test-utils] NotebookDocumentIdentifier
  894. 1075.11 s [hls-test-utils] NotebookDocumentSyncClientCapabilities
  895. 1075.11 s [hls-test-utils] NotebookDocumentSyncOptions
  896. 1075.11 s [hls-test-utils] NotebookDocumentSyncRegistrationOptions
  897. 1075.11 s [hls-test-utils] OptionalVersionedTextDocumentIdentifier
  898. 1075.11 s [hls-test-utils] ParameterInformation
  899. 1075.11 s [hls-test-utils] PartialResultParams
  900. 1075.11 s [hls-test-utils] PositionEncodingKind
  901. 1075.11 s [hls-test-utils] PrepareRenameDefaultBehavior
  902. 1075.11 s [hls-test-utils] PrepareRenameParams
  903. 1075.11 s [hls-test-utils] PrepareRenamePlaceholder
  904. 1075.11 s [hls-test-utils] PrepareRenameResult
  905. 1075.11 s [hls-test-utils] PrepareSupportDefaultBehavior
  906. 1075.11 s [hls-test-utils] PreviousResultId
  907. 1075.11 s [hls-test-utils] ProgressParams
  908. 1075.11 s [hls-test-utils] ProgressToken
  909. 1075.11 s [hls-test-utils] PublishDiagnosticsClientCapabilities
  910. 1075.11 s [hls-test-utils] PublishDiagnosticsParams
  911. 1075.11 s [hls-test-utils] ReferenceClientCapabilities
  912. 1075.11 s [hls-test-utils] ReferenceContext
  913. 1075.11 s [hls-test-utils] ReferenceOptions
  914. 1075.11 s [hls-test-utils] ReferenceParams
  915. 1075.11 s [hls-test-utils] ReferenceRegistrationOptions
  916. 1075.11 s [hls-test-utils] Registration
  917. 1075.11 s [hls-test-utils] RegistrationParams
  918. 1075.11 s [hls-test-utils] RegularExpressionEngineKind
  919. 1075.11 s [hls-test-utils] RegularExpressionsClientCapabilities
  920. 1075.11 s [hls-test-utils] RelatedFullDocumentDiagnosticReport
  921. 1075.11 s [hls-test-utils] RelatedUnchangedDocumentDiagnosticReport
  922. 1075.11 s [hls-test-utils] RelativePattern
  923. 1075.11 s [hls-test-utils] RenameClientCapabilities
  924. 1075.11 s [hls-test-utils] RenameFile
  925. 1075.11 s [hls-test-utils] RenameFileOptions
  926. 1075.11 s [hls-test-utils] RenameFilesParams
  927. 1075.11 s [hls-test-utils] RenameOptions
  928. 1075.11 s [hls-test-utils] RenameParams
  929. 1075.11 s [hls-test-utils] RenameRegistrationOptions
  930. 1075.11 s [hls-test-utils] ResourceOperation
  931. 1075.11 s [hls-test-utils] ResourceOperationKind
  932. 1075.11 s [hls-test-utils] SaveOptions
  933. 1075.11 s [hls-test-utils] SelectionRange
  934. 1075.11 s [hls-test-utils] SelectionRangeClientCapabilities
  935. 1075.11 s [hls-test-utils] SelectionRangeOptions
  936. 1075.11 s [hls-test-utils] SelectionRangeParams
  937. 1075.11 s [hls-test-utils] SelectionRangeRegistrationOptions
  938. 1075.11 s [hls-test-utils] SemanticTokenModifiers
  939. 1075.11 s [hls-test-utils] SemanticTokenTypes
  940. 1075.11 s [hls-test-utils] SemanticTokens
  941. 1075.11 s [hls-test-utils] SemanticTokensClientCapabilities
  942. 1075.11 s [hls-test-utils] SemanticTokensDelta
  943. 1075.11 s [hls-test-utils] SemanticTokensDeltaParams
  944. 1075.11 s [hls-test-utils] SemanticTokensDeltaPartialResult
  945. 1075.11 s [hls-test-utils] SemanticTokensEdit
  946. 1075.11 s [hls-test-utils] SemanticTokensFullDelta
  947. 1075.11 s [hls-test-utils] SemanticTokensLegend
  948. 1075.11 s [hls-test-utils] SemanticTokensOptions
  949. 1075.11 s [hls-test-utils] SemanticTokensParams
  950. 1075.11 s [hls-test-utils] SemanticTokensPartialResult
  951. 1075.11 s [hls-test-utils] SemanticTokensRangeParams
  952. 1075.11 s [hls-test-utils] SemanticTokensRegistrationOptions
  953. 1075.11 s [hls-test-utils] SemanticTokensWorkspaceClientCapabilities
  954. 1075.11 s [hls-test-utils] ServerCapabilities
  955. 1075.11 s [hls-test-utils] ServerCompletionItemOptions
  956. 1075.11 s [hls-test-utils] ServerInfo
  957. 1075.11 s [hls-test-utils] SetTraceParams
  958. 1075.11 s [hls-test-utils] ShowDocumentClientCapabilities
  959. 1075.11 s [hls-test-utils] ShowDocumentParams
  960. 1075.11 s [hls-test-utils] ShowDocumentResult
  961. 1075.11 s [hls-test-utils] ShowMessageParams
  962. 1075.11 s [hls-test-utils] ShowMessageRequestClientCapabilities
  963. 1075.11 s [hls-test-utils] ShowMessageRequestParams
  964. 1075.11 s [hls-test-utils] SignatureHelp
  965. 1075.11 s [hls-test-utils] SignatureHelpClientCapabilities
  966. 1075.11 s [hls-test-utils] SignatureHelpContext
  967. 1075.11 s [hls-test-utils] SignatureHelpOptions
  968. 1075.11 s [hls-test-utils] SignatureHelpParams
  969. 1075.11 s [hls-test-utils] SignatureHelpRegistrationOptions
  970. 1075.11 s [hls-test-utils] SignatureHelpTriggerKind
  971. 1075.11 s [hls-test-utils] SignatureInformation
  972. 1075.11 s [hls-test-utils] StaleRequestSupportOptions
  973. 1075.11 s [hls-test-utils] StaticRegistrationOptions
  974. 1075.11 s [hls-test-utils] SymbolInformation
  975. 1075.11 s [hls-test-utils] SymbolKind
  976. 1075.11 s [hls-test-utils] SymbolTag
  977. 1075.11 s [hls-test-utils] TextDocumentChangeRegistrationOptions
  978. 1075.11 s [hls-test-utils] TextDocumentClientCapabilities
  979. 1075.11 s [hls-test-utils] TextDocumentContentChangeEvent
  980. 1075.11 s [hls-test-utils] TextDocumentContentChangePartial
  981. 1075.11 s [hls-test-utils] TextDocumentContentChangeWholeDocument
  982. 1075.11 s [hls-test-utils] TextDocumentEdit
  983. 1075.11 s [hls-test-utils] TextDocumentFilter
  984. 1075.11 s [hls-test-utils] TextDocumentFilterLanguage
  985. 1075.11 s [hls-test-utils] TextDocumentFilterPattern
  986. 1075.11 s [hls-test-utils] TextDocumentFilterScheme
  987. 1075.11 s [hls-test-utils] TextDocumentIdentifier
  988. 1075.11 s [hls-test-utils] TextDocumentItem
  989. 1075.11 s [hls-test-utils] TextDocumentPositionParams
  990. 1075.11 s [hls-test-utils] TextDocumentRegistrationOptions
  991. 1075.11 s [hls-test-utils] TextDocumentSaveReason
  992. 1075.11 s [hls-test-utils] TextDocumentSaveRegistrationOptions
  993. 1075.11 s [hls-test-utils] TextDocumentSyncClientCapabilities
  994. 1075.11 s [hls-test-utils] TextDocumentSyncKind
  995. 1075.11 s [hls-test-utils] TextDocumentSyncOptions
  996. 1075.11 s [hls-test-utils] TextEdit
  997. 1075.11 s [hls-test-utils] TokenFormat
  998. 1075.11 s [hls-test-utils] TraceValue
  999. 1075.11 s [hls-test-utils] TypeDefinitionClientCapabilities
  1000. 1075.11 s [hls-test-utils] TypeDefinitionOptions
  1001. 1075.11 s [hls-test-utils] TypeDefinitionParams
  1002. 1075.11 s [hls-test-utils] TypeDefinitionRegistrationOptions
  1003. 1075.11 s [hls-test-utils] TypeHierarchyClientCapabilities
  1004. 1075.11 s [hls-test-utils] TypeHierarchyItem
  1005. 1075.11 s [hls-test-utils] TypeHierarchyOptions
  1006. 1075.11 s [hls-test-utils] TypeHierarchyPrepareParams
  1007. 1075.11 s [hls-test-utils] TypeHierarchyRegistrationOptions
  1008. 1075.11 s [hls-test-utils] TypeHierarchySubtypesParams
  1009. 1075.11 s [hls-test-utils] TypeHierarchySupertypesParams
  1010. 1075.11 s [hls-test-utils] UInitializeParams
  1011. 1075.11 s [hls-test-utils] UnchangedDocumentDiagnosticReport
  1012. 1075.11 s [hls-test-utils] UniquenessLevel
  1013. 1075.11 s [hls-test-utils] Unregistration
  1014. 1075.11 s [hls-test-utils] UnregistrationParams
  1015. 1075.11 s [hls-test-utils] VersionedNotebookDocumentIdentifier
  1016. 1075.11 s [hls-test-utils] VersionedTextDocumentIdentifier
  1017. 1075.11 s [hls-test-utils] WatchKind
  1018. 1075.11 s [hls-test-utils] WillSaveTextDocumentParams
  1019. 1075.11 s [hls-test-utils] WindowClientCapabilities
  1020. 1075.11 s [hls-test-utils] WorkDoneProgressBegin
  1021. 1075.11 s [hls-test-utils] WorkDoneProgressCancelParams
  1022. 1075.11 s [hls-test-utils] WorkDoneProgressCreateParams
  1023. 1075.11 s [hls-test-utils] WorkDoneProgressEnd
  1024. 1075.11 s [hls-test-utils] WorkDoneProgressOptions
  1025. 1075.11 s [hls-test-utils] WorkDoneProgressParams
  1026. 1075.11 s [hls-test-utils] WorkDoneProgressReport
  1027. 1075.11 s [hls-test-utils] WorkspaceClientCapabilities
  1028. 1075.11 s [hls-test-utils] WorkspaceDiagnosticParams
  1029. 1075.11 s [hls-test-utils] WorkspaceDiagnosticReport
  1030. 1075.11 s [hls-test-utils] WorkspaceDiagnosticReportPartialResult
  1031. 1075.11 s [hls-test-utils] WorkspaceDocumentDiagnosticReport
  1032. 1075.11 s [hls-test-utils] WorkspaceEditClientCapabilities
  1033. 1075.11 s [hls-test-utils] WorkspaceFolder
  1034. 1075.11 s [hls-test-utils] WorkspaceFoldersChangeEvent
  1035. 1075.11 s [hls-test-utils] WorkspaceFoldersInitializeParams
  1036. 1075.11 s [hls-test-utils] WorkspaceFoldersServerCapabilities
  1037. 1075.11 s [hls-test-utils] WorkspaceFullDocumentDiagnosticReport
  1038. 1075.11 s [hls-test-utils] WorkspaceOptions
  1039. 1075.11 s [hls-test-utils] WorkspaceSymbol
  1040. 1075.11 s [hls-test-utils] WorkspaceSymbolClientCapabilities
  1041. 1075.11 s [hls-test-utils] WorkspaceSymbolOptions
  1042. 1075.11 s [hls-test-utils] WorkspaceSymbolParams
  1043. 1075.11 s [hls-test-utils] WorkspaceSymbolRegistrationOptions
  1044. 1075.11 s [hls-test-utils] WorkspaceUnchangedDocumentDiagnosticReport
  1045. 1075.11 s [hls-test-utils] |?
  1046. 1075.11 s [hls-test-utils] DocumentChange
  1047. 1075.11 s [hls-test-utils] AsLspEnum
  1048. 1075.11 s [hls-test-utils] LspEnum
  1049. 1075.11 s [hls-test-utils] EnumBaseType
  1050. 1075.11 s [hls-test-utils] LspOpenEnum
  1051. 1075.11 s [hls-test-utils] Edit
  1052. 1075.11 s [hls-test-utils] SemanticTokenAbsolute
  1053. 1075.11 s [hls-test-utils] SemanticTokenRelative
  1054. 1075.11 s [hls-test-utils] AString
  1055. 1075.11 s [hls-test-utils] AnInteger
  1056. 1075.11 s [hls-test-utils] fromNormalizedFilePath
  1057. 1075.11 s [hls-test-utils] fromNormalizedUri
  1058. 1075.11 s [hls-test-utils] toNormalizedUri
  1059. 1075.11 s [hls-test-utils] positionInRange
  1060. 1075.11 s [hls-test-utils] toNormalizedFilePath
  1061. 1075.11 s [hls-test-utils] codeActionKindSubsumes
  1062. 1075.11 s [hls-test-utils] .:!?
  1063. 1075.11 s [hls-test-utils] .=?
  1064. 1075.11 s [hls-test-utils] _L
  1065. 1075.11 s [hls-test-utils] _R
  1066. 1075.11 s [hls-test-utils] absorbNull
  1067. 1075.11 s [hls-test-utils] maybeToNull
  1068. 1075.11 s [hls-test-utils] nullToMaybe
  1069. 1075.11 s [hls-test-utils] toEither
  1070. 1075.11 s [hls-test-utils] _versionedTextDocumentIdentifier
  1071. 1075.11 s [hls-test-utils] applyTextEdit
  1072. 1075.11 s [hls-test-utils] editTextEdit
  1073. 1075.11 s [hls-test-utils] isSubrangeOf
  1074. 1075.11 s [hls-test-utils] mkRange
  1075. 1075.11 s [hls-test-utils] mkMarkdown
  1076. 1075.11 s [hls-test-utils] mkMarkdownCodeBlock
  1077. 1075.11 s [hls-test-utils] mkPlainText
  1078. 1075.11 s [hls-test-utils] plainTextToMarkdown
  1079. 1075.11 s [hls-test-utils] sectionSeparator
  1080. 1075.11 s [hls-test-utils] _workDoneProgressBegin
  1081. 1075.11 s [hls-test-utils] _workDoneProgressEnd
  1082. 1075.11 s [hls-test-utils] _workDoneProgressReport
  1083. 1075.11 s [hls-test-utils] absolutizeTokens
  1084. 1075.11 s [hls-test-utils] computeEdits
  1085. 1075.11 s [hls-test-utils] defaultSemanticTokensLegend
  1086. 1075.11 s [hls-test-utils] encodeTokens
  1087. 1075.11 s [hls-test-utils] makeSemanticTokens
  1088. 1075.11 s [hls-test-utils] makeSemanticTokensDelta
  1089. 1075.11 s [hls-test-utils] relativizeTokens
  1090. 1075.11 s [hls-test-utils] emptyNormalizedFilePath
  1091. 1075.11 s [hls-test-utils] filePathToUri
  1092. 1075.11 s [hls-test-utils] normalizedFilePathToUri
  1093. 1075.11 s [hls-test-utils] platformAwareFilePathToUri
  1094. 1075.11 s [hls-test-utils] platformAwareUriToFilePath
  1095. 1075.11 s [hls-test-utils] uriToFilePath
  1096. 1075.11 s [hls-test-utils] uriToNormalizedFilePath
  1097. 1075.11 s [hls-test-utils] normalizedFilePathToOsPath
  1098. 1075.11 s [hls-test-utils] osPathToNormalizedFilePath
  1099. 1075.12 s [hls-test-utils] combineWatchKinds
  1100. 1075.12 s [hls-test-utils] containsChange
  1101. 1075.12 s [hls-test-utils] containsCreate
  1102. 1075.12 s [hls-test-utils] containsDelete
  1103. 1075.12 s [hls-test-utils] goldenGitDiff (src/Test/Hls.hs:189)
  1104. 1075.12 s [hls-test-utils] goldenWithHaskellDoc (src/Test/Hls.hs:192)
  1105. 1075.12 s [hls-test-utils] goldenWithHaskellDocInTmpDir (src/Test/Hls.hs:205)
  1106. 1075.12 s [hls-test-utils] goldenWithHaskellAndCaps (src/Test/Hls.hs:218)
  1107. 1075.12 s [hls-test-utils] goldenWithHaskellAndCapsInTmpDir (src/Test/Hls.hs:267)
  1108. 1075.12 s [hls-test-utils] goldenWithCabalDoc (src/Test/Hls.hs:295)
  1109. 1075.12 s [hls-test-utils] goldenWithHaskellDocFormatter (src/Test/Hls.hs:581)
  1110. 1075.12 s [hls-test-utils] goldenWithHaskellDocFormatterInTmpDir (src/Test/Hls.hs:629)
  1111. 1075.12 s [hls-test-utils] goldenWithCabalDocFormatter (src/Test/Hls.hs:605)
  1112. 1075.12 s [hls-test-utils] goldenWithCabalDocFormatterInTmpDir (src/Test/Hls.hs:653)
  1113. 1075.12 s [hls-test-utils] goldenWithTestConfig (src/Test/Hls.hs:247)
  1114. 1075.12 s [hls-test-utils] runSessionWithServer (src/Test/Hls.hs:537)
  1115. 1075.12 s [hls-test-utils] runSessionWithServerInTmpDir (src/Test/Hls.hs:504)
  1116. 1075.12 s [hls-test-utils] PluginDescriptor
  1117. 1075.12 s [hls-test-utils] BrokenBehavior (src/Test/Hls.hs:173)
  1118. 1075.12 s [hls-test-utils] ExpectBroken (src/Test/Hls.hs:175)
  1119. 1075.12 s [hls-test-utils] unCurrent (src/Test/Hls.hs:179)
  1120. 1075.12 s [hls-test-utils] waitForTypecheck (src/Test/Hls.hs:869)
  1121. 1075.12 s [hls-test-utils] waitForAction (src/Test/Hls.hs:865)
  1122. 1075.12 s [hls-test-utils] hlsConfigToClientConfig (src/Test/Hls.hs:875)
  1123. 1075.12 s [hls-test-utils] getLastBuildKeys (src/Test/Hls.hs:872)
  1124. 1075.12 s [hls-test-utils] waitForKickDone (src/Test/Hls.hs:900)
  1125. 1075.12 s [hls-test-utils] waitForKickStart (src/Test/Hls.hs:903)
  1126. 1075.12 s [hls-test-utils] WithPriority
  1127. 1075.12 s [hls-test-utils] Priority
  1128. 1075.12 s [hls-test-utils] captureKickDiagnostics (src/Test/Hls.hs:889)
  1129. 1075.12 s [hls-test-utils] kick (src/Test/Hls.hs:913)
  1130. 1075.12 s [hls-test-utils] TestConfig (src/Test/Hls.hs:692)
  1131. 1075.12 s [vector] [2 of 2] Linking Setup
  1132. 1077.06 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  1133. 1077.07 s [hls-test-utils] Warning: Development.IDE.Test: could not find link destinations for:
  1134. 1077.07 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.TNotificationMessage
  1135. 1077.07 s [hls-test-utils] - Language.LSP.Protocol.Internal.Method.SMethod
  1136. 1077.07 s [hls-test-utils] - Language.LSP.Protocol.Internal.Method.Method_TextDocumentPublishDiagnostics
  1137. 1077.07 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.TServerMessage
  1138. 1077.07 s [vector] Phase: configurePhase
  1139. 1077.08 s [vector] configureFlags: --verbose --prefix=/nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.XnNmgE1EY0/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  1140. 1077.10 s [vector] Using Parsec parser
  1141. 1077.10 s [vector] Configuring vector-0.13.2.0...
  1142. 1077.56 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  1143. 1077.56 s [vector] wall=False
  1144. 1077.56 s [vector] Dependency base: using base-4.18.3.0
  1145. 1077.56 s [vector] Dependency deepseq: using deepseq-1.4.8.1
  1146. 1077.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  1147. 1077.56 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  1148. 1077.56 s [vector] Dependency base: using base-4.18.3.0
  1149. 1077.56 s [vector] Dependency random: using random-1.2.1.3
  1150. 1077.56 s [vector] Dependency tasty: using tasty-1.5.3
  1151. 1077.56 s [vector] Dependency vector: using vector-0.13.2.0
  1152. 1077.56 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1153. 1077.56 s [vector] Dependency base: using base-4.18.3.0
  1154. 1077.56 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1155. 1077.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  1156. 1077.56 s [vector] Dependency random: using random-1.2.1.3
  1157. 1077.56 s [vector] Dependency tasty: using tasty-1.5.3
  1158. 1077.56 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1159. 1077.56 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1160. 1077.56 s [vector] Dependency template-haskell: using template-haskell-2.20.0.0
  1161. 1077.56 s [vector] Dependency transformers: using transformers-0.6.1.0
  1162. 1077.56 s [vector] Dependency vector: using vector-0.13.2.0
  1163. 1077.56 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  1164. 1077.56 s [vector] Dependency base: using base-4.18.3.0
  1165. 1077.56 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  1166. 1077.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  1167. 1077.56 s [vector] Dependency random: using random-1.2.1.3
  1168. 1077.56 s [vector] Dependency tasty: using tasty-1.5.3
  1169. 1077.56 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  1170. 1077.56 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  1171. 1077.56 s [vector] Dependency template-haskell: using template-haskell-2.20.0.0
  1172. 1077.56 s [vector] Dependency transformers: using transformers-0.6.1.0
  1173. 1077.56 s [vector] Dependency vector: using vector-0.13.2.0
  1174. 1077.56 s [vector] Dependency base: using base-4.18.3.0
  1175. 1077.56 s [vector] Dependency doctest: using doctest-0.24.2
  1176. 1077.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  1177. 1077.56 s [vector] Dependency vector: using vector-0.13.2.0
  1178. 1077.56 s [vector] Dependency base: using base-4.18.3.0
  1179. 1077.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  1180. 1077.56 s [vector] Dependency tasty: using tasty-1.5.3
  1181. 1077.56 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  1182. 1077.56 s [vector] Dependency vector: using vector-0.13.2.0
  1183. 1078.11 s [vector] Source component graph:
  1184. 1078.11 s [vector] component lib
  1185. 1078.11 s [vector] component lib:benchmarks-O2 dependency lib
  1186. 1078.11 s [vector] component test:vector-doctest dependency lib
  1187. 1078.11 s [vector] component test:vector-inspection dependency lib
  1188. 1078.11 s [vector] component test:vector-tests-O0 dependency lib
  1189. 1078.11 s [vector] component test:vector-tests-O2 dependency lib
  1190. 1078.11 s [vector] Configured component graph:
  1191. 1078.11 s [vector] component vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1192. 1078.11 s [vector] include base-4.18.3.0
  1193. 1078.11 s [vector] include deepseq-1.4.8.1
  1194. 1078.11 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1195. 1078.11 s [vector] include vector-stream-0.1.0.1-7qX9oQxWHCz9yDWW5CqJnq
  1196. 1078.11 s [vector] component vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  1197. 1078.11 s [vector] include base-4.18.3.0
  1198. 1078.11 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1199. 1078.11 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1200. 1078.11 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1201. 1078.11 s [vector] component vector-0.13.2.0-LrI0dkKApwzC3Hsdwz2nAc-vector-doctest
  1202. 1078.11 s [vector] include base-4.18.3.0
  1203. 1078.11 s [vector] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  1204. 1078.11 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1205. 1078.11 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1206. 1078.11 s [vector] component vector-0.13.2.0-LnTwbj1fD5P548jgjJP8km-vector-inspection
  1207. 1078.11 s [vector] include base-4.18.3.0
  1208. 1078.11 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1209. 1078.11 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1210. 1078.11 s [vector] include tasty-inspection-testing-0.2.1-Az6JDTbWQZ44em03VPnfTo
  1211. 1078.11 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1212. 1078.11 s [vector] component vector-0.13.2.0-CdRaf8rd0cN250Lun0s1xX-vector-tests-O0
  1213. 1078.11 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  1214. 1078.11 s [vector] include base-4.18.3.0
  1215. 1078.11 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  1216. 1078.11 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1217. 1078.11 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1218. 1078.11 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1219. 1078.11 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  1220. 1078.11 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  1221. 1078.11 s [vector] include template-haskell-2.20.0.0
  1222. 1078.11 s [vector] include transformers-0.6.1.0
  1223. 1078.11 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1224. 1078.11 s [vector] component vector-0.13.2.0-8LOelnSUdEBA96wwEHnFX5-vector-tests-O2
  1225. 1078.11 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  1226. 1078.11 s [vector] include base-4.18.3.0
  1227. 1078.11 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  1228. 1078.11 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1229. 1078.11 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1230. 1078.11 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1231. 1078.11 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  1232. 1078.11 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  1233. 1078.11 s [vector] include template-haskell-2.20.0.0
  1234. 1078.11 s [vector] include transformers-0.6.1.0
  1235. 1078.11 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1236. 1078.11 s [vector] Linked component graph:
  1237. 1078.11 s [vector] unit vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1238. 1078.11 s [vector] include base-4.18.3.0
  1239. 1078.11 s [vector] include deepseq-1.4.8.1
  1240. 1078.12 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1241. 1078.12 s [vector] include vector-stream-0.1.0.1-7qX9oQxWHCz9yDWW5CqJnq
  1242. 1078.12 s [vector] Data.Vector=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Unboxed.Mutable
  1243. 1078.12 s [vector] unit vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  1244. 1078.12 s [vector] include base-4.18.3.0
  1245. 1078.12 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1246. 1078.12 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1247. 1078.12 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1248. 1078.12 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.TestData.ParenTree
  1249. 1078.12 s [vector] unit vector-0.13.2.0-LrI0dkKApwzC3Hsdwz2nAc-vector-doctest
  1250. 1078.12 s [vector] include base-4.18.3.0
  1251. 1078.12 s [vector] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  1252. 1078.12 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1253. 1078.12 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1254. 1078.12 s [vector] unit vector-0.13.2.0-LnTwbj1fD5P548jgjJP8km-vector-inspection
  1255. 1078.12 s [vector] include base-4.18.3.0
  1256. 1078.12 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1257. 1078.12 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1258. 1078.12 s [vector] include tasty-inspection-testing-0.2.1-Az6JDTbWQZ44em03VPnfTo
  1259. 1078.12 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1260. 1078.12 s [vector] unit vector-0.13.2.0-CdRaf8rd0cN250Lun0s1xX-vector-tests-O0
  1261. 1078.12 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  1262. 1078.12 s [vector] include base-4.18.3.0
  1263. 1078.12 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  1264. 1078.12 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1265. 1078.12 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1266. 1078.12 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1267. 1078.12 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  1268. 1078.12 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  1269. 1078.12 s [vector] include template-haskell-2.20.0.0
  1270. 1078.12 s [vector] include transformers-0.6.1.0
  1271. 1078.12 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1272. 1078.12 s [vector] unit vector-0.13.2.0-8LOelnSUdEBA96wwEHnFX5-vector-tests-O2
  1273. 1078.12 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  1274. 1078.12 s [vector] include base-4.18.3.0
  1275. 1078.15 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  1276. 1078.15 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1277. 1078.15 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1278. 1078.15 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1279. 1078.15 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  1280. 1078.15 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  1281. 1078.15 s [vector] include template-haskell-2.20.0.0
  1282. 1078.15 s [vector] include transformers-0.6.1.0
  1283. 1078.15 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1284. 1078.15 s [vector] Ready component graph:
  1285. 1078.15 s [vector] definite vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1286. 1078.15 s [vector] depends base-4.18.3.0
  1287. 1078.15 s [vector] depends deepseq-1.4.8.1
  1288. 1078.15 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1289. 1078.15 s [vector] depends vector-stream-0.1.0.1-7qX9oQxWHCz9yDWW5CqJnq
  1290. 1078.15 s [vector] definite vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  1291. 1078.15 s [vector] depends base-4.18.3.0
  1292. 1078.15 s [vector] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1293. 1078.15 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1294. 1078.15 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1295. 1078.15 s [vector] definite vector-0.13.2.0-8LOelnSUdEBA96wwEHnFX5-vector-tests-O2
  1296. 1078.15 s [vector] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  1297. 1078.15 s [vector] depends base-4.18.3.0
  1298. 1078.15 s [vector] depends base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  1299. 1078.15 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1300. 1078.15 s [vector] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1301. 1078.15 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1302. 1078.15 s [vector] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  1303. 1078.15 s [vector] depends tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  1304. 1078.15 s [vector] depends template-haskell-2.20.0.0
  1305. 1078.15 s [vector] depends transformers-0.6.1.0
  1306. 1078.15 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1307. 1078.15 s [vector] definite vector-0.13.2.0-CdRaf8rd0cN250Lun0s1xX-vector-tests-O0
  1308. 1078.15 s [vector] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  1309. 1078.15 s [vector] depends base-4.18.3.0
  1310. 1078.15 s [vector] depends base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  1311. 1078.15 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1312. 1078.15 s [vector] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  1313. 1078.15 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1314. 1078.15 s [vector] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  1315. 1078.15 s [vector] depends tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  1316. 1078.15 s [vector] depends template-haskell-2.20.0.0
  1317. 1078.15 s [vector] depends transformers-0.6.1.0
  1318. 1078.15 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1319. 1078.15 s [vector] definite vector-0.13.2.0-LnTwbj1fD5P548jgjJP8km-vector-inspection
  1320. 1078.15 s [vector] depends base-4.18.3.0
  1321. 1078.15 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1322. 1078.15 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  1323. 1078.15 s [vector] depends tasty-inspection-testing-0.2.1-Az6JDTbWQZ44em03VPnfTo
  1324. 1078.15 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1325. 1078.15 s [vector] definite vector-0.13.2.0-LrI0dkKApwzC3Hsdwz2nAc-vector-doctest
  1326. 1078.15 s [vector] depends base-4.18.3.0
  1327. 1078.15 s [vector] depends doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  1328. 1078.15 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  1329. 1078.15 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1330. 1078.15 s [vector] Using Cabal-3.10.3.0 compiled by ghc-9.6
  1331. 1078.15 s [vector] Using compiler: ghc-9.6.7
  1332. 1078.15 s [vector] Using install prefix:
  1333. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  1334. 1078.15 s [vector] Executables installed in:
  1335. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/bin
  1336. 1078.15 s [vector] Libraries installed in:
  1337. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  1338. 1078.15 s [vector] Dynamic Libraries installed in:
  1339. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  1340. 1078.15 s [vector] Private executables installed in:
  1341. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.6.7/vector-0.13.2.0
  1342. 1078.15 s [vector] Data files installed in:
  1343. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/share/x86_64-linux-ghc-9.6.7/vector-0.13.2.0
  1344. 1078.15 s [vector] Documentation installed in:
  1345. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.6.7/vector-0.13.2.0
  1346. 1078.15 s [vector] Configuration files installed in:
  1347. 1078.15 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/etc
  1348. 1078.15 s [vector] No alex found
  1349. 1078.15 s [vector] Using ar found on system at:
  1350. 1078.15 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1351. 1078.15 s [vector] No c2hs found
  1352. 1078.15 s [vector] No cpphs found
  1353. 1078.15 s [vector] Using doctest version 0.24.2 found on system at:
  1354. 1078.15 s [vector] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin/doctest
  1355. 1078.15 s [vector] Using gcc version 14.3.0 given by user at:
  1356. 1078.15 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1357. 1078.15 s [vector] Using ghc version 9.6.7 found on system at:
  1358. 1078.15 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  1359. 1078.16 s [vector] Using ghc-pkg version 9.6.7 found on system at:
  1360. 1078.16 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  1361. 1078.16 s [vector] No ghcjs found
  1362. 1078.16 s [vector] No ghcjs-pkg found
  1363. 1078.16 s [vector] No greencard found
  1364. 1078.16 s [vector] Using haddock version 2.29.2 found on system at:
  1365. 1078.16 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  1366. 1078.16 s [vector] No happy found
  1367. 1078.16 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  1368. 1078.16 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1369. 1078.16 s [vector] No hmake found
  1370. 1078.16 s [vector] Using hpc version 0.68 found on system at:
  1371. 1078.16 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  1372. 1078.16 s [vector] Using hsc2hs version 0.68.9 found on system at:
  1373. 1078.16 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  1374. 1078.16 s [vector] Using hscolour version 1.25 found on system at:
  1375. 1078.16 s [vector] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  1376. 1078.16 s [vector] No jhc found
  1377. 1078.16 s [vector] Using ld found on system at:
  1378. 1078.16 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  1379. 1078.16 s [vector] No pkg-config found
  1380. 1078.16 s [vector] Using runghc version 9.6.7 found on system at:
  1381. 1078.16 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  1382. 1078.16 s [vector] Using strip version 2.44 found on system at:
  1383. 1078.16 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1384. 1078.16 s [vector] Using tar found on system at:
  1385. 1078.16 s [vector] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1386. 1078.16 s [vector] No uhc found
  1387. 1078.50 s [vector] Phase: buildPhase
  1388. 1078.61 s [vector] Preprocessing library for vector-0.13.2.0..
  1389. 1078.62 s [vector] Building library for vector-0.13.2.0..
  1390. 1079.13 s [hls-test-utils] Warning: Test.Hls: could not find link destinations for:
  1391. 1079.13 s [hls-test-utils] - Data.Vector.Unboxed.Base.Unbox
  1392. 1079.13 s [hls-test-utils] - Data.Vector.Primitive.Vector
  1393. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActions
  1394. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.actions
  1395. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveParameter
  1396. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeParameter
  1397. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveParameterSupport
  1398. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeParameterSupport
  1399. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveSignature
  1400. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeSignature
  1401. 1079.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveSignatureHelp
  1402. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeSignatureHelp
  1403. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAdded
  1404. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.added
  1405. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAdditionalPropertiesSupport
  1406. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.additionalPropertiesSupport
  1407. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAdditionalTextEdits
  1408. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.additionalTextEdits
  1409. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAllCommitCharacters
  1410. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.allCommitCharacters
  1411. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAllowedTags
  1412. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.allowedTags
  1413. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAlpha
  1414. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.alpha
  1415. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAnnotationId
  1416. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.annotationId
  1417. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasApplied
  1418. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.applied
  1419. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasApplyEdit
  1420. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.applyEdit
  1421. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasArguments
  1422. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.arguments
  1423. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasArray
  1424. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.array
  1425. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAugmentsSyntaxTokens
  1426. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.augmentsSyntaxTokens
  1427. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasBaseUri
  1428. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.baseUri
  1429. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasBlue
  1430. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.blue
  1431. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCallHierarchy
  1432. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.callHierarchy
  1433. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCallHierarchyProvider
  1434. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.callHierarchyProvider
  1435. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCancel
  1436. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cancel
  1437. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCancellable
  1438. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cancellable
  1439. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCapabilities
  1440. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.capabilities
  1441. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCaseSensitiveLookup
  1442. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.caseSensitiveLookup
  1443. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCellTextDocuments
  1444. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cellTextDocuments
  1445. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCells
  1446. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cells
  1447. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCh
  1448. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ch
  1449. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChange
  1450. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.change
  1451. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChangeAnnotationSupport
  1452. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changeAnnotationSupport
  1453. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChangeAnnotations
  1454. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changeAnnotations
  1455. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChangeNotifications
  1456. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changeNotifications
  1457. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChanges
  1458. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changes
  1459. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCharacter
  1460. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.character
  1461. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChildren
  1462. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.children
  1463. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasClientInfo
  1464. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.clientInfo
  1465. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCode
  1466. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.code
  1467. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeAction
  1468. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeAction
  1469. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionKind
  1470. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionKind
  1471. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionKinds
  1472. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionKinds
  1473. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionLiteralSupport
  1474. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionLiteralSupport
  1475. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionProvider
  1476. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionProvider
  1477. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeDescription
  1478. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeDescription
  1479. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeDescriptionSupport
  1480. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeDescriptionSupport
  1481. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeLens
  1482. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeLens
  1483. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeLensProvider
  1484. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeLensProvider
  1485. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCollapsedText
  1486. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.collapsedText
  1487. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasColor
  1488. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.color
  1489. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasColorProvider
  1490. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.colorProvider
  1491. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommand
  1492. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.command
  1493. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommands
  1494. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.commands
  1495. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommitCharacters
  1496. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.commitCharacters
  1497. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommitCharactersSupport
  1498. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.commitCharactersSupport
  1499. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletion
  1500. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completion
  1501. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionItem
  1502. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionItem
  1503. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionItemKind
  1504. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionItemKind
  1505. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionList
  1506. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionList
  1507. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionProvider
  1508. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionProvider
  1509. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasConfiguration
  1510. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.configuration
  1511. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContainerName
  1512. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.containerName
  1513. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContentChanges
  1514. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contentChanges
  1515. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContentFormat
  1516. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contentFormat
  1517. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContents
  1518. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contents
  1519. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContext
  1520. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.context
  1521. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContextSupport
  1522. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contextSupport
  1523. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDataSupport
  1524. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.dataSupport
  1525. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasData_
  1526. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.data_
  1527. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeclaration
  1528. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.declaration
  1529. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeclarationProvider
  1530. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.declarationProvider
  1531. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDefaultBehavior
  1532. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.defaultBehavior
  1533. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDefinition
  1534. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.definition
  1535. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDefinitionProvider
  1536. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.definitionProvider
  1537. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeleteCount
  1538. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deleteCount
  1539. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDelta
  1540. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.delta
  1541. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeltaLine
  1542. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deltaLine
  1543. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeltaStartChar
  1544. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deltaStartChar
  1545. 1079.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeprecated
  1546. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deprecated
  1547. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeprecatedSupport
  1548. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deprecatedSupport
  1549. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDescription
  1550. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.description
  1551. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDetail
  1552. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.detail
  1553. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDiagnostic
  1554. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.diagnostic
  1555. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDiagnosticProvider
  1556. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.diagnosticProvider
  1557. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDiagnostics
  1558. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.diagnostics
  1559. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidChangeConfiguration
  1560. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didChangeConfiguration
  1561. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidChangeWatchedFiles
  1562. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didChangeWatchedFiles
  1563. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidClose
  1564. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didClose
  1565. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidCreate
  1566. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didCreate
  1567. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidDelete
  1568. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didDelete
  1569. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidOpen
  1570. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didOpen
  1571. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidRename
  1572. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didRename
  1573. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidSave
  1574. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didSave
  1575. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDisabled
  1576. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.disabled
  1577. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDisabledSupport
  1578. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.disabledSupport
  1579. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocument
  1580. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.document
  1581. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentChanges
  1582. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentChanges
  1583. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentFormattingProvider
  1584. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentFormattingProvider
  1585. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentHighlight
  1586. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentHighlight
  1587. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentHighlightProvider
  1588. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentHighlightProvider
  1589. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentLink
  1590. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentLink
  1591. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentLinkProvider
  1592. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentLinkProvider
  1593. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentOnTypeFormattingProvider
  1594. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentOnTypeFormattingProvider
  1595. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentRangeFormattingProvider
  1596. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentRangeFormattingProvider
  1597. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentSelector
  1598. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentSelector
  1599. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentSymbol
  1600. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentSymbol
  1601. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentSymbolProvider
  1602. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentSymbolProvider
  1603. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentation
  1604. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentation
  1605. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentationFormat
  1606. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentationFormat
  1607. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDynamicRegistration
  1608. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.dynamicRegistration
  1609. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEdit
  1610. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.edit
  1611. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEditRange
  1612. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.editRange
  1613. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEdits
  1614. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.edits
  1615. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEnd
  1616. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.end
  1617. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEndCharacter
  1618. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.endCharacter
  1619. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEndLine
  1620. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.endLine
  1621. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEngine
  1622. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.engine
  1623. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEvent
  1624. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.event
  1625. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecuteCommand
  1626. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executeCommand
  1627. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecuteCommandProvider
  1628. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executeCommandProvider
  1629. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecutionOrder
  1630. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executionOrder
  1631. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecutionSummary
  1632. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executionSummary
  1633. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecutionSummarySupport
  1634. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executionSummarySupport
  1635. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExperimental
  1636. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.experimental
  1637. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExpression
  1638. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.expression
  1639. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExternal
  1640. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.external
  1641. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFailedChange
  1642. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.failedChange
  1643. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFailureHandling
  1644. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.failureHandling
  1645. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFailureReason
  1646. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.failureReason
  1647. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFileOperations
  1648. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.fileOperations
  1649. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFiles
  1650. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.files
  1651. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFilterText
  1652. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.filterText
  1653. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFilters
  1654. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.filters
  1655. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFirstTriggerCharacter
  1656. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.firstTriggerCharacter
  1657. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFoldingRange
  1658. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.foldingRange
  1659. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFoldingRangeKind
  1660. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.foldingRangeKind
  1661. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFoldingRangeProvider
  1662. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.foldingRangeProvider
  1663. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFormats
  1664. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.formats
  1665. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFormatting
  1666. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.formatting
  1667. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFrameId
  1668. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.frameId
  1669. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFrom
  1670. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.from
  1671. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFromRanges
  1672. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.fromRanges
  1673. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFull
  1674. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.full
  1675. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGeneral
  1676. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.general
  1677. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGlob
  1678. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.glob
  1679. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGlobPattern
  1680. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.globPattern
  1681. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGreen
  1682. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.green
  1683. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGroupsOnLabel
  1684. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.groupsOnLabel
  1685. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHierarchicalDocumentSymbolSupport
  1686. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.hierarchicalDocumentSymbolSupport
  1687. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHonorsChangeAnnotations
  1688. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.honorsChangeAnnotations
  1689. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHover
  1690. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.hover
  1691. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHoverProvider
  1692. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.hoverProvider
  1693. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHref
  1694. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.href
  1695. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasId
  1696. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.id
  1697. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIdentifier
  1698. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.identifier
  1699. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIgnoreCase
  1700. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ignoreCase
  1701. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIgnoreIfExists
  1702. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ignoreIfExists
  1703. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIgnoreIfNotExists
  1704. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ignoreIfNotExists
  1705. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasImplementation
  1706. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.implementation
  1707. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasImplementationProvider
  1708. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.implementationProvider
  1709. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIncludeDeclaration
  1710. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.includeDeclaration
  1711. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIncludeText
  1712. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.includeText
  1713. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInitializationOptions
  1714. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.initializationOptions
  1715. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlayHint
  1716. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlayHint
  1717. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlayHintProvider
  1718. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlayHintProvider
  1719. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlineValue
  1720. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlineValue
  1721. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlineValueProvider
  1722. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlineValueProvider
  1723. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsert
  1724. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insert
  1725. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertFinalNewline
  1726. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertFinalNewline
  1727. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertReplaceSupport
  1728. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertReplaceSupport
  1729. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertSpaces
  1730. 1079.29 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertSpaces
  1731. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertText
  1732. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertText
  1733. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertTextFormat
  1734. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertTextFormat
  1735. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertTextMode
  1736. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertTextMode
  1737. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertTextModeSupport
  1738. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertTextModeSupport
  1739. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInterFileDependencies
  1740. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.interFileDependencies
  1741. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsIncomplete
  1742. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isIncomplete
  1743. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsPreferred
  1744. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isPreferred
  1745. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsPreferredSupport
  1746. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isPreferredSupport
  1747. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsRetrigger
  1748. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isRetrigger
  1749. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasItem
  1750. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.item
  1751. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasItemDefaults
  1752. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.itemDefaults
  1753. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasItems
  1754. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.items
  1755. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasKind
  1756. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.kind
  1757. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabel
  1758. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.label
  1759. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelDetails
  1760. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelDetails
  1761. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelDetailsSupport
  1762. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelDetailsSupport
  1763. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelOffsetSupport
  1764. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelOffsetSupport
  1765. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelSupport
  1766. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelSupport
  1767. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLanguage
  1768. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.language
  1769. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLanguageId
  1770. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.languageId
  1771. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLegend
  1772. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.legend
  1773. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLength
  1774. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.length
  1775. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLine
  1776. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.line
  1777. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLineFoldingOnly
  1778. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.lineFoldingOnly
  1779. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLinkSupport
  1780. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.linkSupport
  1781. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLinkedEditingRange
  1782. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.linkedEditingRange
  1783. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLinkedEditingRangeProvider
  1784. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.linkedEditingRangeProvider
  1785. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLocale
  1786. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.locale
  1787. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLocation
  1788. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.location
  1789. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMarkdown
  1790. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.markdown
  1791. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMatches
  1792. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.matches
  1793. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMessage
  1794. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.message
  1795. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMessageActionItem
  1796. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.messageActionItem
  1797. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMetadata
  1798. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.metadata
  1799. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMethod
  1800. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.method
  1801. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMoniker
  1802. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.moniker
  1803. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMonikerProvider
  1804. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.monikerProvider
  1805. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMoreTriggerCharacter
  1806. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.moreTriggerCharacter
  1807. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMultilineTokenSupport
  1808. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.multilineTokenSupport
  1809. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasName
  1810. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.name
  1811. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNeedsConfirmation
  1812. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.needsConfirmation
  1813. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNewName
  1814. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.newName
  1815. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNewText
  1816. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.newText
  1817. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNewUri
  1818. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.newUri
  1819. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNormalizesLineEndings
  1820. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.normalizesLineEndings
  1821. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebook
  1822. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebook
  1823. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookDocument
  1824. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookDocument
  1825. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookDocumentSync
  1826. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookDocumentSync
  1827. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookSelector
  1828. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookSelector
  1829. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookType
  1830. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookType
  1831. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOldUri
  1832. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.oldUri
  1833. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOnTypeFormatting
  1834. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.onTypeFormatting
  1835. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOnly
  1836. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.only
  1837. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOpenClose
  1838. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.openClose
  1839. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOptions
  1840. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.options
  1841. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOriginSelectionRange
  1842. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.originSelectionRange
  1843. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOverlappingTokenSupport
  1844. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.overlappingTokenSupport
  1845. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOverwrite
  1846. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.overwrite
  1847. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPaddingLeft
  1848. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.paddingLeft
  1849. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPaddingRight
  1850. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.paddingRight
  1851. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParameterInformation
  1852. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parameterInformation
  1853. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParameters
  1854. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parameters
  1855. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParent
  1856. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parent
  1857. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParser
  1858. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parser
  1859. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPartialResultToken
  1860. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.partialResultToken
  1861. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPattern
  1862. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.pattern
  1863. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPercentage
  1864. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.percentage
  1865. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPlaceholder
  1866. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.placeholder
  1867. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPosition
  1868. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.position
  1869. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPositionEncoding
  1870. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.positionEncoding
  1871. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPositionEncodings
  1872. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.positionEncodings
  1873. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPositions
  1874. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.positions
  1875. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPrepareProvider
  1876. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.prepareProvider
  1877. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPrepareSupport
  1878. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.prepareSupport
  1879. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPrepareSupportDefaultBehavior
  1880. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.prepareSupportDefaultBehavior
  1881. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreselect
  1882. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.preselect
  1883. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreselectSupport
  1884. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.preselectSupport
  1885. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreviousResultId
  1886. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.previousResultId
  1887. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreviousResultIds
  1888. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.previousResultIds
  1889. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasProcessId
  1890. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.processId
  1891. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasProperties
  1892. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.properties
  1893. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPublishDiagnostics
  1894. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.publishDiagnostics
  1895. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasQuery
  1896. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.query
  1897. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRange
  1898. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.range
  1899. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRangeFormatting
  1900. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rangeFormatting
  1901. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRangeLength
  1902. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rangeLength
  1903. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRangeLimit
  1904. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rangeLimit
  1905. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRanges
  1906. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ranges
  1907. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReason
  1908. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.reason
  1909. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRecursive
  1910. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.recursive
  1911. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRed
  1912. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.red
  1913. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReferences
  1914. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.references
  1915. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReferencesProvider
  1916. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.referencesProvider
  1917. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRefreshSupport
  1918. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.refreshSupport
  1919. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRegisterOptions
  1920. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.registerOptions
  1921. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRegistrations
  1922. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.registrations
  1923. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRegularExpressions
  1924. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.regularExpressions
  1925. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelatedDocumentSupport
  1926. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relatedDocumentSupport
  1927. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelatedDocuments
  1928. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relatedDocuments
  1929. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelatedInformation
  1930. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relatedInformation
  1931. 1079.30 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelativePatternSupport
  1932. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relativePatternSupport
  1933. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRemoved
  1934. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.removed
  1935. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRename
  1936. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rename
  1937. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRenameProvider
  1938. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.renameProvider
  1939. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReplace
  1940. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.replace
  1941. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRequests
  1942. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.requests
  1943. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResolveProvider
  1944. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resolveProvider
  1945. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResolveSupport
  1946. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resolveSupport
  1947. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResourceOperations
  1948. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resourceOperations
  1949. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResultId
  1950. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resultId
  1951. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetriggerCharacters
  1952. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retriggerCharacters
  1953. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetriggerRequest
  1954. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retriggerRequest
  1955. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetry
  1956. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retry
  1957. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetryOnContentModified
  1958. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retryOnContentModified
  1959. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRootPath
  1960. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rootPath
  1961. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRootUri
  1962. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rootUri
  1963. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSave
  1964. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.save
  1965. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasScheme
  1966. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.scheme
  1967. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasScopeUri
  1968. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.scopeUri
  1969. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSection
  1970. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.section
  1971. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSelection
  1972. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.selection
  1973. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSelectionRange
  1974. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.selectionRange
  1975. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSelectionRangeProvider
  1976. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.selectionRangeProvider
  1977. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSemanticTokens
  1978. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.semanticTokens
  1979. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSemanticTokensProvider
  1980. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.semanticTokensProvider
  1981. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasServerCancelSupport
  1982. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.serverCancelSupport
  1983. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasServerInfo
  1984. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.serverInfo
  1985. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSettings
  1986. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.settings
  1987. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSeverity
  1988. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.severity
  1989. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasShowDocument
  1990. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.showDocument
  1991. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasShowMessage
  1992. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.showMessage
  1993. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatureHelp
  1994. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatureHelp
  1995. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatureHelpProvider
  1996. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatureHelpProvider
  1997. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatureInformation
  1998. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatureInformation
  1999. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatures
  2000. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatures
  2001. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSnippetSupport
  2002. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.snippetSupport
  2003. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSortText
  2004. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.sortText
  2005. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSource
  2006. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.source
  2007. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStaleRequestSupport
  2008. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.staleRequestSupport
  2009. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStart
  2010. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.start
  2011. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStartChar
  2012. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.startChar
  2013. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStartCharacter
  2014. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.startCharacter
  2015. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStartLine
  2016. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.startLine
  2017. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStoppedLocation
  2018. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.stoppedLocation
  2019. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStructure
  2020. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.structure
  2021. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSuccess
  2022. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.success
  2023. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSupport
  2024. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.support
  2025. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSupported
  2026. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.supported
  2027. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSymbol
  2028. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.symbol
  2029. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSymbolKind
  2030. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.symbolKind
  2031. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSyncKind
  2032. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.syncKind
  2033. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSynchronization
  2034. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.synchronization
  2035. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTabSize
  2036. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tabSize
  2037. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTagSupport
  2038. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tagSupport
  2039. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTags
  2040. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tags
  2041. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTakeFocus
  2042. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.takeFocus
  2043. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTarget
  2044. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.target
  2045. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTargetRange
  2046. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.targetRange
  2047. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTargetSelectionRange
  2048. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.targetSelectionRange
  2049. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTargetUri
  2050. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.targetUri
  2051. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasText
  2052. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.text
  2053. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextContent
  2054. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textContent
  2055. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextDocument
  2056. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textDocument
  2057. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextDocumentSync
  2058. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textDocumentSync
  2059. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextEdit
  2060. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textEdit
  2061. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextEditText
  2062. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textEditText
  2063. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextEdits
  2064. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textEdits
  2065. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTitle
  2066. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.title
  2067. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTo
  2068. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.to
  2069. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasToken
  2070. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.token
  2071. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTokenModifiers
  2072. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tokenModifiers
  2073. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTokenType
  2074. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tokenType
  2075. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTokenTypes
  2076. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tokenTypes
  2077. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTooltip
  2078. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tooltip
  2079. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTooltipSupport
  2080. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tooltipSupport
  2081. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTrace
  2082. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.trace
  2083. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTriggerCharacter
  2084. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.triggerCharacter
  2085. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTriggerCharacters
  2086. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.triggerCharacters
  2087. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTriggerKind
  2088. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.triggerKind
  2089. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTrimFinalNewlines
  2090. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.trimFinalNewlines
  2091. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTrimTrailingWhitespace
  2092. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.trimTrailingWhitespace
  2093. 1079.31 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeDefinition
  2094. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeDefinition
  2095. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeDefinitionProvider
  2096. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeDefinitionProvider
  2097. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeHierarchy
  2098. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeHierarchy
  2099. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeHierarchyProvider
  2100. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeHierarchyProvider
  2101. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasType_
  2102. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.type_
  2103. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasUnique
  2104. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.unique
  2105. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasUnregisterations
  2106. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.unregisterations
  2107. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasUri
  2108. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.uri
  2109. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasValue
  2110. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.value
  2111. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasValueSet
  2112. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.valueSet
  2113. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVariableName
  2114. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.variableName
  2115. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVerbose
  2116. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.verbose
  2117. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVersion
  2118. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.version
  2119. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVersionSupport
  2120. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.versionSupport
  2121. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWatchers
  2122. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.watchers
  2123. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillCreate
  2124. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willCreate
  2125. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillDelete
  2126. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willDelete
  2127. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillRename
  2128. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willRename
  2129. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillSave
  2130. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willSave
  2131. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillSaveWaitUntil
  2132. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willSaveWaitUntil
  2133. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWindow
  2134. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.window
  2135. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWordPattern
  2136. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.wordPattern
  2137. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkDoneProgress
  2138. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workDoneProgress
  2139. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkDoneToken
  2140. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workDoneToken
  2141. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspace
  2142. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspace
  2143. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceDiagnostics
  2144. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceDiagnostics
  2145. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceEdit
  2146. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceEdit
  2147. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceFolders
  2148. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceFolders
  2149. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceSymbolProvider
  2150. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceSymbolProvider
  2151. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Common.Null
  2152. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.TResponseError
  2153. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Message.Meta.ClientToServer
  2154. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Internal.Method.Method_CustomMethod
  2155. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.MVector
  2156. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeWrite
  2157. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicSet
  2158. 1079.32 s [hls-test-utils] - Data.Vector.Unboxed.Base.MV_Int32
  2159. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeFreeze
  2160. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicLength
  2161. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeRead
  2162. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeIndexM
  2163. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Base.elemseq
  2164. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeNew
  2165. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicInitialize
  2166. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Base.basicLength
  2167. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeCopy
  2168. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeCopy
  2169. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeSlice
  2170. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeThaw
  2171. 1079.32 s [hls-test-utils] - Data.Vector.Primitive.Mutable.MVector
  2172. 1079.32 s [hls-test-utils] - Data.Vector.Unboxed.Base.V_Int32
  2173. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicClear
  2174. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicOverlaps
  2175. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeGrow
  2176. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeMove
  2177. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeReplicate
  2178. 1079.32 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeSlice
  2179. 1079.32 s [hls-test-utils] - Data.Vector.Unboxed.Base.D:R:MVectorsInt320
  2180. 1079.32 s [hls-test-utils] - Data.Vector.Unboxed.Base.D:R:VectorInt320
  2181. 1079.32 s [hls-test-utils] - Language.LSP.Protocol.Types.Uri.SystemOS
  2182. 1079.32 s [hls-test-utils] - Language.LSP.VFS.HasCharacter
  2183. 1079.32 s [hls-test-utils] - Language.LSP.VFS.HasLine
  2184. 1079.32 s [hls-test-utils] - Language.LSP.VFS.HasLsp_version
  2185. 1079.32 s [hls-test-utils] - Language.LSP.VFS.HasVfsMap
  2186. 1079.34 s [vector] [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o, dist/build/Data/Vector/Fusion/Stream/Monadic.dyn_o )
  2187. 1079.43 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 )
  2188. 1079.45 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 )
  2189. 1079.80 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.o, dist/build/Data/Vector/Generic/Mutable/Base.dyn_o )
  2190. 1079.80 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 )
  2191. 1079.80 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 )
  2192. 1079.80 s [vector] [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.o, dist/build/Data/Vector/Fusion/Bundle/Monadic.dyn_o )
  2193. 1088.38 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 )
  2194. 1093.20 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.o, dist/build/Data/Vector/Generic/Mutable.dyn_o )
  2195. 1097.94 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 )
  2196. 1098.87 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 )
  2197. 1108.25 s [hls-test-utils] Documentation created: dist/doc/html/hls-test-utils/,
  2198. 1108.25 s [hls-test-utils] dist/doc/html/hls-test-utils/hls-test-utils.txt
  2199. 1108.35 s [hls-test-utils] haddockPhase completed in 50 seconds
  2200. 1108.35 s [hls-test-utils] Phase: installPhase
  2201. 1108.56 s [hls-test-utils] Installing library in /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  2202. 1109.11 s [hls-test-utils] Phase: fixupPhase
  2203. 1109.13 s [hls-test-utils] shrinking RPATHs of ELF executables and libraries in /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0
  2204. 1109.14 s [hls-test-utils] shrinking /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h-ghc9.6.7.so
  2205. 1109.32 s [hls-test-utils] checking for references to /build/ in /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0...
  2206. 1109.35 s [hls-test-utils] patching script interpreter paths in /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0
  2207. 1109.35 s [hls-test-utils] stripping (with command strip and flags -S -p) in /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0/lib
  2208. 1109.50 s [hls-test-utils] shrinking RPATHs of ELF executables and libraries in /nix/store/416y3d819zn3rh7x1ilf0w62md6jgwan-hls-test-utils-2.12.0.0-doc
  2209. 1109.52 s [hls-test-utils] checking for references to /build/ in /nix/store/416y3d819zn3rh7x1ilf0w62md6jgwan-hls-test-utils-2.12.0.0-doc...
  2210. 1109.55 s [hls-test-utils] patching script interpreter paths in /nix/store/416y3d819zn3rh7x1ilf0w62md6jgwan-hls-test-utils-2.12.0.0-doc
  2211. 1109.87 s [hls-test-utils:post-build] Uploading to cachix cache "sellout": /nix/store/416y3d819zn3rh7x1ilf0w62md6jgwan-hls-test-utils-2.12.0.0-doc /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0
  2212. 1110.44 s [hls-test-utils:post-build] Pushing 2 paths (446 are already present) using zstd to cache sellout ⏳
  2213. 1110.44 s [hls-test-utils:post-build]
  2214. 1110.78 s [hls-test-utils:post-build] Pushing /nix/store/416y3d819zn3rh7x1ilf0w62md6jgwan-hls-test-utils-2.12.0.0-doc (19.67 MiB)
  2215. 1110.94 s [hls-test-utils:post-build] Pushing /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0 (6.36 MiB)
  2216. 1112.35 s [hls-test-utils:post-build]
  2217. 1112.35 s [hls-test-utils:post-build] All done.
  2218. 1112.41 s [hls-test-utils:post-build] Uploading to the NixCI cache: /nix/store/416y3d819zn3rh7x1ilf0w62md6jgwan-hls-test-utils-2.12.0.0-doc /nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0
  2219. 1112.53 s [hls-test-utils:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2220. 1112.77 s [hls-test-utils:post-build] copying 2 paths...
  2221. 1112.77 s [hls-test-utils:post-build] copying path '/nix/store/416y3d819zn3rh7x1ilf0w62md6jgwan-hls-test-utils-2.12.0.0-doc' to 'https://cache.nix-ci.com'...
  2222. 1115.86 s [hls-test-utils:post-build] copying path '/nix/store/vjp8rdzq17r8a4gf86wgd9yqavwwdnis-hls-test-utils-2.12.0.0' to 'https://cache.nix-ci.com'...
  2223. 1119.20 s [hls-test-utils:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2224. 1119.61 s [hls-test-utils:post-build] copying 1 paths...
  2225. 1119.61 s [hls-test-utils:post-build] copying path '/nix/store/cb5hnfsdkly3w4aiprdrm433cyc864d4-hls-test-utils-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  2226. 1120.54 s Progress: 16 of 34 built (1 building), 341 of 341 downloaded from cache
  2227. 1120.94 s Building /nix/store/3ar7h9qlgjsynrjnc8x5py4d6f9jkh09-haskell-language-server-2.12.0.0.drv
  2228. 1120.96 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 )
  2229. 1120.96 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  2230. 1122.79 s [haskell-language-server] Phase: setupCompilerEnvironmentPhase
  2231. 1122.80 s [haskell-language-server] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  2232. 1124.96 s [haskell-language-server] Phase: unpackPhase
  2233. 1124.97 s [haskell-language-server] unpacking source archive /nix/store/kqr4dg4wyp0h2dbm7y21zlbp3chihj6k-haskell-language-server-2.12.0.0.tar.gz
  2234. 1125.06 s [haskell-language-server] source root is haskell-language-server-2.12.0.0
  2235. 1125.13 s [haskell-language-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "haskell-language-server-2.12.0.0/test/wrapper/Main.hs"
  2236. 1125.16 s [haskell-language-server] Phase: patchPhase
  2237. 1125.20 s [haskell-language-server] Phase: compileBuildDriverPhase
  2238. 1125.20 s [haskell-language-server] setupCompileFlags: -package-db=/build/tmp.KovYp2TGSg/setup-package.conf.d -threaded
  2239. 1125.39 s [haskell-language-server] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.KovYp2TGSg/Main.o )
  2240. 1125.55 s [haskell-language-server] [2 of 2] Linking Setup
  2241. 1128.73 s [haskell-language-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  2242. 1128.78 s [haskell-language-server] Phase: configurePhase
  2243. 1128.80 s [haskell-language-server] configureFlags: --verbose --prefix=/nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.KovYp2TGSg/package.conf.d --ghc-option=-optl=-Wl,-rpath=/nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/haskell-language-server-2.12.0.0 --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 --enable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  2244. 1128.92 s [haskell-language-server] Using Parsec parser
  2245. 1128.92 s [haskell-language-server] Configuring haskell-language-server-2.12.0.0...
  2246. 1130.87 s [haskell-language-server] Flags chosen: alternatenumberformat=True, cabal=True, cabalfmt=True,
  2247. 1130.87 s [haskell-language-server] cabalgild=True, callhierarchy=True, changetypesignature=True, class=True,
  2248. 1130.87 s [haskell-language-server] coderange=True, dynamic=True, eval=True, explicitfields=True,
  2249. 1130.87 s [haskell-language-server] explicitfixity=True, floskell=True, fourmolu=True, gadt=True, ghc-lib=True,
  2250. 1130.87 s [haskell-language-server] ghcide-bench=True, hlint=True, ignore-plugins-ghc-bounds=False,
  2251. 1130.87 s [haskell-language-server] importlens=True, isolatecabalfmttests=False, isolatecabalgildtests=False,
  2252. 1130.87 s [haskell-language-server] modulename=True, notes=True, ormolu=True, overloadedrecorddot=True,
  2253. 1130.87 s [haskell-language-server] pedantic=False, pragmas=True, qualifyimportednames=True, refactor=True,
  2254. 1130.87 s [haskell-language-server] rename=True, retrie=True, semantictokens=True, signaturehelp=True,
  2255. 1130.87 s [haskell-language-server] splice=True, stan=True, stylishhaskell=True, test-exe=True
  2256. 1130.87 s [haskell-language-server] Dependency aeson-pretty: using aeson-pretty-0.8.10
  2257. 1130.87 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2258. 1130.87 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  2259. 1130.87 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  2260. 1130.87 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2261. 1130.87 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2262. 1130.87 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2263. 1130.87 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2264. 1130.87 s [haskell-language-server] Dependency githash >=0.1.6.1: using githash-0.1.7.0
  2265. 1130.87 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2266. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2267. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2268. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2269. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2270. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2271. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2272. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2273. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2274. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2275. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2276. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2277. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2278. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2279. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2280. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2281. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2282. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2283. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2284. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2285. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2286. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2287. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2288. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2289. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2290. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2291. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2292. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2293. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2294. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2295. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2296. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2297. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2298. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2299. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2300. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2301. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2302. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2303. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2304. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2305. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2306. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2307. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2308. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2309. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2310. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2311. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2312. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2313. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2314. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2315. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2316. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2317. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2318. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2319. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2320. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2321. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2322. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2323. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2324. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2325. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2326. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2327. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2328. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2329. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2330. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2331. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2332. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2333. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2334. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2335. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2336. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2337. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2338. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2339. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2340. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2341. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2342. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2343. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2344. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2345. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2346. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2347. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2348. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2349. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2350. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2351. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2352. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2353. 1130.88 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2354. 1130.88 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2355. 1130.88 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2356. 1130.88 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2357. 1130.88 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2358. 1130.88 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2359. 1130.88 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2360. 1130.88 s [haskell-language-server] haskell-language-server-2.12.0.0
  2361. 1130.88 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2362. 1130.88 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2363. 1130.88 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2364. 1130.88 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2365. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2366. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2367. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2368. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2369. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2370. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2371. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2372. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2373. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2374. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2375. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2376. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2377. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2378. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2379. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2380. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2381. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2382. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2383. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2384. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2385. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2386. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2387. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2388. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2389. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2390. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2391. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2392. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2393. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2394. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2395. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2396. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2397. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2398. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2399. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2400. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2401. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2402. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2403. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2404. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2405. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2406. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2407. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2408. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2409. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2410. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2411. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2412. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2413. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2414. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2415. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2416. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2417. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2418. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2419. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2420. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2421. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2422. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2423. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2424. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2425. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2426. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2427. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2428. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2429. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2430. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2431. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2432. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2433. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2434. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2435. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2436. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2437. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2438. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2439. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2440. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2441. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2442. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2443. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2444. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2445. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2446. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2447. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2448. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2449. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2450. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2451. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2452. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2453. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2454. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2455. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2456. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2457. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2458. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2459. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2460. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2461. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2462. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2463. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2464. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2465. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2466. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2467. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2468. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2469. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2470. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2471. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2472. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2473. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2474. 1130.89 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2475. 1130.89 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2476. 1130.89 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2477. 1130.89 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2478. 1130.89 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2479. 1130.89 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2480. 1130.89 s [haskell-language-server] haskell-language-server-2.12.0.0
  2481. 1130.89 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2482. 1130.89 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2483. 1130.89 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2484. 1130.89 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2485. 1130.89 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2486. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2487. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2488. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2489. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2490. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2491. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2492. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2493. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2494. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2495. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2496. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2497. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2498. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2499. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2500. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2501. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2502. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2503. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2504. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2505. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2506. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2507. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2508. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2509. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2510. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2511. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2512. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2513. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2514. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2515. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2516. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2517. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2518. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2519. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2520. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2521. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2522. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2523. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2524. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2525. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2526. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2527. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2528. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2529. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2530. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2531. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2532. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2533. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2534. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2535. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2536. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2537. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2538. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2539. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2540. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2541. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2542. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2543. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2544. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2545. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2546. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2547. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2548. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2549. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2550. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2551. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2552. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2553. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2554. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2555. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2556. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2557. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2558. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2559. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2560. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2561. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2562. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2563. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2564. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2565. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2566. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2567. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2568. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2569. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2570. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2571. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2572. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2573. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2574. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2575. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2576. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2577. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2578. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2579. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2580. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2581. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2582. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2583. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2584. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2585. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2586. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2587. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2588. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2589. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2590. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2591. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2592. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2593. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2594. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2595. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2596. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2597. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2598. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2599. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2600. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2601. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2602. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2603. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2604. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2605. 1130.90 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2606. 1130.90 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2607. 1130.90 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2608. 1130.90 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2609. 1130.90 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2610. 1130.90 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2611. 1130.90 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2612. 1130.90 s [haskell-language-server] haskell-language-server-2.12.0.0
  2613. 1130.90 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2614. 1130.90 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2615. 1130.90 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2616. 1130.90 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2617. 1130.91 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2618. 1130.91 s [haskell-language-server] hls-floskell-plugin, hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2619. 1130.91 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2620. 1130.91 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2621. 1130.91 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2622. 1130.91 s [haskell-language-server] hls-retrie-plugin, hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2623. 1130.91 s [haskell-language-server] hls-splice-plugin, hls-stan-plugin, hls-stylish-haskell-plugin}: using
  2624. 1130.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  2625. 1130.91 s [haskell-language-server] Dependency hie-bios: using hie-bios-0.17.0
  2626. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2627. 1130.91 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  2628. 1130.91 s [haskell-language-server] Dependency optparse-simple: using optparse-simple-0.1.1.4
  2629. 1130.91 s [haskell-language-server] Dependency prettyprinter >=1.7: using prettyprinter-1.7.1
  2630. 1130.91 s [haskell-language-server] Dependency process: using process-1.6.19.0
  2631. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2632. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2633. 1130.91 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  2634. 1130.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2635. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2636. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2637. 1130.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2638. 1130.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2639. 1130.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2640. 1130.91 s [haskell-language-server] Dependency process-extras: using process-extras-0.7.4
  2641. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2642. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2643. 1130.91 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  2644. 1130.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2645. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2646. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2647. 1130.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2648. 1130.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2649. 1130.91 s [haskell-language-server] Dependency process-extras: using process-extras-0.7.4
  2650. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2651. 1130.91 s [haskell-language-server] Dependency Cabal: using Cabal-3.10.3.0
  2652. 1130.91 s [haskell-language-server] Dependency Cabal-syntax >=3.7: using Cabal-syntax-3.10.3.0
  2653. 1130.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2654. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2655. 1130.91 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  2656. 1130.91 s [haskell-language-server] Dependency cabal-add >=0.2 && <0.3: using cabal-add-0.2
  2657. 1130.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2658. 1130.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2659. 1130.91 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  2660. 1130.91 s [haskell-language-server] Dependency extra >=1.7.4: using extra-1.8.1
  2661. 1130.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2662. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2663. 1130.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2664. 1130.91 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  2665. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2666. 1130.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2667. 1130.91 s [haskell-language-server] Dependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
  2668. 1130.91 s [haskell-language-server] Dependency lsp-types >=2.3 && <2.4: using lsp-types-2.3.0.1
  2669. 1130.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2670. 1130.91 s [haskell-language-server] Dependency pretty: using pretty-1.1.3.6
  2671. 1130.91 s [haskell-language-server] Dependency regex-tdfa >=1.3.1 && <1.4: using regex-tdfa-1.3.2.5
  2672. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2673. 1130.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2674. 1130.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2675. 1130.91 s [haskell-language-server] Dependency unordered-containers >=0.2.10.0: using
  2676. 1130.91 s [haskell-language-server] unordered-containers-0.2.20.1
  2677. 1130.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2678. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2679. 1130.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2680. 1130.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2681. 1130.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2682. 1130.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2683. 1130.91 s [haskell-language-server] Dependency ghc-exactprint >=1.5 && <1.13.0.0: using ghc-exactprint-1.7.1.0
  2684. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2685. 1130.91 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2686. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2687. 1130.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2688. 1130.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2689. 1130.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2690. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2691. 1130.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2692. 1130.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2693. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2694. 1130.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2695. 1130.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2696. 1130.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2697. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2698. 1130.91 s [haskell-language-server] Dependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
  2699. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2700. 1130.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2701. 1130.91 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  2702. 1130.91 s [haskell-language-server] Dependency sqlite-simple: using sqlite-simple-0.4.19.0
  2703. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2704. 1130.91 s [haskell-language-server] Dependency Diff >=0.5 && <0.6 || >=1.0.0 && <1.1: using Diff-1.0.2
  2705. 1130.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2706. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2707. 1130.91 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  2708. 1130.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2709. 1130.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2710. 1130.91 s [haskell-language-server] Dependency dlist: using dlist-1.0
  2711. 1130.91 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2712. 1130.91 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2713. 1130.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2714. 1130.91 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  2715. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2716. 1130.91 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2717. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2718. 1130.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2719. 1130.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2720. 1130.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2721. 1130.91 s [haskell-language-server] Dependency megaparsec >=9.0: using megaparsec-9.7.0
  2722. 1130.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2723. 1130.91 s [haskell-language-server] Dependency parser-combinators >=1.2: using parser-combinators-1.3.0
  2724. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2725. 1130.91 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2726. 1130.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2727. 1130.91 s [haskell-language-server] Dependency unliftio: using unliftio-0.2.25.1
  2728. 1130.91 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2729. 1130.91 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2730. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2731. 1130.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2732. 1130.91 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2733. 1130.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2734. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2735. 1130.91 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2736. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2737. 1130.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2738. 1130.91 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2739. 1130.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2740. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2741. 1130.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2742. 1130.91 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2743. 1130.91 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2744. 1130.91 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2745. 1130.91 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2746. 1130.91 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2747. 1130.91 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  2748. 1130.91 s [haskell-language-server] haskell-language-server-2.12.0.0
  2749. 1130.91 s [haskell-language-server] Dependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
  2750. 1130.91 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2751. 1130.91 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2752. 1130.91 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2753. 1130.91 s [haskell-language-server] Dependency mod: using mod-0.2.1.0
  2754. 1130.91 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2755. 1130.91 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2756. 1130.91 s [haskell-language-server] Dependency text: using text-2.0.2
  2757. 1130.91 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2758. 1130.92 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2759. 1130.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2760. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2761. 1130.92 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  2762. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2763. 1130.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2764. 1130.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2765. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2766. 1130.92 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2767. 1130.92 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  2768. 1130.92 s [haskell-language-server] haskell-language-server-2.12.0.0
  2769. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2770. 1130.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2771. 1130.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2772. 1130.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2773. 1130.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2774. 1130.92 s [haskell-language-server] Dependency retrie >=0.1.1.0: using retrie-1.2.3
  2775. 1130.92 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  2776. 1130.92 s [haskell-language-server] Dependency stm: using stm-2.5.1.0
  2777. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2778. 1130.92 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2779. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2780. 1130.92 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2781. 1130.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2782. 1130.92 s [haskell-language-server] Dependency apply-refact: using apply-refact-0.15.0.0
  2783. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2784. 1130.92 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  2785. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2786. 1130.92 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2787. 1130.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2788. 1130.92 s [haskell-language-server] Dependency ghc-lib-parser: using ghc-lib-parser-9.8.5.20250214
  2789. 1130.92 s [haskell-language-server] Dependency ghc-lib-parser-ex: using ghc-lib-parser-ex-9.8.0.2
  2790. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2791. 1130.92 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2792. 1130.92 s [haskell-language-server] Dependency hlint >=3.5 && <3.11: using hlint-3.8
  2793. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2794. 1130.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2795. 1130.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2796. 1130.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2797. 1130.92 s [haskell-language-server] Dependency refact: using refact-0.3.0.2
  2798. 1130.92 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  2799. 1130.92 s [haskell-language-server] Dependency stm: using stm-2.5.1.0
  2800. 1130.92 s [haskell-language-server] Dependency temporary: using temporary-1.3
  2801. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2802. 1130.92 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2803. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2804. 1130.92 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2805. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2806. 1130.92 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2807. 1130.92 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  2808. 1130.92 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  2809. 1130.92 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2810. 1130.92 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  2811. 1130.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2812. 1130.92 s [haskell-language-server] Dependency stan >=0.2.1.0: using stan-0.2.1.0
  2813. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2814. 1130.92 s [haskell-language-server] Dependency trial: using trial-0.0.0.0
  2815. 1130.92 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2816. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2817. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2818. 1130.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2819. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2820. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2821. 1130.92 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2822. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2823. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2824. 1130.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2825. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2826. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2827. 1130.92 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2828. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2829. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2830. 1130.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2831. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2832. 1130.92 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2833. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2834. 1130.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2835. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2836. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2837. 1130.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2838. 1130.92 s [haskell-language-server] Dependency fuzzy: using fuzzy-0.1.1.0
  2839. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2840. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2841. 1130.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2842. 1130.92 s [haskell-language-server] Dependency lens-aeson: using lens-aeson-1.2.3
  2843. 1130.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2844. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2845. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2846. 1130.92 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2847. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2848. 1130.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2849. 1130.92 s [haskell-language-server] Dependency foldl: using foldl-1.4.18
  2850. 1130.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2851. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2852. 1130.92 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  2853. 1130.92 s [haskell-language-server] haskell-language-server-2.12.0.0
  2854. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2855. 1130.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2856. 1130.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2857. 1130.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2858. 1130.92 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2859. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2860. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2861. 1130.92 s [haskell-language-server] Dependency unliftio-core: using unliftio-core-0.2.1.0
  2862. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2863. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2864. 1130.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2865. 1130.92 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  2866. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2867. 1130.92 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2868. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2869. 1130.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2870. 1130.92 s [haskell-language-server] Dependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
  2871. 1130.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2872. 1130.92 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  2873. 1130.92 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2874. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2875. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2876. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2877. 1130.92 s [haskell-language-server] Dependency dlist: using dlist-1.0
  2878. 1130.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2879. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2880. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2881. 1130.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2882. 1130.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2883. 1130.92 s [haskell-language-server] Dependency text: using text-2.0.2
  2884. 1130.92 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2885. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2886. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2887. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2888. 1130.92 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2889. 1130.92 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2890. 1130.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2891. 1130.92 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2892. 1130.92 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2893. 1130.92 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2894. 1130.92 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2895. 1130.92 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2896. 1130.92 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2897. 1130.92 s [haskell-language-server] Dependency semigroupoids: using semigroupoids-6.0.1
  2898. 1130.92 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2899. 1130.92 s [haskell-language-server] Dependency vector: using vector-0.13.2.0
  2900. 1130.92 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2901. 1130.92 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2902. 1130.92 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2903. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2904. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2905. 1130.93 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2906. 1130.93 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2907. 1130.93 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  2908. 1130.93 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2909. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2910. 1130.93 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2911. 1130.93 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2912. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2913. 1130.93 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2914. 1130.93 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2915. 1130.93 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2916. 1130.93 s [haskell-language-server] Dependency ghc-exactprint: using ghc-exactprint-1.7.1.0
  2917. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2918. 1130.93 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  2919. 1130.93 s [haskell-language-server] haskell-language-server-2.12.0.0
  2920. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2921. 1130.93 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2922. 1130.93 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  2923. 1130.93 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2924. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2925. 1130.93 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2926. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2927. 1130.93 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2928. 1130.93 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2929. 1130.93 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2930. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2931. 1130.93 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2932. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2933. 1130.93 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  2934. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2935. 1130.93 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2936. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2937. 1130.93 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2938. 1130.93 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  2939. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2940. 1130.93 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2941. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2942. 1130.93 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2943. 1130.93 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2944. 1130.93 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2945. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2946. 1130.93 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2947. 1130.93 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2948. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2949. 1130.93 s [haskell-language-server] Dependency containers: using containers-0.6.7
  2950. 1130.93 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  2951. 1130.93 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  2952. 1130.93 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2953. 1130.93 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  2954. 1130.93 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2955. 1130.93 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2956. 1130.93 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2957. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2958. 1130.93 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2959. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2960. 1130.93 s [haskell-language-server] Dependency floskell >=0.11.0 && <0.12: using floskell-0.11.1
  2961. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2962. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2963. 1130.93 s [haskell-language-server] Dependency lsp-types >=2.3 && <2.4: using lsp-types-2.3.0.1
  2964. 1130.93 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2965. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2966. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2967. 1130.93 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2968. 1130.93 s [haskell-language-server] Dependency fourmolu >=0.14 && <0.20: using fourmolu-0.15.0.0
  2969. 1130.93 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  2970. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2971. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2972. 1130.93 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2973. 1130.93 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2974. 1130.93 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2975. 1130.93 s [haskell-language-server] Dependency process-extras >=0.7.1: using process-extras-0.7.4
  2976. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2977. 1130.93 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2978. 1130.93 s [haskell-language-server] Dependency yaml: using yaml-0.11.11.2
  2979. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2980. 1130.93 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2981. 1130.93 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2982. 1130.93 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  2983. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2984. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2985. 1130.93 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2986. 1130.93 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2987. 1130.93 s [haskell-language-server] Dependency ormolu >=0.5.3 && <0.9: using ormolu-0.7.4.0
  2988. 1130.93 s [haskell-language-server] Dependency process-extras >=0.7.1: using process-extras-0.7.4
  2989. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  2990. 1130.93 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  2991. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  2992. 1130.93 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  2993. 1130.93 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  2994. 1130.93 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.6.7
  2995. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2996. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2997. 1130.93 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2998. 1130.93 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2999. 1130.93 s [haskell-language-server] Dependency stylish-haskell >=0.12 && <0.16: using stylish-haskell-0.14.6.0
  3000. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  3001. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3002. 1130.93 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  3003. 1130.93 s [haskell-language-server] Dependency containers: using containers-0.6.7
  3004. 1130.93 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  3005. 1130.93 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  3006. 1130.93 s [haskell-language-server] Dependency dlist: using dlist-1.0
  3007. 1130.93 s [haskell-language-server] Dependency extra: using extra-1.8.1
  3008. 1130.93 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  3009. 1130.93 s [haskell-language-server] Dependency ghc-boot: using ghc-boot-9.6.7
  3010. 1130.93 s [haskell-language-server] Dependency ghc-exactprint <1 || >=1.4: using ghc-exactprint-1.7.1.0
  3011. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  3012. 1130.93 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  3013. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  3014. 1130.93 s [haskell-language-server] Dependency lens: using lens-5.3.5
  3015. 1130.93 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  3016. 1130.93 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  3017. 1130.93 s [haskell-language-server] Dependency parser-combinators: using parser-combinators-1.3.0
  3018. 1130.93 s [haskell-language-server] Dependency regex-applicative: using regex-applicative-0.3.4
  3019. 1130.93 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  3020. 1130.93 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  3021. 1130.93 s [haskell-language-server] Dependency text: using text-2.0.2
  3022. 1130.93 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  3023. 1130.93 s [haskell-language-server] Dependency time: using time-1.12.2
  3024. 1130.93 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  3025. 1130.93 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  3026. 1130.93 s [haskell-language-server] Dependency array: using array-0.5.8.0
  3027. 1130.93 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3028. 1130.93 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  3029. 1130.93 s [haskell-language-server] Dependency containers: using containers-0.6.7
  3030. 1130.93 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  3031. 1130.93 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  3032. 1130.93 s [haskell-language-server] Dependency dlist: using dlist-1.0
  3033. 1130.93 s [haskell-language-server] Dependency extra: using extra-1.8.1
  3034. 1130.93 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  3035. 1130.93 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  3036. 1130.93 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  3037. 1130.93 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  3038. 1130.93 s [haskell-language-server] Dependency lens: using lens-5.3.5
  3039. 1130.93 s [haskell-language-server] Dependency lsp >=2.6: using lsp-2.7.0.1
  3040. 1130.93 s [haskell-language-server] Dependency mtl >=2.2: using mtl-2.3.1
  3041. 1130.93 s [haskell-language-server] Dependency stm: using stm-2.5.1.0
  3042. 1130.93 s [haskell-language-server] Dependency stm-containers: using stm-containers-1.2.1.1
  3043. 1130.94 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  3044. 1130.94 s [haskell-language-server] Dependency template-haskell: using template-haskell-2.20.0.0
  3045. 1130.94 s [haskell-language-server] Dependency text: using text-2.0.2
  3046. 1130.94 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  3047. 1130.94 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  3048. 1130.94 s [haskell-language-server] Dependency array: using array-0.5.8.0
  3049. 1130.94 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3050. 1130.94 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  3051. 1130.94 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  3052. 1130.94 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  3053. 1130.94 s [haskell-language-server] Dependency lens: using lens-5.3.5
  3054. 1130.94 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  3055. 1130.94 s [haskell-language-server] Dependency mtl >=2.2: using mtl-2.3.1
  3056. 1130.94 s [haskell-language-server] Dependency regex-tdfa >=1.3.1: using regex-tdfa-1.3.2.5
  3057. 1130.94 s [haskell-language-server] Dependency text: using text-2.0.2
  3058. 1130.94 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  3059. 1130.94 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  3060. 1130.94 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  3061. 1130.94 s [haskell-language-server] Dependency async: using async-2.2.5
  3062. 1130.94 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3063. 1130.94 s [haskell-language-server] Dependency binary: using binary-0.8.9.1
  3064. 1130.94 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  3065. 1130.94 s [haskell-language-server] Dependency deepseq: using deepseq-1.4.8.1
  3066. 1130.94 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  3067. 1130.94 s [haskell-language-server] Dependency extra: using extra-1.8.1
  3068. 1130.94 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  3069. 1130.94 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  3070. 1130.94 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  3071. 1130.94 s [haskell-language-server] Dependency hls-test-utils: using hls-test-utils-2.12.0.0
  3072. 1130.94 s [haskell-language-server] Dependency lens: using lens-5.3.5
  3073. 1130.94 s [haskell-language-server] Dependency lsp-test: using lsp-test-0.17.1.1
  3074. 1130.94 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  3075. 1130.94 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  3076. 1130.94 s [haskell-language-server] Dependency parser-combinators: using parser-combinators-1.3.0
  3077. 1130.94 s [haskell-language-server] Dependency process: using process-1.6.19.0
  3078. 1130.94 s [haskell-language-server] Dependency row-types: using row-types-1.0.1.2
  3079. 1130.94 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  3080. 1130.94 s [haskell-language-server] Dependency shake: using shake-0.19.8
  3081. 1130.94 s [haskell-language-server] Dependency text: using text-2.0.2
  3082. 1130.94 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3083. 1130.94 s [haskell-language-server] Dependency haskell-language-server: using haskell-language-server-2.12.0.0
  3084. 1130.94 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  3085. 1130.94 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  3086. 1130.94 s [haskell-language-server] Dependency prettyprinter >=1.7: using prettyprinter-1.7.1
  3087. 1130.94 s [haskell-language-server] Dependency text: using text-2.0.2
  3088. 1130.94 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3089. 1130.94 s [haskell-language-server] Dependency containers: using containers-0.6.7
  3090. 1130.94 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  3091. 1130.94 s [haskell-language-server] Dependency directory: using directory-1.3.8.5
  3092. 1130.94 s [haskell-language-server] Dependency extra: using extra-1.8.1
  3093. 1130.94 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  3094. 1130.94 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  3095. 1130.94 s [haskell-language-server] Dependency haskell-language-server: using haskell-language-server-2.12.0.0
  3096. 1130.94 s [haskell-language-server] Dependency hie-bios: using hie-bios-0.17.0
  3097. 1130.94 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  3098. 1130.94 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  3099. 1130.94 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  3100. 1130.94 s [haskell-language-server] Dependency text: using text-2.0.2
  3101. 1130.94 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  3102. 1130.94 s [haskell-language-server] Dependency unix: using unix-2.8.6.0
  3103. 1130.94 s [haskell-language-server] Dependency unliftio-core: using unliftio-core-0.2.1.0
  3104. 1130.94 s [haskell-language-server] Dependency base >=4 && <5: using base-4.18.3.0
  3105. 1130.94 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  3106. 1130.94 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3107. 1130.94 s [haskell-language-server] Dependency bytestring: using bytestring-0.11.5.4
  3108. 1130.94 s [haskell-language-server] Dependency containers: using containers-0.6.7
  3109. 1130.94 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  3110. 1130.94 s [haskell-language-server] Dependency extra: using extra-1.8.1
  3111. 1130.94 s [haskell-language-server] Dependency filepath: using filepath-1.4.301.0
  3112. 1130.94 s [haskell-language-server] Dependency haskell-language-server:ghcide-bench-lib: using
  3113. 1130.94 s [haskell-language-server] haskell-language-server-2.12.0.0
  3114. 1130.94 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  3115. 1130.94 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  3116. 1130.94 s [haskell-language-server] Dependency hls-test-utils: using hls-test-utils-2.12.0.0
  3117. 1130.94 s [haskell-language-server] Dependency lens: using lens-5.3.5
  3118. 1130.94 s [haskell-language-server] Dependency lsp-test: using lsp-test-0.17.1.1
  3119. 1130.94 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  3120. 1130.94 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  3121. 1130.94 s [haskell-language-server] Dependency process: using process-1.6.19.0
  3122. 1130.94 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  3123. 1130.94 s [haskell-language-server] Dependency shake: using shake-0.19.8
  3124. 1130.94 s [haskell-language-server] Dependency tasty-hunit >=0.10: using tasty-hunit-0.10.2
  3125. 1130.94 s [haskell-language-server] Dependency text: using text-2.0.2
  3126. 1130.94 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  3127. 1130.94 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.18.3.0
  3128. 1130.94 s [haskell-language-server] Dependency containers: using containers-0.6.7
  3129. 1130.94 s [haskell-language-server] Dependency ghc: using ghc-9.6.7
  3130. 1130.94 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  3131. 1130.94 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  3132. 1130.94 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  3133. 1130.94 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  3134. 1130.94 s [haskell-language-server] Dependency markdown-unlit: using markdown-unlit-0.6.0
  3135. 1130.94 s [haskell-language-server] Dependency text: using text-2.0.2
  3136. 1130.94 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.0
  3137. 1130.94 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  3138. 1131.02 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 )
  3139. 1131.02 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 )
  3140. 1131.02 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 )
  3141. 1131.02 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 )
  3142. 1131.02 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 )
  3143. 1131.58 s [haskell-language-server] Source component graph:
  3144. 1131.58 s [haskell-language-server] component exe:plugin-tutorial
  3145. 1131.58 s [haskell-language-server] component exe:ghcide-test-preprocessor
  3146. 1131.58 s [haskell-language-server] component lib:hls-stylish-haskell-plugin
  3147. 1131.58 s [haskell-language-server] component lib:hls-stan-plugin
  3148. 1131.58 s [haskell-language-server] component lib:hls-signature-help-plugin
  3149. 1131.58 s [haskell-language-server] component lib:hls-semantic-tokens-plugin
  3150. 1131.58 s [haskell-language-server] component lib:hls-refactor-plugin
  3151. 1131.58 s [haskell-language-server] component lib:hls-rename-plugin dependency lib:hls-refactor-plugin
  3152. 1131.58 s [haskell-language-server] component lib:hls-retrie-plugin dependency lib:hls-refactor-plugin
  3153. 1131.58 s [haskell-language-server] component lib:hls-splice-plugin dependency lib:hls-refactor-plugin
  3154. 1131.58 s [haskell-language-server] component lib:hls-qualify-imported-names-plugin
  3155. 1131.58 s [haskell-language-server] component lib:hls-pragmas-plugin
  3156. 1131.58 s [haskell-language-server] component lib:hls-overloaded-record-dot-plugin
  3157. 1131.58 s [haskell-language-server] component lib:hls-ormolu-plugin
  3158. 1131.58 s [haskell-language-server] component lib:hls-notes-plugin
  3159. 1131.58 s [haskell-language-server] component lib:hls-module-name-plugin
  3160. 1131.58 s [haskell-language-server] component lib:hls-hlint-plugin
  3161. 1131.58 s [haskell-language-server] component lib:hls-gadt-plugin dependency lib:hls-refactor-plugin
  3162. 1131.58 s [haskell-language-server] component lib:hls-fourmolu-plugin
  3163. 1131.58 s [haskell-language-server] component lib:hls-floskell-plugin
  3164. 1131.58 s [haskell-language-server] component lib:hls-explicit-record-fields-plugin
  3165. 1131.58 s [haskell-language-server] component lib:hls-explicit-imports-plugin
  3166. 1131.58 s [haskell-language-server] component lib:hls-explicit-fixity-plugin
  3167. 1131.58 s [haskell-language-server] component lib:hls-eval-plugin
  3168. 1131.58 s [haskell-language-server] component lib:hls-code-range-plugin
  3169. 1131.58 s [haskell-language-server] component lib:hls-class-plugin
  3170. 1131.58 s [haskell-language-server] component lib:hls-change-type-signature-plugin
  3171. 1131.58 s [haskell-language-server] component lib:hls-call-hierarchy-plugin
  3172. 1131.58 s [haskell-language-server] component lib:hls-cabal-plugin
  3173. 1131.58 s [haskell-language-server] component lib:hls-cabal-gild-plugin
  3174. 1131.58 s [haskell-language-server] component lib:hls-cabal-fmt-plugin
  3175. 1131.58 s [haskell-language-server] component lib:hls-alternate-number-format-plugin
  3176. 1131.58 s [haskell-language-server] component lib:ghcide-bench-lib
  3177. 1131.58 s [haskell-language-server] component exe:ghcide-bench dependency lib:ghcide-bench-lib
  3178. 1131.58 s [haskell-language-server] component lib
  3179. 1131.58 s [haskell-language-server] dependency lib:hls-alternate-number-format-plugin
  3180. 1131.58 s [haskell-language-server] dependency lib:hls-cabal-fmt-plugin
  3181. 1131.58 s [haskell-language-server] dependency lib:hls-cabal-gild-plugin
  3182. 1131.58 s [haskell-language-server] dependency lib:hls-cabal-plugin
  3183. 1131.58 s [haskell-language-server] dependency lib:hls-call-hierarchy-plugin
  3184. 1131.58 s [haskell-language-server] dependency lib:hls-change-type-signature-plugin
  3185. 1131.58 s [haskell-language-server] dependency lib:hls-class-plugin
  3186. 1131.58 s [haskell-language-server] dependency lib:hls-code-range-plugin
  3187. 1131.58 s [haskell-language-server] dependency lib:hls-eval-plugin
  3188. 1131.59 s [haskell-language-server] dependency lib:hls-explicit-fixity-plugin
  3189. 1131.59 s [haskell-language-server] dependency lib:hls-explicit-imports-plugin
  3190. 1131.59 s [haskell-language-server] dependency lib:hls-explicit-record-fields-plugin
  3191. 1131.59 s [haskell-language-server] dependency lib:hls-floskell-plugin
  3192. 1131.59 s [haskell-language-server] dependency lib:hls-fourmolu-plugin
  3193. 1131.59 s [haskell-language-server] dependency lib:hls-gadt-plugin
  3194. 1131.59 s [haskell-language-server] dependency lib:hls-hlint-plugin
  3195. 1131.59 s [haskell-language-server] dependency lib:hls-module-name-plugin
  3196. 1131.59 s [haskell-language-server] dependency lib:hls-notes-plugin
  3197. 1131.59 s [haskell-language-server] dependency lib:hls-ormolu-plugin
  3198. 1131.59 s [haskell-language-server] dependency lib:hls-overloaded-record-dot-plugin
  3199. 1131.59 s [haskell-language-server] dependency lib:hls-pragmas-plugin
  3200. 1131.59 s [haskell-language-server] dependency lib:hls-qualify-imported-names-plugin
  3201. 1131.59 s [haskell-language-server] dependency lib:hls-refactor-plugin
  3202. 1131.59 s [haskell-language-server] dependency lib:hls-rename-plugin
  3203. 1131.59 s [haskell-language-server] dependency lib:hls-retrie-plugin
  3204. 1131.59 s [haskell-language-server] dependency lib:hls-semantic-tokens-plugin
  3205. 1131.59 s [haskell-language-server] dependency lib:hls-signature-help-plugin
  3206. 1131.59 s [haskell-language-server] dependency lib:hls-splice-plugin
  3207. 1131.59 s [haskell-language-server] dependency lib:hls-stan-plugin
  3208. 1131.59 s [haskell-language-server] dependency lib:hls-stylish-haskell-plugin
  3209. 1131.59 s [haskell-language-server] component exe:haskell-language-server dependency lib
  3210. 1131.59 s [haskell-language-server] component exe:haskell-language-server-wrapper dependency lib
  3211. 1131.59 s [haskell-language-server] Configured component graph:
  3212. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
  3213. 1131.59 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3214. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3215. 1131.59 s [haskell-language-server] include containers-0.6.7
  3216. 1131.59 s [haskell-language-server] include ghc-9.6.7
  3217. 1131.59 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3218. 1131.59 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3219. 1131.59 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3220. 1131.59 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3221. 1131.59 s [haskell-language-server] include markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
  3222. 1131.59 s [haskell-language-server] include text-2.0.2
  3223. 1131.59 s [haskell-language-server] include transformers-0.6.1.0
  3224. 1131.59 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3225. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
  3226. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3227. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  3228. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3229. 1131.59 s [haskell-language-server] include directory-1.3.8.5
  3230. 1131.59 s [haskell-language-server] include filepath-1.4.301.0
  3231. 1131.59 s [haskell-language-server] include ghc-boot-th-9.6.7
  3232. 1131.59 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3233. 1131.59 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3234. 1131.59 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3235. 1131.59 s [haskell-language-server] include mtl-2.3.1
  3236. 1131.59 s [haskell-language-server] include stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
  3237. 1131.59 s [haskell-language-server] include text-2.0.2
  3238. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  3239. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3240. 1131.59 s [haskell-language-server] include deepseq-1.4.8.1
  3241. 1131.59 s [haskell-language-server] include directory-1.3.8.5
  3242. 1131.59 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3243. 1131.59 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3244. 1131.59 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3245. 1131.59 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3246. 1131.59 s [haskell-language-server] include stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
  3247. 1131.59 s [haskell-language-server] include text-2.0.2
  3248. 1131.59 s [haskell-language-server] include trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
  3249. 1131.59 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3250. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  3251. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3252. 1131.59 s [haskell-language-server] include containers-0.6.7
  3253. 1131.59 s [haskell-language-server] include ghc-9.6.7
  3254. 1131.59 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3255. 1131.59 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3256. 1131.59 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3257. 1131.59 s [haskell-language-server] include text-2.0.2
  3258. 1131.59 s [haskell-language-server] include transformers-0.6.1.0
  3259. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  3260. 1131.59 s [haskell-language-server] include array-0.5.8.0
  3261. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3262. 1131.59 s [haskell-language-server] include bytestring-0.11.5.4
  3263. 1131.59 s [haskell-language-server] include containers-0.6.7
  3264. 1131.59 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  3265. 1131.59 s [haskell-language-server] include deepseq-1.4.8.1
  3266. 1131.59 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  3267. 1131.59 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3268. 1131.59 s [haskell-language-server] include ghc-9.6.7
  3269. 1131.59 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3270. 1131.59 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3271. 1131.59 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3272. 1131.59 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3273. 1131.59 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3274. 1131.59 s [haskell-language-server] include mtl-2.3.1
  3275. 1131.59 s [haskell-language-server] include stm-2.5.1.0
  3276. 1131.59 s [haskell-language-server] include stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
  3277. 1131.59 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3278. 1131.59 s [haskell-language-server] include template-haskell-2.20.0.0
  3279. 1131.59 s [haskell-language-server] include text-2.0.2
  3280. 1131.59 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3281. 1131.59 s [haskell-language-server] include transformers-0.6.1.0
  3282. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3283. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3284. 1131.59 s [haskell-language-server] include bytestring-0.11.5.4
  3285. 1131.59 s [haskell-language-server] include containers-0.6.7
  3286. 1131.59 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  3287. 1131.59 s [haskell-language-server] include deepseq-1.4.8.1
  3288. 1131.59 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  3289. 1131.59 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3290. 1131.59 s [haskell-language-server] include ghc-9.6.7
  3291. 1131.59 s [haskell-language-server] include ghc-boot-9.6.7
  3292. 1131.59 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  3293. 1131.59 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3294. 1131.59 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3295. 1131.59 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3296. 1131.59 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3297. 1131.59 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3298. 1131.59 s [haskell-language-server] include mtl-2.3.1
  3299. 1131.59 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  3300. 1131.59 s [haskell-language-server] include regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
  3301. 1131.59 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  3302. 1131.59 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3303. 1131.59 s [haskell-language-server] include text-2.0.2
  3304. 1131.59 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3305. 1131.59 s [haskell-language-server] include time-1.12.2
  3306. 1131.59 s [haskell-language-server] include transformers-0.6.1.0
  3307. 1131.59 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3308. 1131.59 s [haskell-language-server] component haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  3309. 1131.59 s [haskell-language-server] include base-4.18.3.0
  3310. 1131.59 s [haskell-language-server] include containers-0.6.7
  3311. 1131.59 s [haskell-language-server] include ghc-9.6.7
  3312. 1131.59 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3313. 1131.59 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3314. 1131.59 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3315. 1131.59 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  3316. 1131.59 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3317. 1131.59 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3318. 1131.59 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3319. 1131.59 s [haskell-language-server] include mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
  3320. 1131.59 s [haskell-language-server] include mtl-2.3.1
  3321. 1131.59 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3322. 1131.59 s [haskell-language-server] include text-2.0.2
  3323. 1131.59 s [haskell-language-server] include transformers-0.6.1.0
  3324. 1131.60 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3325. 1131.60 s [haskell-language-server] component haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  3326. 1131.60 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3327. 1131.60 s [haskell-language-server] include base-4.18.3.0
  3328. 1131.60 s [haskell-language-server] include bytestring-0.11.5.4
  3329. 1131.60 s [haskell-language-server] include containers-0.6.7
  3330. 1131.60 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3331. 1131.60 s [haskell-language-server] include ghc-9.6.7
  3332. 1131.60 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3333. 1131.60 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3334. 1131.60 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3335. 1131.60 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3336. 1131.60 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3337. 1131.60 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3338. 1131.60 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3339. 1131.60 s [haskell-language-server] include mtl-2.3.1
  3340. 1131.60 s [haskell-language-server] include retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
  3341. 1131.60 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  3342. 1131.60 s [haskell-language-server] include stm-2.5.1.0
  3343. 1131.60 s [haskell-language-server] include text-2.0.2
  3344. 1131.60 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3345. 1131.60 s [haskell-language-server] include transformers-0.6.1.0
  3346. 1131.60 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3347. 1131.61 s [haskell-language-server] component haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  3348. 1131.61 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3349. 1131.61 s [haskell-language-server] include base-4.18.3.0
  3350. 1131.61 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3351. 1131.61 s [haskell-language-server] include foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
  3352. 1131.61 s [haskell-language-server] include ghc-9.6.7
  3353. 1131.61 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3354. 1131.61 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3355. 1131.61 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3356. 1131.61 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3357. 1131.61 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3358. 1131.61 s [haskell-language-server] include mtl-2.3.1
  3359. 1131.61 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3360. 1131.61 s [haskell-language-server] include text-2.0.2
  3361. 1131.61 s [haskell-language-server] include transformers-0.6.1.0
  3362. 1131.61 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  3363. 1131.61 s [haskell-language-server] component haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  3364. 1131.61 s [haskell-language-server] include base-4.18.3.0
  3365. 1131.61 s [haskell-language-server] include containers-0.6.7
  3366. 1131.61 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  3367. 1131.61 s [haskell-language-server] include ghc-9.6.7
  3368. 1131.61 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3369. 1131.62 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3370. 1131.62 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3371. 1131.62 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3372. 1131.62 s [haskell-language-server] include text-2.0.2
  3373. 1131.62 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3374. 1131.62 s [haskell-language-server] include transformers-0.6.1.0
  3375. 1131.62 s [haskell-language-server] component haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  3376. 1131.62 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3377. 1131.62 s [haskell-language-server] include base-4.18.3.0
  3378. 1131.62 s [haskell-language-server] include containers-0.6.7
  3379. 1131.62 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3380. 1131.62 s [haskell-language-server] include fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
  3381. 1131.62 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3382. 1131.62 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3383. 1131.62 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3384. 1131.62 s [haskell-language-server] include lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
  3385. 1131.62 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3386. 1131.62 s [haskell-language-server] include text-2.0.2
  3387. 1131.63 s [haskell-language-server] include transformers-0.6.1.0
  3388. 1131.63 s [haskell-language-server] component haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  3389. 1131.63 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3390. 1131.63 s [haskell-language-server] include base-4.18.3.0
  3391. 1131.63 s [haskell-language-server] include containers-0.6.7
  3392. 1131.63 s [haskell-language-server] include deepseq-1.4.8.1
  3393. 1131.63 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3394. 1131.63 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3395. 1131.63 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3396. 1131.63 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3397. 1131.63 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3398. 1131.63 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3399. 1131.63 s [haskell-language-server] include text-2.0.2
  3400. 1131.63 s [haskell-language-server] include transformers-0.6.1.0
  3401. 1131.63 s [haskell-language-server] component haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  3402. 1131.63 s [haskell-language-server] include base-4.18.3.0
  3403. 1131.63 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3404. 1131.63 s [haskell-language-server] include filepath-1.4.301.0
  3405. 1131.63 s [haskell-language-server] include ghc-boot-th-9.6.7
  3406. 1131.63 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3407. 1131.63 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3408. 1131.63 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3409. 1131.63 s [haskell-language-server] include mtl-2.3.1
  3410. 1131.63 s [haskell-language-server] include ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
  3411. 1131.63 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  3412. 1131.63 s [haskell-language-server] include text-2.0.2
  3413. 1131.63 s [haskell-language-server] include transformers-0.6.1.0
  3414. 1131.63 s [haskell-language-server] component haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  3415. 1131.63 s [haskell-language-server] include array-0.5.8.0
  3416. 1131.63 s [haskell-language-server] include base-4.18.3.0
  3417. 1131.64 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3418. 1131.64 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3419. 1131.64 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3420. 1131.64 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3421. 1131.64 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3422. 1131.64 s [haskell-language-server] include mtl-2.3.1
  3423. 1131.64 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  3424. 1131.64 s [haskell-language-server] include text-2.0.2
  3425. 1131.64 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3426. 1131.64 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3427. 1131.64 s [haskell-language-server] component haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  3428. 1131.64 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3429. 1131.64 s [haskell-language-server] include base-4.18.3.0
  3430. 1131.64 s [haskell-language-server] include containers-0.6.7
  3431. 1131.64 s [haskell-language-server] include filepath-1.4.301.0
  3432. 1131.64 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3433. 1131.64 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3434. 1131.64 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3435. 1131.64 s [haskell-language-server] include text-2.0.2
  3436. 1131.64 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3437. 1131.64 s [haskell-language-server] include transformers-0.6.1.0
  3438. 1131.64 s [haskell-language-server] component haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  3439. 1131.64 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3440. 1131.64 s [haskell-language-server] include apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
  3441. 1131.64 s [haskell-language-server] include base-4.18.3.0
  3442. 1131.64 s [haskell-language-server] include bytestring-0.11.5.4
  3443. 1131.64 s [haskell-language-server] include containers-0.6.7
  3444. 1131.64 s [haskell-language-server] include deepseq-1.4.8.1
  3445. 1131.64 s [haskell-language-server] include filepath-1.4.301.0
  3446. 1131.64 s [haskell-language-server] include ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
  3447. 1131.64 s [haskell-language-server] include ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
  3448. 1131.64 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3449. 1131.64 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3450. 1131.64 s [haskell-language-server] include hlint-3.8-41jUuJncsTy84zuKEBa9b
  3451. 1131.64 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3452. 1131.64 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3453. 1131.64 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3454. 1131.64 s [haskell-language-server] include mtl-2.3.1
  3455. 1131.64 s [haskell-language-server] include refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
  3456. 1131.64 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  3457. 1131.64 s [haskell-language-server] include stm-2.5.1.0
  3458. 1131.64 s [haskell-language-server] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  3459. 1131.64 s [haskell-language-server] include text-2.0.2
  3460. 1131.64 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3461. 1131.64 s [haskell-language-server] include transformers-0.6.1.0
  3462. 1131.64 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3463. 1131.64 s [haskell-language-server] component haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  3464. 1131.64 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3465. 1131.64 s [haskell-language-server] include base-4.18.3.0
  3466. 1131.64 s [haskell-language-server] include containers-0.6.7
  3467. 1131.64 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3468. 1131.64 s [haskell-language-server] include ghc-9.6.7
  3469. 1131.64 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  3470. 1131.64 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3471. 1131.64 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3472. 1131.64 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3473. 1131.64 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3474. 1131.64 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3475. 1131.64 s [haskell-language-server] include mtl-2.3.1
  3476. 1131.64 s [haskell-language-server] include text-2.0.2
  3477. 1131.64 s [haskell-language-server] include transformers-0.6.1.0
  3478. 1131.64 s [haskell-language-server] component haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  3479. 1131.64 s [haskell-language-server] include base-4.18.3.0
  3480. 1131.64 s [haskell-language-server] include filepath-1.4.301.0
  3481. 1131.64 s [haskell-language-server] include fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
  3482. 1131.64 s [haskell-language-server] include ghc-boot-th-9.6.7
  3483. 1131.64 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3484. 1131.64 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3485. 1131.64 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3486. 1131.64 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3487. 1131.64 s [haskell-language-server] include mtl-2.3.1
  3488. 1131.64 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  3489. 1131.64 s [haskell-language-server] include text-2.0.2
  3490. 1131.64 s [haskell-language-server] include transformers-0.6.1.0
  3491. 1131.65 s [haskell-language-server] include yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
  3492. 1131.65 s [haskell-language-server] component haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  3493. 1131.65 s [haskell-language-server] include base-4.18.3.0
  3494. 1131.65 s [haskell-language-server] include floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
  3495. 1131.65 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3496. 1131.65 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3497. 1131.65 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3498. 1131.65 s [haskell-language-server] include mtl-2.3.1
  3499. 1131.65 s [haskell-language-server] include text-2.0.2
  3500. 1131.65 s [haskell-language-server] component haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  3501. 1131.65 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3502. 1131.65 s [haskell-language-server] include base-4.18.3.0
  3503. 1131.65 s [haskell-language-server] include containers-0.6.7
  3504. 1131.65 s [haskell-language-server] include ghc-9.6.7
  3505. 1131.65 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3506. 1131.65 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3507. 1131.65 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3508. 1131.65 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3509. 1131.65 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3510. 1131.65 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3511. 1131.65 s [haskell-language-server] include text-2.0.2
  3512. 1131.65 s [haskell-language-server] include transformers-0.6.1.0
  3513. 1131.65 s [haskell-language-server] component haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  3514. 1131.65 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3515. 1131.65 s [haskell-language-server] include base-4.18.3.0
  3516. 1131.65 s [haskell-language-server] include containers-0.6.7
  3517. 1131.65 s [haskell-language-server] include deepseq-1.4.8.1
  3518. 1131.65 s [haskell-language-server] include ghc-9.6.7
  3519. 1131.65 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3520. 1131.65 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3521. 1131.65 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3522. 1131.65 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3523. 1131.65 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3524. 1131.65 s [haskell-language-server] include mtl-2.3.1
  3525. 1131.65 s [haskell-language-server] include text-2.0.2
  3526. 1131.65 s [haskell-language-server] include transformers-0.6.1.0
  3527. 1131.65 s [haskell-language-server] component haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  3528. 1131.65 s [haskell-language-server] include base-4.18.3.0
  3529. 1131.65 s [haskell-language-server] include containers-0.6.7
  3530. 1131.65 s [haskell-language-server] include deepseq-1.4.8.1
  3531. 1131.65 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3532. 1131.65 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3533. 1131.65 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3534. 1131.65 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3535. 1131.65 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3536. 1131.65 s [haskell-language-server] include text-2.0.2
  3537. 1131.65 s [haskell-language-server] component haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  3538. 1131.65 s [haskell-language-server] include Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
  3539. 1131.65 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3540. 1131.65 s [haskell-language-server] include base-4.18.3.0
  3541. 1131.65 s [haskell-language-server] include bytestring-0.11.5.4
  3542. 1131.65 s [haskell-language-server] include containers-0.6.7
  3543. 1131.65 s [haskell-language-server] include deepseq-1.4.8.1
  3544. 1131.65 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  3545. 1131.65 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3546. 1131.66 s [haskell-language-server] include filepath-1.4.301.0
  3547. 1131.66 s [haskell-language-server] include ghc-9.6.7
  3548. 1131.66 s [haskell-language-server] include ghc-boot-th-9.6.7
  3549. 1131.66 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3550. 1131.66 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3551. 1131.66 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3552. 1131.66 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3553. 1131.66 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3554. 1131.66 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3555. 1131.66 s [haskell-language-server] include megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
  3556. 1131.66 s [haskell-language-server] include mtl-2.3.1
  3557. 1131.66 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  3558. 1131.66 s [haskell-language-server] include text-2.0.2
  3559. 1131.66 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3560. 1131.66 s [haskell-language-server] include transformers-0.6.1.0
  3561. 1131.66 s [haskell-language-server] include unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
  3562. 1131.66 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3563. 1131.66 s [haskell-language-server] component haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  3564. 1131.66 s [haskell-language-server] include base-4.18.3.0
  3565. 1131.66 s [haskell-language-server] include containers-0.6.7
  3566. 1131.66 s [haskell-language-server] include deepseq-1.4.8.1
  3567. 1131.66 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3568. 1131.66 s [haskell-language-server] include ghc-9.6.7
  3569. 1131.66 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3570. 1131.66 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3571. 1131.66 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3572. 1131.66 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3573. 1131.66 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3574. 1131.66 s [haskell-language-server] include mtl-2.3.1
  3575. 1131.66 s [haskell-language-server] include semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
  3576. 1131.66 s [haskell-language-server] include transformers-0.6.1.0
  3577. 1131.66 s [haskell-language-server] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  3578. 1131.66 s [haskell-language-server] component haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  3579. 1131.66 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3580. 1131.66 s [haskell-language-server] include base-4.18.3.0
  3581. 1131.66 s [haskell-language-server] include containers-0.6.7
  3582. 1131.66 s [haskell-language-server] include deepseq-1.4.8.1
  3583. 1131.66 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3584. 1131.66 s [haskell-language-server] include ghc-9.6.7
  3585. 1131.66 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  3586. 1131.66 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3587. 1131.66 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3588. 1131.66 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3589. 1131.66 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3590. 1131.66 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3591. 1131.66 s [haskell-language-server] include mtl-2.3.1
  3592. 1131.66 s [haskell-language-server] include text-2.0.2
  3593. 1131.66 s [haskell-language-server] include transformers-0.6.1.0
  3594. 1131.66 s [haskell-language-server] component haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  3595. 1131.66 s [haskell-language-server] include base-4.18.3.0
  3596. 1131.66 s [haskell-language-server] include containers-0.6.7
  3597. 1131.66 s [haskell-language-server] include ghc-9.6.7
  3598. 1131.66 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3599. 1131.66 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3600. 1131.66 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3601. 1131.66 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3602. 1131.66 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  3603. 1131.66 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3604. 1131.66 s [haskell-language-server] include text-2.0.2
  3605. 1131.66 s [haskell-language-server] include transformers-0.6.1.0
  3606. 1131.66 s [haskell-language-server] component haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  3607. 1131.66 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3608. 1131.66 s [haskell-language-server] include base-4.18.3.0
  3609. 1131.66 s [haskell-language-server] include containers-0.6.7
  3610. 1131.66 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3611. 1131.66 s [haskell-language-server] include ghc-9.6.7
  3612. 1131.66 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3613. 1131.66 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  3614. 1131.66 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3615. 1131.66 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3616. 1131.66 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3617. 1131.66 s [haskell-language-server] include sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
  3618. 1131.66 s [haskell-language-server] include text-2.0.2
  3619. 1131.66 s [haskell-language-server] component haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  3620. 1131.66 s [haskell-language-server] include Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
  3621. 1131.66 s [haskell-language-server] include Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
  3622. 1131.66 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3623. 1131.67 s [haskell-language-server] include base-4.18.3.0
  3624. 1131.67 s [haskell-language-server] include bytestring-0.11.5.4
  3625. 1131.67 s [haskell-language-server] include cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
  3626. 1131.67 s [haskell-language-server] include containers-0.6.7
  3627. 1131.67 s [haskell-language-server] include deepseq-1.4.8.1
  3628. 1131.67 s [haskell-language-server] include directory-1.3.8.5
  3629. 1131.67 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3630. 1131.67 s [haskell-language-server] include filepath-1.4.301.0
  3631. 1131.67 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3632. 1131.67 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3633. 1131.67 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3634. 1131.67 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3635. 1131.67 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3636. 1131.67 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3637. 1131.67 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3638. 1131.67 s [haskell-language-server] include mtl-2.3.1
  3639. 1131.67 s [haskell-language-server] include pretty-1.1.3.6
  3640. 1131.67 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  3641. 1131.67 s [haskell-language-server] include text-2.0.2
  3642. 1131.67 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3643. 1131.67 s [haskell-language-server] include transformers-0.6.1.0
  3644. 1131.67 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3645. 1131.67 s [haskell-language-server] component haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  3646. 1131.67 s [haskell-language-server] include base-4.18.3.0
  3647. 1131.67 s [haskell-language-server] include directory-1.3.8.5
  3648. 1131.67 s [haskell-language-server] include filepath-1.4.301.0
  3649. 1131.67 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3650. 1131.67 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3651. 1131.67 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3652. 1131.67 s [haskell-language-server] include mtl-2.3.1
  3653. 1131.67 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  3654. 1131.67 s [haskell-language-server] include text-2.0.2
  3655. 1131.67 s [haskell-language-server] component haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  3656. 1131.67 s [haskell-language-server] include base-4.18.3.0
  3657. 1131.67 s [haskell-language-server] include directory-1.3.8.5
  3658. 1131.67 s [haskell-language-server] include filepath-1.4.301.0
  3659. 1131.67 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3660. 1131.67 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3661. 1131.67 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3662. 1131.67 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3663. 1131.67 s [haskell-language-server] include mtl-2.3.1
  3664. 1131.67 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  3665. 1131.67 s [haskell-language-server] include text-2.0.2
  3666. 1131.67 s [haskell-language-server] component haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  3667. 1131.67 s [haskell-language-server] include base-4.18.3.0
  3668. 1131.67 s [haskell-language-server] include containers-0.6.7
  3669. 1131.67 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3670. 1131.67 s [haskell-language-server] include ghc-boot-th-9.6.7
  3671. 1131.67 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3672. 1131.67 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3673. 1131.67 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3674. 1131.67 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3675. 1131.67 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3676. 1131.67 s [haskell-language-server] include mtl-2.3.1
  3677. 1131.67 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  3678. 1131.67 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3679. 1131.67 s [haskell-language-server] include text-2.0.2
  3680. 1131.67 s [haskell-language-server] component haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  3681. 1131.67 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3682. 1131.67 s [haskell-language-server] include async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
  3683. 1131.67 s [haskell-language-server] include base-4.18.3.0
  3684. 1131.67 s [haskell-language-server] include binary-0.8.9.1
  3685. 1131.67 s [haskell-language-server] include bytestring-0.11.5.4
  3686. 1131.67 s [haskell-language-server] include deepseq-1.4.8.1
  3687. 1131.67 s [haskell-language-server] include directory-1.3.8.5
  3688. 1131.67 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3689. 1131.67 s [haskell-language-server] include filepath-1.4.301.0
  3690. 1131.67 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3691. 1131.67 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3692. 1131.67 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  3693. 1131.67 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3694. 1131.67 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  3695. 1131.67 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3696. 1131.67 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  3697. 1131.67 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  3698. 1131.67 s [haskell-language-server] include process-1.6.19.0
  3699. 1131.67 s [haskell-language-server] include row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
  3700. 1131.67 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  3701. 1131.67 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  3702. 1131.67 s [haskell-language-server] include text-2.0.2
  3703. 1131.67 s [haskell-language-server] component haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
  3704. 1131.67 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3705. 1131.67 s [haskell-language-server] include base-4.18.3.0
  3706. 1131.67 s [haskell-language-server] include bytestring-0.11.5.4
  3707. 1131.67 s [haskell-language-server] include containers-0.6.7
  3708. 1131.67 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  3709. 1131.67 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3710. 1131.67 s [haskell-language-server] include filepath-1.4.301.0
  3711. 1131.67 s [haskell-language-server] include haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  3712. 1131.67 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3713. 1131.67 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3714. 1131.67 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  3715. 1131.67 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3716. 1131.67 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  3717. 1131.67 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3718. 1131.67 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  3719. 1131.67 s [haskell-language-server] include process-1.6.19.0
  3720. 1131.67 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  3721. 1131.67 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  3722. 1131.67 s [haskell-language-server] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  3723. 1131.67 s [haskell-language-server] include text-2.0.2
  3724. 1131.67 s [haskell-language-server] component haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  3725. 1131.67 s [haskell-language-server] include aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
  3726. 1131.67 s [haskell-language-server] include base-4.18.3.0
  3727. 1131.67 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  3728. 1131.67 s [haskell-language-server] include directory-1.3.8.5
  3729. 1131.67 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3730. 1131.67 s [haskell-language-server] include filepath-1.4.301.0
  3731. 1131.67 s [haskell-language-server] include ghc-9.6.7
  3732. 1131.67 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3733. 1131.67 s [haskell-language-server] include githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
  3734. 1131.67 s [haskell-language-server] include haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  3735. 1131.67 s [haskell-language-server] include haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  3736. 1131.67 s [haskell-language-server] include haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  3737. 1131.67 s [haskell-language-server] include haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  3738. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  3739. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  3740. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  3741. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  3742. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  3743. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  3744. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  3745. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  3746. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  3747. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  3748. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  3749. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  3750. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  3751. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  3752. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  3753. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  3754. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  3755. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  3756. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3757. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  3758. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  3759. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  3760. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  3761. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  3762. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  3763. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  3764. 1131.68 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  3765. 1131.68 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3766. 1131.68 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  3767. 1131.68 s [haskell-language-server] include optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
  3768. 1131.68 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  3769. 1131.68 s [haskell-language-server] include process-1.6.19.0
  3770. 1131.68 s [haskell-language-server] include text-2.0.2
  3771. 1131.68 s [haskell-language-server] component haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
  3772. 1131.68 s [haskell-language-server] include base-4.18.3.0
  3773. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  3774. 1131.68 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3775. 1131.68 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3776. 1131.68 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  3777. 1131.68 s [haskell-language-server] include text-2.0.2
  3778. 1131.68 s [haskell-language-server] component haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
  3779. 1131.68 s [haskell-language-server] include base-4.18.3.0
  3780. 1131.68 s [haskell-language-server] include containers-0.6.7
  3781. 1131.68 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  3782. 1131.68 s [haskell-language-server] include directory-1.3.8.5
  3783. 1131.68 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3784. 1131.68 s [haskell-language-server] include filepath-1.4.301.0
  3785. 1131.68 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3786. 1131.68 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  3787. 1131.68 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  3788. 1131.68 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3789. 1131.74 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3790. 1131.74 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3791. 1131.74 s [haskell-language-server] include text-2.0.2
  3792. 1131.74 s [haskell-language-server] include transformers-0.6.1.0
  3793. 1131.74 s [haskell-language-server] include unix-2.8.6.0
  3794. 1131.74 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  3795. 1131.74 s [haskell-language-server] Linked component graph:
  3796. 1131.74 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
  3797. 1131.74 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3798. 1131.74 s [haskell-language-server] include base-4.18.3.0
  3799. 1131.74 s [haskell-language-server] include containers-0.6.7
  3800. 1131.74 s [haskell-language-server] include ghc-9.6.7
  3801. 1131.74 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3802. 1131.74 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3803. 1131.74 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3804. 1131.74 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3805. 1131.74 s [haskell-language-server] include markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
  3806. 1131.74 s [haskell-language-server] include text-2.0.2
  3807. 1131.74 s [haskell-language-server] include transformers-0.6.1.0
  3808. 1131.75 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3809. 1131.75 s [haskell-language-server] unit haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
  3810. 1131.75 s [haskell-language-server] include base-4.18.3.0
  3811. 1131.75 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  3812. 1131.75 s [haskell-language-server] include base-4.18.3.0
  3813. 1131.75 s [haskell-language-server] include directory-1.3.8.5
  3814. 1131.75 s [haskell-language-server] include filepath-1.4.301.0
  3815. 1131.75 s [haskell-language-server] include ghc-boot-th-9.6.7
  3816. 1131.75 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3817. 1131.75 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3818. 1131.75 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3819. 1131.75 s [haskell-language-server] include mtl-2.3.1
  3820. 1131.75 s [haskell-language-server] include stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
  3821. 1131.75 s [haskell-language-server] include text-2.0.2
  3822. 1131.75 s [haskell-language-server] Ide.Plugin.StylishHaskell=haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin:Ide.Plugin.StylishHaskell
  3823. 1131.75 s [haskell-language-server] unit haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  3824. 1131.75 s [haskell-language-server] include base-4.18.3.0
  3825. 1131.75 s [haskell-language-server] include deepseq-1.4.8.1
  3826. 1131.75 s [haskell-language-server] include directory-1.3.8.5
  3827. 1131.75 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3828. 1131.75 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3829. 1131.75 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3830. 1131.75 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3831. 1131.75 s [haskell-language-server] include stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
  3832. 1131.75 s [haskell-language-server] include text-2.0.2
  3833. 1131.75 s [haskell-language-server] include trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
  3834. 1131.75 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3835. 1131.75 s [haskell-language-server] Ide.Plugin.Stan=haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin:Ide.Plugin.Stan
  3836. 1131.75 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  3837. 1131.75 s [haskell-language-server] include base-4.18.3.0
  3838. 1131.75 s [haskell-language-server] include containers-0.6.7
  3839. 1131.75 s [haskell-language-server] include ghc-9.6.7
  3840. 1131.75 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3841. 1131.75 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3842. 1131.75 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3843. 1131.75 s [haskell-language-server] include text-2.0.2
  3844. 1131.75 s [haskell-language-server] include transformers-0.6.1.0
  3845. 1131.75 s [haskell-language-server] Ide.Plugin.SignatureHelp=haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin:Ide.Plugin.SignatureHelp
  3846. 1131.75 s [haskell-language-server] unit haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  3847. 1131.75 s [haskell-language-server] include array-0.5.8.0
  3848. 1131.75 s [haskell-language-server] include base-4.18.3.0
  3849. 1131.75 s [haskell-language-server] include bytestring-0.11.5.4
  3850. 1131.76 s [haskell-language-server] include containers-0.6.7
  3851. 1131.76 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  3852. 1131.76 s [haskell-language-server] include deepseq-1.4.8.1
  3853. 1131.76 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  3854. 1131.76 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3855. 1131.76 s [haskell-language-server] include ghc-9.6.7
  3856. 1131.76 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3857. 1131.76 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3858. 1131.76 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3859. 1131.76 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3860. 1131.76 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3861. 1131.76 s [haskell-language-server] include mtl-2.3.1
  3862. 1131.76 s [haskell-language-server] include stm-2.5.1.0
  3863. 1131.76 s [haskell-language-server] include stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
  3864. 1131.76 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3865. 1131.76 s [haskell-language-server] include template-haskell-2.20.0.0
  3866. 1131.76 s [haskell-language-server] include text-2.0.2
  3867. 1131.76 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3868. 1131.76 s [haskell-language-server] include transformers-0.6.1.0
  3869. 1131.76 s [haskell-language-server] Ide.Plugin.SemanticTokens=haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens,Ide.Plugin.SemanticTokens.Mappings=haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens.Mappings,Ide.Plugin.SemanticTokens.Types=haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens.Types
  3870. 1131.76 s [haskell-language-server] unit haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3871. 1131.76 s [haskell-language-server] include base-4.18.3.0
  3872. 1131.76 s [haskell-language-server] include bytestring-0.11.5.4
  3873. 1131.76 s [haskell-language-server] include containers-0.6.7
  3874. 1131.76 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  3875. 1131.76 s [haskell-language-server] include deepseq-1.4.8.1
  3876. 1131.76 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  3877. 1131.76 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3878. 1131.76 s [haskell-language-server] include ghc-9.6.7
  3879. 1131.76 s [haskell-language-server] include ghc-boot-9.6.7
  3880. 1131.76 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  3881. 1131.76 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3882. 1131.76 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3883. 1131.76 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3884. 1131.76 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3885. 1131.76 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3886. 1131.76 s [haskell-language-server] include mtl-2.3.1
  3887. 1131.76 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  3888. 1131.77 s [haskell-language-server] include regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
  3889. 1131.77 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  3890. 1131.77 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3891. 1131.77 s [haskell-language-server] include text-2.0.2
  3892. 1131.77 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3893. 1131.77 s [haskell-language-server] include time-1.12.2
  3894. 1131.77 s [haskell-language-server] include transformers-0.6.1.0
  3895. 1131.77 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3896. 1131.77 s [haskell-language-server] Development.IDE.GHC.Compat.ExactPrint=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.GHC.Compat.ExactPrint,Development.IDE.GHC.Dump=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.GHC.Dump,Development.IDE.GHC.ExactPrint=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.GHC.ExactPrint,Development.IDE.Plugin.CodeAction=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.Plugin.CodeAction,Development.IDE.Plugin.CodeAction.Util=haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin:Development.IDE.Plugin.CodeAction.Util
  3897. 1131.77 s [haskell-language-server] unit haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  3898. 1131.77 s [haskell-language-server] include base-4.18.3.0
  3899. 1131.77 s [haskell-language-server] include containers-0.6.7
  3900. 1131.77 s [haskell-language-server] include ghc-9.6.7
  3901. 1131.77 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3902. 1131.77 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3903. 1131.77 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3904. 1131.77 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  3905. 1131.77 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3906. 1131.77 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3907. 1131.77 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3908. 1131.77 s [haskell-language-server] include mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
  3909. 1131.77 s [haskell-language-server] include mtl-2.3.1
  3910. 1131.77 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3911. 1131.77 s [haskell-language-server] include text-2.0.2
  3912. 1131.77 s [haskell-language-server] include transformers-0.6.1.0
  3913. 1131.77 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3914. 1131.77 s [haskell-language-server] Ide.Plugin.Rename=haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin:Ide.Plugin.Rename
  3915. 1131.77 s [haskell-language-server] unit haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  3916. 1131.77 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3917. 1131.77 s [haskell-language-server] include base-4.18.3.0
  3918. 1131.77 s [haskell-language-server] include bytestring-0.11.5.4
  3919. 1131.77 s [haskell-language-server] include containers-0.6.7
  3920. 1131.77 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3921. 1131.77 s [haskell-language-server] include ghc-9.6.7
  3922. 1131.77 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3923. 1131.77 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  3924. 1131.77 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3925. 1131.77 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3926. 1131.77 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3927. 1131.77 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3928. 1131.77 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  3929. 1131.77 s [haskell-language-server] include mtl-2.3.1
  3930. 1131.77 s [haskell-language-server] include retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
  3931. 1131.77 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  3932. 1131.77 s [haskell-language-server] include stm-2.5.1.0
  3933. 1131.77 s [haskell-language-server] include text-2.0.2
  3934. 1131.77 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3935. 1131.77 s [haskell-language-server] include transformers-0.6.1.0
  3936. 1131.77 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  3937. 1131.77 s [haskell-language-server] Ide.Plugin.Retrie=haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin:Ide.Plugin.Retrie
  3938. 1131.77 s [haskell-language-server] unit haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  3939. 1131.77 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3940. 1131.77 s [haskell-language-server] include base-4.18.3.0
  3941. 1131.78 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3942. 1131.78 s [haskell-language-server] include foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
  3943. 1131.78 s [haskell-language-server] include ghc-9.6.7
  3944. 1131.78 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3945. 1131.78 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  3946. 1131.78 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3947. 1131.78 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3948. 1131.78 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3949. 1131.78 s [haskell-language-server] include mtl-2.3.1
  3950. 1131.78 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3951. 1131.78 s [haskell-language-server] include text-2.0.2
  3952. 1131.78 s [haskell-language-server] include transformers-0.6.1.0
  3953. 1131.78 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  3954. 1131.78 s [haskell-language-server] Ide.Plugin.Splice=haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin:Ide.Plugin.Splice,Ide.Plugin.Splice.Types=haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin:Ide.Plugin.Splice.Types
  3955. 1131.78 s [haskell-language-server] unit haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  3956. 1131.78 s [haskell-language-server] include base-4.18.3.0
  3957. 1131.78 s [haskell-language-server] include containers-0.6.7
  3958. 1131.78 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  3959. 1131.78 s [haskell-language-server] include ghc-9.6.7
  3960. 1131.78 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3961. 1131.78 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3962. 1131.78 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3963. 1131.78 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3964. 1131.78 s [haskell-language-server] include text-2.0.2
  3965. 1131.78 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  3966. 1131.78 s [haskell-language-server] include transformers-0.6.1.0
  3967. 1131.78 s [haskell-language-server] Ide.Plugin.QualifyImportedNames=haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin:Ide.Plugin.QualifyImportedNames
  3968. 1131.78 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  3969. 1131.78 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3970. 1131.78 s [haskell-language-server] include base-4.18.3.0
  3971. 1131.78 s [haskell-language-server] include containers-0.6.7
  3972. 1131.78 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3973. 1131.78 s [haskell-language-server] include fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
  3974. 1131.78 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3975. 1131.78 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3976. 1131.78 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3977. 1131.78 s [haskell-language-server] include lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
  3978. 1131.78 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3979. 1131.78 s [haskell-language-server] include text-2.0.2
  3980. 1131.78 s [haskell-language-server] include transformers-0.6.1.0
  3981. 1131.78 s [haskell-language-server] Ide.Plugin.Pragmas=haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin:Ide.Plugin.Pragmas
  3982. 1131.78 s [haskell-language-server] unit haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  3983. 1131.78 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  3984. 1131.78 s [haskell-language-server] include base-4.18.3.0
  3985. 1131.78 s [haskell-language-server] include containers-0.6.7
  3986. 1131.78 s [haskell-language-server] include deepseq-1.4.8.1
  3987. 1131.78 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  3988. 1131.78 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  3989. 1131.78 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  3990. 1131.78 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  3991. 1131.78 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  3992. 1131.78 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3993. 1131.78 s [haskell-language-server] include text-2.0.2
  3994. 1131.78 s [haskell-language-server] include transformers-0.6.1.0
  3995. 1131.78 s [haskell-language-server] Ide.Plugin.OverloadedRecordDot=haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin:Ide.Plugin.OverloadedRecordDot
  3996. 1131.78 s [haskell-language-server] unit haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  3997. 1131.78 s [haskell-language-server] include base-4.18.3.0
  3998. 1131.78 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  3999. 1131.78 s [haskell-language-server] include filepath-1.4.301.0
  4000. 1131.78 s [haskell-language-server] include ghc-boot-th-9.6.7
  4001. 1131.78 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4002. 1131.78 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4003. 1131.78 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4004. 1131.78 s [haskell-language-server] include mtl-2.3.1
  4005. 1131.78 s [haskell-language-server] include ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
  4006. 1131.78 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4007. 1131.78 s [haskell-language-server] include text-2.0.2
  4008. 1131.78 s [haskell-language-server] include transformers-0.6.1.0
  4009. 1131.78 s [haskell-language-server] Ide.Plugin.Ormolu=haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin:Ide.Plugin.Ormolu
  4010. 1131.78 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  4011. 1131.78 s [haskell-language-server] include array-0.5.8.0
  4012. 1131.78 s [haskell-language-server] include base-4.18.3.0
  4013. 1131.78 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4014. 1131.79 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4015. 1131.79 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4016. 1131.79 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4017. 1131.79 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4018. 1131.79 s [haskell-language-server] include mtl-2.3.1
  4019. 1131.79 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4020. 1131.79 s [haskell-language-server] include text-2.0.2
  4021. 1131.79 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4022. 1131.79 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4023. 1131.79 s [haskell-language-server] Ide.Plugin.Notes=haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin:Ide.Plugin.Notes
  4024. 1131.79 s [haskell-language-server] unit haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  4025. 1131.79 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4026. 1131.79 s [haskell-language-server] include base-4.18.3.0
  4027. 1131.79 s [haskell-language-server] include containers-0.6.7
  4028. 1131.79 s [haskell-language-server] include filepath-1.4.301.0
  4029. 1131.79 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4030. 1131.79 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4031. 1131.79 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4032. 1131.79 s [haskell-language-server] include text-2.0.2
  4033. 1131.79 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4034. 1131.79 s [haskell-language-server] include transformers-0.6.1.0
  4035. 1131.79 s [haskell-language-server] Ide.Plugin.ModuleName=haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin:Ide.Plugin.ModuleName
  4036. 1131.79 s [haskell-language-server] unit haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  4037. 1131.79 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4038. 1131.79 s [haskell-language-server] include apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
  4039. 1131.79 s [haskell-language-server] include base-4.18.3.0
  4040. 1131.79 s [haskell-language-server] include bytestring-0.11.5.4
  4041. 1131.79 s [haskell-language-server] include containers-0.6.7
  4042. 1131.79 s [haskell-language-server] include deepseq-1.4.8.1
  4043. 1131.79 s [haskell-language-server] include filepath-1.4.301.0
  4044. 1131.79 s [haskell-language-server] include ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
  4045. 1131.79 s [haskell-language-server] include ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
  4046. 1131.79 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4047. 1131.79 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4048. 1131.79 s [haskell-language-server] include hlint-3.8-41jUuJncsTy84zuKEBa9b
  4049. 1131.79 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4050. 1131.79 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4051. 1131.79 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4052. 1131.79 s [haskell-language-server] include mtl-2.3.1
  4053. 1131.79 s [haskell-language-server] include refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
  4054. 1131.79 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4055. 1131.79 s [haskell-language-server] include stm-2.5.1.0
  4056. 1131.79 s [haskell-language-server] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  4057. 1131.79 s [haskell-language-server] include text-2.0.2
  4058. 1131.79 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4059. 1131.79 s [haskell-language-server] include transformers-0.6.1.0
  4060. 1131.79 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4061. 1131.79 s [haskell-language-server] Ide.Plugin.Hlint=haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin:Ide.Plugin.Hlint
  4062. 1131.79 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  4063. 1131.79 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4064. 1131.79 s [haskell-language-server] include base-4.18.3.0
  4065. 1131.79 s [haskell-language-server] include containers-0.6.7
  4066. 1131.79 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4067. 1131.79 s [haskell-language-server] include ghc-9.6.7
  4068. 1131.79 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  4069. 1131.79 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4070. 1131.79 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4071. 1131.79 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4072. 1131.79 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4073. 1131.79 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4074. 1131.79 s [haskell-language-server] include mtl-2.3.1
  4075. 1131.79 s [haskell-language-server] include text-2.0.2
  4076. 1131.79 s [haskell-language-server] include transformers-0.6.1.0
  4077. 1131.79 s [haskell-language-server] Ide.Plugin.GADT=haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin:Ide.Plugin.GADT
  4078. 1131.79 s [haskell-language-server] unit haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  4079. 1131.79 s [haskell-language-server] include base-4.18.3.0
  4080. 1131.79 s [haskell-language-server] include filepath-1.4.301.0
  4081. 1131.79 s [haskell-language-server] include fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
  4082. 1131.79 s [haskell-language-server] include ghc-boot-th-9.6.7
  4083. 1131.79 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4084. 1131.79 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4085. 1131.79 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4086. 1131.79 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4087. 1131.79 s [haskell-language-server] include mtl-2.3.1
  4088. 1131.79 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4089. 1131.79 s [haskell-language-server] include text-2.0.2
  4090. 1131.79 s [haskell-language-server] include transformers-0.6.1.0
  4091. 1131.79 s [haskell-language-server] include yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
  4092. 1131.79 s [haskell-language-server] Ide.Plugin.Fourmolu=haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin:Ide.Plugin.Fourmolu
  4093. 1131.79 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  4094. 1131.79 s [haskell-language-server] include base-4.18.3.0
  4095. 1131.79 s [haskell-language-server] include floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
  4096. 1131.79 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4097. 1131.79 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4098. 1131.79 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4099. 1131.79 s [haskell-language-server] include mtl-2.3.1
  4100. 1131.79 s [haskell-language-server] include text-2.0.2
  4101. 1131.79 s [haskell-language-server] Ide.Plugin.Floskell=haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin:Ide.Plugin.Floskell
  4102. 1131.79 s [haskell-language-server] unit haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  4103. 1131.79 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4104. 1131.79 s [haskell-language-server] include base-4.18.3.0
  4105. 1131.79 s [haskell-language-server] include containers-0.6.7
  4106. 1131.80 s [haskell-language-server] include ghc-9.6.7
  4107. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4108. 1131.80 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4109. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4110. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4111. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4112. 1131.80 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4113. 1131.80 s [haskell-language-server] include text-2.0.2
  4114. 1131.80 s [haskell-language-server] include transformers-0.6.1.0
  4115. 1131.80 s [haskell-language-server] Ide.Plugin.ExplicitFields=haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin:Ide.Plugin.ExplicitFields
  4116. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  4117. 1131.80 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4118. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4119. 1131.80 s [haskell-language-server] include containers-0.6.7
  4120. 1131.80 s [haskell-language-server] include deepseq-1.4.8.1
  4121. 1131.80 s [haskell-language-server] include ghc-9.6.7
  4122. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4123. 1131.80 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4124. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4125. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4126. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4127. 1131.80 s [haskell-language-server] include mtl-2.3.1
  4128. 1131.80 s [haskell-language-server] include text-2.0.2
  4129. 1131.80 s [haskell-language-server] include transformers-0.6.1.0
  4130. 1131.80 s [haskell-language-server] Ide.Plugin.ExplicitImports=haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin:Ide.Plugin.ExplicitImports
  4131. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  4132. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4133. 1131.80 s [haskell-language-server] include containers-0.6.7
  4134. 1131.80 s [haskell-language-server] include deepseq-1.4.8.1
  4135. 1131.80 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4136. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4137. 1131.80 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4138. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4139. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4140. 1131.80 s [haskell-language-server] include text-2.0.2
  4141. 1131.80 s [haskell-language-server] Ide.Plugin.ExplicitFixity=haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin:Ide.Plugin.ExplicitFixity
  4142. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  4143. 1131.80 s [haskell-language-server] include Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
  4144. 1131.80 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4145. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4146. 1131.80 s [haskell-language-server] include bytestring-0.11.5.4
  4147. 1131.80 s [haskell-language-server] include containers-0.6.7
  4148. 1131.80 s [haskell-language-server] include deepseq-1.4.8.1
  4149. 1131.80 s [haskell-language-server] include dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  4150. 1131.80 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4151. 1131.80 s [haskell-language-server] include filepath-1.4.301.0
  4152. 1131.80 s [haskell-language-server] include ghc-9.6.7
  4153. 1131.80 s [haskell-language-server] include ghc-boot-th-9.6.7
  4154. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4155. 1131.80 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4156. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4157. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4158. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4159. 1131.80 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4160. 1131.80 s [haskell-language-server] include megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
  4161. 1131.80 s [haskell-language-server] include mtl-2.3.1
  4162. 1131.80 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  4163. 1131.80 s [haskell-language-server] include text-2.0.2
  4164. 1131.80 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4165. 1131.80 s [haskell-language-server] include transformers-0.6.1.0
  4166. 1131.80 s [haskell-language-server] include unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
  4167. 1131.80 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4168. 1131.80 s [haskell-language-server] Ide.Plugin.Eval=haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin:Ide.Plugin.Eval,Ide.Plugin.Eval.Types=haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin:Ide.Plugin.Eval.Types
  4169. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  4170. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4171. 1131.80 s [haskell-language-server] include containers-0.6.7
  4172. 1131.80 s [haskell-language-server] include deepseq-1.4.8.1
  4173. 1131.80 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4174. 1131.80 s [haskell-language-server] include ghc-9.6.7
  4175. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4176. 1131.80 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4177. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4178. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4179. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4180. 1131.80 s [haskell-language-server] include mtl-2.3.1
  4181. 1131.80 s [haskell-language-server] include semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
  4182. 1131.80 s [haskell-language-server] include transformers-0.6.1.0
  4183. 1131.80 s [haskell-language-server] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4184. 1131.80 s [haskell-language-server] Ide.Plugin.CodeRange=haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin:Ide.Plugin.CodeRange,Ide.Plugin.CodeRange.Rules=haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin:Ide.Plugin.CodeRange.Rules
  4185. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  4186. 1131.80 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4187. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4188. 1131.80 s [haskell-language-server] include containers-0.6.7
  4189. 1131.80 s [haskell-language-server] include deepseq-1.4.8.1
  4190. 1131.80 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4191. 1131.80 s [haskell-language-server] include ghc-9.6.7
  4192. 1131.80 s [haskell-language-server] include ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  4193. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4194. 1131.80 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4195. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4196. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4197. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4198. 1131.80 s [haskell-language-server] include mtl-2.3.1
  4199. 1131.80 s [haskell-language-server] include text-2.0.2
  4200. 1131.80 s [haskell-language-server] include transformers-0.6.1.0
  4201. 1131.80 s [haskell-language-server] Ide.Plugin.Class=haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin:Ide.Plugin.Class
  4202. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  4203. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4204. 1131.80 s [haskell-language-server] include containers-0.6.7
  4205. 1131.80 s [haskell-language-server] include ghc-9.6.7
  4206. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4207. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4208. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4209. 1131.80 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4210. 1131.80 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4211. 1131.80 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4212. 1131.80 s [haskell-language-server] include text-2.0.2
  4213. 1131.80 s [haskell-language-server] include transformers-0.6.1.0
  4214. 1131.80 s [haskell-language-server] Ide.Plugin.ChangeTypeSignature=haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin:Ide.Plugin.ChangeTypeSignature
  4215. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  4216. 1131.80 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4217. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4218. 1131.80 s [haskell-language-server] include containers-0.6.7
  4219. 1131.80 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4220. 1131.80 s [haskell-language-server] include ghc-9.6.7
  4221. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4222. 1131.80 s [haskell-language-server] include hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  4223. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4224. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4225. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4226. 1131.80 s [haskell-language-server] include sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
  4227. 1131.80 s [haskell-language-server] include text-2.0.2
  4228. 1131.80 s [haskell-language-server] Ide.Plugin.CallHierarchy=haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin:Ide.Plugin.CallHierarchy
  4229. 1131.80 s [haskell-language-server] unit haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  4230. 1131.80 s [haskell-language-server] include Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
  4231. 1131.80 s [haskell-language-server] include Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
  4232. 1131.80 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4233. 1131.80 s [haskell-language-server] include base-4.18.3.0
  4234. 1131.80 s [haskell-language-server] include bytestring-0.11.5.4
  4235. 1131.80 s [haskell-language-server] include cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
  4236. 1131.80 s [haskell-language-server] include containers-0.6.7
  4237. 1131.80 s [haskell-language-server] include deepseq-1.4.8.1
  4238. 1131.80 s [haskell-language-server] include directory-1.3.8.5
  4239. 1131.80 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4240. 1131.80 s [haskell-language-server] include filepath-1.4.301.0
  4241. 1131.80 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4242. 1131.80 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4243. 1131.80 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4244. 1131.80 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4245. 1131.80 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4246. 1131.80 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4247. 1131.80 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4248. 1131.80 s [haskell-language-server] include mtl-2.3.1
  4249. 1131.80 s [haskell-language-server] include pretty-1.1.3.6
  4250. 1131.80 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4251. 1131.81 s [haskell-language-server] include text-2.0.2
  4252. 1131.81 s [haskell-language-server] include text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4253. 1131.81 s [haskell-language-server] include transformers-0.6.1.0
  4254. 1131.81 s [haskell-language-server] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4255. 1131.81 s [haskell-language-server] Ide.Plugin.Cabal=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal,Ide.Plugin.Cabal.CabalAdd.CodeAction=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.CodeAction,Ide.Plugin.Cabal.CabalAdd.Command=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.Command,Ide.Plugin.Cabal.CabalAdd.Types=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.Types,Ide.Plugin.Cabal.Completion.CabalFields=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.CabalFields,Ide.Plugin.Cabal.Completion.Completer.FilePath=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.FilePath,Ide.Plugin.Cabal.Completion.Completer.Module=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Module,Ide.Plugin.Cabal.Completion.Completer.Paths=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Paths,Ide.Plugin.Cabal.Completion.Completer.Simple=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Simple,Ide.Plugin.Cabal.Completion.Completer.Snippet=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Snippet,Ide.Plugin.Cabal.Completion.Completer.Types=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Types,Ide.Plugin.Cabal.Completion.Completions=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completions,Ide.Plugin.Cabal.Completion.Data=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Data,Ide.Plugin.Cabal.Completion.Types=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Types,Ide.Plugin.Cabal.Definition=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Definition,Ide.Plugin.Cabal.Diagnostics=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Diagnostics,Ide.Plugin.Cabal.FieldSuggest=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.FieldSuggest,Ide.Plugin.Cabal.Files=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Files,Ide.Plugin.Cabal.LicenseSuggest=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.LicenseSuggest,Ide.Plugin.Cabal.OfInterest=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.OfInterest,Ide.Plugin.Cabal.Orphans=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Orphans,Ide.Plugin.Cabal.Outline=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Outline,Ide.Plugin.Cabal.Parse=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Parse,Ide.Plugin.Cabal.Rules=haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin:Ide.Plugin.Cabal.Rules
  4256. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  4257. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4258. 1131.81 s [haskell-language-server] include directory-1.3.8.5
  4259. 1131.81 s [haskell-language-server] include filepath-1.4.301.0
  4260. 1131.81 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4261. 1131.81 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4262. 1131.81 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4263. 1131.81 s [haskell-language-server] include mtl-2.3.1
  4264. 1131.81 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4265. 1131.81 s [haskell-language-server] include text-2.0.2
  4266. 1131.81 s [haskell-language-server] Ide.Plugin.CabalGild=haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin:Ide.Plugin.CabalGild
  4267. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  4268. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4269. 1131.81 s [haskell-language-server] include directory-1.3.8.5
  4270. 1131.81 s [haskell-language-server] include filepath-1.4.301.0
  4271. 1131.81 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4272. 1131.81 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4273. 1131.81 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4274. 1131.81 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4275. 1131.81 s [haskell-language-server] include mtl-2.3.1
  4276. 1131.81 s [haskell-language-server] include process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4277. 1131.81 s [haskell-language-server] include text-2.0.2
  4278. 1131.81 s [haskell-language-server] Ide.Plugin.CabalFmt=haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin:Ide.Plugin.CabalFmt
  4279. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  4280. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4281. 1131.81 s [haskell-language-server] include containers-0.6.7
  4282. 1131.81 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4283. 1131.81 s [haskell-language-server] include ghc-boot-th-9.6.7
  4284. 1131.81 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4285. 1131.81 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4286. 1131.81 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4287. 1131.81 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4288. 1131.81 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4289. 1131.81 s [haskell-language-server] include mtl-2.3.1
  4290. 1131.81 s [haskell-language-server] include regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4291. 1131.81 s [haskell-language-server] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4292. 1131.81 s [haskell-language-server] include text-2.0.2
  4293. 1131.81 s [haskell-language-server] Ide.Plugin.AlternateNumberFormat=haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin:Ide.Plugin.AlternateNumberFormat,Ide.Plugin.Conversion=haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin:Ide.Plugin.Conversion
  4294. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  4295. 1131.81 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4296. 1131.81 s [haskell-language-server] include async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
  4297. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4298. 1131.81 s [haskell-language-server] include binary-0.8.9.1
  4299. 1131.81 s [haskell-language-server] include bytestring-0.11.5.4
  4300. 1131.81 s [haskell-language-server] include deepseq-1.4.8.1
  4301. 1131.81 s [haskell-language-server] include directory-1.3.8.5
  4302. 1131.81 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4303. 1131.81 s [haskell-language-server] include filepath-1.4.301.0
  4304. 1131.81 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4305. 1131.81 s [haskell-language-server] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4306. 1131.81 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  4307. 1131.81 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4308. 1131.81 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  4309. 1131.81 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4310. 1131.81 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  4311. 1131.81 s [haskell-language-server] include parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  4312. 1131.81 s [haskell-language-server] include process-1.6.19.0
  4313. 1131.81 s [haskell-language-server] include row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
  4314. 1131.81 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  4315. 1131.81 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  4316. 1131.81 s [haskell-language-server] include text-2.0.2
  4317. 1131.81 s [haskell-language-server] Experiments=haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib:Experiments,Experiments.Types=haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib:Experiments.Types
  4318. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
  4319. 1131.81 s [haskell-language-server] include aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4320. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4321. 1131.81 s [haskell-language-server] include bytestring-0.11.5.4
  4322. 1131.81 s [haskell-language-server] include containers-0.6.7
  4323. 1131.81 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4324. 1131.81 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4325. 1131.81 s [haskell-language-server] include filepath-1.4.301.0
  4326. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  4327. 1131.81 s [haskell-language-server] include hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4328. 1131.81 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4329. 1131.81 s [haskell-language-server] include hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  4330. 1131.81 s [haskell-language-server] include lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4331. 1131.81 s [haskell-language-server] include lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  4332. 1131.81 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4333. 1131.81 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  4334. 1131.81 s [haskell-language-server] include process-1.6.19.0
  4335. 1131.81 s [haskell-language-server] include safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  4336. 1131.81 s [haskell-language-server] include shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  4337. 1131.81 s [haskell-language-server] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4338. 1131.81 s [haskell-language-server] include text-2.0.2
  4339. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  4340. 1131.81 s [haskell-language-server] include aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
  4341. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4342. 1131.81 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4343. 1131.81 s [haskell-language-server] include directory-1.3.8.5
  4344. 1131.81 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4345. 1131.81 s [haskell-language-server] include filepath-1.4.301.0
  4346. 1131.81 s [haskell-language-server] include ghc-9.6.7
  4347. 1131.81 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4348. 1131.81 s [haskell-language-server] include githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
  4349. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  4350. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  4351. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  4352. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  4353. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  4354. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  4355. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  4356. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  4357. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  4358. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  4359. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  4360. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  4361. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  4362. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  4363. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  4364. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  4365. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  4366. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  4367. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  4368. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  4369. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  4370. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  4371. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4372. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  4373. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  4374. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  4375. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  4376. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  4377. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  4378. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  4379. 1131.81 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  4380. 1131.81 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4381. 1131.81 s [haskell-language-server] include optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  4382. 1131.81 s [haskell-language-server] include optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
  4383. 1131.81 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  4384. 1131.81 s [haskell-language-server] include process-1.6.19.0
  4385. 1131.81 s [haskell-language-server] include text-2.0.2
  4386. 1131.81 s [haskell-language-server] HlsPlugins=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:HlsPlugins,Ide.Arguments=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:Ide.Arguments,Ide.Main=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:Ide.Main,Ide.Version=haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF:Ide.Version
  4387. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
  4388. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4389. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  4390. 1131.81 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4391. 1131.81 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4392. 1131.81 s [haskell-language-server] include prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  4393. 1131.81 s [haskell-language-server] include text-2.0.2
  4394. 1131.81 s [haskell-language-server] unit haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
  4395. 1131.81 s [haskell-language-server] include base-4.18.3.0
  4396. 1131.81 s [haskell-language-server] include containers-0.6.7
  4397. 1131.81 s [haskell-language-server] include data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4398. 1131.81 s [haskell-language-server] include directory-1.3.8.5
  4399. 1131.81 s [haskell-language-server] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4400. 1131.81 s [haskell-language-server] include filepath-1.4.301.0
  4401. 1131.81 s [haskell-language-server] include ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4402. 1131.81 s [haskell-language-server] include haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  4403. 1131.81 s [haskell-language-server] include hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  4404. 1131.81 s [haskell-language-server] include hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4405. 1131.81 s [haskell-language-server] include lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4406. 1131.81 s [haskell-language-server] include lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4407. 1131.81 s [haskell-language-server] include text-2.0.2
  4408. 1131.81 s [haskell-language-server] include transformers-0.6.1.0
  4409. 1131.81 s [haskell-language-server] include unix-2.8.6.0
  4410. 1131.81 s [haskell-language-server] include unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  4411. 1131.81 s [haskell-language-server] Ready component graph:
  4412. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  4413. 1131.81 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4414. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4415. 1131.81 s [haskell-language-server] depends containers-0.6.7
  4416. 1131.81 s [haskell-language-server] depends deepseq-1.4.8.1
  4417. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4418. 1131.81 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4419. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4420. 1131.81 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4421. 1131.81 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4422. 1131.81 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4423. 1131.81 s [haskell-language-server] depends text-2.0.2
  4424. 1131.81 s [haskell-language-server] depends transformers-0.6.1.0
  4425. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  4426. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4427. 1131.81 s [haskell-language-server] depends containers-0.6.7
  4428. 1131.81 s [haskell-language-server] depends ghc-9.6.7
  4429. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4430. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4431. 1131.81 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4432. 1131.81 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4433. 1131.81 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4434. 1131.81 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4435. 1131.81 s [haskell-language-server] depends text-2.0.2
  4436. 1131.81 s [haskell-language-server] depends transformers-0.6.1.0
  4437. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  4438. 1131.81 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4439. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4440. 1131.81 s [haskell-language-server] depends containers-0.6.7
  4441. 1131.81 s [haskell-language-server] depends deepseq-1.4.8.1
  4442. 1131.81 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4443. 1131.81 s [haskell-language-server] depends ghc-9.6.7
  4444. 1131.81 s [haskell-language-server] depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  4445. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4446. 1131.81 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4447. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4448. 1131.81 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4449. 1131.81 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4450. 1131.81 s [haskell-language-server] depends mtl-2.3.1
  4451. 1131.81 s [haskell-language-server] depends text-2.0.2
  4452. 1131.81 s [haskell-language-server] depends transformers-0.6.1.0
  4453. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  4454. 1131.81 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4455. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4456. 1131.81 s [haskell-language-server] depends containers-0.6.7
  4457. 1131.81 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4458. 1131.81 s [haskell-language-server] depends ghc-9.6.7
  4459. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4460. 1131.81 s [haskell-language-server] depends hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  4461. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4462. 1131.81 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4463. 1131.81 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4464. 1131.81 s [haskell-language-server] depends sqlite-simple-0.4.19.0-2fdDxNmUdI02n2D93fGkOA
  4465. 1131.81 s [haskell-language-server] depends text-2.0.2
  4466. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-JHhSHT2pml8BalYIyFTgc7-ghcide-test-preprocessor
  4467. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4468. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  4469. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4470. 1131.81 s [haskell-language-server] depends containers-0.6.7
  4471. 1131.81 s [haskell-language-server] depends deepseq-1.4.8.1
  4472. 1131.81 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4473. 1131.81 s [haskell-language-server] depends ghc-9.6.7
  4474. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4475. 1131.81 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4476. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4477. 1131.81 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4478. 1131.81 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4479. 1131.81 s [haskell-language-server] depends mtl-2.3.1
  4480. 1131.81 s [haskell-language-server] depends semigroupoids-6.0.1-54VzK0HQ3Xs4SWz0qFeA7J
  4481. 1131.81 s [haskell-language-server] depends transformers-0.6.1.0
  4482. 1131.81 s [haskell-language-server] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4483. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  4484. 1131.81 s [haskell-language-server] depends array-0.5.8.0
  4485. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4486. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4487. 1131.81 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4488. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4489. 1131.81 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4490. 1131.81 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4491. 1131.81 s [haskell-language-server] depends mtl-2.3.1
  4492. 1131.81 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4493. 1131.81 s [haskell-language-server] depends text-2.0.2
  4494. 1131.81 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4495. 1131.81 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4496. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  4497. 1131.81 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4498. 1131.81 s [haskell-language-server] depends async-2.2.5-FhKLzi3ZfBSDzHnPPPs0JV
  4499. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4500. 1131.81 s [haskell-language-server] depends binary-0.8.9.1
  4501. 1131.81 s [haskell-language-server] depends bytestring-0.11.5.4
  4502. 1131.81 s [haskell-language-server] depends deepseq-1.4.8.1
  4503. 1131.81 s [haskell-language-server] depends directory-1.3.8.5
  4504. 1131.81 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4505. 1131.81 s [haskell-language-server] depends filepath-1.4.301.0
  4506. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4507. 1131.81 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4508. 1131.81 s [haskell-language-server] depends hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  4509. 1131.81 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4510. 1131.81 s [haskell-language-server] depends lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  4511. 1131.81 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4512. 1131.81 s [haskell-language-server] depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  4513. 1131.81 s [haskell-language-server] depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  4514. 1131.81 s [haskell-language-server] depends process-1.6.19.0
  4515. 1131.81 s [haskell-language-server] depends row-types-1.0.1.2-GohFLjwnT9fE3Oyg9BLD2E
  4516. 1131.81 s [haskell-language-server] depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  4517. 1131.81 s [haskell-language-server] depends shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  4518. 1131.81 s [haskell-language-server] depends text-2.0.2
  4519. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  4520. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4521. 1131.81 s [haskell-language-server] depends floskell-0.11.1-F2B6NOVmKxJBuRX1YeIXI3
  4522. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4523. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4524. 1131.81 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4525. 1131.81 s [haskell-language-server] depends mtl-2.3.1
  4526. 1131.81 s [haskell-language-server] depends text-2.0.2
  4527. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  4528. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4529. 1131.81 s [haskell-language-server] depends directory-1.3.8.5
  4530. 1131.81 s [haskell-language-server] depends filepath-1.4.301.0
  4531. 1131.81 s [haskell-language-server] depends ghc-boot-th-9.6.7
  4532. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4533. 1131.81 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4534. 1131.81 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4535. 1131.81 s [haskell-language-server] depends mtl-2.3.1
  4536. 1131.81 s [haskell-language-server] depends stylish-haskell-0.14.6.0-LLvgSofQOCY3hHahYzFIC6
  4537. 1131.81 s [haskell-language-server] depends text-2.0.2
  4538. 1131.81 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  4539. 1131.81 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4540. 1131.81 s [haskell-language-server] depends base-4.18.3.0
  4541. 1131.81 s [haskell-language-server] depends containers-0.6.7
  4542. 1131.81 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4543. 1131.81 s [haskell-language-server] depends fuzzy-0.1.1.0-LlERYC6Fg0O5zdG1C09qam
  4544. 1131.81 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4545. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4546. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4547. 1131.82 s [haskell-language-server] depends lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6
  4548. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4549. 1131.82 s [haskell-language-server] depends text-2.0.2
  4550. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4551. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  4552. 1131.82 s [haskell-language-server] depends array-0.5.8.0
  4553. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4554. 1131.82 s [haskell-language-server] depends bytestring-0.11.5.4
  4555. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4556. 1131.82 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4557. 1131.82 s [haskell-language-server] depends deepseq-1.4.8.1
  4558. 1131.82 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  4559. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4560. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4561. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4562. 1131.82 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4563. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4564. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4565. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4566. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4567. 1131.82 s [haskell-language-server] depends stm-2.5.1.0
  4568. 1131.82 s [haskell-language-server] depends stm-containers-1.2.1.1-JDBpT36aDZ4CUdJ1Aus6oe
  4569. 1131.82 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4570. 1131.82 s [haskell-language-server] depends template-haskell-2.20.0.0
  4571. 1131.82 s [haskell-language-server] depends text-2.0.2
  4572. 1131.82 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4573. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4574. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  4575. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4576. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4577. 1131.82 s [haskell-language-server] depends filepath-1.4.301.0
  4578. 1131.82 s [haskell-language-server] depends ghc-boot-th-9.6.7
  4579. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4580. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4581. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4582. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4583. 1131.82 s [haskell-language-server] depends ormolu-0.7.4.0-LIXgtWG5aD28NbkYgiUJ8V
  4584. 1131.82 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4585. 1131.82 s [haskell-language-server] depends text-2.0.2
  4586. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4587. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  4588. 1131.82 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4589. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4590. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4591. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4592. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4593. 1131.82 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4594. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4595. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4596. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4597. 1131.82 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4598. 1131.82 s [haskell-language-server] depends text-2.0.2
  4599. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4600. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  4601. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4602. 1131.82 s [haskell-language-server] depends directory-1.3.8.5
  4603. 1131.82 s [haskell-language-server] depends filepath-1.4.301.0
  4604. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4605. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4606. 1131.82 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4607. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4608. 1131.82 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4609. 1131.82 s [haskell-language-server] depends text-2.0.2
  4610. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  4611. 1131.82 s [haskell-language-server] depends Cabal-3.10.3.0-97VZ3uVCyHhIgysI2tHjj1
  4612. 1131.82 s [haskell-language-server] depends Cabal-syntax-3.10.3.0-IhRvyLmXl1UIaCkYCiWa3f
  4613. 1131.82 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4614. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4615. 1131.82 s [haskell-language-server] depends bytestring-0.11.5.4
  4616. 1131.82 s [haskell-language-server] depends cabal-add-0.2-8fogMBtEehK7vh7o2bjwgw
  4617. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4618. 1131.82 s [haskell-language-server] depends deepseq-1.4.8.1
  4619. 1131.82 s [haskell-language-server] depends directory-1.3.8.5
  4620. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4621. 1131.82 s [haskell-language-server] depends filepath-1.4.301.0
  4622. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4623. 1131.82 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4624. 1131.82 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4625. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4626. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4627. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4628. 1131.82 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4629. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4630. 1131.82 s [haskell-language-server] depends pretty-1.1.3.6
  4631. 1131.82 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4632. 1131.82 s [haskell-language-server] depends text-2.0.2
  4633. 1131.82 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4634. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4635. 1131.82 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4636. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  4637. 1131.82 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4638. 1131.82 s [haskell-language-server] depends apply-refact-0.15.0.0-4MjkBELToDe5NAkQSrxtCU
  4639. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4640. 1131.82 s [haskell-language-server] depends bytestring-0.11.5.4
  4641. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4642. 1131.82 s [haskell-language-server] depends deepseq-1.4.8.1
  4643. 1131.82 s [haskell-language-server] depends filepath-1.4.301.0
  4644. 1131.82 s [haskell-language-server] depends ghc-lib-parser-9.8.5.20250214-2sNjHbGivPe3WF6GmRwnfJ
  4645. 1131.82 s [haskell-language-server] depends ghc-lib-parser-ex-9.8.0.2-6MMs82JSbM38IX9LmoVjK4
  4646. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4647. 1131.82 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4648. 1131.82 s [haskell-language-server] depends hlint-3.8-41jUuJncsTy84zuKEBa9b
  4649. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4650. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4651. 1131.82 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4652. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4653. 1131.82 s [haskell-language-server] depends refact-0.3.0.2-8O04sJZgp6Q4KcGxjYVPmG
  4654. 1131.82 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4655. 1131.82 s [haskell-language-server] depends stm-2.5.1.0
  4656. 1131.82 s [haskell-language-server] depends temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  4657. 1131.82 s [haskell-language-server] depends text-2.0.2
  4658. 1131.82 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4659. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4660. 1131.82 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4661. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4662. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4663. 1131.82 s [haskell-language-server] depends bytestring-0.11.5.4
  4664. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4665. 1131.82 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4666. 1131.82 s [haskell-language-server] depends deepseq-1.4.8.1
  4667. 1131.82 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  4668. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4669. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4670. 1131.82 s [haskell-language-server] depends ghc-boot-9.6.7
  4671. 1131.82 s [haskell-language-server] depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  4672. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4673. 1131.82 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4674. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4675. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4676. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4677. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4678. 1131.82 s [haskell-language-server] depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  4679. 1131.82 s [haskell-language-server] depends regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM
  4680. 1131.82 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4681. 1131.82 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4682. 1131.82 s [haskell-language-server] depends text-2.0.2
  4683. 1131.82 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4684. 1131.82 s [haskell-language-server] depends time-1.12.2
  4685. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4686. 1131.82 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4687. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  4688. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4689. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4690. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4691. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4692. 1131.82 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4693. 1131.82 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4694. 1131.82 s [haskell-language-server] depends hiedb-0.7.0.0-4rLesnUpHhF2nKdW2OgTut
  4695. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4696. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4697. 1131.82 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4698. 1131.82 s [haskell-language-server] depends mod-0.2.1.0-AEqKlJqNyYNGsAQxMMfOED
  4699. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4700. 1131.82 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4701. 1131.82 s [haskell-language-server] depends text-2.0.2
  4702. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4703. 1131.82 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4704. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  4705. 1131.82 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4706. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4707. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4708. 1131.82 s [haskell-language-server] depends foldl-1.4.18-Bjs3RPGa3QC5Zp1aPynHUe
  4709. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4710. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4711. 1131.82 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4712. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4713. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4714. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4715. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4716. 1131.82 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4717. 1131.82 s [haskell-language-server] depends text-2.0.2
  4718. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4719. 1131.82 s [haskell-language-server] depends unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  4720. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  4721. 1131.82 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4722. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4723. 1131.82 s [haskell-language-server] depends bytestring-0.11.5.4
  4724. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4725. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4726. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4727. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4728. 1131.82 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4729. 1131.82 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4730. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4731. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4732. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4733. 1131.82 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4734. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4735. 1131.82 s [haskell-language-server] depends retrie-1.2.3-4syE2wloz6UAMXGW9FTmsG
  4736. 1131.82 s [haskell-language-server] depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  4737. 1131.82 s [haskell-language-server] depends stm-2.5.1.0
  4738. 1131.82 s [haskell-language-server] depends text-2.0.2
  4739. 1131.82 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4740. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4741. 1131.82 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4742. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  4743. 1131.82 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4744. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4745. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4746. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4747. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4748. 1131.82 s [haskell-language-server] depends ghc-exactprint-1.7.1.0-1CDmGc4TVHvANLJDcR1mPn
  4749. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4750. 1131.82 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4751. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4752. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4753. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4754. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4755. 1131.82 s [haskell-language-server] depends text-2.0.2
  4756. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4757. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  4758. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4759. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4760. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4761. 1131.82 s [haskell-language-server] depends ghc-boot-th-9.6.7
  4762. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4763. 1131.82 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4764. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4765. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4766. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4767. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4768. 1131.82 s [haskell-language-server] depends regex-tdfa-1.3.2.5-J2FqyjPNJjf9nqa7AV0pPE
  4769. 1131.82 s [haskell-language-server] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  4770. 1131.82 s [haskell-language-server] depends text-2.0.2
  4771. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  4772. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4773. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4774. 1131.82 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  4775. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4776. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4777. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4778. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4779. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4780. 1131.82 s [haskell-language-server] depends text-2.0.2
  4781. 1131.82 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4782. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4783. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  4784. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4785. 1131.82 s [haskell-language-server] depends directory-1.3.8.5
  4786. 1131.82 s [haskell-language-server] depends filepath-1.4.301.0
  4787. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4788. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4789. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4790. 1131.82 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4791. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4792. 1131.82 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4793. 1131.82 s [haskell-language-server] depends text-2.0.2
  4794. 1131.82 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  4795. 1131.82 s [haskell-language-server] depends Diff-1.0.2-dzGetap2ECL5JRsgOkhmm
  4796. 1131.82 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4797. 1131.82 s [haskell-language-server] depends base-4.18.3.0
  4798. 1131.82 s [haskell-language-server] depends bytestring-0.11.5.4
  4799. 1131.82 s [haskell-language-server] depends containers-0.6.7
  4800. 1131.82 s [haskell-language-server] depends deepseq-1.4.8.1
  4801. 1131.82 s [haskell-language-server] depends dlist-1.0-F3hvAQUVsRkJmny5VaoXGg
  4802. 1131.82 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4803. 1131.82 s [haskell-language-server] depends filepath-1.4.301.0
  4804. 1131.82 s [haskell-language-server] depends ghc-9.6.7
  4805. 1131.82 s [haskell-language-server] depends ghc-boot-th-9.6.7
  4806. 1131.82 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4807. 1131.82 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4808. 1131.82 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4809. 1131.82 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4810. 1131.82 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4811. 1131.82 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4812. 1131.82 s [haskell-language-server] depends megaparsec-9.7.0-9FWtFuoAKCoJPEfZ8OP0ob
  4813. 1131.82 s [haskell-language-server] depends mtl-2.3.1
  4814. 1131.82 s [haskell-language-server] depends parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC
  4815. 1131.82 s [haskell-language-server] depends text-2.0.2
  4816. 1131.82 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4817. 1131.82 s [haskell-language-server] depends transformers-0.6.1.0
  4818. 1131.82 s [haskell-language-server] depends unliftio-0.2.25.1-5MZwHIZimta75d0AbqTI9h
  4819. 1131.83 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4820. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  4821. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4822. 1131.83 s [haskell-language-server] depends containers-0.6.7
  4823. 1131.83 s [haskell-language-server] depends ghc-9.6.7
  4824. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4825. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4826. 1131.83 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4827. 1131.83 s [haskell-language-server] depends text-2.0.2
  4828. 1131.83 s [haskell-language-server] depends transformers-0.6.1.0
  4829. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4pY5yY1pY4d8Hs1Q2a6ukB-plugin-tutorial
  4830. 1131.83 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4831. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4832. 1131.83 s [haskell-language-server] depends containers-0.6.7
  4833. 1131.83 s [haskell-language-server] depends ghc-9.6.7
  4834. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4835. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4836. 1131.83 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4837. 1131.83 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4838. 1131.83 s [haskell-language-server] depends markdown-unlit-0.6.0-5809pVajWVb2gBk7RWYi4C
  4839. 1131.83 s [haskell-language-server] depends text-2.0.2
  4840. 1131.83 s [haskell-language-server] depends transformers-0.6.1.0
  4841. 1131.83 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4842. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  4843. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4844. 1131.83 s [haskell-language-server] depends deepseq-1.4.8.1
  4845. 1131.83 s [haskell-language-server] depends directory-1.3.8.5
  4846. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4847. 1131.83 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4848. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4849. 1131.83 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4850. 1131.83 s [haskell-language-server] depends stan-0.2.1.0-B6pDZR8PjMBItDLFTHk8I9
  4851. 1131.83 s [haskell-language-server] depends text-2.0.2
  4852. 1131.83 s [haskell-language-server] depends trial-0.0.0.0-4bVaCFWxanU7Vl3nRX6Yi0
  4853. 1131.83 s [haskell-language-server] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  4854. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  4855. 1131.83 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4856. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4857. 1131.83 s [haskell-language-server] depends containers-0.6.7
  4858. 1131.83 s [haskell-language-server] depends deepseq-1.4.8.1
  4859. 1131.83 s [haskell-language-server] depends ghc-9.6.7
  4860. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4861. 1131.83 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4862. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4863. 1131.83 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4864. 1131.83 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4865. 1131.83 s [haskell-language-server] depends mtl-2.3.1
  4866. 1131.83 s [haskell-language-server] depends text-2.0.2
  4867. 1131.83 s [haskell-language-server] depends transformers-0.6.1.0
  4868. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  4869. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4870. 1131.83 s [haskell-language-server] depends filepath-1.4.301.0
  4871. 1131.83 s [haskell-language-server] depends fourmolu-0.15.0.0-EEltZEsw4M5ydl0dR88pq
  4872. 1131.83 s [haskell-language-server] depends ghc-boot-th-9.6.7
  4873. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4874. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4875. 1131.83 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4876. 1131.83 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4877. 1131.83 s [haskell-language-server] depends mtl-2.3.1
  4878. 1131.83 s [haskell-language-server] depends process-extras-0.7.4-KDRxXMN7euBJBUgPAfPC8U
  4879. 1131.83 s [haskell-language-server] depends text-2.0.2
  4880. 1131.83 s [haskell-language-server] depends transformers-0.6.1.0
  4881. 1131.83 s [haskell-language-server] depends yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy
  4882. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  4883. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4884. 1131.83 s [haskell-language-server] depends containers-0.6.7
  4885. 1131.83 s [haskell-language-server] depends deepseq-1.4.8.1
  4886. 1131.83 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4887. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4888. 1131.83 s [haskell-language-server] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  4889. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4890. 1131.83 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4891. 1131.83 s [haskell-language-server] depends text-2.0.2
  4892. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-1eqeWxapPHfKHhYNK0JT0S-ghcide-bench
  4893. 1131.83 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4894. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4895. 1131.83 s [haskell-language-server] depends bytestring-0.11.5.4
  4896. 1131.83 s [haskell-language-server] depends containers-0.6.7
  4897. 1131.83 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4898. 1131.83 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4899. 1131.83 s [haskell-language-server] depends filepath-1.4.301.0
  4900. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  4901. 1131.83 s [haskell-language-server] depends hls-graph-2.12.0.0-LmmxNkRAYgA4jEKRL35j8r
  4902. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4903. 1131.83 s [haskell-language-server] depends hls-test-utils-2.12.0.0-2UlZmdeujD21IIWja6yF7h
  4904. 1131.83 s [haskell-language-server] depends lens-5.3.5-DSCdkdf7tVjKIPqwSatvE
  4905. 1131.83 s [haskell-language-server] depends lsp-test-0.17.1.1-EjGeIvnsfk5EhXX3ijjV6d
  4906. 1131.83 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4907. 1131.83 s [haskell-language-server] depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  4908. 1131.83 s [haskell-language-server] depends process-1.6.19.0
  4909. 1131.83 s [haskell-language-server] depends safe-exceptions-0.1.7.4-J0hn5BMLtXUJL9cS1eXC3v
  4910. 1131.83 s [haskell-language-server] depends shake-0.19.8-LPUQZrGH1UsAA1FMLvo9Hc
  4911. 1131.83 s [haskell-language-server] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4912. 1131.83 s [haskell-language-server] depends text-2.0.2
  4913. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  4914. 1131.83 s [haskell-language-server] depends aeson-2.2.3.0-DGnftm2v6r08Y72sICN3c0
  4915. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4916. 1131.83 s [haskell-language-server] depends containers-0.6.7
  4917. 1131.83 s [haskell-language-server] depends filepath-1.4.301.0
  4918. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4919. 1131.83 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4920. 1131.83 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4921. 1131.83 s [haskell-language-server] depends text-2.0.2
  4922. 1131.83 s [haskell-language-server] depends text-rope-0.3-AtGaAe1sCd6ukviEtJbiF
  4923. 1131.83 s [haskell-language-server] depends transformers-0.6.1.0
  4924. 1131.83 s [haskell-language-server] definite haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  4925. 1131.83 s [haskell-language-server] depends aeson-pretty-0.8.10-BgtEeo7358D7lyXwmTUOLk
  4926. 1131.83 s [haskell-language-server] depends base-4.18.3.0
  4927. 1131.83 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4928. 1131.83 s [haskell-language-server] depends directory-1.3.8.5
  4929. 1131.83 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4930. 1131.83 s [haskell-language-server] depends filepath-1.4.301.0
  4931. 1131.83 s [haskell-language-server] depends ghc-9.6.7
  4932. 1131.83 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4933. 1131.83 s [haskell-language-server] depends githash-0.1.7.0-5BWjRCNZB9NEtAb5878P8j
  4934. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  4935. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  4936. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  4937. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  4938. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  4939. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  4940. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  4941. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  4942. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  4943. 1131.83 s [haskell-language-server] depends haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  4944. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  4945. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  4946. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  4947. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  4948. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  4949. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  4950. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  4951. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  4952. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  4953. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  4954. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  4955. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  4956. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  4957. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  4958. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  4959. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  4960. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  4961. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  4962. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  4963. 1132.02 s [haskell-language-server] depends haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  4964. 1132.02 s [haskell-language-server] depends hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  4965. 1132.02 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4966. 1132.02 s [haskell-language-server] depends optparse-applicative-0.18.1.0-Let8AIZHwiqCn1Z7uV5H6r
  4967. 1132.02 s [haskell-language-server] depends optparse-simple-0.1.1.4-9HAULKOjTA6J0lHNdRD2x7
  4968. 1132.02 s [haskell-language-server] depends prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  4969. 1132.02 s [haskell-language-server] depends process-1.6.19.0
  4970. 1132.02 s [haskell-language-server] depends text-2.0.2
  4971. 1132.02 s [haskell-language-server] definite haskell-language-server-2.12.0.0-6OQdnWIBVJU7LMih85tfjb-haskell-language-server-wrapper
  4972. 1132.02 s [haskell-language-server] depends base-4.18.3.0
  4973. 1132.02 s [haskell-language-server] depends containers-0.6.7
  4974. 1132.02 s [haskell-language-server] depends data-default-0.8.0.1-LxnMp3In9RcB0AnLNQD2O5
  4975. 1132.03 s [haskell-language-server] depends directory-1.3.8.5
  4976. 1132.03 s [haskell-language-server] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  4977. 1132.03 s [haskell-language-server] depends filepath-1.4.301.0
  4978. 1132.03 s [haskell-language-server] depends ghcide-2.12.0.0-DoBI404w56IBGGWIHEkjtu
  4979. 1132.03 s [haskell-language-server] depends haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  4980. 1132.03 s [haskell-language-server] depends hie-bios-0.17.0-4OgvZQ0M1cWI2jB71urhuV
  4981. 1132.03 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4982. 1132.03 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4983. 1132.03 s [haskell-language-server] depends lsp-types-2.3.0.1-8LSNlmzQ20d3XpNxAaZYMP
  4984. 1132.03 s [haskell-language-server] depends text-2.0.2
  4985. 1132.03 s [haskell-language-server] depends transformers-0.6.1.0
  4986. 1132.03 s [haskell-language-server] depends unix-2.8.6.0
  4987. 1132.03 s [haskell-language-server] depends unliftio-core-0.2.1.0-CtDanxECkbwJ3FHnCY1MPO
  4988. 1132.03 s [haskell-language-server] definite haskell-language-server-2.12.0.0-ITpYpQVRS0qLya2XUJnu55-haskell-language-server
  4989. 1132.03 s [haskell-language-server] depends base-4.18.3.0
  4990. 1132.03 s [haskell-language-server] depends haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  4991. 1132.03 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-6Cwxvor5kYM345JQLfeYUR
  4992. 1132.03 s [haskell-language-server] depends lsp-2.7.0.1-BmLSwy2y3WrqshzrDS9re
  4993. 1132.03 s [haskell-language-server] depends prettyprinter-1.7.1-I6A2lHwVDNh6maV7bYB5fM
  4994. 1132.03 s [haskell-language-server] depends text-2.0.2
  4995. 1132.03 s [haskell-language-server] Using Cabal-3.10.3.0 compiled by ghc-9.6
  4996. 1132.03 s [haskell-language-server] Using compiler: ghc-9.6.7
  4997. 1132.03 s [haskell-language-server] Using install prefix:
  4998. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  4999. 1132.03 s [haskell-language-server] Executables installed in:
  5000. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  5001. 1132.03 s [haskell-language-server] Libraries installed in:
  5002. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  5003. 1132.03 s [haskell-language-server] Dynamic Libraries installed in:
  5004. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  5005. 1132.03 s [haskell-language-server] Private executables installed in:
  5006. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/libexec/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0
  5007. 1132.03 s [haskell-language-server] Data files installed in:
  5008. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/share/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0
  5009. 1132.03 s [haskell-language-server] Documentation installed in:
  5010. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/share/doc/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0
  5011. 1132.03 s [haskell-language-server] Configuration files installed in:
  5012. 1132.03 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/etc
  5013. 1132.03 s [haskell-language-server] No alex found
  5014. 1132.03 s [haskell-language-server] Using ar found on system at:
  5015. 1132.03 s [haskell-language-server] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  5016. 1132.03 s [haskell-language-server] No c2hs found
  5017. 1132.03 s [haskell-language-server] Using cpphs version 1.20.9 found on system at:
  5018. 1132.03 s [haskell-language-server] /nix/store/gymhfrsrhrx70q726mrsjlrwrnnlhm72-cpphs-1.20.10/bin/cpphs
  5019. 1132.03 s [haskell-language-server] No doctest found
  5020. 1132.03 s [haskell-language-server] Using gcc version 14.3.0 given by user at:
  5021. 1132.03 s [haskell-language-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  5022. 1132.03 s [haskell-language-server] Using ghc version 9.6.7 found on system at:
  5023. 1132.03 s [haskell-language-server] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  5024. 1132.03 s [haskell-language-server] Using ghc-pkg version 9.6.7 found on system at:
  5025. 1132.03 s [haskell-language-server] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  5026. 1132.03 s [haskell-language-server] No ghcjs found
  5027. 1132.03 s [haskell-language-server] No ghcjs-pkg found
  5028. 1132.03 s [haskell-language-server] No greencard found
  5029. 1132.03 s [haskell-language-server] Using haddock version 2.29.2 found on system at:
  5030. 1132.03 s [haskell-language-server] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  5031. 1132.03 s [haskell-language-server] No happy found
  5032. 1132.03 s [haskell-language-server] Using haskell-suite found on system at: haskell-suite-dummy-location
  5033. 1132.03 s [haskell-language-server] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  5034. 1132.03 s [haskell-language-server] No hmake found
  5035. 1132.03 s [haskell-language-server] Using hpc version 0.68 found on system at:
  5036. 1132.03 s [haskell-language-server] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  5037. 1132.03 s [haskell-language-server] Using hsc2hs version 0.68.9 found on system at:
  5038. 1132.03 s [haskell-language-server] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  5039. 1132.03 s [haskell-language-server] Using hscolour version 1.25 found on system at:
  5040. 1132.03 s [haskell-language-server] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  5041. 1132.03 s [haskell-language-server] No jhc found
  5042. 1132.03 s [haskell-language-server] Using ld found on system at:
  5043. 1132.03 s [haskell-language-server] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  5044. 1132.03 s [haskell-language-server] No pkg-config found
  5045. 1132.03 s [haskell-language-server] Using runghc version 9.6.7 found on system at:
  5046. 1132.03 s [haskell-language-server] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  5047. 1132.03 s [haskell-language-server] Using strip version 2.44 found on system at:
  5048. 1132.03 s [haskell-language-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  5049. 1132.03 s [haskell-language-server] Using tar found on system at:
  5050. 1132.03 s [haskell-language-server] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  5051. 1132.03 s [haskell-language-server] No uhc found
  5052. 1132.08 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 )
  5053. 1132.08 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 )
  5054. 1133.29 s [haskell-language-server] Phase: buildPhase
  5055. 1133.55 s [haskell-language-server] Preprocessing library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0..
  5056. 1133.55 s [haskell-language-server] Building library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0..
  5057. 1133.72 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.OverloadedRecordDot ( plugins/hls-overloaded-record-dot-plugin/src/Ide/Plugin/OverloadedRecordDot.hs, dist/build/hls-overloaded-record-dot-plugin/Ide/Plugin/OverloadedRecordDot.o, dist/build/hls-overloaded-record-dot-plugin/Ide/Plugin/OverloadedRecordDot.dyn_o )
  5058. 1138.50 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.OverloadedRecordDot ( plugins/hls-overloaded-record-dot-plugin/src/Ide/Plugin/OverloadedRecordDot.hs, dist/build/hls-overloaded-record-dot-plugin/Ide/Plugin/OverloadedRecordDot.p_o )
  5059. 1142.40 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 )
  5060. 1152.84 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 )
  5061. 1154.86 s [haskell-language-server] Preprocessing library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0..
  5062. 1154.86 s [haskell-language-server] Building library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0..
  5063. 1155.09 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ChangeTypeSignature ( plugins/hls-change-type-signature-plugin/src/Ide/Plugin/ChangeTypeSignature.hs, dist/build/hls-change-type-signature-plugin/Ide/Plugin/ChangeTypeSignature.o, dist/build/hls-change-type-signature-plugin/Ide/Plugin/ChangeTypeSignature.dyn_o )
  5064. 1159.26 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ChangeTypeSignature ( plugins/hls-change-type-signature-plugin/src/Ide/Plugin/ChangeTypeSignature.hs, dist/build/hls-change-type-signature-plugin/Ide/Plugin/ChangeTypeSignature.p_o )
  5065. 1163.83 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 )
  5066. 1164.76 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 )
  5067. 1164.97 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  5068. 1165.03 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 )
  5069. 1165.45 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 )
  5070. 1165.45 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  5071. 1165.45 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  5072. 1165.45 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 )
  5073. 1170.00 s [haskell-language-server] Preprocessing library 'hls-class-plugin' for haskell-language-server-2.12.0.0..
  5074. 1170.00 s [haskell-language-server] Building library 'hls-class-plugin' for haskell-language-server-2.12.0.0..
  5075. 1170.25 s [haskell-language-server] [1 of 6] Compiling Ide.Plugin.Class.Utils ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Utils.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Utils.o, dist/build/hls-class-plugin/Ide/Plugin/Class/Utils.dyn_o )
  5076. 1172.27 s [haskell-language-server] [2 of 6] Compiling Ide.Plugin.Class.Types ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Types.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Types.o, dist/build/hls-class-plugin/Ide/Plugin/Class/Types.dyn_o )
  5077. 1173.31 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  5078. 1174.88 s [haskell-language-server] [3 of 6] Compiling Ide.Plugin.Class.ExactPrint ( plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/ExactPrint.o, dist/build/hls-class-plugin/Ide/Plugin/Class/ExactPrint.dyn_o )
  5079. 1175.17 s [haskell-language-server] [4 of 6] Compiling Ide.Plugin.Class.CodeLens ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeLens.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeLens.o, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeLens.dyn_o )
  5080. 1175.71 s [haskell-language-server] [5 of 6] Compiling Ide.Plugin.Class.CodeAction ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeAction.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeAction.o, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeAction.dyn_o )
  5081. 1176.19 s [haskell-language-server] [6 of 6] Compiling Ide.Plugin.Class ( plugins/hls-class-plugin/src/Ide/Plugin/Class.hs, dist/build/hls-class-plugin/Ide/Plugin/Class.o, dist/build/hls-class-plugin/Ide/Plugin/Class.dyn_o )
  5082. 1176.88 s [haskell-language-server] [1 of 6] Compiling Ide.Plugin.Class.Utils ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Utils.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Utils.p_o )
  5083. 1177.65 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  5084. 1178.76 s [haskell-language-server] [2 of 6] Compiling Ide.Plugin.Class.Types ( plugins/hls-class-plugin/src/Ide/Plugin/Class/Types.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/Types.p_o )
  5085. 1182.52 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  5086. 1183.82 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  5087. 1185.47 s [haskell-language-server] [3 of 6] Compiling Ide.Plugin.Class.ExactPrint ( plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/ExactPrint.p_o )
  5088. 1186.26 s [haskell-language-server] [4 of 6] Compiling Ide.Plugin.Class.CodeLens ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeLens.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeLens.p_o )
  5089. 1186.70 s [haskell-language-server] [5 of 6] Compiling Ide.Plugin.Class.CodeAction ( plugins/hls-class-plugin/src/Ide/Plugin/Class/CodeAction.hs, dist/build/hls-class-plugin/Ide/Plugin/Class/CodeAction.p_o )
  5090. 1187.60 s [haskell-language-server] [6 of 6] Compiling Ide.Plugin.Class ( plugins/hls-class-plugin/src/Ide/Plugin/Class.hs, dist/build/hls-class-plugin/Ide/Plugin/Class.p_o )
  5091. 1197.07 s [haskell-language-server] Preprocessing library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0..
  5092. 1197.07 s [haskell-language-server] Building library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0..
  5093. 1197.27 s [haskell-language-server] [1 of 4] Compiling Ide.Plugin.CallHierarchy.Types ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Types.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Types.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Types.dyn_o )
  5094. 1197.74 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  5095. 1197.74 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  5096. 1199.67 s [haskell-language-server] [2 of 4] Compiling Ide.Plugin.CallHierarchy.Query ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Query.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Query.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Query.dyn_o )
  5097. 1200.31 s [haskell-language-server] [3 of 4] Compiling Ide.Plugin.CallHierarchy.Internal ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Internal.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Internal.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Internal.dyn_o )
  5098. 1203.36 s [haskell-language-server] [4 of 4] Compiling Ide.Plugin.CallHierarchy ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy.o, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy.dyn_o )
  5099. 1204.11 s [haskell-language-server] [1 of 4] Compiling Ide.Plugin.CallHierarchy.Types ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Types.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Types.p_o )
  5100. 1210.20 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  5101. 1210.21 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  5102. 1210.21 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  5103. 1210.21 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  5104. 1210.21 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  5105. 1211.43 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  5106. 1211.43 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  5107. 1211.77 s [haskell-language-server] [2 of 4] Compiling Ide.Plugin.CallHierarchy.Query ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Query.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Query.p_o )
  5108. 1212.23 s [haskell-language-server] [3 of 4] Compiling Ide.Plugin.CallHierarchy.Internal ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy/Internal.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy/Internal.p_o )
  5109. 1213.45 s [haskell-language-server] [4 of 4] Compiling Ide.Plugin.CallHierarchy ( plugins/hls-call-hierarchy-plugin/src/Ide/Plugin/CallHierarchy.hs, dist/build/hls-call-hierarchy-plugin/Ide/Plugin/CallHierarchy.p_o )
  5110. 1219.36 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  5111. 1222.85 s [haskell-language-server] Preprocessing executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0..
  5112. 1222.86 s [haskell-language-server] Building executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0..
  5113. 1223.03 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-test/preprocessor/Main.hs, dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor-tmp/Main.dyn_o )
  5114. 1223.39 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor
  5115. 1224.06 s [haskell-language-server] Preprocessing library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0..
  5116. 1224.06 s [haskell-language-server] Building library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0..
  5117. 1224.21 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.CodeRange.ASTPreProcess ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/ASTPreProcess.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/ASTPreProcess.o, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/ASTPreProcess.dyn_o )
  5118. 1226.19 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.CodeRange.Rules ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/Rules.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/Rules.o, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/Rules.dyn_o )
  5119. 1227.58 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  5120. 1228.61 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.CodeRange ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange.o, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange.dyn_o )
  5121. 1229.55 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.CodeRange.ASTPreProcess ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/ASTPreProcess.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/ASTPreProcess.p_o )
  5122. 1230.71 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.CodeRange.Rules ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange/Rules.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange/Rules.p_o )
  5123. 1232.71 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.CodeRange ( plugins/hls-code-range-plugin/src/Ide/Plugin/CodeRange.hs, dist/build/hls-code-range-plugin/Ide/Plugin/CodeRange.p_o )
  5124. 1236.35 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  5125. 1238.40 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  5126. 1238.55 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  5127. 1238.55 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 )
  5128. 1242.71 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.o, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.dyn_o )
  5129. 1242.71 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 )
  5130. 1242.90 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 )
  5131. 1242.90 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 )
  5132. 1242.90 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 )
  5133. 1242.90 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 )
  5134. 1242.90 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 )
  5135. 1242.90 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 )
  5136. 1242.90 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 )
  5137. 1242.91 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 )
  5138. 1242.91 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 )
  5139. 1242.91 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 )
  5140. 1242.91 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 )
  5141. 1242.99 s [haskell-language-server] Preprocessing library 'hls-notes-plugin' for haskell-language-server-2.12.0.0..
  5142. 1242.99 s [haskell-language-server] Building library 'hls-notes-plugin' for haskell-language-server-2.12.0.0..
  5143. 1243.12 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Notes ( plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs, dist/build/hls-notes-plugin/Ide/Plugin/Notes.o, dist/build/hls-notes-plugin/Ide/Plugin/Notes.dyn_o )
  5144. 1243.16 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 )
  5145. 1245.66 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 )
  5146. 1245.71 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 )
  5147. 1245.71 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 )
  5148. 1245.71 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 )
  5149. 1245.71 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 )
  5150. 1245.71 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 )
  5151. 1245.71 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 )
  5152. 1245.71 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 )
  5153. 1245.71 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 )
  5154. 1245.71 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 )
  5155. 1245.71 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  5156. 1245.71 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 )
  5157. 1245.71 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 )
  5158. 1247.45 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  5159. 1247.45 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  5160. 1247.59 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 )
  5161. 1247.80 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 )
  5162. 1248.19 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Notes ( plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs, dist/build/hls-notes-plugin/Ide/Plugin/Notes.p_o )
  5163. 1259.47 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 )
  5164. 1260.15 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 )
  5165. 1262.39 s [haskell-language-server] Preprocessing library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
  5166. 1262.39 s [haskell-language-server] Building library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0..
  5167. 1262.51 s [haskell-language-server] [1 of 2] Compiling Experiments.Types ( ghcide-bench/src/Experiments/Types.hs, dist/build/ghcide-bench-lib/Experiments/Types.o, dist/build/ghcide-bench-lib/Experiments/Types.dyn_o )
  5168. 1264.73 s [haskell-language-server] [2 of 2] Compiling Experiments ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.o, dist/build/ghcide-bench-lib/Experiments.dyn_o )
  5169. 1266.05 s [haskell-language-server]
  5170. 1266.05 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  5171. 1266.05 s [haskell-language-server] Pattern match(es) are non-exhaustive
  5172. 1266.05 s [haskell-language-server] In a pattern binding:
  5173. 1266.05 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  5174. 1266.05 s [haskell-language-server] Failure _
  5175. 1266.05 s [haskell-language-server] CompletionInvoked _
  5176. 1266.05 s [haskell-language-server] |
  5177. 1266.05 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  5178. 1266.05 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  5179. 1266.05 s [haskell-language-server]
  5180. 1266.05 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  5181. 1266.05 s [haskell-language-server] Pattern match(es) are non-exhaustive
  5182. 1266.05 s [haskell-language-server] In a lambda abstraction:
  5183. 1266.05 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  5184. 1266.05 s [haskell-language-server] ‘ProcessHandle’ not matched:
  5185. 1266.05 s [haskell-language-server] Nothing _ _ _
  5186. 1266.05 s [haskell-language-server] (Just _) Nothing _ _
  5187. 1266.05 s [haskell-language-server] (Just _) (Just _) Nothing _
  5188. 1266.05 s [haskell-language-server] |
  5189. 1266.05 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  5190. 1266.05 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  5191. 1272.03 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 )
  5192. 1273.42 s [haskell-language-server] [1 of 2] Compiling Experiments.Types ( ghcide-bench/src/Experiments/Types.hs, dist/build/ghcide-bench-lib/Experiments/Types.p_o )
  5193. 1277.40 s [haskell-language-server] [2 of 2] Compiling Experiments ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.p_o )
  5194. 1279.22 s [haskell-language-server]
  5195. 1279.22 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  5196. 1279.22 s [haskell-language-server] Pattern match(es) are non-exhaustive
  5197. 1279.22 s [haskell-language-server] In a pattern binding:
  5198. 1279.22 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  5199. 1279.22 s [haskell-language-server] Failure _
  5200. 1279.22 s [haskell-language-server] CompletionInvoked _
  5201. 1279.22 s [haskell-language-server] |
  5202. 1279.22 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  5203. 1279.22 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  5204. 1279.22 s [haskell-language-server]
  5205. 1279.22 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  5206. 1279.22 s [haskell-language-server] Pattern match(es) are non-exhaustive
  5207. 1279.22 s [haskell-language-server] In a lambda abstraction:
  5208. 1279.22 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  5209. 1279.22 s [haskell-language-server] ‘ProcessHandle’ not matched:
  5210. 1279.22 s [haskell-language-server] Nothing _ _ _
  5211. 1279.22 s [haskell-language-server] (Just _) Nothing _ _
  5212. 1279.22 s [haskell-language-server] (Just _) (Just _) Nothing _
  5213. 1279.22 s [haskell-language-server] |
  5214. 1279.22 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  5215. 1279.22 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  5216. 1295.61 s [haskell-language-server] Preprocessing library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
  5217. 1295.61 s [haskell-language-server] Building library 'hls-floskell-plugin' for haskell-language-server-2.12.0.0..
  5218. 1295.77 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Floskell ( plugins/hls-floskell-plugin/src/Ide/Plugin/Floskell.hs, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.o, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.dyn_o )
  5219. 1297.91 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Floskell ( plugins/hls-floskell-plugin/src/Ide/Plugin/Floskell.hs, dist/build/hls-floskell-plugin/Ide/Plugin/Floskell.p_o )
  5220. 1304.04 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 )
  5221. 1304.05 s [vector] [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.dyn_o )
  5222. 1304.06 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 )
  5223. 1304.06 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 )
  5224. 1304.06 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 )
  5225. 1304.06 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 )
  5226. 1304.06 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 )
  5227. 1305.49 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  5228. 1307.27 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  5229. 1307.28 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  5230. 1307.54 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 )
  5231. 1307.98 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 )
  5232. 1308.32 s [haskell-language-server] Preprocessing library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
  5233. 1308.32 s [haskell-language-server] Building library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0..
  5234. 1308.48 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.o, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.dyn_o )
  5235. 1309.74 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 )
  5236. 1309.76 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 )
  5237. 1311.61 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.dyn_o )
  5238. 1311.76 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 )
  5239. 1311.76 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 )
  5240. 1311.76 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 )
  5241. 1311.76 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 )
  5242. 1311.76 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 )
  5243. 1311.76 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 )
  5244. 1311.76 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 )
  5245. 1312.52 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  5246. 1313.92 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.StylishHaskell ( plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs, dist/build/hls-stylish-haskell-plugin/Ide/Plugin/StylishHaskell.p_o )
  5247. 1314.41 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  5248. 1314.41 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  5249. 1314.58 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  5250. 1315.26 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 )
  5251. 1315.27 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  5252. 1316.61 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  5253. 1317.62 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  5254. 1318.53 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  5255. 1318.53 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  5256. 1318.59 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  5257. 1318.90 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  5258. 1322.95 s [vector] buildPhase completed in 4 minutes 5 seconds
  5259. 1322.95 s [vector] Phase: checkPhase
  5260. 1322.98 s [vector] Running 2 test suites...
  5261. 1322.98 s [vector] Test suite vector-tests-O0: RUNNING...
  5262. 1323.28 s [vector] toplevel
  5263. 1323.29 s [vector] Data.Vector.Fusion.Bundle
  5264. 1323.30 s [vector] fromList.toList == id: OK
  5265. 1323.30 s [vector] +++ OK, passed 100 tests.
  5266. 1323.30 s [vector] toList.fromList == id: OK
  5267. 1323.30 s [vector] +++ OK, passed 100 tests.
  5268. 1323.30 s [vector] eq: OK
  5269. 1323.30 s [vector] +++ OK, passed 100 tests.
  5270. 1323.30 s [vector] length: OK
  5271. 1323.30 s [vector] +++ OK, passed 100 tests.
  5272. 1323.30 s [vector] null: OK
  5273. 1323.30 s [vector] +++ OK, passed 100 tests.
  5274. 1323.30 s [vector] empty: OK
  5275. 1323.30 s [vector] +++ OK, passed 100 tests.
  5276. 1323.30 s [vector] singleton: OK
  5277. 1323.30 s [vector] +++ OK, passed 100 tests.
  5278. 1323.30 s [vector] replicate: OK
  5279. 1323.30 s [vector] +++ OK, passed 100 tests.
  5280. 1323.30 s [vector] cons: OK
  5281. 1323.30 s [vector] +++ OK, passed 100 tests.
  5282. 1323.30 s [vector] snoc: OK
  5283. 1323.30 s [vector] +++ OK, passed 100 tests.
  5284. 1323.30 s [vector] append: OK
  5285. 1323.30 s [vector] +++ OK, passed 100 tests.
  5286. 1323.30 s [vector] head: OK
  5287. 1323.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5288. 1323.30 s [vector] last: OK
  5289. 1323.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5290. 1323.30 s [vector] index: OK
  5291. 1323.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5292. 1323.30 s [vector] extract: OK
  5293. 1323.30 s [vector] +++ OK, passed 100 tests.
  5294. 1323.30 s [vector] init: OK
  5295. 1323.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5296. 1323.30 s [vector] tail: OK
  5297. 1323.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5298. 1323.30 s [vector] take: OK
  5299. 1323.30 s [vector] +++ OK, passed 100 tests.
  5300. 1323.30 s [vector] drop: OK
  5301. 1323.30 s [vector] +++ OK, passed 100 tests.
  5302. 1323.30 s [vector] map: OK
  5303. 1323.30 s [vector] +++ OK, passed 100 tests.
  5304. 1323.30 s [vector] zipWith: OK
  5305. 1323.30 s [vector] +++ OK, passed 100 tests.
  5306. 1323.30 s [vector] zipWith3: OK
  5307. 1323.30 s [vector] +++ OK, passed 100 tests.
  5308. 1323.30 s [vector] filter: OK
  5309. 1323.30 s [vector] +++ OK, passed 100 tests.
  5310. 1323.30 s [vector] takeWhile: OK
  5311. 1323.30 s [vector] +++ OK, passed 100 tests.
  5312. 1323.30 s [vector] dropWhile: OK
  5313. 1323.30 s [vector] +++ OK, passed 100 tests.
  5314. 1323.30 s [vector] elem: OK
  5315. 1323.30 s [vector] +++ OK, passed 100 tests.
  5316. 1323.30 s [vector] notElem: OK
  5317. 1323.30 s [vector] +++ OK, passed 100 tests.
  5318. 1323.30 s [vector] find: OK
  5319. 1323.31 s [vector] +++ OK, passed 100 tests.
  5320. 1323.32 s [vector] findIndex: OK
  5321. 1323.32 s [vector] +++ OK, passed 100 tests.
  5322. 1323.32 s [vector] foldl: OK
  5323. 1323.32 s [vector] +++ OK, passed 100 tests.
  5324. 1323.32 s [vector] foldl1: OK
  5325. 1323.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5326. 1323.32 s [vector] foldl': OK
  5327. 1323.32 s [vector] +++ OK, passed 100 tests.
  5328. 1323.32 s [vector] foldl1': OK
  5329. 1323.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5330. 1323.32 s [vector] foldr: OK
  5331. 1323.32 s [vector] +++ OK, passed 100 tests.
  5332. 1323.32 s [vector] foldr1: OK
  5333. 1323.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5334. 1323.32 s [vector] prescanl: OK
  5335. 1323.32 s [vector] +++ OK, passed 100 tests.
  5336. 1323.32 s [vector] prescanl': OK
  5337. 1323.32 s [vector] +++ OK, passed 100 tests.
  5338. 1323.32 s [vector] postscanl: OK
  5339. 1323.32 s [vector] +++ OK, passed 100 tests.
  5340. 1323.32 s [vector] postscanl': OK
  5341. 1323.32 s [vector] +++ OK, passed 100 tests.
  5342. 1323.32 s [vector] scanl: OK
  5343. 1323.32 s [vector] +++ OK, passed 100 tests.
  5344. 1323.32 s [vector] scanl': OK
  5345. 1323.32 s [vector] +++ OK, passed 100 tests.
  5346. 1323.32 s [vector] scanl1: OK
  5347. 1323.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5348. 1323.32 s [vector] scanl1': OK
  5349. 1323.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5350. 1323.32 s [vector] concatMap: OK
  5351. 1323.32 s [vector] +++ OK, passed 100 tests.
  5352. 1323.32 s [vector] unfoldr: OK
  5353. 1323.32 s [vector] +++ OK, passed 100 tests.
  5354. 1323.32 s [vector] and: OK
  5355. 1323.32 s [vector] +++ OK, passed 100 tests.
  5356. 1323.32 s [vector] or: OK
  5357. 1323.32 s [vector] +++ OK, passed 100 tests.
  5358. 1323.32 s [vector] Tests.Vector.Boxed
  5359. 1323.32 s [vector] Bool
  5360. 1323.32 s [vector] fromList.toList == id: OK
  5361. 1323.32 s [vector] +++ OK, passed 100 tests.
  5362. 1323.32 s [vector] toList.fromList == id: OK
  5363. 1323.32 s [vector] +++ OK, passed 100 tests.
  5364. 1323.32 s [vector] unstream.stream == id: OK
  5365. 1323.32 s [vector] +++ OK, passed 100 tests.
  5366. 1323.32 s [vector] stream.unstream == id: OK
  5367. 1323.32 s [vector] +++ OK, passed 100 tests.
  5368. 1323.32 s [vector] eq: OK
  5369. 1323.32 s [vector] +++ OK, passed 100 tests.
  5370. 1323.32 s [vector] length: OK
  5371. 1323.32 s [vector] +++ OK, passed 100 tests.
  5372. 1323.32 s [vector] null: OK
  5373. 1323.32 s [vector] +++ OK, passed 100 tests.
  5374. 1323.32 s [vector] index: OK
  5375. 1323.32 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5376. 1323.32 s [vector] safeIndex: OK
  5377. 1323.32 s [vector] +++ OK, passed 100 tests.
  5378. 1323.32 s [vector] head: OK
  5379. 1323.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5380. 1323.33 s [vector] last: OK
  5381. 1323.34 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5382. 1323.34 s [vector] unsafeIndex: OK
  5383. 1323.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5384. 1323.34 s [vector] unsafeHead: OK
  5385. 1323.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5386. 1323.34 s [vector] unsafeLast: OK
  5387. 1323.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5388. 1323.34 s [vector] slice: OK
  5389. 1323.34 s [vector] +++ OK, passed 100 tests.
  5390. 1323.34 s [vector] init: OK
  5391. 1323.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5392. 1323.34 s [vector] tail: OK
  5393. 1323.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5394. 1323.34 s [vector] take: OK
  5395. 1323.34 s [vector] +++ OK, passed 100 tests.
  5396. 1323.34 s [vector] drop: OK
  5397. 1323.34 s [vector] +++ OK, passed 100 tests.
  5398. 1323.34 s [vector] splitAt: OK
  5399. 1323.34 s [vector] +++ OK, passed 100 tests.
  5400. 1323.34 s [vector] empty: OK
  5401. 1323.34 s [vector] +++ OK, passed 100 tests.
  5402. 1323.34 s [vector] singleton: OK
  5403. 1323.34 s [vector] +++ OK, passed 100 tests.
  5404. 1323.34 s [vector] replicate: OK
  5405. 1323.34 s [vector] +++ OK, passed 100 tests.
  5406. 1323.34 s [vector] generate: OK
  5407. 1323.34 s [vector] +++ OK, passed 100 tests.
  5408. 1323.34 s [vector] iterateN: OK
  5409. 1323.34 s [vector] +++ OK, passed 100 tests.
  5410. 1323.34 s [vector] iterateNM: OK (0.04s)
  5411. 1323.34 s [vector] +++ OK, passed 100 tests.
  5412. 1323.34 s [vector] generateM: OK (0.01s)
  5413. 1323.34 s [vector] +++ OK, passed 100 tests.
  5414. 1323.34 s [vector] replicateM: OK (0.02s)
  5415. 1323.34 s [vector] +++ OK, passed 100 tests.
  5416. 1323.34 s [vector] create: OK
  5417. 1323.34 s [vector] +++ OK, passed 100 tests.
  5418. 1323.34 s [vector] createT: OK
  5419. 1323.34 s [vector] +++ OK, passed 100 tests.
  5420. 1323.34 s [vector] unfoldr: OK
  5421. 1323.34 s [vector] +++ OK, passed 100 tests.
  5422. 1323.34 s [vector] unfoldrN: OK
  5423. 1323.34 s [vector] +++ OK, passed 100 tests.
  5424. 1323.36 s [vector] unfoldrExactN: OK
  5425. 1323.36 s [vector] +++ OK, passed 100 tests.
  5426. 1323.36 s [vector] unfoldrM: OK
  5427. 1323.36 s [vector] +++ OK, passed 100 tests.
  5428. 1323.36 s [vector] unfoldrNM: OK
  5429. 1323.36 s [vector] +++ OK, passed 100 tests.
  5430. 1323.36 s [vector] unfoldrExactNM: OK (0.06s)
  5431. 1323.36 s [vector] +++ OK, passed 100 tests.
  5432. 1323.36 s [vector] constructN: OK
  5433. 1323.36 s [vector] +++ OK, passed 100 tests.
  5434. 1323.36 s [vector] constructrN: OK
  5435. 1323.36 s [vector] +++ OK, passed 100 tests.
  5436. 1323.36 s [vector] cons: OK
  5437. 1323.36 s [vector] +++ OK, passed 100 tests.
  5438. 1323.36 s [vector] snoc: OK
  5439. 1323.36 s [vector] +++ OK, passed 100 tests.
  5440. 1323.36 s [vector] append: OK
  5441. 1323.36 s [vector] +++ OK, passed 100 tests.
  5442. 1323.36 s [vector] concat: OK
  5443. 1323.36 s [vector] +++ OK, passed 100 tests.
  5444. 1323.36 s [vector] force: OK
  5445. 1323.36 s [vector] +++ OK, passed 100 tests.
  5446. 1323.36 s [vector] upd: OK
  5447. 1323.36 s [vector] +++ OK, passed 100 tests.
  5448. 1323.36 s [vector] accum: OK
  5449. 1323.36 s [vector] +++ OK, passed 100 tests.
  5450. 1323.36 s [vector] reverse: OK
  5451. 1323.36 s [vector] +++ OK, passed 100 tests.
  5452. 1323.36 s [vector] backpermute: OK
  5453. 1323.36 s [vector] +++ OK, passed 100 tests.
  5454. 1323.36 s [vector] map: OK
  5455. 1323.36 s [vector] +++ OK, passed 100 tests.
  5456. 1323.36 s [vector] imap: OK
  5457. 1323.36 s [vector] +++ OK, passed 100 tests.
  5458. 1323.36 s [vector] concatMap: OK
  5459. 1323.36 s [vector] +++ OK, passed 100 tests.
  5460. 1323.36 s [vector] mapM: OK
  5461. 1323.36 s [vector] +++ OK, passed 100 tests.
  5462. 1323.36 s [vector] mapM_: OK (0.01s)
  5463. 1323.36 s [vector] +++ OK, passed 100 tests.
  5464. 1323.36 s [vector] forM: OK
  5465. 1323.36 s [vector] +++ OK, passed 100 tests.
  5466. 1323.36 s [vector] forM_: OK (0.03s)
  5467. 1323.36 s [vector] +++ OK, passed 100 tests.
  5468. 1323.36 s [vector] imapM: OK
  5469. 1323.36 s [vector] +++ OK, passed 100 tests.
  5470. 1323.36 s [vector] imapM_: OK (0.01s)
  5471. 1323.36 s [vector] +++ OK, passed 100 tests.
  5472. 1323.36 s [vector] zipWith: OK
  5473. 1323.36 s [vector] +++ OK, passed 100 tests.
  5474. 1323.36 s [vector] zipWith3: OK
  5475. 1323.36 s [vector] +++ OK, passed 100 tests.
  5476. 1323.36 s [vector] izipWith: OK
  5477. 1323.36 s [vector] +++ OK, passed 100 tests.
  5478. 1323.36 s [vector] izipWith3: OK
  5479. 1323.36 s [vector] +++ OK, passed 100 tests.
  5480. 1323.36 s [vector] izipWithM: OK
  5481. 1323.36 s [vector] +++ OK, passed 100 tests.
  5482. 1323.36 s [vector] izipWithM_: OK
  5483. 1323.36 s [vector] +++ OK, passed 100 tests.
  5484. 1323.36 s [vector] zipWithM: OK
  5485. 1323.36 s [vector] +++ OK, passed 100 tests.
  5486. 1323.36 s [vector] zipWithM_: OK (0.01s)
  5487. 1323.36 s [vector] +++ OK, passed 100 tests.
  5488. 1323.36 s [vector] filter: OK
  5489. 1323.36 s [vector] +++ OK, passed 100 tests.
  5490. 1323.36 s [vector] ifilter: OK
  5491. 1323.36 s [vector] +++ OK, passed 100 tests.
  5492. 1323.37 s [vector] filterM: OK (0.02s)
  5493. 1323.37 s [vector] +++ OK, passed 100 tests.
  5494. 1323.37 s [vector] uniq: OK
  5495. 1323.37 s [vector] +++ OK, passed 100 tests.
  5496. 1323.38 s [vector] mapMaybe: OK
  5497. 1323.38 s [vector] +++ OK, passed 100 tests.
  5498. 1323.38 s [vector] imapMaybe: OK
  5499. 1323.38 s [vector] +++ OK, passed 100 tests.
  5500. 1323.38 s [vector] takeWhile: OK
  5501. 1323.38 s [vector] +++ OK, passed 100 tests.
  5502. 1323.38 s [vector] dropWhile: OK
  5503. 1323.38 s [vector] +++ OK, passed 100 tests.
  5504. 1323.38 s [vector] partition: OK
  5505. 1323.38 s [vector] +++ OK, passed 100 tests.
  5506. 1323.38 s [vector] partitionWith: OK
  5507. 1323.38 s [vector] +++ OK, passed 100 tests.
  5508. 1323.38 s [vector] span: OK
  5509. 1323.38 s [vector] +++ OK, passed 100 tests.
  5510. 1323.38 s [vector] break: OK
  5511. 1323.38 s [vector] +++ OK, passed 100 tests.
  5512. 1323.38 s [vector] spanR: OK
  5513. 1323.38 s [vector] +++ OK, passed 100 tests.
  5514. 1323.39 s [vector] breakR: OK
  5515. 1323.39 s [vector] +++ OK, passed 100 tests.
  5516. 1323.39 s [vector] groupBy: OK
  5517. 1323.39 s [vector] +++ OK, passed 100 tests.
  5518. 1323.39 s [vector] elem: OK
  5519. 1323.39 s [vector] +++ OK, passed 100 tests.
  5520. 1323.39 s [vector] notElem: OK
  5521. 1323.39 s [vector] +++ OK, passed 100 tests.
  5522. 1323.39 s [vector] find: OK
  5523. 1323.39 s [vector] +++ OK, passed 100 tests.
  5524. 1323.39 s [vector] findIndex: OK
  5525. 1323.39 s [vector] +++ OK, passed 100 tests.
  5526. 1323.40 s [vector] findIndexR: OK
  5527. 1323.40 s [vector] +++ OK, passed 100 tests.
  5528. 1323.40 s [vector] findIndices: OK
  5529. 1323.40 s [vector] +++ OK, passed 100 tests.
  5530. 1323.40 s [vector] elemIndex: OK
  5531. 1323.40 s [vector] +++ OK, passed 100 tests.
  5532. 1323.40 s [vector] elemIndices: OK
  5533. 1323.40 s [vector] +++ OK, passed 100 tests.
  5534. 1323.40 s [vector] foldl: OK
  5535. 1323.40 s [vector] +++ OK, passed 100 tests.
  5536. 1323.40 s [vector] foldl1: OK
  5537. 1323.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5538. 1323.40 s [vector] foldl': OK
  5539. 1323.40 s [vector] +++ OK, passed 100 tests.
  5540. 1323.40 s [vector] foldl1': OK
  5541. 1323.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5542. 1323.40 s [vector] foldr: OK
  5543. 1323.40 s [vector] +++ OK, passed 100 tests.
  5544. 1323.40 s [vector] foldr1: OK
  5545. 1323.40 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5546. 1323.40 s [vector] foldr': OK
  5547. 1323.41 s [vector] +++ OK, passed 100 tests.
  5548. 1323.41 s [vector] foldr1': OK
  5549. 1323.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5550. 1323.41 s [vector] ifoldl: OK
  5551. 1323.41 s [vector] +++ OK, passed 100 tests.
  5552. 1323.41 s [vector] ifoldl': OK
  5553. 1323.41 s [vector] +++ OK, passed 100 tests.
  5554. 1323.41 s [vector] ifoldr: OK
  5555. 1323.42 s [vector] +++ OK, passed 100 tests.
  5556. 1323.42 s [vector] ifoldr': OK
  5557. 1323.42 s [vector] +++ OK, passed 100 tests.
  5558. 1323.42 s [vector] ifoldM: OK
  5559. 1323.42 s [vector] +++ OK, passed 100 tests.
  5560. 1323.42 s [vector] ifoldM': OK
  5561. 1323.42 s [vector] +++ OK, passed 100 tests.
  5562. 1323.44 s [vector] ifoldM_: OK (0.01s)
  5563. 1323.44 s [vector] +++ OK, passed 100 tests.
  5564. 1323.45 s [vector] ifoldM'_: OK (0.01s)
  5565. 1323.45 s [vector] +++ OK, passed 100 tests.
  5566. 1323.45 s [vector] all: OK
  5567. 1323.45 s [vector] +++ OK, passed 100 tests.
  5568. 1323.45 s [vector] any: OK
  5569. 1323.45 s [vector] +++ OK, passed 100 tests.
  5570. 1323.46 s [vector] prescanl: OK
  5571. 1323.46 s [vector] +++ OK, passed 100 tests.
  5572. 1323.46 s [vector] prescanl': OK
  5573. 1323.46 s [vector] +++ OK, passed 100 tests.
  5574. 1323.46 s [vector] postscanl: OK
  5575. 1323.47 s [vector] +++ OK, passed 100 tests.
  5576. 1323.47 s [vector] postscanl': OK
  5577. 1323.47 s [vector] +++ OK, passed 100 tests.
  5578. 1323.47 s [vector] scanl: OK
  5579. 1323.48 s [vector] +++ OK, passed 100 tests.
  5580. 1323.48 s [vector] scanl': OK
  5581. 1323.48 s [vector] +++ OK, passed 100 tests.
  5582. 1323.48 s [vector] scanl1: OK
  5583. 1323.48 s [vector] +++ OK, passed 100 tests.
  5584. 1323.48 s [vector] scanl1': OK
  5585. 1323.48 s [vector] +++ OK, passed 100 tests.
  5586. 1323.49 s [vector] iscanl: OK
  5587. 1323.50 s [vector] +++ OK, passed 100 tests.
  5588. 1323.50 s [vector] iscanl': OK
  5589. 1323.50 s [vector] +++ OK, passed 100 tests.
  5590. 1323.50 s [vector] prescanr: OK
  5591. 1323.50 s [vector] +++ OK, passed 100 tests.
  5592. 1323.51 s [vector] prescanr': OK
  5593. 1323.52 s [vector] +++ OK, passed 100 tests.
  5594. 1323.52 s [vector] postscanr: OK
  5595. 1323.52 s [vector] +++ OK, passed 100 tests.
  5596. 1323.52 s [vector] postscanr': OK
  5597. 1323.52 s [vector] +++ OK, passed 100 tests.
  5598. 1323.52 s [vector] scanr: OK
  5599. 1323.53 s [vector] +++ OK, passed 100 tests.
  5600. 1323.53 s [vector] scanr': OK
  5601. 1323.53 s [vector] +++ OK, passed 100 tests.
  5602. 1323.54 s [vector] scanr1: OK
  5603. 1323.54 s [vector] +++ OK, passed 100 tests.
  5604. 1323.54 s [vector] scanr1': OK
  5605. 1323.54 s [vector] +++ OK, passed 100 tests.
  5606. 1323.54 s [vector] iscanr: OK
  5607. 1323.54 s [vector] +++ OK, passed 100 tests.
  5608. 1323.54 s [vector] iscanr': OK
  5609. 1323.54 s [vector] +++ OK, passed 100 tests.
  5610. 1323.54 s [vector] mut_read: OK
  5611. 1323.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5612. 1323.54 s [vector] mut_write: OK
  5613. 1323.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5614. 1323.54 s [vector] mut_modify: OK
  5615. 1323.55 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5616. 1323.55 s [vector] mut_generate: OK
  5617. 1323.55 s [vector] +++ OK, passed 100 tests.
  5618. 1323.55 s [vector] mut_generateM: OK
  5619. 1323.56 s [vector] +++ OK, passed 100 tests.
  5620. 1323.56 s [vector] mut_mapM_: OK (0.01s)
  5621. 1323.56 s [vector] +++ OK, passed 100 tests.
  5622. 1323.56 s [vector] mut_imapM_: OK (0.01s)
  5623. 1323.56 s [vector] +++ OK, passed 100 tests.
  5624. 1323.57 s [vector] mut_forM_: OK (0.01s)
  5625. 1323.57 s [vector] +++ OK, passed 100 tests.
  5626. 1323.57 s [vector] mut_iforM_: OK (0.01s)
  5627. 1323.57 s [vector] +++ OK, passed 100 tests.
  5628. 1323.57 s [vector] mut_foldr: OK
  5629. 1323.58 s [vector] +++ OK, passed 100 tests.
  5630. 1323.58 s [vector] mut_foldr': OK
  5631. 1323.58 s [vector] +++ OK, passed 100 tests.
  5632. 1323.58 s [vector] mut_foldl: OK
  5633. 1323.58 s [vector] +++ OK, passed 100 tests.
  5634. 1323.58 s [vector] mut_foldl': OK
  5635. 1323.58 s [vector] +++ OK, passed 100 tests.
  5636. 1323.58 s [vector] mut_ifoldr: OK
  5637. 1323.58 s [vector] +++ OK, passed 100 tests.
  5638. 1323.58 s [vector] mut_ifoldr': OK
  5639. 1323.58 s [vector] +++ OK, passed 100 tests.
  5640. 1323.58 s [vector] mut_ifoldl: OK
  5641. 1323.58 s [vector] +++ OK, passed 100 tests.
  5642. 1323.58 s [vector] mut_ifoldl': OK
  5643. 1323.58 s [vector] +++ OK, passed 100 tests.
  5644. 1323.58 s [vector] mut_foldM: OK
  5645. 1323.58 s [vector] +++ OK, passed 100 tests.
  5646. 1323.58 s [vector] mut_foldM': OK
  5647. 1323.58 s [vector] +++ OK, passed 100 tests.
  5648. 1323.58 s [vector] mut_foldrM: OK
  5649. 1323.58 s [vector] +++ OK, passed 100 tests.
  5650. 1323.58 s [vector] mut_foldrM': OK
  5651. 1323.59 s [vector] +++ OK, passed 100 tests.
  5652. 1323.59 s [vector] mut_ifoldM: OK
  5653. 1323.59 s [vector] +++ OK, passed 100 tests.
  5654. 1323.59 s [vector] mut_ifoldM': OK
  5655. 1323.59 s [vector] +++ OK, passed 100 tests.
  5656. 1323.59 s [vector] mut_ifoldrM: OK
  5657. 1323.59 s [vector] +++ OK, passed 100 tests.
  5658. 1323.59 s [vector] mut_ifoldrM': OK
  5659. 1323.59 s [vector] +++ OK, passed 100 tests.
  5660. 1323.59 s [vector] compare: OK
  5661. 1323.59 s [vector] +++ OK, passed 100 tests.
  5662. 1323.59 s [vector] maximum: OK
  5663. 1323.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5664. 1323.59 s [vector] minimum: OK
  5665. 1323.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5666. 1323.59 s [vector] minIndex: OK
  5667. 1323.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5668. 1323.59 s [vector] maxIndex: OK
  5669. 1323.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5670. 1323.59 s [vector] maximumBy: OK
  5671. 1323.59 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5672. 1323.59 s [vector] minimumBy: OK
  5673. 1323.59 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5674. 1323.59 s [vector] maximumOn: OK
  5675. 1323.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5676. 1323.59 s [vector] minimumOn: OK
  5677. 1323.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5678. 1323.59 s [vector] maxIndexBy: OK
  5679. 1323.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5680. 1323.59 s [vector] minIndexBy: OK
  5681. 1323.59 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5682. 1323.59 s [vector] ListFirstMaxIndexWins: OK
  5683. 1323.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5684. 1323.59 s [vector] FalseListFirstMaxIndexWins: OK
  5685. 1323.59 s [vector] +++ OK, failed as expected. (after 1 test):
  5686. 1323.59 s [vector] Exception:
  5687. 1323.59 s [vector] Prelude.foldr1: empty list
  5688. 1323.59 s [vector] CallStack (from HasCallStack):
  5689. 1323.59 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  5690. 1323.59 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  5691. 1323.59 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5692. 1323.59 s [vector] []
  5693. 1323.59 s [vector] zip: OK
  5694. 1323.59 s [vector] +++ OK, passed 100 tests.
  5695. 1323.59 s [vector] zip3: OK
  5696. 1323.59 s [vector] +++ OK, passed 100 tests.
  5697. 1323.59 s [vector] unzip: OK
  5698. 1323.60 s [vector] +++ OK, passed 100 tests.
  5699. 1323.60 s [vector] unzip3: OK
  5700. 1323.60 s [vector] +++ OK, passed 100 tests.
  5701. 1323.60 s [vector] indexed: OK
  5702. 1323.60 s [vector] +++ OK, passed 100 tests.
  5703. 1323.60 s [vector] update: OK
  5704. 1323.60 s [vector] +++ OK, passed 100 tests.
  5705. 1323.60 s [vector] concat: OK
  5706. 1323.60 s [vector] +++ OK, passed 100 tests.
  5707. 1323.60 s [vector] mempty: OK
  5708. 1323.60 s [vector] +++ OK, passed 100 tests.
  5709. 1323.60 s [vector] mappend: OK
  5710. 1323.60 s [vector] +++ OK, passed 100 tests.
  5711. 1323.61 s [vector] mconcat: OK
  5712. 1323.61 s [vector] +++ OK, passed 100 tests.
  5713. 1323.62 s [vector] fmap: OK
  5714. 1323.62 s [vector] +++ OK, passed 100 tests.
  5715. 1323.62 s [vector] return: OK
  5716. 1323.62 s [vector] +++ OK, passed 100 tests.
  5717. 1323.62 s [vector] bind: OK (0.01s)
  5718. 1323.63 s [vector] +++ OK, passed 100 tests.
  5719. 1323.64 s [vector] mzip: OK
  5720. 1323.64 s [vector] +++ OK, passed 100 tests.
  5721. 1323.65 s [vector] munzip: OK
  5722. 1323.65 s [vector] +++ OK, passed 100 tests.
  5723. 1323.65 s [vector] applicative_pure: OK
  5724. 1323.65 s [vector] +++ OK, passed 100 tests.
  5725. 1323.65 s [vector] applicative_appl: OK (0.02s)
  5726. 1323.65 s [vector] +++ OK, passed 100 tests.
  5727. 1323.66 s [vector] alternative_empty: OK
  5728. 1323.66 s [vector] +++ OK, passed 100 tests.
  5729. 1323.66 s [vector] alternative_or: OK
  5730. 1323.66 s [vector] +++ OK, passed 100 tests.
  5731. 1323.70 s [vector] sequence: OK (0.04s)
  5732. 1323.70 s [vector] +++ OK, passed 100 tests.
  5733. 1323.70 s [vector] sequence_: OK
  5734. 1323.70 s [vector] +++ OK, passed 100 tests.
  5735. 1323.70 s [vector] glength: OK
  5736. 1323.70 s [vector] +++ OK, passed 100 tests.
  5737. 1323.70 s [vector] and: OK
  5738. 1323.70 s [vector] +++ OK, passed 100 tests.
  5739. 1323.70 s [vector] or: OK
  5740. 1323.70 s [vector] +++ OK, passed 100 tests.
  5741. 1323.70 s [vector] Int
  5742. 1323.70 s [vector] fromList.toList == id: OK
  5743. 1323.70 s [vector] +++ OK, passed 100 tests.
  5744. 1323.70 s [vector] toList.fromList == id: OK
  5745. 1323.70 s [vector] +++ OK, passed 100 tests.
  5746. 1323.70 s [vector] unstream.stream == id: OK
  5747. 1323.70 s [vector] +++ OK, passed 100 tests.
  5748. 1323.70 s [vector] stream.unstream == id: OK
  5749. 1323.70 s [vector] +++ OK, passed 100 tests.
  5750. 1323.70 s [vector] eq: OK
  5751. 1323.70 s [vector] +++ OK, passed 100 tests.
  5752. 1323.70 s [vector] length: OK
  5753. 1323.70 s [vector] +++ OK, passed 100 tests.
  5754. 1323.71 s [vector] null: OK
  5755. 1323.71 s [vector] +++ OK, passed 100 tests.
  5756. 1323.71 s [vector] index: OK
  5757. 1323.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5758. 1323.71 s [vector] safeIndex: OK
  5759. 1323.71 s [vector] +++ OK, passed 100 tests.
  5760. 1323.71 s [vector] head: OK
  5761. 1323.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5762. 1323.71 s [vector] last: OK
  5763. 1323.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5764. 1323.71 s [vector] unsafeIndex: OK
  5765. 1323.71 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5766. 1323.71 s [vector] unsafeHead: OK
  5767. 1323.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5768. 1323.71 s [vector] unsafeLast: OK
  5769. 1323.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5770. 1323.71 s [vector] slice: OK
  5771. 1323.71 s [vector] +++ OK, passed 100 tests.
  5772. 1323.71 s [vector] init: OK
  5773. 1323.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5774. 1323.71 s [vector] tail: OK
  5775. 1323.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5776. 1323.71 s [vector] take: OK
  5777. 1323.71 s [vector] +++ OK, passed 100 tests.
  5778. 1323.71 s [vector] drop: OK
  5779. 1323.71 s [vector] +++ OK, passed 100 tests.
  5780. 1323.71 s [vector] splitAt: OK
  5781. 1323.71 s [vector] +++ OK, passed 100 tests.
  5782. 1323.71 s [vector] empty: OK
  5783. 1323.71 s [vector] +++ OK, passed 100 tests.
  5784. 1323.71 s [vector] singleton: OK
  5785. 1323.71 s [vector] +++ OK, passed 100 tests.
  5786. 1323.71 s [vector] replicate: OK
  5787. 1323.71 s [vector] +++ OK, passed 100 tests.
  5788. 1323.71 s [vector] generate: OK
  5789. 1323.71 s [vector] +++ OK, passed 100 tests.
  5790. 1323.72 s [vector] iterateN: OK
  5791. 1323.72 s [vector] +++ OK, passed 100 tests.
  5792. 1323.76 s [vector] iterateNM: OK (0.03s)
  5793. 1323.76 s [vector] +++ OK, passed 100 tests.
  5794. 1323.77 s [vector] generateM: OK (0.02s)
  5795. 1323.77 s [vector] +++ OK, passed 100 tests.
  5796. 1323.77 s [vector] replicateM: OK
  5797. 1323.77 s [vector] +++ OK, passed 100 tests.
  5798. 1323.77 s [vector] create: OK
  5799. 1323.77 s [vector] +++ OK, passed 100 tests.
  5800. 1323.77 s [vector] createT: OK
  5801. 1323.77 s [vector] +++ OK, passed 100 tests.
  5802. 1323.77 s [vector] unfoldr: OK
  5803. 1323.77 s [vector] +++ OK, passed 100 tests.
  5804. 1323.77 s [vector] unfoldrN: OK
  5805. 1323.77 s [vector] +++ OK, passed 100 tests.
  5806. 1323.77 s [vector] unfoldrExactN: OK
  5807. 1323.77 s [vector] +++ OK, passed 100 tests.
  5808. 1323.78 s [vector] unfoldrM: OK
  5809. 1323.78 s [vector] +++ OK, passed 100 tests.
  5810. 1323.78 s [vector] unfoldrNM: OK
  5811. 1323.78 s [vector] +++ OK, passed 100 tests.
  5812. 1323.84 s [vector] unfoldrExactNM: OK (0.05s)
  5813. 1323.84 s [vector] +++ OK, passed 100 tests.
  5814. 1323.84 s [vector] constructN: OK
  5815. 1323.84 s [vector] +++ OK, passed 100 tests.
  5816. 1323.84 s [vector] constructrN: OK
  5817. 1323.85 s [vector] +++ OK, passed 100 tests.
  5818. 1323.85 s [vector] cons: OK
  5819. 1323.86 s [vector] +++ OK, passed 100 tests.
  5820. 1323.86 s [vector] snoc: OK
  5821. 1323.86 s [vector] +++ OK, passed 100 tests.
  5822. 1323.86 s [vector] append: OK
  5823. 1323.86 s [vector] +++ OK, passed 100 tests.
  5824. 1323.86 s [vector] concat: OK (0.01s)
  5825. 1323.86 s [vector] +++ OK, passed 100 tests.
  5826. 1323.86 s [vector] force: OK
  5827. 1323.86 s [vector] +++ OK, passed 100 tests.
  5828. 1323.87 s [vector] upd: OK
  5829. 1323.87 s [vector] +++ OK, passed 100 tests.
  5830. 1323.87 s [vector] accum: OK
  5831. 1323.87 s [vector] +++ OK, passed 100 tests.
  5832. 1323.87 s [vector] reverse: OK
  5833. 1323.87 s [vector] +++ OK, passed 100 tests.
  5834. 1323.87 s [vector] backpermute: OK
  5835. 1323.87 s [vector] +++ OK, passed 100 tests.
  5836. 1323.87 s [vector] map: OK
  5837. 1323.87 s [vector] +++ OK, passed 100 tests.
  5838. 1323.88 s [vector] imap: OK
  5839. 1323.88 s [vector] +++ OK, passed 100 tests.
  5840. 1323.88 s [vector] concatMap: OK
  5841. 1323.88 s [vector] +++ OK, passed 100 tests.
  5842. 1323.90 s [vector] mapM: OK
  5843. 1323.90 s [vector] +++ OK, passed 100 tests.
  5844. 1323.92 s [vector] mapM_: OK (0.02s)
  5845. 1323.92 s [vector] +++ OK, passed 100 tests.
  5846. 1323.92 s [vector] forM: OK
  5847. 1323.92 s [vector] +++ OK, passed 100 tests.
  5848. 1323.92 s [vector] forM_: OK
  5849. 1323.92 s [vector] +++ OK, passed 100 tests.
  5850. 1323.92 s [vector] imapM: OK
  5851. 1323.92 s [vector] +++ OK, passed 100 tests.
  5852. 1323.94 s [vector] imapM_: OK
  5853. 1323.94 s [vector] +++ OK, passed 100 tests.
  5854. 1323.95 s [vector] zipWith: OK
  5855. 1323.95 s [vector] +++ OK, passed 100 tests.
  5856. 1323.95 s [vector] zipWith3: OK
  5857. 1323.95 s [vector] +++ OK, passed 100 tests.
  5858. 1323.95 s [vector] izipWith: OK
  5859. 1323.96 s [vector] +++ OK, passed 100 tests.
  5860. 1323.96 s [vector] izipWith3: OK
  5861. 1323.96 s [vector] +++ OK, passed 100 tests.
  5862. 1323.96 s [vector] izipWithM: OK
  5863. 1323.96 s [vector] +++ OK, passed 100 tests.
  5864. 1323.97 s [vector] izipWithM_: OK (0.02s)
  5865. 1323.97 s [vector] +++ OK, passed 100 tests.
  5866. 1323.98 s [vector] zipWithM: OK
  5867. 1323.98 s [vector] +++ OK, passed 100 tests.
  5868. 1323.99 s [vector] zipWithM_: OK (0.01s)
  5869. 1323.99 s [vector] +++ OK, passed 100 tests.
  5870. 1324.00 s [vector] filter: OK
  5871. 1324.00 s [vector] +++ OK, passed 100 tests.
  5872. 1324.00 s [vector] ifilter: OK
  5873. 1324.00 s [vector] +++ OK, passed 100 tests.
  5874. 1324.03 s [vector] filterM: OK (0.04s)
  5875. 1324.04 s [vector] +++ OK, passed 100 tests.
  5876. 1324.04 s [vector] uniq: OK
  5877. 1324.04 s [vector] +++ OK, passed 100 tests.
  5878. 1324.04 s [vector] mapMaybe: OK
  5879. 1324.04 s [vector] +++ OK, passed 100 tests.
  5880. 1324.04 s [vector] imapMaybe: OK
  5881. 1324.04 s [vector] +++ OK, passed 100 tests.
  5882. 1324.04 s [vector] takeWhile: OK
  5883. 1324.04 s [vector] +++ OK, passed 100 tests.
  5884. 1324.04 s [vector] dropWhile: OK
  5885. 1324.05 s [vector] +++ OK, passed 100 tests.
  5886. 1324.05 s [vector] partition: OK
  5887. 1324.05 s [vector] +++ OK, passed 100 tests.
  5888. 1324.05 s [vector] partitionWith: OK
  5889. 1324.05 s [vector] +++ OK, passed 100 tests.
  5890. 1324.05 s [vector] span: OK
  5891. 1324.05 s [vector] +++ OK, passed 100 tests.
  5892. 1324.05 s [vector] break: OK
  5893. 1324.06 s [vector] +++ OK, passed 100 tests.
  5894. 1324.06 s [vector] spanR: OK
  5895. 1324.06 s [vector] +++ OK, passed 100 tests.
  5896. 1324.06 s [vector] breakR: OK
  5897. 1324.06 s [vector] +++ OK, passed 100 tests.
  5898. 1324.06 s [vector] groupBy: OK
  5899. 1324.06 s [vector] +++ OK, passed 100 tests.
  5900. 1324.06 s [vector] elem: OK
  5901. 1324.06 s [vector] +++ OK, passed 100 tests.
  5902. 1324.06 s [vector] notElem: OK
  5903. 1324.06 s [vector] +++ OK, passed 100 tests.
  5904. 1324.06 s [vector] find: OK
  5905. 1324.06 s [vector] +++ OK, passed 100 tests.
  5906. 1324.06 s [vector] findIndex: OK
  5907. 1324.06 s [vector] +++ OK, passed 100 tests.
  5908. 1324.06 s [vector] findIndexR: OK
  5909. 1324.06 s [vector] +++ OK, passed 100 tests.
  5910. 1324.06 s [vector] findIndices: OK
  5911. 1324.06 s [vector] +++ OK, passed 100 tests.
  5912. 1324.07 s [vector] elemIndex: OK
  5913. 1324.07 s [vector] +++ OK, passed 100 tests.
  5914. 1324.07 s [vector] elemIndices: OK
  5915. 1324.07 s [vector] +++ OK, passed 100 tests.
  5916. 1324.07 s [vector] foldl: OK
  5917. 1324.07 s [vector] +++ OK, passed 100 tests.
  5918. 1324.07 s [vector] foldl1: OK
  5919. 1324.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5920. 1324.07 s [vector] foldl': OK
  5921. 1324.07 s [vector] +++ OK, passed 100 tests.
  5922. 1324.07 s [vector] foldl1': OK
  5923. 1324.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5924. 1324.08 s [vector] foldr: OK
  5925. 1324.08 s [vector] +++ OK, passed 100 tests.
  5926. 1324.08 s [vector] foldr1: OK
  5927. 1324.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5928. 1324.08 s [vector] foldr': OK
  5929. 1324.08 s [vector] +++ OK, passed 100 tests.
  5930. 1324.09 s [vector] foldr1': OK
  5931. 1324.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5932. 1324.09 s [vector] ifoldl: OK
  5933. 1324.09 s [vector] +++ OK, passed 100 tests.
  5934. 1324.10 s [vector] ifoldl': OK
  5935. 1324.10 s [vector] +++ OK, passed 100 tests.
  5936. 1324.12 s [vector] ifoldr: OK
  5937. 1324.12 s [vector] +++ OK, passed 100 tests.
  5938. 1324.12 s [vector] ifoldr': OK
  5939. 1324.12 s [vector] +++ OK, passed 100 tests.
  5940. 1324.12 s [vector] ifoldM: OK
  5941. 1324.12 s [vector] +++ OK, passed 100 tests.
  5942. 1324.12 s [vector] ifoldM': OK
  5943. 1324.12 s [vector] +++ OK, passed 100 tests.
  5944. 1324.14 s [vector] ifoldM_: OK (0.02s)
  5945. 1324.14 s [vector] +++ OK, passed 100 tests.
  5946. 1324.15 s [vector] ifoldM'_: OK (0.02s)
  5947. 1324.15 s [vector] +++ OK, passed 100 tests.
  5948. 1324.15 s [vector] all: OK
  5949. 1324.16 s [vector] +++ OK, passed 100 tests.
  5950. 1324.16 s [vector] any: OK
  5951. 1324.16 s [vector] +++ OK, passed 100 tests.
  5952. 1324.16 s [vector] prescanl: OK
  5953. 1324.16 s [vector] +++ OK, passed 100 tests.
  5954. 1324.16 s [vector] prescanl': OK
  5955. 1324.16 s [vector] +++ OK, passed 100 tests.
  5956. 1324.16 s [vector] postscanl: OK
  5957. 1324.16 s [vector] +++ OK, passed 100 tests.
  5958. 1324.16 s [vector] postscanl': OK
  5959. 1324.16 s [vector] +++ OK, passed 100 tests.
  5960. 1324.17 s [vector] scanl: OK
  5961. 1324.17 s [vector] +++ OK, passed 100 tests.
  5962. 1324.17 s [vector] scanl': OK
  5963. 1324.17 s [vector] +++ OK, passed 100 tests.
  5964. 1324.17 s [vector] scanl1: OK
  5965. 1324.17 s [vector] +++ OK, passed 100 tests.
  5966. 1324.18 s [vector] scanl1': OK
  5967. 1324.18 s [vector] +++ OK, passed 100 tests.
  5968. 1324.18 s [vector] iscanl: OK
  5969. 1324.19 s [vector] +++ OK, passed 100 tests.
  5970. 1324.19 s [vector] iscanl': OK
  5971. 1324.19 s [vector] +++ OK, passed 100 tests.
  5972. 1324.19 s [vector] prescanr: OK
  5973. 1324.19 s [vector] +++ OK, passed 100 tests.
  5974. 1324.19 s [vector] prescanr': OK
  5975. 1324.19 s [vector] +++ OK, passed 100 tests.
  5976. 1324.20 s [vector] postscanr: OK
  5977. 1324.20 s [vector] +++ OK, passed 100 tests.
  5978. 1324.20 s [vector] postscanr': OK
  5979. 1324.20 s [vector] +++ OK, passed 100 tests.
  5980. 1324.20 s [vector] scanr: OK
  5981. 1324.20 s [vector] +++ OK, passed 100 tests.
  5982. 1324.20 s [vector] scanr': OK
  5983. 1324.20 s [vector] +++ OK, passed 100 tests.
  5984. 1324.20 s [vector] scanr1: OK
  5985. 1324.20 s [vector] +++ OK, passed 100 tests.
  5986. 1324.21 s [vector] scanr1': OK
  5987. 1324.21 s [vector] +++ OK, passed 100 tests.
  5988. 1324.21 s [vector] iscanr: OK
  5989. 1324.21 s [vector] +++ OK, passed 100 tests.
  5990. 1324.21 s [vector] iscanr': OK
  5991. 1324.22 s [vector] +++ OK, passed 100 tests.
  5992. 1324.22 s [vector] mut_read: OK
  5993. 1324.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5994. 1324.22 s [vector] mut_write: OK
  5995. 1324.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5996. 1324.22 s [vector] mut_modify: OK
  5997. 1324.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5998. 1324.22 s [vector] mut_generate: OK
  5999. 1324.22 s [vector] +++ OK, passed 100 tests.
  6000. 1324.24 s [vector] mut_generateM: OK (0.01s)
  6001. 1324.24 s [vector] +++ OK, passed 100 tests.
  6002. 1324.26 s [vector] mut_mapM_: OK (0.02s)
  6003. 1324.26 s [vector] +++ OK, passed 100 tests.
  6004. 1324.28 s [vector] mut_imapM_: OK (0.02s)
  6005. 1324.28 s [vector] +++ OK, passed 100 tests.
  6006. 1324.30 s [vector] mut_forM_: OK (0.02s)
  6007. 1324.30 s [vector] +++ OK, passed 100 tests.
  6008. 1324.31 s [vector] mut_iforM_: OK (0.02s)
  6009. 1324.31 s [vector] +++ OK, passed 100 tests.
  6010. 1324.31 s [vector] mut_foldr: OK
  6011. 1324.32 s [vector] +++ OK, passed 100 tests.
  6012. 1324.32 s [vector] mut_foldr': OK
  6013. 1324.32 s [vector] +++ OK, passed 100 tests.
  6014. 1324.32 s [vector] mut_foldl: OK
  6015. 1324.32 s [vector] +++ OK, passed 100 tests.
  6016. 1324.32 s [vector] mut_foldl': OK
  6017. 1324.32 s [vector] +++ OK, passed 100 tests.
  6018. 1324.33 s [vector] mut_ifoldr: OK
  6019. 1324.33 s [vector] +++ OK, passed 100 tests.
  6020. 1324.33 s [vector] mut_ifoldr': OK
  6021. 1324.33 s [vector] +++ OK, passed 100 tests.
  6022. 1324.33 s [vector] mut_ifoldl: OK
  6023. 1324.34 s [vector] +++ OK, passed 100 tests.
  6024. 1324.34 s [vector] mut_ifoldl': OK
  6025. 1324.34 s [vector] +++ OK, passed 100 tests.
  6026. 1324.34 s [vector] mut_foldM: OK
  6027. 1324.34 s [vector] +++ OK, passed 100 tests.
  6028. 1324.34 s [vector] mut_foldM': OK
  6029. 1324.34 s [vector] +++ OK, passed 100 tests.
  6030. 1324.35 s [vector] mut_foldrM: OK
  6031. 1324.35 s [vector] +++ OK, passed 100 tests.
  6032. 1324.35 s [vector] mut_foldrM': OK
  6033. 1324.35 s [vector] +++ OK, passed 100 tests.
  6034. 1324.35 s [vector] mut_ifoldM: OK
  6035. 1324.35 s [vector] +++ OK, passed 100 tests.
  6036. 1324.36 s [vector] mut_ifoldM': OK
  6037. 1324.36 s [vector] +++ OK, passed 100 tests.
  6038. 1324.36 s [vector] mut_ifoldrM: OK
  6039. 1324.36 s [vector] +++ OK, passed 100 tests.
  6040. 1324.36 s [vector] mut_ifoldrM': OK
  6041. 1324.36 s [vector] +++ OK, passed 100 tests.
  6042. 1324.36 s [vector] compare: OK
  6043. 1324.36 s [vector] +++ OK, passed 100 tests.
  6044. 1324.36 s [vector] maximum: OK
  6045. 1324.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6046. 1324.36 s [vector] minimum: OK
  6047. 1324.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6048. 1324.37 s [vector] minIndex: OK
  6049. 1324.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6050. 1324.37 s [vector] maxIndex: OK
  6051. 1324.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6052. 1324.37 s [vector] maximumBy: OK
  6053. 1324.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6054. 1324.37 s [vector] minimumBy: OK
  6055. 1324.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6056. 1324.37 s [vector] maximumOn: OK
  6057. 1324.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6058. 1324.37 s [vector] minimumOn: OK
  6059. 1324.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6060. 1324.37 s [vector] maxIndexBy: OK
  6061. 1324.37 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6062. 1324.37 s [vector] minIndexBy: OK
  6063. 1324.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6064. 1324.37 s [vector] ListFirstMaxIndexWins: OK
  6065. 1324.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6066. 1324.37 s [vector] FalseListFirstMaxIndexWins: OK
  6067. 1324.37 s [vector] +++ OK, failed as expected. (after 1 test):
  6068. 1324.37 s [vector] Exception:
  6069. 1324.37 s [vector] Prelude.foldr1: empty list
  6070. 1324.37 s [vector] CallStack (from HasCallStack):
  6071. 1324.37 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6072. 1324.37 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6073. 1324.37 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6074. 1324.37 s [vector] []
  6075. 1324.37 s [vector] zip: OK
  6076. 1324.38 s [vector] +++ OK, passed 100 tests.
  6077. 1324.38 s [vector] zip3: OK
  6078. 1324.38 s [vector] +++ OK, passed 100 tests.
  6079. 1324.38 s [vector] unzip: OK
  6080. 1324.38 s [vector] +++ OK, passed 100 tests.
  6081. 1324.38 s [vector] unzip3: OK
  6082. 1324.38 s [vector] +++ OK, passed 100 tests.
  6083. 1324.38 s [vector] indexed: OK
  6084. 1324.38 s [vector] +++ OK, passed 100 tests.
  6085. 1324.39 s [vector] update: OK
  6086. 1324.39 s [vector] +++ OK, passed 100 tests.
  6087. 1324.39 s [vector] concat: OK (0.01s)
  6088. 1324.39 s [vector] +++ OK, passed 100 tests.
  6089. 1324.39 s [vector] mempty: OK
  6090. 1324.39 s [vector] +++ OK, passed 100 tests.
  6091. 1324.39 s [vector] mappend: OK
  6092. 1324.39 s [vector] +++ OK, passed 100 tests.
  6093. 1324.41 s [vector] mconcat: OK
  6094. 1324.41 s [vector] +++ OK, passed 100 tests.
  6095. 1324.41 s [vector] fmap: OK
  6096. 1324.41 s [vector] +++ OK, passed 100 tests.
  6097. 1324.42 s [vector] return: OK
  6098. 1324.42 s [vector] +++ OK, passed 100 tests.
  6099. 1324.43 s [vector] bind: OK (0.02s)
  6100. 1324.43 s [vector] +++ OK, passed 100 tests.
  6101. 1324.43 s [vector] mzip: OK
  6102. 1324.43 s [vector] +++ OK, passed 100 tests.
  6103. 1324.43 s [vector] munzip: OK
  6104. 1324.43 s [vector] +++ OK, passed 100 tests.
  6105. 1324.44 s [vector] applicative_pure: OK
  6106. 1324.44 s [vector] +++ OK, passed 100 tests.
  6107. 1324.47 s [vector] applicative_appl: OK (0.04s)
  6108. 1324.47 s [vector] +++ OK, passed 100 tests.
  6109. 1324.48 s [vector] alternative_empty: OK
  6110. 1324.48 s [vector] +++ OK, passed 100 tests.
  6111. 1324.48 s [vector] alternative_or: OK
  6112. 1324.48 s [vector] +++ OK, passed 100 tests.
  6113. 1324.50 s [vector] sequence: OK (0.03s)
  6114. 1324.50 s [vector] +++ OK, passed 100 tests.
  6115. 1324.51 s [vector] sequence_: OK (0.01s)
  6116. 1324.51 s [vector] +++ OK, passed 100 tests.
  6117. 1324.51 s [vector] glength: OK
  6118. 1324.51 s [vector] +++ OK, passed 100 tests.
  6119. 1324.51 s [vector] sum: OK
  6120. 1324.51 s [vector] +++ OK, passed 100 tests.
  6121. 1324.52 s [vector] product: OK
  6122. 1324.52 s [vector] +++ OK, passed 100 tests.
  6123. 1324.52 s [vector] enumFromN: OK
  6124. 1324.52 s [vector] +++ OK, passed 100 tests.
  6125. 1324.52 s [vector] enumFromThenN: OK
  6126. 1324.52 s [vector] +++ OK, passed 100 tests.
  6127. 1324.52 s [vector] enumFromTo: OK
  6128. 1324.52 s [vector] +++ OK, passed 100 tests.
  6129. 1324.52 s [vector] enumFromThenTo: OK
  6130. 1324.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6131. 1324.52 s [vector] unstream
  6132. 1324.52 s [vector] unstream == vunstream (exact): OK
  6133. 1324.52 s [vector] +++ OK, passed 100 tests.
  6134. 1324.52 s [vector] unstream == vunstream (unknown): OK
  6135. 1324.52 s [vector] +++ OK, passed 100 tests.
  6136. 1324.52 s [vector] unstreamR ~= vunstream (exact): OK
  6137. 1324.53 s [vector] +++ OK, passed 100 tests.
  6138. 1324.53 s [vector] unstreamR ~= vunstream (unknown): OK
  6139. 1324.53 s [vector] +++ OK, passed 100 tests.
  6140. 1324.53 s [vector] Tests.Vector.Primitive
  6141. 1324.53 s [vector] Int
  6142. 1324.53 s [vector] fromList.toList == id: OK
  6143. 1324.53 s [vector] +++ OK, passed 100 tests.
  6144. 1324.53 s [vector] toList.fromList == id: OK
  6145. 1324.53 s [vector] +++ OK, passed 100 tests.
  6146. 1324.53 s [vector] unstream.stream == id: OK
  6147. 1324.53 s [vector] +++ OK, passed 100 tests.
  6148. 1324.53 s [vector] stream.unstream == id: OK
  6149. 1324.53 s [vector] +++ OK, passed 100 tests.
  6150. 1324.53 s [vector] eq: OK
  6151. 1324.53 s [vector] +++ OK, passed 100 tests.
  6152. 1324.53 s [vector] length: OK
  6153. 1324.53 s [vector] +++ OK, passed 100 tests.
  6154. 1324.53 s [vector] null: OK
  6155. 1324.53 s [vector] +++ OK, passed 100 tests.
  6156. 1324.53 s [vector] index: OK
  6157. 1324.53 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6158. 1324.53 s [vector] safeIndex: OK
  6159. 1324.53 s [vector] +++ OK, passed 100 tests.
  6160. 1324.53 s [vector] head: OK
  6161. 1324.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6162. 1324.53 s [vector] last: OK
  6163. 1324.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6164. 1324.53 s [vector] unsafeIndex: OK
  6165. 1324.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6166. 1324.53 s [vector] unsafeHead: OK
  6167. 1324.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6168. 1324.54 s [vector] unsafeLast: OK
  6169. 1324.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6170. 1324.54 s [vector] slice: OK
  6171. 1324.54 s [vector] +++ OK, passed 100 tests.
  6172. 1324.54 s [vector] init: OK
  6173. 1324.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6174. 1324.54 s [vector] tail: OK
  6175. 1324.54 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6176. 1324.54 s [vector] take: OK
  6177. 1324.54 s [vector] +++ OK, passed 100 tests.
  6178. 1324.54 s [vector] drop: OK
  6179. 1324.54 s [vector] +++ OK, passed 100 tests.
  6180. 1324.54 s [vector] splitAt: OK
  6181. 1324.54 s [vector] +++ OK, passed 100 tests.
  6182. 1324.54 s [vector] empty: OK
  6183. 1324.54 s [vector] +++ OK, passed 100 tests.
  6184. 1324.54 s [vector] singleton: OK
  6185. 1324.54 s [vector] +++ OK, passed 100 tests.
  6186. 1324.54 s [vector] replicate: OK
  6187. 1324.54 s [vector] +++ OK, passed 100 tests.
  6188. 1324.54 s [vector] generate: OK
  6189. 1324.54 s [vector] +++ OK, passed 100 tests.
  6190. 1324.55 s [vector] iterateN: OK
  6191. 1324.55 s [vector] +++ OK, passed 100 tests.
  6192. 1324.60 s [vector] iterateNM: OK (0.05s)
  6193. 1324.60 s [vector] +++ OK, passed 100 tests.
  6194. 1324.62 s [vector] generateM: OK (0.02s)
  6195. 1324.62 s [vector] +++ OK, passed 100 tests.
  6196. 1324.62 s [vector] replicateM: OK
  6197. 1324.62 s [vector] +++ OK, passed 100 tests.
  6198. 1324.62 s [vector] create: OK
  6199. 1324.62 s [vector] +++ OK, passed 100 tests.
  6200. 1324.62 s [vector] createT: OK
  6201. 1324.62 s [vector] +++ OK, passed 100 tests.
  6202. 1324.62 s [vector] unfoldr: OK
  6203. 1324.62 s [vector] +++ OK, passed 100 tests.
  6204. 1324.62 s [vector] unfoldrN: OK
  6205. 1324.62 s [vector] +++ OK, passed 100 tests.
  6206. 1324.64 s [vector] unfoldrExactN: OK
  6207. 1324.64 s [vector] +++ OK, passed 100 tests.
  6208. 1324.64 s [vector] unfoldrM: OK
  6209. 1324.64 s [vector] +++ OK, passed 100 tests.
  6210. 1324.66 s [vector] unfoldrNM: OK (0.02s)
  6211. 1324.66 s [vector] +++ OK, passed 100 tests.
  6212. 1324.70 s [vector] unfoldrExactNM: OK (0.04s)
  6213. 1324.70 s [vector] +++ OK, passed 100 tests.
  6214. 1324.71 s [vector] constructN: OK (0.01s)
  6215. 1324.71 s [vector] +++ OK, passed 100 tests.
  6216. 1324.71 s [vector] constructrN: OK
  6217. 1324.72 s [vector] +++ OK, passed 100 tests.
  6218. 1324.72 s [vector] cons: OK
  6219. 1324.72 s [vector] +++ OK, passed 100 tests.
  6220. 1324.72 s [vector] snoc: OK
  6221. 1324.72 s [vector] +++ OK, passed 100 tests.
  6222. 1324.72 s [vector] append: OK
  6223. 1324.72 s [vector] +++ OK, passed 100 tests.
  6224. 1324.74 s [vector] concat: OK (0.02s)
  6225. 1324.74 s [vector] +++ OK, passed 100 tests.
  6226. 1324.74 s [vector] force: OK
  6227. 1324.74 s [vector] +++ OK, passed 100 tests.
  6228. 1324.74 s [vector] upd: OK
  6229. 1324.75 s [vector] +++ OK, passed 100 tests.
  6230. 1324.75 s [vector] accum: OK
  6231. 1324.75 s [vector] +++ OK, passed 100 tests.
  6232. 1324.75 s [vector] reverse: OK
  6233. 1324.75 s [vector] +++ OK, passed 100 tests.
  6234. 1324.75 s [vector] backpermute: OK
  6235. 1324.75 s [vector] +++ OK, passed 100 tests.
  6236. 1324.75 s [vector] map: OK
  6237. 1324.75 s [vector] +++ OK, passed 100 tests.
  6238. 1324.76 s [vector] imap: OK
  6239. 1324.76 s [vector] +++ OK, passed 100 tests.
  6240. 1324.76 s [vector] concatMap: OK
  6241. 1324.76 s [vector] +++ OK, passed 100 tests.
  6242. 1324.76 s [vector] mapM: OK
  6243. 1324.76 s [vector] +++ OK, passed 100 tests.
  6244. 1324.78 s [vector] mapM_: OK (0.02s)
  6245. 1324.78 s [vector] +++ OK, passed 100 tests.
  6246. 1324.80 s [vector] forM: OK
  6247. 1324.80 s [vector] +++ OK, passed 100 tests.
  6248. 1324.82 s [vector] forM_: OK (0.03s)
  6249. 1324.82 s [vector] +++ OK, passed 100 tests.
  6250. 1324.82 s [vector] imapM: OK
  6251. 1324.82 s [vector] +++ OK, passed 100 tests.
  6252. 1324.84 s [vector] imapM_: OK (0.01s)
  6253. 1324.84 s [vector] +++ OK, passed 100 tests.
  6254. 1324.84 s [vector] zipWith: OK
  6255. 1324.84 s [vector] +++ OK, passed 100 tests.
  6256. 1324.85 s [vector] zipWith3: OK
  6257. 1324.86 s [vector] +++ OK, passed 100 tests.
  6258. 1324.86 s [vector] izipWith: OK
  6259. 1324.86 s [vector] +++ OK, passed 100 tests.
  6260. 1324.86 s [vector] izipWith3: OK
  6261. 1324.86 s [vector] +++ OK, passed 100 tests.
  6262. 1324.86 s [vector] izipWithM: OK
  6263. 1324.86 s [vector] +++ OK, passed 100 tests.
  6264. 1324.87 s [vector] izipWithM_: OK (0.02s)
  6265. 1324.88 s [vector] +++ OK, passed 100 tests.
  6266. 1324.88 s [vector] zipWithM: OK
  6267. 1324.88 s [vector] +++ OK, passed 100 tests.
  6268. 1324.89 s [vector] zipWithM_: OK (0.02s)
  6269. 1324.89 s [vector] +++ OK, passed 100 tests.
  6270. 1324.90 s [vector] filter: OK
  6271. 1324.90 s [vector] +++ OK, passed 100 tests.
  6272. 1324.90 s [vector] ifilter: OK
  6273. 1324.90 s [vector] +++ OK, passed 100 tests.
  6274. 1324.93 s [vector] filterM: OK (0.03s)
  6275. 1324.93 s [vector] +++ OK, passed 100 tests.
  6276. 1324.93 s [vector] uniq: OK
  6277. 1324.93 s [vector] +++ OK, passed 100 tests.
  6278. 1324.93 s [vector] mapMaybe: OK
  6279. 1324.93 s [vector] +++ OK, passed 100 tests.
  6280. 1324.93 s [vector] imapMaybe: OK
  6281. 1324.93 s [vector] +++ OK, passed 100 tests.
  6282. 1324.93 s [vector] takeWhile: OK
  6283. 1324.93 s [vector] +++ OK, passed 100 tests.
  6284. 1324.94 s [vector] dropWhile: OK
  6285. 1324.94 s [vector] +++ OK, passed 100 tests.
  6286. 1324.94 s [vector] partition: OK
  6287. 1324.94 s [vector] +++ OK, passed 100 tests.
  6288. 1324.94 s [vector] partitionWith: OK
  6289. 1324.94 s [vector] +++ OK, passed 100 tests.
  6290. 1324.94 s [vector] span: OK
  6291. 1324.94 s [vector] +++ OK, passed 100 tests.
  6292. 1324.94 s [vector] break: OK
  6293. 1324.94 s [vector] +++ OK, passed 100 tests.
  6294. 1324.95 s [vector] spanR: OK
  6295. 1324.95 s [vector] +++ OK, passed 100 tests.
  6296. 1324.95 s [vector] breakR: OK
  6297. 1324.95 s [vector] +++ OK, passed 100 tests.
  6298. 1324.95 s [vector] groupBy: OK
  6299. 1324.95 s [vector] +++ OK, passed 100 tests.
  6300. 1324.95 s [vector] elem: OK
  6301. 1324.95 s [vector] +++ OK, passed 100 tests.
  6302. 1324.95 s [vector] notElem: OK
  6303. 1324.95 s [vector] +++ OK, passed 100 tests.
  6304. 1324.95 s [vector] find: OK
  6305. 1324.95 s [vector] +++ OK, passed 100 tests.
  6306. 1324.95 s [vector] findIndex: OK
  6307. 1324.95 s [vector] +++ OK, passed 100 tests.
  6308. 1324.95 s [vector] findIndexR: OK
  6309. 1324.95 s [vector] +++ OK, passed 100 tests.
  6310. 1324.95 s [vector] findIndices: OK
  6311. 1324.95 s [vector] +++ OK, passed 100 tests.
  6312. 1324.95 s [vector] elemIndex: OK
  6313. 1324.95 s [vector] +++ OK, passed 100 tests.
  6314. 1324.96 s [vector] elemIndices: OK
  6315. 1324.96 s [vector] +++ OK, passed 100 tests.
  6316. 1324.96 s [vector] foldl: OK
  6317. 1324.96 s [vector] +++ OK, passed 100 tests.
  6318. 1324.96 s [vector] foldl1: OK
  6319. 1324.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6320. 1324.97 s [vector] foldl': OK
  6321. 1324.97 s [vector] +++ OK, passed 100 tests.
  6322. 1324.98 s [vector] foldl1': OK
  6323. 1324.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6324. 1324.98 s [vector] foldr: OK
  6325. 1324.98 s [vector] +++ OK, passed 100 tests.
  6326. 1324.98 s [vector] foldr1: OK
  6327. 1324.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6328. 1324.98 s [vector] foldr': OK
  6329. 1324.98 s [vector] +++ OK, passed 100 tests.
  6330. 1324.99 s [vector] foldr1': OK
  6331. 1324.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6332. 1325.00 s [vector] ifoldl: OK
  6333. 1325.00 s [vector] +++ OK, passed 100 tests.
  6334. 1325.00 s [vector] ifoldl': OK
  6335. 1325.00 s [vector] +++ OK, passed 100 tests.
  6336. 1325.00 s [vector] ifoldr: OK
  6337. 1325.00 s [vector] +++ OK, passed 100 tests.
  6338. 1325.00 s [vector] ifoldr': OK
  6339. 1325.00 s [vector] +++ OK, passed 100 tests.
  6340. 1325.00 s [vector] ifoldM: OK
  6341. 1325.00 s [vector] +++ OK, passed 100 tests.
  6342. 1325.00 s [vector] ifoldM': OK
  6343. 1325.00 s [vector] +++ OK, passed 100 tests.
  6344. 1325.02 s [vector] ifoldM_: OK (0.02s)
  6345. 1325.02 s [vector] +++ OK, passed 100 tests.
  6346. 1325.03 s [vector] ifoldM'_: OK (0.02s)
  6347. 1325.03 s [vector] +++ OK, passed 100 tests.
  6348. 1325.03 s [vector] all: OK
  6349. 1325.03 s [vector] +++ OK, passed 100 tests.
  6350. 1325.04 s [vector] any: OK
  6351. 1325.04 s [vector] +++ OK, passed 100 tests.
  6352. 1325.04 s [vector] prescanl: OK
  6353. 1325.04 s [vector] +++ OK, passed 100 tests.
  6354. 1325.04 s [vector] prescanl': OK
  6355. 1325.04 s [vector] +++ OK, passed 100 tests.
  6356. 1325.04 s [vector] postscanl: OK
  6357. 1325.04 s [vector] +++ OK, passed 100 tests.
  6358. 1325.04 s [vector] postscanl': OK
  6359. 1325.04 s [vector] +++ OK, passed 100 tests.
  6360. 1325.05 s [vector] scanl: OK
  6361. 1325.05 s [vector] +++ OK, passed 100 tests.
  6362. 1325.06 s [vector] scanl': OK
  6363. 1325.06 s [vector] +++ OK, passed 100 tests.
  6364. 1325.06 s [vector] scanl1: OK
  6365. 1325.06 s [vector] +++ OK, passed 100 tests.
  6366. 1325.06 s [vector] scanl1': OK
  6367. 1325.06 s [vector] +++ OK, passed 100 tests.
  6368. 1325.06 s [vector] iscanl: OK
  6369. 1325.06 s [vector] +++ OK, passed 100 tests.
  6370. 1325.07 s [vector] iscanl': OK
  6371. 1325.07 s [vector] +++ OK, passed 100 tests.
  6372. 1325.07 s [vector] prescanr: OK
  6373. 1325.08 s [vector] +++ OK, passed 100 tests.
  6374. 1325.08 s [vector] prescanr': OK
  6375. 1325.08 s [vector] +++ OK, passed 100 tests.
  6376. 1325.08 s [vector] postscanr: OK
  6377. 1325.08 s [vector] +++ OK, passed 100 tests.
  6378. 1325.08 s [vector] postscanr': OK
  6379. 1325.08 s [vector] +++ OK, passed 100 tests.
  6380. 1325.08 s [vector] scanr: OK
  6381. 1325.09 s [vector] +++ OK, passed 100 tests.
  6382. 1325.09 s [vector] scanr': OK
  6383. 1325.09 s [vector] +++ OK, passed 100 tests.
  6384. 1325.09 s [vector] scanr1: OK
  6385. 1325.09 s [vector] +++ OK, passed 100 tests.
  6386. 1325.09 s [vector] scanr1': OK
  6387. 1325.09 s [vector] +++ OK, passed 100 tests.
  6388. 1325.09 s [vector] iscanr: OK
  6389. 1325.10 s [vector] +++ OK, passed 100 tests.
  6390. 1325.10 s [vector] iscanr': OK
  6391. 1325.10 s [vector] +++ OK, passed 100 tests.
  6392. 1325.10 s [vector] mut_read: OK
  6393. 1325.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6394. 1325.10 s [vector] mut_write: OK
  6395. 1325.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6396. 1325.10 s [vector] mut_modify: OK
  6397. 1325.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6398. 1325.10 s [vector] mut_generate: OK
  6399. 1325.10 s [vector] +++ OK, passed 100 tests.
  6400. 1325.12 s [vector] mut_generateM: OK
  6401. 1325.12 s [vector] +++ OK, passed 100 tests.
  6402. 1325.14 s [vector] mut_mapM_: OK (0.02s)
  6403. 1325.14 s [vector] +++ OK, passed 100 tests.
  6404. 1325.16 s [vector] mut_imapM_: OK (0.02s)
  6405. 1325.16 s [vector] +++ OK, passed 100 tests.
  6406. 1325.18 s [vector] mut_forM_: OK (0.02s)
  6407. 1325.18 s [vector] +++ OK, passed 100 tests.
  6408. 1325.19 s [vector] mut_iforM_: OK (0.02s)
  6409. 1325.19 s [vector] +++ OK, passed 100 tests.
  6410. 1325.19 s [vector] mut_foldr: OK
  6411. 1325.20 s [vector] +++ OK, passed 100 tests.
  6412. 1325.20 s [vector] mut_foldr': OK
  6413. 1325.20 s [vector] +++ OK, passed 100 tests.
  6414. 1325.20 s [vector] mut_foldl: OK
  6415. 1325.20 s [vector] +++ OK, passed 100 tests.
  6416. 1325.20 s [vector] mut_foldl': OK
  6417. 1325.20 s [vector] +++ OK, passed 100 tests.
  6418. 1325.20 s [vector] mut_ifoldr: OK
  6419. 1325.20 s [vector] +++ OK, passed 100 tests.
  6420. 1325.21 s [vector] mut_ifoldr': OK
  6421. 1325.21 s [vector] +++ OK, passed 100 tests.
  6422. 1325.21 s [vector] mut_ifoldl: OK
  6423. 1325.21 s [vector] +++ OK, passed 100 tests.
  6424. 1325.22 s [vector] mut_ifoldl': OK
  6425. 1325.22 s [vector] +++ OK, passed 100 tests.
  6426. 1325.22 s [vector] mut_foldM: OK
  6427. 1325.22 s [vector] +++ OK, passed 100 tests.
  6428. 1325.22 s [vector] mut_foldM': OK
  6429. 1325.22 s [vector] +++ OK, passed 100 tests.
  6430. 1325.23 s [vector] mut_foldrM: OK
  6431. 1325.23 s [vector] +++ OK, passed 100 tests.
  6432. 1325.23 s [vector] mut_foldrM': OK
  6433. 1325.23 s [vector] +++ OK, passed 100 tests.
  6434. 1325.24 s [vector] mut_ifoldM: OK
  6435. 1325.24 s [vector] +++ OK, passed 100 tests.
  6436. 1325.24 s [vector] mut_ifoldM': OK
  6437. 1325.24 s [vector] +++ OK, passed 100 tests.
  6438. 1325.24 s [vector] mut_ifoldrM: OK
  6439. 1325.24 s [vector] +++ OK, passed 100 tests.
  6440. 1325.24 s [vector] mut_ifoldrM': OK
  6441. 1325.24 s [vector] +++ OK, passed 100 tests.
  6442. 1325.24 s [vector] compare: OK
  6443. 1325.24 s [vector] +++ OK, passed 100 tests.
  6444. 1325.24 s [vector] maximum: OK
  6445. 1325.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6446. 1325.25 s [vector] minimum: OK
  6447. 1325.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6448. 1325.25 s [vector] minIndex: OK
  6449. 1325.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6450. 1325.25 s [vector] maxIndex: OK
  6451. 1325.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6452. 1325.25 s [vector] maximumBy: OK
  6453. 1325.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6454. 1325.25 s [vector] minimumBy: OK
  6455. 1325.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6456. 1325.25 s [vector] maximumOn: OK
  6457. 1325.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6458. 1325.25 s [vector] minimumOn: OK
  6459. 1325.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6460. 1325.25 s [vector] maxIndexBy: OK
  6461. 1325.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6462. 1325.25 s [vector] minIndexBy: OK
  6463. 1325.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6464. 1325.25 s [vector] ListFirstMaxIndexWins: OK
  6465. 1325.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6466. 1325.25 s [vector] FalseListFirstMaxIndexWins: OK
  6467. 1325.25 s [vector] +++ OK, failed as expected. (after 1 test):
  6468. 1325.25 s [vector] Exception:
  6469. 1325.25 s [vector] Prelude.foldr1: empty list
  6470. 1325.25 s [vector] CallStack (from HasCallStack):
  6471. 1325.25 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6472. 1325.25 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6473. 1325.26 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6474. 1325.26 s [vector] []
  6475. 1325.26 s [vector] mempty: OK
  6476. 1325.26 s [vector] +++ OK, passed 100 tests.
  6477. 1325.26 s [vector] mappend: OK
  6478. 1325.26 s [vector] +++ OK, passed 100 tests.
  6479. 1325.27 s [vector] mconcat: OK (0.02s)
  6480. 1325.27 s [vector] +++ OK, passed 100 tests.
  6481. 1325.28 s [vector] glength: OK
  6482. 1325.28 s [vector] +++ OK, passed 100 tests.
  6483. 1325.28 s [vector] sum: OK
  6484. 1325.28 s [vector] +++ OK, passed 100 tests.
  6485. 1325.28 s [vector] product: OK
  6486. 1325.28 s [vector] +++ OK, passed 100 tests.
  6487. 1325.28 s [vector] enumFromN: OK
  6488. 1325.28 s [vector] +++ OK, passed 100 tests.
  6489. 1325.28 s [vector] enumFromThenN: OK
  6490. 1325.28 s [vector] +++ OK, passed 100 tests.
  6491. 1325.28 s [vector] enumFromTo: OK
  6492. 1325.28 s [vector] +++ OK, passed 100 tests.
  6493. 1325.28 s [vector] enumFromThenTo: OK
  6494. 1325.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6495. 1325.28 s [vector] Double
  6496. 1325.28 s [vector] fromList.toList == id: OK
  6497. 1325.28 s [vector] +++ OK, passed 100 tests.
  6498. 1325.29 s [vector] toList.fromList == id: OK
  6499. 1325.29 s [vector] +++ OK, passed 100 tests.
  6500. 1325.29 s [vector] unstream.stream == id: OK
  6501. 1325.29 s [vector] +++ OK, passed 100 tests.
  6502. 1325.29 s [vector] stream.unstream == id: OK
  6503. 1325.29 s [vector] +++ OK, passed 100 tests.
  6504. 1325.29 s [vector] eq: OK
  6505. 1325.29 s [vector] +++ OK, passed 100 tests.
  6506. 1325.29 s [vector] length: OK
  6507. 1325.29 s [vector] +++ OK, passed 100 tests.
  6508. 1325.29 s [vector] null: OK
  6509. 1325.29 s [vector] +++ OK, passed 100 tests.
  6510. 1325.29 s [vector] index: OK
  6511. 1325.29 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6512. 1325.29 s [vector] safeIndex: OK
  6513. 1325.29 s [vector] +++ OK, passed 100 tests.
  6514. 1325.29 s [vector] head: OK
  6515. 1325.29 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6516. 1325.29 s [vector] last: OK
  6517. 1325.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6518. 1325.30 s [vector] unsafeIndex: OK
  6519. 1325.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6520. 1325.30 s [vector] unsafeHead: OK
  6521. 1325.30 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6522. 1325.30 s [vector] unsafeLast: OK
  6523. 1325.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6524. 1325.30 s [vector] slice: OK
  6525. 1325.30 s [vector] +++ OK, passed 100 tests.
  6526. 1325.30 s [vector] init: OK
  6527. 1325.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6528. 1325.30 s [vector] tail: OK
  6529. 1325.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6530. 1325.30 s [vector] take: OK
  6531. 1325.30 s [vector] +++ OK, passed 100 tests.
  6532. 1325.30 s [vector] drop: OK
  6533. 1325.30 s [vector] +++ OK, passed 100 tests.
  6534. 1325.30 s [vector] splitAt: OK
  6535. 1325.30 s [vector] +++ OK, passed 100 tests.
  6536. 1325.30 s [vector] empty: OK
  6537. 1325.30 s [vector] +++ OK, passed 100 tests.
  6538. 1325.30 s [vector] singleton: OK
  6539. 1325.30 s [vector] +++ OK, passed 100 tests.
  6540. 1325.31 s [vector] replicate: OK
  6541. 1325.31 s [vector] +++ OK, passed 100 tests.
  6542. 1325.31 s [vector] generate: OK
  6543. 1325.32 s [vector] +++ OK, passed 100 tests.
  6544. 1325.32 s [vector] iterateN: OK
  6545. 1325.32 s [vector] +++ OK, passed 100 tests.
  6546. 1325.38 s [vector] iterateNM: OK (0.06s)
  6547. 1325.38 s [vector] +++ OK, passed 100 tests.
  6548. 1325.41 s [vector] generateM: OK (0.03s)
  6549. 1325.41 s [vector] +++ OK, passed 100 tests.
  6550. 1325.41 s [vector] replicateM: OK (0.01s)
  6551. 1325.41 s [vector] +++ OK, passed 100 tests.
  6552. 1325.41 s [vector] create: OK
  6553. 1325.41 s [vector] +++ OK, passed 100 tests.
  6554. 1325.41 s [vector] createT: OK
  6555. 1325.41 s [vector] +++ OK, passed 100 tests.
  6556. 1325.42 s [vector] unfoldr: OK
  6557. 1325.42 s [vector] +++ OK, passed 100 tests.
  6558. 1325.42 s [vector] unfoldrN: OK
  6559. 1325.42 s [vector] +++ OK, passed 100 tests.
  6560. 1325.42 s [vector] unfoldrExactN: OK
  6561. 1325.42 s [vector] +++ OK, passed 100 tests.
  6562. 1325.42 s [vector] unfoldrM: OK
  6563. 1325.42 s [vector] +++ OK, passed 100 tests.
  6564. 1325.42 s [vector] unfoldrNM: OK
  6565. 1325.42 s [vector] +++ OK, passed 100 tests.
  6566. 1325.48 s [vector] unfoldrExactNM: OK (0.03s)
  6567. 1325.48 s [vector] +++ OK, passed 100 tests.
  6568. 1325.49 s [vector] constructN: OK (0.01s)
  6569. 1325.49 s [vector] +++ OK, passed 100 tests.
  6570. 1325.49 s [vector] constructrN: OK (0.01s)
  6571. 1325.49 s [vector] +++ OK, passed 100 tests.
  6572. 1325.50 s [vector] cons: OK
  6573. 1325.50 s [vector] +++ OK, passed 100 tests.
  6574. 1325.50 s [vector] snoc: OK
  6575. 1325.50 s [vector] +++ OK, passed 100 tests.
  6576. 1325.50 s [vector] append: OK
  6577. 1325.50 s [vector] +++ OK, passed 100 tests.
  6578. 1325.53 s [vector] concat: OK (0.03s)
  6579. 1325.53 s [vector] +++ OK, passed 100 tests.
  6580. 1325.53 s [vector] force: OK
  6581. 1325.53 s [vector] +++ OK, passed 100 tests.
  6582. 1325.53 s [vector] upd: OK
  6583. 1325.54 s [vector] +++ OK, passed 100 tests.
  6584. 1325.55 s [vector] accum: OK (0.02s)
  6585. 1325.55 s [vector] +++ OK, passed 100 tests.
  6586. 1325.55 s [vector] reverse: OK
  6587. 1325.55 s [vector] +++ OK, passed 100 tests.
  6588. 1325.55 s [vector] backpermute: OK
  6589. 1325.56 s [vector] +++ OK, passed 100 tests.
  6590. 1325.57 s [vector] map: OK
  6591. 1325.58 s [vector] +++ OK, passed 100 tests.
  6592. 1325.59 s [vector] imap: OK (0.01s)
  6593. 1325.59 s [vector] +++ OK, passed 100 tests.
  6594. 1325.59 s [vector] concatMap: OK (0.01s)
  6595. 1325.59 s [vector] +++ OK, passed 100 tests.
  6596. 1325.59 s [vector] mapM: OK
  6597. 1325.60 s [vector] +++ OK, passed 100 tests.
  6598. 1325.63 s [vector] mapM_: OK (0.04s)
  6599. 1325.63 s [vector] +++ OK, passed 100 tests.
  6600. 1325.66 s [vector] forM: OK
  6601. 1325.66 s [vector] +++ OK, passed 100 tests.
  6602. 1325.68 s [vector] forM_: OK (0.04s)
  6603. 1325.69 s [vector] +++ OK, passed 100 tests.
  6604. 1325.70 s [vector] imapM: OK
  6605. 1325.70 s [vector] +++ OK, passed 100 tests.
  6606. 1325.74 s [vector] imapM_: OK (0.04s)
  6607. 1325.74 s [vector] +++ OK, passed 100 tests.
  6608. 1325.75 s [vector] zipWith: OK
  6609. 1325.75 s [vector] +++ OK, passed 100 tests.
  6610. 1325.76 s [vector] zipWith3: OK (0.01s)
  6611. 1325.76 s [vector] +++ OK, passed 100 tests.
  6612. 1325.78 s [vector] izipWith: OK (0.01s)
  6613. 1325.78 s [vector] +++ OK, passed 100 tests.
  6614. 1325.79 s [vector] izipWith3: OK (0.01s)
  6615. 1325.80 s [vector] +++ OK, passed 100 tests.
  6616. 1325.80 s [vector] izipWithM: OK (0.01s)
  6617. 1325.80 s [vector] +++ OK, passed 100 tests.
  6618. 1325.84 s [vector] izipWithM_: OK (0.03s)
  6619. 1325.84 s [vector] +++ OK, passed 100 tests.
  6620. 1325.84 s [vector] zipWithM: OK
  6621. 1325.84 s [vector] +++ OK, passed 100 tests.
  6622. 1325.88 s [vector] zipWithM_: OK (0.04s)
  6623. 1325.88 s [vector] +++ OK, passed 100 tests.
  6624. 1325.89 s [vector] filter: OK
  6625. 1325.89 s [vector] +++ OK, passed 100 tests.
  6626. 1325.89 s [vector] ifilter: OK
  6627. 1325.90 s [vector] +++ OK, passed 100 tests.
  6628. 1325.96 s [vector] filterM: OK (0.07s)
  6629. 1325.96 s [vector] +++ OK, passed 100 tests.
  6630. 1325.96 s [vector] uniq: OK
  6631. 1325.96 s [vector] +++ OK, passed 100 tests.
  6632. 1325.98 s [vector] mapMaybe: OK
  6633. 1325.98 s [vector] +++ OK, passed 100 tests.
  6634. 1325.98 s [vector] imapMaybe: OK
  6635. 1325.98 s [vector] +++ OK, passed 100 tests.
  6636. 1325.98 s [vector] takeWhile: OK
  6637. 1325.98 s [vector] +++ OK, passed 100 tests.
  6638. 1325.98 s [vector] dropWhile: OK
  6639. 1325.98 s [vector] +++ OK, passed 100 tests.
  6640. 1325.99 s [vector] partition: OK
  6641. 1325.99 s [vector] +++ OK, passed 100 tests.
  6642. 1326.00 s [vector] partitionWith: OK
  6643. 1326.00 s [vector] +++ OK, passed 100 tests.
  6644. 1326.00 s [vector] span: OK
  6645. 1326.00 s [vector] +++ OK, passed 100 tests.
  6646. 1326.00 s [vector] break: OK
  6647. 1326.00 s [vector] +++ OK, passed 100 tests.
  6648. 1326.00 s [vector] spanR: OK
  6649. 1326.00 s [vector] +++ OK, passed 100 tests.
  6650. 1326.00 s [vector] breakR: OK
  6651. 1326.01 s [vector] +++ OK, passed 100 tests.
  6652. 1326.02 s [vector] groupBy: OK (0.01s)
  6653. 1326.02 s [vector] +++ OK, passed 100 tests.
  6654. 1326.02 s [vector] elem: OK
  6655. 1326.02 s [vector] +++ OK, passed 100 tests.
  6656. 1326.02 s [vector] notElem: OK
  6657. 1326.02 s [vector] +++ OK, passed 100 tests.
  6658. 1326.02 s [vector] find: OK
  6659. 1326.02 s [vector] +++ OK, passed 100 tests.
  6660. 1326.02 s [vector] findIndex: OK
  6661. 1326.02 s [vector] +++ OK, passed 100 tests.
  6662. 1326.02 s [vector] findIndexR: OK
  6663. 1326.02 s [vector] +++ OK, passed 100 tests.
  6664. 1326.03 s [vector] findIndices: OK
  6665. 1326.03 s [vector] +++ OK, passed 100 tests.
  6666. 1326.03 s [vector] elemIndex: OK
  6667. 1326.03 s [vector] +++ OK, passed 100 tests.
  6668. 1326.03 s [vector] elemIndices: OK
  6669. 1326.03 s [vector] +++ OK, passed 100 tests.
  6670. 1326.05 s [vector] foldl: OK
  6671. 1326.06 s [vector] +++ OK, passed 100 tests.
  6672. 1326.06 s [vector] foldl1: OK (0.01s)
  6673. 1326.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6674. 1326.08 s [vector] foldl': OK (0.02s)
  6675. 1326.08 s [vector] +++ OK, passed 100 tests.
  6676. 1326.09 s [vector] foldl1': OK (0.02s)
  6677. 1326.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6678. 1326.10 s [vector] foldr: OK (0.01s)
  6679. 1326.11 s [vector] +++ OK, passed 100 tests.
  6680. 1326.12 s [vector] foldr1: OK (0.01s)
  6681. 1326.12 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6682. 1326.14 s [vector] foldr': OK (0.02s)
  6683. 1326.14 s [vector] +++ OK, passed 100 tests.
  6684. 1326.16 s [vector] foldr1': OK (0.02s)
  6685. 1326.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6686. 1326.18 s [vector] ifoldl: OK (0.01s)
  6687. 1326.18 s [vector] +++ OK, passed 100 tests.
  6688. 1326.18 s [vector] ifoldl': OK (0.02s)
  6689. 1326.18 s [vector] +++ OK, passed 100 tests.
  6690. 1326.20 s [vector] ifoldr: OK (0.01s)
  6691. 1326.20 s [vector] +++ OK, passed 100 tests.
  6692. 1326.22 s [vector] ifoldr': OK (0.01s)
  6693. 1326.22 s [vector] +++ OK, passed 100 tests.
  6694. 1326.22 s [vector] ifoldM: OK (0.01s)
  6695. 1326.22 s [vector] +++ OK, passed 100 tests.
  6696. 1326.23 s [vector] ifoldM': OK (0.02s)
  6697. 1326.23 s [vector] +++ OK, passed 100 tests.
  6698. 1326.27 s [vector] ifoldM_: OK (0.03s)
  6699. 1326.27 s [vector] +++ OK, passed 100 tests.
  6700. 1326.31 s [vector] ifoldM'_: OK (0.03s)
  6701. 1326.31 s [vector] +++ OK, passed 100 tests.
  6702. 1326.31 s [vector] all: OK
  6703. 1326.31 s [vector] +++ OK, passed 100 tests.
  6704. 1326.32 s [vector] any: OK
  6705. 1326.32 s [vector] +++ OK, passed 100 tests.
  6706. 1326.34 s [vector] prescanl: OK (0.01s)
  6707. 1326.34 s [vector] +++ OK, passed 100 tests.
  6708. 1326.36 s [vector] prescanl': OK (0.01s)
  6709. 1326.36 s [vector] +++ OK, passed 100 tests.
  6710. 1326.36 s [vector] postscanl: OK (0.02s)
  6711. 1326.36 s [vector] +++ OK, passed 100 tests.
  6712. 1326.38 s [vector] postscanl': OK (0.02s)
  6713. 1326.38 s [vector] +++ OK, passed 100 tests.
  6714. 1326.40 s [vector] scanl: OK (0.02s)
  6715. 1326.40 s [vector] +++ OK, passed 100 tests.
  6716. 1326.42 s [vector] scanl': OK (0.02s)
  6717. 1326.42 s [vector] +++ OK, passed 100 tests.
  6718. 1326.43 s [haskell-language-server] Preprocessing library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
  6719. 1326.43 s [haskell-language-server] Building library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0..
  6720. 1326.44 s [vector] scanl1: OK (0.02s)
  6721. 1326.44 s [vector] +++ OK, passed 100 tests.
  6722. 1326.46 s [vector] scanl1': OK (0.01s)
  6723. 1326.46 s [vector] +++ OK, passed 100 tests.
  6724. 1326.48 s [vector] iscanl: OK (0.01s)
  6725. 1326.48 s [vector] +++ OK, passed 100 tests.
  6726. 1326.50 s [vector] iscanl': OK (0.02s)
  6727. 1326.50 s [vector] +++ OK, passed 100 tests.
  6728. 1326.50 s [vector] prescanr: OK (0.01s)
  6729. 1326.51 s [vector] +++ OK, passed 100 tests.
  6730. 1326.52 s [vector] prescanr': OK (0.01s)
  6731. 1326.52 s [vector] +++ OK, passed 100 tests.
  6732. 1326.53 s [vector] postscanr: OK (0.01s)
  6733. 1326.54 s [vector] +++ OK, passed 100 tests.
  6734. 1326.54 s [vector] postscanr': OK (0.01s)
  6735. 1326.55 s [vector] +++ OK, passed 100 tests.
  6736. 1326.56 s [vector] scanr: OK (0.01s)
  6737. 1326.56 s [vector] +++ OK, passed 100 tests.
  6738. 1326.57 s [haskell-language-server]
  6739. 1326.57 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  6740. 1326.57 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  6741. 1326.57 s [haskell-language-server] but were not needed for compilation:
  6742. 1326.57 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
  6743. 1326.57 s [haskell-language-server] - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)
  6744. 1326.58 s [vector] scanr': OK (0.02s)
  6745. 1326.58 s [vector] +++ OK, passed 100 tests.
  6746. 1326.59 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Pragmas ( plugins/hls-pragmas-plugin/src/Ide/Plugin/Pragmas.hs, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.o, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.dyn_o )
  6747. 1326.60 s [vector] scanr1: OK (0.02s)
  6748. 1326.60 s [vector] +++ OK, passed 100 tests.
  6749. 1326.62 s [vector] scanr1': OK (0.02s)
  6750. 1326.62 s [vector] +++ OK, passed 100 tests.
  6751. 1326.64 s [vector] iscanr: OK (0.02s)
  6752. 1326.64 s [vector] +++ OK, passed 100 tests.
  6753. 1326.65 s [vector] iscanr': OK (0.03s)
  6754. 1326.65 s [vector] +++ OK, passed 100 tests.
  6755. 1326.65 s [vector] mut_read: OK
  6756. 1326.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6757. 1326.65 s [vector] mut_write: OK
  6758. 1326.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6759. 1326.66 s [vector] mut_modify: OK
  6760. 1326.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6761. 1326.66 s [vector] mut_generate: OK
  6762. 1326.66 s [vector] +++ OK, passed 100 tests.
  6763. 1326.70 s [vector] mut_generateM: OK (0.03s)
  6764. 1326.70 s [vector] +++ OK, passed 100 tests.
  6765. 1326.76 s [vector] mut_mapM_: OK (0.07s)
  6766. 1326.76 s [vector] +++ OK, passed 100 tests.
  6767. 1326.84 s [vector] mut_imapM_: OK (0.08s)
  6768. 1326.84 s [vector] +++ OK, passed 100 tests.
  6769. 1326.88 s [vector] mut_forM_: OK (0.05s)
  6770. 1326.88 s [vector] +++ OK, passed 100 tests.
  6771. 1326.96 s [vector] mut_iforM_: OK (0.07s)
  6772. 1326.96 s [vector] +++ OK, passed 100 tests.
  6773. 1326.98 s [vector] mut_foldr: OK (0.03s)
  6774. 1326.99 s [vector] +++ OK, passed 100 tests.
  6775. 1327.02 s [vector] mut_foldr': OK (0.03s)
  6776. 1327.02 s [vector] +++ OK, passed 100 tests.
  6777. 1327.04 s [vector] mut_foldl: OK (0.02s)
  6778. 1327.04 s [vector] +++ OK, passed 100 tests.
  6779. 1327.06 s [vector] mut_foldl': OK (0.02s)
  6780. 1327.06 s [vector] +++ OK, passed 100 tests.
  6781. 1327.08 s [vector] mut_ifoldr: OK (0.03s)
  6782. 1327.08 s [vector] +++ OK, passed 100 tests.
  6783. 1327.10 s [vector] mut_ifoldr': OK (0.02s)
  6784. 1327.10 s [vector] +++ OK, passed 100 tests.
  6785. 1327.12 s [vector] mut_ifoldl: OK (0.02s)
  6786. 1327.12 s [vector] +++ OK, passed 100 tests.
  6787. 1327.14 s [vector] mut_ifoldl': OK (0.02s)
  6788. 1327.14 s [vector] +++ OK, passed 100 tests.
  6789. 1327.14 s [vector] mut_foldM: OK (0.01s)
  6790. 1327.14 s [vector] +++ OK, passed 100 tests.
  6791. 1327.15 s [vector] mut_foldM': OK
  6792. 1327.15 s [vector] +++ OK, passed 100 tests.
  6793. 1327.16 s [vector] mut_foldrM: OK
  6794. 1327.16 s [vector] +++ OK, passed 100 tests.
  6795. 1327.18 s [vector] mut_foldrM': OK (0.01s)
  6796. 1327.18 s [vector] +++ OK, passed 100 tests.
  6797. 1327.20 s [vector] mut_ifoldM: OK (0.02s)
  6798. 1327.20 s [vector] +++ OK, passed 100 tests.
  6799. 1327.22 s [vector] mut_ifoldM': OK (0.02s)
  6800. 1327.22 s [vector] +++ OK, passed 100 tests.
  6801. 1327.24 s [vector] mut_ifoldrM: OK (0.02s)
  6802. 1327.24 s [vector] +++ OK, passed 100 tests.
  6803. 1327.25 s [vector] mut_ifoldrM': OK (0.01s)
  6804. 1327.25 s [vector] +++ OK, passed 100 tests.
  6805. 1327.25 s [vector] compare: OK
  6806. 1327.25 s [vector] +++ OK, passed 100 tests.
  6807. 1327.25 s [vector] maximum: OK
  6808. 1327.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6809. 1327.25 s [vector] minimum: OK
  6810. 1327.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6811. 1327.25 s [vector] minIndex: OK
  6812. 1327.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6813. 1327.25 s [vector] maxIndex: OK
  6814. 1327.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6815. 1327.25 s [vector] maximumBy: OK
  6816. 1327.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6817. 1327.25 s [vector] minimumBy: OK
  6818. 1327.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6819. 1327.26 s [vector] maximumOn: OK
  6820. 1327.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6821. 1327.26 s [vector] minimumOn: OK
  6822. 1327.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6823. 1327.26 s [vector] maxIndexBy: OK
  6824. 1327.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6825. 1327.26 s [vector] minIndexBy: OK
  6826. 1327.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6827. 1327.26 s [vector] ListFirstMaxIndexWins: OK
  6828. 1327.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6829. 1327.26 s [vector] FalseListFirstMaxIndexWins: OK
  6830. 1327.26 s [vector] +++ OK, failed as expected. (after 1 test):
  6831. 1327.26 s [vector] Exception:
  6832. 1327.26 s [vector] Prelude.foldr1: empty list
  6833. 1327.26 s [vector] CallStack (from HasCallStack):
  6834. 1327.26 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6835. 1327.26 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6836. 1327.26 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6837. 1327.26 s [vector] []
  6838. 1327.26 s [vector] mempty: OK
  6839. 1327.26 s [vector] +++ OK, passed 100 tests.
  6840. 1327.28 s [vector] mappend: OK
  6841. 1327.28 s [vector] +++ OK, passed 100 tests.
  6842. 1327.29 s [vector] mconcat: OK (0.02s)
  6843. 1327.29 s [vector] +++ OK, passed 100 tests.
  6844. 1327.29 s [vector] glength: OK
  6845. 1327.29 s [vector] +++ OK, passed 100 tests.
  6846. 1327.29 s [vector] sum: OK
  6847. 1327.29 s [vector] +++ OK, passed 100 tests.
  6848. 1327.29 s [vector] product: OK
  6849. 1327.29 s [vector] +++ OK, passed 100 tests.
  6850. 1327.29 s [vector] enumFromN: OK
  6851. 1327.29 s [vector] +++ OK, passed 100 tests.
  6852. 1327.29 s [vector] enumFromThenN: OK
  6853. 1327.29 s [vector] +++ OK, passed 100 tests.
  6854. 1327.30 s [vector] enumFromTo: OK
  6855. 1327.30 s [vector] +++ OK, passed 100 tests.
  6856. 1327.30 s [vector] enumFromThenTo: OK
  6857. 1327.30 s [vector] +++ OK, passed 100 tests; 3 discarded.
  6858. 1327.30 s [vector] unstream
  6859. 1327.30 s [vector] unstream == vunstream (exact): OK
  6860. 1327.30 s [vector] +++ OK, passed 100 tests.
  6861. 1327.30 s [vector] unstream == vunstream (unknown): OK
  6862. 1327.30 s [vector] +++ OK, passed 100 tests.
  6863. 1327.30 s [vector] unstreamR ~= vunstream (exact): OK
  6864. 1327.30 s [vector] +++ OK, passed 100 tests.
  6865. 1327.30 s [vector] unstreamR ~= vunstream (unknown): OK
  6866. 1327.30 s [vector] +++ OK, passed 100 tests.
  6867. 1327.30 s [vector] Tests.Vector.Storable
  6868. 1327.30 s [vector] Data.Vector.Storable.Vector (Int)
  6869. 1327.30 s [vector] fromList.toList == id: OK
  6870. 1327.30 s [vector] +++ OK, passed 100 tests.
  6871. 1327.30 s [vector] toList.fromList == id: OK
  6872. 1327.30 s [vector] +++ OK, passed 100 tests.
  6873. 1327.30 s [vector] unstream.stream == id: OK
  6874. 1327.31 s [vector] +++ OK, passed 100 tests.
  6875. 1327.31 s [vector] stream.unstream == id: OK
  6876. 1327.31 s [vector] +++ OK, passed 100 tests.
  6877. 1327.31 s [vector] eq: OK
  6878. 1327.31 s [vector] +++ OK, passed 100 tests.
  6879. 1327.31 s [vector] length: OK
  6880. 1327.31 s [vector] +++ OK, passed 100 tests.
  6881. 1327.31 s [vector] null: OK
  6882. 1327.31 s [vector] +++ OK, passed 100 tests.
  6883. 1327.31 s [vector] index: OK
  6884. 1327.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6885. 1327.32 s [vector] safeIndex: OK
  6886. 1327.32 s [vector] +++ OK, passed 100 tests.
  6887. 1327.32 s [vector] head: OK
  6888. 1327.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6889. 1327.32 s [vector] last: OK
  6890. 1327.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6891. 1327.32 s [vector] unsafeIndex: OK
  6892. 1327.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6893. 1327.32 s [vector] unsafeHead: OK
  6894. 1327.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6895. 1327.32 s [vector] unsafeLast: OK
  6896. 1327.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6897. 1327.32 s [vector] slice: OK
  6898. 1327.32 s [vector] +++ OK, passed 100 tests.
  6899. 1327.32 s [vector] init: OK
  6900. 1327.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6901. 1327.32 s [vector] tail: OK
  6902. 1327.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6903. 1327.32 s [vector] take: OK
  6904. 1327.32 s [vector] +++ OK, passed 100 tests.
  6905. 1327.32 s [vector] drop: OK
  6906. 1327.32 s [vector] +++ OK, passed 100 tests.
  6907. 1327.32 s [vector] splitAt: OK
  6908. 1327.32 s [vector] +++ OK, passed 100 tests.
  6909. 1327.32 s [vector] empty: OK
  6910. 1327.32 s [vector] +++ OK, passed 100 tests.
  6911. 1327.32 s [vector] singleton: OK
  6912. 1327.32 s [vector] +++ OK, passed 100 tests.
  6913. 1327.32 s [vector] replicate: OK
  6914. 1327.32 s [vector] +++ OK, passed 100 tests.
  6915. 1327.32 s [vector] generate: OK
  6916. 1327.32 s [vector] +++ OK, passed 100 tests.
  6917. 1327.33 s [vector] iterateN: OK
  6918. 1327.33 s [vector] +++ OK, passed 100 tests.
  6919. 1327.38 s [vector] iterateNM: OK (0.05s)
  6920. 1327.38 s [vector] +++ OK, passed 100 tests.
  6921. 1327.40 s [vector] generateM: OK (0.03s)
  6922. 1327.40 s [vector] +++ OK, passed 100 tests.
  6923. 1327.40 s [vector] replicateM: OK
  6924. 1327.40 s [vector] +++ OK, passed 100 tests.
  6925. 1327.40 s [vector] create: OK
  6926. 1327.40 s [vector] +++ OK, passed 100 tests.
  6927. 1327.40 s [vector] createT: OK
  6928. 1327.40 s [vector] +++ OK, passed 100 tests.
  6929. 1327.40 s [vector] unfoldr: OK
  6930. 1327.41 s [vector] +++ OK, passed 100 tests.
  6931. 1327.42 s [vector] unfoldrN: OK
  6932. 1327.42 s [vector] +++ OK, passed 100 tests.
  6933. 1327.44 s [vector] unfoldrExactN: OK
  6934. 1327.44 s [vector] +++ OK, passed 100 tests.
  6935. 1327.44 s [vector] unfoldrM: OK
  6936. 1327.44 s [vector] +++ OK, passed 100 tests.
  6937. 1327.44 s [vector] unfoldrNM: OK (0.01s)
  6938. 1327.44 s [vector] +++ OK, passed 100 tests.
  6939. 1327.44 s [vector] unfoldrExactNM: OK (0.01s)
  6940. 1327.44 s [vector] +++ OK, passed 100 tests.
  6941. 1327.45 s [vector] constructN: OK
  6942. 1327.45 s [vector] +++ OK, passed 100 tests.
  6943. 1327.45 s [vector] constructrN: OK
  6944. 1327.45 s [vector] +++ OK, passed 100 tests.
  6945. 1327.45 s [vector] cons: OK
  6946. 1327.45 s [vector] +++ OK, passed 100 tests.
  6947. 1327.46 s [vector] snoc: OK
  6948. 1327.46 s [vector] +++ OK, passed 100 tests.
  6949. 1327.46 s [vector] append: OK
  6950. 1327.46 s [vector] +++ OK, passed 100 tests.
  6951. 1327.47 s [vector] concat: OK (0.02s)
  6952. 1327.47 s [vector] +++ OK, passed 100 tests.
  6953. 1327.47 s [vector] force: OK
  6954. 1327.47 s [vector] +++ OK, passed 100 tests.
  6955. 1327.47 s [vector] upd: OK
  6956. 1327.47 s [vector] +++ OK, passed 100 tests.
  6957. 1327.47 s [vector] accum: OK
  6958. 1327.47 s [vector] +++ OK, passed 100 tests.
  6959. 1327.48 s [vector] reverse: OK
  6960. 1327.48 s [vector] +++ OK, passed 100 tests.
  6961. 1327.48 s [vector] backpermute: OK
  6962. 1327.48 s [vector] +++ OK, passed 100 tests.
  6963. 1327.48 s [vector] map: OK
  6964. 1327.49 s [vector] +++ OK, passed 100 tests.
  6965. 1327.50 s [vector] imap: OK
  6966. 1327.50 s [vector] +++ OK, passed 100 tests.
  6967. 1327.50 s [vector] concatMap: OK
  6968. 1327.50 s [vector] +++ OK, passed 100 tests.
  6969. 1327.50 s [vector] mapM: OK
  6970. 1327.50 s [vector] +++ OK, passed 100 tests.
  6971. 1327.52 s [vector] mapM_: OK (0.03s)
  6972. 1327.54 s [vector] +++ OK, passed 100 tests.
  6973. 1327.54 s [vector] forM: OK
  6974. 1327.54 s [vector] +++ OK, passed 100 tests.
  6975. 1327.55 s [vector] forM_: OK (0.03s)
  6976. 1327.55 s [vector] +++ OK, passed 100 tests.
  6977. 1327.56 s [vector] imapM: OK
  6978. 1327.56 s [vector] +++ OK, passed 100 tests.
  6979. 1327.57 s [vector] imapM_: OK (0.02s)
  6980. 1327.58 s [vector] +++ OK, passed 100 tests.
  6981. 1327.58 s [vector] zipWith: OK
  6982. 1327.58 s [vector] +++ OK, passed 100 tests.
  6983. 1327.58 s [vector] zipWith3: OK
  6984. 1327.59 s [vector] +++ OK, passed 100 tests.
  6985. 1327.59 s [vector] izipWith: OK
  6986. 1327.59 s [vector] +++ OK, passed 100 tests.
  6987. 1327.59 s [vector] izipWith3: OK
  6988. 1327.59 s [vector] +++ OK, passed 100 tests.
  6989. 1327.60 s [vector] izipWithM: OK
  6990. 1327.60 s [vector] +++ OK, passed 100 tests.
  6991. 1327.60 s [vector] izipWithM_: OK (0.01s)
  6992. 1327.62 s [vector] +++ OK, passed 100 tests.
  6993. 1327.62 s [vector] zipWithM: OK
  6994. 1327.62 s [vector] +++ OK, passed 100 tests.
  6995. 1327.62 s [vector] zipWithM_: OK (0.01s)
  6996. 1327.62 s [vector] +++ OK, passed 100 tests.
  6997. 1327.62 s [vector] filter: OK
  6998. 1327.62 s [vector] +++ OK, passed 100 tests.
  6999. 1327.62 s [vector] ifilter: OK
  7000. 1327.62 s [vector] +++ OK, passed 100 tests.
  7001. 1327.65 s [vector] filterM: OK (0.03s)
  7002. 1327.65 s [vector] +++ OK, passed 100 tests.
  7003. 1327.65 s [vector] uniq: OK
  7004. 1327.65 s [vector] +++ OK, passed 100 tests.
  7005. 1327.66 s [vector] mapMaybe: OK
  7006. 1327.66 s [vector] +++ OK, passed 100 tests.
  7007. 1327.66 s [vector] imapMaybe: OK
  7008. 1327.66 s [vector] +++ OK, passed 100 tests.
  7009. 1327.66 s [vector] takeWhile: OK
  7010. 1327.66 s [vector] +++ OK, passed 100 tests.
  7011. 1327.66 s [vector] dropWhile: OK
  7012. 1327.66 s [vector] +++ OK, passed 100 tests.
  7013. 1327.66 s [vector] partition: OK
  7014. 1327.66 s [vector] +++ OK, passed 100 tests.
  7015. 1327.66 s [vector] partitionWith: OK
  7016. 1327.66 s [vector] +++ OK, passed 100 tests.
  7017. 1327.67 s [vector] span: OK
  7018. 1327.67 s [vector] +++ OK, passed 100 tests.
  7019. 1327.67 s [vector] break: OK
  7020. 1327.67 s [vector] +++ OK, passed 100 tests.
  7021. 1327.67 s [vector] spanR: OK
  7022. 1327.67 s [vector] +++ OK, passed 100 tests.
  7023. 1327.67 s [vector] breakR: OK
  7024. 1327.67 s [vector] +++ OK, passed 100 tests.
  7025. 1327.67 s [vector] groupBy: OK
  7026. 1327.67 s [vector] +++ OK, passed 100 tests.
  7027. 1327.68 s [vector] elem: OK
  7028. 1327.68 s [vector] +++ OK, passed 100 tests.
  7029. 1327.68 s [vector] notElem: OK
  7030. 1327.68 s [vector] +++ OK, passed 100 tests.
  7031. 1327.68 s [vector] find: OK
  7032. 1327.68 s [vector] +++ OK, passed 100 tests.
  7033. 1327.68 s [vector] findIndex: OK
  7034. 1327.68 s [vector] +++ OK, passed 100 tests.
  7035. 1327.68 s [vector] findIndexR: OK
  7036. 1327.68 s [vector] +++ OK, passed 100 tests.
  7037. 1327.68 s [vector] findIndices: OK
  7038. 1327.68 s [vector] +++ OK, passed 100 tests.
  7039. 1327.68 s [vector] elemIndex: OK
  7040. 1327.68 s [vector] +++ OK, passed 100 tests.
  7041. 1327.68 s [vector] elemIndices: OK
  7042. 1327.68 s [vector] +++ OK, passed 100 tests.
  7043. 1327.69 s [vector] foldl: OK
  7044. 1327.69 s [vector] +++ OK, passed 100 tests.
  7045. 1327.69 s [vector] foldl1: OK
  7046. 1327.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7047. 1327.69 s [vector] foldl': OK
  7048. 1327.70 s [vector] +++ OK, passed 100 tests.
  7049. 1327.70 s [vector] foldl1': OK
  7050. 1327.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7051. 1327.70 s [vector] foldr: OK
  7052. 1327.70 s [vector] +++ OK, passed 100 tests.
  7053. 1327.70 s [vector] foldr1: OK
  7054. 1327.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7055. 1327.70 s [vector] foldr': OK
  7056. 1327.70 s [vector] +++ OK, passed 100 tests.
  7057. 1327.71 s [vector] foldr1': OK
  7058. 1327.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7059. 1327.72 s [vector] ifoldl: OK
  7060. 1327.72 s [vector] +++ OK, passed 100 tests.
  7061. 1327.72 s [vector] ifoldl': OK
  7062. 1327.72 s [vector] +++ OK, passed 100 tests.
  7063. 1327.72 s [vector] ifoldr: OK
  7064. 1327.72 s [vector] +++ OK, passed 100 tests.
  7065. 1327.72 s [vector] ifoldr': OK
  7066. 1327.72 s [vector] +++ OK, passed 100 tests.
  7067. 1327.72 s [vector] ifoldM: OK
  7068. 1327.72 s [vector] +++ OK, passed 100 tests.
  7069. 1327.74 s [vector] ifoldM': OK
  7070. 1327.74 s [vector] +++ OK, passed 100 tests.
  7071. 1327.76 s [vector] ifoldM_: OK (0.02s)
  7072. 1327.76 s [vector] +++ OK, passed 100 tests.
  7073. 1327.77 s [vector] ifoldM'_: OK (0.02s)
  7074. 1327.77 s [vector] +++ OK, passed 100 tests.
  7075. 1327.77 s [vector] all: OK
  7076. 1327.77 s [vector] +++ OK, passed 100 tests.
  7077. 1327.77 s [vector] any: OK
  7078. 1327.77 s [vector] +++ OK, passed 100 tests.
  7079. 1327.77 s [vector] prescanl: OK
  7080. 1327.77 s [vector] +++ OK, passed 100 tests.
  7081. 1327.77 s [vector] prescanl': OK
  7082. 1327.78 s [vector] +++ OK, passed 100 tests.
  7083. 1327.78 s [vector] postscanl: OK
  7084. 1327.78 s [vector] +++ OK, passed 100 tests.
  7085. 1327.79 s [vector] postscanl': OK
  7086. 1327.79 s [vector] +++ OK, passed 100 tests.
  7087. 1327.80 s [vector] scanl: OK
  7088. 1327.80 s [vector] +++ OK, passed 100 tests.
  7089. 1327.80 s [vector] scanl': OK
  7090. 1327.80 s [vector] +++ OK, passed 100 tests.
  7091. 1327.80 s [vector] scanl1: OK
  7092. 1327.80 s [vector] +++ OK, passed 100 tests.
  7093. 1327.80 s [vector] scanl1': OK
  7094. 1327.80 s [vector] +++ OK, passed 100 tests.
  7095. 1327.80 s [vector] iscanl: OK
  7096. 1327.80 s [vector] +++ OK, passed 100 tests.
  7097. 1327.81 s [vector] iscanl': OK
  7098. 1327.81 s [vector] +++ OK, passed 100 tests.
  7099. 1327.81 s [vector] prescanr: OK
  7100. 1327.81 s [vector] +++ OK, passed 100 tests.
  7101. 1327.81 s [vector] prescanr': OK
  7102. 1327.81 s [vector] +++ OK, passed 100 tests.
  7103. 1327.81 s [vector] postscanr: OK
  7104. 1327.81 s [vector] +++ OK, passed 100 tests.
  7105. 1327.81 s [vector] postscanr': OK
  7106. 1327.81 s [vector] +++ OK, passed 100 tests.
  7107. 1327.82 s [vector] scanr: OK
  7108. 1327.82 s [vector] +++ OK, passed 100 tests.
  7109. 1327.82 s [vector] scanr': OK
  7110. 1327.82 s [vector] +++ OK, passed 100 tests.
  7111. 1327.82 s [vector] scanr1: OK
  7112. 1327.82 s [vector] +++ OK, passed 100 tests.
  7113. 1327.82 s [vector] scanr1': OK
  7114. 1327.82 s [vector] +++ OK, passed 100 tests.
  7115. 1327.83 s [vector] iscanr: OK
  7116. 1327.83 s [vector] +++ OK, passed 100 tests.
  7117. 1327.83 s [vector] iscanr': OK
  7118. 1327.83 s [vector] +++ OK, passed 100 tests.
  7119. 1327.83 s [vector] mut_read: OK
  7120. 1327.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7121. 1327.83 s [vector] mut_write: OK
  7122. 1327.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7123. 1327.83 s [vector] mut_modify: OK
  7124. 1327.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7125. 1327.84 s [vector] mut_generate: OK
  7126. 1327.84 s [vector] +++ OK, passed 100 tests.
  7127. 1327.86 s [vector] mut_generateM: OK (0.01s)
  7128. 1327.86 s [vector] +++ OK, passed 100 tests.
  7129. 1327.88 s [vector] mut_mapM_: OK (0.02s)
  7130. 1327.88 s [vector] +++ OK, passed 100 tests.
  7131. 1327.90 s [vector] mut_imapM_: OK (0.03s)
  7132. 1327.90 s [vector] +++ OK, passed 100 tests.
  7133. 1327.92 s [vector] mut_forM_: OK (0.02s)
  7134. 1327.92 s [vector] +++ OK, passed 100 tests.
  7135. 1327.94 s [vector] mut_iforM_: OK (0.02s)
  7136. 1327.94 s [vector] +++ OK, passed 100 tests.
  7137. 1327.94 s [vector] mut_foldr: OK
  7138. 1327.94 s [vector] +++ OK, passed 100 tests.
  7139. 1327.94 s [vector] mut_foldr': OK
  7140. 1327.94 s [vector] +++ OK, passed 100 tests.
  7141. 1327.95 s [vector] mut_foldl: OK
  7142. 1327.95 s [vector] +++ OK, passed 100 tests.
  7143. 1327.95 s [vector] mut_foldl': OK
  7144. 1327.95 s [vector] +++ OK, passed 100 tests.
  7145. 1327.95 s [vector] mut_ifoldr: OK
  7146. 1327.95 s [vector] +++ OK, passed 100 tests.
  7147. 1327.96 s [vector] mut_ifoldr': OK
  7148. 1327.96 s [vector] +++ OK, passed 100 tests.
  7149. 1327.96 s [vector] mut_ifoldl: OK
  7150. 1327.96 s [vector] +++ OK, passed 100 tests.
  7151. 1327.97 s [vector] mut_ifoldl': OK
  7152. 1327.97 s [vector] +++ OK, passed 100 tests.
  7153. 1327.97 s [vector] mut_foldM: OK
  7154. 1327.97 s [vector] +++ OK, passed 100 tests.
  7155. 1327.97 s [vector] mut_foldM': OK
  7156. 1327.97 s [vector] +++ OK, passed 100 tests.
  7157. 1327.98 s [vector] mut_foldrM: OK
  7158. 1327.98 s [vector] +++ OK, passed 100 tests.
  7159. 1327.98 s [vector] mut_foldrM': OK
  7160. 1327.98 s [vector] +++ OK, passed 100 tests.
  7161. 1327.98 s [vector] mut_ifoldM: OK
  7162. 1327.98 s [vector] +++ OK, passed 100 tests.
  7163. 1327.99 s [vector] mut_ifoldM': OK
  7164. 1327.99 s [vector] +++ OK, passed 100 tests.
  7165. 1327.99 s [vector] mut_ifoldrM: OK
  7166. 1328.19 s [vector] +++ OK, passed 100 tests.
  7167. 1328.19 s [vector] mut_ifoldrM': OK
  7168. 1328.19 s [vector] +++ OK, passed 100 tests.
  7169. 1328.19 s [vector] compare: OK
  7170. 1328.19 s [vector] +++ OK, passed 100 tests.
  7171. 1328.19 s [vector] maximum: OK
  7172. 1328.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7173. 1328.19 s [vector] minimum: OK
  7174. 1328.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7175. 1328.19 s [vector] minIndex: OK
  7176. 1328.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7177. 1328.19 s [vector] maxIndex: OK
  7178. 1328.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7179. 1328.19 s [vector] maximumBy: OK
  7180. 1328.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7181. 1328.19 s [vector] minimumBy: OK
  7182. 1328.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7183. 1328.19 s [vector] maximumOn: OK
  7184. 1328.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7185. 1328.19 s [vector] minimumOn: OK
  7186. 1328.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7187. 1328.19 s [vector] maxIndexBy: OK
  7188. 1328.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7189. 1328.19 s [vector] minIndexBy: OK
  7190. 1328.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7191. 1328.19 s [vector] ListFirstMaxIndexWins: OK
  7192. 1328.19 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7193. 1328.19 s [vector] FalseListFirstMaxIndexWins: OK
  7194. 1328.19 s [vector] +++ OK, failed as expected. (after 1 test):
  7195. 1328.19 s [vector] Exception:
  7196. 1328.19 s [vector] Prelude.foldr1: empty list
  7197. 1328.19 s [vector] CallStack (from HasCallStack):
  7198. 1328.19 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  7199. 1328.19 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  7200. 1328.19 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7201. 1328.19 s [vector] []
  7202. 1328.19 s [vector] mempty: OK
  7203. 1328.19 s [vector] +++ OK, passed 100 tests.
  7204. 1328.19 s [vector] mappend: OK
  7205. 1328.19 s [vector] +++ OK, passed 100 tests.
  7206. 1328.19 s [vector] mconcat: OK (0.01s)
  7207. 1328.19 s [vector] +++ OK, passed 100 tests.
  7208. 1328.19 s [vector] glength: OK
  7209. 1328.19 s [vector] +++ OK, passed 100 tests.
  7210. 1328.19 s [vector] sum: OK
  7211. 1328.19 s [vector] +++ OK, passed 100 tests.
  7212. 1328.19 s [vector] product: OK
  7213. 1328.19 s [vector] +++ OK, passed 100 tests.
  7214. 1328.19 s [vector] enumFromN: OK
  7215. 1328.19 s [vector] +++ OK, passed 100 tests.
  7216. 1328.19 s [vector] enumFromThenN: OK
  7217. 1328.19 s [vector] +++ OK, passed 100 tests.
  7218. 1328.19 s [vector] enumFromTo: OK
  7219. 1328.19 s [vector] +++ OK, passed 100 tests.
  7220. 1328.19 s [vector] enumFromThenTo: OK
  7221. 1328.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7222. 1328.19 s [vector] Data.Vector.Storable.Vector (Double)
  7223. 1328.19 s [vector] fromList.toList == id: OK
  7224. 1328.19 s [vector] +++ OK, passed 100 tests.
  7225. 1328.19 s [vector] toList.fromList == id: OK
  7226. 1328.19 s [vector] +++ OK, passed 100 tests.
  7227. 1328.19 s [vector] unstream.stream == id: OK
  7228. 1328.19 s [vector] +++ OK, passed 100 tests.
  7229. 1328.19 s [vector] stream.unstream == id: OK
  7230. 1328.19 s [vector] +++ OK, passed 100 tests.
  7231. 1328.19 s [vector] eq: OK
  7232. 1328.19 s [vector] +++ OK, passed 100 tests.
  7233. 1328.19 s [vector] length: OK
  7234. 1328.19 s [vector] +++ OK, passed 100 tests.
  7235. 1328.19 s [vector] null: OK
  7236. 1328.19 s [vector] +++ OK, passed 100 tests.
  7237. 1328.19 s [vector] index: OK
  7238. 1328.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7239. 1328.19 s [vector] safeIndex: OK
  7240. 1328.19 s [vector] +++ OK, passed 100 tests.
  7241. 1328.19 s [vector] head: OK
  7242. 1328.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7243. 1328.19 s [vector] last: OK
  7244. 1328.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7245. 1328.19 s [vector] unsafeIndex: OK
  7246. 1328.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7247. 1328.19 s [vector] unsafeHead: OK
  7248. 1328.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7249. 1328.19 s [vector] unsafeLast: OK
  7250. 1328.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7251. 1328.19 s [vector] slice: OK
  7252. 1328.19 s [vector] +++ OK, passed 100 tests.
  7253. 1328.19 s [vector] init: OK
  7254. 1328.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7255. 1328.20 s [vector] tail: OK
  7256. 1328.20 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7257. 1328.20 s [vector] take: OK
  7258. 1328.20 s [vector] +++ OK, passed 100 tests.
  7259. 1328.20 s [vector] drop: OK
  7260. 1328.20 s [vector] +++ OK, passed 100 tests.
  7261. 1328.20 s [vector] splitAt: OK
  7262. 1328.20 s [vector] +++ OK, passed 100 tests.
  7263. 1328.20 s [vector] empty: OK
  7264. 1328.20 s [vector] +++ OK, passed 100 tests.
  7265. 1328.20 s [vector] singleton: OK
  7266. 1328.20 s [vector] +++ OK, passed 100 tests.
  7267. 1328.20 s [vector] replicate: OK
  7268. 1328.20 s [vector] +++ OK, passed 100 tests.
  7269. 1328.20 s [vector] generate: OK
  7270. 1328.20 s [vector] +++ OK, passed 100 tests.
  7271. 1328.20 s [vector] iterateN: OK
  7272. 1328.20 s [vector] +++ OK, passed 100 tests.
  7273. 1328.20 s [vector] iterateNM: OK (0.04s)
  7274. 1328.20 s [vector] +++ OK, passed 100 tests.
  7275. 1328.20 s [vector] generateM: OK (0.03s)
  7276. 1328.20 s [vector] +++ OK, passed 100 tests.
  7277. 1328.20 s [vector] replicateM: OK
  7278. 1328.20 s [vector] +++ OK, passed 100 tests.
  7279. 1328.20 s [vector] create: OK
  7280. 1328.20 s [vector] +++ OK, passed 100 tests.
  7281. 1328.20 s [vector] createT: OK
  7282. 1328.20 s [vector] +++ OK, passed 100 tests.
  7283. 1328.20 s [vector] unfoldr: OK
  7284. 1328.20 s [vector] +++ OK, passed 100 tests.
  7285. 1328.20 s [vector] unfoldrN: OK
  7286. 1328.20 s [vector] +++ OK, passed 100 tests.
  7287. 1328.20 s [vector] unfoldrExactN: OK
  7288. 1328.20 s [vector] +++ OK, passed 100 tests.
  7289. 1328.20 s [vector] unfoldrM: OK
  7290. 1328.20 s [vector] +++ OK, passed 100 tests.
  7291. 1328.20 s [vector] unfoldrNM: OK
  7292. 1328.20 s [vector] +++ OK, passed 100 tests.
  7293. 1328.20 s [vector] unfoldrExactNM: OK (0.05s)
  7294. 1328.20 s [vector] +++ OK, passed 100 tests.
  7295. 1328.22 s [vector] constructN: OK (0.01s)
  7296. 1328.22 s [vector] +++ OK, passed 100 tests.
  7297. 1328.22 s [vector] constructrN: OK (0.02s)
  7298. 1328.22 s [vector] +++ OK, passed 100 tests.
  7299. 1328.24 s [vector] cons: OK
  7300. 1328.24 s [vector] +++ OK, passed 100 tests.
  7301. 1328.24 s [vector] snoc: OK
  7302. 1328.24 s [vector] +++ OK, passed 100 tests.
  7303. 1328.24 s [vector] append: OK
  7304. 1328.24 s [vector] +++ OK, passed 100 tests.
  7305. 1328.25 s [vector] concat: OK (0.03s)
  7306. 1328.26 s [vector] +++ OK, passed 100 tests.
  7307. 1328.26 s [vector] force: OK
  7308. 1328.26 s [vector] +++ OK, passed 100 tests.
  7309. 1328.26 s [vector] upd: OK
  7310. 1328.26 s [vector] +++ OK, passed 100 tests.
  7311. 1328.27 s [vector] accum: OK (0.01s)
  7312. 1328.27 s [vector] +++ OK, passed 100 tests.
  7313. 1328.27 s [vector] reverse: OK
  7314. 1328.27 s [vector] +++ OK, passed 100 tests.
  7315. 1328.28 s [vector] backpermute: OK
  7316. 1328.28 s [vector] +++ OK, passed 100 tests.
  7317. 1328.28 s [vector] map: OK
  7318. 1328.28 s [vector] +++ OK, passed 100 tests.
  7319. 1328.30 s [vector] imap: OK
  7320. 1328.31 s [vector] +++ OK, passed 100 tests.
  7321. 1328.32 s [vector] concatMap: OK
  7322. 1328.32 s [vector] +++ OK, passed 100 tests.
  7323. 1328.32 s [vector] mapM: OK
  7324. 1328.32 s [vector] +++ OK, passed 100 tests.
  7325. 1328.36 s [vector] mapM_: OK (0.05s)
  7326. 1328.36 s [vector] +++ OK, passed 100 tests.
  7327. 1328.38 s [vector] forM: OK
  7328. 1328.38 s [vector] +++ OK, passed 100 tests.
  7329. 1328.42 s [vector] forM_: OK (0.04s)
  7330. 1328.42 s [vector] +++ OK, passed 100 tests.
  7331. 1328.44 s [vector] imapM: OK (0.02s)
  7332. 1328.44 s [vector] +++ OK, passed 100 tests.
  7333. 1328.48 s [vector] imapM_: OK (0.05s)
  7334. 1328.48 s [vector] +++ OK, passed 100 tests.
  7335. 1328.50 s [vector] zipWith: OK (0.01s)
  7336. 1328.50 s [vector] +++ OK, passed 100 tests.
  7337. 1328.50 s [vector] zipWith3: OK (0.01s)
  7338. 1328.51 s [vector] +++ OK, passed 100 tests.
  7339. 1328.52 s [vector] izipWith: OK (0.01s)
  7340. 1328.52 s [vector] +++ OK, passed 100 tests.
  7341. 1328.52 s [vector] izipWith3: OK (0.01s)
  7342. 1328.52 s [vector] +++ OK, passed 100 tests.
  7343. 1328.54 s [vector] izipWithM: OK
  7344. 1328.54 s [vector] +++ OK, passed 100 tests.
  7345. 1328.58 s [vector] izipWithM_: OK (0.03s)
  7346. 1328.58 s [vector] +++ OK, passed 100 tests.
  7347. 1328.58 s [vector] zipWithM: OK (0.01s)
  7348. 1328.58 s [vector] +++ OK, passed 100 tests.
  7349. 1328.62 s [vector] zipWithM_: OK (0.03s)
  7350. 1328.62 s [vector] +++ OK, passed 100 tests.
  7351. 1328.62 s [vector] filter: OK
  7352. 1328.62 s [vector] +++ OK, passed 100 tests.
  7353. 1328.64 s [vector] ifilter: OK (0.01s)
  7354. 1328.64 s [vector] +++ OK, passed 100 tests.
  7355. 1328.69 s [vector] filterM: OK (0.05s)
  7356. 1328.70 s [vector] +++ OK, passed 100 tests.
  7357. 1328.70 s [vector] uniq: OK
  7358. 1328.70 s [vector] +++ OK, passed 100 tests.
  7359. 1328.70 s [vector] mapMaybe: OK
  7360. 1328.70 s [vector] +++ OK, passed 100 tests.
  7361. 1328.70 s [vector] imapMaybe: OK
  7362. 1328.70 s [vector] +++ OK, passed 100 tests.
  7363. 1328.70 s [vector] takeWhile: OK
  7364. 1328.70 s [vector] +++ OK, passed 100 tests.
  7365. 1328.70 s [vector] dropWhile: OK
  7366. 1328.70 s [vector] +++ OK, passed 100 tests.
  7367. 1328.71 s [vector] partition: OK
  7368. 1328.71 s [vector] +++ OK, passed 100 tests.
  7369. 1328.71 s [vector] partitionWith: OK
  7370. 1328.71 s [vector] +++ OK, passed 100 tests.
  7371. 1328.72 s [vector] span: OK
  7372. 1328.72 s [vector] +++ OK, passed 100 tests.
  7373. 1328.72 s [vector] break: OK
  7374. 1328.72 s [vector] +++ OK, passed 100 tests.
  7375. 1328.72 s [vector] spanR: OK
  7376. 1328.72 s [vector] +++ OK, passed 100 tests.
  7377. 1328.73 s [vector] breakR: OK
  7378. 1328.73 s [vector] +++ OK, passed 100 tests.
  7379. 1328.73 s [vector] groupBy: OK
  7380. 1328.73 s [vector] +++ OK, passed 100 tests.
  7381. 1328.73 s [vector] elem: OK
  7382. 1328.73 s [vector] +++ OK, passed 100 tests.
  7383. 1328.73 s [vector] notElem: OK
  7384. 1328.73 s [vector] +++ OK, passed 100 tests.
  7385. 1328.73 s [vector] find: OK
  7386. 1328.74 s [vector] +++ OK, passed 100 tests.
  7387. 1328.74 s [vector] findIndex: OK
  7388. 1328.74 s [vector] +++ OK, passed 100 tests.
  7389. 1328.75 s [vector] findIndexR: OK
  7390. 1328.75 s [vector] +++ OK, passed 100 tests.
  7391. 1328.75 s [vector] findIndices: OK
  7392. 1328.75 s [vector] +++ OK, passed 100 tests.
  7393. 1328.75 s [vector] elemIndex: OK
  7394. 1328.75 s [vector] +++ OK, passed 100 tests.
  7395. 1328.75 s [vector] elemIndices: OK
  7396. 1328.76 s [vector] +++ OK, passed 100 tests.
  7397. 1328.78 s [vector] foldl: OK (0.02s)
  7398. 1328.78 s [vector] +++ OK, passed 100 tests.
  7399. 1328.80 s [vector] foldl1: OK (0.02s)
  7400. 1328.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7401. 1328.82 s [vector] foldl': OK (0.02s)
  7402. 1328.82 s [vector] +++ OK, passed 100 tests.
  7403. 1328.86 s [vector] foldl1': OK (0.04s)
  7404. 1328.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7405. 1328.88 s [vector] foldr: OK (0.03s)
  7406. 1328.88 s [vector] +++ OK, passed 100 tests.
  7407. 1328.92 s [vector] foldr1: OK (0.02s)
  7408. 1328.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7409. 1328.94 s [vector] foldr': OK (0.02s)
  7410. 1328.94 s [vector] +++ OK, passed 100 tests.
  7411. 1328.96 s [vector] foldr1': OK (0.02s)
  7412. 1328.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7413. 1328.98 s [vector] ifoldl: OK (0.03s)
  7414. 1328.98 s [vector] +++ OK, passed 100 tests.
  7415. 1329.02 s [vector] ifoldl': OK (0.02s)
  7416. 1329.02 s [vector] +++ OK, passed 100 tests.
  7417. 1329.02 s [vector] ifoldr: OK (0.02s)
  7418. 1329.02 s [vector] +++ OK, passed 100 tests.
  7419. 1329.04 s [vector] ifoldr': OK (0.02s)
  7420. 1329.04 s [vector] +++ OK, passed 100 tests.
  7421. 1329.08 s [vector] ifoldM: OK
  7422. 1329.08 s [vector] +++ OK, passed 100 tests.
  7423. 1329.08 s [vector] ifoldM': OK (0.02s)
  7424. 1329.08 s [vector] +++ OK, passed 100 tests.
  7425. 1329.12 s [vector] ifoldM_: OK (0.03s)
  7426. 1329.12 s [vector] +++ OK, passed 100 tests.
  7427. 1329.16 s [vector] ifoldM'_: OK (0.05s)
  7428. 1329.16 s [vector] +++ OK, passed 100 tests.
  7429. 1329.16 s [vector] all: OK
  7430. 1329.16 s [vector] +++ OK, passed 100 tests.
  7431. 1329.16 s [vector] any: OK
  7432. 1329.16 s [vector] +++ OK, passed 100 tests.
  7433. 1329.20 s [vector] prescanl: OK (0.03s)
  7434. 1329.20 s [vector] +++ OK, passed 100 tests.
  7435. 1329.22 s [vector] prescanl': OK (0.02s)
  7436. 1329.22 s [vector] +++ OK, passed 100 tests.
  7437. 1329.24 s [vector] postscanl: OK (0.01s)
  7438. 1329.24 s [vector] +++ OK, passed 100 tests.
  7439. 1329.24 s [vector] postscanl': OK (0.01s)
  7440. 1329.24 s [vector] +++ OK, passed 100 tests.
  7441. 1329.26 s [vector] scanl: OK (0.02s)
  7442. 1329.26 s [vector] +++ OK, passed 100 tests.
  7443. 1329.28 s [vector] scanl': OK (0.02s)
  7444. 1329.28 s [vector] +++ OK, passed 100 tests.
  7445. 1329.30 s [vector] scanl1: OK (0.02s)
  7446. 1329.30 s [vector] +++ OK, passed 100 tests.
  7447. 1329.32 s [vector] scanl1': OK (0.02s)
  7448. 1329.32 s [vector] +++ OK, passed 100 tests.
  7449. 1329.34 s [vector] iscanl: OK (0.02s)
  7450. 1329.34 s [vector] +++ OK, passed 100 tests.
  7451. 1329.36 s [vector] iscanl': OK (0.02s)
  7452. 1329.36 s [vector] +++ OK, passed 100 tests.
  7453. 1329.37 s [vector] prescanr: OK (0.01s)
  7454. 1329.37 s [vector] +++ OK, passed 100 tests.
  7455. 1329.38 s [vector] prescanr': OK (0.01s)
  7456. 1329.38 s [vector] +++ OK, passed 100 tests.
  7457. 1329.40 s [vector] postscanr: OK (0.02s)
  7458. 1329.40 s [vector] +++ OK, passed 100 tests.
  7459. 1329.42 s [vector] postscanr': OK (0.02s)
  7460. 1329.44 s [vector] +++ OK, passed 100 tests.
  7461. 1329.44 s [vector] scanr: OK (0.02s)
  7462. 1329.45 s [vector] +++ OK, passed 100 tests.
  7463. 1329.45 s [vector] scanr': OK (0.02s)
  7464. 1329.45 s [vector] +++ OK, passed 100 tests.
  7465. 1329.46 s [vector] scanr1: OK (0.01s)
  7466. 1329.47 s [vector] +++ OK, passed 100 tests.
  7467. 1329.48 s [vector] scanr1': OK (0.02s)
  7468. 1329.48 s [vector] +++ OK, passed 100 tests.
  7469. 1329.50 s [vector] iscanr: OK (0.03s)
  7470. 1329.50 s [vector] +++ OK, passed 100 tests.
  7471. 1329.51 s [vector] iscanr': OK (0.01s)
  7472. 1329.51 s [vector] +++ OK, passed 100 tests.
  7473. 1329.52 s [vector] mut_read: OK
  7474. 1329.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7475. 1329.52 s [vector] mut_write: OK
  7476. 1329.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7477. 1329.52 s [vector] mut_modify: OK
  7478. 1329.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7479. 1329.54 s [vector] mut_generate: OK
  7480. 1329.54 s [vector] +++ OK, passed 100 tests.
  7481. 1329.56 s [vector] mut_generateM: OK (0.02s)
  7482. 1329.56 s [vector] +++ OK, passed 100 tests.
  7483. 1329.60 s [vector] mut_mapM_: OK (0.04s)
  7484. 1329.60 s [vector] +++ OK, passed 100 tests.
  7485. 1329.64 s [vector] mut_imapM_: OK (0.05s)
  7486. 1329.64 s [vector] +++ OK, passed 100 tests.
  7487. 1329.70 s [vector] mut_forM_: OK (0.05s)
  7488. 1329.70 s [vector] +++ OK, passed 100 tests.
  7489. 1329.74 s [vector] mut_iforM_: OK (0.04s)
  7490. 1329.74 s [vector] +++ OK, passed 100 tests.
  7491. 1329.74 s [vector] mut_foldr: OK (0.02s)
  7492. 1329.74 s [vector] +++ OK, passed 100 tests.
  7493. 1329.76 s [vector] mut_foldr': OK (0.01s)
  7494. 1329.76 s [vector] +++ OK, passed 100 tests.
  7495. 1329.78 s [vector] mut_foldl: OK (0.01s)
  7496. 1329.78 s [vector] +++ OK, passed 100 tests.
  7497. 1329.78 s [vector] mut_foldl': OK (0.01s)
  7498. 1329.78 s [vector] +++ OK, passed 100 tests.
  7499. 1329.80 s [vector] mut_ifoldr: OK (0.02s)
  7500. 1329.80 s [vector] +++ OK, passed 100 tests.
  7501. 1329.82 s [vector] mut_ifoldr': OK (0.02s)
  7502. 1329.82 s [vector] +++ OK, passed 100 tests.
  7503. 1329.84 s [vector] mut_ifoldl: OK (0.02s)
  7504. 1329.84 s [vector] +++ OK, passed 100 tests.
  7505. 1329.86 s [vector] mut_ifoldl': OK (0.02s)
  7506. 1329.86 s [vector] +++ OK, passed 100 tests.
  7507. 1329.88 s [vector] mut_foldM: OK (0.01s)
  7508. 1329.88 s [vector] +++ OK, passed 100 tests.
  7509. 1329.88 s [vector] mut_foldM': OK (0.01s)
  7510. 1329.88 s [vector] +++ OK, passed 100 tests.
  7511. 1329.90 s [vector] mut_foldrM: OK (0.02s)
  7512. 1329.90 s [vector] +++ OK, passed 100 tests.
  7513. 1329.91 s [vector] mut_foldrM': OK (0.02s)
  7514. 1329.91 s [vector] +++ OK, passed 100 tests.
  7515. 1329.94 s [vector] mut_ifoldM: OK
  7516. 1329.94 s [vector] +++ OK, passed 100 tests.
  7517. 1329.94 s [vector] mut_ifoldM': OK (0.01s)
  7518. 1329.94 s [vector] +++ OK, passed 100 tests.
  7519. 1329.96 s [vector] mut_ifoldrM: OK
  7520. 1329.96 s [vector] +++ OK, passed 100 tests.
  7521. 1329.97 s [vector] mut_ifoldrM': OK (0.01s)
  7522. 1329.97 s [vector] +++ OK, passed 100 tests.
  7523. 1329.97 s [vector] compare: OK
  7524. 1329.97 s [vector] +++ OK, passed 100 tests.
  7525. 1329.97 s [vector] maximum: OK
  7526. 1329.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7527. 1329.97 s [vector] minimum: OK
  7528. 1329.97 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7529. 1329.97 s [vector] minIndex: OK
  7530. 1329.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7531. 1329.97 s [vector] maxIndex: OK
  7532. 1329.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7533. 1329.98 s [vector] maximumBy: OK
  7534. 1329.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7535. 1329.98 s [vector] minimumBy: OK
  7536. 1329.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7537. 1329.98 s [vector] maximumOn: OK
  7538. 1329.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7539. 1329.98 s [vector] minimumOn: OK
  7540. 1329.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7541. 1329.98 s [vector] maxIndexBy: OK
  7542. 1329.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7543. 1329.98 s [vector] minIndexBy: OK
  7544. 1329.98 s [vector] +++ OK, passed 100 tests; 26 discarded.
  7545. 1329.98 s [vector] ListFirstMaxIndexWins: OK
  7546. 1329.98 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7547. 1329.98 s [vector] FalseListFirstMaxIndexWins: OK
  7548. 1329.98 s [vector] +++ OK, failed as expected. (after 1 test):
  7549. 1329.98 s [vector] Exception:
  7550. 1329.98 s [vector] Prelude.foldr1: empty list
  7551. 1329.98 s [vector] CallStack (from HasCallStack):
  7552. 1329.98 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  7553. 1329.98 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  7554. 1329.98 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7555. 1329.98 s [vector] []
  7556. 1329.98 s [vector] mempty: OK
  7557. 1329.99 s [vector] +++ OK, passed 100 tests.
  7558. 1329.99 s [vector] mappend: OK
  7559. 1330.00 s [vector] +++ OK, passed 100 tests.
  7560. 1330.02 s [vector] mconcat: OK (0.03s)
  7561. 1330.02 s [vector] +++ OK, passed 100 tests.
  7562. 1330.02 s [vector] glength: OK
  7563. 1330.02 s [vector] +++ OK, passed 100 tests.
  7564. 1330.02 s [vector] sum: OK
  7565. 1330.02 s [vector] +++ OK, passed 100 tests.
  7566. 1330.02 s [vector] product: OK
  7567. 1330.02 s [vector] +++ OK, passed 100 tests.
  7568. 1330.02 s [vector] enumFromN: OK
  7569. 1330.02 s [vector] +++ OK, passed 100 tests.
  7570. 1330.02 s [vector] enumFromThenN: OK
  7571. 1330.02 s [vector] +++ OK, passed 100 tests.
  7572. 1330.02 s [vector] enumFromTo: OK
  7573. 1330.02 s [vector] +++ OK, passed 100 tests.
  7574. 1330.02 s [vector] enumFromThenTo: OK
  7575. 1330.02 s [vector] +++ OK, passed 100 tests; 4 discarded.
  7576. 1330.02 s [vector] unstream
  7577. 1330.03 s [vector] unstream == vunstream (exact): OK
  7578. 1330.03 s [vector] +++ OK, passed 100 tests.
  7579. 1330.03 s [vector] unstream == vunstream (unknown): OK
  7580. 1330.03 s [vector] +++ OK, passed 100 tests.
  7581. 1330.03 s [vector] unstreamR ~= vunstream (exact): OK
  7582. 1330.03 s [vector] +++ OK, passed 100 tests.
  7583. 1330.03 s [vector] unstreamR ~= vunstream (unknown): OK
  7584. 1330.03 s [vector] +++ OK, passed 100 tests.
  7585. 1330.03 s [vector] Tests.Vector.Strict
  7586. 1330.03 s [vector] Bool
  7587. 1330.03 s [vector] fromList.toList == id: OK
  7588. 1330.03 s [vector] +++ OK, passed 100 tests.
  7589. 1330.03 s [vector] toList.fromList == id: OK
  7590. 1330.03 s [vector] +++ OK, passed 100 tests.
  7591. 1330.03 s [vector] unstream.stream == id: OK
  7592. 1330.03 s [vector] +++ OK, passed 100 tests.
  7593. 1330.03 s [vector] stream.unstream == id: OK
  7594. 1330.03 s [vector] +++ OK, passed 100 tests.
  7595. 1330.03 s [vector] eq: OK
  7596. 1330.03 s [vector] +++ OK, passed 100 tests.
  7597. 1330.03 s [vector] length: OK
  7598. 1330.03 s [vector] +++ OK, passed 100 tests.
  7599. 1330.03 s [vector] null: OK
  7600. 1330.03 s [vector] +++ OK, passed 100 tests.
  7601. 1330.03 s [vector] index: OK
  7602. 1330.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7603. 1330.04 s [vector] safeIndex: OK
  7604. 1330.04 s [vector] +++ OK, passed 100 tests.
  7605. 1330.04 s [vector] head: OK
  7606. 1330.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7607. 1330.04 s [vector] last: OK
  7608. 1330.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7609. 1330.04 s [vector] unsafeIndex: OK
  7610. 1330.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7611. 1330.04 s [vector] unsafeHead: OK
  7612. 1330.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7613. 1330.04 s [vector] unsafeLast: OK
  7614. 1330.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7615. 1330.04 s [vector] slice: OK
  7616. 1330.04 s [vector] +++ OK, passed 100 tests.
  7617. 1330.04 s [vector] init: OK
  7618. 1330.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7619. 1330.04 s [vector] tail: OK
  7620. 1330.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7621. 1330.04 s [vector] take: OK
  7622. 1330.04 s [vector] +++ OK, passed 100 tests.
  7623. 1330.04 s [vector] drop: OK
  7624. 1330.04 s [vector] +++ OK, passed 100 tests.
  7625. 1330.04 s [vector] splitAt: OK
  7626. 1330.04 s [vector] +++ OK, passed 100 tests.
  7627. 1330.04 s [vector] empty: OK
  7628. 1330.04 s [vector] +++ OK, passed 100 tests.
  7629. 1330.04 s [vector] singleton: OK
  7630. 1330.04 s [vector] +++ OK, passed 100 tests.
  7631. 1330.04 s [vector] replicate: OK
  7632. 1330.04 s [vector] +++ OK, passed 100 tests.
  7633. 1330.04 s [vector] generate: OK
  7634. 1330.04 s [vector] +++ OK, passed 100 tests.
  7635. 1330.06 s [vector] iterateN: OK
  7636. 1330.06 s [vector] +++ OK, passed 100 tests.
  7637. 1330.10 s [vector] iterateNM: OK (0.05s)
  7638. 1330.10 s [vector] +++ OK, passed 100 tests.
  7639. 1330.12 s [vector] generateM: OK (0.02s)
  7640. 1330.12 s [vector] +++ OK, passed 100 tests.
  7641. 1330.13 s [vector] replicateM: OK (0.02s)
  7642. 1330.13 s [vector] +++ OK, passed 100 tests.
  7643. 1330.13 s [vector] create: OK
  7644. 1330.13 s [vector] +++ OK, passed 100 tests.
  7645. 1330.13 s [vector] createT: OK
  7646. 1330.13 s [vector] +++ OK, passed 100 tests.
  7647. 1330.14 s [vector] unfoldr: OK
  7648. 1330.14 s [vector] +++ OK, passed 100 tests.
  7649. 1330.14 s [vector] unfoldrN: OK
  7650. 1330.14 s [vector] +++ OK, passed 100 tests.
  7651. 1330.14 s [vector] unfoldrExactN: OK
  7652. 1330.14 s [vector] +++ OK, passed 100 tests.
  7653. 1330.14 s [vector] unfoldrM: OK
  7654. 1330.14 s [vector] +++ OK, passed 100 tests.
  7655. 1330.16 s [vector] unfoldrNM: OK
  7656. 1330.16 s [vector] +++ OK, passed 100 tests.
  7657. 1330.17 s [vector] unfoldrExactNM: OK (0.02s)
  7658. 1330.17 s [vector] +++ OK, passed 100 tests.
  7659. 1330.17 s [vector] constructN: OK
  7660. 1330.17 s [vector] +++ OK, passed 100 tests.
  7661. 1330.17 s [vector] constructrN: OK
  7662. 1330.17 s [vector] +++ OK, passed 100 tests.
  7663. 1330.17 s [vector] cons: OK
  7664. 1330.17 s [vector] +++ OK, passed 100 tests.
  7665. 1330.17 s [vector] snoc: OK
  7666. 1330.18 s [vector] +++ OK, passed 100 tests.
  7667. 1330.18 s [vector] append: OK
  7668. 1330.18 s [vector] +++ OK, passed 100 tests.
  7669. 1330.18 s [vector] concat: OK
  7670. 1330.18 s [vector] +++ OK, passed 100 tests.
  7671. 1330.18 s [vector] force: OK
  7672. 1330.18 s [vector] +++ OK, passed 100 tests.
  7673. 1330.19 s [vector] upd: OK
  7674. 1330.19 s [vector] +++ OK, passed 100 tests.
  7675. 1330.19 s [vector] accum: OK
  7676. 1330.19 s [vector] +++ OK, passed 100 tests.
  7677. 1330.19 s [vector] reverse: OK
  7678. 1330.19 s [vector] +++ OK, passed 100 tests.
  7679. 1330.19 s [vector] backpermute: OK
  7680. 1330.20 s [vector] +++ OK, passed 100 tests.
  7681. 1330.20 s [vector] map: OK
  7682. 1330.20 s [vector] +++ OK, passed 100 tests.
  7683. 1330.20 s [vector] imap: OK
  7684. 1330.20 s [vector] +++ OK, passed 100 tests.
  7685. 1330.20 s [vector] concatMap: OK
  7686. 1330.20 s [vector] +++ OK, passed 100 tests.
  7687. 1330.20 s [vector] mapM: OK
  7688. 1330.20 s [vector] +++ OK, passed 100 tests.
  7689. 1330.23 s [vector] mapM_: OK (0.02s)
  7690. 1330.23 s [vector] +++ OK, passed 100 tests.
  7691. 1330.23 s [vector] forM: OK (0.01s)
  7692. 1330.23 s [vector] +++ OK, passed 100 tests.
  7693. 1330.26 s [vector] forM_: OK (0.02s)
  7694. 1330.26 s [vector] +++ OK, passed 100 tests.
  7695. 1330.28 s [vector] imapM: OK
  7696. 1330.28 s [vector] +++ OK, passed 100 tests.
  7697. 1330.30 s [vector] imapM_: OK (0.04s)
  7698. 1330.30 s [vector] +++ OK, passed 100 tests.
  7699. 1330.30 s [vector] zipWith: OK
  7700. 1330.30 s [vector] +++ OK, passed 100 tests.
  7701. 1330.30 s [vector] zipWith3: OK
  7702. 1330.31 s [vector] +++ OK, passed 100 tests.
  7703. 1330.31 s [vector] izipWith: OK
  7704. 1330.31 s [vector] +++ OK, passed 100 tests.
  7705. 1330.31 s [vector] izipWith3: OK
  7706. 1330.31 s [vector] +++ OK, passed 100 tests.
  7707. 1330.31 s [vector] izipWithM: OK
  7708. 1330.32 s [vector] +++ OK, passed 100 tests.
  7709. 1330.32 s [vector] izipWithM_: OK
  7710. 1330.32 s [vector] +++ OK, passed 100 tests.
  7711. 1330.33 s [vector] zipWithM: OK
  7712. 1330.33 s [vector] +++ OK, passed 100 tests.
  7713. 1330.33 s [vector] zipWithM_: OK (0.01s)
  7714. 1330.33 s [vector] +++ OK, passed 100 tests.
  7715. 1330.34 s [vector] filter: OK
  7716. 1330.34 s [vector] +++ OK, passed 100 tests.
  7717. 1330.34 s [vector] ifilter: OK
  7718. 1330.34 s [vector] +++ OK, passed 100 tests.
  7719. 1330.36 s [vector] filterM: OK (0.02s)
  7720. 1330.36 s [vector] +++ OK, passed 100 tests.
  7721. 1330.36 s [vector] uniq: OK
  7722. 1330.36 s [vector] +++ OK, passed 100 tests.
  7723. 1330.36 s [vector] mapMaybe: OK
  7724. 1330.36 s [vector] +++ OK, passed 100 tests.
  7725. 1330.36 s [vector] imapMaybe: OK
  7726. 1330.37 s [vector] +++ OK, passed 100 tests.
  7727. 1330.37 s [vector] takeWhile: OK
  7728. 1330.37 s [vector] +++ OK, passed 100 tests.
  7729. 1330.37 s [vector] dropWhile: OK
  7730. 1330.37 s [vector] +++ OK, passed 100 tests.
  7731. 1330.37 s [vector] partition: OK
  7732. 1330.37 s [vector] +++ OK, passed 100 tests.
  7733. 1330.37 s [vector] partitionWith: OK
  7734. 1330.37 s [vector] +++ OK, passed 100 tests.
  7735. 1330.37 s [vector] span: OK
  7736. 1330.37 s [vector] +++ OK, passed 100 tests.
  7737. 1330.37 s [vector] break: OK
  7738. 1330.37 s [vector] +++ OK, passed 100 tests.
  7739. 1330.37 s [vector] spanR: OK
  7740. 1330.37 s [vector] +++ OK, passed 100 tests.
  7741. 1330.37 s [vector] breakR: OK
  7742. 1330.37 s [vector] +++ OK, passed 100 tests.
  7743. 1330.37 s [vector] groupBy: OK
  7744. 1330.37 s [vector] +++ OK, passed 100 tests.
  7745. 1330.38 s [vector] elem: OK
  7746. 1330.38 s [vector] +++ OK, passed 100 tests.
  7747. 1330.38 s [vector] notElem: OK
  7748. 1330.38 s [vector] +++ OK, passed 100 tests.
  7749. 1330.38 s [vector] find: OK
  7750. 1330.38 s [vector] +++ OK, passed 100 tests.
  7751. 1330.38 s [vector] findIndex: OK
  7752. 1330.38 s [vector] +++ OK, passed 100 tests.
  7753. 1330.38 s [vector] findIndexR: OK
  7754. 1330.38 s [vector] +++ OK, passed 100 tests.
  7755. 1330.38 s [vector] findIndices: OK
  7756. 1330.38 s [vector] +++ OK, passed 100 tests.
  7757. 1330.38 s [vector] elemIndex: OK
  7758. 1330.38 s [vector] +++ OK, passed 100 tests.
  7759. 1330.38 s [vector] elemIndices: OK
  7760. 1330.38 s [vector] +++ OK, passed 100 tests.
  7761. 1330.38 s [vector] foldl: OK
  7762. 1330.38 s [vector] +++ OK, passed 100 tests.
  7763. 1330.38 s [vector] foldl1: OK
  7764. 1330.38 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7765. 1330.38 s [vector] foldl': OK
  7766. 1330.38 s [vector] +++ OK, passed 100 tests.
  7767. 1330.38 s [vector] foldl1': OK
  7768. 1330.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7769. 1330.39 s [vector] foldr: OK
  7770. 1330.39 s [vector] +++ OK, passed 100 tests.
  7771. 1330.39 s [vector] foldr1: OK
  7772. 1330.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7773. 1330.39 s [vector] foldr': OK
  7774. 1330.40 s [vector] +++ OK, passed 100 tests.
  7775. 1330.40 s [vector] foldr1': OK
  7776. 1330.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7777. 1330.40 s [vector] ifoldl: OK
  7778. 1330.40 s [vector] +++ OK, passed 100 tests.
  7779. 1330.40 s [vector] ifoldl': OK
  7780. 1330.40 s [vector] +++ OK, passed 100 tests.
  7781. 1330.40 s [vector] ifoldr: OK
  7782. 1330.40 s [vector] +++ OK, passed 100 tests.
  7783. 1330.40 s [vector] ifoldr': OK
  7784. 1330.40 s [vector] +++ OK, passed 100 tests.
  7785. 1330.42 s [vector] ifoldM: OK
  7786. 1330.42 s [vector] +++ OK, passed 100 tests.
  7787. 1330.42 s [vector] ifoldM': OK
  7788. 1330.42 s [vector] +++ OK, passed 100 tests.
  7789. 1330.42 s [vector] ifoldM_: OK (0.01s)
  7790. 1330.42 s [vector] +++ OK, passed 100 tests.
  7791. 1330.44 s [vector] ifoldM'_: OK (0.02s)
  7792. 1330.44 s [vector] +++ OK, passed 100 tests.
  7793. 1330.44 s [vector] all: OK
  7794. 1330.44 s [vector] +++ OK, passed 100 tests.
  7795. 1330.44 s [vector] any: OK
  7796. 1330.44 s [vector] +++ OK, passed 100 tests.
  7797. 1330.44 s [vector] prescanl: OK
  7798. 1330.44 s [vector] +++ OK, passed 100 tests.
  7799. 1330.45 s [vector] prescanl': OK
  7800. 1330.45 s [vector] +++ OK, passed 100 tests.
  7801. 1330.45 s [vector] postscanl: OK
  7802. 1330.45 s [vector] +++ OK, passed 100 tests.
  7803. 1330.45 s [vector] postscanl': OK
  7804. 1330.45 s [vector] +++ OK, passed 100 tests.
  7805. 1330.45 s [vector] scanl: OK
  7806. 1330.45 s [vector] +++ OK, passed 100 tests.
  7807. 1330.45 s [vector] scanl': OK
  7808. 1330.45 s [vector] +++ OK, passed 100 tests.
  7809. 1330.45 s [vector] scanl1: OK
  7810. 1330.45 s [vector] +++ OK, passed 100 tests.
  7811. 1330.46 s [vector] scanl1': OK
  7812. 1330.46 s [vector] +++ OK, passed 100 tests.
  7813. 1330.46 s [vector] iscanl: OK
  7814. 1330.46 s [vector] +++ OK, passed 100 tests.
  7815. 1330.46 s [vector] iscanl': OK
  7816. 1330.46 s [vector] +++ OK, passed 100 tests.
  7817. 1330.46 s [vector] prescanr: OK
  7818. 1330.46 s [vector] +++ OK, passed 100 tests.
  7819. 1330.47 s [vector] prescanr': OK
  7820. 1330.47 s [vector] +++ OK, passed 100 tests.
  7821. 1330.47 s [vector] postscanr: OK
  7822. 1330.47 s [vector] +++ OK, passed 100 tests.
  7823. 1330.47 s [vector] postscanr': OK
  7824. 1330.47 s [vector] +++ OK, passed 100 tests.
  7825. 1330.48 s [vector] scanr: OK
  7826. 1330.48 s [vector] +++ OK, passed 100 tests.
  7827. 1330.48 s [vector] scanr': OK
  7828. 1330.48 s [vector] +++ OK, passed 100 tests.
  7829. 1330.48 s [vector] scanr1: OK
  7830. 1330.48 s [vector] +++ OK, passed 100 tests.
  7831. 1330.48 s [vector] scanr1': OK
  7832. 1330.48 s [vector] +++ OK, passed 100 tests.
  7833. 1330.48 s [vector] iscanr: OK
  7834. 1330.48 s [vector] +++ OK, passed 100 tests.
  7835. 1330.48 s [vector] iscanr': OK
  7836. 1330.48 s [vector] +++ OK, passed 100 tests.
  7837. 1330.48 s [vector] mut_read: OK
  7838. 1330.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7839. 1330.49 s [vector] mut_write: OK
  7840. 1330.49 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7841. 1330.49 s [vector] mut_modify: OK
  7842. 1330.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7843. 1330.49 s [vector] mut_generate: OK
  7844. 1330.49 s [vector] +++ OK, passed 100 tests.
  7845. 1330.50 s [vector] mut_generateM: OK
  7846. 1330.50 s [vector] +++ OK, passed 100 tests.
  7847. 1330.52 s [vector] mut_mapM_: OK (0.01s)
  7848. 1330.52 s [vector] +++ OK, passed 100 tests.
  7849. 1330.52 s [vector] mut_imapM_: OK (0.01s)
  7850. 1330.52 s [vector] +++ OK, passed 100 tests.
  7851. 1330.54 s [vector] mut_forM_: OK (0.01s)
  7852. 1330.54 s [vector] +++ OK, passed 100 tests.
  7853. 1330.54 s [vector] mut_iforM_: OK (0.01s)
  7854. 1330.54 s [vector] +++ OK, passed 100 tests.
  7855. 1330.55 s [vector] mut_foldr: OK
  7856. 1330.55 s [vector] +++ OK, passed 100 tests.
  7857. 1330.55 s [vector] mut_foldr': OK
  7858. 1330.55 s [vector] +++ OK, passed 100 tests.
  7859. 1330.56 s [vector] mut_foldl: OK
  7860. 1330.56 s [vector] +++ OK, passed 100 tests.
  7861. 1330.56 s [vector] mut_foldl': OK
  7862. 1330.56 s [vector] +++ OK, passed 100 tests.
  7863. 1330.56 s [vector] mut_ifoldr: OK
  7864. 1330.56 s [vector] +++ OK, passed 100 tests.
  7865. 1330.56 s [vector] mut_ifoldr': OK
  7866. 1330.57 s [vector] +++ OK, passed 100 tests.
  7867. 1330.57 s [vector] mut_ifoldl: OK
  7868. 1330.57 s [vector] +++ OK, passed 100 tests.
  7869. 1330.57 s [vector] mut_ifoldl': OK
  7870. 1330.57 s [vector] +++ OK, passed 100 tests.
  7871. 1330.57 s [vector] mut_foldM: OK
  7872. 1330.57 s [vector] +++ OK, passed 100 tests.
  7873. 1330.57 s [vector] mut_foldM': OK
  7874. 1330.57 s [vector] +++ OK, passed 100 tests.
  7875. 1330.57 s [vector] mut_foldrM: OK
  7876. 1330.57 s [vector] +++ OK, passed 100 tests.
  7877. 1330.58 s [vector] mut_foldrM': OK
  7878. 1330.58 s [vector] +++ OK, passed 100 tests.
  7879. 1330.58 s [vector] mut_ifoldM: OK
  7880. 1330.58 s [vector] +++ OK, passed 100 tests.
  7881. 1330.58 s [vector] mut_ifoldM': OK
  7882. 1330.58 s [vector] +++ OK, passed 100 tests.
  7883. 1330.58 s [vector] mut_ifoldrM: OK
  7884. 1330.58 s [vector] +++ OK, passed 100 tests.
  7885. 1330.58 s [vector] mut_ifoldrM': OK
  7886. 1330.58 s [vector] +++ OK, passed 100 tests.
  7887. 1330.58 s [vector] compare: OK
  7888. 1330.58 s [vector] +++ OK, passed 100 tests.
  7889. 1330.58 s [vector] maximum: OK
  7890. 1330.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7891. 1330.58 s [vector] minimum: OK
  7892. 1330.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7893. 1330.58 s [vector] minIndex: OK
  7894. 1330.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7895. 1330.58 s [vector] maxIndex: OK
  7896. 1330.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7897. 1330.58 s [vector] maximumBy: OK
  7898. 1330.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7899. 1330.58 s [vector] minimumBy: OK
  7900. 1330.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7901. 1330.58 s [vector] maximumOn: OK
  7902. 1330.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7903. 1330.58 s [vector] minimumOn: OK
  7904. 1330.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7905. 1330.58 s [vector] maxIndexBy: OK
  7906. 1330.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7907. 1330.58 s [vector] minIndexBy: OK
  7908. 1330.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7909. 1330.58 s [vector] ListFirstMaxIndexWins: OK
  7910. 1330.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7911. 1330.58 s [vector] FalseListFirstMaxIndexWins: OK
  7912. 1330.59 s [vector] +++ OK, failed as expected. (after 1 test):
  7913. 1330.59 s [vector] Exception:
  7914. 1330.59 s [vector] Prelude.foldr1: empty list
  7915. 1330.59 s [vector] CallStack (from HasCallStack):
  7916. 1330.59 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  7917. 1330.59 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  7918. 1330.59 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7919. 1330.59 s [vector] []
  7920. 1330.59 s [vector] zip: OK
  7921. 1330.59 s [vector] +++ OK, passed 100 tests.
  7922. 1330.59 s [vector] zip3: OK
  7923. 1330.59 s [vector] +++ OK, passed 100 tests.
  7924. 1330.59 s [vector] unzip: OK
  7925. 1330.59 s [vector] +++ OK, passed 100 tests.
  7926. 1330.59 s [vector] unzip3: OK
  7927. 1330.59 s [vector] +++ OK, passed 100 tests.
  7928. 1330.59 s [vector] indexed: OK
  7929. 1330.60 s [vector] +++ OK, passed 100 tests.
  7930. 1330.60 s [vector] update: OK
  7931. 1330.60 s [vector] +++ OK, passed 100 tests.
  7932. 1330.60 s [vector] concat: OK
  7933. 1330.60 s [vector] +++ OK, passed 100 tests.
  7934. 1330.60 s [vector] mempty: OK
  7935. 1330.60 s [vector] +++ OK, passed 100 tests.
  7936. 1330.61 s [vector] mappend: OK
  7937. 1330.61 s [vector] +++ OK, passed 100 tests.
  7938. 1330.61 s [vector] mconcat: OK
  7939. 1330.61 s [vector] +++ OK, passed 100 tests.
  7940. 1330.61 s [vector] fmap: OK
  7941. 1330.61 s [vector] +++ OK, passed 100 tests.
  7942. 1330.62 s [vector] return: OK
  7943. 1330.62 s [vector] +++ OK, passed 100 tests.
  7944. 1330.63 s [vector] bind: OK (0.01s)
  7945. 1330.63 s [vector] +++ OK, passed 100 tests.
  7946. 1330.63 s [vector] mzip: OK
  7947. 1330.63 s [vector] +++ OK, passed 100 tests.
  7948. 1330.63 s [vector] munzip: OK
  7949. 1330.63 s [vector] +++ OK, passed 100 tests.
  7950. 1330.64 s [vector] applicative_pure: OK
  7951. 1330.64 s [vector] +++ OK, passed 100 tests.
  7952. 1330.64 s [vector] applicative_appl: OK (0.02s)
  7953. 1330.64 s [vector] +++ OK, passed 100 tests.
  7954. 1330.64 s [vector] alternative_empty: OK
  7955. 1330.64 s [vector] +++ OK, passed 100 tests.
  7956. 1330.66 s [vector] alternative_or: OK
  7957. 1330.66 s [vector] +++ OK, passed 100 tests.
  7958. 1330.68 s [vector] sequence: OK (0.03s)
  7959. 1330.68 s [vector] +++ OK, passed 100 tests.
  7960. 1330.69 s [vector] sequence_: OK (0.01s)
  7961. 1330.69 s [vector] +++ OK, passed 100 tests.
  7962. 1330.69 s [vector] glength: OK
  7963. 1330.69 s [vector] +++ OK, passed 100 tests.
  7964. 1330.69 s [vector] and: OK
  7965. 1330.69 s [vector] +++ OK, passed 100 tests.
  7966. 1330.69 s [vector] or: OK
  7967. 1330.69 s [vector] +++ OK, passed 100 tests.
  7968. 1330.69 s [vector] Int
  7969. 1330.69 s [vector] fromList.toList == id: OK
  7970. 1330.69 s [vector] +++ OK, passed 100 tests.
  7971. 1330.69 s [vector] toList.fromList == id: OK
  7972. 1330.69 s [vector] +++ OK, passed 100 tests.
  7973. 1330.69 s [vector] unstream.stream == id: OK
  7974. 1330.70 s [vector] +++ OK, passed 100 tests.
  7975. 1330.70 s [vector] stream.unstream == id: OK
  7976. 1330.70 s [vector] +++ OK, passed 100 tests.
  7977. 1330.70 s [vector] eq: OK
  7978. 1330.70 s [vector] +++ OK, passed 100 tests.
  7979. 1330.70 s [vector] length: OK
  7980. 1330.70 s [vector] +++ OK, passed 100 tests.
  7981. 1330.70 s [vector] null: OK
  7982. 1330.70 s [vector] +++ OK, passed 100 tests.
  7983. 1330.70 s [vector] index: OK
  7984. 1330.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7985. 1330.70 s [vector] safeIndex: OK
  7986. 1330.70 s [vector] +++ OK, passed 100 tests.
  7987. 1330.70 s [vector] head: OK
  7988. 1330.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7989. 1330.70 s [vector] last: OK
  7990. 1330.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7991. 1330.70 s [vector] unsafeIndex: OK
  7992. 1330.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7993. 1330.70 s [vector] unsafeHead: OK
  7994. 1330.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7995. 1330.70 s [vector] unsafeLast: OK
  7996. 1330.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7997. 1330.70 s [vector] slice: OK
  7998. 1330.70 s [vector] +++ OK, passed 100 tests.
  7999. 1330.70 s [vector] init: OK
  8000. 1330.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8001. 1330.70 s [vector] tail: OK
  8002. 1330.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8003. 1330.70 s [vector] take: OK
  8004. 1330.70 s [vector] +++ OK, passed 100 tests.
  8005. 1330.70 s [vector] drop: OK
  8006. 1330.70 s [vector] +++ OK, passed 100 tests.
  8007. 1330.70 s [vector] splitAt: OK
  8008. 1330.70 s [vector] +++ OK, passed 100 tests.
  8009. 1330.70 s [vector] empty: OK
  8010. 1330.70 s [vector] +++ OK, passed 100 tests.
  8011. 1330.71 s [vector] singleton: OK
  8012. 1330.71 s [vector] +++ OK, passed 100 tests.
  8013. 1330.71 s [vector] replicate: OK
  8014. 1330.71 s [vector] +++ OK, passed 100 tests.
  8015. 1330.71 s [vector] generate: OK
  8016. 1330.71 s [vector] +++ OK, passed 100 tests.
  8017. 1330.72 s [vector] iterateN: OK
  8018. 1330.72 s [vector] +++ OK, passed 100 tests.
  8019. 1330.74 s [vector] iterateNM: OK (0.03s)
  8020. 1330.74 s [vector] +++ OK, passed 100 tests.
  8021. 1330.75 s [vector] generateM: OK (0.01s)
  8022. 1330.75 s [vector] +++ OK, passed 100 tests.
  8023. 1330.76 s [vector] replicateM: OK
  8024. 1330.76 s [vector] +++ OK, passed 100 tests.
  8025. 1330.77 s [vector] create: OK
  8026. 1330.77 s [vector] +++ OK, passed 100 tests.
  8027. 1330.77 s [vector] createT: OK
  8028. 1330.77 s [vector] +++ OK, passed 100 tests.
  8029. 1330.77 s [vector] unfoldr: OK
  8030. 1330.77 s [vector] +++ OK, passed 100 tests.
  8031. 1330.77 s [vector] unfoldrN: OK
  8032. 1330.77 s [vector] +++ OK, passed 100 tests.
  8033. 1330.77 s [vector] unfoldrExactN: OK
  8034. 1330.78 s [vector] +++ OK, passed 100 tests.
  8035. 1330.78 s [vector] unfoldrM: OK
  8036. 1330.78 s [vector] +++ OK, passed 100 tests.
  8037. 1330.78 s [vector] unfoldrNM: OK
  8038. 1330.78 s [vector] +++ OK, passed 100 tests.
  8039. 1330.81 s [vector] unfoldrExactNM: OK (0.02s)
  8040. 1330.81 s [vector] +++ OK, passed 100 tests.
  8041. 1330.81 s [vector] constructN: OK
  8042. 1330.81 s [vector] +++ OK, passed 100 tests.
  8043. 1330.81 s [vector] constructrN: OK
  8044. 1330.81 s [vector] +++ OK, passed 100 tests.
  8045. 1330.81 s [vector] cons: OK
  8046. 1330.81 s [vector] +++ OK, passed 100 tests.
  8047. 1330.81 s [vector] snoc: OK
  8048. 1330.81 s [vector] +++ OK, passed 100 tests.
  8049. 1330.82 s [vector] append: OK
  8050. 1330.82 s [vector] +++ OK, passed 100 tests.
  8051. 1330.82 s [vector] concat: OK (0.01s)
  8052. 1330.82 s [vector] +++ OK, passed 100 tests.
  8053. 1330.83 s [vector] force: OK
  8054. 1330.83 s [vector] +++ OK, passed 100 tests.
  8055. 1330.83 s [vector] upd: OK
  8056. 1330.83 s [vector] +++ OK, passed 100 tests.
  8057. 1330.83 s [vector] accum: OK
  8058. 1330.83 s [vector] +++ OK, passed 100 tests.
  8059. 1330.83 s [vector] reverse: OK
  8060. 1330.83 s [vector] +++ OK, passed 100 tests.
  8061. 1330.83 s [vector] backpermute: OK
  8062. 1330.83 s [vector] +++ OK, passed 100 tests.
  8063. 1330.83 s [vector] map: OK
  8064. 1330.84 s [vector] +++ OK, passed 100 tests.
  8065. 1330.84 s [vector] imap: OK
  8066. 1330.84 s [vector] +++ OK, passed 100 tests.
  8067. 1330.84 s [vector] concatMap: OK
  8068. 1330.84 s [vector] +++ OK, passed 100 tests.
  8069. 1330.86 s [vector] mapM: OK
  8070. 1330.86 s [vector] +++ OK, passed 100 tests.
  8071. 1330.86 s [vector] mapM_: OK (0.02s)
  8072. 1330.88 s [vector] +++ OK, passed 100 tests.
  8073. 1330.88 s [vector] forM: OK
  8074. 1330.88 s [vector] +++ OK, passed 100 tests.
  8075. 1330.89 s [vector] forM_: OK (0.02s)
  8076. 1330.89 s [vector] +++ OK, passed 100 tests.
  8077. 1330.90 s [vector] imapM: OK
  8078. 1330.90 s [vector] +++ OK, passed 100 tests.
  8079. 1330.91 s [vector] imapM_: OK (0.02s)
  8080. 1330.91 s [vector] +++ OK, passed 100 tests.
  8081. 1330.92 s [vector] zipWith: OK
  8082. 1330.92 s [vector] +++ OK, passed 100 tests.
  8083. 1330.92 s [vector] zipWith3: OK
  8084. 1330.92 s [vector] +++ OK, passed 100 tests.
  8085. 1330.94 s [vector] izipWith: OK
  8086. 1330.94 s [vector] +++ OK, passed 100 tests.
  8087. 1330.94 s [vector] izipWith3: OK
  8088. 1330.94 s [vector] +++ OK, passed 100 tests.
  8089. 1330.94 s [vector] izipWithM: OK
  8090. 1330.94 s [vector] +++ OK, passed 100 tests.
  8091. 1330.94 s [vector] izipWithM_: OK (0.01s)
  8092. 1330.94 s [vector] +++ OK, passed 100 tests.
  8093. 1330.94 s [vector] zipWithM: OK
  8094. 1330.94 s [vector] +++ OK, passed 100 tests.
  8095. 1330.95 s [haskell-language-server]
  8096. 1330.95 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8097. 1330.95 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8098. 1330.95 s [haskell-language-server] but were not needed for compilation:
  8099. 1330.95 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-1EAx84SHd9w21rrxc8Gon6)
  8100. 1330.95 s [haskell-language-server] - transformers-0.6.1.0 (exposed by flag -package-id transformers-0.6.1.0)
  8101. 1330.95 s [vector] zipWithM_: OK (0.01s)
  8102. 1330.95 s [vector] +++ OK, passed 100 tests.
  8103. 1330.96 s [vector] filter: OK
  8104. 1330.96 s [vector] +++ OK, passed 100 tests.
  8105. 1330.96 s [vector] ifilter: OK
  8106. 1330.96 s [vector] +++ OK, passed 100 tests.
  8107. 1330.97 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Pragmas ( plugins/hls-pragmas-plugin/src/Ide/Plugin/Pragmas.hs, dist/build/hls-pragmas-plugin/Ide/Plugin/Pragmas.p_o )
  8108. 1330.99 s [vector] filterM: OK (0.03s)
  8109. 1330.99 s [vector] +++ OK, passed 100 tests.
  8110. 1330.99 s [vector] uniq: OK
  8111. 1330.99 s [vector] +++ OK, passed 100 tests.
  8112. 1330.99 s [vector] mapMaybe: OK
  8113. 1330.99 s [vector] +++ OK, passed 100 tests.
  8114. 1330.99 s [vector] imapMaybe: OK
  8115. 1330.99 s [vector] +++ OK, passed 100 tests.
  8116. 1330.99 s [vector] takeWhile: OK
  8117. 1330.99 s [vector] +++ OK, passed 100 tests.
  8118. 1331.00 s [vector] dropWhile: OK
  8119. 1331.00 s [vector] +++ OK, passed 100 tests.
  8120. 1331.00 s [vector] partition: OK
  8121. 1331.00 s [vector] +++ OK, passed 100 tests.
  8122. 1331.00 s [vector] partitionWith: OK
  8123. 1331.00 s [vector] +++ OK, passed 100 tests.
  8124. 1331.00 s [vector] span: OK
  8125. 1331.00 s [vector] +++ OK, passed 100 tests.
  8126. 1331.00 s [vector] break: OK
  8127. 1331.00 s [vector] +++ OK, passed 100 tests.
  8128. 1331.00 s [vector] spanR: OK
  8129. 1331.00 s [vector] +++ OK, passed 100 tests.
  8130. 1331.00 s [vector] breakR: OK
  8131. 1331.00 s [vector] +++ OK, passed 100 tests.
  8132. 1331.00 s [vector] groupBy: OK
  8133. 1331.00 s [vector] +++ OK, passed 100 tests.
  8134. 1331.00 s [vector] elem: OK
  8135. 1331.00 s [vector] +++ OK, passed 100 tests.
  8136. 1331.00 s [vector] notElem: OK
  8137. 1331.00 s [vector] +++ OK, passed 100 tests.
  8138. 1331.00 s [vector] find: OK
  8139. 1331.01 s [vector] +++ OK, passed 100 tests.
  8140. 1331.01 s [vector] findIndex: OK
  8141. 1331.01 s [vector] +++ OK, passed 100 tests.
  8142. 1331.01 s [vector] findIndexR: OK
  8143. 1331.01 s [vector] +++ OK, passed 100 tests.
  8144. 1331.01 s [vector] findIndices: OK
  8145. 1331.01 s [vector] +++ OK, passed 100 tests.
  8146. 1331.01 s [vector] elemIndex: OK
  8147. 1331.01 s [vector] +++ OK, passed 100 tests.
  8148. 1331.01 s [vector] elemIndices: OK
  8149. 1331.01 s [vector] +++ OK, passed 100 tests.
  8150. 1331.01 s [vector] foldl: OK
  8151. 1331.01 s [vector] +++ OK, passed 100 tests.
  8152. 1331.02 s [vector] foldl1: OK
  8153. 1331.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8154. 1331.02 s [vector] foldl': OK
  8155. 1331.02 s [vector] +++ OK, passed 100 tests.
  8156. 1331.02 s [vector] foldl1': OK
  8157. 1331.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8158. 1331.02 s [vector] foldr: OK
  8159. 1331.02 s [vector] +++ OK, passed 100 tests.
  8160. 1331.02 s [vector] foldr1: OK
  8161. 1331.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8162. 1331.03 s [vector] foldr': OK
  8163. 1331.03 s [vector] +++ OK, passed 100 tests.
  8164. 1331.03 s [vector] foldr1': OK
  8165. 1331.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8166. 1331.04 s [vector] ifoldl: OK
  8167. 1331.04 s [vector] +++ OK, passed 100 tests.
  8168. 1331.04 s [vector] ifoldl': OK
  8169. 1331.04 s [vector] +++ OK, passed 100 tests.
  8170. 1331.04 s [vector] ifoldr: OK
  8171. 1331.04 s [vector] +++ OK, passed 100 tests.
  8172. 1331.05 s [vector] ifoldr': OK
  8173. 1331.05 s [vector] +++ OK, passed 100 tests.
  8174. 1331.05 s [vector] ifoldM: OK
  8175. 1331.05 s [vector] +++ OK, passed 100 tests.
  8176. 1331.06 s [vector] ifoldM': OK
  8177. 1331.06 s [vector] +++ OK, passed 100 tests.
  8178. 1331.07 s [vector] ifoldM_: OK (0.02s)
  8179. 1331.07 s [vector] +++ OK, passed 100 tests.
  8180. 1331.09 s [vector] ifoldM'_: OK
  8181. 1331.09 s [vector] +++ OK, passed 100 tests.
  8182. 1331.09 s [vector] all: OK
  8183. 1331.09 s [vector] +++ OK, passed 100 tests.
  8184. 1331.09 s [vector] any: OK
  8185. 1331.09 s [vector] +++ OK, passed 100 tests.
  8186. 1331.09 s [vector] prescanl: OK
  8187. 1331.09 s [vector] +++ OK, passed 100 tests.
  8188. 1331.09 s [vector] prescanl': OK
  8189. 1331.10 s [vector] +++ OK, passed 100 tests.
  8190. 1331.10 s [vector] postscanl: OK
  8191. 1331.10 s [vector] +++ OK, passed 100 tests.
  8192. 1331.10 s [vector] postscanl': OK
  8193. 1331.10 s [vector] +++ OK, passed 100 tests.
  8194. 1331.11 s [vector] scanl: OK
  8195. 1331.11 s [vector] +++ OK, passed 100 tests.
  8196. 1331.11 s [vector] scanl': OK
  8197. 1331.11 s [vector] +++ OK, passed 100 tests.
  8198. 1331.11 s [vector] scanl1: OK
  8199. 1331.11 s [vector] +++ OK, passed 100 tests.
  8200. 1331.12 s [vector] scanl1': OK
  8201. 1331.12 s [vector] +++ OK, passed 100 tests.
  8202. 1331.12 s [vector] iscanl: OK
  8203. 1331.12 s [vector] +++ OK, passed 100 tests.
  8204. 1331.12 s [vector] iscanl': OK
  8205. 1331.12 s [vector] +++ OK, passed 100 tests.
  8206. 1331.12 s [vector] prescanr: OK
  8207. 1331.12 s [vector] +++ OK, passed 100 tests.
  8208. 1331.13 s [vector] prescanr': OK
  8209. 1331.13 s [vector] +++ OK, passed 100 tests.
  8210. 1331.13 s [vector] postscanr: OK
  8211. 1331.13 s [vector] +++ OK, passed 100 tests.
  8212. 1331.13 s [vector] postscanr': OK
  8213. 1331.13 s [vector] +++ OK, passed 100 tests.
  8214. 1331.14 s [vector] scanr: OK
  8215. 1331.14 s [vector] +++ OK, passed 100 tests.
  8216. 1331.14 s [vector] scanr': OK
  8217. 1331.14 s [vector] +++ OK, passed 100 tests.
  8218. 1331.14 s [vector] scanr1: OK
  8219. 1331.14 s [vector] +++ OK, passed 100 tests.
  8220. 1331.15 s [vector] scanr1': OK
  8221. 1331.15 s [vector] +++ OK, passed 100 tests.
  8222. 1331.15 s [vector] iscanr: OK
  8223. 1331.15 s [vector] +++ OK, passed 100 tests.
  8224. 1331.15 s [vector] iscanr': OK
  8225. 1331.15 s [vector] +++ OK, passed 100 tests.
  8226. 1331.15 s [vector] mut_read: OK
  8227. 1331.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8228. 1331.15 s [vector] mut_write: OK
  8229. 1331.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8230. 1331.15 s [vector] mut_modify: OK
  8231. 1331.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8232. 1331.16 s [vector] mut_generate: OK
  8233. 1331.16 s [vector] +++ OK, passed 100 tests.
  8234. 1331.16 s [vector] mut_generateM: OK
  8235. 1331.16 s [vector] +++ OK, passed 100 tests.
  8236. 1331.20 s [vector] mut_mapM_: OK
  8237. 1331.20 s [vector] +++ OK, passed 100 tests.
  8238. 1331.22 s [vector] mut_imapM_: OK (0.02s)
  8239. 1331.22 s [vector] +++ OK, passed 100 tests.
  8240. 1331.22 s [vector] mut_forM_: OK (0.02s)
  8241. 1331.22 s [vector] +++ OK, passed 100 tests.
  8242. 1331.24 s [vector] mut_iforM_: OK (0.02s)
  8243. 1331.24 s [vector] +++ OK, passed 100 tests.
  8244. 1331.24 s [vector] mut_foldr: OK
  8245. 1331.25 s [vector] +++ OK, passed 100 tests.
  8246. 1331.25 s [vector] mut_foldr': OK
  8247. 1331.26 s [vector] +++ OK, passed 100 tests.
  8248. 1331.26 s [vector] mut_foldl: OK
  8249. 1331.26 s [vector] +++ OK, passed 100 tests.
  8250. 1331.27 s [vector] mut_foldl': OK
  8251. 1331.27 s [vector] +++ OK, passed 100 tests.
  8252. 1331.28 s [vector] mut_ifoldr: OK
  8253. 1331.28 s [vector] +++ OK, passed 100 tests.
  8254. 1331.28 s [vector] mut_ifoldr': OK
  8255. 1331.29 s [vector] +++ OK, passed 100 tests.
  8256. 1331.29 s [vector] mut_ifoldl: OK
  8257. 1331.29 s [vector] +++ OK, passed 100 tests.
  8258. 1331.29 s [vector] mut_ifoldl': OK
  8259. 1331.29 s [vector] +++ OK, passed 100 tests.
  8260. 1331.29 s [vector] mut_foldM: OK
  8261. 1331.30 s [vector] +++ OK, passed 100 tests.
  8262. 1331.30 s [vector] mut_foldM': OK
  8263. 1331.30 s [vector] +++ OK, passed 100 tests.
  8264. 1331.30 s [vector] mut_foldrM: OK
  8265. 1331.30 s [vector] +++ OK, passed 100 tests.
  8266. 1331.30 s [vector] mut_foldrM': OK
  8267. 1331.30 s [vector] +++ OK, passed 100 tests.
  8268. 1331.30 s [vector] mut_ifoldM: OK
  8269. 1331.30 s [vector] +++ OK, passed 100 tests.
  8270. 1331.30 s [vector] mut_ifoldM': OK
  8271. 1331.30 s [vector] +++ OK, passed 100 tests.
  8272. 1331.30 s [vector] mut_ifoldrM: OK
  8273. 1331.30 s [vector] +++ OK, passed 100 tests.
  8274. 1331.30 s [vector] mut_ifoldrM': OK
  8275. 1331.30 s [vector] +++ OK, passed 100 tests.
  8276. 1331.30 s [vector] compare: OK
  8277. 1331.30 s [vector] +++ OK, passed 100 tests.
  8278. 1331.30 s [vector] maximum: OK
  8279. 1331.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8280. 1331.30 s [vector] minimum: OK
  8281. 1331.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8282. 1331.31 s [vector] minIndex: OK
  8283. 1331.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8284. 1331.31 s [vector] maxIndex: OK
  8285. 1331.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8286. 1331.31 s [vector] maximumBy: OK
  8287. 1331.31 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8288. 1331.31 s [vector] minimumBy: OK
  8289. 1331.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8290. 1331.31 s [vector] maximumOn: OK
  8291. 1331.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8292. 1331.31 s [vector] minimumOn: OK
  8293. 1331.32 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8294. 1331.32 s [vector] maxIndexBy: OK
  8295. 1331.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8296. 1331.33 s [vector] minIndexBy: OK
  8297. 1331.33 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8298. 1331.33 s [vector] ListFirstMaxIndexWins: OK
  8299. 1331.33 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8300. 1331.33 s [vector] FalseListFirstMaxIndexWins: OK
  8301. 1331.33 s [vector] +++ OK, failed as expected. (after 1 test):
  8302. 1331.33 s [vector] Exception:
  8303. 1331.33 s [vector] Prelude.foldr1: empty list
  8304. 1331.34 s [vector] CallStack (from HasCallStack):
  8305. 1331.34 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8306. 1331.34 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8307. 1331.34 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8308. 1331.34 s [vector] []
  8309. 1331.34 s [vector] zip: OK
  8310. 1331.34 s [vector] +++ OK, passed 100 tests.
  8311. 1331.34 s [vector] zip3: OK
  8312. 1331.34 s [vector] +++ OK, passed 100 tests.
  8313. 1331.34 s [vector] unzip: OK
  8314. 1331.34 s [vector] +++ OK, passed 100 tests.
  8315. 1331.34 s [vector] unzip3: OK
  8316. 1331.34 s [vector] +++ OK, passed 100 tests.
  8317. 1331.34 s [vector] indexed: OK
  8318. 1331.34 s [vector] +++ OK, passed 100 tests.
  8319. 1331.34 s [vector] update: OK
  8320. 1331.34 s [vector] +++ OK, passed 100 tests.
  8321. 1331.35 s [vector] concat: OK (0.01s)
  8322. 1331.35 s [vector] +++ OK, passed 100 tests.
  8323. 1331.35 s [vector] mempty: OK
  8324. 1331.35 s [vector] +++ OK, passed 100 tests.
  8325. 1331.35 s [vector] mappend: OK
  8326. 1331.35 s [vector] +++ OK, passed 100 tests.
  8327. 1331.35 s [vector] mconcat: OK (0.01s)
  8328. 1331.35 s [vector] +++ OK, passed 100 tests.
  8329. 1331.35 s [vector] fmap: OK
  8330. 1331.35 s [vector] +++ OK, passed 100 tests.
  8331. 1331.35 s [vector] return: OK
  8332. 1331.35 s [vector] +++ OK, passed 100 tests.
  8333. 1331.36 s [vector] bind: OK (0.02s)
  8334. 1331.36 s [vector] +++ OK, passed 100 tests.
  8335. 1331.36 s [vector] mzip: OK
  8336. 1331.36 s [vector] +++ OK, passed 100 tests.
  8337. 1331.36 s [vector] munzip: OK
  8338. 1331.36 s [vector] +++ OK, passed 100 tests.
  8339. 1331.36 s [vector] applicative_pure: OK
  8340. 1331.36 s [vector] +++ OK, passed 100 tests.
  8341. 1331.40 s [vector] applicative_appl: OK (0.04s)
  8342. 1331.40 s [vector] +++ OK, passed 100 tests.
  8343. 1331.40 s [vector] alternative_empty: OK
  8344. 1331.40 s [vector] +++ OK, passed 100 tests.
  8345. 1331.40 s [vector] alternative_or: OK
  8346. 1331.42 s [vector] +++ OK, passed 100 tests.
  8347. 1331.44 s [vector] sequence: OK (0.03s)
  8348. 1331.44 s [vector] +++ OK, passed 100 tests.
  8349. 1331.46 s [vector] sequence_: OK (0.02s)
  8350. 1331.46 s [vector] +++ OK, passed 100 tests.
  8351. 1331.46 s [vector] glength: OK
  8352. 1331.46 s [vector] +++ OK, passed 100 tests.
  8353. 1331.46 s [vector] sum: OK
  8354. 1331.46 s [vector] +++ OK, passed 100 tests.
  8355. 1331.46 s [vector] product: OK
  8356. 1331.46 s [vector] +++ OK, passed 100 tests.
  8357. 1331.46 s [vector] enumFromN: OK
  8358. 1331.46 s [vector] +++ OK, passed 100 tests.
  8359. 1331.46 s [vector] enumFromThenN: OK
  8360. 1331.46 s [vector] +++ OK, passed 100 tests.
  8361. 1331.46 s [vector] enumFromTo: OK
  8362. 1331.46 s [vector] +++ OK, passed 100 tests.
  8363. 1331.46 s [vector] enumFromThenTo: OK
  8364. 1331.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8365. 1331.46 s [vector] unstream
  8366. 1331.46 s [vector] unstream == vunstream (exact): OK
  8367. 1331.46 s [vector] +++ OK, passed 100 tests.
  8368. 1331.46 s [vector] unstream == vunstream (unknown): OK
  8369. 1331.46 s [vector] +++ OK, passed 100 tests.
  8370. 1331.46 s [vector] unstreamR ~= vunstream (exact): OK
  8371. 1331.46 s [vector] +++ OK, passed 100 tests.
  8372. 1331.47 s [vector] unstreamR ~= vunstream (unknown): OK
  8373. 1331.47 s [vector] +++ OK, passed 100 tests.
  8374. 1331.47 s [vector] Tests.Vector.Unboxed
  8375. 1331.47 s [vector] ()
  8376. 1331.47 s [vector] fromList.toList == id: OK
  8377. 1331.47 s [vector] +++ OK, passed 100 tests.
  8378. 1331.47 s [vector] toList.fromList == id: OK
  8379. 1331.47 s [vector] +++ OK, passed 100 tests.
  8380. 1331.47 s [vector] unstream.stream == id: OK
  8381. 1331.47 s [vector] +++ OK, passed 100 tests.
  8382. 1331.47 s [vector] stream.unstream == id: OK
  8383. 1331.47 s [vector] +++ OK, passed 100 tests.
  8384. 1331.47 s [vector] eq: OK
  8385. 1331.47 s [vector] +++ OK, passed 100 tests.
  8386. 1331.47 s [vector] length: OK
  8387. 1331.47 s [vector] +++ OK, passed 100 tests.
  8388. 1331.47 s [vector] null: OK
  8389. 1331.47 s [vector] +++ OK, passed 100 tests.
  8390. 1331.47 s [vector] index: OK
  8391. 1331.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8392. 1331.47 s [vector] safeIndex: OK
  8393. 1331.47 s [vector] +++ OK, passed 100 tests.
  8394. 1331.47 s [vector] head: OK
  8395. 1331.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8396. 1331.47 s [vector] last: OK
  8397. 1331.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8398. 1331.47 s [vector] unsafeIndex: OK
  8399. 1331.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8400. 1331.47 s [vector] unsafeHead: OK
  8401. 1331.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8402. 1331.47 s [vector] unsafeLast: OK
  8403. 1331.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8404. 1331.47 s [vector] slice: OK
  8405. 1331.47 s [vector] +++ OK, passed 100 tests.
  8406. 1331.47 s [vector] init: OK
  8407. 1331.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8408. 1331.47 s [vector] tail: OK
  8409. 1331.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8410. 1331.47 s [vector] take: OK
  8411. 1331.47 s [vector] +++ OK, passed 100 tests.
  8412. 1331.47 s [vector] drop: OK
  8413. 1331.48 s [vector] +++ OK, passed 100 tests.
  8414. 1331.48 s [vector] splitAt: OK
  8415. 1331.48 s [vector] +++ OK, passed 100 tests.
  8416. 1331.48 s [vector] empty: OK
  8417. 1331.48 s [vector] +++ OK, passed 100 tests.
  8418. 1331.48 s [vector] singleton: OK
  8419. 1331.48 s [vector] +++ OK, passed 100 tests.
  8420. 1331.48 s [vector] replicate: OK
  8421. 1331.48 s [vector] +++ OK, passed 100 tests.
  8422. 1331.48 s [vector] generate: OK
  8423. 1331.48 s [vector] +++ OK, passed 100 tests.
  8424. 1331.48 s [vector] iterateN: OK
  8425. 1331.48 s [vector] +++ OK, passed 100 tests.
  8426. 1331.54 s [vector] iterateNM: OK (0.06s)
  8427. 1331.54 s [vector] +++ OK, passed 100 tests.
  8428. 1331.56 s [vector] generateM: OK (0.02s)
  8429. 1331.56 s [vector] +++ OK, passed 100 tests.
  8430. 1331.56 s [vector] replicateM: OK
  8431. 1331.56 s [vector] +++ OK, passed 100 tests.
  8432. 1331.56 s [vector] create: OK
  8433. 1331.56 s [vector] +++ OK, passed 100 tests.
  8434. 1331.56 s [vector] createT: OK
  8435. 1331.56 s [vector] +++ OK, passed 100 tests.
  8436. 1331.56 s [vector] unfoldr: OK
  8437. 1331.56 s [vector] +++ OK, passed 100 tests.
  8438. 1331.56 s [vector] unfoldrN: OK
  8439. 1331.56 s [vector] +++ OK, passed 100 tests.
  8440. 1331.56 s [vector] unfoldrExactN: OK
  8441. 1331.57 s [vector] +++ OK, passed 100 tests.
  8442. 1331.57 s [vector] unfoldrM: OK
  8443. 1331.58 s [vector] +++ OK, passed 100 tests.
  8444. 1331.58 s [vector] unfoldrNM: OK
  8445. 1331.58 s [vector] +++ OK, passed 100 tests.
  8446. 1331.60 s [vector] unfoldrExactNM: OK (0.03s)
  8447. 1331.60 s [vector] +++ OK, passed 100 tests.
  8448. 1331.60 s [vector] constructN: OK
  8449. 1331.60 s [vector] +++ OK, passed 100 tests.
  8450. 1331.60 s [vector] constructrN: OK
  8451. 1331.60 s [vector] +++ OK, passed 100 tests.
  8452. 1331.60 s [vector] cons: OK
  8453. 1331.60 s [vector] +++ OK, passed 100 tests.
  8454. 1331.60 s [vector] snoc: OK
  8455. 1331.61 s [vector] +++ OK, passed 100 tests.
  8456. 1331.61 s [vector] append: OK
  8457. 1331.61 s [vector] +++ OK, passed 100 tests.
  8458. 1331.61 s [vector] concat: OK
  8459. 1331.61 s [vector] +++ OK, passed 100 tests.
  8460. 1331.61 s [vector] force: OK
  8461. 1331.61 s [vector] +++ OK, passed 100 tests.
  8462. 1331.61 s [vector] upd: OK
  8463. 1331.62 s [vector] +++ OK, passed 100 tests.
  8464. 1331.62 s [vector] accum: OK
  8465. 1331.62 s [vector] +++ OK, passed 100 tests.
  8466. 1331.62 s [vector] reverse: OK
  8467. 1331.62 s [vector] +++ OK, passed 100 tests.
  8468. 1331.62 s [vector] backpermute: OK
  8469. 1331.62 s [vector] +++ OK, passed 100 tests.
  8470. 1331.62 s [vector] map: OK
  8471. 1331.62 s [vector] +++ OK, passed 100 tests.
  8472. 1331.62 s [vector] imap: OK
  8473. 1331.62 s [vector] +++ OK, passed 100 tests.
  8474. 1331.62 s [vector] concatMap: OK
  8475. 1331.62 s [vector] +++ OK, passed 100 tests.
  8476. 1331.62 s [vector] mapM: OK
  8477. 1331.63 s [vector] +++ OK, passed 100 tests.
  8478. 1331.64 s [vector] mapM_: OK
  8479. 1331.64 s [vector] +++ OK, passed 100 tests.
  8480. 1331.64 s [vector] forM: OK
  8481. 1331.64 s [vector] +++ OK, passed 100 tests.
  8482. 1331.65 s [vector] forM_: OK (0.01s)
  8483. 1331.66 s [vector] +++ OK, passed 100 tests.
  8484. 1331.66 s [vector] imapM: OK
  8485. 1331.66 s [vector] +++ OK, passed 100 tests.
  8486. 1331.66 s [vector] imapM_: OK (0.01s)
  8487. 1331.66 s [vector] +++ OK, passed 100 tests.
  8488. 1331.66 s [vector] zipWith: OK
  8489. 1331.66 s [vector] +++ OK, passed 100 tests.
  8490. 1331.66 s [vector] zipWith3: OK
  8491. 1331.66 s [vector] +++ OK, passed 100 tests.
  8492. 1331.66 s [vector] izipWith: OK
  8493. 1331.66 s [vector] +++ OK, passed 100 tests.
  8494. 1331.67 s [vector] izipWith3: OK
  8495. 1331.67 s [vector] +++ OK, passed 100 tests.
  8496. 1331.67 s [vector] izipWithM: OK
  8497. 1331.67 s [vector] +++ OK, passed 100 tests.
  8498. 1331.67 s [vector] izipWithM_: OK
  8499. 1331.67 s [vector] +++ OK, passed 100 tests.
  8500. 1331.68 s [vector] zipWithM: OK
  8501. 1331.68 s [vector] +++ OK, passed 100 tests.
  8502. 1331.68 s [vector] zipWithM_: OK
  8503. 1331.69 s [vector] +++ OK, passed 100 tests.
  8504. 1331.69 s [vector] filter: OK
  8505. 1331.69 s [vector] +++ OK, passed 100 tests.
  8506. 1331.70 s [vector] ifilter: OK
  8507. 1331.70 s [vector] +++ OK, passed 100 tests.
  8508. 1331.70 s [vector] filterM: OK (0.01s)
  8509. 1331.70 s [vector] +++ OK, passed 100 tests.
  8510. 1331.70 s [vector] uniq: OK
  8511. 1331.70 s [vector] +++ OK, passed 100 tests.
  8512. 1331.70 s [vector] mapMaybe: OK
  8513. 1331.71 s [vector] +++ OK, passed 100 tests.
  8514. 1331.71 s [vector] imapMaybe: OK
  8515. 1331.71 s [vector] +++ OK, passed 100 tests.
  8516. 1331.71 s [vector] takeWhile: OK
  8517. 1331.71 s [vector] +++ OK, passed 100 tests.
  8518. 1331.71 s [vector] dropWhile: OK
  8519. 1331.71 s [vector] +++ OK, passed 100 tests.
  8520. 1331.71 s [vector] partition: OK
  8521. 1331.71 s [vector] +++ OK, passed 100 tests.
  8522. 1331.71 s [vector] partitionWith: OK
  8523. 1331.71 s [vector] +++ OK, passed 100 tests.
  8524. 1331.71 s [vector] span: OK
  8525. 1331.71 s [vector] +++ OK, passed 100 tests.
  8526. 1331.71 s [vector] break: OK
  8527. 1331.71 s [vector] +++ OK, passed 100 tests.
  8528. 1331.72 s [vector] spanR: OK
  8529. 1331.72 s [vector] +++ OK, passed 100 tests.
  8530. 1331.72 s [vector] breakR: OK
  8531. 1331.72 s [vector] +++ OK, passed 100 tests.
  8532. 1331.72 s [vector] groupBy: OK
  8533. 1331.72 s [vector] +++ OK, passed 100 tests.
  8534. 1331.72 s [vector] elem: OK
  8535. 1331.72 s [vector] +++ OK, passed 100 tests.
  8536. 1331.72 s [vector] notElem: OK
  8537. 1331.72 s [vector] +++ OK, passed 100 tests.
  8538. 1331.72 s [vector] find: OK
  8539. 1331.72 s [vector] +++ OK, passed 100 tests.
  8540. 1331.72 s [vector] findIndex: OK
  8541. 1331.72 s [vector] +++ OK, passed 100 tests.
  8542. 1331.72 s [vector] findIndexR: OK
  8543. 1331.72 s [vector] +++ OK, passed 100 tests.
  8544. 1331.72 s [vector] findIndices: OK
  8545. 1331.72 s [vector] +++ OK, passed 100 tests.
  8546. 1331.73 s [vector] elemIndex: OK
  8547. 1331.73 s [vector] +++ OK, passed 100 tests.
  8548. 1331.73 s [vector] elemIndices: OK
  8549. 1331.73 s [vector] +++ OK, passed 100 tests.
  8550. 1331.73 s [vector] foldl: OK
  8551. 1331.73 s [vector] +++ OK, passed 100 tests.
  8552. 1331.73 s [vector] foldl1: OK
  8553. 1331.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8554. 1331.73 s [vector] foldl': OK
  8555. 1331.73 s [vector] +++ OK, passed 100 tests.
  8556. 1331.73 s [vector] foldl1': OK
  8557. 1331.73 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8558. 1331.73 s [vector] foldr: OK
  8559. 1331.73 s [vector] +++ OK, passed 100 tests.
  8560. 1331.73 s [vector] foldr1: OK
  8561. 1331.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8562. 1331.73 s [vector] foldr': OK
  8563. 1331.73 s [vector] +++ OK, passed 100 tests.
  8564. 1331.73 s [vector] foldr1': OK
  8565. 1331.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8566. 1331.74 s [vector] ifoldl: OK
  8567. 1331.74 s [vector] +++ OK, passed 100 tests.
  8568. 1331.74 s [vector] ifoldl': OK
  8569. 1331.74 s [vector] +++ OK, passed 100 tests.
  8570. 1331.74 s [vector] ifoldr: OK
  8571. 1331.74 s [vector] +++ OK, passed 100 tests.
  8572. 1331.74 s [vector] ifoldr': OK
  8573. 1331.74 s [vector] +++ OK, passed 100 tests.
  8574. 1331.74 s [vector] ifoldM: OK
  8575. 1331.74 s [vector] +++ OK, passed 100 tests.
  8576. 1331.74 s [vector] ifoldM': OK
  8577. 1331.74 s [vector] +++ OK, passed 100 tests.
  8578. 1331.75 s [vector] ifoldM_: OK (0.01s)
  8579. 1331.75 s [vector] +++ OK, passed 100 tests.
  8580. 1331.76 s [vector] ifoldM'_: OK
  8581. 1331.76 s [vector] +++ OK, passed 100 tests.
  8582. 1331.76 s [vector] all: OK
  8583. 1331.76 s [vector] +++ OK, passed 100 tests.
  8584. 1331.76 s [vector] any: OK
  8585. 1331.76 s [vector] +++ OK, passed 100 tests.
  8586. 1331.76 s [vector] prescanl: OK
  8587. 1331.76 s [vector] +++ OK, passed 100 tests.
  8588. 1331.77 s [vector] prescanl': OK
  8589. 1331.77 s [vector] +++ OK, passed 100 tests.
  8590. 1331.77 s [vector] postscanl: OK
  8591. 1331.77 s [vector] +++ OK, passed 100 tests.
  8592. 1331.77 s [vector] postscanl': OK
  8593. 1331.77 s [vector] +++ OK, passed 100 tests.
  8594. 1331.77 s [vector] scanl: OK
  8595. 1331.77 s [vector] +++ OK, passed 100 tests.
  8596. 1331.77 s [vector] scanl': OK
  8597. 1331.77 s [vector] +++ OK, passed 100 tests.
  8598. 1331.77 s [vector] scanl1: OK
  8599. 1331.77 s [vector] +++ OK, passed 100 tests.
  8600. 1331.77 s [vector] scanl1': OK
  8601. 1331.77 s [vector] +++ OK, passed 100 tests.
  8602. 1331.77 s [vector] iscanl: OK
  8603. 1331.77 s [vector] +++ OK, passed 100 tests.
  8604. 1331.77 s [vector] iscanl': OK
  8605. 1331.77 s [vector] +++ OK, passed 100 tests.
  8606. 1331.77 s [vector] prescanr: OK
  8607. 1331.77 s [vector] +++ OK, passed 100 tests.
  8608. 1331.77 s [vector] prescanr': OK
  8609. 1331.78 s [vector] +++ OK, passed 100 tests.
  8610. 1331.78 s [vector] postscanr: OK
  8611. 1331.78 s [vector] +++ OK, passed 100 tests.
  8612. 1331.78 s [vector] postscanr': OK
  8613. 1331.78 s [vector] +++ OK, passed 100 tests.
  8614. 1331.78 s [vector] scanr: OK
  8615. 1331.78 s [vector] +++ OK, passed 100 tests.
  8616. 1331.78 s [vector] scanr': OK
  8617. 1331.78 s [vector] +++ OK, passed 100 tests.
  8618. 1331.78 s [vector] scanr1: OK
  8619. 1331.78 s [vector] +++ OK, passed 100 tests.
  8620. 1331.78 s [vector] scanr1': OK
  8621. 1331.78 s [vector] +++ OK, passed 100 tests.
  8622. 1331.78 s [vector] iscanr: OK
  8623. 1331.78 s [vector] +++ OK, passed 100 tests.
  8624. 1331.78 s [vector] iscanr': OK
  8625. 1331.78 s [vector] +++ OK, passed 100 tests.
  8626. 1331.78 s [vector] mut_read: OK
  8627. 1331.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8628. 1331.78 s [vector] mut_write: OK
  8629. 1331.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8630. 1331.79 s [vector] mut_modify: OK
  8631. 1331.79 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8632. 1331.79 s [vector] mut_generate: OK
  8633. 1331.80 s [vector] +++ OK, passed 100 tests.
  8634. 1331.80 s [vector] mut_generateM: OK
  8635. 1331.80 s [vector] +++ OK, passed 100 tests.
  8636. 1331.81 s [vector] mut_mapM_: OK (0.01s)
  8637. 1331.82 s [vector] +++ OK, passed 100 tests.
  8638. 1331.82 s [vector] mut_imapM_: OK (0.01s)
  8639. 1331.82 s [vector] +++ OK, passed 100 tests.
  8640. 1331.83 s [vector] mut_forM_: OK (0.01s)
  8641. 1331.83 s [vector] +++ OK, passed 100 tests.
  8642. 1331.83 s [vector] mut_iforM_: OK
  8643. 1331.83 s [vector] +++ OK, passed 100 tests.
  8644. 1331.83 s [vector] mut_foldr: OK
  8645. 1331.83 s [vector] +++ OK, passed 100 tests.
  8646. 1331.83 s [vector] mut_foldr': OK
  8647. 1331.83 s [vector] +++ OK, passed 100 tests.
  8648. 1331.83 s [vector] mut_foldl: OK
  8649. 1331.83 s [vector] +++ OK, passed 100 tests.
  8650. 1331.83 s [vector] mut_foldl': OK
  8651. 1331.83 s [vector] +++ OK, passed 100 tests.
  8652. 1331.84 s [vector] mut_ifoldr: OK
  8653. 1331.84 s [vector] +++ OK, passed 100 tests.
  8654. 1331.84 s [vector] mut_ifoldr': OK
  8655. 1331.84 s [vector] +++ OK, passed 100 tests.
  8656. 1331.84 s [vector] mut_ifoldl: OK
  8657. 1331.84 s [vector] +++ OK, passed 100 tests.
  8658. 1331.84 s [vector] mut_ifoldl': OK
  8659. 1331.84 s [vector] +++ OK, passed 100 tests.
  8660. 1331.84 s [vector] mut_foldM: OK
  8661. 1331.84 s [vector] +++ OK, passed 100 tests.
  8662. 1331.84 s [vector] mut_foldM': OK
  8663. 1331.84 s [vector] +++ OK, passed 100 tests.
  8664. 1331.84 s [vector] mut_foldrM: OK
  8665. 1331.84 s [vector] +++ OK, passed 100 tests.
  8666. 1331.84 s [vector] mut_foldrM': OK
  8667. 1331.84 s [vector] +++ OK, passed 100 tests.
  8668. 1331.84 s [vector] mut_ifoldM: OK
  8669. 1331.84 s [vector] +++ OK, passed 100 tests.
  8670. 1331.84 s [vector] mut_ifoldM': OK
  8671. 1331.84 s [vector] +++ OK, passed 100 tests.
  8672. 1331.84 s [vector] mut_ifoldrM: OK
  8673. 1331.84 s [vector] +++ OK, passed 100 tests.
  8674. 1331.84 s [vector] mut_ifoldrM': OK
  8675. 1331.84 s [vector] +++ OK, passed 100 tests.
  8676. 1331.84 s [vector] compare: OK
  8677. 1331.84 s [vector] +++ OK, passed 100 tests.
  8678. 1331.84 s [vector] maximum: OK
  8679. 1331.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8680. 1331.84 s [vector] minimum: OK
  8681. 1331.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8682. 1331.85 s [vector] minIndex: OK
  8683. 1331.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8684. 1331.85 s [vector] maxIndex: OK
  8685. 1331.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8686. 1331.85 s [vector] maximumBy: OK
  8687. 1331.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8688. 1331.85 s [vector] minimumBy: OK
  8689. 1331.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8690. 1331.85 s [vector] maximumOn: OK
  8691. 1331.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8692. 1331.85 s [vector] minimumOn: OK
  8693. 1331.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8694. 1331.85 s [vector] maxIndexBy: OK
  8695. 1331.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8696. 1331.85 s [vector] minIndexBy: OK
  8697. 1331.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8698. 1331.85 s [vector] ListFirstMaxIndexWins: OK
  8699. 1331.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8700. 1331.85 s [vector] FalseListFirstMaxIndexWins: OK
  8701. 1331.85 s [vector] +++ OK, failed as expected. (after 1 test):
  8702. 1331.85 s [vector] Exception:
  8703. 1331.85 s [vector] Prelude.foldr1: empty list
  8704. 1331.85 s [vector] CallStack (from HasCallStack):
  8705. 1331.85 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8706. 1331.85 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8707. 1331.85 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8708. 1331.85 s [vector] []
  8709. 1331.85 s [vector] zip: OK
  8710. 1331.85 s [vector] +++ OK, passed 100 tests.
  8711. 1331.85 s [vector] zip3: OK
  8712. 1331.85 s [vector] +++ OK, passed 100 tests.
  8713. 1331.86 s [vector] unzip: OK
  8714. 1331.86 s [vector] +++ OK, passed 100 tests.
  8715. 1331.86 s [vector] unzip3: OK
  8716. 1331.86 s [vector] +++ OK, passed 100 tests.
  8717. 1331.86 s [vector] indexed: OK
  8718. 1331.86 s [vector] +++ OK, passed 100 tests.
  8719. 1331.86 s [vector] update: OK
  8720. 1331.86 s [vector] +++ OK, passed 100 tests.
  8721. 1331.86 s [vector] mempty: OK
  8722. 1331.86 s [vector] +++ OK, passed 100 tests.
  8723. 1331.87 s [vector] mappend: OK
  8724. 1331.87 s [vector] +++ OK, passed 100 tests.
  8725. 1331.87 s [vector] mconcat: OK
  8726. 1331.87 s [vector] +++ OK, passed 100 tests.
  8727. 1331.87 s [vector] glength: OK
  8728. 1331.87 s [vector] +++ OK, passed 100 tests.
  8729. 1331.87 s [vector] (Bool)
  8730. 1331.87 s [vector] fromList.toList == id: OK
  8731. 1331.87 s [vector] +++ OK, passed 100 tests.
  8732. 1331.87 s [vector] toList.fromList == id: OK
  8733. 1331.87 s [vector] +++ OK, passed 100 tests.
  8734. 1331.87 s [vector] unstream.stream == id: OK
  8735. 1331.87 s [vector] +++ OK, passed 100 tests.
  8736. 1331.88 s [vector] stream.unstream == id: OK
  8737. 1331.88 s [vector] +++ OK, passed 100 tests.
  8738. 1331.88 s [vector] eq: OK
  8739. 1331.88 s [vector] +++ OK, passed 100 tests.
  8740. 1331.88 s [vector] length: OK
  8741. 1331.88 s [vector] +++ OK, passed 100 tests.
  8742. 1331.88 s [vector] null: OK
  8743. 1331.88 s [vector] +++ OK, passed 100 tests.
  8744. 1331.88 s [vector] index: OK
  8745. 1331.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8746. 1331.88 s [vector] safeIndex: OK
  8747. 1331.88 s [vector] +++ OK, passed 100 tests.
  8748. 1331.88 s [vector] head: OK
  8749. 1331.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8750. 1331.88 s [vector] last: OK
  8751. 1331.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8752. 1331.88 s [vector] unsafeIndex: OK
  8753. 1331.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8754. 1331.88 s [vector] unsafeHead: OK
  8755. 1331.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8756. 1331.88 s [vector] unsafeLast: OK
  8757. 1331.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8758. 1331.88 s [vector] slice: OK
  8759. 1331.88 s [vector] +++ OK, passed 100 tests.
  8760. 1331.88 s [vector] init: OK
  8761. 1331.88 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8762. 1331.88 s [vector] tail: OK
  8763. 1331.88 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8764. 1331.88 s [vector] take: OK
  8765. 1331.88 s [vector] +++ OK, passed 100 tests.
  8766. 1331.88 s [vector] drop: OK
  8767. 1331.88 s [vector] +++ OK, passed 100 tests.
  8768. 1331.88 s [vector] splitAt: OK
  8769. 1331.88 s [vector] +++ OK, passed 100 tests.
  8770. 1331.88 s [vector] empty: OK
  8771. 1331.91 s [vector] +++ OK, passed 100 tests.
  8772. 1331.91 s [vector] singleton: OK
  8773. 1331.91 s [vector] +++ OK, passed 100 tests.
  8774. 1331.91 s [vector] replicate: OK
  8775. 1331.91 s [vector] +++ OK, passed 100 tests.
  8776. 1331.91 s [vector] generate: OK
  8777. 1331.91 s [vector] +++ OK, passed 100 tests.
  8778. 1331.91 s [vector] iterateN: OK
  8779. 1331.91 s [vector] +++ OK, passed 100 tests.
  8780. 1331.96 s [vector] iterateNM: OK (0.06s)
  8781. 1331.96 s [vector] +++ OK, passed 100 tests.
  8782. 1331.97 s [vector] generateM: OK (0.02s)
  8783. 1331.97 s [vector] +++ OK, passed 100 tests.
  8784. 1331.97 s [vector] replicateM: OK
  8785. 1331.97 s [vector] +++ OK, passed 100 tests.
  8786. 1331.97 s [vector] create: OK
  8787. 1331.97 s [vector] +++ OK, passed 100 tests.
  8788. 1331.97 s [vector] createT: OK
  8789. 1331.97 s [vector] +++ OK, passed 100 tests.
  8790. 1331.97 s [vector] unfoldr: OK
  8791. 1331.97 s [vector] +++ OK, passed 100 tests.
  8792. 1331.97 s [vector] unfoldrN: OK
  8793. 1331.97 s [vector] +++ OK, passed 100 tests.
  8794. 1331.98 s [vector] unfoldrExactN: OK
  8795. 1331.98 s [vector] +++ OK, passed 100 tests.
  8796. 1331.98 s [vector] unfoldrM: OK
  8797. 1331.98 s [vector] +++ OK, passed 100 tests.
  8798. 1331.98 s [vector] unfoldrNM: OK
  8799. 1331.98 s [vector] +++ OK, passed 100 tests.
  8800. 1332.02 s [vector] unfoldrExactNM: OK (0.04s)
  8801. 1332.03 s [vector] +++ OK, passed 100 tests.
  8802. 1332.03 s [vector] constructN: OK
  8803. 1332.03 s [vector] +++ OK, passed 100 tests.
  8804. 1332.03 s [vector] constructrN: OK
  8805. 1332.03 s [vector] +++ OK, passed 100 tests.
  8806. 1332.03 s [vector] cons: OK
  8807. 1332.03 s [vector] +++ OK, passed 100 tests.
  8808. 1332.03 s [vector] snoc: OK
  8809. 1332.03 s [vector] +++ OK, passed 100 tests.
  8810. 1332.03 s [vector] append: OK
  8811. 1332.04 s [vector] +++ OK, passed 100 tests.
  8812. 1332.04 s [vector] concat: OK (0.01s)
  8813. 1332.05 s [vector] +++ OK, passed 100 tests.
  8814. 1332.05 s [vector] force: OK
  8815. 1332.05 s [vector] +++ OK, passed 100 tests.
  8816. 1332.05 s [vector] upd: OK
  8817. 1332.05 s [vector] +++ OK, passed 100 tests.
  8818. 1332.05 s [vector] accum: OK
  8819. 1332.05 s [vector] +++ OK, passed 100 tests.
  8820. 1332.05 s [vector] reverse: OK
  8821. 1332.05 s [vector] +++ OK, passed 100 tests.
  8822. 1332.05 s [vector] backpermute: OK
  8823. 1332.05 s [vector] +++ OK, passed 100 tests.
  8824. 1332.05 s [vector] map: OK
  8825. 1332.06 s [vector] +++ OK, passed 100 tests.
  8826. 1332.06 s [vector] imap: OK
  8827. 1332.06 s [vector] +++ OK, passed 100 tests.
  8828. 1332.06 s [vector] concatMap: OK
  8829. 1332.06 s [vector] +++ OK, passed 100 tests.
  8830. 1332.07 s [vector] mapM: OK
  8831. 1332.07 s [vector] +++ OK, passed 100 tests.
  8832. 1332.08 s [vector] mapM_: OK (0.01s)
  8833. 1332.08 s [vector] +++ OK, passed 100 tests.
  8834. 1332.08 s [vector] forM: OK
  8835. 1332.08 s [vector] +++ OK, passed 100 tests.
  8836. 1332.09 s [vector] forM_: OK (0.01s)
  8837. 1332.09 s [vector] +++ OK, passed 100 tests.
  8838. 1332.10 s [vector] imapM: OK
  8839. 1332.10 s [vector] +++ OK, passed 100 tests.
  8840. 1332.10 s [vector] imapM_: OK (0.01s)
  8841. 1332.10 s [vector] +++ OK, passed 100 tests.
  8842. 1332.11 s [vector] zipWith: OK
  8843. 1332.11 s [vector] +++ OK, passed 100 tests.
  8844. 1332.12 s [vector] zipWith3: OK
  8845. 1332.12 s [vector] +++ OK, passed 100 tests.
  8846. 1332.12 s [vector] izipWith: OK
  8847. 1332.13 s [vector] +++ OK, passed 100 tests.
  8848. 1332.13 s [vector] izipWith3: OK
  8849. 1332.13 s [vector] +++ OK, passed 100 tests.
  8850. 1332.14 s [vector] izipWithM: OK
  8851. 1332.14 s [vector] +++ OK, passed 100 tests.
  8852. 1332.14 s [vector] izipWithM_: OK
  8853. 1332.14 s [vector] +++ OK, passed 100 tests.
  8854. 1332.14 s [vector] zipWithM: OK
  8855. 1332.14 s [vector] +++ OK, passed 100 tests.
  8856. 1332.14 s [vector] zipWithM_: OK
  8857. 1332.14 s [vector] +++ OK, passed 100 tests.
  8858. 1332.14 s [vector] filter: OK
  8859. 1332.14 s [vector] +++ OK, passed 100 tests.
  8860. 1332.14 s [vector] ifilter: OK
  8861. 1332.14 s [vector] +++ OK, passed 100 tests.
  8862. 1332.15 s [vector] filterM: OK (0.02s)
  8863. 1332.15 s [vector] +++ OK, passed 100 tests.
  8864. 1332.15 s [vector] uniq: OK
  8865. 1332.15 s [vector] +++ OK, passed 100 tests.
  8866. 1332.15 s [vector] mapMaybe: OK
  8867. 1332.15 s [vector] +++ OK, passed 100 tests.
  8868. 1332.16 s [vector] imapMaybe: OK
  8869. 1332.16 s [vector] +++ OK, passed 100 tests.
  8870. 1332.16 s [vector] takeWhile: OK
  8871. 1332.16 s [vector] +++ OK, passed 100 tests.
  8872. 1332.16 s [vector] dropWhile: OK
  8873. 1332.16 s [vector] +++ OK, passed 100 tests.
  8874. 1332.16 s [vector] partition: OK
  8875. 1332.16 s [vector] +++ OK, passed 100 tests.
  8876. 1332.16 s [vector] partitionWith: OK
  8877. 1332.16 s [vector] +++ OK, passed 100 tests.
  8878. 1332.16 s [vector] span: OK
  8879. 1332.16 s [vector] +++ OK, passed 100 tests.
  8880. 1332.16 s [vector] break: OK
  8881. 1332.16 s [vector] +++ OK, passed 100 tests.
  8882. 1332.16 s [vector] spanR: OK
  8883. 1332.17 s [vector] +++ OK, passed 100 tests.
  8884. 1332.17 s [vector] breakR: OK
  8885. 1332.17 s [vector] +++ OK, passed 100 tests.
  8886. 1332.17 s [vector] groupBy: OK
  8887. 1332.17 s [vector] +++ OK, passed 100 tests.
  8888. 1332.17 s [vector] elem: OK
  8889. 1332.17 s [vector] +++ OK, passed 100 tests.
  8890. 1332.17 s [vector] notElem: OK
  8891. 1332.17 s [vector] +++ OK, passed 100 tests.
  8892. 1332.17 s [vector] find: OK
  8893. 1332.17 s [vector] +++ OK, passed 100 tests.
  8894. 1332.18 s [vector] findIndex: OK
  8895. 1332.18 s [vector] +++ OK, passed 100 tests.
  8896. 1332.18 s [vector] findIndexR: OK
  8897. 1332.18 s [vector] +++ OK, passed 100 tests.
  8898. 1332.18 s [vector] findIndices: OK
  8899. 1332.18 s [vector] +++ OK, passed 100 tests.
  8900. 1332.19 s [vector] elemIndex: OK
  8901. 1332.19 s [vector] +++ OK, passed 100 tests.
  8902. 1332.19 s [vector] elemIndices: OK
  8903. 1332.19 s [vector] +++ OK, passed 100 tests.
  8904. 1332.19 s [vector] foldl: OK
  8905. 1332.19 s [vector] +++ OK, passed 100 tests.
  8906. 1332.19 s [vector] foldl1: OK
  8907. 1332.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8908. 1332.19 s [vector] foldl': OK
  8909. 1332.19 s [vector] +++ OK, passed 100 tests.
  8910. 1332.19 s [vector] foldl1': OK
  8911. 1332.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8912. 1332.20 s [vector] foldr: OK
  8913. 1332.20 s [vector] +++ OK, passed 100 tests.
  8914. 1332.20 s [vector] foldr1: OK
  8915. 1332.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8916. 1332.20 s [vector] foldr': OK
  8917. 1332.20 s [vector] +++ OK, passed 100 tests.
  8918. 1332.20 s [vector] foldr1': OK
  8919. 1332.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8920. 1332.21 s [vector] ifoldl: OK
  8921. 1332.21 s [vector] +++ OK, passed 100 tests.
  8922. 1332.21 s [vector] ifoldl': OK
  8923. 1332.21 s [vector] +++ OK, passed 100 tests.
  8924. 1332.21 s [vector] ifoldr: OK
  8925. 1332.22 s [vector] +++ OK, passed 100 tests.
  8926. 1332.22 s [vector] ifoldr': OK
  8927. 1332.22 s [vector] +++ OK, passed 100 tests.
  8928. 1332.22 s [vector] ifoldM: OK
  8929. 1332.22 s [vector] +++ OK, passed 100 tests.
  8930. 1332.24 s [vector] ifoldM': OK
  8931. 1332.24 s [vector] +++ OK, passed 100 tests.
  8932. 1332.26 s [vector] ifoldM_: OK (0.02s)
  8933. 1332.26 s [vector] +++ OK, passed 100 tests.
  8934. 1332.26 s [vector] ifoldM'_: OK (0.02s)
  8935. 1332.26 s [vector] +++ OK, passed 100 tests.
  8936. 1332.26 s [vector] all: OK
  8937. 1332.26 s [vector] +++ OK, passed 100 tests.
  8938. 1332.26 s [vector] any: OK
  8939. 1332.26 s [vector] +++ OK, passed 100 tests.
  8940. 1332.27 s [vector] prescanl: OK
  8941. 1332.27 s [vector] +++ OK, passed 100 tests.
  8942. 1332.27 s [vector] prescanl': OK
  8943. 1332.27 s [vector] +++ OK, passed 100 tests.
  8944. 1332.27 s [vector] postscanl: OK
  8945. 1332.27 s [vector] +++ OK, passed 100 tests.
  8946. 1332.27 s [vector] postscanl': OK
  8947. 1332.27 s [vector] +++ OK, passed 100 tests.
  8948. 1332.28 s [vector] scanl: OK
  8949. 1332.28 s [vector] +++ OK, passed 100 tests.
  8950. 1332.28 s [vector] scanl': OK
  8951. 1332.28 s [vector] +++ OK, passed 100 tests.
  8952. 1332.28 s [vector] scanl1: OK
  8953. 1332.28 s [vector] +++ OK, passed 100 tests.
  8954. 1332.28 s [vector] scanl1': OK
  8955. 1332.28 s [vector] +++ OK, passed 100 tests.
  8956. 1332.28 s [vector] iscanl: OK
  8957. 1332.28 s [vector] +++ OK, passed 100 tests.
  8958. 1332.29 s [vector] iscanl': OK
  8959. 1332.29 s [vector] +++ OK, passed 100 tests.
  8960. 1332.29 s [vector] prescanr: OK
  8961. 1332.29 s [vector] +++ OK, passed 100 tests.
  8962. 1332.29 s [vector] prescanr': OK
  8963. 1332.29 s [vector] +++ OK, passed 100 tests.
  8964. 1332.29 s [vector] postscanr: OK
  8965. 1332.29 s [vector] +++ OK, passed 100 tests.
  8966. 1332.30 s [vector] postscanr': OK
  8967. 1332.30 s [vector] +++ OK, passed 100 tests.
  8968. 1332.30 s [vector] scanr: OK
  8969. 1332.30 s [vector] +++ OK, passed 100 tests.
  8970. 1332.30 s [vector] scanr': OK
  8971. 1332.30 s [vector] +++ OK, passed 100 tests.
  8972. 1332.30 s [vector] scanr1: OK
  8973. 1332.30 s [vector] +++ OK, passed 100 tests.
  8974. 1332.30 s [vector] scanr1': OK
  8975. 1332.31 s [vector] +++ OK, passed 100 tests.
  8976. 1332.31 s [vector] iscanr: OK
  8977. 1332.31 s [vector] +++ OK, passed 100 tests.
  8978. 1332.31 s [vector] iscanr': OK
  8979. 1332.31 s [vector] +++ OK, passed 100 tests.
  8980. 1332.31 s [vector] mut_read: OK
  8981. 1332.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8982. 1332.31 s [vector] mut_write: OK
  8983. 1332.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8984. 1332.31 s [vector] mut_modify: OK
  8985. 1332.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8986. 1332.32 s [vector] mut_generate: OK
  8987. 1332.32 s [vector] +++ OK, passed 100 tests.
  8988. 1332.32 s [vector] mut_generateM: OK
  8989. 1332.32 s [vector] +++ OK, passed 100 tests.
  8990. 1332.34 s [vector] mut_mapM_: OK (0.01s)
  8991. 1332.34 s [vector] +++ OK, passed 100 tests.
  8992. 1332.34 s [vector] mut_imapM_: OK (0.01s)
  8993. 1332.34 s [vector] +++ OK, passed 100 tests.
  8994. 1332.36 s [vector] mut_forM_: OK (0.01s)
  8995. 1332.36 s [vector] +++ OK, passed 100 tests.
  8996. 1332.36 s [vector] mut_iforM_: OK (0.01s)
  8997. 1332.36 s [vector] +++ OK, passed 100 tests.
  8998. 1332.37 s [vector] mut_foldr: OK
  8999. 1332.37 s [vector] +++ OK, passed 100 tests.
  9000. 1332.37 s [vector] mut_foldr': OK
  9001. 1332.37 s [vector] +++ OK, passed 100 tests.
  9002. 1332.37 s [vector] mut_foldl: OK
  9003. 1332.37 s [vector] +++ OK, passed 100 tests.
  9004. 1332.37 s [vector] mut_foldl': OK
  9005. 1332.37 s [vector] +++ OK, passed 100 tests.
  9006. 1332.37 s [vector] mut_ifoldr: OK
  9007. 1332.37 s [vector] +++ OK, passed 100 tests.
  9008. 1332.38 s [vector] mut_ifoldr': OK
  9009. 1332.38 s [vector] +++ OK, passed 100 tests.
  9010. 1332.38 s [vector] mut_ifoldl: OK
  9011. 1332.38 s [vector] +++ OK, passed 100 tests.
  9012. 1332.39 s [vector] mut_ifoldl': OK
  9013. 1332.39 s [vector] +++ OK, passed 100 tests.
  9014. 1332.39 s [vector] mut_foldM: OK (0.01s)
  9015. 1332.40 s [vector] +++ OK, passed 100 tests.
  9016. 1332.40 s [vector] mut_foldM': OK
  9017. 1332.40 s [vector] +++ OK, passed 100 tests.
  9018. 1332.40 s [vector] mut_foldrM: OK
  9019. 1332.40 s [vector] +++ OK, passed 100 tests.
  9020. 1332.40 s [vector] mut_foldrM': OK
  9021. 1332.40 s [vector] +++ OK, passed 100 tests.
  9022. 1332.41 s [vector] mut_ifoldM: OK
  9023. 1332.41 s [vector] +++ OK, passed 100 tests.
  9024. 1332.41 s [vector] mut_ifoldM': OK
  9025. 1332.41 s [vector] +++ OK, passed 100 tests.
  9026. 1332.41 s [vector] mut_ifoldrM: OK
  9027. 1332.41 s [vector] +++ OK, passed 100 tests.
  9028. 1332.41 s [vector] mut_ifoldrM': OK
  9029. 1332.41 s [vector] +++ OK, passed 100 tests.
  9030. 1332.41 s [vector] compare: OK
  9031. 1332.41 s [vector] +++ OK, passed 100 tests.
  9032. 1332.41 s [vector] maximum: OK
  9033. 1332.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9034. 1332.41 s [vector] minimum: OK
  9035. 1332.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9036. 1332.41 s [vector] minIndex: OK
  9037. 1332.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9038. 1332.41 s [vector] maxIndex: OK
  9039. 1332.41 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9040. 1332.41 s [vector] maximumBy: OK
  9041. 1332.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9042. 1332.41 s [vector] minimumBy: OK
  9043. 1332.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9044. 1332.42 s [vector] maximumOn: OK
  9045. 1332.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9046. 1332.42 s [vector] minimumOn: OK
  9047. 1332.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9048. 1332.42 s [vector] maxIndexBy: OK
  9049. 1332.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9050. 1332.42 s [vector] minIndexBy: OK
  9051. 1332.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9052. 1332.42 s [vector] ListFirstMaxIndexWins: OK
  9053. 1332.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9054. 1332.42 s [vector] FalseListFirstMaxIndexWins: OK
  9055. 1332.42 s [vector] +++ OK, failed as expected. (after 1 test):
  9056. 1332.42 s [vector] Exception:
  9057. 1332.42 s [vector] Prelude.foldr1: empty list
  9058. 1332.42 s [vector] CallStack (from HasCallStack):
  9059. 1332.42 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9060. 1332.42 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9061. 1332.42 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9062. 1332.42 s [vector] []
  9063. 1332.42 s [vector] zip: OK
  9064. 1332.42 s [vector] +++ OK, passed 100 tests.
  9065. 1332.42 s [vector] zip3: OK
  9066. 1332.42 s [vector] +++ OK, passed 100 tests.
  9067. 1332.42 s [vector] unzip: OK
  9068. 1332.42 s [vector] +++ OK, passed 100 tests.
  9069. 1332.43 s [vector] unzip3: OK
  9070. 1332.43 s [vector] +++ OK, passed 100 tests.
  9071. 1332.43 s [vector] indexed: OK
  9072. 1332.43 s [vector] +++ OK, passed 100 tests.
  9073. 1332.43 s [vector] update: OK
  9074. 1332.43 s [vector] +++ OK, passed 100 tests.
  9075. 1332.43 s [vector] mempty: OK
  9076. 1332.43 s [vector] +++ OK, passed 100 tests.
  9077. 1332.44 s [vector] mappend: OK
  9078. 1332.44 s [vector] +++ OK, passed 100 tests.
  9079. 1332.45 s [vector] mconcat: OK (0.01s)
  9080. 1332.45 s [vector] +++ OK, passed 100 tests.
  9081. 1332.45 s [vector] glength: OK
  9082. 1332.45 s [vector] +++ OK, passed 100 tests.
  9083. 1332.45 s [vector] and: OK
  9084. 1332.45 s [vector] +++ OK, passed 100 tests.
  9085. 1332.45 s [vector] or: OK
  9086. 1332.45 s [vector] +++ OK, passed 100 tests.
  9087. 1332.45 s [vector] (Int)
  9088. 1332.45 s [vector] fromList.toList == id: OK
  9089. 1332.45 s [vector] +++ OK, passed 100 tests.
  9090. 1332.45 s [vector] toList.fromList == id: OK
  9091. 1332.45 s [vector] +++ OK, passed 100 tests.
  9092. 1332.45 s [vector] unstream.stream == id: OK
  9093. 1332.45 s [vector] +++ OK, passed 100 tests.
  9094. 1332.45 s [vector] stream.unstream == id: OK
  9095. 1332.45 s [vector] +++ OK, passed 100 tests.
  9096. 1332.45 s [vector] eq: OK
  9097. 1332.45 s [vector] +++ OK, passed 100 tests.
  9098. 1332.45 s [vector] length: OK
  9099. 1332.45 s [vector] +++ OK, passed 100 tests.
  9100. 1332.45 s [vector] null: OK
  9101. 1332.45 s [vector] +++ OK, passed 100 tests.
  9102. 1332.45 s [vector] index: OK
  9103. 1332.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9104. 1332.45 s [vector] safeIndex: OK
  9105. 1332.45 s [vector] +++ OK, passed 100 tests.
  9106. 1332.45 s [vector] head: OK
  9107. 1332.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9108. 1332.45 s [vector] last: OK
  9109. 1332.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9110. 1332.46 s [vector] unsafeIndex: OK
  9111. 1332.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9112. 1332.46 s [vector] unsafeHead: OK
  9113. 1332.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9114. 1332.46 s [vector] unsafeLast: OK
  9115. 1332.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9116. 1332.46 s [vector] slice: OK
  9117. 1332.46 s [vector] +++ OK, passed 100 tests.
  9118. 1332.46 s [vector] init: OK
  9119. 1332.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9120. 1332.46 s [vector] tail: OK
  9121. 1332.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9122. 1332.46 s [vector] take: OK
  9123. 1332.46 s [vector] +++ OK, passed 100 tests.
  9124. 1332.46 s [vector] drop: OK
  9125. 1332.46 s [vector] +++ OK, passed 100 tests.
  9126. 1332.46 s [vector] splitAt: OK
  9127. 1332.46 s [vector] +++ OK, passed 100 tests.
  9128. 1332.46 s [vector] empty: OK
  9129. 1332.48 s [vector] +++ OK, passed 100 tests.
  9130. 1332.48 s [vector] singleton: OK
  9131. 1332.48 s [vector] +++ OK, passed 100 tests.
  9132. 1332.48 s [vector] replicate: OK
  9133. 1332.48 s [vector] +++ OK, passed 100 tests.
  9134. 1332.48 s [vector] generate: OK
  9135. 1332.48 s [vector] +++ OK, passed 100 tests.
  9136. 1332.48 s [vector] iterateN: OK
  9137. 1332.48 s [vector] +++ OK, passed 100 tests.
  9138. 1332.52 s [vector] iterateNM: OK (0.04s)
  9139. 1332.52 s [vector] +++ OK, passed 100 tests.
  9140. 1332.54 s [vector] generateM: OK (0.03s)
  9141. 1332.54 s [vector] +++ OK, passed 100 tests.
  9142. 1332.55 s [vector] replicateM: OK (0.02s)
  9143. 1332.55 s [vector] +++ OK, passed 100 tests.
  9144. 1332.55 s [vector] create: OK
  9145. 1332.55 s [vector] +++ OK, passed 100 tests.
  9146. 1332.55 s [vector] createT: OK
  9147. 1332.55 s [vector] +++ OK, passed 100 tests.
  9148. 1332.55 s [vector] unfoldr: OK
  9149. 1332.55 s [vector] +++ OK, passed 100 tests.
  9150. 1332.55 s [vector] unfoldrN: OK
  9151. 1332.55 s [vector] +++ OK, passed 100 tests.
  9152. 1332.56 s [vector] unfoldrExactN: OK
  9153. 1332.56 s [vector] +++ OK, passed 100 tests.
  9154. 1332.56 s [vector] unfoldrM: OK
  9155. 1332.56 s [vector] +++ OK, passed 100 tests.
  9156. 1332.56 s [vector] unfoldrNM: OK
  9157. 1332.56 s [vector] +++ OK, passed 100 tests.
  9158. 1332.59 s [vector] unfoldrExactNM: OK (0.03s)
  9159. 1332.59 s [vector] +++ OK, passed 100 tests.
  9160. 1332.59 s [vector] constructN: OK
  9161. 1332.59 s [vector] +++ OK, passed 100 tests.
  9162. 1332.60 s [vector] constructrN: OK
  9163. 1332.60 s [vector] +++ OK, passed 100 tests.
  9164. 1332.60 s [vector] cons: OK
  9165. 1332.60 s [vector] +++ OK, passed 100 tests.
  9166. 1332.60 s [vector] snoc: OK
  9167. 1332.60 s [vector] +++ OK, passed 100 tests.
  9168. 1332.61 s [vector] append: OK
  9169. 1332.61 s [vector] +++ OK, passed 100 tests.
  9170. 1332.61 s [vector] concat: OK (0.02s)
  9171. 1332.62 s [vector] +++ OK, passed 100 tests.
  9172. 1332.62 s [vector] force: OK
  9173. 1332.62 s [vector] +++ OK, passed 100 tests.
  9174. 1332.62 s [vector] upd: OK
  9175. 1332.63 s [vector] +++ OK, passed 100 tests.
  9176. 1332.63 s [vector] accum: OK
  9177. 1332.63 s [vector] +++ OK, passed 100 tests.
  9178. 1332.64 s [vector] reverse: OK
  9179. 1332.64 s [vector] +++ OK, passed 100 tests.
  9180. 1332.64 s [vector] backpermute: OK
  9181. 1332.64 s [vector] +++ OK, passed 100 tests.
  9182. 1332.64 s [vector] map: OK
  9183. 1332.65 s [vector] +++ OK, passed 100 tests.
  9184. 1332.65 s [vector] imap: OK
  9185. 1332.65 s [vector] +++ OK, passed 100 tests.
  9186. 1332.65 s [vector] concatMap: OK
  9187. 1332.65 s [vector] +++ OK, passed 100 tests.
  9188. 1332.65 s [vector] mapM: OK
  9189. 1332.65 s [vector] +++ OK, passed 100 tests.
  9190. 1332.66 s [vector] mapM_: OK (0.02s)
  9191. 1332.66 s [vector] +++ OK, passed 100 tests.
  9192. 1332.66 s [vector] forM: OK
  9193. 1332.66 s [vector] +++ OK, passed 100 tests.
  9194. 1332.68 s [vector] forM_: OK (0.02s)
  9195. 1332.68 s [vector] +++ OK, passed 100 tests.
  9196. 1332.68 s [vector] imapM: OK
  9197. 1332.68 s [vector] +++ OK, passed 100 tests.
  9198. 1332.70 s [vector] imapM_: OK (0.02s)
  9199. 1332.70 s [vector] +++ OK, passed 100 tests.
  9200. 1332.70 s [vector] zipWith: OK
  9201. 1332.70 s [vector] +++ OK, passed 100 tests.
  9202. 1332.70 s [vector] zipWith3: OK
  9203. 1332.70 s [vector] +++ OK, passed 100 tests.
  9204. 1332.70 s [vector] izipWith: OK
  9205. 1332.71 s [vector] +++ OK, passed 100 tests.
  9206. 1332.71 s [vector] izipWith3: OK
  9207. 1332.72 s [vector] +++ OK, passed 100 tests.
  9208. 1332.72 s [vector] izipWithM: OK
  9209. 1332.72 s [vector] +++ OK, passed 100 tests.
  9210. 1332.73 s [vector] izipWithM_: OK (0.02s)
  9211. 1332.74 s [vector] +++ OK, passed 100 tests.
  9212. 1332.74 s [vector] zipWithM: OK
  9213. 1332.74 s [vector] +++ OK, passed 100 tests.
  9214. 1332.75 s [vector] zipWithM_: OK (0.01s)
  9215. 1332.75 s [vector] +++ OK, passed 100 tests.
  9216. 1332.75 s [vector] filter: OK
  9217. 1332.75 s [vector] +++ OK, passed 100 tests.
  9218. 1332.75 s [vector] ifilter: OK
  9219. 1332.76 s [vector] +++ OK, passed 100 tests.
  9220. 1332.78 s [vector] filterM: OK (0.03s)
  9221. 1332.78 s [vector] +++ OK, passed 100 tests.
  9222. 1332.78 s [vector] uniq: OK
  9223. 1332.78 s [vector] +++ OK, passed 100 tests.
  9224. 1332.78 s [vector] mapMaybe: OK
  9225. 1332.78 s [vector] +++ OK, passed 100 tests.
  9226. 1332.78 s [vector] imapMaybe: OK
  9227. 1332.79 s [vector] +++ OK, passed 100 tests.
  9228. 1332.79 s [vector] takeWhile: OK
  9229. 1332.79 s [vector] +++ OK, passed 100 tests.
  9230. 1332.79 s [vector] dropWhile: OK
  9231. 1332.79 s [vector] +++ OK, passed 100 tests.
  9232. 1332.79 s [vector] partition: OK
  9233. 1332.79 s [vector] +++ OK, passed 100 tests.
  9234. 1332.79 s [vector] partitionWith: OK
  9235. 1332.79 s [vector] +++ OK, passed 100 tests.
  9236. 1332.79 s [vector] span: OK
  9237. 1332.79 s [vector] +++ OK, passed 100 tests.
  9238. 1332.79 s [vector] break: OK
  9239. 1332.79 s [vector] +++ OK, passed 100 tests.
  9240. 1332.79 s [vector] spanR: OK
  9241. 1332.79 s [vector] +++ OK, passed 100 tests.
  9242. 1332.80 s [vector] breakR: OK
  9243. 1332.80 s [vector] +++ OK, passed 100 tests.
  9244. 1332.80 s [vector] groupBy: OK
  9245. 1332.80 s [vector] +++ OK, passed 100 tests.
  9246. 1332.80 s [vector] elem: OK
  9247. 1332.80 s [vector] +++ OK, passed 100 tests.
  9248. 1332.80 s [vector] notElem: OK
  9249. 1332.80 s [vector] +++ OK, passed 100 tests.
  9250. 1332.80 s [vector] find: OK
  9251. 1332.80 s [vector] +++ OK, passed 100 tests.
  9252. 1332.80 s [vector] findIndex: OK
  9253. 1332.80 s [vector] +++ OK, passed 100 tests.
  9254. 1332.80 s [vector] findIndexR: OK
  9255. 1332.80 s [vector] +++ OK, passed 100 tests.
  9256. 1332.80 s [vector] findIndices: OK
  9257. 1332.80 s [vector] +++ OK, passed 100 tests.
  9258. 1332.80 s [vector] elemIndex: OK
  9259. 1332.80 s [vector] +++ OK, passed 100 tests.
  9260. 1332.80 s [vector] elemIndices: OK
  9261. 1332.80 s [vector] +++ OK, passed 100 tests.
  9262. 1332.81 s [vector] foldl: OK
  9263. 1332.81 s [vector] +++ OK, passed 100 tests.
  9264. 1332.81 s [vector] foldl1: OK
  9265. 1332.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9266. 1332.81 s [vector] foldl': OK
  9267. 1332.81 s [vector] +++ OK, passed 100 tests.
  9268. 1332.82 s [vector] foldl1': OK
  9269. 1332.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9270. 1332.82 s [vector] foldr: OK
  9271. 1332.82 s [vector] +++ OK, passed 100 tests.
  9272. 1332.82 s [vector] foldr1: OK
  9273. 1332.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9274. 1332.82 s [vector] foldr': OK
  9275. 1332.82 s [vector] +++ OK, passed 100 tests.
  9276. 1332.82 s [vector] foldr1': OK
  9277. 1332.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9278. 1332.83 s [vector] ifoldl: OK
  9279. 1332.83 s [vector] +++ OK, passed 100 tests.
  9280. 1332.83 s [vector] ifoldl': OK
  9281. 1332.83 s [vector] +++ OK, passed 100 tests.
  9282. 1332.84 s [vector] ifoldr: OK
  9283. 1332.84 s [vector] +++ OK, passed 100 tests.
  9284. 1332.84 s [vector] ifoldr': OK
  9285. 1332.84 s [vector] +++ OK, passed 100 tests.
  9286. 1332.84 s [vector] ifoldM: OK
  9287. 1332.84 s [vector] +++ OK, passed 100 tests.
  9288. 1332.84 s [vector] ifoldM': OK
  9289. 1332.86 s [vector] +++ OK, passed 100 tests.
  9290. 1332.88 s [vector] ifoldM_: OK (0.02s)
  9291. 1332.88 s [vector] +++ OK, passed 100 tests.
  9292. 1332.88 s [vector] ifoldM'_: OK (0.02s)
  9293. 1332.88 s [vector] +++ OK, passed 100 tests.
  9294. 1332.88 s [vector] all: OK
  9295. 1332.88 s [vector] +++ OK, passed 100 tests.
  9296. 1332.88 s [vector] any: OK
  9297. 1332.88 s [vector] +++ OK, passed 100 tests.
  9298. 1332.89 s [vector] prescanl: OK
  9299. 1332.89 s [vector] +++ OK, passed 100 tests.
  9300. 1332.89 s [vector] prescanl': OK
  9301. 1332.89 s [vector] +++ OK, passed 100 tests.
  9302. 1332.89 s [vector] postscanl: OK
  9303. 1332.89 s [vector] +++ OK, passed 100 tests.
  9304. 1332.89 s [vector] postscanl': OK
  9305. 1332.90 s [vector] +++ OK, passed 100 tests.
  9306. 1332.90 s [vector] scanl: OK
  9307. 1332.90 s [vector] +++ OK, passed 100 tests.
  9308. 1332.90 s [vector] scanl': OK
  9309. 1332.90 s [vector] +++ OK, passed 100 tests.
  9310. 1332.91 s [vector] scanl1: OK
  9311. 1332.91 s [vector] +++ OK, passed 100 tests.
  9312. 1332.91 s [vector] scanl1': OK
  9313. 1332.91 s [vector] +++ OK, passed 100 tests.
  9314. 1332.91 s [vector] iscanl: OK
  9315. 1332.91 s [vector] +++ OK, passed 100 tests.
  9316. 1332.92 s [vector] iscanl': OK
  9317. 1332.92 s [vector] +++ OK, passed 100 tests.
  9318. 1332.92 s [vector] prescanr: OK
  9319. 1332.92 s [vector] +++ OK, passed 100 tests.
  9320. 1332.92 s [vector] prescanr': OK
  9321. 1332.92 s [vector] +++ OK, passed 100 tests.
  9322. 1332.93 s [vector] postscanr: OK
  9323. 1332.93 s [vector] +++ OK, passed 100 tests.
  9324. 1332.93 s [vector] postscanr': OK
  9325. 1332.93 s [vector] +++ OK, passed 100 tests.
  9326. 1332.93 s [vector] scanr: OK
  9327. 1332.93 s [vector] +++ OK, passed 100 tests.
  9328. 1332.94 s [vector] scanr': OK
  9329. 1332.94 s [vector] +++ OK, passed 100 tests.
  9330. 1332.94 s [vector] scanr1: OK
  9331. 1332.94 s [vector] +++ OK, passed 100 tests.
  9332. 1332.94 s [vector] scanr1': OK
  9333. 1332.94 s [vector] +++ OK, passed 100 tests.
  9334. 1332.94 s [vector] iscanr: OK
  9335. 1332.94 s [vector] +++ OK, passed 100 tests.
  9336. 1332.95 s [vector] iscanr': OK
  9337. 1332.95 s [vector] +++ OK, passed 100 tests.
  9338. 1332.95 s [vector] mut_read: OK
  9339. 1332.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9340. 1332.95 s [vector] mut_write: OK
  9341. 1332.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9342. 1332.95 s [vector] mut_modify: OK
  9343. 1332.95 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9344. 1332.96 s [vector] mut_generate: OK
  9345. 1332.96 s [vector] +++ OK, passed 100 tests.
  9346. 1332.96 s [vector] mut_generateM: OK
  9347. 1332.96 s [vector] +++ OK, passed 100 tests.
  9348. 1332.98 s [vector] mut_mapM_: OK (0.02s)
  9349. 1332.98 s [vector] +++ OK, passed 100 tests.
  9350. 1333.00 s [vector] mut_imapM_: OK (0.02s)
  9351. 1333.22 s [vector] +++ OK, passed 100 tests.
  9352. 1333.22 s [vector] mut_forM_: OK (0.02s)
  9353. 1333.22 s [vector] +++ OK, passed 100 tests.
  9354. 1333.22 s [vector] mut_iforM_: OK (0.02s)
  9355. 1333.22 s [vector] +++ OK, passed 100 tests.
  9356. 1333.22 s [vector] mut_foldr: OK
  9357. 1333.22 s [vector] +++ OK, passed 100 tests.
  9358. 1333.22 s [vector] mut_foldr': OK
  9359. 1333.22 s [vector] +++ OK, passed 100 tests.
  9360. 1333.22 s [vector] mut_foldl: OK
  9361. 1333.22 s [vector] +++ OK, passed 100 tests.
  9362. 1333.22 s [vector] mut_foldl': OK
  9363. 1333.22 s [vector] +++ OK, passed 100 tests.
  9364. 1333.22 s [vector] mut_ifoldr: OK
  9365. 1333.22 s [vector] +++ OK, passed 100 tests.
  9366. 1333.22 s [vector] mut_ifoldr': OK
  9367. 1333.22 s [vector] +++ OK, passed 100 tests.
  9368. 1333.22 s [vector] mut_ifoldl: OK
  9369. 1333.22 s [vector] +++ OK, passed 100 tests.
  9370. 1333.22 s [vector] mut_ifoldl': OK
  9371. 1333.22 s [vector] +++ OK, passed 100 tests.
  9372. 1333.22 s [vector] mut_foldM: OK
  9373. 1333.22 s [vector] +++ OK, passed 100 tests.
  9374. 1333.22 s [vector] mut_foldM': OK
  9375. 1333.22 s [vector] +++ OK, passed 100 tests.
  9376. 1333.22 s [vector] mut_foldrM: OK
  9377. 1333.22 s [vector] +++ OK, passed 100 tests.
  9378. 1333.22 s [vector] mut_foldrM': OK
  9379. 1333.22 s [vector] +++ OK, passed 100 tests.
  9380. 1333.22 s [vector] mut_ifoldM: OK
  9381. 1333.22 s [vector] +++ OK, passed 100 tests.
  9382. 1333.22 s [vector] mut_ifoldM': OK
  9383. 1333.22 s [vector] +++ OK, passed 100 tests.
  9384. 1333.22 s [vector] mut_ifoldrM: OK
  9385. 1333.22 s [vector] +++ OK, passed 100 tests.
  9386. 1333.22 s [vector] mut_ifoldrM': OK
  9387. 1333.22 s [vector] +++ OK, passed 100 tests.
  9388. 1333.22 s [vector] compare: OK
  9389. 1333.22 s [vector] +++ OK, passed 100 tests.
  9390. 1333.22 s [vector] maximum: OK
  9391. 1333.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9392. 1333.22 s [vector] minimum: OK
  9393. 1333.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9394. 1333.22 s [vector] minIndex: OK
  9395. 1333.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9396. 1333.22 s [vector] maxIndex: OK
  9397. 1333.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9398. 1333.22 s [vector] maximumBy: OK
  9399. 1333.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9400. 1333.22 s [vector] minimumBy: OK
  9401. 1333.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9402. 1333.22 s [vector] maximumOn: OK
  9403. 1333.22 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9404. 1333.22 s [vector] minimumOn: OK
  9405. 1333.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9406. 1333.22 s [vector] maxIndexBy: OK
  9407. 1333.22 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9408. 1333.22 s [vector] minIndexBy: OK
  9409. 1333.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9410. 1333.22 s [vector] ListFirstMaxIndexWins: OK
  9411. 1333.22 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9412. 1333.22 s [vector] FalseListFirstMaxIndexWins: OK
  9413. 1333.22 s [vector] +++ OK, failed as expected. (after 1 test):
  9414. 1333.22 s [vector] Exception:
  9415. 1333.22 s [vector] Prelude.foldr1: empty list
  9416. 1333.22 s [vector] CallStack (from HasCallStack):
  9417. 1333.22 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9418. 1333.22 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9419. 1333.22 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9420. 1333.22 s [vector] []
  9421. 1333.22 s [vector] zip: OK
  9422. 1333.22 s [vector] +++ OK, passed 100 tests.
  9423. 1333.22 s [vector] zip3: OK
  9424. 1333.22 s [vector] +++ OK, passed 100 tests.
  9425. 1333.22 s [vector] unzip: OK
  9426. 1333.22 s [vector] +++ OK, passed 100 tests.
  9427. 1333.22 s [vector] unzip3: OK
  9428. 1333.22 s [vector] +++ OK, passed 100 tests.
  9429. 1333.22 s [vector] indexed: OK
  9430. 1333.22 s [vector] +++ OK, passed 100 tests.
  9431. 1333.22 s [vector] update: OK
  9432. 1333.22 s [vector] +++ OK, passed 100 tests.
  9433. 1333.22 s [vector] mempty: OK
  9434. 1333.22 s [vector] +++ OK, passed 100 tests.
  9435. 1333.22 s [vector] mappend: OK
  9436. 1333.22 s [vector] +++ OK, passed 100 tests.
  9437. 1333.22 s [vector] mconcat: OK (0.01s)
  9438. 1333.22 s [vector] +++ OK, passed 100 tests.
  9439. 1333.22 s [vector] glength: OK
  9440. 1333.22 s [vector] +++ OK, passed 100 tests.
  9441. 1333.22 s [vector] sum: OK
  9442. 1333.22 s [vector] +++ OK, passed 100 tests.
  9443. 1333.22 s [vector] product: OK
  9444. 1333.22 s [vector] +++ OK, passed 100 tests.
  9445. 1333.22 s [vector] enumFromN: OK
  9446. 1333.22 s [vector] +++ OK, passed 100 tests.
  9447. 1333.22 s [vector] enumFromThenN: OK
  9448. 1333.22 s [vector] +++ OK, passed 100 tests.
  9449. 1333.22 s [vector] enumFromTo: OK
  9450. 1333.22 s [vector] +++ OK, passed 100 tests.
  9451. 1333.22 s [vector] enumFromThenTo: OK
  9452. 1333.22 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9453. 1333.22 s [vector] (Float)
  9454. 1333.22 s [vector] fromList.toList == id: OK
  9455. 1333.22 s [vector] +++ OK, passed 100 tests.
  9456. 1333.22 s [vector] toList.fromList == id: OK
  9457. 1333.22 s [vector] +++ OK, passed 100 tests.
  9458. 1333.22 s [vector] unstream.stream == id: OK
  9459. 1333.22 s [vector] +++ OK, passed 100 tests.
  9460. 1333.22 s [vector] stream.unstream == id: OK
  9461. 1333.22 s [vector] +++ OK, passed 100 tests.
  9462. 1333.22 s [vector] eq: OK
  9463. 1333.22 s [vector] +++ OK, passed 100 tests.
  9464. 1333.22 s [vector] length: OK
  9465. 1333.22 s [vector] +++ OK, passed 100 tests.
  9466. 1333.22 s [vector] null: OK
  9467. 1333.22 s [vector] +++ OK, passed 100 tests.
  9468. 1333.22 s [vector] index: OK
  9469. 1333.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9470. 1333.22 s [vector] safeIndex: OK
  9471. 1333.22 s [vector] +++ OK, passed 100 tests.
  9472. 1333.22 s [vector] head: OK
  9473. 1333.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9474. 1333.22 s [vector] last: OK
  9475. 1333.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9476. 1333.22 s [vector] unsafeIndex: OK
  9477. 1333.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9478. 1333.22 s [vector] unsafeHead: OK
  9479. 1333.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9480. 1333.22 s [vector] unsafeLast: OK
  9481. 1333.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9482. 1333.22 s [vector] slice: OK
  9483. 1333.22 s [vector] +++ OK, passed 100 tests.
  9484. 1333.22 s [vector] init: OK
  9485. 1333.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9486. 1333.22 s [vector] tail: OK
  9487. 1333.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9488. 1333.22 s [vector] take: OK
  9489. 1333.22 s [vector] +++ OK, passed 100 tests.
  9490. 1333.22 s [vector] drop: OK
  9491. 1333.22 s [vector] +++ OK, passed 100 tests.
  9492. 1333.22 s [vector] splitAt: OK
  9493. 1333.22 s [vector] +++ OK, passed 100 tests.
  9494. 1333.22 s [vector] empty: OK
  9495. 1333.22 s [vector] +++ OK, passed 100 tests.
  9496. 1333.22 s [vector] singleton: OK
  9497. 1333.22 s [vector] +++ OK, passed 100 tests.
  9498. 1333.22 s [vector] replicate: OK
  9499. 1333.22 s [vector] +++ OK, passed 100 tests.
  9500. 1333.22 s [vector] generate: OK
  9501. 1333.22 s [vector] +++ OK, passed 100 tests.
  9502. 1333.22 s [vector] iterateN: OK
  9503. 1333.22 s [vector] +++ OK, passed 100 tests.
  9504. 1333.22 s [vector] iterateNM: OK (0.04s)
  9505. 1333.22 s [vector] +++ OK, passed 100 tests.
  9506. 1333.23 s [vector] generateM: OK (0.04s)
  9507. 1333.23 s [vector] +++ OK, passed 100 tests.
  9508. 1333.23 s [vector] replicateM: OK
  9509. 1333.23 s [vector] +++ OK, passed 100 tests.
  9510. 1333.24 s [vector] create: OK
  9511. 1333.24 s [vector] +++ OK, passed 100 tests.
  9512. 1333.24 s [vector] createT: OK
  9513. 1333.24 s [vector] +++ OK, passed 100 tests.
  9514. 1333.24 s [vector] unfoldr: OK
  9515. 1333.24 s [vector] +++ OK, passed 100 tests.
  9516. 1333.24 s [vector] unfoldrN: OK
  9517. 1333.24 s [vector] +++ OK, passed 100 tests.
  9518. 1333.24 s [vector] unfoldrExactN: OK
  9519. 1333.24 s [vector] +++ OK, passed 100 tests.
  9520. 1333.26 s [vector] unfoldrM: OK
  9521. 1333.26 s [vector] +++ OK, passed 100 tests.
  9522. 1333.28 s [vector] unfoldrNM: OK (0.01s)
  9523. 1333.28 s [vector] +++ OK, passed 100 tests.
  9524. 1333.32 s [vector] unfoldrExactNM: OK (0.06s)
  9525. 1333.32 s [vector] +++ OK, passed 100 tests.
  9526. 1333.36 s [vector] constructN: OK (0.01s)
  9527. 1333.36 s [vector] +++ OK, passed 100 tests.
  9528. 1333.37 s [vector] constructrN: OK (0.01s)
  9529. 1333.37 s [vector] +++ OK, passed 100 tests.
  9530. 1333.37 s [vector] cons: OK
  9531. 1333.37 s [vector] +++ OK, passed 100 tests.
  9532. 1333.37 s [vector] snoc: OK
  9533. 1333.37 s [vector] +++ OK, passed 100 tests.
  9534. 1333.37 s [vector] append: OK
  9535. 1333.38 s [vector] +++ OK, passed 100 tests.
  9536. 1333.39 s [vector] concat: OK (0.02s)
  9537. 1333.39 s [vector] +++ OK, passed 100 tests.
  9538. 1333.39 s [vector] force: OK
  9539. 1333.39 s [vector] +++ OK, passed 100 tests.
  9540. 1333.40 s [vector] upd: OK
  9541. 1333.40 s [vector] +++ OK, passed 100 tests.
  9542. 1333.41 s [vector] accum: OK (0.01s)
  9543. 1333.41 s [vector] +++ OK, passed 100 tests.
  9544. 1333.41 s [vector] reverse: OK
  9545. 1333.41 s [vector] +++ OK, passed 100 tests.
  9546. 1333.41 s [vector] backpermute: OK
  9547. 1333.41 s [vector] +++ OK, passed 100 tests.
  9548. 1333.42 s [vector] map: OK
  9549. 1333.42 s [vector] +++ OK, passed 100 tests.
  9550. 1333.42 s [vector] imap: OK
  9551. 1333.42 s [vector] +++ OK, passed 100 tests.
  9552. 1333.43 s [vector] concatMap: OK
  9553. 1333.43 s [vector] +++ OK, passed 100 tests.
  9554. 1333.43 s [vector] mapM: OK
  9555. 1333.43 s [vector] +++ OK, passed 100 tests.
  9556. 1333.48 s [vector] mapM_: OK (0.03s)
  9557. 1333.48 s [vector] +++ OK, passed 100 tests.
  9558. 1333.48 s [vector] forM: OK
  9559. 1333.48 s [vector] +++ OK, passed 100 tests.
  9560. 1333.52 s [vector] forM_: OK (0.04s)
  9561. 1333.52 s [vector] +++ OK, passed 100 tests.
  9562. 1333.52 s [vector] imapM: OK
  9563. 1333.52 s [vector] +++ OK, passed 100 tests.
  9564. 1333.57 s [vector] imapM_: OK (0.04s)
  9565. 1333.57 s [vector] +++ OK, passed 100 tests.
  9566. 1333.57 s [vector] zipWith: OK
  9567. 1333.57 s [vector] +++ OK, passed 100 tests.
  9568. 1333.58 s [vector] zipWith3: OK
  9569. 1333.58 s [vector] +++ OK, passed 100 tests.
  9570. 1333.58 s [vector] izipWith: OK
  9571. 1333.58 s [vector] +++ OK, passed 100 tests.
  9572. 1333.59 s [vector] izipWith3: OK
  9573. 1333.59 s [vector] +++ OK, passed 100 tests.
  9574. 1333.60 s [vector] izipWithM: OK
  9575. 1333.60 s [vector] +++ OK, passed 100 tests.
  9576. 1333.64 s [vector] izipWithM_: OK (0.03s)
  9577. 1333.64 s [vector] +++ OK, passed 100 tests.
  9578. 1333.64 s [vector] zipWithM: OK
  9579. 1333.64 s [vector] +++ OK, passed 100 tests.
  9580. 1333.67 s [vector] zipWithM_: OK (0.03s)
  9581. 1333.67 s [vector] +++ OK, passed 100 tests.
  9582. 1333.67 s [vector] filter: OK
  9583. 1333.67 s [vector] +++ OK, passed 100 tests.
  9584. 1333.67 s [vector] ifilter: OK
  9585. 1333.68 s [vector] +++ OK, passed 100 tests.
  9586. 1333.72 s [vector] filterM: OK (0.04s)
  9587. 1333.72 s [vector] +++ OK, passed 100 tests.
  9588. 1333.73 s [vector] uniq: OK
  9589. 1333.73 s [vector] +++ OK, passed 100 tests.
  9590. 1333.73 s [vector] mapMaybe: OK
  9591. 1333.73 s [vector] +++ OK, passed 100 tests.
  9592. 1333.73 s [vector] imapMaybe: OK
  9593. 1333.73 s [vector] +++ OK, passed 100 tests.
  9594. 1333.73 s [vector] takeWhile: OK
  9595. 1333.73 s [vector] +++ OK, passed 100 tests.
  9596. 1333.73 s [vector] dropWhile: OK
  9597. 1333.74 s [vector] +++ OK, passed 100 tests.
  9598. 1333.74 s [vector] partition: OK
  9599. 1333.74 s [vector] +++ OK, passed 100 tests.
  9600. 1333.75 s [vector] partitionWith: OK
  9601. 1333.75 s [vector] +++ OK, passed 100 tests.
  9602. 1333.75 s [vector] span: OK
  9603. 1333.75 s [vector] +++ OK, passed 100 tests.
  9604. 1333.75 s [vector] break: OK
  9605. 1333.75 s [vector] +++ OK, passed 100 tests.
  9606. 1333.75 s [vector] spanR: OK
  9607. 1333.75 s [vector] +++ OK, passed 100 tests.
  9608. 1333.75 s [vector] breakR: OK
  9609. 1333.75 s [vector] +++ OK, passed 100 tests.
  9610. 1333.76 s [vector] groupBy: OK
  9611. 1333.76 s [vector] +++ OK, passed 100 tests.
  9612. 1333.76 s [vector] elem: OK
  9613. 1333.76 s [vector] +++ OK, passed 100 tests.
  9614. 1333.76 s [vector] notElem: OK
  9615. 1333.76 s [vector] +++ OK, passed 100 tests.
  9616. 1333.76 s [vector] find: OK
  9617. 1333.76 s [vector] +++ OK, passed 100 tests.
  9618. 1333.76 s [vector] findIndex: OK
  9619. 1333.76 s [vector] +++ OK, passed 100 tests.
  9620. 1333.76 s [vector] findIndexR: OK
  9621. 1333.76 s [vector] +++ OK, passed 100 tests.
  9622. 1333.77 s [vector] findIndices: OK
  9623. 1333.77 s [vector] +++ OK, passed 100 tests.
  9624. 1333.77 s [vector] elemIndex: OK
  9625. 1333.77 s [vector] +++ OK, passed 100 tests.
  9626. 1333.77 s [vector] elemIndices: OK
  9627. 1333.78 s [vector] +++ OK, passed 100 tests.
  9628. 1333.78 s [vector] foldl: OK
  9629. 1333.78 s [vector] +++ OK, passed 100 tests.
  9630. 1333.80 s [vector] foldl1: OK (0.01s)
  9631. 1333.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9632. 1333.81 s [vector] foldl': OK (0.01s)
  9633. 1333.82 s [vector] +++ OK, passed 100 tests.
  9634. 1333.82 s [vector] foldl1': OK (0.01s)
  9635. 1333.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9636. 1333.82 s [vector] foldr: OK (0.01s)
  9637. 1333.82 s [vector] +++ OK, passed 100 tests.
  9638. 1333.84 s [vector] foldr1: OK
  9639. 1333.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9640. 1333.86 s [vector] foldr': OK (0.01s)
  9641. 1333.86 s [vector] +++ OK, passed 100 tests.
  9642. 1333.86 s [vector] foldr1': OK (0.01s)
  9643. 1333.86 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9644. 1333.88 s [vector] ifoldl: OK (0.01s)
  9645. 1333.88 s [vector] +++ OK, passed 100 tests.
  9646. 1333.89 s [vector] ifoldl': OK (0.01s)
  9647. 1333.90 s [vector] +++ OK, passed 100 tests.
  9648. 1333.90 s [vector] ifoldr: OK
  9649. 1333.90 s [vector] +++ OK, passed 100 tests.
  9650. 1333.90 s [vector] ifoldr': OK
  9651. 1333.90 s [vector] +++ OK, passed 100 tests.
  9652. 1333.92 s [vector] ifoldM: OK (0.01s)
  9653. 1333.92 s [vector] +++ OK, passed 100 tests.
  9654. 1333.92 s [vector] ifoldM': OK
  9655. 1333.94 s [vector] +++ OK, passed 100 tests.
  9656. 1333.96 s [vector] ifoldM_: OK (0.03s)
  9657. 1333.96 s [vector] +++ OK, passed 100 tests.
  9658. 1334.00 s [vector] ifoldM'_: OK (0.04s)
  9659. 1334.00 s [vector] +++ OK, passed 100 tests.
  9660. 1334.01 s [vector] all: OK
  9661. 1334.01 s [vector] +++ OK, passed 100 tests.
  9662. 1334.01 s [vector] any: OK
  9663. 1334.02 s [vector] +++ OK, passed 100 tests.
  9664. 1334.02 s [vector] prescanl: OK
  9665. 1334.02 s [vector] +++ OK, passed 100 tests.
  9666. 1334.02 s [vector] prescanl': OK
  9667. 1334.02 s [vector] +++ OK, passed 100 tests.
  9668. 1334.03 s [vector] postscanl: OK
  9669. 1334.04 s [vector] +++ OK, passed 100 tests.
  9670. 1334.04 s [vector] postscanl': OK
  9671. 1334.04 s [vector] +++ OK, passed 100 tests.
  9672. 1334.04 s [vector] scanl: OK
  9673. 1334.05 s [vector] +++ OK, passed 100 tests.
  9674. 1334.06 s [vector] scanl': OK
  9675. 1334.06 s [vector] +++ OK, passed 100 tests.
  9676. 1334.06 s [vector] scanl1: OK
  9677. 1334.06 s [vector] +++ OK, passed 100 tests.
  9678. 1334.06 s [vector] scanl1': OK
  9679. 1334.06 s [vector] +++ OK, passed 100 tests.
  9680. 1334.08 s [vector] iscanl: OK
  9681. 1334.08 s [vector] +++ OK, passed 100 tests.
  9682. 1334.08 s [vector] iscanl': OK
  9683. 1334.08 s [vector] +++ OK, passed 100 tests.
  9684. 1334.10 s [vector] prescanr: OK
  9685. 1334.10 s [vector] +++ OK, passed 100 tests.
  9686. 1334.10 s [vector] prescanr': OK
  9687. 1334.11 s [vector] +++ OK, passed 100 tests.
  9688. 1334.11 s [vector] postscanr: OK
  9689. 1334.12 s [vector] +++ OK, passed 100 tests.
  9690. 1334.12 s [vector] postscanr': OK
  9691. 1334.12 s [vector] +++ OK, passed 100 tests.
  9692. 1334.13 s [vector] scanr: OK
  9693. 1334.13 s [vector] +++ OK, passed 100 tests.
  9694. 1334.13 s [vector] scanr': OK
  9695. 1334.13 s [vector] +++ OK, passed 100 tests.
  9696. 1334.14 s [vector] scanr1: OK
  9697. 1334.14 s [vector] +++ OK, passed 100 tests.
  9698. 1334.16 s [vector] scanr1': OK
  9699. 1334.16 s [vector] +++ OK, passed 100 tests.
  9700. 1334.16 s [vector] iscanr: OK
  9701. 1334.16 s [vector] +++ OK, passed 100 tests.
  9702. 1334.17 s [vector] iscanr': OK (0.01s)
  9703. 1334.17 s [vector] +++ OK, passed 100 tests.
  9704. 1334.17 s [vector] mut_read: OK
  9705. 1334.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9706. 1334.18 s [vector] mut_write: OK
  9707. 1334.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9708. 1334.18 s [vector] mut_modify: OK
  9709. 1334.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9710. 1334.18 s [vector] mut_generate: OK
  9711. 1334.18 s [vector] +++ OK, passed 100 tests.
  9712. 1334.22 s [vector] mut_generateM: OK (0.03s)
  9713. 1334.22 s [vector] +++ OK, passed 100 tests.
  9714. 1334.26 s [vector] mut_mapM_: OK (0.04s)
  9715. 1334.26 s [vector] +++ OK, passed 100 tests.
  9716. 1334.30 s [vector] mut_imapM_: OK (0.03s)
  9717. 1334.30 s [vector] +++ OK, passed 100 tests.
  9718. 1334.32 s [vector] mut_forM_: OK (0.04s)
  9719. 1334.32 s [vector] +++ OK, passed 100 tests.
  9720. 1334.36 s [vector] mut_iforM_: OK (0.04s)
  9721. 1334.36 s [vector] +++ OK, passed 100 tests.
  9722. 1334.37 s [vector] mut_foldr: OK
  9723. 1334.37 s [vector] +++ OK, passed 100 tests.
  9724. 1334.37 s [vector] mut_foldr': OK
  9725. 1334.37 s [vector] +++ OK, passed 100 tests.
  9726. 1334.39 s [vector] mut_foldl: OK
  9727. 1334.40 s [vector] +++ OK, passed 100 tests.
  9728. 1334.40 s [vector] mut_foldl': OK
  9729. 1334.40 s [vector] +++ OK, passed 100 tests.
  9730. 1334.40 s [vector] mut_ifoldr: OK
  9731. 1334.40 s [vector] +++ OK, passed 100 tests.
  9732. 1334.42 s [vector] mut_ifoldr': OK
  9733. 1334.42 s [vector] +++ OK, passed 100 tests.
  9734. 1334.42 s [vector] mut_ifoldl: OK (0.01s)
  9735. 1334.42 s [vector] +++ OK, passed 100 tests.
  9736. 1334.44 s [vector] mut_ifoldl': OK
  9737. 1334.44 s [vector] +++ OK, passed 100 tests.
  9738. 1334.44 s [vector] mut_foldM: OK
  9739. 1334.45 s [vector] +++ OK, passed 100 tests.
  9740. 1334.45 s [vector] mut_foldM': OK
  9741. 1334.45 s [vector] +++ OK, passed 100 tests.
  9742. 1334.46 s [vector] mut_foldrM: OK
  9743. 1334.46 s [vector] +++ OK, passed 100 tests.
  9744. 1334.46 s [vector] mut_foldrM': OK
  9745. 1334.46 s [vector] +++ OK, passed 100 tests.
  9746. 1334.47 s [vector] mut_ifoldM: OK
  9747. 1334.47 s [vector] +++ OK, passed 100 tests.
  9748. 1334.49 s [vector] mut_ifoldM': OK
  9749. 1334.50 s [vector] +++ OK, passed 100 tests.
  9750. 1334.50 s [vector] mut_ifoldrM: OK
  9751. 1334.50 s [vector] +++ OK, passed 100 tests.
  9752. 1334.50 s [vector] mut_ifoldrM': OK (0.01s)
  9753. 1334.50 s [vector] +++ OK, passed 100 tests.
  9754. 1334.51 s [vector] compare: OK
  9755. 1334.51 s [vector] +++ OK, passed 100 tests.
  9756. 1334.51 s [vector] maximum: OK
  9757. 1334.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9758. 1334.51 s [vector] minimum: OK
  9759. 1334.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9760. 1334.51 s [vector] minIndex: OK
  9761. 1334.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9762. 1334.51 s [vector] maxIndex: OK
  9763. 1334.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9764. 1334.51 s [vector] maximumBy: OK
  9765. 1334.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9766. 1334.51 s [vector] minimumBy: OK
  9767. 1334.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9768. 1334.51 s [vector] maximumOn: OK
  9769. 1334.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9770. 1334.51 s [vector] minimumOn: OK
  9771. 1334.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9772. 1334.51 s [vector] maxIndexBy: OK
  9773. 1334.51 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9774. 1334.51 s [vector] minIndexBy: OK
  9775. 1334.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9776. 1334.52 s [vector] ListFirstMaxIndexWins: OK
  9777. 1334.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9778. 1334.52 s [vector] FalseListFirstMaxIndexWins: OK
  9779. 1334.52 s [vector] +++ OK, failed as expected. (after 1 test):
  9780. 1334.52 s [vector] Exception:
  9781. 1334.52 s [vector] Prelude.foldr1: empty list
  9782. 1334.52 s [vector] CallStack (from HasCallStack):
  9783. 1334.52 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9784. 1334.52 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9785. 1334.52 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9786. 1334.52 s [vector] []
  9787. 1334.53 s [vector] zip: OK
  9788. 1334.53 s [vector] +++ OK, passed 100 tests.
  9789. 1334.53 s [vector] zip3: OK
  9790. 1334.53 s [vector] +++ OK, passed 100 tests.
  9791. 1334.53 s [vector] unzip: OK
  9792. 1334.53 s [vector] +++ OK, passed 100 tests.
  9793. 1334.53 s [vector] unzip3: OK
  9794. 1334.53 s [vector] +++ OK, passed 100 tests.
  9795. 1334.53 s [vector] indexed: OK
  9796. 1334.53 s [vector] +++ OK, passed 100 tests.
  9797. 1334.53 s [vector] update: OK
  9798. 1334.53 s [vector] +++ OK, passed 100 tests.
  9799. 1334.53 s [vector] mempty: OK
  9800. 1334.53 s [vector] +++ OK, passed 100 tests.
  9801. 1334.53 s [vector] mappend: OK
  9802. 1334.53 s [vector] +++ OK, passed 100 tests.
  9803. 1334.56 s [vector] mconcat: OK (0.02s)
  9804. 1334.56 s [vector] +++ OK, passed 100 tests.
  9805. 1334.56 s [vector] glength: OK
  9806. 1334.56 s [vector] +++ OK, passed 100 tests.
  9807. 1334.56 s [vector] sum: OK
  9808. 1334.56 s [vector] +++ OK, passed 100 tests.
  9809. 1334.56 s [vector] product: OK
  9810. 1334.56 s [vector] +++ OK, passed 100 tests.
  9811. 1334.56 s [vector] enumFromN: OK
  9812. 1334.56 s [vector] +++ OK, passed 100 tests.
  9813. 1334.56 s [vector] enumFromThenN: OK
  9814. 1334.56 s [vector] +++ OK, passed 100 tests.
  9815. 1334.56 s [vector] enumFromTo: OK
  9816. 1334.56 s [vector] +++ OK, passed 100 tests.
  9817. 1334.56 s [vector] enumFromThenTo: OK
  9818. 1334.56 s [vector] +++ OK, passed 100 tests; 5 discarded.
  9819. 1334.56 s [vector] (Double)
  9820. 1334.56 s [vector] fromList.toList == id: OK
  9821. 1334.56 s [vector] +++ OK, passed 100 tests.
  9822. 1334.57 s [vector] toList.fromList == id: OK
  9823. 1334.57 s [vector] +++ OK, passed 100 tests.
  9824. 1334.57 s [vector] unstream.stream == id: OK
  9825. 1334.57 s [vector] +++ OK, passed 100 tests.
  9826. 1334.57 s [vector] stream.unstream == id: OK
  9827. 1334.57 s [vector] +++ OK, passed 100 tests.
  9828. 1334.57 s [vector] eq: OK
  9829. 1334.57 s [vector] +++ OK, passed 100 tests.
  9830. 1334.57 s [vector] length: OK
  9831. 1334.57 s [vector] +++ OK, passed 100 tests.
  9832. 1334.57 s [vector] null: OK
  9833. 1334.57 s [vector] +++ OK, passed 100 tests.
  9834. 1334.57 s [vector] index: OK
  9835. 1334.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9836. 1334.58 s [vector] safeIndex: OK
  9837. 1334.58 s [vector] +++ OK, passed 100 tests.
  9838. 1334.58 s [vector] head: OK
  9839. 1334.58 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9840. 1334.58 s [vector] last: OK
  9841. 1334.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9842. 1334.58 s [vector] unsafeIndex: OK
  9843. 1334.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9844. 1334.58 s [vector] unsafeHead: OK
  9845. 1334.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9846. 1334.58 s [vector] unsafeLast: OK
  9847. 1334.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9848. 1334.58 s [vector] slice: OK
  9849. 1334.58 s [vector] +++ OK, passed 100 tests.
  9850. 1334.58 s [vector] init: OK
  9851. 1334.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9852. 1334.58 s [vector] tail: OK
  9853. 1334.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9854. 1334.58 s [vector] take: OK
  9855. 1334.58 s [vector] +++ OK, passed 100 tests.
  9856. 1334.58 s [vector] drop: OK
  9857. 1334.58 s [vector] +++ OK, passed 100 tests.
  9858. 1334.59 s [vector] splitAt: OK
  9859. 1334.59 s [vector] +++ OK, passed 100 tests.
  9860. 1334.59 s [vector] empty: OK
  9861. 1334.59 s [vector] +++ OK, passed 100 tests.
  9862. 1334.59 s [vector] singleton: OK
  9863. 1334.59 s [vector] +++ OK, passed 100 tests.
  9864. 1334.59 s [vector] replicate: OK
  9865. 1334.59 s [vector] +++ OK, passed 100 tests.
  9866. 1334.59 s [vector] generate: OK
  9867. 1334.59 s [vector] +++ OK, passed 100 tests.
  9868. 1334.59 s [vector] iterateN: OK
  9869. 1334.59 s [vector] +++ OK, passed 100 tests.
  9870. 1334.64 s [vector] iterateNM: OK (0.04s)
  9871. 1334.64 s [vector] +++ OK, passed 100 tests.
  9872. 1334.66 s [vector] generateM: OK (0.02s)
  9873. 1334.66 s [vector] +++ OK, passed 100 tests.
  9874. 1334.67 s [vector] replicateM: OK (0.01s)
  9875. 1334.67 s [vector] +++ OK, passed 100 tests.
  9876. 1334.67 s [vector] create: OK
  9877. 1334.67 s [vector] +++ OK, passed 100 tests.
  9878. 1334.67 s [vector] createT: OK
  9879. 1334.67 s [vector] +++ OK, passed 100 tests.
  9880. 1334.67 s [vector] unfoldr: OK
  9881. 1334.67 s [vector] +++ OK, passed 100 tests.
  9882. 1334.67 s [vector] unfoldrN: OK
  9883. 1334.67 s [vector] +++ OK, passed 100 tests.
  9884. 1334.68 s [vector] unfoldrExactN: OK
  9885. 1334.68 s [vector] +++ OK, passed 100 tests.
  9886. 1334.68 s [vector] unfoldrM: OK
  9887. 1334.68 s [vector] +++ OK, passed 100 tests.
  9888. 1334.68 s [vector] unfoldrNM: OK
  9889. 1334.68 s [vector] +++ OK, passed 100 tests.
  9890. 1334.71 s [vector] unfoldrExactNM: OK (0.03s)
  9891. 1334.71 s [vector] +++ OK, passed 100 tests.
  9892. 1334.74 s [vector] constructN: OK (0.01s)
  9893. 1334.74 s [vector] +++ OK, passed 100 tests.
  9894. 1334.75 s [vector] constructrN: OK (0.01s)
  9895. 1334.75 s [vector] +++ OK, passed 100 tests.
  9896. 1334.76 s [vector] cons: OK
  9897. 1334.76 s [vector] +++ OK, passed 100 tests.
  9898. 1334.76 s [vector] snoc: OK
  9899. 1334.76 s [vector] +++ OK, passed 100 tests.
  9900. 1334.76 s [vector] append: OK
  9901. 1334.76 s [vector] +++ OK, passed 100 tests.
  9902. 1334.78 s [vector] concat: OK (0.02s)
  9903. 1334.78 s [vector] +++ OK, passed 100 tests.
  9904. 1334.78 s [vector] force: OK
  9905. 1334.78 s [vector] +++ OK, passed 100 tests.
  9906. 1334.78 s [vector] upd: OK
  9907. 1334.78 s [vector] +++ OK, passed 100 tests.
  9908. 1334.80 s [vector] accum: OK (0.02s)
  9909. 1334.80 s [vector] +++ OK, passed 100 tests.
  9910. 1334.82 s [vector] reverse: OK
  9911. 1334.82 s [vector] +++ OK, passed 100 tests.
  9912. 1334.82 s [vector] backpermute: OK
  9913. 1334.82 s [vector] +++ OK, passed 100 tests.
  9914. 1334.83 s [vector] map: OK
  9915. 1334.84 s [vector] +++ OK, passed 100 tests.
  9916. 1334.84 s [vector] imap: OK
  9917. 1334.84 s [vector] +++ OK, passed 100 tests.
  9918. 1334.84 s [vector] concatMap: OK
  9919. 1334.84 s [vector] +++ OK, passed 100 tests.
  9920. 1334.84 s [vector] mapM: OK
  9921. 1334.84 s [vector] +++ OK, passed 100 tests.
  9922. 1334.88 s [vector] mapM_: OK (0.04s)
  9923. 1334.88 s [vector] +++ OK, passed 100 tests.
  9924. 1334.88 s [vector] forM: OK
  9925. 1334.88 s [vector] +++ OK, passed 100 tests.
  9926. 1334.93 s [vector] forM_: OK (0.04s)
  9927. 1334.94 s [vector] +++ OK, passed 100 tests.
  9928. 1334.94 s [vector] imapM: OK
  9929. 1334.94 s [vector] +++ OK, passed 100 tests.
  9930. 1334.98 s [vector] imapM_: OK (0.04s)
  9931. 1334.98 s [vector] +++ OK, passed 100 tests.
  9932. 1334.98 s [vector] zipWith: OK
  9933. 1334.99 s [vector] +++ OK, passed 100 tests.
  9934. 1334.99 s [vector] zipWith3: OK
  9935. 1334.99 s [vector] +++ OK, passed 100 tests.
  9936. 1335.00 s [vector] izipWith: OK
  9937. 1335.00 s [vector] +++ OK, passed 100 tests.
  9938. 1335.01 s [vector] izipWith3: OK (0.01s)
  9939. 1335.01 s [vector] +++ OK, passed 100 tests.
  9940. 1335.04 s [vector] izipWithM: OK
  9941. 1335.04 s [vector] +++ OK, passed 100 tests.
  9942. 1335.06 s [vector] izipWithM_: OK (0.04s)
  9943. 1335.06 s [vector] +++ OK, passed 100 tests.
  9944. 1335.08 s [vector] zipWithM: OK (0.01s)
  9945. 1335.08 s [vector] +++ OK, passed 100 tests.
  9946. 1335.10 s [vector] zipWithM_: OK (0.03s)
  9947. 1335.10 s [vector] +++ OK, passed 100 tests.
  9948. 1335.10 s [vector] filter: OK
  9949. 1335.10 s [vector] +++ OK, passed 100 tests.
  9950. 1335.11 s [vector] ifilter: OK
  9951. 1335.11 s [vector] +++ OK, passed 100 tests.
  9952. 1335.16 s [vector] filterM: OK (0.05s)
  9953. 1335.17 s [vector] +++ OK, passed 100 tests.
  9954. 1335.17 s [vector] uniq: OK
  9955. 1335.17 s [vector] +++ OK, passed 100 tests.
  9956. 1335.18 s [vector] mapMaybe: OK
  9957. 1335.18 s [vector] +++ OK, passed 100 tests.
  9958. 1335.18 s [vector] imapMaybe: OK
  9959. 1335.18 s [vector] +++ OK, passed 100 tests.
  9960. 1335.18 s [vector] takeWhile: OK
  9961. 1335.19 s [vector] +++ OK, passed 100 tests.
  9962. 1335.19 s [vector] dropWhile: OK
  9963. 1335.20 s [vector] +++ OK, passed 100 tests.
  9964. 1335.20 s [vector] partition: OK
  9965. 1335.20 s [vector] +++ OK, passed 100 tests.
  9966. 1335.21 s [vector] partitionWith: OK (0.01s)
  9967. 1335.21 s [vector] +++ OK, passed 100 tests.
  9968. 1335.22 s [vector] span: OK
  9969. 1335.22 s [vector] +++ OK, passed 100 tests.
  9970. 1335.22 s [vector] break: OK
  9971. 1335.22 s [vector] +++ OK, passed 100 tests.
  9972. 1335.22 s [vector] spanR: OK
  9973. 1335.22 s [vector] +++ OK, passed 100 tests.
  9974. 1335.22 s [vector] breakR: OK
  9975. 1335.24 s [vector] +++ OK, passed 100 tests.
  9976. 1335.24 s [vector] groupBy: OK (0.02s)
  9977. 1335.24 s [vector] +++ OK, passed 100 tests.
  9978. 1335.24 s [vector] elem: OK
  9979. 1335.24 s [vector] +++ OK, passed 100 tests.
  9980. 1335.24 s [vector] notElem: OK
  9981. 1335.24 s [vector] +++ OK, passed 100 tests.
  9982. 1335.24 s [vector] find: OK
  9983. 1335.24 s [vector] +++ OK, passed 100 tests.
  9984. 1335.25 s [vector] findIndex: OK
  9985. 1335.25 s [vector] +++ OK, passed 100 tests.
  9986. 1335.25 s [vector] findIndexR: OK
  9987. 1335.25 s [vector] +++ OK, passed 100 tests.
  9988. 1335.25 s [vector] findIndices: OK
  9989. 1335.25 s [vector] +++ OK, passed 100 tests.
  9990. 1335.25 s [vector] elemIndex: OK
  9991. 1335.26 s [vector] +++ OK, passed 100 tests.
  9992. 1335.26 s [vector] elemIndices: OK
  9993. 1335.26 s [vector] +++ OK, passed 100 tests.
  9994. 1335.28 s [vector] foldl: OK (0.01s)
  9995. 1335.28 s [vector] +++ OK, passed 100 tests.
  9996. 1335.30 s [vector] foldl1: OK (0.01s)
  9997. 1335.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9998. 1335.30 s [vector] foldl': OK (0.01s)
  9999. 1335.31 s [vector] +++ OK, passed 100 tests.
  10000. 1335.32 s [vector] foldl1': OK (0.01s)
  10001. 1335.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10002. 1335.34 s [vector] foldr: OK (0.01s)
  10003. 1335.34 s [vector] +++ OK, passed 100 tests.
  10004. 1335.35 s [vector] foldr1: OK (0.01s)
  10005. 1335.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10006. 1335.36 s [vector] foldr': OK (0.01s)
  10007. 1335.36 s [vector] +++ OK, passed 100 tests.
  10008. 1335.38 s [vector] foldr1': OK (0.01s)
  10009. 1335.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10010. 1335.38 s [vector] ifoldl: OK (0.01s)
  10011. 1335.38 s [vector] +++ OK, passed 100 tests.
  10012. 1335.40 s [vector] ifoldl': OK (0.01s)
  10013. 1335.40 s [vector] +++ OK, passed 100 tests.
  10014. 1335.41 s [vector] ifoldr: OK (0.02s)
  10015. 1335.41 s [vector] +++ OK, passed 100 tests.
  10016. 1335.42 s [vector] ifoldr': OK
  10017. 1335.42 s [vector] +++ OK, passed 100 tests.
  10018. 1335.44 s [vector] ifoldM: OK (0.01s)
  10019. 1335.44 s [vector] +++ OK, passed 100 tests.
  10020. 1335.45 s [vector] ifoldM': OK (0.01s)
  10021. 1335.45 s [vector] +++ OK, passed 100 tests.
  10022. 1335.50 s [vector] ifoldM_: OK (0.03s)
  10023. 1335.50 s [vector] +++ OK, passed 100 tests.
  10024. 1335.53 s [vector] ifoldM'_: OK (0.04s)
  10025. 1335.53 s [vector] +++ OK, passed 100 tests.
  10026. 1335.53 s [vector] all: OK
  10027. 1335.53 s [vector] +++ OK, passed 100 tests.
  10028. 1335.53 s [vector] any: OK
  10029. 1335.53 s [vector] +++ OK, passed 100 tests.
  10030. 1335.55 s [vector] prescanl: OK
  10031. 1335.55 s [vector] +++ OK, passed 100 tests.
  10032. 1335.57 s [vector] prescanl': OK
  10033. 1335.58 s [vector] +++ OK, passed 100 tests.
  10034. 1335.58 s [vector] postscanl: OK (0.01s)
  10035. 1335.58 s [vector] +++ OK, passed 100 tests.
  10036. 1335.60 s [vector] postscanl': OK (0.02s)
  10037. 1335.60 s [vector] +++ OK, passed 100 tests.
  10038. 1335.60 s [vector] scanl: OK (0.02s)
  10039. 1335.60 s [vector] +++ OK, passed 100 tests.
  10040. 1335.62 s [vector] scanl': OK
  10041. 1335.62 s [vector] +++ OK, passed 100 tests.
  10042. 1335.64 s [vector] scanl1: OK (0.01s)
  10043. 1335.64 s [vector] +++ OK, passed 100 tests.
  10044. 1335.66 s [vector] scanl1': OK (0.02s)
  10045. 1335.67 s [vector] +++ OK, passed 100 tests.
  10046. 1335.70 s [vector] iscanl: OK (0.03s)
  10047. 1335.70 s [vector] +++ OK, passed 100 tests.
  10048. 1335.72 s [vector] iscanl': OK (0.02s)
  10049. 1335.72 s [vector] +++ OK, passed 100 tests.
  10050. 1335.73 s [vector] prescanr: OK (0.01s)
  10051. 1335.73 s [vector] +++ OK, passed 100 tests.
  10052. 1335.74 s [vector] prescanr': OK (0.01s)
  10053. 1335.74 s [vector] +++ OK, passed 100 tests.
  10054. 1335.76 s [vector] postscanr: OK (0.01s)
  10055. 1335.76 s [vector] +++ OK, passed 100 tests.
  10056. 1335.78 s [vector] postscanr': OK (0.01s)
  10057. 1335.78 s [vector] +++ OK, passed 100 tests.
  10058. 1335.78 s [vector] scanr: OK (0.01s)
  10059. 1335.78 s [vector] +++ OK, passed 100 tests.
  10060. 1335.79 s [vector] scanr': OK (0.01s)
  10061. 1335.79 s [vector] +++ OK, passed 100 tests.
  10062. 1335.80 s [vector] scanr1: OK
  10063. 1335.80 s [vector] +++ OK, passed 100 tests.
  10064. 1335.82 s [vector] scanr1': OK
  10065. 1335.82 s [vector] +++ OK, passed 100 tests.
  10066. 1335.84 s [vector] iscanr: OK (0.01s)
  10067. 1335.84 s [vector] +++ OK, passed 100 tests.
  10068. 1335.85 s [vector] iscanr': OK (0.02s)
  10069. 1335.85 s [vector] +++ OK, passed 100 tests.
  10070. 1335.85 s [vector] mut_read: OK
  10071. 1335.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10072. 1335.85 s [vector] mut_write: OK
  10073. 1335.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10074. 1335.86 s [vector] mut_modify: OK
  10075. 1335.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10076. 1335.86 s [vector] mut_generate: OK
  10077. 1335.86 s [vector] +++ OK, passed 100 tests.
  10078. 1335.88 s [vector] mut_generateM: OK (0.03s)
  10079. 1335.88 s [vector] +++ OK, passed 100 tests.
  10080. 1335.94 s [vector] mut_mapM_: OK (0.05s)
  10081. 1335.94 s [vector] +++ OK, passed 100 tests.
  10082. 1335.98 s [vector] mut_imapM_: OK (0.05s)
  10083. 1335.98 s [vector] +++ OK, passed 100 tests.
  10084. 1336.02 s [vector] mut_forM_: OK (0.03s)
  10085. 1336.02 s [vector] +++ OK, passed 100 tests.
  10086. 1336.06 s [vector] mut_iforM_: OK (0.04s)
  10087. 1336.06 s [vector] +++ OK, passed 100 tests.
  10088. 1336.08 s [vector] mut_foldr: OK (0.02s)
  10089. 1336.08 s [vector] +++ OK, passed 100 tests.
  10090. 1336.11 s [vector] mut_foldr': OK (0.01s)
  10091. 1336.11 s [vector] +++ OK, passed 100 tests.
  10092. 1336.12 s [vector] mut_foldl: OK (0.04s)
  10093. 1336.12 s [vector] +++ OK, passed 100 tests.
  10094. 1336.13 s [vector] mut_foldl': OK
  10095. 1336.14 s [vector] +++ OK, passed 100 tests.
  10096. 1336.16 s [vector] mut_ifoldr: OK (0.01s)
  10097. 1336.16 s [vector] +++ OK, passed 100 tests.
  10098. 1336.17 s [vector] mut_ifoldr': OK (0.02s)
  10099. 1336.17 s [vector] +++ OK, passed 100 tests.
  10100. 1336.20 s [vector] mut_ifoldl: OK
  10101. 1336.20 s [vector] +++ OK, passed 100 tests.
  10102. 1336.22 s [vector] mut_ifoldl': OK (0.02s)
  10103. 1336.22 s [vector] +++ OK, passed 100 tests.
  10104. 1336.23 s [vector] mut_foldM: OK (0.02s)
  10105. 1336.23 s [vector] +++ OK, passed 100 tests.
  10106. 1336.26 s [vector] mut_foldM': OK
  10107. 1336.26 s [vector] +++ OK, passed 100 tests.
  10108. 1336.28 s [vector] mut_foldrM: OK (0.01s)
  10109. 1336.28 s [vector] +++ OK, passed 100 tests.
  10110. 1336.28 s [vector] mut_foldrM': OK (0.01s)
  10111. 1336.28 s [vector] +++ OK, passed 100 tests.
  10112. 1336.30 s [vector] mut_ifoldM: OK (0.02s)
  10113. 1336.30 s [vector] +++ OK, passed 100 tests.
  10114. 1336.32 s [vector] mut_ifoldM': OK (0.02s)
  10115. 1336.32 s [vector] +++ OK, passed 100 tests.
  10116. 1336.34 s [vector] mut_ifoldrM: OK (0.02s)
  10117. 1336.34 s [vector] +++ OK, passed 100 tests.
  10118. 1336.35 s [vector] mut_ifoldrM': OK (0.02s)
  10119. 1336.35 s [vector] +++ OK, passed 100 tests.
  10120. 1336.35 s [vector] compare: OK
  10121. 1336.35 s [vector] +++ OK, passed 100 tests.
  10122. 1336.35 s [vector] maximum: OK
  10123. 1336.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10124. 1336.36 s [vector] minimum: OK
  10125. 1336.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10126. 1336.36 s [vector] minIndex: OK
  10127. 1336.36 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10128. 1336.37 s [vector] maxIndex: OK
  10129. 1336.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10130. 1336.37 s [vector] maximumBy: OK
  10131. 1336.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10132. 1336.37 s [vector] minimumBy: OK
  10133. 1336.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10134. 1336.37 s [vector] maximumOn: OK
  10135. 1336.37 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10136. 1336.37 s [vector] minimumOn: OK
  10137. 1336.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10138. 1336.37 s [vector] maxIndexBy: OK
  10139. 1336.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10140. 1336.38 s [vector] minIndexBy: OK
  10141. 1336.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10142. 1336.38 s [vector] ListFirstMaxIndexWins: OK
  10143. 1336.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10144. 1336.39 s [vector] FalseListFirstMaxIndexWins: OK
  10145. 1336.39 s [vector] +++ OK, failed as expected. (after 1 test):
  10146. 1336.39 s [vector] Exception:
  10147. 1336.39 s [vector] Prelude.foldr1: empty list
  10148. 1336.39 s [vector] CallStack (from HasCallStack):
  10149. 1336.39 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10150. 1336.39 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10151. 1336.39 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10152. 1336.39 s [vector] []
  10153. 1336.39 s [vector] zip: OK
  10154. 1336.39 s [vector] +++ OK, passed 100 tests.
  10155. 1336.39 s [vector] zip3: OK
  10156. 1336.39 s [vector] +++ OK, passed 100 tests.
  10157. 1336.39 s [vector] unzip: OK
  10158. 1336.39 s [vector] +++ OK, passed 100 tests.
  10159. 1336.39 s [vector] unzip3: OK
  10160. 1336.40 s [vector] +++ OK, passed 100 tests.
  10161. 1336.40 s [vector] indexed: OK
  10162. 1336.40 s [vector] +++ OK, passed 100 tests.
  10163. 1336.41 s [vector] update: OK
  10164. 1336.41 s [vector] +++ OK, passed 100 tests.
  10165. 1336.41 s [vector] mempty: OK
  10166. 1336.41 s [vector] +++ OK, passed 100 tests.
  10167. 1336.41 s [vector] mappend: OK
  10168. 1336.41 s [vector] +++ OK, passed 100 tests.
  10169. 1336.42 s [vector] mconcat: OK (0.03s)
  10170. 1336.42 s [vector] +++ OK, passed 100 tests.
  10171. 1336.42 s [vector] glength: OK
  10172. 1336.42 s [vector] +++ OK, passed 100 tests.
  10173. 1336.42 s [vector] sum: OK
  10174. 1336.42 s [vector] +++ OK, passed 100 tests.
  10175. 1336.42 s [vector] product: OK
  10176. 1336.42 s [vector] +++ OK, passed 100 tests.
  10177. 1336.42 s [vector] enumFromN: OK
  10178. 1336.42 s [vector] +++ OK, passed 100 tests.
  10179. 1336.42 s [vector] enumFromThenN: OK
  10180. 1336.42 s [vector] +++ OK, passed 100 tests.
  10181. 1336.43 s [vector] enumFromTo: OK
  10182. 1336.43 s [vector] +++ OK, passed 100 tests.
  10183. 1336.43 s [vector] enumFromThenTo: OK
  10184. 1336.43 s [vector] +++ OK, passed 100 tests; 2 discarded.
  10185. 1336.43 s [vector] (Int,Bool)
  10186. 1336.43 s [vector] fromList.toList == id: OK
  10187. 1336.43 s [vector] +++ OK, passed 100 tests.
  10188. 1336.43 s [vector] toList.fromList == id: OK
  10189. 1336.43 s [vector] +++ OK, passed 100 tests.
  10190. 1336.43 s [vector] unstream.stream == id: OK
  10191. 1336.43 s [vector] +++ OK, passed 100 tests.
  10192. 1336.43 s [vector] stream.unstream == id: OK
  10193. 1336.43 s [vector] +++ OK, passed 100 tests.
  10194. 1336.44 s [vector] eq: OK
  10195. 1336.44 s [vector] +++ OK, passed 100 tests.
  10196. 1336.44 s [vector] length: OK
  10197. 1336.44 s [vector] +++ OK, passed 100 tests.
  10198. 1336.44 s [vector] null: OK
  10199. 1336.44 s [vector] +++ OK, passed 100 tests.
  10200. 1336.44 s [vector] index: OK
  10201. 1336.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10202. 1336.44 s [vector] safeIndex: OK
  10203. 1336.44 s [vector] +++ OK, passed 100 tests.
  10204. 1336.44 s [vector] head: OK
  10205. 1336.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10206. 1336.44 s [vector] last: OK
  10207. 1336.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10208. 1336.44 s [vector] unsafeIndex: OK
  10209. 1336.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10210. 1336.44 s [vector] unsafeHead: OK
  10211. 1336.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10212. 1336.45 s [vector] unsafeLast: OK
  10213. 1336.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10214. 1336.45 s [vector] slice: OK
  10215. 1336.45 s [vector] +++ OK, passed 100 tests.
  10216. 1336.45 s [vector] init: OK
  10217. 1336.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10218. 1336.45 s [vector] tail: OK
  10219. 1336.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10220. 1336.45 s [vector] take: OK
  10221. 1336.46 s [vector] +++ OK, passed 100 tests.
  10222. 1336.46 s [vector] drop: OK
  10223. 1336.46 s [vector] +++ OK, passed 100 tests.
  10224. 1336.46 s [vector] splitAt: OK
  10225. 1336.46 s [vector] +++ OK, passed 100 tests.
  10226. 1336.46 s [vector] empty: OK
  10227. 1336.46 s [vector] +++ OK, passed 100 tests.
  10228. 1336.46 s [vector] singleton: OK
  10229. 1336.46 s [vector] +++ OK, passed 100 tests.
  10230. 1336.46 s [vector] replicate: OK
  10231. 1336.46 s [vector] +++ OK, passed 100 tests.
  10232. 1336.46 s [vector] generate: OK
  10233. 1336.46 s [vector] +++ OK, passed 100 tests.
  10234. 1336.46 s [vector] iterateN: OK
  10235. 1336.46 s [vector] +++ OK, passed 100 tests.
  10236. 1336.51 s [vector] iterateNM: OK (0.02s)
  10237. 1336.51 s [vector] +++ OK, passed 100 tests.
  10238. 1336.52 s [vector] generateM: OK (0.04s)
  10239. 1336.52 s [vector] +++ OK, passed 100 tests.
  10240. 1336.53 s [vector] replicateM: OK (0.01s)
  10241. 1336.53 s [vector] +++ OK, passed 100 tests.
  10242. 1336.53 s [vector] create: OK
  10243. 1336.53 s [vector] +++ OK, passed 100 tests.
  10244. 1336.53 s [vector] createT: OK
  10245. 1336.53 s [vector] +++ OK, passed 100 tests.
  10246. 1336.53 s [vector] unfoldr: OK
  10247. 1336.53 s [vector] +++ OK, passed 100 tests.
  10248. 1336.54 s [vector] unfoldrN: OK
  10249. 1336.54 s [vector] +++ OK, passed 100 tests.
  10250. 1336.54 s [vector] unfoldrExactN: OK
  10251. 1336.54 s [vector] +++ OK, passed 100 tests.
  10252. 1336.56 s [vector] unfoldrM: OK
  10253. 1336.57 s [vector] +++ OK, passed 100 tests.
  10254. 1336.57 s [vector] unfoldrNM: OK
  10255. 1336.57 s [vector] +++ OK, passed 100 tests.
  10256. 1336.62 s [vector] unfoldrExactNM: OK (0.06s)
  10257. 1336.62 s [vector] +++ OK, passed 100 tests.
  10258. 1336.63 s [vector] constructN: OK
  10259. 1336.63 s [vector] +++ OK, passed 100 tests.
  10260. 1336.63 s [vector] constructrN: OK
  10261. 1336.63 s [vector] +++ OK, passed 100 tests.
  10262. 1336.64 s [vector] cons: OK
  10263. 1336.64 s [vector] +++ OK, passed 100 tests.
  10264. 1336.64 s [vector] snoc: OK
  10265. 1336.64 s [vector] +++ OK, passed 100 tests.
  10266. 1336.64 s [vector] append: OK
  10267. 1336.66 s [vector] +++ OK, passed 100 tests.
  10268. 1336.68 s [vector] concat: OK (0.04s)
  10269. 1336.68 s [vector] +++ OK, passed 100 tests.
  10270. 1336.68 s [vector] force: OK
  10271. 1336.68 s [vector] +++ OK, passed 100 tests.
  10272. 1336.70 s [vector] upd: OK
  10273. 1336.70 s [vector] +++ OK, passed 100 tests.
  10274. 1336.70 s [vector] accum: OK (0.01s)
  10275. 1336.70 s [vector] +++ OK, passed 100 tests.
  10276. 1336.70 s [vector] reverse: OK
  10277. 1336.70 s [vector] +++ OK, passed 100 tests.
  10278. 1336.71 s [vector] backpermute: OK
  10279. 1336.71 s [vector] +++ OK, passed 100 tests.
  10280. 1336.71 s [vector] map: OK
  10281. 1336.71 s [vector] +++ OK, passed 100 tests.
  10282. 1336.71 s [vector] imap: OK
  10283. 1336.72 s [vector] +++ OK, passed 100 tests.
  10284. 1336.73 s [vector] concatMap: OK
  10285. 1336.74 s [vector] +++ OK, passed 100 tests.
  10286. 1336.74 s [vector] mapM: OK
  10287. 1336.74 s [vector] +++ OK, passed 100 tests.
  10288. 1336.77 s [vector] mapM_: OK (0.04s)
  10289. 1336.78 s [vector] +++ OK, passed 100 tests.
  10290. 1336.78 s [vector] forM: OK
  10291. 1336.78 s [vector] +++ OK, passed 100 tests.
  10292. 1336.81 s [vector] forM_: OK (0.03s)
  10293. 1336.82 s [vector] +++ OK, passed 100 tests.
  10294. 1336.82 s [vector] imapM: OK
  10295. 1336.82 s [vector] +++ OK, passed 100 tests.
  10296. 1336.85 s [vector] imapM_: OK (0.04s)
  10297. 1336.85 s [vector] +++ OK, passed 100 tests.
  10298. 1336.85 s [vector] zipWith: OK
  10299. 1336.85 s [vector] +++ OK, passed 100 tests.
  10300. 1336.86 s [vector] zipWith3: OK
  10301. 1336.86 s [vector] +++ OK, passed 100 tests.
  10302. 1336.87 s [vector] izipWith: OK
  10303. 1336.87 s [vector] +++ OK, passed 100 tests.
  10304. 1336.87 s [vector] izipWith3: OK
  10305. 1336.87 s [vector] +++ OK, passed 100 tests.
  10306. 1336.88 s [vector] izipWithM: OK
  10307. 1336.88 s [vector] +++ OK, passed 100 tests.
  10308. 1336.90 s [vector] izipWithM_: OK (0.02s)
  10309. 1336.90 s [vector] +++ OK, passed 100 tests.
  10310. 1336.91 s [vector] zipWithM: OK
  10311. 1336.92 s [vector] +++ OK, passed 100 tests.
  10312. 1336.94 s [vector] zipWithM_: OK (0.03s)
  10313. 1336.94 s [vector] +++ OK, passed 100 tests.
  10314. 1336.94 s [vector] filter: OK
  10315. 1336.94 s [vector] +++ OK, passed 100 tests.
  10316. 1336.96 s [vector] ifilter: OK
  10317. 1336.96 s [vector] +++ OK, passed 100 tests.
  10318. 1337.01 s [vector] filterM: OK (0.06s)
  10319. 1337.01 s [vector] +++ OK, passed 100 tests.
  10320. 1337.02 s [vector] uniq: OK
  10321. 1337.02 s [vector] +++ OK, passed 100 tests.
  10322. 1337.02 s [vector] mapMaybe: OK
  10323. 1337.02 s [vector] +++ OK, passed 100 tests.
  10324. 1337.04 s [vector] imapMaybe: OK (0.01s)
  10325. 1337.04 s [vector] +++ OK, passed 100 tests.
  10326. 1337.05 s [vector] takeWhile: OK
  10327. 1337.05 s [vector] +++ OK, passed 100 tests.
  10328. 1337.05 s [vector] dropWhile: OK
  10329. 1337.05 s [vector] +++ OK, passed 100 tests.
  10330. 1337.06 s [vector] partition: OK
  10331. 1337.06 s [vector] +++ OK, passed 100 tests.
  10332. 1337.06 s [vector] partitionWith: OK
  10333. 1337.06 s [vector] +++ OK, passed 100 tests.
  10334. 1337.06 s [vector] span: OK
  10335. 1337.06 s [vector] +++ OK, passed 100 tests.
  10336. 1337.06 s [vector] break: OK
  10337. 1337.06 s [vector] +++ OK, passed 100 tests.
  10338. 1337.07 s [vector] spanR: OK
  10339. 1337.07 s [vector] +++ OK, passed 100 tests.
  10340. 1337.07 s [vector] breakR: OK
  10341. 1337.07 s [vector] +++ OK, passed 100 tests.
  10342. 1337.07 s [vector] groupBy: OK
  10343. 1337.07 s [vector] +++ OK, passed 100 tests.
  10344. 1337.08 s [vector] elem: OK
  10345. 1337.08 s [vector] +++ OK, passed 100 tests.
  10346. 1337.08 s [vector] notElem: OK
  10347. 1337.08 s [vector] +++ OK, passed 100 tests.
  10348. 1337.08 s [vector] find: OK
  10349. 1337.08 s [vector] +++ OK, passed 100 tests.
  10350. 1337.08 s [vector] findIndex: OK
  10351. 1337.08 s [vector] +++ OK, passed 100 tests.
  10352. 1337.08 s [vector] findIndexR: OK
  10353. 1337.08 s [vector] +++ OK, passed 100 tests.
  10354. 1337.08 s [vector] findIndices: OK
  10355. 1337.08 s [vector] +++ OK, passed 100 tests.
  10356. 1337.08 s [vector] elemIndex: OK
  10357. 1337.08 s [vector] +++ OK, passed 100 tests.
  10358. 1337.09 s [vector] elemIndices: OK
  10359. 1337.10 s [vector] +++ OK, passed 100 tests.
  10360. 1337.10 s [vector] foldl: OK
  10361. 1337.10 s [vector] +++ OK, passed 100 tests.
  10362. 1337.10 s [vector] foldl1: OK
  10363. 1337.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10364. 1337.11 s [vector] foldl': OK
  10365. 1337.11 s [vector] +++ OK, passed 100 tests.
  10366. 1337.11 s [vector] foldl1': OK
  10367. 1337.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10368. 1337.11 s [vector] foldr: OK
  10369. 1337.12 s [vector] +++ OK, passed 100 tests.
  10370. 1337.12 s [vector] foldr1: OK
  10371. 1337.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10372. 1337.13 s [vector] foldr': OK
  10373. 1337.14 s [vector] +++ OK, passed 100 tests.
  10374. 1337.14 s [vector] foldr1': OK
  10375. 1337.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10376. 1337.15 s [vector] ifoldl: OK
  10377. 1337.16 s [vector] +++ OK, passed 100 tests.
  10378. 1337.16 s [vector] ifoldl': OK
  10379. 1337.16 s [vector] +++ OK, passed 100 tests.
  10380. 1337.17 s [vector] ifoldr: OK
  10381. 1337.19 s [vector] +++ OK, passed 100 tests.
  10382. 1337.19 s [vector] ifoldr': OK
  10383. 1337.19 s [vector] +++ OK, passed 100 tests.
  10384. 1337.19 s [vector] ifoldM: OK
  10385. 1337.19 s [vector] +++ OK, passed 100 tests.
  10386. 1337.20 s [vector] ifoldM': OK
  10387. 1337.20 s [vector] +++ OK, passed 100 tests.
  10388. 1337.24 s [vector] ifoldM_: OK (0.04s)
  10389. 1337.24 s [vector] +++ OK, passed 100 tests.
  10390. 1337.26 s [vector] ifoldM'_: OK (0.03s)
  10391. 1337.26 s [vector] +++ OK, passed 100 tests.
  10392. 1337.26 s [vector] all: OK
  10393. 1337.26 s [vector] +++ OK, passed 100 tests.
  10394. 1337.26 s [vector] any: OK
  10395. 1337.26 s [vector] +++ OK, passed 100 tests.
  10396. 1337.28 s [vector] prescanl: OK
  10397. 1337.28 s [vector] +++ OK, passed 100 tests.
  10398. 1337.28 s [vector] prescanl': OK
  10399. 1337.29 s [vector] +++ OK, passed 100 tests.
  10400. 1337.30 s [vector] postscanl: OK
  10401. 1337.30 s [vector] +++ OK, passed 100 tests.
  10402. 1337.30 s [vector] postscanl': OK
  10403. 1337.30 s [vector] +++ OK, passed 100 tests.
  10404. 1337.31 s [vector] scanl: OK
  10405. 1337.31 s [vector] +++ OK, passed 100 tests.
  10406. 1337.31 s [vector] scanl': OK
  10407. 1337.31 s [vector] +++ OK, passed 100 tests.
  10408. 1337.31 s [vector] scanl1: OK
  10409. 1337.31 s [vector] +++ OK, passed 100 tests.
  10410. 1337.31 s [vector] scanl1': OK
  10411. 1337.31 s [vector] +++ OK, passed 100 tests.
  10412. 1337.32 s [vector] iscanl: OK
  10413. 1337.32 s [vector] +++ OK, passed 100 tests.
  10414. 1337.32 s [vector] iscanl': OK
  10415. 1337.32 s [vector] +++ OK, passed 100 tests.
  10416. 1337.33 s [vector] prescanr: OK
  10417. 1337.34 s [vector] +++ OK, passed 100 tests.
  10418. 1337.34 s [vector] prescanr': OK
  10419. 1337.34 s [vector] +++ OK, passed 100 tests.
  10420. 1337.34 s [vector] postscanr: OK
  10421. 1337.34 s [vector] +++ OK, passed 100 tests.
  10422. 1337.35 s [vector] postscanr': OK
  10423. 1337.36 s [vector] +++ OK, passed 100 tests.
  10424. 1337.37 s [vector] scanr: OK
  10425. 1337.37 s [vector] +++ OK, passed 100 tests.
  10426. 1337.37 s [vector] scanr': OK
  10427. 1337.37 s [vector] +++ OK, passed 100 tests.
  10428. 1337.37 s [vector] scanr1: OK
  10429. 1337.37 s [vector] +++ OK, passed 100 tests.
  10430. 1337.38 s [vector] scanr1': OK
  10431. 1337.38 s [vector] +++ OK, passed 100 tests.
  10432. 1337.38 s [vector] iscanr: OK
  10433. 1337.38 s [vector] +++ OK, passed 100 tests.
  10434. 1337.38 s [vector] iscanr': OK
  10435. 1337.38 s [vector] +++ OK, passed 100 tests.
  10436. 1337.39 s [vector] mut_read: OK
  10437. 1337.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10438. 1337.39 s [vector] mut_write: OK
  10439. 1337.39 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10440. 1337.39 s [vector] mut_modify: OK
  10441. 1337.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10442. 1337.40 s [vector] mut_generate: OK
  10443. 1337.40 s [vector] +++ OK, passed 100 tests.
  10444. 1337.42 s [vector] mut_generateM: OK (0.02s)
  10445. 1337.42 s [vector] +++ OK, passed 100 tests.
  10446. 1337.44 s [vector] mut_mapM_: OK (0.04s)
  10447. 1337.44 s [vector] +++ OK, passed 100 tests.
  10448. 1337.48 s [vector] mut_imapM_: OK (0.01s)
  10449. 1337.48 s [vector] +++ OK, passed 100 tests.
  10450. 1337.50 s [vector] mut_forM_: OK (0.02s)
  10451. 1337.50 s [vector] +++ OK, passed 100 tests.
  10452. 1337.53 s [vector] mut_iforM_: OK (0.02s)
  10453. 1337.53 s [vector] +++ OK, passed 100 tests.
  10454. 1337.54 s [vector] mut_foldr: OK
  10455. 1337.54 s [vector] +++ OK, passed 100 tests.
  10456. 1337.54 s [vector] mut_foldr': OK
  10457. 1337.54 s [vector] +++ OK, passed 100 tests.
  10458. 1337.54 s [vector] mut_foldl: OK
  10459. 1337.54 s [vector] +++ OK, passed 100 tests.
  10460. 1337.55 s [vector] mut_foldl': OK
  10461. 1337.55 s [vector] +++ OK, passed 100 tests.
  10462. 1337.56 s [vector] mut_ifoldr: OK
  10463. 1337.56 s [vector] +++ OK, passed 100 tests.
  10464. 1337.56 s [vector] mut_ifoldr': OK
  10465. 1337.56 s [vector] +++ OK, passed 100 tests.
  10466. 1337.56 s [vector] mut_ifoldl: OK
  10467. 1337.56 s [vector] +++ OK, passed 100 tests.
  10468. 1337.57 s [vector] mut_ifoldl': OK
  10469. 1337.57 s [vector] +++ OK, passed 100 tests.
  10470. 1337.58 s [vector] mut_foldM: OK
  10471. 1337.58 s [vector] +++ OK, passed 100 tests.
  10472. 1337.58 s [vector] mut_foldM': OK
  10473. 1337.58 s [vector] +++ OK, passed 100 tests.
  10474. 1337.58 s [vector] mut_foldrM: OK
  10475. 1337.58 s [vector] +++ OK, passed 100 tests.
  10476. 1337.59 s [vector] mut_foldrM': OK
  10477. 1337.60 s [vector] +++ OK, passed 100 tests.
  10478. 1337.60 s [vector] mut_ifoldM: OK
  10479. 1337.60 s [vector] +++ OK, passed 100 tests.
  10480. 1337.60 s [vector] mut_ifoldM': OK
  10481. 1337.61 s [vector] +++ OK, passed 100 tests.
  10482. 1337.61 s [vector] mut_ifoldrM: OK
  10483. 1337.62 s [vector] +++ OK, passed 100 tests.
  10484. 1337.62 s [vector] mut_ifoldrM': OK
  10485. 1337.62 s [vector] +++ OK, passed 100 tests.
  10486. 1337.62 s [vector] compare: OK
  10487. 1337.62 s [vector] +++ OK, passed 100 tests.
  10488. 1337.62 s [vector] maximum: OK
  10489. 1337.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10490. 1337.62 s [vector] minimum: OK
  10491. 1337.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10492. 1337.62 s [vector] minIndex: OK
  10493. 1337.62 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10494. 1337.62 s [vector] maxIndex: OK
  10495. 1337.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10496. 1337.62 s [vector] maximumBy: OK
  10497. 1337.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10498. 1337.62 s [vector] minimumBy: OK
  10499. 1337.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10500. 1337.62 s [vector] maximumOn: OK
  10501. 1337.62 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10502. 1337.62 s [vector] minimumOn: OK
  10503. 1337.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10504. 1337.62 s [vector] maxIndexBy: OK
  10505. 1337.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10506. 1337.63 s [vector] minIndexBy: OK
  10507. 1337.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10508. 1337.63 s [vector] ListFirstMaxIndexWins: OK
  10509. 1337.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10510. 1337.63 s [vector] FalseListFirstMaxIndexWins: OK
  10511. 1337.63 s [vector] +++ OK, failed as expected. (after 1 test):
  10512. 1337.63 s [vector] Exception:
  10513. 1337.63 s [vector] Prelude.foldr1: empty list
  10514. 1337.63 s [vector] CallStack (from HasCallStack):
  10515. 1337.63 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10516. 1337.63 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10517. 1337.63 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10518. 1337.63 s [vector] []
  10519. 1337.63 s [vector] zip: OK
  10520. 1337.64 s [vector] +++ OK, passed 100 tests.
  10521. 1337.64 s [vector] zip3: OK
  10522. 1337.64 s [vector] +++ OK, passed 100 tests.
  10523. 1337.65 s [vector] unzip: OK
  10524. 1337.65 s [vector] +++ OK, passed 100 tests.
  10525. 1337.65 s [vector] unzip3: OK
  10526. 1337.65 s [vector] +++ OK, passed 100 tests.
  10527. 1337.65 s [vector] indexed: OK
  10528. 1337.65 s [vector] +++ OK, passed 100 tests.
  10529. 1337.65 s [vector] update: OK
  10530. 1337.65 s [vector] +++ OK, passed 100 tests.
  10531. 1337.65 s [vector] mempty: OK
  10532. 1337.66 s [vector] +++ OK, passed 100 tests.
  10533. 1337.66 s [vector] mappend: OK
  10534. 1337.66 s [vector] +++ OK, passed 100 tests.
  10535. 1337.70 s [vector] mconcat: OK (0.03s)
  10536. 1337.70 s [vector] +++ OK, passed 100 tests.
  10537. 1337.70 s [vector] glength: OK
  10538. 1337.70 s [vector] +++ OK, passed 100 tests.
  10539. 1337.70 s [vector] (Int,Bool,Int)
  10540. 1337.70 s [vector] fromList.toList == id: OK
  10541. 1337.70 s [vector] +++ OK, passed 100 tests.
  10542. 1337.70 s [vector] toList.fromList == id: OK
  10543. 1337.70 s [vector] +++ OK, passed 100 tests.
  10544. 1337.70 s [vector] unstream.stream == id: OK
  10545. 1337.70 s [vector] +++ OK, passed 100 tests.
  10546. 1337.70 s [vector] stream.unstream == id: OK
  10547. 1337.70 s [vector] +++ OK, passed 100 tests.
  10548. 1337.70 s [vector] eq: OK
  10549. 1337.70 s [vector] +++ OK, passed 100 tests.
  10550. 1337.71 s [vector] length: OK
  10551. 1337.71 s [vector] +++ OK, passed 100 tests.
  10552. 1337.71 s [vector] null: OK
  10553. 1337.71 s [vector] +++ OK, passed 100 tests.
  10554. 1337.71 s [vector] index: OK
  10555. 1337.71 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10556. 1337.71 s [vector] safeIndex: OK
  10557. 1337.71 s [vector] +++ OK, passed 100 tests.
  10558. 1337.71 s [vector] head: OK
  10559. 1337.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10560. 1337.71 s [vector] last: OK
  10561. 1337.71 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10562. 1337.71 s [vector] unsafeIndex: OK
  10563. 1337.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10564. 1337.71 s [vector] unsafeHead: OK
  10565. 1337.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10566. 1337.72 s [vector] unsafeLast: OK
  10567. 1337.72 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10568. 1337.72 s [vector] slice: OK
  10569. 1337.72 s [vector] +++ OK, passed 100 tests.
  10570. 1337.72 s [vector] init: OK
  10571. 1337.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10572. 1337.72 s [vector] tail: OK
  10573. 1337.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10574. 1337.72 s [vector] take: OK
  10575. 1337.72 s [vector] +++ OK, passed 100 tests.
  10576. 1337.72 s [vector] drop: OK
  10577. 1337.73 s [vector] +++ OK, passed 100 tests.
  10578. 1337.73 s [vector] splitAt: OK
  10579. 1337.73 s [vector] +++ OK, passed 100 tests.
  10580. 1337.73 s [vector] empty: OK
  10581. 1337.73 s [vector] +++ OK, passed 100 tests.
  10582. 1337.73 s [vector] singleton: OK
  10583. 1337.73 s [vector] +++ OK, passed 100 tests.
  10584. 1337.73 s [vector] replicate: OK
  10585. 1337.73 s [vector] +++ OK, passed 100 tests.
  10586. 1337.73 s [vector] generate: OK
  10587. 1337.73 s [vector] +++ OK, passed 100 tests.
  10588. 1337.74 s [vector] iterateN: OK
  10589. 1337.74 s [vector] +++ OK, passed 100 tests.
  10590. 1337.78 s [vector] iterateNM: OK (0.04s)
  10591. 1337.78 s [vector] +++ OK, passed 100 tests.
  10592. 1337.82 s [vector] generateM: OK (0.04s)
  10593. 1337.82 s [vector] +++ OK, passed 100 tests.
  10594. 1337.84 s [vector] replicateM: OK (0.02s)
  10595. 1337.84 s [vector] +++ OK, passed 100 tests.
  10596. 1337.84 s [vector] create: OK
  10597. 1337.84 s [vector] +++ OK, passed 100 tests.
  10598. 1337.84 s [vector] createT: OK
  10599. 1337.84 s [vector] +++ OK, passed 100 tests.
  10600. 1337.84 s [vector] unfoldr: OK
  10601. 1337.84 s [vector] +++ OK, passed 100 tests.
  10602. 1337.84 s [vector] unfoldrN: OK
  10603. 1337.84 s [vector] +++ OK, passed 100 tests.
  10604. 1337.84 s [vector] unfoldrExactN: OK
  10605. 1337.85 s [vector] +++ OK, passed 100 tests.
  10606. 1337.86 s [vector] unfoldrM: OK (0.01s)
  10607. 1337.86 s [vector] +++ OK, passed 100 tests.
  10608. 1337.88 s [vector] unfoldrNM: OK (0.01s)
  10609. 1337.89 s [vector] +++ OK, passed 100 tests.
  10610. 1337.93 s [vector] unfoldrExactNM: OK (0.06s)
  10611. 1337.94 s [vector] +++ OK, passed 100 tests.
  10612. 1337.94 s [vector] constructN: OK (0.01s)
  10613. 1337.94 s [vector] +++ OK, passed 100 tests.
  10614. 1337.94 s [vector] constructrN: OK
  10615. 1337.94 s [vector] +++ OK, passed 100 tests.
  10616. 1337.94 s [vector] cons: OK
  10617. 1337.95 s [vector] +++ OK, passed 100 tests.
  10618. 1337.95 s [vector] snoc: OK
  10619. 1337.95 s [vector] +++ OK, passed 100 tests.
  10620. 1337.95 s [vector] append: OK
  10621. 1337.96 s [vector] +++ OK, passed 100 tests.
  10622. 1338.01 s [vector] concat: OK (0.06s)
  10623. 1338.01 s [vector] +++ OK, passed 100 tests.
  10624. 1338.13 s [vector] force: OK
  10625. 1338.13 s [vector] +++ OK, passed 100 tests.
  10626. 1338.13 s [vector] upd: OK
  10627. 1338.13 s [vector] +++ OK, passed 100 tests.
  10628. 1338.13 s [vector] accum: OK (0.01s)
  10629. 1338.13 s [vector] +++ OK, passed 100 tests.
  10630. 1338.13 s [vector] reverse: OK
  10631. 1338.13 s [vector] +++ OK, passed 100 tests.
  10632. 1338.13 s [vector] backpermute: OK
  10633. 1338.13 s [vector] +++ OK, passed 100 tests.
  10634. 1338.13 s [vector] map: OK
  10635. 1338.13 s [vector] +++ OK, passed 100 tests.
  10636. 1338.13 s [vector] imap: OK
  10637. 1338.13 s [vector] +++ OK, passed 100 tests.
  10638. 1338.13 s [vector] concatMap: OK
  10639. 1338.13 s [vector] +++ OK, passed 100 tests.
  10640. 1338.13 s [vector] mapM: OK
  10641. 1338.13 s [vector] +++ OK, passed 100 tests.
  10642. 1338.13 s [vector] mapM_: OK (0.05s)
  10643. 1338.13 s [vector] +++ OK, passed 100 tests.
  10644. 1338.14 s [vector] forM: OK (0.02s)
  10645. 1338.14 s [vector] +++ OK, passed 100 tests.
  10646. 1338.18 s [vector] forM_: OK (0.05s)
  10647. 1338.18 s [vector] +++ OK, passed 100 tests.
  10648. 1338.20 s [vector] imapM: OK
  10649. 1338.20 s [vector] +++ OK, passed 100 tests.
  10650. 1338.24 s [vector] imapM_: OK (0.04s)
  10651. 1338.24 s [vector] +++ OK, passed 100 tests.
  10652. 1338.24 s [vector] zipWith: OK
  10653. 1338.24 s [vector] +++ OK, passed 100 tests.
  10654. 1338.25 s [vector] zipWith3: OK
  10655. 1338.25 s [vector] +++ OK, passed 100 tests.
  10656. 1338.25 s [vector] izipWith: OK
  10657. 1338.25 s [vector] +++ OK, passed 100 tests.
  10658. 1338.26 s [vector] izipWith3: OK
  10659. 1338.26 s [vector] +++ OK, passed 100 tests.
  10660. 1338.27 s [vector] izipWithM: OK
  10661. 1338.27 s [vector] +++ OK, passed 100 tests.
  10662. 1338.31 s [vector] izipWithM_: OK (0.03s)
  10663. 1338.31 s [vector] +++ OK, passed 100 tests.
  10664. 1338.32 s [vector] zipWithM: OK
  10665. 1338.32 s [vector] +++ OK, passed 100 tests.
  10666. 1338.35 s [vector] zipWithM_: OK (0.03s)
  10667. 1338.35 s [vector] +++ OK, passed 100 tests.
  10668. 1338.36 s [vector] filter: OK
  10669. 1338.36 s [vector] +++ OK, passed 100 tests.
  10670. 1338.36 s [vector] ifilter: OK
  10671. 1338.36 s [vector] +++ OK, passed 100 tests.
  10672. 1338.43 s [vector] filterM: OK (0.07s)
  10673. 1338.43 s [vector] +++ OK, passed 100 tests.
  10674. 1338.43 s [vector] uniq: OK
  10675. 1338.43 s [vector] +++ OK, passed 100 tests.
  10676. 1338.44 s [vector] mapMaybe: OK
  10677. 1338.44 s [vector] +++ OK, passed 100 tests.
  10678. 1338.44 s [vector] imapMaybe: OK
  10679. 1338.44 s [vector] +++ OK, passed 100 tests.
  10680. 1338.44 s [vector] takeWhile: OK
  10681. 1338.44 s [vector] +++ OK, passed 100 tests.
  10682. 1338.45 s [vector] dropWhile: OK
  10683. 1338.45 s [vector] +++ OK, passed 100 tests.
  10684. 1338.46 s [vector] partition: OK
  10685. 1338.46 s [vector] +++ OK, passed 100 tests.
  10686. 1338.46 s [vector] partitionWith: OK
  10687. 1338.46 s [vector] +++ OK, passed 100 tests.
  10688. 1338.46 s [vector] span: OK
  10689. 1338.46 s [vector] +++ OK, passed 100 tests.
  10690. 1338.46 s [vector] break: OK
  10691. 1338.46 s [vector] +++ OK, passed 100 tests.
  10692. 1338.46 s [vector] spanR: OK
  10693. 1338.46 s [vector] +++ OK, passed 100 tests.
  10694. 1338.47 s [vector] breakR: OK
  10695. 1338.47 s [vector] +++ OK, passed 100 tests.
  10696. 1338.47 s [vector] groupBy: OK
  10697. 1338.47 s [vector] +++ OK, passed 100 tests.
  10698. 1338.47 s [vector] elem: OK
  10699. 1338.47 s [vector] +++ OK, passed 100 tests.
  10700. 1338.48 s [vector] notElem: OK
  10701. 1338.48 s [vector] +++ OK, passed 100 tests.
  10702. 1338.48 s [vector] find: OK
  10703. 1338.48 s [vector] +++ OK, passed 100 tests.
  10704. 1338.48 s [vector] findIndex: OK
  10705. 1338.48 s [vector] +++ OK, passed 100 tests.
  10706. 1338.48 s [vector] findIndexR: OK
  10707. 1338.48 s [vector] +++ OK, passed 100 tests.
  10708. 1338.48 s [vector] findIndices: OK
  10709. 1338.48 s [vector] +++ OK, passed 100 tests.
  10710. 1338.48 s [vector] elemIndex: OK
  10711. 1338.49 s [vector] +++ OK, passed 100 tests.
  10712. 1338.49 s [vector] elemIndices: OK
  10713. 1338.49 s [vector] +++ OK, passed 100 tests.
  10714. 1338.50 s [vector] foldl: OK
  10715. 1338.50 s [vector] +++ OK, passed 100 tests.
  10716. 1338.50 s [vector] foldl1: OK
  10717. 1338.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10718. 1338.51 s [vector] foldl': OK
  10719. 1338.51 s [vector] +++ OK, passed 100 tests.
  10720. 1338.51 s [vector] foldl1': OK
  10721. 1338.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10722. 1338.53 s [vector] foldr: OK
  10723. 1338.53 s [vector] +++ OK, passed 100 tests.
  10724. 1338.53 s [vector] foldr1: OK
  10725. 1338.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10726. 1338.54 s [vector] foldr': OK
  10727. 1338.54 s [vector] +++ OK, passed 100 tests.
  10728. 1338.55 s [vector] foldr1': OK
  10729. 1338.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10730. 1338.56 s [vector] ifoldl: OK
  10731. 1338.56 s [vector] +++ OK, passed 100 tests.
  10732. 1338.56 s [vector] ifoldl': OK
  10733. 1338.56 s [vector] +++ OK, passed 100 tests.
  10734. 1338.57 s [vector] ifoldr: OK
  10735. 1338.58 s [vector] +++ OK, passed 100 tests.
  10736. 1338.58 s [vector] ifoldr': OK
  10737. 1338.58 s [vector] +++ OK, passed 100 tests.
  10738. 1338.59 s [vector] ifoldM: OK
  10739. 1338.60 s [vector] +++ OK, passed 100 tests.
  10740. 1338.60 s [vector] ifoldM': OK
  10741. 1338.60 s [vector] +++ OK, passed 100 tests.
  10742. 1338.64 s [vector] ifoldM_: OK (0.05s)
  10743. 1338.64 s [vector] +++ OK, passed 100 tests.
  10744. 1338.70 s [vector] ifoldM'_: OK (0.03s)
  10745. 1338.70 s [vector] +++ OK, passed 100 tests.
  10746. 1338.70 s [vector] all: OK
  10747. 1338.70 s [vector] +++ OK, passed 100 tests.
  10748. 1338.70 s [vector] any: OK
  10749. 1338.70 s [vector] +++ OK, passed 100 tests.
  10750. 1338.72 s [vector] prescanl: OK
  10751. 1338.72 s [vector] +++ OK, passed 100 tests.
  10752. 1338.72 s [vector] prescanl': OK (0.01s)
  10753. 1338.72 s [vector] +++ OK, passed 100 tests.
  10754. 1338.74 s [vector] postscanl: OK (0.01s)
  10755. 1338.74 s [vector] +++ OK, passed 100 tests.
  10756. 1338.74 s [vector] postscanl': OK
  10757. 1338.74 s [vector] +++ OK, passed 100 tests.
  10758. 1338.75 s [vector] scanl: OK
  10759. 1338.75 s [vector] +++ OK, passed 100 tests.
  10760. 1338.76 s [vector] scanl': OK
  10761. 1338.76 s [vector] +++ OK, passed 100 tests.
  10762. 1338.77 s [vector] scanl1: OK
  10763. 1338.77 s [vector] +++ OK, passed 100 tests.
  10764. 1338.78 s [vector] scanl1': OK
  10765. 1338.78 s [vector] +++ OK, passed 100 tests.
  10766. 1338.79 s [vector] iscanl: OK
  10767. 1338.79 s [vector] +++ OK, passed 100 tests.
  10768. 1338.79 s [vector] iscanl': OK
  10769. 1338.79 s [vector] +++ OK, passed 100 tests.
  10770. 1338.80 s [vector] prescanr: OK
  10771. 1338.80 s [vector] +++ OK, passed 100 tests.
  10772. 1338.81 s [vector] prescanr': OK
  10773. 1338.81 s [vector] +++ OK, passed 100 tests.
  10774. 1338.82 s [vector] postscanr: OK
  10775. 1338.82 s [vector] +++ OK, passed 100 tests.
  10776. 1338.83 s [vector] postscanr': OK
  10777. 1338.84 s [vector] +++ OK, passed 100 tests.
  10778. 1338.84 s [vector] scanr: OK
  10779. 1338.84 s [vector] +++ OK, passed 100 tests.
  10780. 1338.85 s [vector] scanr': OK
  10781. 1338.85 s [vector] +++ OK, passed 100 tests.
  10782. 1338.86 s [vector] scanr1: OK
  10783. 1338.86 s [vector] +++ OK, passed 100 tests.
  10784. 1338.87 s [vector] scanr1': OK
  10785. 1338.88 s [vector] +++ OK, passed 100 tests.
  10786. 1338.88 s [vector] iscanr: OK
  10787. 1338.88 s [vector] +++ OK, passed 100 tests.
  10788. 1338.88 s [vector] iscanr': OK
  10789. 1338.88 s [vector] +++ OK, passed 100 tests.
  10790. 1338.88 s [vector] mut_read: OK
  10791. 1338.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10792. 1338.89 s [vector] mut_write: OK
  10793. 1338.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10794. 1338.89 s [vector] mut_modify: OK
  10795. 1338.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10796. 1338.90 s [vector] mut_generate: OK
  10797. 1338.90 s [vector] +++ OK, passed 100 tests.
  10798. 1338.94 s [vector] mut_generateM: OK (0.04s)
  10799. 1338.94 s [vector] +++ OK, passed 100 tests.
  10800. 1339.00 s [vector] mut_mapM_: OK (0.05s)
  10801. 1339.00 s [vector] +++ OK, passed 100 tests.
  10802. 1339.04 s [vector] mut_imapM_: OK (0.05s)
  10803. 1339.04 s [vector] +++ OK, passed 100 tests.
  10804. 1339.10 s [vector] mut_forM_: OK (0.05s)
  10805. 1339.10 s [vector] +++ OK, passed 100 tests.
  10806. 1339.14 s [vector] mut_iforM_: OK (0.05s)
  10807. 1339.14 s [vector] +++ OK, passed 100 tests.
  10808. 1339.14 s [vector] mut_foldr: OK
  10809. 1339.14 s [vector] +++ OK, passed 100 tests.
  10810. 1339.15 s [vector] mut_foldr': OK
  10811. 1339.16 s [vector] +++ OK, passed 100 tests.
  10812. 1339.16 s [vector] mut_foldl: OK
  10813. 1339.17 s [vector] +++ OK, passed 100 tests.
  10814. 1339.18 s [vector] mut_foldl': OK
  10815. 1339.18 s [vector] +++ OK, passed 100 tests.
  10816. 1339.18 s [vector] mut_ifoldr: OK
  10817. 1339.18 s [vector] +++ OK, passed 100 tests.
  10818. 1339.18 s [vector] mut_ifoldr': OK
  10819. 1339.18 s [vector] +++ OK, passed 100 tests.
  10820. 1339.19 s [vector] mut_ifoldl: OK
  10821. 1339.19 s [vector] +++ OK, passed 100 tests.
  10822. 1339.20 s [vector] mut_ifoldl': OK
  10823. 1339.20 s [vector] +++ OK, passed 100 tests.
  10824. 1339.21 s [vector] mut_foldM: OK
  10825. 1339.21 s [vector] +++ OK, passed 100 tests.
  10826. 1339.22 s [vector] mut_foldM': OK
  10827. 1339.22 s [vector] +++ OK, passed 100 tests.
  10828. 1339.22 s [vector] mut_foldrM: OK
  10829. 1339.22 s [vector] +++ OK, passed 100 tests.
  10830. 1339.23 s [vector] mut_foldrM': OK
  10831. 1339.24 s [vector] +++ OK, passed 100 tests.
  10832. 1339.24 s [vector] mut_ifoldM: OK
  10833. 1339.24 s [vector] +++ OK, passed 100 tests.
  10834. 1339.24 s [vector] mut_ifoldM': OK
  10835. 1339.24 s [vector] +++ OK, passed 100 tests.
  10836. 1339.26 s [vector] mut_ifoldrM: OK (0.02s)
  10837. 1339.26 s [vector] +++ OK, passed 100 tests.
  10838. 1339.27 s [vector] mut_ifoldrM': OK
  10839. 1339.27 s [vector] +++ OK, passed 100 tests.
  10840. 1339.27 s [vector] compare: OK
  10841. 1339.27 s [vector] +++ OK, passed 100 tests.
  10842. 1339.27 s [vector] maximum: OK
  10843. 1339.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10844. 1339.27 s [vector] minimum: OK
  10845. 1339.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10846. 1339.27 s [vector] minIndex: OK
  10847. 1339.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10848. 1339.28 s [vector] maxIndex: OK
  10849. 1339.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10850. 1339.28 s [vector] maximumBy: OK
  10851. 1339.28 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10852. 1339.28 s [vector] minimumBy: OK
  10853. 1339.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10854. 1339.28 s [vector] maximumOn: OK
  10855. 1339.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10856. 1339.28 s [vector] minimumOn: OK
  10857. 1339.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10858. 1339.28 s [vector] maxIndexBy: OK
  10859. 1339.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10860. 1339.29 s [vector] minIndexBy: OK
  10861. 1339.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10862. 1339.29 s [vector] ListFirstMaxIndexWins: OK
  10863. 1339.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10864. 1339.29 s [vector] FalseListFirstMaxIndexWins: OK
  10865. 1339.29 s [vector] +++ OK, failed as expected. (after 1 test):
  10866. 1339.29 s [vector] Exception:
  10867. 1339.29 s [vector] Prelude.foldr1: empty list
  10868. 1339.29 s [vector] CallStack (from HasCallStack):
  10869. 1339.30 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10870. 1339.30 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10871. 1339.30 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10872. 1339.30 s [vector] []
  10873. 1339.30 s [vector] zip: OK
  10874. 1339.31 s [vector] +++ OK, passed 100 tests.
  10875. 1339.31 s [vector] zip3: OK
  10876. 1339.31 s [vector] +++ OK, passed 100 tests.
  10877. 1339.31 s [vector] unzip: OK
  10878. 1339.31 s [vector] +++ OK, passed 100 tests.
  10879. 1339.32 s [vector] unzip3: OK
  10880. 1339.32 s [vector] +++ OK, passed 100 tests.
  10881. 1339.32 s [vector] indexed: OK
  10882. 1339.32 s [vector] +++ OK, passed 100 tests.
  10883. 1339.32 s [vector] update: OK
  10884. 1339.32 s [vector] +++ OK, passed 100 tests.
  10885. 1339.32 s [vector] mempty: OK
  10886. 1339.33 s [vector] +++ OK, passed 100 tests.
  10887. 1339.33 s [vector] mappend: OK
  10888. 1339.34 s [vector] +++ OK, passed 100 tests.
  10889. 1339.38 s [vector] mconcat: OK (0.05s)
  10890. 1339.38 s [vector] +++ OK, passed 100 tests.
  10891. 1339.38 s [vector] glength: OK
  10892. 1339.38 s [vector] +++ OK, passed 100 tests.
  10893. 1339.38 s [vector] unstream
  10894. 1339.39 s [vector] unstream == vunstream (exact): OK
  10895. 1339.39 s [vector] +++ OK, passed 100 tests.
  10896. 1339.39 s [vector] unstream == vunstream (unknown): OK
  10897. 1339.39 s [vector] +++ OK, passed 100 tests.
  10898. 1339.39 s [vector] unstreamR ~= vunstream (exact): OK
  10899. 1339.39 s [vector] +++ OK, passed 100 tests.
  10900. 1339.39 s [vector] unstreamR ~= vunstream (unknown): OK
  10901. 1339.39 s [vector] +++ OK, passed 100 tests.
  10902. 1339.39 s [vector] Data.Vector.Storable.Vector Alignment
  10903. 1339.39 s [vector] Aligned Double: OK
  10904. 1339.39 s [vector] Aligned Int: OK
  10905. 1339.39 s [vector] Regression tests
  10906. 1339.39 s [vector] enumFromTo crash #188
  10907. 1339.39 s [vector] Word8: OK
  10908. 1339.39 s [vector] Word16: OK
  10909. 1339.39 s [vector] Word32: OK
  10910. 1339.39 s [vector] Word64: OK
  10911. 1339.39 s [vector] Word: OK
  10912. 1339.39 s [vector] Int8: OK
  10913. 1339.39 s [vector] Int16: OK
  10914. 1339.39 s [vector] Int32: OK
  10915. 1339.39 s [vector] Int64: OK
  10916. 1339.39 s [vector] Int: OK
  10917. 1339.39 s [vector] Char: OK
  10918. 1339.39 s [vector] Negative tests
  10919. 1339.39 s [vector] slice out of bounds #257
  10920. 1339.39 s [vector] Boxed
  10921. 1339.39 s [vector] Negative ix: OK
  10922. 1339.39 s [vector] Negative size: OK
  10923. 1339.39 s [vector] Negative ix and size: OK
  10924. 1339.39 s [vector] Too large ix: OK
  10925. 1339.39 s [vector] Too large size: OK
  10926. 1339.39 s [vector] Too large ix and size: OK
  10927. 1339.39 s [vector] Overflow: OK
  10928. 1339.39 s [vector] OutOfMemory: OK
  10929. 1339.39 s [vector] Primitive
  10930. 1339.39 s [vector] Negative ix: OK
  10931. 1339.39 s [vector] Negative size: OK
  10932. 1339.39 s [vector] Negative ix and size: OK
  10933. 1339.39 s [vector] Too large ix: OK
  10934. 1339.39 s [vector] Too large size: OK
  10935. 1339.39 s [vector] Too large ix and size: OK
  10936. 1339.39 s [vector] Overflow: OK
  10937. 1339.39 s [vector] OutOfMemory: OK
  10938. 1339.39 s [vector] Storable
  10939. 1339.39 s [vector] Negative ix: OK
  10940. 1339.39 s [vector] Negative size: OK
  10941. 1339.39 s [vector] Negative ix and size: OK
  10942. 1339.39 s [vector] Too large ix: OK
  10943. 1339.39 s [vector] Too large size: OK
  10944. 1339.39 s [vector] Too large ix and size: OK
  10945. 1339.39 s [vector] Overflow: OK
  10946. 1339.39 s [vector] OutOfMemory: OK
  10947. 1339.39 s [vector] Unboxed
  10948. 1339.39 s [vector] Negative ix: OK
  10949. 1339.39 s [vector] Negative size: OK
  10950. 1339.39 s [vector] Negative ix and size: OK
  10951. 1339.39 s [vector] Too large ix: OK
  10952. 1339.39 s [vector] Too large size: OK
  10953. 1339.39 s [vector] Too large ix and size: OK
  10954. 1339.39 s [vector] Overflow: OK
  10955. 1339.39 s [vector] OutOfMemory: OK
  10956. 1339.39 s [vector] take #282
  10957. 1339.39 s [vector] Boxed: OK
  10958. 1339.39 s [vector] Primitive: OK
  10959. 1339.39 s [vector] Storable: OK
  10960. 1339.39 s [vector] Unboxed: OK
  10961. 1339.39 s [vector] Data.Vector
  10962. 1339.39 s [vector] MonadFix: OK
  10963. 1339.39 s [vector] toFromArray: OK
  10964. 1339.39 s [vector] toFromArraySlice: OK
  10965. 1339.39 s [vector] toFromArraySliceUnsafe: OK
  10966. 1339.39 s [vector] toFromMutableArray: OK
  10967. 1339.39 s [vector] Data.Vector.Mutable (Move): OK
  10968. 1339.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10969. 1339.40 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  10970. 1339.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10971. 1339.40 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  10972. 1339.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10973. 1339.40 s [vector] Data.Vector.Storable.Mutable (Move): OK
  10974. 1339.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10975. 1339.41 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  10976. 1339.41 s [vector] +++ OK, passed 100 tests.
  10977. 1339.41 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  10978. 1339.41 s [vector] +++ OK, passed 100 tests.
  10979. 1339.41 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  10980. 1339.41 s [vector] +++ OK, passed 100 tests.
  10981. 1339.41 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  10982. 1339.41 s [vector] +++ OK, passed 100 tests.
  10983. 1339.41 s [vector]
  10984. 1339.42 s [vector] All 2808 tests passed (16.41s)
  10985. 1339.42 s [vector] Test suite vector-tests-O0: PASS
  10986. 1339.42 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  10987. 1339.42 s [vector] Test suite vector-tests-O2: RUNNING...
  10988. 1339.46 s [vector] toplevel
  10989. 1339.46 s [vector] Data.Vector.Fusion.Bundle
  10990. 1339.46 s [vector] fromList.toList == id: OK (0.02s)
  10991. 1339.46 s [vector] +++ OK, passed 100 tests.
  10992. 1339.46 s [vector] toList.fromList == id: OK
  10993. 1339.46 s [vector] +++ OK, passed 100 tests.
  10994. 1339.46 s [vector] eq: OK
  10995. 1339.46 s [vector] +++ OK, passed 100 tests.
  10996. 1339.46 s [vector] length: OK
  10997. 1339.46 s [vector] +++ OK, passed 100 tests.
  10998. 1339.47 s [vector] null: OK
  10999. 1339.48 s [vector] +++ OK, passed 100 tests.
  11000. 1339.48 s [vector] empty: OK (0.01s)
  11001. 1339.48 s [vector] +++ OK, passed 100 tests.
  11002. 1339.48 s [vector] singleton: OK
  11003. 1339.48 s [vector] +++ OK, passed 100 tests.
  11004. 1339.48 s [vector] replicate: OK
  11005. 1339.48 s [vector] +++ OK, passed 100 tests.
  11006. 1339.48 s [vector] cons: OK
  11007. 1339.48 s [vector] +++ OK, passed 100 tests.
  11008. 1339.48 s [vector] snoc: OK
  11009. 1339.48 s [vector] +++ OK, passed 100 tests.
  11010. 1339.48 s [vector] append: OK
  11011. 1339.48 s [vector] +++ OK, passed 100 tests.
  11012. 1339.48 s [vector] head: OK
  11013. 1339.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11014. 1339.48 s [vector] last: OK
  11015. 1339.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11016. 1339.48 s [vector] index: OK
  11017. 1339.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11018. 1339.48 s [vector] extract: OK
  11019. 1339.48 s [vector] +++ OK, passed 100 tests.
  11020. 1339.48 s [vector] init: OK
  11021. 1339.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11022. 1339.48 s [vector] tail: OK
  11023. 1339.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11024. 1339.49 s [vector] take: OK
  11025. 1339.49 s [vector] +++ OK, passed 100 tests.
  11026. 1339.49 s [vector] drop: OK
  11027. 1339.49 s [vector] +++ OK, passed 100 tests.
  11028. 1339.49 s [vector] map: OK
  11029. 1339.49 s [vector] +++ OK, passed 100 tests.
  11030. 1339.49 s [vector] zipWith: OK
  11031. 1339.49 s [vector] +++ OK, passed 100 tests.
  11032. 1339.49 s [vector] zipWith3: OK
  11033. 1339.49 s [vector] +++ OK, passed 100 tests.
  11034. 1339.50 s [vector] filter: OK
  11035. 1339.50 s [vector] +++ OK, passed 100 tests.
  11036. 1339.50 s [vector] takeWhile: OK
  11037. 1339.50 s [vector] +++ OK, passed 100 tests.
  11038. 1339.50 s [vector] dropWhile: OK
  11039. 1339.50 s [vector] +++ OK, passed 100 tests.
  11040. 1339.50 s [vector] elem: OK
  11041. 1339.50 s [vector] +++ OK, passed 100 tests.
  11042. 1339.50 s [vector] notElem: OK
  11043. 1339.50 s [vector] +++ OK, passed 100 tests.
  11044. 1339.50 s [vector] find: OK
  11045. 1339.50 s [vector] +++ OK, passed 100 tests.
  11046. 1339.50 s [vector] findIndex: OK
  11047. 1339.50 s [vector] +++ OK, passed 100 tests.
  11048. 1339.50 s [vector] foldl: OK
  11049. 1339.50 s [vector] +++ OK, passed 100 tests.
  11050. 1339.50 s [vector] foldl1: OK
  11051. 1339.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11052. 1339.51 s [vector] foldl': OK
  11053. 1339.51 s [vector] +++ OK, passed 100 tests.
  11054. 1339.51 s [vector] foldl1': OK
  11055. 1339.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11056. 1339.51 s [vector] foldr: OK
  11057. 1339.51 s [vector] +++ OK, passed 100 tests.
  11058. 1339.51 s [vector] foldr1: OK
  11059. 1339.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11060. 1339.51 s [vector] prescanl: OK
  11061. 1339.51 s [vector] +++ OK, passed 100 tests.
  11062. 1339.51 s [vector] prescanl': OK
  11063. 1339.51 s [vector] +++ OK, passed 100 tests.
  11064. 1339.52 s [vector] postscanl: OK
  11065. 1339.52 s [vector] +++ OK, passed 100 tests.
  11066. 1339.52 s [vector] postscanl': OK
  11067. 1339.52 s [vector] +++ OK, passed 100 tests.
  11068. 1339.52 s [vector] scanl: OK
  11069. 1339.52 s [vector] +++ OK, passed 100 tests.
  11070. 1339.52 s [vector] scanl': OK
  11071. 1339.52 s [vector] +++ OK, passed 100 tests.
  11072. 1339.53 s [vector] scanl1: OK
  11073. 1339.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11074. 1339.53 s [vector] scanl1': OK
  11075. 1339.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11076. 1339.53 s [vector] concatMap: OK
  11077. 1339.53 s [vector] +++ OK, passed 100 tests.
  11078. 1339.53 s [vector] unfoldr: OK
  11079. 1339.53 s [vector] +++ OK, passed 100 tests.
  11080. 1339.53 s [vector] and: OK
  11081. 1339.53 s [vector] +++ OK, passed 100 tests.
  11082. 1339.53 s [vector] or: OK
  11083. 1339.53 s [vector] +++ OK, passed 100 tests.
  11084. 1339.53 s [vector] Tests.Vector.Boxed
  11085. 1339.53 s [vector] Bool
  11086. 1339.53 s [vector] fromList.toList == id: OK
  11087. 1339.53 s [vector] +++ OK, passed 100 tests.
  11088. 1339.53 s [vector] toList.fromList == id: OK
  11089. 1339.53 s [vector] +++ OK, passed 100 tests.
  11090. 1339.53 s [vector] unstream.stream == id: OK
  11091. 1339.53 s [vector] +++ OK, passed 100 tests.
  11092. 1339.53 s [vector] stream.unstream == id: OK
  11093. 1339.53 s [vector] +++ OK, passed 100 tests.
  11094. 1339.53 s [vector] eq: OK
  11095. 1339.53 s [vector] +++ OK, passed 100 tests.
  11096. 1339.53 s [vector] length: OK
  11097. 1339.53 s [vector] +++ OK, passed 100 tests.
  11098. 1339.53 s [vector] null: OK
  11099. 1339.53 s [vector] +++ OK, passed 100 tests.
  11100. 1339.53 s [vector] index: OK
  11101. 1339.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11102. 1339.53 s [vector] safeIndex: OK
  11103. 1339.53 s [vector] +++ OK, passed 100 tests.
  11104. 1339.53 s [vector] head: OK
  11105. 1339.53 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11106. 1339.53 s [vector] last: OK
  11107. 1339.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11108. 1339.53 s [vector] unsafeIndex: OK
  11109. 1339.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11110. 1339.53 s [vector] unsafeHead: OK
  11111. 1339.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11112. 1339.53 s [vector] unsafeLast: OK
  11113. 1339.53 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11114. 1339.53 s [vector] slice: OK
  11115. 1339.53 s [vector] +++ OK, passed 100 tests.
  11116. 1339.53 s [vector] init: OK
  11117. 1339.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11118. 1339.53 s [vector] tail: OK
  11119. 1339.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11120. 1339.53 s [vector] take: OK
  11121. 1339.53 s [vector] +++ OK, passed 100 tests.
  11122. 1339.53 s [vector] drop: OK
  11123. 1339.53 s [vector] +++ OK, passed 100 tests.
  11124. 1339.53 s [vector] splitAt: OK
  11125. 1339.53 s [vector] +++ OK, passed 100 tests.
  11126. 1339.53 s [vector] empty: OK
  11127. 1339.53 s [vector] +++ OK, passed 100 tests.
  11128. 1339.53 s [vector] singleton: OK
  11129. 1339.53 s [vector] +++ OK, passed 100 tests.
  11130. 1339.53 s [vector] replicate: OK
  11131. 1339.53 s [vector] +++ OK, passed 100 tests.
  11132. 1339.53 s [vector] generate: OK
  11133. 1339.53 s [vector] +++ OK, passed 100 tests.
  11134. 1339.53 s [vector] iterateN: OK
  11135. 1339.54 s [vector] +++ OK, passed 100 tests.
  11136. 1339.55 s [vector] iterateNM: OK
  11137. 1339.56 s [vector] +++ OK, passed 100 tests.
  11138. 1339.56 s [vector] generateM: OK
  11139. 1339.56 s [vector] +++ OK, passed 100 tests.
  11140. 1339.57 s [vector] replicateM: OK (0.02s)
  11141. 1339.57 s [vector] +++ OK, passed 100 tests.
  11142. 1339.57 s [vector] create: OK
  11143. 1339.57 s [vector] +++ OK, passed 100 tests.
  11144. 1339.57 s [vector] createT: OK
  11145. 1339.57 s [vector] +++ OK, passed 100 tests.
  11146. 1339.57 s [vector] unfoldr: OK
  11147. 1339.57 s [vector] +++ OK, passed 100 tests.
  11148. 1339.57 s [vector] unfoldrN: OK
  11149. 1339.57 s [vector] +++ OK, passed 100 tests.
  11150. 1339.57 s [vector] unfoldrExactN: OK
  11151. 1339.57 s [vector] +++ OK, passed 100 tests.
  11152. 1339.58 s [vector] unfoldrM: OK
  11153. 1339.58 s [vector] +++ OK, passed 100 tests.
  11154. 1339.58 s [vector] unfoldrNM: OK
  11155. 1339.58 s [vector] +++ OK, passed 100 tests.
  11156. 1339.59 s [vector] unfoldrExactNM: OK (0.01s)
  11157. 1339.59 s [vector] +++ OK, passed 100 tests.
  11158. 1339.60 s [vector] constructN: OK
  11159. 1339.60 s [vector] +++ OK, passed 100 tests.
  11160. 1339.60 s [vector] constructrN: OK
  11161. 1339.60 s [vector] +++ OK, passed 100 tests.
  11162. 1339.60 s [vector] cons: OK
  11163. 1339.60 s [vector] +++ OK, passed 100 tests.
  11164. 1339.60 s [vector] snoc: OK
  11165. 1339.60 s [vector] +++ OK, passed 100 tests.
  11166. 1339.60 s [vector] append: OK
  11167. 1339.60 s [vector] +++ OK, passed 100 tests.
  11168. 1339.61 s [vector] concat: OK
  11169. 1339.61 s [vector] +++ OK, passed 100 tests.
  11170. 1339.61 s [vector] force: OK
  11171. 1339.61 s [vector] +++ OK, passed 100 tests.
  11172. 1339.61 s [vector] upd: OK
  11173. 1339.61 s [vector] +++ OK, passed 100 tests.
  11174. 1339.61 s [vector] accum: OK
  11175. 1339.61 s [vector] +++ OK, passed 100 tests.
  11176. 1339.61 s [vector] reverse: OK
  11177. 1339.61 s [vector] +++ OK, passed 100 tests.
  11178. 1339.61 s [vector] backpermute: OK
  11179. 1339.61 s [vector] +++ OK, passed 100 tests.
  11180. 1339.61 s [vector] map: OK
  11181. 1339.61 s [vector] +++ OK, passed 100 tests.
  11182. 1339.61 s [vector] imap: OK
  11183. 1339.61 s [vector] +++ OK, passed 100 tests.
  11184. 1339.62 s [vector] concatMap: OK
  11185. 1339.62 s [vector] +++ OK, passed 100 tests.
  11186. 1339.62 s [vector] mapM: OK
  11187. 1339.62 s [vector] +++ OK, passed 100 tests.
  11188. 1339.63 s [vector] mapM_: OK (0.01s)
  11189. 1339.64 s [vector] +++ OK, passed 100 tests.
  11190. 1339.64 s [vector] forM: OK
  11191. 1339.64 s [vector] +++ OK, passed 100 tests.
  11192. 1339.64 s [vector] forM_: OK
  11193. 1339.64 s [vector] +++ OK, passed 100 tests.
  11194. 1339.64 s [vector] imapM: OK
  11195. 1339.64 s [vector] +++ OK, passed 100 tests.
  11196. 1339.65 s [vector] imapM_: OK
  11197. 1339.65 s [vector] +++ OK, passed 100 tests.
  11198. 1339.65 s [vector] zipWith: OK
  11199. 1339.65 s [vector] +++ OK, passed 100 tests.
  11200. 1339.65 s [vector] zipWith3: OK
  11201. 1339.65 s [vector] +++ OK, passed 100 tests.
  11202. 1339.65 s [vector] izipWith: OK
  11203. 1339.65 s [vector] +++ OK, passed 100 tests.
  11204. 1339.65 s [vector] izipWith3: OK
  11205. 1339.65 s [vector] +++ OK, passed 100 tests.
  11206. 1339.66 s [vector] izipWithM: OK
  11207. 1339.66 s [vector] +++ OK, passed 100 tests.
  11208. 1339.66 s [vector] izipWithM_: OK
  11209. 1339.66 s [vector] +++ OK, passed 100 tests.
  11210. 1339.66 s [vector] zipWithM: OK
  11211. 1339.66 s [vector] +++ OK, passed 100 tests.
  11212. 1339.67 s [vector] zipWithM_: OK
  11213. 1339.67 s [vector] +++ OK, passed 100 tests.
  11214. 1339.67 s [vector] filter: OK
  11215. 1339.67 s [vector] +++ OK, passed 100 tests.
  11216. 1339.68 s [vector] ifilter: OK
  11217. 1339.68 s [vector] +++ OK, passed 100 tests.
  11218. 1339.69 s [vector] filterM: OK (0.01s)
  11219. 1339.69 s [vector] +++ OK, passed 100 tests.
  11220. 1339.69 s [vector] uniq: OK
  11221. 1339.69 s [vector] +++ OK, passed 100 tests.
  11222. 1339.69 s [vector] mapMaybe: OK
  11223. 1339.69 s [vector] +++ OK, passed 100 tests.
  11224. 1339.69 s [vector] imapMaybe: OK
  11225. 1339.69 s [vector] +++ OK, passed 100 tests.
  11226. 1339.69 s [vector] takeWhile: OK
  11227. 1339.69 s [vector] +++ OK, passed 100 tests.
  11228. 1339.69 s [vector] dropWhile: OK
  11229. 1339.69 s [vector] +++ OK, passed 100 tests.
  11230. 1339.69 s [vector] partition: OK
  11231. 1339.69 s [vector] +++ OK, passed 100 tests.
  11232. 1339.69 s [vector] partitionWith: OK
  11233. 1339.69 s [vector] +++ OK, passed 100 tests.
  11234. 1339.69 s [vector] span: OK
  11235. 1339.69 s [vector] +++ OK, passed 100 tests.
  11236. 1339.69 s [vector] break: OK
  11237. 1339.69 s [vector] +++ OK, passed 100 tests.
  11238. 1339.69 s [vector] spanR: OK
  11239. 1339.69 s [vector] +++ OK, passed 100 tests.
  11240. 1339.69 s [vector] breakR: OK
  11241. 1339.69 s [vector] +++ OK, passed 100 tests.
  11242. 1339.69 s [vector] groupBy: OK
  11243. 1339.69 s [vector] +++ OK, passed 100 tests.
  11244. 1339.69 s [vector] elem: OK
  11245. 1339.69 s [vector] +++ OK, passed 100 tests.
  11246. 1339.69 s [vector] notElem: OK
  11247. 1339.70 s [vector] +++ OK, passed 100 tests.
  11248. 1339.70 s [vector] find: OK
  11249. 1339.70 s [vector] +++ OK, passed 100 tests.
  11250. 1339.70 s [vector] findIndex: OK
  11251. 1339.70 s [vector] +++ OK, passed 100 tests.
  11252. 1339.70 s [vector] findIndexR: OK
  11253. 1339.70 s [vector] +++ OK, passed 100 tests.
  11254. 1339.70 s [vector] findIndices: OK
  11255. 1339.70 s [vector] +++ OK, passed 100 tests.
  11256. 1339.70 s [vector] elemIndex: OK
  11257. 1339.70 s [vector] +++ OK, passed 100 tests.
  11258. 1339.70 s [vector] elemIndices: OK
  11259. 1339.70 s [vector] +++ OK, passed 100 tests.
  11260. 1339.70 s [vector] foldl: OK
  11261. 1339.70 s [vector] +++ OK, passed 100 tests.
  11262. 1339.70 s [vector] foldl1: OK
  11263. 1339.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11264. 1339.70 s [vector] foldl': OK
  11265. 1339.70 s [vector] +++ OK, passed 100 tests.
  11266. 1339.70 s [vector] foldl1': OK
  11267. 1339.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11268. 1339.70 s [vector] foldr: OK
  11269. 1339.70 s [vector] +++ OK, passed 100 tests.
  11270. 1339.70 s [vector] foldr1: OK
  11271. 1339.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11272. 1339.70 s [vector] foldr': OK
  11273. 1339.70 s [vector] +++ OK, passed 100 tests.
  11274. 1339.71 s [vector] foldr1': OK
  11275. 1339.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11276. 1339.71 s [vector] ifoldl: OK
  11277. 1339.71 s [vector] +++ OK, passed 100 tests.
  11278. 1339.71 s [vector] ifoldl': OK
  11279. 1339.71 s [vector] +++ OK, passed 100 tests.
  11280. 1339.71 s [vector] ifoldr: OK
  11281. 1339.71 s [vector] +++ OK, passed 100 tests.
  11282. 1339.71 s [vector] ifoldr': OK
  11283. 1339.71 s [vector] +++ OK, passed 100 tests.
  11284. 1339.71 s [vector] ifoldM: OK
  11285. 1339.71 s [vector] +++ OK, passed 100 tests.
  11286. 1339.71 s [vector] ifoldM': OK
  11287. 1339.71 s [vector] +++ OK, passed 100 tests.
  11288. 1339.73 s [vector] ifoldM_: OK
  11289. 1339.73 s [vector] +++ OK, passed 100 tests.
  11290. 1339.73 s [vector] ifoldM'_: OK
  11291. 1339.73 s [vector] +++ OK, passed 100 tests.
  11292. 1339.73 s [vector] all: OK
  11293. 1339.73 s [vector] +++ OK, passed 100 tests.
  11294. 1339.74 s [vector] any: OK
  11295. 1339.74 s [vector] +++ OK, passed 100 tests.
  11296. 1339.74 s [vector] prescanl: OK
  11297. 1339.74 s [vector] +++ OK, passed 100 tests.
  11298. 1339.74 s [vector] prescanl': OK
  11299. 1339.74 s [vector] +++ OK, passed 100 tests.
  11300. 1339.74 s [vector] postscanl: OK
  11301. 1339.74 s [vector] +++ OK, passed 100 tests.
  11302. 1339.74 s [vector] postscanl': OK
  11303. 1339.74 s [vector] +++ OK, passed 100 tests.
  11304. 1339.74 s [vector] scanl: OK
  11305. 1339.74 s [vector] +++ OK, passed 100 tests.
  11306. 1339.74 s [vector] scanl': OK
  11307. 1339.74 s [vector] +++ OK, passed 100 tests.
  11308. 1339.74 s [vector] scanl1: OK
  11309. 1339.75 s [vector] +++ OK, passed 100 tests.
  11310. 1339.75 s [vector] scanl1': OK
  11311. 1339.75 s [vector] +++ OK, passed 100 tests.
  11312. 1339.75 s [vector] iscanl: OK
  11313. 1339.75 s [vector] +++ OK, passed 100 tests.
  11314. 1339.75 s [vector] iscanl': OK
  11315. 1339.75 s [vector] +++ OK, passed 100 tests.
  11316. 1339.75 s [vector] prescanr: OK
  11317. 1339.75 s [vector] +++ OK, passed 100 tests.
  11318. 1339.75 s [vector] prescanr': OK
  11319. 1339.75 s [vector] +++ OK, passed 100 tests.
  11320. 1339.75 s [vector] postscanr: OK
  11321. 1339.75 s [vector] +++ OK, passed 100 tests.
  11322. 1339.75 s [vector] postscanr': OK
  11323. 1339.75 s [vector] +++ OK, passed 100 tests.
  11324. 1339.75 s [vector] scanr: OK
  11325. 1339.75 s [vector] +++ OK, passed 100 tests.
  11326. 1339.75 s [vector] scanr': OK
  11327. 1339.76 s [vector] +++ OK, passed 100 tests.
  11328. 1339.76 s [vector] scanr1: OK
  11329. 1339.76 s [vector] +++ OK, passed 100 tests.
  11330. 1339.76 s [vector] scanr1': OK
  11331. 1339.76 s [vector] +++ OK, passed 100 tests.
  11332. 1339.76 s [vector] iscanr: OK
  11333. 1339.76 s [vector] +++ OK, passed 100 tests.
  11334. 1339.76 s [vector] iscanr': OK
  11335. 1339.76 s [vector] +++ OK, passed 100 tests.
  11336. 1339.76 s [vector] mut_read: OK
  11337. 1339.76 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11338. 1339.76 s [vector] mut_write: OK
  11339. 1339.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11340. 1339.76 s [vector] mut_modify: OK
  11341. 1339.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11342. 1339.76 s [vector] mut_generate: OK
  11343. 1339.77 s [vector] +++ OK, passed 100 tests.
  11344. 1339.78 s [vector] mut_generateM: OK
  11345. 1339.78 s [vector] +++ OK, passed 100 tests.
  11346. 1339.78 s [vector] mut_mapM_: OK
  11347. 1339.78 s [vector] +++ OK, passed 100 tests.
  11348. 1339.80 s [vector] mut_imapM_: OK (0.01s)
  11349. 1339.80 s [vector] +++ OK, passed 100 tests.
  11350. 1339.80 s [vector] mut_forM_: OK
  11351. 1339.80 s [vector] +++ OK, passed 100 tests.
  11352. 1339.81 s [vector] mut_iforM_: OK
  11353. 1339.81 s [vector] +++ OK, passed 100 tests.
  11354. 1339.81 s [vector] mut_foldr: OK
  11355. 1339.81 s [vector] +++ OK, passed 100 tests.
  11356. 1339.81 s [vector] mut_foldr': OK
  11357. 1339.81 s [vector] +++ OK, passed 100 tests.
  11358. 1339.81 s [vector] mut_foldl: OK
  11359. 1339.81 s [vector] +++ OK, passed 100 tests.
  11360. 1339.81 s [vector] mut_foldl': OK
  11361. 1339.81 s [vector] +++ OK, passed 100 tests.
  11362. 1339.81 s [vector] mut_ifoldr: OK
  11363. 1339.81 s [vector] +++ OK, passed 100 tests.
  11364. 1339.81 s [vector] mut_ifoldr': OK
  11365. 1339.82 s [vector] +++ OK, passed 100 tests.
  11366. 1339.82 s [vector] mut_ifoldl: OK
  11367. 1339.82 s [vector] +++ OK, passed 100 tests.
  11368. 1339.82 s [vector] mut_ifoldl': OK
  11369. 1339.82 s [vector] +++ OK, passed 100 tests.
  11370. 1339.82 s [vector] mut_foldM: OK
  11371. 1339.82 s [vector] +++ OK, passed 100 tests.
  11372. 1339.82 s [vector] mut_foldM': OK
  11373. 1339.82 s [vector] +++ OK, passed 100 tests.
  11374. 1339.82 s [vector] mut_foldrM: OK
  11375. 1339.82 s [vector] +++ OK, passed 100 tests.
  11376. 1339.82 s [vector] mut_foldrM': OK
  11377. 1339.82 s [vector] +++ OK, passed 100 tests.
  11378. 1339.82 s [vector] mut_ifoldM: OK
  11379. 1339.82 s [vector] +++ OK, passed 100 tests.
  11380. 1339.82 s [vector] mut_ifoldM': OK
  11381. 1339.82 s [vector] +++ OK, passed 100 tests.
  11382. 1339.83 s [vector] mut_ifoldrM: OK
  11383. 1339.83 s [vector] +++ OK, passed 100 tests.
  11384. 1339.83 s [vector] mut_ifoldrM': OK
  11385. 1339.83 s [vector] +++ OK, passed 100 tests.
  11386. 1339.83 s [vector] compare: OK
  11387. 1339.83 s [vector] +++ OK, passed 100 tests.
  11388. 1339.83 s [vector] maximum: OK
  11389. 1339.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11390. 1339.83 s [vector] minimum: OK
  11391. 1339.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11392. 1339.83 s [vector] minIndex: OK
  11393. 1339.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11394. 1339.83 s [vector] maxIndex: OK
  11395. 1339.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11396. 1339.83 s [vector] maximumBy: OK
  11397. 1339.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11398. 1339.83 s [vector] minimumBy: OK
  11399. 1339.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11400. 1339.83 s [vector] maximumOn: OK
  11401. 1339.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11402. 1339.83 s [vector] minimumOn: OK
  11403. 1339.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11404. 1339.83 s [vector] maxIndexBy: OK
  11405. 1339.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11406. 1339.83 s [vector] minIndexBy: OK
  11407. 1339.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11408. 1339.83 s [vector] ListFirstMaxIndexWins: OK
  11409. 1339.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11410. 1339.83 s [vector] FalseListFirstMaxIndexWins: OK
  11411. 1339.84 s [vector] +++ OK, failed as expected. (after 1 test):
  11412. 1339.84 s [vector] Exception:
  11413. 1339.84 s [vector] Prelude.foldr1: empty list
  11414. 1339.84 s [vector] CallStack (from HasCallStack):
  11415. 1339.84 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  11416. 1339.84 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  11417. 1339.84 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11418. 1339.84 s [vector] []
  11419. 1339.84 s [vector] zip: OK
  11420. 1339.84 s [vector] +++ OK, passed 100 tests.
  11421. 1339.84 s [vector] zip3: OK
  11422. 1339.84 s [vector] +++ OK, passed 100 tests.
  11423. 1339.84 s [vector] unzip: OK
  11424. 1339.84 s [vector] +++ OK, passed 100 tests.
  11425. 1339.84 s [vector] unzip3: OK
  11426. 1339.84 s [vector] +++ OK, passed 100 tests.
  11427. 1339.84 s [vector] indexed: OK
  11428. 1339.84 s [vector] +++ OK, passed 100 tests.
  11429. 1339.84 s [vector] update: OK
  11430. 1339.84 s [vector] +++ OK, passed 100 tests.
  11431. 1339.84 s [vector] concat: OK
  11432. 1339.84 s [vector] +++ OK, passed 100 tests.
  11433. 1339.84 s [vector] mempty: OK
  11434. 1339.84 s [vector] +++ OK, passed 100 tests.
  11435. 1339.85 s [vector] mappend: OK
  11436. 1339.85 s [vector] +++ OK, passed 100 tests.
  11437. 1339.85 s [vector] mconcat: OK
  11438. 1339.85 s [vector] +++ OK, passed 100 tests.
  11439. 1339.85 s [vector] fmap: OK
  11440. 1339.86 s [vector] +++ OK, passed 100 tests.
  11441. 1339.86 s [vector] return: OK
  11442. 1339.86 s [vector] +++ OK, passed 100 tests.
  11443. 1339.86 s [vector] bind: OK
  11444. 1339.86 s [vector] +++ OK, passed 100 tests.
  11445. 1339.86 s [vector] mzip: OK
  11446. 1339.86 s [vector] +++ OK, passed 100 tests.
  11447. 1339.86 s [vector] munzip: OK
  11448. 1339.86 s [vector] +++ OK, passed 100 tests.
  11449. 1339.86 s [vector] applicative_pure: OK
  11450. 1339.86 s [vector] +++ OK, passed 100 tests.
  11451. 1339.87 s [vector] applicative_appl: OK (0.01s)
  11452. 1339.87 s [vector] +++ OK, passed 100 tests.
  11453. 1339.87 s [vector] alternative_empty: OK
  11454. 1339.87 s [vector] +++ OK, passed 100 tests.
  11455. 1339.88 s [vector] alternative_or: OK
  11456. 1339.88 s [vector] +++ OK, passed 100 tests.
  11457. 1339.91 s [vector] sequence: OK (0.03s)
  11458. 1339.91 s [vector] +++ OK, passed 100 tests.
  11459. 1339.91 s [vector] sequence_: OK
  11460. 1339.91 s [vector] +++ OK, passed 100 tests.
  11461. 1339.91 s [vector] glength: OK
  11462. 1339.91 s [vector] +++ OK, passed 100 tests.
  11463. 1339.91 s [vector] and: OK
  11464. 1339.91 s [vector] +++ OK, passed 100 tests.
  11465. 1339.91 s [vector] or: OK
  11466. 1339.91 s [vector] +++ OK, passed 100 tests.
  11467. 1339.91 s [vector] Int
  11468. 1339.91 s [vector] fromList.toList == id: OK
  11469. 1339.91 s [vector] +++ OK, passed 100 tests.
  11470. 1339.91 s [vector] toList.fromList == id: OK
  11471. 1339.91 s [vector] +++ OK, passed 100 tests.
  11472. 1339.92 s [vector] unstream.stream == id: OK
  11473. 1339.92 s [vector] +++ OK, passed 100 tests.
  11474. 1339.92 s [vector] stream.unstream == id: OK
  11475. 1339.92 s [vector] +++ OK, passed 100 tests.
  11476. 1339.92 s [vector] eq: OK
  11477. 1339.92 s [vector] +++ OK, passed 100 tests.
  11478. 1339.92 s [vector] length: OK
  11479. 1339.92 s [vector] +++ OK, passed 100 tests.
  11480. 1339.92 s [vector] null: OK
  11481. 1339.92 s [vector] +++ OK, passed 100 tests.
  11482. 1339.92 s [vector] index: OK
  11483. 1339.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11484. 1339.92 s [vector] safeIndex: OK
  11485. 1339.92 s [vector] +++ OK, passed 100 tests.
  11486. 1339.92 s [vector] head: OK
  11487. 1339.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11488. 1339.92 s [vector] last: OK
  11489. 1339.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11490. 1339.92 s [vector] unsafeIndex: OK
  11491. 1339.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11492. 1339.92 s [vector] unsafeHead: OK
  11493. 1339.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11494. 1339.92 s [vector] unsafeLast: OK
  11495. 1339.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11496. 1339.92 s [vector] slice: OK
  11497. 1339.92 s [vector] +++ OK, passed 100 tests.
  11498. 1339.92 s [vector] init: OK
  11499. 1339.92 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11500. 1339.92 s [vector] tail: OK
  11501. 1339.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11502. 1339.92 s [vector] take: OK
  11503. 1339.92 s [vector] +++ OK, passed 100 tests.
  11504. 1339.92 s [vector] drop: OK
  11505. 1339.92 s [vector] +++ OK, passed 100 tests.
  11506. 1339.92 s [vector] splitAt: OK
  11507. 1339.92 s [vector] +++ OK, passed 100 tests.
  11508. 1339.92 s [vector] empty: OK
  11509. 1339.92 s [vector] +++ OK, passed 100 tests.
  11510. 1339.92 s [vector] singleton: OK
  11511. 1339.92 s [vector] +++ OK, passed 100 tests.
  11512. 1339.92 s [vector] replicate: OK
  11513. 1339.92 s [vector] +++ OK, passed 100 tests.
  11514. 1339.92 s [vector] generate: OK
  11515. 1339.92 s [vector] +++ OK, passed 100 tests.
  11516. 1339.94 s [vector] iterateN: OK
  11517. 1339.94 s [vector] +++ OK, passed 100 tests.
  11518. 1339.94 s [vector] iterateNM: OK (0.01s)
  11519. 1339.94 s [vector] +++ OK, passed 100 tests.
  11520. 1339.98 s [vector] generateM: OK (0.02s)
  11521. 1339.98 s [vector] +++ OK, passed 100 tests.
  11522. 1339.98 s [vector] replicateM: OK (0.01s)
  11523. 1339.98 s [vector] +++ OK, passed 100 tests.
  11524. 1339.98 s [vector] create: OK
  11525. 1339.98 s [vector] +++ OK, passed 100 tests.
  11526. 1339.98 s [vector] createT: OK
  11527. 1339.98 s [vector] +++ OK, passed 100 tests.
  11528. 1339.98 s [vector] unfoldr: OK
  11529. 1339.98 s [vector] +++ OK, passed 100 tests.
  11530. 1339.98 s [vector] unfoldrN: OK
  11531. 1339.98 s [vector] +++ OK, passed 100 tests.
  11532. 1339.98 s [vector] unfoldrExactN: OK
  11533. 1339.98 s [vector] +++ OK, passed 100 tests.
  11534. 1339.98 s [vector] unfoldrM: OK
  11535. 1339.98 s [vector] +++ OK, passed 100 tests.
  11536. 1339.98 s [vector] unfoldrNM: OK
  11537. 1339.98 s [vector] +++ OK, passed 100 tests.
  11538. 1340.01 s [vector] unfoldrExactNM: OK (0.02s)
  11539. 1340.01 s [vector] +++ OK, passed 100 tests.
  11540. 1340.01 s [vector] constructN: OK
  11541. 1340.01 s [vector] +++ OK, passed 100 tests.
  11542. 1340.01 s [vector] constructrN: OK
  11543. 1340.01 s [vector] +++ OK, passed 100 tests.
  11544. 1340.02 s [vector] cons: OK
  11545. 1340.02 s [vector] +++ OK, passed 100 tests.
  11546. 1340.02 s [vector] snoc: OK
  11547. 1340.02 s [vector] +++ OK, passed 100 tests.
  11548. 1340.02 s [vector] append: OK
  11549. 1340.02 s [vector] +++ OK, passed 100 tests.
  11550. 1340.02 s [vector] concat: OK (0.01s)
  11551. 1340.02 s [vector] +++ OK, passed 100 tests.
  11552. 1340.03 s [vector] force: OK
  11553. 1340.03 s [vector] +++ OK, passed 100 tests.
  11554. 1340.03 s [vector] upd: OK
  11555. 1340.03 s [vector] +++ OK, passed 100 tests.
  11556. 1340.03 s [vector] accum: OK
  11557. 1340.03 s [vector] +++ OK, passed 100 tests.
  11558. 1340.03 s [vector] reverse: OK
  11559. 1340.03 s [vector] +++ OK, passed 100 tests.
  11560. 1340.03 s [vector] backpermute: OK
  11561. 1340.03 s [vector] +++ OK, passed 100 tests.
  11562. 1340.03 s [vector] map: OK
  11563. 1340.03 s [vector] +++ OK, passed 100 tests.
  11564. 1340.03 s [vector] imap: OK
  11565. 1340.03 s [vector] +++ OK, passed 100 tests.
  11566. 1340.03 s [vector] concatMap: OK
  11567. 1340.03 s [vector] +++ OK, passed 100 tests.
  11568. 1340.04 s [vector] mapM: OK
  11569. 1340.04 s [vector] +++ OK, passed 100 tests.
  11570. 1340.05 s [vector] mapM_: OK (0.01s)
  11571. 1340.05 s [vector] +++ OK, passed 100 tests.
  11572. 1340.06 s [vector] forM: OK
  11573. 1340.06 s [vector] +++ OK, passed 100 tests.
  11574. 1340.07 s [vector] forM_: OK (0.01s)
  11575. 1340.07 s [vector] +++ OK, passed 100 tests.
  11576. 1340.08 s [vector] imapM: OK
  11577. 1340.08 s [vector] +++ OK, passed 100 tests.
  11578. 1340.08 s [vector] imapM_: OK (0.02s)
  11579. 1340.09 s [vector] +++ OK, passed 100 tests.
  11580. 1340.09 s [vector] zipWith: OK
  11581. 1340.09 s [vector] +++ OK, passed 100 tests.
  11582. 1340.09 s [vector] zipWith3: OK
  11583. 1340.09 s [vector] +++ OK, passed 100 tests.
  11584. 1340.09 s [vector] izipWith: OK
  11585. 1340.09 s [vector] +++ OK, passed 100 tests.
  11586. 1340.09 s [vector] izipWith3: OK
  11587. 1340.10 s [vector] +++ OK, passed 100 tests.
  11588. 1340.10 s [vector] izipWithM: OK
  11589. 1340.10 s [vector] +++ OK, passed 100 tests.
  11590. 1340.11 s [vector] izipWithM_: OK (0.01s)
  11591. 1340.11 s [vector] +++ OK, passed 100 tests.
  11592. 1340.11 s [vector] zipWithM: OK
  11593. 1340.12 s [vector] +++ OK, passed 100 tests.
  11594. 1340.13 s [vector] zipWithM_: OK (0.01s)
  11595. 1340.13 s [vector] +++ OK, passed 100 tests.
  11596. 1340.13 s [vector] filter: OK
  11597. 1340.13 s [vector] +++ OK, passed 100 tests.
  11598. 1340.14 s [vector] ifilter: OK
  11599. 1340.14 s [vector] +++ OK, passed 100 tests.
  11600. 1340.16 s [vector] filterM: OK (0.03s)
  11601. 1340.16 s [vector] +++ OK, passed 100 tests.
  11602. 1340.16 s [vector] uniq: OK
  11603. 1340.16 s [vector] +++ OK, passed 100 tests.
  11604. 1340.16 s [vector] mapMaybe: OK
  11605. 1340.16 s [vector] +++ OK, passed 100 tests.
  11606. 1340.16 s [vector] imapMaybe: OK
  11607. 1340.16 s [vector] +++ OK, passed 100 tests.
  11608. 1340.16 s [vector] takeWhile: OK
  11609. 1340.16 s [vector] +++ OK, passed 100 tests.
  11610. 1340.16 s [vector] dropWhile: OK
  11611. 1340.17 s [vector] +++ OK, passed 100 tests.
  11612. 1340.17 s [vector] partition: OK
  11613. 1340.17 s [vector] +++ OK, passed 100 tests.
  11614. 1340.17 s [vector] partitionWith: OK
  11615. 1340.17 s [vector] +++ OK, passed 100 tests.
  11616. 1340.17 s [vector] span: OK
  11617. 1340.17 s [vector] +++ OK, passed 100 tests.
  11618. 1340.17 s [vector] break: OK
  11619. 1340.17 s [vector] +++ OK, passed 100 tests.
  11620. 1340.17 s [vector] spanR: OK
  11621. 1340.17 s [vector] +++ OK, passed 100 tests.
  11622. 1340.17 s [vector] breakR: OK
  11623. 1340.17 s [vector] +++ OK, passed 100 tests.
  11624. 1340.17 s [vector] groupBy: OK
  11625. 1340.17 s [vector] +++ OK, passed 100 tests.
  11626. 1340.17 s [vector] elem: OK
  11627. 1340.17 s [vector] +++ OK, passed 100 tests.
  11628. 1340.17 s [vector] notElem: OK
  11629. 1340.17 s [vector] +++ OK, passed 100 tests.
  11630. 1340.17 s [vector] find: OK
  11631. 1340.17 s [vector] +++ OK, passed 100 tests.
  11632. 1340.18 s [vector] findIndex: OK
  11633. 1340.18 s [vector] +++ OK, passed 100 tests.
  11634. 1340.18 s [vector] findIndexR: OK
  11635. 1340.18 s [vector] +++ OK, passed 100 tests.
  11636. 1340.18 s [vector] findIndices: OK
  11637. 1340.18 s [vector] +++ OK, passed 100 tests.
  11638. 1340.18 s [vector] elemIndex: OK
  11639. 1340.18 s [vector] +++ OK, passed 100 tests.
  11640. 1340.19 s [vector] elemIndices: OK
  11641. 1340.19 s [vector] +++ OK, passed 100 tests.
  11642. 1340.19 s [vector] foldl: OK
  11643. 1340.19 s [vector] +++ OK, passed 100 tests.
  11644. 1340.19 s [vector] foldl1: OK
  11645. 1340.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11646. 1340.19 s [vector] foldl': OK
  11647. 1340.19 s [vector] +++ OK, passed 100 tests.
  11648. 1340.20 s [vector] foldl1': OK
  11649. 1340.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11650. 1340.20 s [vector] foldr: OK
  11651. 1340.20 s [vector] +++ OK, passed 100 tests.
  11652. 1340.20 s [vector] foldr1: OK
  11653. 1340.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11654. 1340.21 s [vector] foldr': OK
  11655. 1340.21 s [vector] +++ OK, passed 100 tests.
  11656. 1340.21 s [vector] foldr1': OK
  11657. 1340.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11658. 1340.22 s [vector] ifoldl: OK
  11659. 1340.22 s [vector] +++ OK, passed 100 tests.
  11660. 1340.22 s [vector] ifoldl': OK
  11661. 1340.22 s [vector] +++ OK, passed 100 tests.
  11662. 1340.23 s [vector] ifoldr: OK
  11663. 1340.23 s [vector] +++ OK, passed 100 tests.
  11664. 1340.23 s [vector] ifoldr': OK
  11665. 1340.24 s [vector] +++ OK, passed 100 tests.
  11666. 1340.24 s [vector] ifoldM: OK
  11667. 1340.24 s [vector] +++ OK, passed 100 tests.
  11668. 1340.24 s [vector] ifoldM': OK
  11669. 1340.26 s [vector] +++ OK, passed 100 tests.
  11670. 1340.28 s [vector] ifoldM_: OK (0.02s)
  11671. 1340.28 s [vector] +++ OK, passed 100 tests.
  11672. 1340.29 s [vector] ifoldM'_: OK (0.02s)
  11673. 1340.29 s [vector] +++ OK, passed 100 tests.
  11674. 1340.29 s [vector] all: OK
  11675. 1340.29 s [vector] +++ OK, passed 100 tests.
  11676. 1340.29 s [vector] any: OK
  11677. 1340.29 s [vector] +++ OK, passed 100 tests.
  11678. 1340.29 s [vector] prescanl: OK
  11679. 1340.29 s [vector] +++ OK, passed 100 tests.
  11680. 1340.29 s [vector] prescanl': OK
  11681. 1340.29 s [vector] +++ OK, passed 100 tests.
  11682. 1340.29 s [vector] postscanl: OK
  11683. 1340.30 s [vector] +++ OK, passed 100 tests.
  11684. 1340.30 s [vector] postscanl': OK
  11685. 1340.30 s [vector] +++ OK, passed 100 tests.
  11686. 1340.30 s [vector] scanl: OK
  11687. 1340.30 s [vector] +++ OK, passed 100 tests.
  11688. 1340.31 s [vector] scanl': OK
  11689. 1340.31 s [vector] +++ OK, passed 100 tests.
  11690. 1340.31 s [vector] scanl1: OK
  11691. 1340.31 s [vector] +++ OK, passed 100 tests.
  11692. 1340.31 s [vector] scanl1': OK
  11693. 1340.31 s [vector] +++ OK, passed 100 tests.
  11694. 1340.31 s [vector] iscanl: OK
  11695. 1340.31 s [vector] +++ OK, passed 100 tests.
  11696. 1340.32 s [vector] iscanl': OK
  11697. 1340.32 s [vector] +++ OK, passed 100 tests.
  11698. 1340.32 s [vector] prescanr: OK
  11699. 1340.32 s [vector] +++ OK, passed 100 tests.
  11700. 1340.32 s [vector] prescanr': OK
  11701. 1340.32 s [vector] +++ OK, passed 100 tests.
  11702. 1340.32 s [vector] postscanr: OK
  11703. 1340.33 s [vector] +++ OK, passed 100 tests.
  11704. 1340.33 s [vector] postscanr': OK
  11705. 1340.33 s [vector] +++ OK, passed 100 tests.
  11706. 1340.33 s [vector] scanr: OK
  11707. 1340.33 s [vector] +++ OK, passed 100 tests.
  11708. 1340.33 s [vector] scanr': OK
  11709. 1340.33 s [vector] +++ OK, passed 100 tests.
  11710. 1340.33 s [vector] scanr1: OK
  11711. 1340.33 s [vector] +++ OK, passed 100 tests.
  11712. 1340.33 s [vector] scanr1': OK
  11713. 1340.34 s [vector] +++ OK, passed 100 tests.
  11714. 1340.34 s [vector] iscanr: OK
  11715. 1340.34 s [vector] +++ OK, passed 100 tests.
  11716. 1340.34 s [vector] iscanr': OK
  11717. 1340.34 s [vector] +++ OK, passed 100 tests.
  11718. 1340.34 s [vector] mut_read: OK
  11719. 1340.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11720. 1340.34 s [vector] mut_write: OK
  11721. 1340.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11722. 1340.34 s [vector] mut_modify: OK
  11723. 1340.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11724. 1340.35 s [vector] mut_generate: OK
  11725. 1340.36 s [vector] +++ OK, passed 100 tests.
  11726. 1340.36 s [vector] mut_generateM: OK
  11727. 1340.36 s [vector] +++ OK, passed 100 tests.
  11728. 1340.38 s [vector] mut_mapM_: OK (0.02s)
  11729. 1340.38 s [vector] +++ OK, passed 100 tests.
  11730. 1340.39 s [vector] mut_imapM_: OK (0.02s)
  11731. 1340.40 s [vector] +++ OK, passed 100 tests.
  11732. 1340.40 s [vector] mut_forM_: OK (0.01s)
  11733. 1340.40 s [vector] +++ OK, passed 100 tests.
  11734. 1340.41 s [vector] mut_iforM_: OK (0.02s)
  11735. 1340.41 s [vector] +++ OK, passed 100 tests.
  11736. 1340.41 s [vector] mut_foldr: OK
  11737. 1340.41 s [vector] +++ OK, passed 100 tests.
  11738. 1340.42 s [vector] mut_foldr': OK
  11739. 1340.42 s [vector] +++ OK, passed 100 tests.
  11740. 1340.42 s [vector] mut_foldl: OK
  11741. 1340.42 s [vector] +++ OK, passed 100 tests.
  11742. 1340.43 s [vector] mut_foldl': OK
  11743. 1340.43 s [vector] +++ OK, passed 100 tests.
  11744. 1340.43 s [vector] mut_ifoldr: OK
  11745. 1340.43 s [vector] +++ OK, passed 100 tests.
  11746. 1340.43 s [vector] mut_ifoldr': OK
  11747. 1340.43 s [vector] +++ OK, passed 100 tests.
  11748. 1340.43 s [vector] mut_ifoldl: OK
  11749. 1340.43 s [vector] +++ OK, passed 100 tests.
  11750. 1340.43 s [vector] mut_ifoldl': OK
  11751. 1340.43 s [vector] +++ OK, passed 100 tests.
  11752. 1340.44 s [vector] mut_foldM: OK
  11753. 1340.44 s [vector] +++ OK, passed 100 tests.
  11754. 1340.44 s [vector] mut_foldM': OK
  11755. 1340.44 s [vector] +++ OK, passed 100 tests.
  11756. 1340.44 s [vector] mut_foldrM: OK
  11757. 1340.44 s [vector] +++ OK, passed 100 tests.
  11758. 1340.44 s [vector] mut_foldrM': OK
  11759. 1340.44 s [vector] +++ OK, passed 100 tests.
  11760. 1340.44 s [vector] mut_ifoldM: OK
  11761. 1340.45 s [vector] +++ OK, passed 100 tests.
  11762. 1340.45 s [vector] mut_ifoldM': OK
  11763. 1340.45 s [vector] +++ OK, passed 100 tests.
  11764. 1340.45 s [vector] mut_ifoldrM: OK
  11765. 1340.45 s [vector] +++ OK, passed 100 tests.
  11766. 1340.45 s [vector] mut_ifoldrM': OK
  11767. 1340.45 s [vector] +++ OK, passed 100 tests.
  11768. 1340.45 s [vector] compare: OK
  11769. 1340.45 s [vector] +++ OK, passed 100 tests.
  11770. 1340.45 s [vector] maximum: OK
  11771. 1340.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11772. 1340.46 s [vector] minimum: OK
  11773. 1340.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11774. 1340.46 s [vector] minIndex: OK
  11775. 1340.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11776. 1340.46 s [vector] maxIndex: OK
  11777. 1340.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11778. 1340.46 s [vector] maximumBy: OK
  11779. 1340.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11780. 1340.46 s [vector] minimumBy: OK
  11781. 1340.46 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11782. 1340.46 s [vector] maximumOn: OK
  11783. 1340.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11784. 1340.46 s [vector] minimumOn: OK
  11785. 1340.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11786. 1340.46 s [vector] maxIndexBy: OK
  11787. 1340.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11788. 1340.46 s [vector] minIndexBy: OK
  11789. 1340.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11790. 1340.46 s [vector] ListFirstMaxIndexWins: OK
  11791. 1340.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11792. 1340.46 s [vector] FalseListFirstMaxIndexWins: OK
  11793. 1340.46 s [vector] +++ OK, failed as expected. (after 1 test):
  11794. 1340.46 s [vector] Exception:
  11795. 1340.46 s [vector] Prelude.foldr1: empty list
  11796. 1340.46 s [vector] CallStack (from HasCallStack):
  11797. 1340.46 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  11798. 1340.46 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  11799. 1340.46 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11800. 1340.46 s [vector] []
  11801. 1340.46 s [vector] zip: OK
  11802. 1340.46 s [vector] +++ OK, passed 100 tests.
  11803. 1340.46 s [vector] zip3: OK
  11804. 1340.46 s [vector] +++ OK, passed 100 tests.
  11805. 1340.46 s [vector] unzip: OK
  11806. 1340.46 s [vector] +++ OK, passed 100 tests.
  11807. 1340.46 s [vector] unzip3: OK
  11808. 1340.46 s [vector] +++ OK, passed 100 tests.
  11809. 1340.46 s [vector] indexed: OK
  11810. 1340.46 s [vector] +++ OK, passed 100 tests.
  11811. 1340.47 s [vector] update: OK
  11812. 1340.47 s [vector] +++ OK, passed 100 tests.
  11813. 1340.47 s [vector] concat: OK
  11814. 1340.47 s [vector] +++ OK, passed 100 tests.
  11815. 1340.47 s [vector] mempty: OK
  11816. 1340.47 s [vector] +++ OK, passed 100 tests.
  11817. 1340.48 s [vector] mappend: OK
  11818. 1340.48 s [vector] +++ OK, passed 100 tests.
  11819. 1340.49 s [vector] mconcat: OK
  11820. 1340.49 s [vector] +++ OK, passed 100 tests.
  11821. 1340.49 s [vector] fmap: OK
  11822. 1340.49 s [vector] +++ OK, passed 100 tests.
  11823. 1340.49 s [vector] return: OK
  11824. 1340.50 s [vector] +++ OK, passed 100 tests.
  11825. 1340.51 s [vector] bind: OK (0.02s)
  11826. 1340.51 s [vector] +++ OK, passed 100 tests.
  11827. 1340.51 s [vector] mzip: OK
  11828. 1340.51 s [vector] +++ OK, passed 100 tests.
  11829. 1340.51 s [vector] munzip: OK
  11830. 1340.51 s [vector] +++ OK, passed 100 tests.
  11831. 1340.51 s [vector] applicative_pure: OK
  11832. 1340.51 s [vector] +++ OK, passed 100 tests.
  11833. 1340.55 s [vector] applicative_appl: OK (0.04s)
  11834. 1340.55 s [vector] +++ OK, passed 100 tests.
  11835. 1340.55 s [vector] alternative_empty: OK
  11836. 1340.55 s [vector] +++ OK, passed 100 tests.
  11837. 1340.56 s [vector] alternative_or: OK
  11838. 1340.56 s [vector] +++ OK, passed 100 tests.
  11839. 1340.59 s [vector] sequence: OK (0.03s)
  11840. 1340.59 s [vector] +++ OK, passed 100 tests.
  11841. 1340.59 s [vector] sequence_: OK
  11842. 1340.59 s [vector] +++ OK, passed 100 tests.
  11843. 1340.59 s [vector] glength: OK
  11844. 1340.59 s [vector] +++ OK, passed 100 tests.
  11845. 1340.59 s [vector] sum: OK
  11846. 1340.59 s [vector] +++ OK, passed 100 tests.
  11847. 1340.59 s [vector] product: OK
  11848. 1340.59 s [vector] +++ OK, passed 100 tests.
  11849. 1340.59 s [vector] enumFromN: OK
  11850. 1340.59 s [vector] +++ OK, passed 100 tests.
  11851. 1340.59 s [vector] enumFromThenN: OK
  11852. 1340.59 s [vector] +++ OK, passed 100 tests.
  11853. 1340.59 s [vector] enumFromTo: OK
  11854. 1340.59 s [vector] +++ OK, passed 100 tests.
  11855. 1340.59 s [vector] enumFromThenTo: OK
  11856. 1340.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11857. 1340.59 s [vector] unstream
  11858. 1340.59 s [vector] unstream == vunstream (exact): OK
  11859. 1340.59 s [vector] +++ OK, passed 100 tests.
  11860. 1340.59 s [vector] unstream == vunstream (unknown): OK
  11861. 1340.59 s [vector] +++ OK, passed 100 tests.
  11862. 1340.59 s [vector] unstreamR ~= vunstream (exact): OK
  11863. 1340.59 s [vector] +++ OK, passed 100 tests.
  11864. 1340.59 s [vector] unstreamR ~= vunstream (unknown): OK
  11865. 1340.59 s [vector] +++ OK, passed 100 tests.
  11866. 1340.59 s [vector] Tests.Vector.Primitive
  11867. 1340.59 s [vector] Int
  11868. 1340.59 s [vector] fromList.toList == id: OK
  11869. 1340.60 s [vector] +++ OK, passed 100 tests.
  11870. 1340.60 s [vector] toList.fromList == id: OK
  11871. 1340.60 s [vector] +++ OK, passed 100 tests.
  11872. 1340.60 s [vector] unstream.stream == id: OK
  11873. 1340.60 s [vector] +++ OK, passed 100 tests.
  11874. 1340.60 s [vector] stream.unstream == id: OK
  11875. 1340.60 s [vector] +++ OK, passed 100 tests.
  11876. 1340.60 s [vector] eq: OK
  11877. 1340.60 s [vector] +++ OK, passed 100 tests.
  11878. 1340.60 s [vector] length: OK
  11879. 1340.60 s [vector] +++ OK, passed 100 tests.
  11880. 1340.60 s [vector] null: OK
  11881. 1340.60 s [vector] +++ OK, passed 100 tests.
  11882. 1340.60 s [vector] index: OK
  11883. 1340.60 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11884. 1340.60 s [vector] safeIndex: OK
  11885. 1340.60 s [vector] +++ OK, passed 100 tests.
  11886. 1340.60 s [vector] head: OK
  11887. 1340.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11888. 1340.60 s [vector] last: OK
  11889. 1340.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11890. 1340.60 s [vector] unsafeIndex: OK
  11891. 1340.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11892. 1340.60 s [vector] unsafeHead: OK
  11893. 1340.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11894. 1340.60 s [vector] unsafeLast: OK
  11895. 1340.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11896. 1340.60 s [vector] slice: OK
  11897. 1340.60 s [vector] +++ OK, passed 100 tests.
  11898. 1340.60 s [vector] init: OK
  11899. 1340.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11900. 1340.60 s [vector] tail: OK
  11901. 1340.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11902. 1340.60 s [vector] take: OK
  11903. 1340.60 s [vector] +++ OK, passed 100 tests.
  11904. 1340.60 s [vector] drop: OK
  11905. 1340.60 s [vector] +++ OK, passed 100 tests.
  11906. 1340.61 s [vector] splitAt: OK
  11907. 1340.61 s [vector] +++ OK, passed 100 tests.
  11908. 1340.61 s [vector] empty: OK
  11909. 1340.61 s [vector] +++ OK, passed 100 tests.
  11910. 1340.61 s [vector] singleton: OK
  11911. 1340.61 s [vector] +++ OK, passed 100 tests.
  11912. 1340.62 s [vector] replicate: OK
  11913. 1340.62 s [vector] +++ OK, passed 100 tests.
  11914. 1340.62 s [vector] generate: OK
  11915. 1340.62 s [vector] +++ OK, passed 100 tests.
  11916. 1340.62 s [vector] iterateN: OK
  11917. 1340.62 s [vector] +++ OK, passed 100 tests.
  11918. 1340.64 s [vector] iterateNM: OK (0.02s)
  11919. 1340.64 s [vector] +++ OK, passed 100 tests.
  11920. 1340.65 s [vector] generateM: OK (0.02s)
  11921. 1340.65 s [vector] +++ OK, passed 100 tests.
  11922. 1340.65 s [vector] replicateM: OK
  11923. 1340.65 s [vector] +++ OK, passed 100 tests.
  11924. 1340.66 s [vector] create: OK
  11925. 1340.66 s [vector] +++ OK, passed 100 tests.
  11926. 1340.66 s [vector] createT: OK
  11927. 1340.66 s [vector] +++ OK, passed 100 tests.
  11928. 1340.66 s [vector] unfoldr: OK
  11929. 1340.66 s [vector] +++ OK, passed 100 tests.
  11930. 1340.66 s [vector] unfoldrN: OK
  11931. 1340.66 s [vector] +++ OK, passed 100 tests.
  11932. 1340.66 s [vector] unfoldrExactN: OK
  11933. 1340.66 s [vector] +++ OK, passed 100 tests.
  11934. 1340.66 s [vector] unfoldrM: OK
  11935. 1340.66 s [vector] +++ OK, passed 100 tests.
  11936. 1340.66 s [vector] unfoldrNM: OK
  11937. 1340.66 s [vector] +++ OK, passed 100 tests.
  11938. 1340.69 s [vector] unfoldrExactNM: OK (0.03s)
  11939. 1340.69 s [vector] +++ OK, passed 100 tests.
  11940. 1340.69 s [vector] constructN: OK
  11941. 1340.69 s [vector] +++ OK, passed 100 tests.
  11942. 1340.69 s [vector] constructrN: OK
  11943. 1340.69 s [vector] +++ OK, passed 100 tests.
  11944. 1340.69 s [vector] cons: OK
  11945. 1340.69 s [vector] +++ OK, passed 100 tests.
  11946. 1340.69 s [vector] snoc: OK
  11947. 1340.70 s [vector] +++ OK, passed 100 tests.
  11948. 1340.70 s [vector] append: OK
  11949. 1340.70 s [vector] +++ OK, passed 100 tests.
  11950. 1340.71 s [vector] concat: OK (0.02s)
  11951. 1340.71 s [vector] +++ OK, passed 100 tests.
  11952. 1340.71 s [vector] force: OK
  11953. 1340.71 s [vector] +++ OK, passed 100 tests.
  11954. 1340.72 s [vector] upd: OK
  11955. 1340.72 s [vector] +++ OK, passed 100 tests.
  11956. 1340.72 s [vector] accum: OK
  11957. 1340.72 s [vector] +++ OK, passed 100 tests.
  11958. 1340.72 s [vector] reverse: OK
  11959. 1340.73 s [vector] +++ OK, passed 100 tests.
  11960. 1340.74 s [vector] backpermute: OK
  11961. 1340.74 s [vector] +++ OK, passed 100 tests.
  11962. 1340.74 s [vector] map: OK
  11963. 1340.74 s [vector] +++ OK, passed 100 tests.
  11964. 1340.74 s [vector] imap: OK
  11965. 1340.74 s [vector] +++ OK, passed 100 tests.
  11966. 1340.74 s [vector] concatMap: OK
  11967. 1340.74 s [vector] +++ OK, passed 100 tests.
  11968. 1340.74 s [vector] mapM: OK
  11969. 1340.74 s [vector] +++ OK, passed 100 tests.
  11970. 1340.74 s [vector] mapM_: OK (0.01s)
  11971. 1340.74 s [vector] +++ OK, passed 100 tests.
  11972. 1340.74 s [vector] forM: OK
  11973. 1340.76 s [vector] +++ OK, passed 100 tests.
  11974. 1340.76 s [vector] forM_: OK (0.02s)
  11975. 1340.78 s [vector] +++ OK, passed 100 tests.
  11976. 1340.78 s [vector] imapM: OK
  11977. 1340.78 s [vector] +++ OK, passed 100 tests.
  11978. 1340.79 s [vector] imapM_: OK (0.02s)
  11979. 1340.79 s [vector] +++ OK, passed 100 tests.
  11980. 1340.79 s [vector] zipWith: OK
  11981. 1340.80 s [vector] +++ OK, passed 100 tests.
  11982. 1340.80 s [vector] zipWith3: OK
  11983. 1340.80 s [vector] +++ OK, passed 100 tests.
  11984. 1340.80 s [vector] izipWith: OK
  11985. 1340.80 s [vector] +++ OK, passed 100 tests.
  11986. 1340.80 s [vector] izipWith3: OK
  11987. 1340.80 s [vector] +++ OK, passed 100 tests.
  11988. 1340.80 s [vector] izipWithM: OK
  11989. 1340.80 s [vector] +++ OK, passed 100 tests.
  11990. 1340.81 s [vector] izipWithM_: OK (0.01s)
  11991. 1340.82 s [vector] +++ OK, passed 100 tests.
  11992. 1340.82 s [vector] zipWithM: OK
  11993. 1340.82 s [vector] +++ OK, passed 100 tests.
  11994. 1340.82 s [vector] zipWithM_: OK (0.01s)
  11995. 1340.84 s [vector] +++ OK, passed 100 tests.
  11996. 1340.84 s [vector] filter: OK
  11997. 1340.84 s [vector] +++ OK, passed 100 tests.
  11998. 1340.84 s [vector] ifilter: OK
  11999. 1340.84 s [vector] +++ OK, passed 100 tests.
  12000. 1340.85 s [vector] filterM: OK (0.02s)
  12001. 1340.85 s [vector] +++ OK, passed 100 tests.
  12002. 1340.85 s [vector] uniq: OK
  12003. 1340.85 s [vector] +++ OK, passed 100 tests.
  12004. 1340.85 s [vector] mapMaybe: OK
  12005. 1340.85 s [vector] +++ OK, passed 100 tests.
  12006. 1340.85 s [vector] imapMaybe: OK
  12007. 1340.85 s [vector] +++ OK, passed 100 tests.
  12008. 1340.85 s [vector] takeWhile: OK
  12009. 1340.85 s [vector] +++ OK, passed 100 tests.
  12010. 1340.85 s [vector] dropWhile: OK
  12011. 1340.85 s [vector] +++ OK, passed 100 tests.
  12012. 1340.86 s [vector] partition: OK
  12013. 1340.86 s [vector] +++ OK, passed 100 tests.
  12014. 1340.86 s [vector] partitionWith: OK
  12015. 1340.86 s [vector] +++ OK, passed 100 tests.
  12016. 1340.86 s [vector] span: OK
  12017. 1340.86 s [vector] +++ OK, passed 100 tests.
  12018. 1340.86 s [vector] break: OK
  12019. 1340.86 s [vector] +++ OK, passed 100 tests.
  12020. 1340.86 s [vector] spanR: OK
  12021. 1340.86 s [vector] +++ OK, passed 100 tests.
  12022. 1340.86 s [vector] breakR: OK
  12023. 1340.86 s [vector] +++ OK, passed 100 tests.
  12024. 1340.86 s [vector] groupBy: OK
  12025. 1340.86 s [vector] +++ OK, passed 100 tests.
  12026. 1340.86 s [vector] elem: OK
  12027. 1340.86 s [vector] +++ OK, passed 100 tests.
  12028. 1340.86 s [vector] notElem: OK
  12029. 1340.86 s [vector] +++ OK, passed 100 tests.
  12030. 1340.86 s [vector] find: OK
  12031. 1340.86 s [vector] +++ OK, passed 100 tests.
  12032. 1340.86 s [vector] findIndex: OK
  12033. 1340.86 s [vector] +++ OK, passed 100 tests.
  12034. 1340.86 s [vector] findIndexR: OK
  12035. 1340.86 s [vector] +++ OK, passed 100 tests.
  12036. 1340.86 s [vector] findIndices: OK
  12037. 1340.86 s [vector] +++ OK, passed 100 tests.
  12038. 1340.86 s [vector] elemIndex: OK
  12039. 1340.87 s [vector] +++ OK, passed 100 tests.
  12040. 1340.87 s [vector] elemIndices: OK
  12041. 1340.87 s [vector] +++ OK, passed 100 tests.
  12042. 1340.87 s [vector] foldl: OK
  12043. 1340.87 s [vector] +++ OK, passed 100 tests.
  12044. 1340.87 s [vector] foldl1: OK
  12045. 1340.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12046. 1340.87 s [vector] foldl': OK
  12047. 1340.87 s [vector] +++ OK, passed 100 tests.
  12048. 1340.88 s [vector] foldl1': OK
  12049. 1340.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12050. 1340.88 s [vector] foldr: OK
  12051. 1340.88 s [vector] +++ OK, passed 100 tests.
  12052. 1340.89 s [vector] foldr1: OK
  12053. 1340.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12054. 1340.89 s [vector] foldr': OK
  12055. 1340.89 s [vector] +++ OK, passed 100 tests.
  12056. 1340.90 s [vector] foldr1': OK
  12057. 1340.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12058. 1340.90 s [vector] ifoldl: OK
  12059. 1340.90 s [vector] +++ OK, passed 100 tests.
  12060. 1340.90 s [vector] ifoldl': OK
  12061. 1340.90 s [vector] +++ OK, passed 100 tests.
  12062. 1340.90 s [vector] ifoldr: OK
  12063. 1340.90 s [vector] +++ OK, passed 100 tests.
  12064. 1340.90 s [vector] ifoldr': OK
  12065. 1340.90 s [vector] +++ OK, passed 100 tests.
  12066. 1340.90 s [vector] ifoldM: OK
  12067. 1340.90 s [vector] +++ OK, passed 100 tests.
  12068. 1340.90 s [vector] ifoldM': OK
  12069. 1340.90 s [vector] +++ OK, passed 100 tests.
  12070. 1340.92 s [vector] ifoldM_: OK (0.01s)
  12071. 1340.92 s [vector] +++ OK, passed 100 tests.
  12072. 1340.93 s [vector] ifoldM'_: OK (0.02s)
  12073. 1340.93 s [vector] +++ OK, passed 100 tests.
  12074. 1340.93 s [vector] all: OK
  12075. 1340.93 s [vector] +++ OK, passed 100 tests.
  12076. 1340.94 s [vector] any: OK
  12077. 1340.94 s [vector] +++ OK, passed 100 tests.
  12078. 1340.94 s [vector] prescanl: OK
  12079. 1340.94 s [vector] +++ OK, passed 100 tests.
  12080. 1340.94 s [vector] prescanl': OK
  12081. 1340.94 s [vector] +++ OK, passed 100 tests.
  12082. 1340.94 s [vector] postscanl: OK
  12083. 1340.94 s [vector] +++ OK, passed 100 tests.
  12084. 1340.94 s [vector] postscanl': OK
  12085. 1340.94 s [vector] +++ OK, passed 100 tests.
  12086. 1340.94 s [vector] scanl: OK
  12087. 1340.94 s [vector] +++ OK, passed 100 tests.
  12088. 1340.95 s [vector] scanl': OK
  12089. 1340.95 s [vector] +++ OK, passed 100 tests.
  12090. 1340.95 s [vector] scanl1: OK
  12091. 1340.95 s [vector] +++ OK, passed 100 tests.
  12092. 1340.95 s [vector] scanl1': OK
  12093. 1340.95 s [vector] +++ OK, passed 100 tests.
  12094. 1340.95 s [vector] iscanl: OK
  12095. 1340.95 s [vector] +++ OK, passed 100 tests.
  12096. 1340.95 s [vector] iscanl': OK
  12097. 1340.95 s [vector] +++ OK, passed 100 tests.
  12098. 1340.96 s [vector] prescanr: OK
  12099. 1340.96 s [vector] +++ OK, passed 100 tests.
  12100. 1340.96 s [vector] prescanr': OK
  12101. 1340.96 s [vector] +++ OK, passed 100 tests.
  12102. 1340.96 s [vector] postscanr: OK
  12103. 1340.96 s [vector] +++ OK, passed 100 tests.
  12104. 1340.97 s [vector] postscanr': OK
  12105. 1340.98 s [vector] +++ OK, passed 100 tests.
  12106. 1340.98 s [vector] scanr: OK (0.01s)
  12107. 1340.98 s [vector] +++ OK, passed 100 tests.
  12108. 1340.98 s [vector] scanr': OK
  12109. 1340.98 s [vector] +++ OK, passed 100 tests.
  12110. 1340.98 s [vector] scanr1: OK
  12111. 1340.98 s [vector] +++ OK, passed 100 tests.
  12112. 1340.98 s [vector] scanr1': OK
  12113. 1340.98 s [vector] +++ OK, passed 100 tests.
  12114. 1340.99 s [vector] iscanr: OK
  12115. 1340.99 s [vector] +++ OK, passed 100 tests.
  12116. 1340.99 s [vector] iscanr': OK
  12117. 1340.99 s [vector] +++ OK, passed 100 tests.
  12118. 1340.99 s [vector] mut_read: OK
  12119. 1340.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12120. 1340.99 s [vector] mut_write: OK
  12121. 1340.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12122. 1340.99 s [vector] mut_modify: OK
  12123. 1340.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12124. 1341.00 s [vector] mut_generate: OK
  12125. 1341.00 s [vector] +++ OK, passed 100 tests.
  12126. 1341.01 s [vector] mut_generateM: OK
  12127. 1341.01 s [vector] +++ OK, passed 100 tests.
  12128. 1341.02 s [vector] mut_mapM_: OK (0.01s)
  12129. 1341.02 s [vector] +++ OK, passed 100 tests.
  12130. 1341.04 s [vector] mut_imapM_: OK (0.01s)
  12131. 1341.04 s [vector] +++ OK, passed 100 tests.
  12132. 1341.06 s [vector] mut_forM_: OK (0.02s)
  12133. 1341.06 s [vector] +++ OK, passed 100 tests.
  12134. 1341.06 s [vector] mut_iforM_: OK (0.01s)
  12135. 1341.06 s [vector] +++ OK, passed 100 tests.
  12136. 1341.06 s [vector] mut_foldr: OK
  12137. 1341.06 s [vector] +++ OK, passed 100 tests.
  12138. 1341.06 s [vector] mut_foldr': OK
  12139. 1341.07 s [vector] +++ OK, passed 100 tests.
  12140. 1341.07 s [vector] mut_foldl: OK
  12141. 1341.07 s [vector] +++ OK, passed 100 tests.
  12142. 1341.07 s [vector] mut_foldl': OK
  12143. 1341.07 s [vector] +++ OK, passed 100 tests.
  12144. 1341.07 s [vector] mut_ifoldr: OK
  12145. 1341.08 s [vector] +++ OK, passed 100 tests.
  12146. 1341.08 s [vector] mut_ifoldr': OK
  12147. 1341.08 s [vector] +++ OK, passed 100 tests.
  12148. 1341.08 s [vector] mut_ifoldl: OK
  12149. 1341.08 s [vector] +++ OK, passed 100 tests.
  12150. 1341.09 s [vector] mut_ifoldl': OK
  12151. 1341.09 s [vector] +++ OK, passed 100 tests.
  12152. 1341.09 s [vector] mut_foldM: OK
  12153. 1341.09 s [vector] +++ OK, passed 100 tests.
  12154. 1341.09 s [vector] mut_foldM': OK
  12155. 1341.09 s [vector] +++ OK, passed 100 tests.
  12156. 1341.09 s [vector] mut_foldrM: OK
  12157. 1341.09 s [vector] +++ OK, passed 100 tests.
  12158. 1341.09 s [vector] mut_foldrM': OK
  12159. 1341.09 s [vector] +++ OK, passed 100 tests.
  12160. 1341.09 s [vector] mut_ifoldM: OK
  12161. 1341.09 s [vector] +++ OK, passed 100 tests.
  12162. 1341.10 s [vector] mut_ifoldM': OK
  12163. 1341.10 s [vector] +++ OK, passed 100 tests.
  12164. 1341.10 s [vector] mut_ifoldrM: OK
  12165. 1341.10 s [vector] +++ OK, passed 100 tests.
  12166. 1341.10 s [vector] mut_ifoldrM': OK
  12167. 1341.10 s [vector] +++ OK, passed 100 tests.
  12168. 1341.10 s [vector] compare: OK
  12169. 1341.10 s [vector] +++ OK, passed 100 tests.
  12170. 1341.10 s [vector] maximum: OK
  12171. 1341.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12172. 1341.10 s [vector] minimum: OK
  12173. 1341.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12174. 1341.10 s [vector] minIndex: OK
  12175. 1341.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12176. 1341.10 s [vector] maxIndex: OK
  12177. 1341.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12178. 1341.10 s [vector] maximumBy: OK
  12179. 1341.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12180. 1341.10 s [vector] minimumBy: OK
  12181. 1341.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12182. 1341.10 s [vector] maximumOn: OK
  12183. 1341.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12184. 1341.10 s [vector] minimumOn: OK
  12185. 1341.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12186. 1341.10 s [vector] maxIndexBy: OK
  12187. 1341.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12188. 1341.10 s [vector] minIndexBy: OK
  12189. 1341.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12190. 1341.10 s [vector] ListFirstMaxIndexWins: OK
  12191. 1341.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12192. 1341.10 s [vector] FalseListFirstMaxIndexWins: OK
  12193. 1341.10 s [vector] +++ OK, failed as expected. (after 1 test):
  12194. 1341.10 s [vector] Exception:
  12195. 1341.11 s [vector] Prelude.foldr1: empty list
  12196. 1341.11 s [vector] CallStack (from HasCallStack):
  12197. 1341.11 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  12198. 1341.11 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  12199. 1341.11 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12200. 1341.11 s [vector] []
  12201. 1341.11 s [vector] mempty: OK
  12202. 1341.11 s [vector] +++ OK, passed 100 tests.
  12203. 1341.11 s [vector] mappend: OK
  12204. 1341.12 s [vector] +++ OK, passed 100 tests.
  12205. 1341.12 s [vector] mconcat: OK (0.01s)
  12206. 1341.12 s [vector] +++ OK, passed 100 tests.
  12207. 1341.12 s [vector] glength: OK
  12208. 1341.12 s [vector] +++ OK, passed 100 tests.
  12209. 1341.12 s [vector] sum: OK
  12210. 1341.12 s [vector] +++ OK, passed 100 tests.
  12211. 1341.12 s [vector] product: OK
  12212. 1341.12 s [vector] +++ OK, passed 100 tests.
  12213. 1341.12 s [vector] enumFromN: OK
  12214. 1341.12 s [vector] +++ OK, passed 100 tests.
  12215. 1341.12 s [vector] enumFromThenN: OK
  12216. 1341.12 s [vector] +++ OK, passed 100 tests.
  12217. 1341.12 s [vector] enumFromTo: OK
  12218. 1341.12 s [vector] +++ OK, passed 100 tests.
  12219. 1341.12 s [vector] enumFromThenTo: OK
  12220. 1341.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12221. 1341.12 s [vector] Double
  12222. 1341.13 s [vector] fromList.toList == id: OK
  12223. 1341.13 s [vector] +++ OK, passed 100 tests.
  12224. 1341.13 s [vector] toList.fromList == id: OK
  12225. 1341.13 s [vector] +++ OK, passed 100 tests.
  12226. 1341.13 s [vector] unstream.stream == id: OK
  12227. 1341.13 s [vector] +++ OK, passed 100 tests.
  12228. 1341.13 s [vector] stream.unstream == id: OK
  12229. 1341.13 s [vector] +++ OK, passed 100 tests.
  12230. 1341.13 s [vector] eq: OK
  12231. 1341.13 s [vector] +++ OK, passed 100 tests.
  12232. 1341.13 s [vector] length: OK
  12233. 1341.13 s [vector] +++ OK, passed 100 tests.
  12234. 1341.13 s [vector] null: OK
  12235. 1341.13 s [vector] +++ OK, passed 100 tests.
  12236. 1341.13 s [vector] index: OK
  12237. 1341.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12238. 1341.13 s [vector] safeIndex: OK
  12239. 1341.13 s [vector] +++ OK, passed 100 tests.
  12240. 1341.13 s [vector] head: OK
  12241. 1341.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12242. 1341.14 s [vector] last: OK
  12243. 1341.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12244. 1341.14 s [vector] unsafeIndex: OK
  12245. 1341.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12246. 1341.14 s [vector] unsafeHead: OK
  12247. 1341.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12248. 1341.14 s [vector] unsafeLast: OK
  12249. 1341.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12250. 1341.14 s [vector] slice: OK
  12251. 1341.14 s [vector] +++ OK, passed 100 tests.
  12252. 1341.14 s [vector] init: OK
  12253. 1341.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12254. 1341.14 s [vector] tail: OK
  12255. 1341.14 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12256. 1341.15 s [vector] take: OK
  12257. 1341.15 s [vector] +++ OK, passed 100 tests.
  12258. 1341.15 s [vector] drop: OK
  12259. 1341.15 s [vector] +++ OK, passed 100 tests.
  12260. 1341.15 s [vector] splitAt: OK
  12261. 1341.15 s [vector] +++ OK, passed 100 tests.
  12262. 1341.15 s [vector] empty: OK
  12263. 1341.15 s [vector] +++ OK, passed 100 tests.
  12264. 1341.15 s [vector] singleton: OK
  12265. 1341.15 s [vector] +++ OK, passed 100 tests.
  12266. 1341.15 s [vector] replicate: OK
  12267. 1341.15 s [vector] +++ OK, passed 100 tests.
  12268. 1341.16 s [vector] generate: OK
  12269. 1341.16 s [vector] +++ OK, passed 100 tests.
  12270. 1341.16 s [vector] iterateN: OK
  12271. 1341.16 s [vector] +++ OK, passed 100 tests.
  12272. 1341.18 s [vector] iterateNM: OK
  12273. 1341.18 s [vector] +++ OK, passed 100 tests.
  12274. 1341.19 s [vector] generateM: OK (0.02s)
  12275. 1341.19 s [vector] +++ OK, passed 100 tests.
  12276. 1341.19 s [vector] replicateM: OK
  12277. 1341.19 s [vector] +++ OK, passed 100 tests.
  12278. 1341.19 s [vector] create: OK
  12279. 1341.19 s [vector] +++ OK, passed 100 tests.
  12280. 1341.19 s [vector] createT: OK
  12281. 1341.19 s [vector] +++ OK, passed 100 tests.
  12282. 1341.19 s [vector] unfoldr: OK
  12283. 1341.19 s [vector] +++ OK, passed 100 tests.
  12284. 1341.19 s [vector] unfoldrN: OK
  12285. 1341.19 s [vector] +++ OK, passed 100 tests.
  12286. 1341.20 s [vector] unfoldrExactN: OK
  12287. 1341.20 s [vector] +++ OK, passed 100 tests.
  12288. 1341.20 s [vector] unfoldrM: OK
  12289. 1341.20 s [vector] +++ OK, passed 100 tests.
  12290. 1341.20 s [vector] unfoldrNM: OK
  12291. 1341.20 s [vector] +++ OK, passed 100 tests.
  12292. 1341.22 s [vector] unfoldrExactNM: OK
  12293. 1341.22 s [vector] +++ OK, passed 100 tests.
  12294. 1341.24 s [vector] constructN: OK (0.01s)
  12295. 1341.24 s [vector] +++ OK, passed 100 tests.
  12296. 1341.24 s [vector] constructrN: OK (0.01s)
  12297. 1341.24 s [vector] +++ OK, passed 100 tests.
  12298. 1341.24 s [vector] cons: OK
  12299. 1341.24 s [vector] +++ OK, passed 100 tests.
  12300. 1341.24 s [vector] snoc: OK
  12301. 1341.24 s [vector] +++ OK, passed 100 tests.
  12302. 1341.24 s [vector] append: OK
  12303. 1341.24 s [vector] +++ OK, passed 100 tests.
  12304. 1341.26 s [vector] concat: OK (0.02s)
  12305. 1341.26 s [vector] +++ OK, passed 100 tests.
  12306. 1341.26 s [vector] force: OK
  12307. 1341.26 s [vector] +++ OK, passed 100 tests.
  12308. 1341.27 s [vector] upd: OK
  12309. 1341.27 s [vector] +++ OK, passed 100 tests.
  12310. 1341.27 s [vector] accum: OK (0.01s)
  12311. 1341.27 s [vector] +++ OK, passed 100 tests.
  12312. 1341.27 s [vector] reverse: OK
  12313. 1341.28 s [vector] +++ OK, passed 100 tests.
  12314. 1341.28 s [vector] backpermute: OK
  12315. 1341.28 s [vector] +++ OK, passed 100 tests.
  12316. 1341.29 s [vector] map: OK
  12317. 1341.29 s [vector] +++ OK, passed 100 tests.
  12318. 1341.30 s [vector] imap: OK
  12319. 1341.30 s [vector] +++ OK, passed 100 tests.
  12320. 1341.30 s [vector] concatMap: OK
  12321. 1341.30 s [vector] +++ OK, passed 100 tests.
  12322. 1341.32 s [vector] mapM: OK
  12323. 1341.32 s [vector] +++ OK, passed 100 tests.
  12324. 1341.35 s [vector] mapM_: OK (0.04s)
  12325. 1341.35 s [vector] +++ OK, passed 100 tests.
  12326. 1341.36 s [vector] forM: OK
  12327. 1341.36 s [vector] +++ OK, passed 100 tests.
  12328. 1341.39 s [vector] forM_: OK (0.03s)
  12329. 1341.39 s [vector] +++ OK, passed 100 tests.
  12330. 1341.40 s [vector] imapM: OK
  12331. 1341.40 s [vector] +++ OK, passed 100 tests.
  12332. 1341.43 s [vector] imapM_: OK (0.03s)
  12333. 1341.43 s [vector] +++ OK, passed 100 tests.
  12334. 1341.43 s [vector] zipWith: OK
  12335. 1341.44 s [vector] +++ OK, passed 100 tests.
  12336. 1341.45 s [vector] zipWith3: OK (0.01s)
  12337. 1341.45 s [vector] +++ OK, passed 100 tests.
  12338. 1341.46 s [vector] izipWith: OK
  12339. 1341.46 s [vector] +++ OK, passed 100 tests.
  12340. 1341.48 s [vector] izipWith3: OK (0.01s)
  12341. 1341.48 s [vector] +++ OK, passed 100 tests.
  12342. 1341.48 s [vector] izipWithM: OK
  12343. 1341.48 s [vector] +++ OK, passed 100 tests.
  12344. 1341.52 s [vector] izipWithM_: OK (0.03s)
  12345. 1341.52 s [vector] +++ OK, passed 100 tests.
  12346. 1341.52 s [vector] zipWithM: OK
  12347. 1341.52 s [vector] +++ OK, passed 100 tests.
  12348. 1341.55 s [vector] zipWithM_: OK (0.03s)
  12349. 1341.55 s [vector] +++ OK, passed 100 tests.
  12350. 1341.55 s [vector] filter: OK
  12351. 1341.56 s [vector] +++ OK, passed 100 tests.
  12352. 1341.58 s [vector] ifilter: OK
  12353. 1341.58 s [vector] +++ OK, passed 100 tests.
  12354. 1341.61 s [vector] filterM: OK (0.05s)
  12355. 1341.61 s [vector] +++ OK, passed 100 tests.
  12356. 1341.62 s [vector] uniq: OK
  12357. 1341.62 s [vector] +++ OK, passed 100 tests.
  12358. 1341.62 s [vector] mapMaybe: OK
  12359. 1341.63 s [vector] +++ OK, passed 100 tests.
  12360. 1341.64 s [vector] imapMaybe: OK
  12361. 1341.64 s [vector] +++ OK, passed 100 tests.
  12362. 1341.64 s [vector] takeWhile: OK
  12363. 1341.64 s [vector] +++ OK, passed 100 tests.
  12364. 1341.64 s [vector] dropWhile: OK
  12365. 1341.64 s [vector] +++ OK, passed 100 tests.
  12366. 1341.64 s [vector] partition: OK
  12367. 1341.64 s [vector] +++ OK, passed 100 tests.
  12368. 1341.64 s [vector] partitionWith: OK
  12369. 1341.64 s [vector] +++ OK, passed 100 tests.
  12370. 1341.64 s [vector] span: OK
  12371. 1341.64 s [vector] +++ OK, passed 100 tests.
  12372. 1341.64 s [vector] break: OK
  12373. 1341.64 s [vector] +++ OK, passed 100 tests.
  12374. 1341.64 s [vector] spanR: OK
  12375. 1341.65 s [vector] +++ OK, passed 100 tests.
  12376. 1341.65 s [vector] breakR: OK
  12377. 1341.65 s [vector] +++ OK, passed 100 tests.
  12378. 1341.65 s [vector] groupBy: OK
  12379. 1341.65 s [vector] +++ OK, passed 100 tests.
  12380. 1341.65 s [vector] elem: OK
  12381. 1341.66 s [vector] +++ OK, passed 100 tests.
  12382. 1341.66 s [vector] notElem: OK
  12383. 1341.66 s [vector] +++ OK, passed 100 tests.
  12384. 1341.66 s [vector] find: OK
  12385. 1341.66 s [vector] +++ OK, passed 100 tests.
  12386. 1341.66 s [vector] findIndex: OK
  12387. 1341.66 s [vector] +++ OK, passed 100 tests.
  12388. 1341.66 s [vector] findIndexR: OK
  12389. 1341.66 s [vector] +++ OK, passed 100 tests.
  12390. 1341.67 s [vector] findIndices: OK
  12391. 1341.67 s [vector] +++ OK, passed 100 tests.
  12392. 1341.67 s [vector] elemIndex: OK
  12393. 1341.67 s [vector] +++ OK, passed 100 tests.
  12394. 1341.67 s [vector] elemIndices: OK
  12395. 1341.67 s [vector] +++ OK, passed 100 tests.
  12396. 1341.68 s [haskell-language-server] Preprocessing library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
  12397. 1341.68 s [haskell-language-server] Building library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0..
  12398. 1341.69 s [vector] foldl: OK (0.01s)
  12399. 1341.69 s [vector] +++ OK, passed 100 tests.
  12400. 1341.70 s [vector] foldl1: OK (0.01s)
  12401. 1341.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12402. 1341.70 s [vector] foldl': OK (0.01s)
  12403. 1341.70 s [vector] +++ OK, passed 100 tests.
  12404. 1341.72 s [vector] foldl1': OK
  12405. 1341.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12406. 1341.73 s [vector] foldr: OK (0.01s)
  12407. 1341.73 s [vector] +++ OK, passed 100 tests.
  12408. 1341.74 s [vector] foldr1: OK
  12409. 1341.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12410. 1341.76 s [vector] foldr': OK (0.01s)
  12411. 1341.76 s [vector] +++ OK, passed 100 tests.
  12412. 1341.77 s [vector] foldr1': OK (0.01s)
  12413. 1341.77 s [vector] +++ OK, passed 100 tests; 24 discarded.
  12414. 1341.78 s [vector] ifoldl: OK (0.01s)
  12415. 1341.78 s [vector] +++ OK, passed 100 tests.
  12416. 1341.80 s [vector] ifoldl': OK (0.01s)
  12417. 1341.80 s [vector] +++ OK, passed 100 tests.
  12418. 1341.80 s [vector] ifoldr: OK (0.01s)
  12419. 1341.80 s [vector] +++ OK, passed 100 tests.
  12420. 1341.82 s [vector] ifoldr': OK (0.01s)
  12421. 1341.82 s [vector] +++ OK, passed 100 tests.
  12422. 1341.84 s [vector] ifoldM: OK (0.01s)
  12423. 1341.84 s [vector] +++ OK, passed 100 tests.
  12424. 1341.84 s [vector] ifoldM': OK (0.01s)
  12425. 1341.84 s [vector] +++ OK, passed 100 tests.
  12426. 1341.85 s [haskell-language-server]
  12427. 1341.85 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  12428. 1341.85 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  12429. 1341.85 s [haskell-language-server] but were not needed for compilation:
  12430. 1341.85 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)
  12431. 1341.87 s [haskell-language-server] [1 of 8] Compiling Ide.Plugin.SemanticTokens.Types ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Types.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.dyn_o )
  12432. 1341.88 s [vector] ifoldM_: OK (0.03s)
  12433. 1341.88 s [vector] +++ OK, passed 100 tests.
  12434. 1341.90 s [vector] ifoldM'_: OK (0.03s)
  12435. 1341.90 s [vector] +++ OK, passed 100 tests.
  12436. 1341.91 s [vector] all: OK
  12437. 1341.92 s [vector] +++ OK, passed 100 tests.
  12438. 1341.92 s [vector] any: OK
  12439. 1341.94 s [vector] +++ OK, passed 100 tests.
  12440. 1341.94 s [vector] prescanl: OK (0.01s)
  12441. 1341.94 s [vector] +++ OK, passed 100 tests.
  12442. 1341.95 s [vector] prescanl': OK (0.01s)
  12443. 1341.95 s [vector] +++ OK, passed 100 tests.
  12444. 1341.96 s [vector] postscanl: OK (0.01s)
  12445. 1341.97 s [vector] +++ OK, passed 100 tests.
  12446. 1341.98 s [vector] postscanl': OK (0.01s)
  12447. 1341.98 s [vector] +++ OK, passed 100 tests.
  12448. 1341.98 s [vector] scanl: OK (0.02s)
  12449. 1341.98 s [vector] +++ OK, passed 100 tests.
  12450. 1342.00 s [vector] scanl': OK (0.02s)
  12451. 1342.00 s [vector] +++ OK, passed 100 tests.
  12452. 1342.02 s [vector] scanl1: OK (0.02s)
  12453. 1342.02 s [vector] +++ OK, passed 100 tests.
  12454. 1342.04 s [vector] scanl1': OK (0.02s)
  12455. 1342.04 s [vector] +++ OK, passed 100 tests.
  12456. 1342.04 s [vector] iscanl: OK (0.01s)
  12457. 1342.04 s [vector] +++ OK, passed 100 tests.
  12458. 1342.06 s [vector] iscanl': OK (0.01s)
  12459. 1342.06 s [vector] +++ OK, passed 100 tests.
  12460. 1342.08 s [vector] prescanr: OK (0.01s)
  12461. 1342.08 s [vector] +++ OK, passed 100 tests.
  12462. 1342.08 s [vector] prescanr': OK (0.01s)
  12463. 1342.08 s [vector] +++ OK, passed 100 tests.
  12464. 1342.10 s [vector] postscanr: OK (0.02s)
  12465. 1342.10 s [vector] +++ OK, passed 100 tests.
  12466. 1342.12 s [vector] postscanr': OK (0.01s)
  12467. 1342.12 s [vector] +++ OK, passed 100 tests.
  12468. 1342.13 s [vector] scanr: OK (0.01s)
  12469. 1342.14 s [vector] +++ OK, passed 100 tests.
  12470. 1342.14 s [vector] scanr': OK (0.01s)
  12471. 1342.14 s [vector] +++ OK, passed 100 tests.
  12472. 1342.16 s [vector] scanr1: OK (0.01s)
  12473. 1342.16 s [vector] +++ OK, passed 100 tests.
  12474. 1342.16 s [vector] scanr1': OK (0.01s)
  12475. 1342.16 s [vector] +++ OK, passed 100 tests.
  12476. 1342.18 s [vector] iscanr: OK (0.02s)
  12477. 1342.18 s [vector] +++ OK, passed 100 tests.
  12478. 1342.21 s [vector] iscanr': OK (0.03s)
  12479. 1342.21 s [vector] +++ OK, passed 100 tests.
  12480. 1342.21 s [vector] mut_read: OK
  12481. 1342.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12482. 1342.21 s [vector] mut_write: OK
  12483. 1342.21 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12484. 1342.22 s [vector] mut_modify: OK
  12485. 1342.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12486. 1342.22 s [vector] mut_generate: OK
  12487. 1342.22 s [vector] +++ OK, passed 100 tests.
  12488. 1342.24 s [vector] mut_generateM: OK (0.02s)
  12489. 1342.24 s [vector] +++ OK, passed 100 tests.
  12490. 1342.28 s [vector] mut_mapM_: OK (0.03s)
  12491. 1342.28 s [vector] +++ OK, passed 100 tests.
  12492. 1342.30 s [vector] mut_imapM_: OK (0.03s)
  12493. 1342.30 s [vector] +++ OK, passed 100 tests.
  12494. 1342.34 s [vector] mut_forM_: OK (0.04s)
  12495. 1342.34 s [vector] +++ OK, passed 100 tests.
  12496. 1342.38 s [vector] mut_iforM_: OK (0.03s)
  12497. 1342.38 s [vector] +++ OK, passed 100 tests.
  12498. 1342.38 s [vector] mut_foldr: OK (0.01s)
  12499. 1342.38 s [vector] +++ OK, passed 100 tests.
  12500. 1342.40 s [vector] mut_foldr': OK (0.01s)
  12501. 1342.40 s [vector] +++ OK, passed 100 tests.
  12502. 1342.41 s [vector] mut_foldl: OK (0.01s)
  12503. 1342.42 s [vector] +++ OK, passed 100 tests.
  12504. 1342.42 s [vector] mut_foldl': OK (0.01s)
  12505. 1342.43 s [vector] +++ OK, passed 100 tests.
  12506. 1342.44 s [vector] mut_ifoldr: OK (0.01s)
  12507. 1342.44 s [vector] +++ OK, passed 100 tests.
  12508. 1342.45 s [vector] mut_ifoldr': OK (0.01s)
  12509. 1342.45 s [vector] +++ OK, passed 100 tests.
  12510. 1342.46 s [vector] mut_ifoldl: OK (0.01s)
  12511. 1342.46 s [vector] +++ OK, passed 100 tests.
  12512. 1342.48 s [vector] mut_ifoldl': OK (0.01s)
  12513. 1342.48 s [vector] +++ OK, passed 100 tests.
  12514. 1342.48 s [vector] mut_foldM: OK (0.01s)
  12515. 1342.48 s [vector] +++ OK, passed 100 tests.
  12516. 1342.50 s [vector] mut_foldM': OK (0.01s)
  12517. 1342.50 s [vector] +++ OK, passed 100 tests.
  12518. 1342.51 s [vector] mut_foldrM: OK (0.01s)
  12519. 1342.52 s [vector] +++ OK, passed 100 tests.
  12520. 1342.52 s [vector] mut_foldrM': OK (0.01s)
  12521. 1342.52 s [vector] +++ OK, passed 100 tests.
  12522. 1342.54 s [vector] mut_ifoldM: OK (0.01s)
  12523. 1342.54 s [vector] +++ OK, passed 100 tests.
  12524. 1342.54 s [vector] mut_ifoldM': OK (0.01s)
  12525. 1342.55 s [vector] +++ OK, passed 100 tests.
  12526. 1342.56 s [vector] mut_ifoldrM: OK (0.01s)
  12527. 1342.56 s [vector] +++ OK, passed 100 tests.
  12528. 1342.57 s [vector] mut_ifoldrM': OK (0.02s)
  12529. 1342.57 s [vector] +++ OK, passed 100 tests.
  12530. 1342.57 s [vector] compare: OK
  12531. 1342.57 s [vector] +++ OK, passed 100 tests.
  12532. 1342.57 s [vector] maximum: OK
  12533. 1342.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12534. 1342.57 s [vector] minimum: OK
  12535. 1342.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12536. 1342.57 s [vector] minIndex: OK
  12537. 1342.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12538. 1342.58 s [vector] maxIndex: OK
  12539. 1342.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12540. 1342.58 s [vector] maximumBy: OK
  12541. 1342.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12542. 1342.58 s [vector] minimumBy: OK
  12543. 1342.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12544. 1342.58 s [vector] maximumOn: OK
  12545. 1342.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12546. 1342.58 s [vector] minimumOn: OK
  12547. 1342.58 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12548. 1342.59 s [vector] maxIndexBy: OK
  12549. 1342.59 s [vector] +++ OK, passed 100 tests; 26 discarded.
  12550. 1342.59 s [vector] minIndexBy: OK
  12551. 1342.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12552. 1342.59 s [vector] ListFirstMaxIndexWins: OK
  12553. 1342.59 s [vector] +++ OK, passed 100 tests; 27 discarded.
  12554. 1342.59 s [vector] FalseListFirstMaxIndexWins: OK
  12555. 1342.59 s [vector] +++ OK, failed as expected. (after 1 test):
  12556. 1342.59 s [vector] Exception:
  12557. 1342.59 s [vector] Prelude.foldr1: empty list
  12558. 1342.59 s [vector] CallStack (from HasCallStack):
  12559. 1342.59 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  12560. 1342.59 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  12561. 1342.59 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12562. 1342.59 s [vector] []
  12563. 1342.59 s [vector] mempty: OK
  12564. 1342.59 s [vector] +++ OK, passed 100 tests.
  12565. 1342.60 s [vector] mappend: OK
  12566. 1342.60 s [vector] +++ OK, passed 100 tests.
  12567. 1342.62 s [vector] mconcat: OK (0.03s)
  12568. 1342.62 s [vector] +++ OK, passed 100 tests.
  12569. 1342.62 s [vector] glength: OK
  12570. 1342.62 s [vector] +++ OK, passed 100 tests.
  12571. 1342.62 s [vector] sum: OK
  12572. 1342.62 s [vector] +++ OK, passed 100 tests.
  12573. 1342.63 s [vector] product: OK
  12574. 1342.63 s [vector] +++ OK, passed 100 tests.
  12575. 1342.63 s [vector] enumFromN: OK
  12576. 1342.63 s [vector] +++ OK, passed 100 tests.
  12577. 1342.63 s [vector] enumFromThenN: OK
  12578. 1342.63 s [vector] +++ OK, passed 100 tests.
  12579. 1342.63 s [vector] enumFromTo: OK
  12580. 1342.63 s [vector] +++ OK, passed 100 tests.
  12581. 1342.63 s [vector] enumFromThenTo: OK
  12582. 1342.63 s [vector] +++ OK, passed 100 tests; 2 discarded.
  12583. 1342.63 s [vector] unstream
  12584. 1342.63 s [vector] unstream == vunstream (exact): OK
  12585. 1342.63 s [vector] +++ OK, passed 100 tests.
  12586. 1342.63 s [vector] unstream == vunstream (unknown): OK
  12587. 1342.63 s [vector] +++ OK, passed 100 tests.
  12588. 1342.63 s [vector] unstreamR ~= vunstream (exact): OK
  12589. 1342.63 s [vector] +++ OK, passed 100 tests.
  12590. 1342.63 s [vector] unstreamR ~= vunstream (unknown): OK
  12591. 1342.63 s [vector] +++ OK, passed 100 tests.
  12592. 1342.63 s [vector] Tests.Vector.Storable
  12593. 1342.63 s [vector] Data.Vector.Storable.Vector (Int)
  12594. 1342.63 s [vector] fromList.toList == id: OK
  12595. 1342.63 s [vector] +++ OK, passed 100 tests.
  12596. 1342.63 s [vector] toList.fromList == id: OK
  12597. 1342.63 s [vector] +++ OK, passed 100 tests.
  12598. 1342.63 s [vector] unstream.stream == id: OK
  12599. 1342.63 s [vector] +++ OK, passed 100 tests.
  12600. 1342.63 s [vector] stream.unstream == id: OK
  12601. 1342.63 s [vector] +++ OK, passed 100 tests.
  12602. 1342.63 s [vector] eq: OK
  12603. 1342.63 s [vector] +++ OK, passed 100 tests.
  12604. 1342.63 s [vector] length: OK
  12605. 1342.63 s [vector] +++ OK, passed 100 tests.
  12606. 1342.63 s [vector] null: OK
  12607. 1342.63 s [vector] +++ OK, passed 100 tests.
  12608. 1342.63 s [vector] index: OK
  12609. 1342.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12610. 1342.63 s [vector] safeIndex: OK
  12611. 1342.63 s [vector] +++ OK, passed 100 tests.
  12612. 1342.63 s [vector] head: OK
  12613. 1342.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12614. 1342.63 s [vector] last: OK
  12615. 1342.63 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12616. 1342.63 s [vector] unsafeIndex: OK
  12617. 1342.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12618. 1342.63 s [vector] unsafeHead: OK
  12619. 1342.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12620. 1342.64 s [vector] unsafeLast: OK
  12621. 1342.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12622. 1342.64 s [vector] slice: OK
  12623. 1342.64 s [vector] +++ OK, passed 100 tests.
  12624. 1342.64 s [vector] init: OK
  12625. 1342.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12626. 1342.64 s [vector] tail: OK
  12627. 1342.64 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12628. 1342.64 s [vector] take: OK
  12629. 1342.64 s [vector] +++ OK, passed 100 tests.
  12630. 1342.64 s [vector] drop: OK
  12631. 1342.64 s [vector] +++ OK, passed 100 tests.
  12632. 1342.64 s [vector] splitAt: OK
  12633. 1342.64 s [vector] +++ OK, passed 100 tests.
  12634. 1342.64 s [vector] empty: OK
  12635. 1342.64 s [vector] +++ OK, passed 100 tests.
  12636. 1342.64 s [vector] singleton: OK
  12637. 1342.64 s [vector] +++ OK, passed 100 tests.
  12638. 1342.64 s [vector] replicate: OK
  12639. 1342.64 s [vector] +++ OK, passed 100 tests.
  12640. 1342.64 s [vector] generate: OK
  12641. 1342.64 s [vector] +++ OK, passed 100 tests.
  12642. 1342.66 s [vector] iterateN: OK
  12643. 1342.66 s [vector] +++ OK, passed 100 tests.
  12644. 1342.68 s [vector] iterateNM: OK (0.03s)
  12645. 1342.68 s [vector] +++ OK, passed 100 tests.
  12646. 1342.69 s [vector] generateM: OK (0.01s)
  12647. 1342.69 s [vector] +++ OK, passed 100 tests.
  12648. 1342.69 s [vector] replicateM: OK
  12649. 1342.69 s [vector] +++ OK, passed 100 tests.
  12650. 1342.69 s [vector] create: OK
  12651. 1342.69 s [vector] +++ OK, passed 100 tests.
  12652. 1342.69 s [vector] createT: OK
  12653. 1342.69 s [vector] +++ OK, passed 100 tests.
  12654. 1342.69 s [vector] unfoldr: OK
  12655. 1342.69 s [vector] +++ OK, passed 100 tests.
  12656. 1342.69 s [vector] unfoldrN: OK
  12657. 1342.69 s [vector] +++ OK, passed 100 tests.
  12658. 1342.70 s [vector] unfoldrExactN: OK
  12659. 1342.70 s [vector] +++ OK, passed 100 tests.
  12660. 1342.70 s [vector] unfoldrM: OK
  12661. 1342.70 s [vector] +++ OK, passed 100 tests.
  12662. 1342.70 s [vector] unfoldrNM: OK
  12663. 1342.70 s [vector] +++ OK, passed 100 tests.
  12664. 1342.71 s [vector] unfoldrExactNM: OK
  12665. 1342.72 s [vector] +++ OK, passed 100 tests.
  12666. 1342.72 s [vector] constructN: OK
  12667. 1342.72 s [vector] +++ OK, passed 100 tests.
  12668. 1342.72 s [vector] constructrN: OK
  12669. 1342.72 s [vector] +++ OK, passed 100 tests.
  12670. 1342.72 s [vector] cons: OK
  12671. 1342.72 s [vector] +++ OK, passed 100 tests.
  12672. 1342.72 s [vector] snoc: OK
  12673. 1342.72 s [vector] +++ OK, passed 100 tests.
  12674. 1342.72 s [vector] append: OK
  12675. 1342.72 s [vector] +++ OK, passed 100 tests.
  12676. 1342.73 s [vector] concat: OK (0.01s)
  12677. 1342.73 s [vector] +++ OK, passed 100 tests.
  12678. 1342.73 s [vector] force: OK
  12679. 1342.73 s [vector] +++ OK, passed 100 tests.
  12680. 1342.73 s [vector] upd: OK
  12681. 1342.74 s [vector] +++ OK, passed 100 tests.
  12682. 1342.74 s [vector] accum: OK
  12683. 1342.74 s [vector] +++ OK, passed 100 tests.
  12684. 1342.74 s [vector] reverse: OK
  12685. 1342.74 s [vector] +++ OK, passed 100 tests.
  12686. 1342.74 s [vector] backpermute: OK
  12687. 1342.74 s [vector] +++ OK, passed 100 tests.
  12688. 1342.74 s [vector] map: OK
  12689. 1342.75 s [vector] +++ OK, passed 100 tests.
  12690. 1342.75 s [vector] imap: OK
  12691. 1342.75 s [vector] +++ OK, passed 100 tests.
  12692. 1342.75 s [vector] concatMap: OK
  12693. 1342.75 s [vector] +++ OK, passed 100 tests.
  12694. 1342.76 s [vector] mapM: OK
  12695. 1342.76 s [vector] +++ OK, passed 100 tests.
  12696. 1342.77 s [vector] mapM_: OK (0.02s)
  12697. 1342.78 s [vector] +++ OK, passed 100 tests.
  12698. 1342.78 s [vector] forM: OK
  12699. 1342.78 s [vector] +++ OK, passed 100 tests.
  12700. 1342.79 s [vector] forM_: OK (0.02s)
  12701. 1342.79 s [vector] +++ OK, passed 100 tests.
  12702. 1342.80 s [vector] imapM: OK
  12703. 1342.80 s [vector] +++ OK, passed 100 tests.
  12704. 1342.82 s [vector] imapM_: OK (0.02s)
  12705. 1342.82 s [vector] +++ OK, passed 100 tests.
  12706. 1342.82 s [vector] zipWith: OK
  12707. 1342.82 s [vector] +++ OK, passed 100 tests.
  12708. 1342.82 s [vector] zipWith3: OK
  12709. 1342.82 s [vector] +++ OK, passed 100 tests.
  12710. 1342.82 s [vector] izipWith: OK
  12711. 1342.82 s [vector] +++ OK, passed 100 tests.
  12712. 1342.83 s [vector] izipWith3: OK
  12713. 1342.83 s [vector] +++ OK, passed 100 tests.
  12714. 1342.84 s [vector] izipWithM: OK
  12715. 1342.84 s [vector] +++ OK, passed 100 tests.
  12716. 1342.84 s [vector] izipWithM_: OK (0.01s)
  12717. 1342.84 s [vector] +++ OK, passed 100 tests.
  12718. 1342.85 s [vector] zipWithM: OK
  12719. 1342.86 s [vector] +++ OK, passed 100 tests.
  12720. 1342.86 s [vector] zipWithM_: OK (0.01s)
  12721. 1342.86 s [vector] +++ OK, passed 100 tests.
  12722. 1342.86 s [vector] filter: OK
  12723. 1342.86 s [vector] +++ OK, passed 100 tests.
  12724. 1342.86 s [vector] ifilter: OK
  12725. 1342.86 s [vector] +++ OK, passed 100 tests.
  12726. 1342.88 s [vector] filterM: OK (0.02s)
  12727. 1342.88 s [vector] +++ OK, passed 100 tests.
  12728. 1342.88 s [vector] uniq: OK
  12729. 1342.88 s [vector] +++ OK, passed 100 tests.
  12730. 1342.88 s [vector] mapMaybe: OK
  12731. 1342.88 s [vector] +++ OK, passed 100 tests.
  12732. 1342.89 s [vector] imapMaybe: OK
  12733. 1342.89 s [vector] +++ OK, passed 100 tests.
  12734. 1342.89 s [vector] takeWhile: OK
  12735. 1342.89 s [vector] +++ OK, passed 100 tests.
  12736. 1342.89 s [vector] dropWhile: OK
  12737. 1342.89 s [vector] +++ OK, passed 100 tests.
  12738. 1342.89 s [vector] partition: OK
  12739. 1342.89 s [vector] +++ OK, passed 100 tests.
  12740. 1342.89 s [vector] partitionWith: OK
  12741. 1342.89 s [vector] +++ OK, passed 100 tests.
  12742. 1342.89 s [vector] span: OK
  12743. 1342.89 s [vector] +++ OK, passed 100 tests.
  12744. 1342.90 s [vector] break: OK
  12745. 1342.90 s [vector] +++ OK, passed 100 tests.
  12746. 1342.90 s [vector] spanR: OK
  12747. 1342.90 s [vector] +++ OK, passed 100 tests.
  12748. 1342.90 s [vector] breakR: OK
  12749. 1342.90 s [vector] +++ OK, passed 100 tests.
  12750. 1342.90 s [vector] groupBy: OK
  12751. 1342.90 s [vector] +++ OK, passed 100 tests.
  12752. 1342.90 s [vector] elem: OK
  12753. 1342.90 s [vector] +++ OK, passed 100 tests.
  12754. 1342.90 s [vector] notElem: OK
  12755. 1342.90 s [vector] +++ OK, passed 100 tests.
  12756. 1342.90 s [vector] find: OK
  12757. 1342.90 s [vector] +++ OK, passed 100 tests.
  12758. 1342.90 s [vector] findIndex: OK
  12759. 1342.90 s [vector] +++ OK, passed 100 tests.
  12760. 1342.90 s [vector] findIndexR: OK
  12761. 1342.90 s [vector] +++ OK, passed 100 tests.
  12762. 1342.90 s [vector] findIndices: OK
  12763. 1342.90 s [vector] +++ OK, passed 100 tests.
  12764. 1342.91 s [vector] elemIndex: OK
  12765. 1342.91 s [vector] +++ OK, passed 100 tests.
  12766. 1342.91 s [vector] elemIndices: OK
  12767. 1342.91 s [vector] +++ OK, passed 100 tests.
  12768. 1342.91 s [vector] foldl: OK
  12769. 1342.91 s [vector] +++ OK, passed 100 tests.
  12770. 1342.91 s [vector] foldl1: OK
  12771. 1342.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12772. 1342.92 s [vector] foldl': OK
  12773. 1342.92 s [vector] +++ OK, passed 100 tests.
  12774. 1342.93 s [vector] foldl1': OK
  12775. 1342.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12776. 1342.93 s [vector] foldr: OK
  12777. 1342.93 s [vector] +++ OK, passed 100 tests.
  12778. 1342.94 s [vector] foldr1: OK
  12779. 1342.94 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12780. 1342.94 s [vector] foldr': OK
  12781. 1342.94 s [vector] +++ OK, passed 100 tests.
  12782. 1342.94 s [vector] foldr1': OK
  12783. 1342.94 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12784. 1342.95 s [vector] ifoldl: OK
  12785. 1342.95 s [vector] +++ OK, passed 100 tests.
  12786. 1342.95 s [vector] ifoldl': OK
  12787. 1342.95 s [vector] +++ OK, passed 100 tests.
  12788. 1342.95 s [vector] ifoldr: OK
  12789. 1342.96 s [vector] +++ OK, passed 100 tests.
  12790. 1342.96 s [vector] ifoldr': OK
  12791. 1342.96 s [vector] +++ OK, passed 100 tests.
  12792. 1342.96 s [vector] ifoldM: OK
  12793. 1342.96 s [vector] +++ OK, passed 100 tests.
  12794. 1342.96 s [vector] ifoldM': OK
  12795. 1342.96 s [vector] +++ OK, passed 100 tests.
  12796. 1342.98 s [vector] ifoldM_: OK (0.02s)
  12797. 1342.98 s [vector] +++ OK, passed 100 tests.
  12798. 1342.99 s [vector] ifoldM'_: OK (0.02s)
  12799. 1342.99 s [vector] +++ OK, passed 100 tests.
  12800. 1342.99 s [vector] all: OK
  12801. 1342.99 s [vector] +++ OK, passed 100 tests.
  12802. 1342.99 s [vector] any: OK
  12803. 1342.99 s [vector] +++ OK, passed 100 tests.
  12804. 1343.00 s [vector] prescanl: OK
  12805. 1343.00 s [vector] +++ OK, passed 100 tests.
  12806. 1343.00 s [vector] prescanl': OK
  12807. 1343.00 s [vector] +++ OK, passed 100 tests.
  12808. 1343.00 s [vector] postscanl: OK
  12809. 1343.00 s [vector] +++ OK, passed 100 tests.
  12810. 1343.00 s [vector] postscanl': OK
  12811. 1343.00 s [vector] +++ OK, passed 100 tests.
  12812. 1343.01 s [vector] scanl: OK
  12813. 1343.01 s [vector] +++ OK, passed 100 tests.
  12814. 1343.01 s [vector] scanl': OK
  12815. 1343.01 s [vector] +++ OK, passed 100 tests.
  12816. 1343.01 s [vector] scanl1: OK
  12817. 1343.20 s [vector] +++ OK, passed 100 tests.
  12818. 1343.20 s [vector] scanl1': OK
  12819. 1343.20 s [vector] +++ OK, passed 100 tests.
  12820. 1343.20 s [vector] iscanl: OK
  12821. 1343.20 s [vector] +++ OK, passed 100 tests.
  12822. 1343.20 s [vector] iscanl': OK
  12823. 1343.20 s [vector] +++ OK, passed 100 tests.
  12824. 1343.20 s [vector] prescanr: OK
  12825. 1343.20 s [vector] +++ OK, passed 100 tests.
  12826. 1343.20 s [vector] prescanr': OK
  12827. 1343.20 s [vector] +++ OK, passed 100 tests.
  12828. 1343.20 s [vector] postscanr: OK
  12829. 1343.20 s [vector] +++ OK, passed 100 tests.
  12830. 1343.20 s [vector] postscanr': OK
  12831. 1343.20 s [vector] +++ OK, passed 100 tests.
  12832. 1343.20 s [vector] scanr: OK
  12833. 1343.20 s [vector] +++ OK, passed 100 tests.
  12834. 1343.20 s [vector] scanr': OK
  12835. 1343.20 s [vector] +++ OK, passed 100 tests.
  12836. 1343.20 s [vector] scanr1: OK
  12837. 1343.20 s [vector] +++ OK, passed 100 tests.
  12838. 1343.20 s [vector] scanr1': OK
  12839. 1343.20 s [vector] +++ OK, passed 100 tests.
  12840. 1343.20 s [vector] iscanr: OK
  12841. 1343.20 s [vector] +++ OK, passed 100 tests.
  12842. 1343.20 s [vector] iscanr': OK
  12843. 1343.20 s [vector] +++ OK, passed 100 tests.
  12844. 1343.20 s [vector] mut_read: OK
  12845. 1343.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12846. 1343.20 s [vector] mut_write: OK
  12847. 1343.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12848. 1343.20 s [vector] mut_modify: OK
  12849. 1343.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12850. 1343.20 s [vector] mut_generate: OK
  12851. 1343.20 s [vector] +++ OK, passed 100 tests.
  12852. 1343.20 s [vector] mut_generateM: OK
  12853. 1343.20 s [vector] +++ OK, passed 100 tests.
  12854. 1343.20 s [vector] mut_mapM_: OK (0.01s)
  12855. 1343.20 s [vector] +++ OK, passed 100 tests.
  12856. 1343.20 s [vector] mut_imapM_: OK (0.01s)
  12857. 1343.20 s [vector] +++ OK, passed 100 tests.
  12858. 1343.20 s [vector] mut_forM_: OK (0.02s)
  12859. 1343.20 s [vector] +++ OK, passed 100 tests.
  12860. 1343.20 s [vector] mut_iforM_: OK (0.01s)
  12861. 1343.20 s [vector] +++ OK, passed 100 tests.
  12862. 1343.20 s [vector] mut_foldr: OK
  12863. 1343.20 s [vector] +++ OK, passed 100 tests.
  12864. 1343.20 s [vector] mut_foldr': OK
  12865. 1343.20 s [vector] +++ OK, passed 100 tests.
  12866. 1343.20 s [vector] mut_foldl: OK
  12867. 1343.20 s [vector] +++ OK, passed 100 tests.
  12868. 1343.20 s [vector] mut_foldl': OK
  12869. 1343.20 s [vector] +++ OK, passed 100 tests.
  12870. 1343.20 s [vector] mut_ifoldr: OK
  12871. 1343.20 s [vector] +++ OK, passed 100 tests.
  12872. 1343.20 s [vector] mut_ifoldr': OK
  12873. 1343.20 s [vector] +++ OK, passed 100 tests.
  12874. 1343.20 s [vector] mut_ifoldl: OK
  12875. 1343.20 s [vector] +++ OK, passed 100 tests.
  12876. 1343.20 s [vector] mut_ifoldl': OK
  12877. 1343.20 s [vector] +++ OK, passed 100 tests.
  12878. 1343.20 s [vector] mut_foldM: OK
  12879. 1343.20 s [vector] +++ OK, passed 100 tests.
  12880. 1343.20 s [vector] mut_foldM': OK
  12881. 1343.20 s [vector] +++ OK, passed 100 tests.
  12882. 1343.20 s [vector] mut_foldrM: OK
  12883. 1343.20 s [vector] +++ OK, passed 100 tests.
  12884. 1343.20 s [vector] mut_foldrM': OK
  12885. 1343.20 s [vector] +++ OK, passed 100 tests.
  12886. 1343.20 s [vector] mut_ifoldM: OK
  12887. 1343.20 s [vector] +++ OK, passed 100 tests.
  12888. 1343.20 s [vector] mut_ifoldM': OK
  12889. 1343.20 s [vector] +++ OK, passed 100 tests.
  12890. 1343.20 s [vector] mut_ifoldrM: OK
  12891. 1343.20 s [vector] +++ OK, passed 100 tests.
  12892. 1343.20 s [vector] mut_ifoldrM': OK
  12893. 1343.20 s [vector] +++ OK, passed 100 tests.
  12894. 1343.20 s [vector] compare: OK
  12895. 1343.20 s [vector] +++ OK, passed 100 tests.
  12896. 1343.20 s [vector] maximum: OK
  12897. 1343.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12898. 1343.20 s [vector] minimum: OK
  12899. 1343.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12900. 1343.20 s [vector] minIndex: OK
  12901. 1343.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12902. 1343.20 s [vector] maxIndex: OK
  12903. 1343.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12904. 1343.20 s [vector] maximumBy: OK
  12905. 1343.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12906. 1343.20 s [vector] minimumBy: OK
  12907. 1343.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12908. 1343.20 s [vector] maximumOn: OK
  12909. 1343.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12910. 1343.20 s [vector] minimumOn: OK
  12911. 1343.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12912. 1343.20 s [vector] maxIndexBy: OK
  12913. 1343.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12914. 1343.20 s [vector] minIndexBy: OK
  12915. 1343.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12916. 1343.20 s [vector] ListFirstMaxIndexWins: OK
  12917. 1343.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12918. 1343.20 s [vector] FalseListFirstMaxIndexWins: OK
  12919. 1343.20 s [vector] +++ OK, failed as expected. (after 1 test):
  12920. 1343.20 s [vector] Exception:
  12921. 1343.20 s [vector] Prelude.foldr1: empty list
  12922. 1343.20 s [vector] CallStack (from HasCallStack):
  12923. 1343.20 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  12924. 1343.20 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  12925. 1343.20 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12926. 1343.20 s [vector] []
  12927. 1343.20 s [vector] mempty: OK
  12928. 1343.20 s [vector] +++ OK, passed 100 tests.
  12929. 1343.20 s [vector] mappend: OK
  12930. 1343.20 s [vector] +++ OK, passed 100 tests.
  12931. 1343.20 s [vector] mconcat: OK
  12932. 1343.20 s [vector] +++ OK, passed 100 tests.
  12933. 1343.20 s [vector] glength: OK
  12934. 1343.20 s [vector] +++ OK, passed 100 tests.
  12935. 1343.20 s [vector] sum: OK
  12936. 1343.20 s [vector] +++ OK, passed 100 tests.
  12937. 1343.20 s [vector] product: OK
  12938. 1343.20 s [vector] +++ OK, passed 100 tests.
  12939. 1343.20 s [vector] enumFromN: OK
  12940. 1343.20 s [vector] +++ OK, passed 100 tests.
  12941. 1343.20 s [vector] enumFromThenN: OK
  12942. 1343.20 s [vector] +++ OK, passed 100 tests.
  12943. 1343.20 s [vector] enumFromTo: OK
  12944. 1343.20 s [vector] +++ OK, passed 100 tests.
  12945. 1343.20 s [vector] enumFromThenTo: OK
  12946. 1343.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12947. 1343.20 s [vector] Data.Vector.Storable.Vector (Double)
  12948. 1343.20 s [vector] fromList.toList == id: OK
  12949. 1343.20 s [vector] +++ OK, passed 100 tests.
  12950. 1343.20 s [vector] toList.fromList == id: OK
  12951. 1343.20 s [vector] +++ OK, passed 100 tests.
  12952. 1343.20 s [vector] unstream.stream == id: OK
  12953. 1343.20 s [vector] +++ OK, passed 100 tests.
  12954. 1343.20 s [vector] stream.unstream == id: OK
  12955. 1343.20 s [vector] +++ OK, passed 100 tests.
  12956. 1343.20 s [vector] eq: OK
  12957. 1343.20 s [vector] +++ OK, passed 100 tests.
  12958. 1343.20 s [vector] length: OK
  12959. 1343.20 s [vector] +++ OK, passed 100 tests.
  12960. 1343.20 s [vector] null: OK
  12961. 1343.20 s [vector] +++ OK, passed 100 tests.
  12962. 1343.20 s [vector] index: OK
  12963. 1343.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12964. 1343.20 s [vector] safeIndex: OK
  12965. 1343.20 s [vector] +++ OK, passed 100 tests.
  12966. 1343.20 s [vector] head: OK
  12967. 1343.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12968. 1343.20 s [vector] last: OK
  12969. 1343.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12970. 1343.20 s [vector] unsafeIndex: OK
  12971. 1343.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12972. 1343.20 s [vector] unsafeHead: OK
  12973. 1343.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12974. 1343.20 s [vector] unsafeLast: OK
  12975. 1343.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12976. 1343.21 s [vector] slice: OK
  12977. 1343.21 s [vector] +++ OK, passed 100 tests.
  12978. 1343.21 s [vector] init: OK
  12979. 1343.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12980. 1343.21 s [vector] tail: OK
  12981. 1343.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12982. 1343.21 s [vector] take: OK
  12983. 1343.21 s [vector] +++ OK, passed 100 tests.
  12984. 1343.21 s [vector] drop: OK
  12985. 1343.21 s [vector] +++ OK, passed 100 tests.
  12986. 1343.21 s [vector] splitAt: OK
  12987. 1343.21 s [vector] +++ OK, passed 100 tests.
  12988. 1343.21 s [vector] empty: OK
  12989. 1343.21 s [vector] +++ OK, passed 100 tests.
  12990. 1343.21 s [vector] singleton: OK
  12991. 1343.21 s [vector] +++ OK, passed 100 tests.
  12992. 1343.21 s [vector] replicate: OK
  12993. 1343.21 s [vector] +++ OK, passed 100 tests.
  12994. 1343.21 s [vector] generate: OK
  12995. 1343.21 s [vector] +++ OK, passed 100 tests.
  12996. 1343.21 s [vector] iterateN: OK
  12997. 1343.21 s [vector] +++ OK, passed 100 tests.
  12998. 1343.22 s [vector] iterateNM: OK (0.02s)
  12999. 1343.22 s [vector] +++ OK, passed 100 tests.
  13000. 1343.25 s [vector] generateM: OK (0.03s)
  13001. 1343.25 s [vector] +++ OK, passed 100 tests.
  13002. 1343.25 s [vector] replicateM: OK
  13003. 1343.26 s [vector] +++ OK, passed 100 tests.
  13004. 1343.26 s [vector] create: OK
  13005. 1343.26 s [vector] +++ OK, passed 100 tests.
  13006. 1343.26 s [vector] createT: OK
  13007. 1343.26 s [vector] +++ OK, passed 100 tests.
  13008. 1343.26 s [vector] unfoldr: OK
  13009. 1343.26 s [vector] +++ OK, passed 100 tests.
  13010. 1343.26 s [vector] unfoldrN: OK
  13011. 1343.26 s [vector] +++ OK, passed 100 tests.
  13012. 1343.26 s [vector] unfoldrExactN: OK
  13013. 1343.26 s [vector] +++ OK, passed 100 tests.
  13014. 1343.26 s [vector] unfoldrM: OK
  13015. 1343.26 s [vector] +++ OK, passed 100 tests.
  13016. 1343.28 s [vector] unfoldrNM: OK
  13017. 1343.28 s [vector] +++ OK, passed 100 tests.
  13018. 1343.28 s [vector] unfoldrExactNM: OK (0.01s)
  13019. 1343.28 s [vector] +++ OK, passed 100 tests.
  13020. 1343.29 s [vector] constructN: OK (0.01s)
  13021. 1343.29 s [vector] +++ OK, passed 100 tests.
  13022. 1343.30 s [vector] constructrN: OK
  13023. 1343.30 s [vector] +++ OK, passed 100 tests.
  13024. 1343.30 s [vector] cons: OK
  13025. 1343.30 s [vector] +++ OK, passed 100 tests.
  13026. 1343.31 s [vector] snoc: OK
  13027. 1343.31 s [vector] +++ OK, passed 100 tests.
  13028. 1343.32 s [vector] append: OK
  13029. 1343.32 s [vector] +++ OK, passed 100 tests.
  13030. 1343.33 s [vector] concat: OK (0.02s)
  13031. 1343.33 s [vector] +++ OK, passed 100 tests.
  13032. 1343.33 s [vector] force: OK
  13033. 1343.33 s [vector] +++ OK, passed 100 tests.
  13034. 1343.34 s [vector] upd: OK
  13035. 1343.34 s [vector] +++ OK, passed 100 tests.
  13036. 1343.35 s [vector] accum: OK (0.01s)
  13037. 1343.35 s [vector] +++ OK, passed 100 tests.
  13038. 1343.35 s [vector] reverse: OK
  13039. 1343.35 s [vector] +++ OK, passed 100 tests.
  13040. 1343.36 s [vector] backpermute: OK
  13041. 1343.36 s [vector] +++ OK, passed 100 tests.
  13042. 1343.36 s [vector] map: OK
  13043. 1343.36 s [vector] +++ OK, passed 100 tests.
  13044. 1343.37 s [vector] imap: OK
  13045. 1343.37 s [vector] +++ OK, passed 100 tests.
  13046. 1343.38 s [vector] concatMap: OK
  13047. 1343.38 s [vector] +++ OK, passed 100 tests.
  13048. 1343.40 s [vector] mapM: OK
  13049. 1343.40 s [vector] +++ OK, passed 100 tests.
  13050. 1343.43 s [vector] mapM_: OK (0.04s)
  13051. 1343.43 s [vector] +++ OK, passed 100 tests.
  13052. 1343.43 s [vector] forM: OK
  13053. 1343.44 s [vector] +++ OK, passed 100 tests.
  13054. 1343.47 s [vector] forM_: OK (0.04s)
  13055. 1343.47 s [vector] +++ OK, passed 100 tests.
  13056. 1343.48 s [vector] imapM: OK
  13057. 1343.48 s [vector] +++ OK, passed 100 tests.
  13058. 1343.52 s [vector] imapM_: OK (0.04s)
  13059. 1343.52 s [vector] +++ OK, passed 100 tests.
  13060. 1343.52 s [vector] zipWith: OK
  13061. 1343.52 s [vector] +++ OK, passed 100 tests.
  13062. 1343.54 s [vector] zipWith3: OK (0.01s)
  13063. 1343.54 s [vector] +++ OK, passed 100 tests.
  13064. 1343.55 s [vector] izipWith: OK (0.01s)
  13065. 1343.55 s [vector] +++ OK, passed 100 tests.
  13066. 1343.56 s [vector] izipWith3: OK (0.01s)
  13067. 1343.56 s [vector] +++ OK, passed 100 tests.
  13068. 1343.58 s [vector] izipWithM: OK (0.01s)
  13069. 1343.58 s [vector] +++ OK, passed 100 tests.
  13070. 1343.60 s [vector] izipWithM_: OK (0.03s)
  13071. 1343.60 s [vector] +++ OK, passed 100 tests.
  13072. 1343.62 s [vector] zipWithM: OK
  13073. 1343.62 s [vector] +++ OK, passed 100 tests.
  13074. 1343.64 s [vector] zipWithM_: OK (0.03s)
  13075. 1343.64 s [vector] +++ OK, passed 100 tests.
  13076. 1343.64 s [vector] filter: OK
  13077. 1343.64 s [vector] +++ OK, passed 100 tests.
  13078. 1343.64 s [vector] ifilter: OK
  13079. 1343.64 s [vector] +++ OK, passed 100 tests.
  13080. 1343.69 s [vector] filterM: OK (0.03s)
  13081. 1343.70 s [vector] +++ OK, passed 100 tests.
  13082. 1343.70 s [vector] uniq: OK
  13083. 1343.70 s [vector] +++ OK, passed 100 tests.
  13084. 1343.70 s [vector] mapMaybe: OK
  13085. 1343.70 s [vector] +++ OK, passed 100 tests.
  13086. 1343.71 s [vector] imapMaybe: OK
  13087. 1343.71 s [vector] +++ OK, passed 100 tests.
  13088. 1343.71 s [vector] takeWhile: OK
  13089. 1343.71 s [vector] +++ OK, passed 100 tests.
  13090. 1343.71 s [vector] dropWhile: OK
  13091. 1343.71 s [vector] +++ OK, passed 100 tests.
  13092. 1343.72 s [vector] partition: OK
  13093. 1343.72 s [vector] +++ OK, passed 100 tests.
  13094. 1343.72 s [vector] partitionWith: OK
  13095. 1343.72 s [vector] +++ OK, passed 100 tests.
  13096. 1343.73 s [vector] span: OK
  13097. 1343.73 s [vector] +++ OK, passed 100 tests.
  13098. 1343.73 s [vector] break: OK
  13099. 1343.73 s [vector] +++ OK, passed 100 tests.
  13100. 1343.73 s [vector] spanR: OK
  13101. 1343.73 s [vector] +++ OK, passed 100 tests.
  13102. 1343.74 s [vector] breakR: OK
  13103. 1343.74 s [vector] +++ OK, passed 100 tests.
  13104. 1343.74 s [vector] groupBy: OK
  13105. 1343.74 s [vector] +++ OK, passed 100 tests.
  13106. 1343.74 s [vector] elem: OK
  13107. 1343.74 s [vector] +++ OK, passed 100 tests.
  13108. 1343.74 s [vector] notElem: OK
  13109. 1343.74 s [vector] +++ OK, passed 100 tests.
  13110. 1343.74 s [vector] find: OK
  13111. 1343.74 s [vector] +++ OK, passed 100 tests.
  13112. 1343.74 s [vector] findIndex: OK
  13113. 1343.74 s [vector] +++ OK, passed 100 tests.
  13114. 1343.74 s [vector] findIndexR: OK
  13115. 1343.74 s [vector] +++ OK, passed 100 tests.
  13116. 1343.75 s [vector] findIndices: OK
  13117. 1343.75 s [vector] +++ OK, passed 100 tests.
  13118. 1343.75 s [vector] elemIndex: OK
  13119. 1343.76 s [vector] +++ OK, passed 100 tests.
  13120. 1343.76 s [vector] elemIndices: OK
  13121. 1343.76 s [vector] +++ OK, passed 100 tests.
  13122. 1343.76 s [vector] foldl: OK
  13123. 1343.76 s [vector] +++ OK, passed 100 tests.
  13124. 1343.77 s [vector] foldl1: OK
  13125. 1343.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13126. 1343.78 s [vector] foldl': OK (0.01s)
  13127. 1343.78 s [vector] +++ OK, passed 100 tests.
  13128. 1343.80 s [vector] foldl1': OK (0.02s)
  13129. 1343.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13130. 1343.82 s [vector] foldr: OK (0.01s)
  13131. 1343.82 s [vector] +++ OK, passed 100 tests.
  13132. 1343.82 s [vector] foldr1: OK (0.01s)
  13133. 1343.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13134. 1343.84 s [vector] foldr': OK (0.01s)
  13135. 1343.84 s [vector] +++ OK, passed 100 tests.
  13136. 1343.86 s [vector] foldr1': OK (0.01s)
  13137. 1343.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13138. 1343.86 s [vector] ifoldl: OK (0.01s)
  13139. 1343.86 s [vector] +++ OK, passed 100 tests.
  13140. 1343.88 s [vector] ifoldl': OK (0.01s)
  13141. 1343.88 s [vector] +++ OK, passed 100 tests.
  13142. 1343.90 s [vector] ifoldr: OK (0.02s)
  13143. 1343.90 s [vector] +++ OK, passed 100 tests.
  13144. 1343.90 s [vector] ifoldr': OK (0.01s)
  13145. 1343.91 s [vector] +++ OK, passed 100 tests.
  13146. 1343.91 s [vector] ifoldM: OK (0.01s)
  13147. 1343.91 s [vector] +++ OK, passed 100 tests.
  13148. 1343.93 s [vector] ifoldM': OK
  13149. 1343.93 s [vector] +++ OK, passed 100 tests.
  13150. 1343.98 s [vector] ifoldM_: OK (0.04s)
  13151. 1343.98 s [vector] +++ OK, passed 100 tests.
  13152. 1344.00 s [vector] ifoldM'_: OK (0.03s)
  13153. 1344.00 s [vector] +++ OK, passed 100 tests.
  13154. 1344.00 s [vector] all: OK
  13155. 1344.00 s [vector] +++ OK, passed 100 tests.
  13156. 1344.01 s [vector] any: OK
  13157. 1344.02 s [vector] +++ OK, passed 100 tests.
  13158. 1344.02 s [vector] prescanl: OK (0.01s)
  13159. 1344.02 s [vector] +++ OK, passed 100 tests.
  13160. 1344.04 s [vector] prescanl': OK (0.01s)
  13161. 1344.04 s [vector] +++ OK, passed 100 tests.
  13162. 1344.04 s [vector] postscanl: OK (0.01s)
  13163. 1344.04 s [vector] +++ OK, passed 100 tests.
  13164. 1344.06 s [vector] postscanl': OK (0.01s)
  13165. 1344.06 s [vector] +++ OK, passed 100 tests.
  13166. 1344.08 s [vector] scanl: OK (0.01s)
  13167. 1344.08 s [vector] +++ OK, passed 100 tests.
  13168. 1344.08 s [vector] scanl': OK (0.01s)
  13169. 1344.09 s [vector] +++ OK, passed 100 tests.
  13170. 1344.10 s [vector] scanl1: OK (0.01s)
  13171. 1344.10 s [vector] +++ OK, passed 100 tests.
  13172. 1344.10 s [vector] scanl1': OK
  13173. 1344.11 s [vector] +++ OK, passed 100 tests.
  13174. 1344.12 s [vector] iscanl: OK (0.01s)
  13175. 1344.12 s [vector] +++ OK, passed 100 tests.
  13176. 1344.14 s [vector] iscanl': OK (0.02s)
  13177. 1344.14 s [vector] +++ OK, passed 100 tests.
  13178. 1344.14 s [vector] prescanr: OK (0.01s)
  13179. 1344.14 s [vector] +++ OK, passed 100 tests.
  13180. 1344.15 s [vector] prescanr': OK (0.01s)
  13181. 1344.15 s [vector] +++ OK, passed 100 tests.
  13182. 1344.16 s [vector] postscanr: OK
  13183. 1344.16 s [vector] +++ OK, passed 100 tests.
  13184. 1344.18 s [vector] postscanr': OK (0.01s)
  13185. 1344.18 s [vector] +++ OK, passed 100 tests.
  13186. 1344.20 s [vector] scanr: OK (0.02s)
  13187. 1344.20 s [vector] +++ OK, passed 100 tests.
  13188. 1344.23 s [vector] scanr': OK (0.02s)
  13189. 1344.23 s [vector] +++ OK, passed 100 tests.
  13190. 1344.24 s [vector] scanr1: OK (0.02s)
  13191. 1344.24 s [vector] +++ OK, passed 100 tests.
  13192. 1344.26 s [vector] scanr1': OK (0.02s)
  13193. 1344.26 s [vector] +++ OK, passed 100 tests.
  13194. 1344.28 s [vector] iscanr: OK (0.02s)
  13195. 1344.28 s [vector] +++ OK, passed 100 tests.
  13196. 1344.28 s [vector] iscanr': OK (0.01s)
  13197. 1344.28 s [vector] +++ OK, passed 100 tests.
  13198. 1344.29 s [vector] mut_read: OK
  13199. 1344.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13200. 1344.29 s [vector] mut_write: OK
  13201. 1344.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13202. 1344.29 s [vector] mut_modify: OK
  13203. 1344.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13204. 1344.30 s [vector] mut_generate: OK
  13205. 1344.30 s [vector] +++ OK, passed 100 tests.
  13206. 1344.32 s [vector] mut_generateM: OK (0.02s)
  13207. 1344.32 s [vector] +++ OK, passed 100 tests.
  13208. 1344.36 s [vector] mut_mapM_: OK (0.03s)
  13209. 1344.36 s [vector] +++ OK, passed 100 tests.
  13210. 1344.38 s [vector] mut_imapM_: OK (0.03s)
  13211. 1344.38 s [vector] +++ OK, passed 100 tests.
  13212. 1344.42 s [vector] mut_forM_: OK (0.04s)
  13213. 1344.42 s [vector] +++ OK, passed 100 tests.
  13214. 1344.43 s [haskell-language-server] [2 of 8] Compiling Ide.Plugin.SemanticTokens.Tokenize ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Tokenize.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.dyn_o )
  13215. 1344.46 s [vector] mut_iforM_: OK (0.04s)
  13216. 1344.46 s [vector] +++ OK, passed 100 tests.
  13217. 1344.48 s [vector] mut_foldr: OK (0.01s)
  13218. 1344.48 s [vector] +++ OK, passed 100 tests.
  13219. 1344.48 s [vector] mut_foldr': OK (0.01s)
  13220. 1344.48 s [vector] +++ OK, passed 100 tests.
  13221. 1344.50 s [vector] mut_foldl: OK (0.01s)
  13222. 1344.50 s [vector] +++ OK, passed 100 tests.
  13223. 1344.50 s [vector] mut_foldl': OK (0.01s)
  13224. 1344.50 s [vector] +++ OK, passed 100 tests.
  13225. 1344.52 s [vector] mut_ifoldr: OK (0.01s)
  13226. 1344.52 s [vector] +++ OK, passed 100 tests.
  13227. 1344.54 s [vector] mut_ifoldr': OK (0.01s)
  13228. 1344.54 s [vector] +++ OK, passed 100 tests.
  13229. 1344.54 s [vector] mut_ifoldl: OK (0.01s)
  13230. 1344.54 s [vector] +++ OK, passed 100 tests.
  13231. 1344.56 s [vector] mut_ifoldl': OK (0.01s)
  13232. 1344.56 s [vector] +++ OK, passed 100 tests.
  13233. 1344.57 s [vector] mut_foldM: OK (0.01s)
  13234. 1344.58 s [vector] +++ OK, passed 100 tests.
  13235. 1344.58 s [vector] mut_foldM': OK
  13236. 1344.58 s [vector] +++ OK, passed 100 tests.
  13237. 1344.60 s [vector] mut_foldrM: OK (0.01s)
  13238. 1344.60 s [vector] +++ OK, passed 100 tests.
  13239. 1344.60 s [vector] mut_foldrM': OK (0.01s)
  13240. 1344.60 s [vector] +++ OK, passed 100 tests.
  13241. 1344.62 s [vector] mut_ifoldM: OK (0.01s)
  13242. 1344.62 s [vector] +++ OK, passed 100 tests.
  13243. 1344.63 s [vector] mut_ifoldM': OK (0.01s)
  13244. 1344.64 s [vector] +++ OK, passed 100 tests.
  13245. 1344.64 s [vector] mut_ifoldrM: OK (0.01s)
  13246. 1344.64 s [vector] +++ OK, passed 100 tests.
  13247. 1344.65 s [vector] mut_ifoldrM': OK (0.01s)
  13248. 1344.65 s [vector] +++ OK, passed 100 tests.
  13249. 1344.65 s [vector] compare: OK
  13250. 1344.65 s [vector] +++ OK, passed 100 tests.
  13251. 1344.65 s [vector] maximum: OK
  13252. 1344.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13253. 1344.65 s [vector] minimum: OK
  13254. 1344.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13255. 1344.65 s [vector] minIndex: OK
  13256. 1344.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13257. 1344.65 s [vector] maxIndex: OK
  13258. 1344.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13259. 1344.65 s [vector] maximumBy: OK
  13260. 1344.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13261. 1344.65 s [vector] minimumBy: OK
  13262. 1344.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13263. 1344.65 s [vector] maximumOn: OK
  13264. 1344.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13265. 1344.65 s [vector] minimumOn: OK
  13266. 1344.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13267. 1344.65 s [vector] maxIndexBy: OK
  13268. 1344.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13269. 1344.66 s [vector] minIndexBy: OK
  13270. 1344.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13271. 1344.66 s [vector] ListFirstMaxIndexWins: OK
  13272. 1344.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13273. 1344.66 s [vector] FalseListFirstMaxIndexWins: OK
  13274. 1344.66 s [vector] +++ OK, failed as expected. (after 1 test):
  13275. 1344.66 s [vector] Exception:
  13276. 1344.66 s [vector] Prelude.foldr1: empty list
  13277. 1344.66 s [vector] CallStack (from HasCallStack):
  13278. 1344.66 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13279. 1344.66 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13280. 1344.66 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13281. 1344.66 s [vector] []
  13282. 1344.66 s [vector] mempty: OK
  13283. 1344.66 s [vector] +++ OK, passed 100 tests.
  13284. 1344.66 s [vector] mappend: OK
  13285. 1344.66 s [vector] +++ OK, passed 100 tests.
  13286. 1344.68 s [vector] mconcat: OK (0.02s)
  13287. 1344.68 s [vector] +++ OK, passed 100 tests.
  13288. 1344.68 s [vector] glength: OK
  13289. 1344.68 s [vector] +++ OK, passed 100 tests.
  13290. 1344.68 s [vector] sum: OK
  13291. 1344.68 s [vector] +++ OK, passed 100 tests.
  13292. 1344.68 s [vector] product: OK
  13293. 1344.68 s [vector] +++ OK, passed 100 tests.
  13294. 1344.68 s [vector] enumFromN: OK
  13295. 1344.68 s [vector] +++ OK, passed 100 tests.
  13296. 1344.68 s [vector] enumFromThenN: OK
  13297. 1344.68 s [vector] +++ OK, passed 100 tests.
  13298. 1344.68 s [vector] enumFromTo: OK
  13299. 1344.68 s [vector] +++ OK, passed 100 tests.
  13300. 1344.68 s [vector] enumFromThenTo: OK
  13301. 1344.68 s [vector] +++ OK, passed 100 tests; 2 discarded.
  13302. 1344.68 s [vector] unstream
  13303. 1344.68 s [vector] unstream == vunstream (exact): OK
  13304. 1344.68 s [vector] +++ OK, passed 100 tests.
  13305. 1344.69 s [vector] unstream == vunstream (unknown): OK
  13306. 1344.69 s [vector] +++ OK, passed 100 tests.
  13307. 1344.69 s [vector] unstreamR ~= vunstream (exact): OK
  13308. 1344.69 s [vector] +++ OK, passed 100 tests.
  13309. 1344.69 s [vector] unstreamR ~= vunstream (unknown): OK
  13310. 1344.69 s [vector] +++ OK, passed 100 tests.
  13311. 1344.69 s [vector] Tests.Vector.Strict
  13312. 1344.69 s [vector] Bool
  13313. 1344.69 s [vector] fromList.toList == id: OK
  13314. 1344.69 s [vector] +++ OK, passed 100 tests.
  13315. 1344.69 s [vector] toList.fromList == id: OK
  13316. 1344.69 s [vector] +++ OK, passed 100 tests.
  13317. 1344.69 s [vector] unstream.stream == id: OK
  13318. 1344.69 s [vector] +++ OK, passed 100 tests.
  13319. 1344.69 s [vector] stream.unstream == id: OK
  13320. 1344.69 s [vector] +++ OK, passed 100 tests.
  13321. 1344.69 s [vector] eq: OK
  13322. 1344.69 s [vector] +++ OK, passed 100 tests.
  13323. 1344.69 s [vector] length: OK
  13324. 1344.69 s [vector] +++ OK, passed 100 tests.
  13325. 1344.69 s [vector] null: OK
  13326. 1344.69 s [vector] +++ OK, passed 100 tests.
  13327. 1344.69 s [vector] index: OK
  13328. 1344.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13329. 1344.69 s [vector] safeIndex: OK
  13330. 1344.69 s [vector] +++ OK, passed 100 tests.
  13331. 1344.70 s [vector] head: OK
  13332. 1344.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13333. 1344.70 s [vector] last: OK
  13334. 1344.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13335. 1344.70 s [vector] unsafeIndex: OK
  13336. 1344.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13337. 1344.71 s [vector] unsafeHead: OK
  13338. 1344.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13339. 1344.71 s [vector] unsafeLast: OK
  13340. 1344.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13341. 1344.71 s [vector] slice: OK
  13342. 1344.71 s [vector] +++ OK, passed 100 tests.
  13343. 1344.71 s [vector] init: OK
  13344. 1344.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13345. 1344.71 s [vector] tail: OK
  13346. 1344.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13347. 1344.71 s [vector] take: OK
  13348. 1344.71 s [vector] +++ OK, passed 100 tests.
  13349. 1344.71 s [vector] drop: OK
  13350. 1344.71 s [vector] +++ OK, passed 100 tests.
  13351. 1344.71 s [vector] splitAt: OK
  13352. 1344.71 s [vector] +++ OK, passed 100 tests.
  13353. 1344.71 s [vector] empty: OK
  13354. 1344.71 s [vector] +++ OK, passed 100 tests.
  13355. 1344.71 s [vector] singleton: OK
  13356. 1344.71 s [vector] +++ OK, passed 100 tests.
  13357. 1344.71 s [vector] replicate: OK
  13358. 1344.71 s [vector] +++ OK, passed 100 tests.
  13359. 1344.71 s [vector] generate: OK
  13360. 1344.71 s [vector] +++ OK, passed 100 tests.
  13361. 1344.72 s [vector] iterateN: OK
  13362. 1344.72 s [vector] +++ OK, passed 100 tests.
  13363. 1344.74 s [vector] iterateNM: OK (0.02s)
  13364. 1344.74 s [vector] +++ OK, passed 100 tests.
  13365. 1344.76 s [vector] generateM: OK (0.02s)
  13366. 1344.76 s [vector] +++ OK, passed 100 tests.
  13367. 1344.76 s [vector] replicateM: OK
  13368. 1344.76 s [vector] +++ OK, passed 100 tests.
  13369. 1344.76 s [vector] create: OK
  13370. 1344.76 s [vector] +++ OK, passed 100 tests.
  13371. 1344.76 s [vector] createT: OK
  13372. 1344.76 s [vector] +++ OK, passed 100 tests.
  13373. 1344.76 s [vector] unfoldr: OK
  13374. 1344.76 s [vector] +++ OK, passed 100 tests.
  13375. 1344.77 s [vector] unfoldrN: OK
  13376. 1344.77 s [vector] +++ OK, passed 100 tests.
  13377. 1344.77 s [vector] unfoldrExactN: OK
  13378. 1344.77 s [vector] +++ OK, passed 100 tests.
  13379. 1344.77 s [vector] unfoldrM: OK
  13380. 1344.77 s [vector] +++ OK, passed 100 tests.
  13381. 1344.77 s [vector] unfoldrNM: OK
  13382. 1344.77 s [vector] +++ OK, passed 100 tests.
  13383. 1344.79 s [vector] unfoldrExactNM: OK
  13384. 1344.79 s [vector] +++ OK, passed 100 tests.
  13385. 1344.79 s [vector] constructN: OK
  13386. 1344.79 s [vector] +++ OK, passed 100 tests.
  13387. 1344.79 s [vector] constructrN: OK
  13388. 1344.79 s [vector] +++ OK, passed 100 tests.
  13389. 1344.79 s [vector] cons: OK
  13390. 1344.79 s [vector] +++ OK, passed 100 tests.
  13391. 1344.79 s [vector] snoc: OK
  13392. 1344.79 s [vector] +++ OK, passed 100 tests.
  13393. 1344.80 s [vector] append: OK
  13394. 1344.80 s [vector] +++ OK, passed 100 tests.
  13395. 1344.80 s [vector] concat: OK
  13396. 1344.80 s [vector] +++ OK, passed 100 tests.
  13397. 1344.80 s [vector] force: OK
  13398. 1344.80 s [vector] +++ OK, passed 100 tests.
  13399. 1344.80 s [vector] upd: OK
  13400. 1344.80 s [vector] +++ OK, passed 100 tests.
  13401. 1344.80 s [vector] accum: OK
  13402. 1344.80 s [vector] +++ OK, passed 100 tests.
  13403. 1344.80 s [vector] reverse: OK
  13404. 1344.80 s [vector] +++ OK, passed 100 tests.
  13405. 1344.80 s [vector] backpermute: OK
  13406. 1344.80 s [vector] +++ OK, passed 100 tests.
  13407. 1344.81 s [vector] map: OK
  13408. 1344.81 s [vector] +++ OK, passed 100 tests.
  13409. 1344.81 s [vector] imap: OK
  13410. 1344.81 s [vector] +++ OK, passed 100 tests.
  13411. 1344.81 s [vector] concatMap: OK
  13412. 1344.81 s [vector] +++ OK, passed 100 tests.
  13413. 1344.81 s [vector] mapM: OK
  13414. 1344.82 s [vector] +++ OK, passed 100 tests.
  13415. 1344.82 s [vector] mapM_: OK
  13416. 1344.82 s [vector] +++ OK, passed 100 tests.
  13417. 1344.82 s [vector] forM: OK
  13418. 1344.82 s [vector] +++ OK, passed 100 tests.
  13419. 1344.83 s [vector] forM_: OK
  13420. 1344.83 s [vector] +++ OK, passed 100 tests.
  13421. 1344.83 s [vector] imapM: OK
  13422. 1344.83 s [vector] +++ OK, passed 100 tests.
  13423. 1344.85 s [vector] imapM_: OK (0.01s)
  13424. 1344.85 s [vector] +++ OK, passed 100 tests.
  13425. 1344.85 s [vector] zipWith: OK
  13426. 1344.85 s [vector] +++ OK, passed 100 tests.
  13427. 1344.86 s [vector] zipWith3: OK
  13428. 1344.86 s [vector] +++ OK, passed 100 tests.
  13429. 1344.86 s [vector] izipWith: OK
  13430. 1344.86 s [vector] +++ OK, passed 100 tests.
  13431. 1344.86 s [vector] izipWith3: OK
  13432. 1344.86 s [vector] +++ OK, passed 100 tests.
  13433. 1344.86 s [vector] izipWithM: OK
  13434. 1344.87 s [vector] +++ OK, passed 100 tests.
  13435. 1344.88 s [vector] izipWithM_: OK
  13436. 1344.88 s [vector] +++ OK, passed 100 tests.
  13437. 1344.88 s [vector] zipWithM: OK
  13438. 1344.88 s [vector] +++ OK, passed 100 tests.
  13439. 1344.88 s [vector] zipWithM_: OK
  13440. 1344.88 s [vector] +++ OK, passed 100 tests.
  13441. 1344.90 s [vector] filter: OK
  13442. 1344.90 s [vector] +++ OK, passed 100 tests.
  13443. 1344.90 s [vector] ifilter: OK
  13444. 1344.90 s [vector] +++ OK, passed 100 tests.
  13445. 1344.90 s [vector] filterM: OK (0.02s)
  13446. 1344.90 s [vector] +++ OK, passed 100 tests.
  13447. 1344.90 s [vector] uniq: OK
  13448. 1344.90 s [vector] +++ OK, passed 100 tests.
  13449. 1344.90 s [vector] mapMaybe: OK
  13450. 1344.90 s [vector] +++ OK, passed 100 tests.
  13451. 1344.90 s [vector] imapMaybe: OK
  13452. 1344.90 s [vector] +++ OK, passed 100 tests.
  13453. 1344.90 s [vector] takeWhile: OK
  13454. 1344.90 s [vector] +++ OK, passed 100 tests.
  13455. 1344.90 s [vector] dropWhile: OK
  13456. 1344.90 s [vector] +++ OK, passed 100 tests.
  13457. 1344.90 s [vector] partition: OK
  13458. 1344.90 s [vector] +++ OK, passed 100 tests.
  13459. 1344.90 s [vector] partitionWith: OK
  13460. 1344.90 s [vector] +++ OK, passed 100 tests.
  13461. 1344.90 s [vector] span: OK
  13462. 1344.90 s [vector] +++ OK, passed 100 tests.
  13463. 1344.90 s [vector] break: OK
  13464. 1344.90 s [vector] +++ OK, passed 100 tests.
  13465. 1344.90 s [vector] spanR: OK
  13466. 1344.90 s [vector] +++ OK, passed 100 tests.
  13467. 1344.91 s [vector] breakR: OK
  13468. 1344.91 s [vector] +++ OK, passed 100 tests.
  13469. 1344.91 s [vector] groupBy: OK
  13470. 1344.91 s [vector] +++ OK, passed 100 tests.
  13471. 1344.91 s [vector] elem: OK
  13472. 1344.91 s [vector] +++ OK, passed 100 tests.
  13473. 1344.91 s [vector] notElem: OK
  13474. 1344.91 s [vector] +++ OK, passed 100 tests.
  13475. 1344.91 s [vector] find: OK
  13476. 1344.91 s [vector] +++ OK, passed 100 tests.
  13477. 1344.91 s [vector] findIndex: OK
  13478. 1344.91 s [vector] +++ OK, passed 100 tests.
  13479. 1344.91 s [vector] findIndexR: OK
  13480. 1344.91 s [vector] +++ OK, passed 100 tests.
  13481. 1344.91 s [vector] findIndices: OK
  13482. 1344.91 s [vector] +++ OK, passed 100 tests.
  13483. 1344.91 s [vector] elemIndex: OK
  13484. 1344.91 s [vector] +++ OK, passed 100 tests.
  13485. 1344.91 s [vector] elemIndices: OK
  13486. 1344.91 s [vector] +++ OK, passed 100 tests.
  13487. 1344.91 s [vector] foldl: OK
  13488. 1344.91 s [vector] +++ OK, passed 100 tests.
  13489. 1344.91 s [vector] foldl1: OK
  13490. 1344.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13491. 1344.91 s [vector] foldl': OK
  13492. 1344.91 s [vector] +++ OK, passed 100 tests.
  13493. 1344.91 s [vector] foldl1': OK
  13494. 1344.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13495. 1344.92 s [vector] foldr: OK
  13496. 1344.92 s [vector] +++ OK, passed 100 tests.
  13497. 1344.92 s [vector] foldr1: OK
  13498. 1344.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13499. 1344.92 s [vector] foldr': OK
  13500. 1344.92 s [vector] +++ OK, passed 100 tests.
  13501. 1344.92 s [vector] foldr1': OK
  13502. 1344.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13503. 1344.92 s [vector] ifoldl: OK
  13504. 1344.92 s [vector] +++ OK, passed 100 tests.
  13505. 1344.92 s [vector] ifoldl': OK
  13506. 1344.92 s [vector] +++ OK, passed 100 tests.
  13507. 1344.93 s [vector] ifoldr: OK
  13508. 1344.93 s [vector] +++ OK, passed 100 tests.
  13509. 1344.93 s [vector] ifoldr': OK
  13510. 1344.93 s [vector] +++ OK, passed 100 tests.
  13511. 1344.93 s [vector] ifoldM: OK
  13512. 1344.93 s [vector] +++ OK, passed 100 tests.
  13513. 1344.94 s [vector] ifoldM': OK
  13514. 1344.94 s [vector] +++ OK, passed 100 tests.
  13515. 1344.94 s [vector] ifoldM_: OK
  13516. 1344.94 s [vector] +++ OK, passed 100 tests.
  13517. 1344.95 s [vector] ifoldM'_: OK
  13518. 1344.95 s [vector] +++ OK, passed 100 tests.
  13519. 1344.95 s [vector] all: OK
  13520. 1344.95 s [vector] +++ OK, passed 100 tests.
  13521. 1344.95 s [vector] any: OK
  13522. 1344.95 s [vector] +++ OK, passed 100 tests.
  13523. 1344.95 s [vector] prescanl: OK
  13524. 1344.95 s [vector] +++ OK, passed 100 tests.
  13525. 1344.95 s [vector] prescanl': OK
  13526. 1344.95 s [vector] +++ OK, passed 100 tests.
  13527. 1344.95 s [vector] postscanl: OK
  13528. 1344.95 s [vector] +++ OK, passed 100 tests.
  13529. 1344.95 s [vector] postscanl': OK
  13530. 1344.95 s [vector] +++ OK, passed 100 tests.
  13531. 1344.95 s [vector] scanl: OK
  13532. 1344.95 s [vector] +++ OK, passed 100 tests.
  13533. 1344.96 s [vector] scanl': OK
  13534. 1344.96 s [vector] +++ OK, passed 100 tests.
  13535. 1344.96 s [vector] scanl1: OK
  13536. 1344.96 s [vector] +++ OK, passed 100 tests.
  13537. 1344.96 s [vector] scanl1': OK
  13538. 1344.96 s [vector] +++ OK, passed 100 tests.
  13539. 1344.96 s [vector] iscanl: OK
  13540. 1344.96 s [vector] +++ OK, passed 100 tests.
  13541. 1344.96 s [vector] iscanl': OK
  13542. 1344.96 s [vector] +++ OK, passed 100 tests.
  13543. 1344.96 s [vector] prescanr: OK
  13544. 1344.96 s [vector] +++ OK, passed 100 tests.
  13545. 1344.96 s [vector] prescanr': OK
  13546. 1344.96 s [vector] +++ OK, passed 100 tests.
  13547. 1344.97 s [vector] postscanr: OK
  13548. 1344.97 s [vector] +++ OK, passed 100 tests.
  13549. 1344.97 s [vector] postscanr': OK
  13550. 1344.97 s [vector] +++ OK, passed 100 tests.
  13551. 1344.97 s [vector] scanr: OK
  13552. 1344.97 s [vector] +++ OK, passed 100 tests.
  13553. 1344.97 s [vector] scanr': OK
  13554. 1344.97 s [vector] +++ OK, passed 100 tests.
  13555. 1344.97 s [vector] scanr1: OK
  13556. 1344.97 s [vector] +++ OK, passed 100 tests.
  13557. 1344.97 s [vector] scanr1': OK
  13558. 1344.98 s [vector] +++ OK, passed 100 tests.
  13559. 1344.98 s [vector] iscanr: OK
  13560. 1344.98 s [vector] +++ OK, passed 100 tests.
  13561. 1344.98 s [vector] iscanr': OK
  13562. 1344.98 s [vector] +++ OK, passed 100 tests.
  13563. 1344.98 s [vector] mut_read: OK
  13564. 1344.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13565. 1344.98 s [vector] mut_write: OK
  13566. 1344.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13567. 1344.98 s [vector] mut_modify: OK
  13568. 1344.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13569. 1344.98 s [vector] mut_generate: OK
  13570. 1344.98 s [vector] +++ OK, passed 100 tests.
  13571. 1344.99 s [vector] mut_generateM: OK
  13572. 1345.00 s [vector] +++ OK, passed 100 tests.
  13573. 1345.00 s [vector] mut_mapM_: OK
  13574. 1345.00 s [vector] +++ OK, passed 100 tests.
  13575. 1345.00 s [vector] mut_imapM_: OK
  13576. 1345.00 s [vector] +++ OK, passed 100 tests.
  13577. 1345.01 s [vector] mut_forM_: OK
  13578. 1345.01 s [vector] +++ OK, passed 100 tests.
  13579. 1345.01 s [vector] mut_iforM_: OK
  13580. 1345.01 s [vector] +++ OK, passed 100 tests.
  13581. 1345.01 s [vector] mut_foldr: OK
  13582. 1345.01 s [vector] +++ OK, passed 100 tests.
  13583. 1345.01 s [vector] mut_foldr': OK
  13584. 1345.01 s [vector] +++ OK, passed 100 tests.
  13585. 1345.01 s [vector] mut_foldl: OK
  13586. 1345.02 s [vector] +++ OK, passed 100 tests.
  13587. 1345.02 s [vector] mut_foldl': OK
  13588. 1345.02 s [vector] +++ OK, passed 100 tests.
  13589. 1345.02 s [vector] mut_ifoldr: OK
  13590. 1345.02 s [vector] +++ OK, passed 100 tests.
  13591. 1345.02 s [vector] mut_ifoldr': OK
  13592. 1345.02 s [vector] +++ OK, passed 100 tests.
  13593. 1345.02 s [vector] mut_ifoldl: OK
  13594. 1345.02 s [vector] +++ OK, passed 100 tests.
  13595. 1345.02 s [vector] mut_ifoldl': OK
  13596. 1345.02 s [vector] +++ OK, passed 100 tests.
  13597. 1345.02 s [vector] mut_foldM: OK
  13598. 1345.02 s [vector] +++ OK, passed 100 tests.
  13599. 1345.02 s [vector] mut_foldM': OK
  13600. 1345.02 s [vector] +++ OK, passed 100 tests.
  13601. 1345.02 s [vector] mut_foldrM: OK
  13602. 1345.02 s [vector] +++ OK, passed 100 tests.
  13603. 1345.02 s [vector] mut_foldrM': OK
  13604. 1345.03 s [vector] +++ OK, passed 100 tests.
  13605. 1345.03 s [vector] mut_ifoldM: OK
  13606. 1345.03 s [vector] +++ OK, passed 100 tests.
  13607. 1345.03 s [vector] mut_ifoldM': OK
  13608. 1345.03 s [vector] +++ OK, passed 100 tests.
  13609. 1345.03 s [vector] mut_ifoldrM: OK
  13610. 1345.03 s [vector] +++ OK, passed 100 tests.
  13611. 1345.03 s [vector] mut_ifoldrM': OK
  13612. 1345.03 s [vector] +++ OK, passed 100 tests.
  13613. 1345.03 s [vector] compare: OK
  13614. 1345.03 s [vector] +++ OK, passed 100 tests.
  13615. 1345.03 s [vector] maximum: OK
  13616. 1345.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13617. 1345.03 s [vector] minimum: OK
  13618. 1345.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13619. 1345.03 s [vector] minIndex: OK
  13620. 1345.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13621. 1345.03 s [vector] maxIndex: OK
  13622. 1345.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13623. 1345.03 s [vector] maximumBy: OK
  13624. 1345.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13625. 1345.03 s [vector] minimumBy: OK
  13626. 1345.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13627. 1345.03 s [vector] maximumOn: OK
  13628. 1345.03 s [vector] +++ OK, passed 100 tests; 25 discarded.
  13629. 1345.03 s [vector] minimumOn: OK
  13630. 1345.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13631. 1345.04 s [vector] maxIndexBy: OK
  13632. 1345.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13633. 1345.04 s [vector] minIndexBy: OK
  13634. 1345.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13635. 1345.04 s [vector] ListFirstMaxIndexWins: OK
  13636. 1345.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13637. 1345.04 s [vector] FalseListFirstMaxIndexWins: OK
  13638. 1345.04 s [vector] +++ OK, failed as expected. (after 1 test):
  13639. 1345.04 s [vector] Exception:
  13640. 1345.04 s [vector] Prelude.foldr1: empty list
  13641. 1345.04 s [vector] CallStack (from HasCallStack):
  13642. 1345.04 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13643. 1345.04 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13644. 1345.04 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13645. 1345.04 s [vector] []
  13646. 1345.04 s [vector] zip: OK
  13647. 1345.04 s [vector] +++ OK, passed 100 tests.
  13648. 1345.04 s [vector] zip3: OK
  13649. 1345.04 s [vector] +++ OK, passed 100 tests.
  13650. 1345.04 s [vector] unzip: OK
  13651. 1345.04 s [vector] +++ OK, passed 100 tests.
  13652. 1345.04 s [vector] unzip3: OK
  13653. 1345.04 s [vector] +++ OK, passed 100 tests.
  13654. 1345.04 s [vector] indexed: OK
  13655. 1345.04 s [vector] +++ OK, passed 100 tests.
  13656. 1345.05 s [vector] update: OK
  13657. 1345.05 s [vector] +++ OK, passed 100 tests.
  13658. 1345.05 s [vector] concat: OK
  13659. 1345.05 s [vector] +++ OK, passed 100 tests.
  13660. 1345.05 s [vector] mempty: OK
  13661. 1345.05 s [vector] +++ OK, passed 100 tests.
  13662. 1345.05 s [vector] mappend: OK
  13663. 1345.05 s [vector] +++ OK, passed 100 tests.
  13664. 1345.05 s [vector] mconcat: OK
  13665. 1345.05 s [vector] +++ OK, passed 100 tests.
  13666. 1345.05 s [vector] fmap: OK
  13667. 1345.05 s [vector] +++ OK, passed 100 tests.
  13668. 1345.05 s [vector] return: OK
  13669. 1345.06 s [vector] +++ OK, passed 100 tests.
  13670. 1345.06 s [vector] bind: OK
  13671. 1345.06 s [vector] +++ OK, passed 100 tests.
  13672. 1345.06 s [vector] mzip: OK
  13673. 1345.06 s [vector] +++ OK, passed 100 tests.
  13674. 1345.06 s [vector] munzip: OK
  13675. 1345.06 s [vector] +++ OK, passed 100 tests.
  13676. 1345.08 s [vector] applicative_pure: OK
  13677. 1345.08 s [vector] +++ OK, passed 100 tests.
  13678. 1345.08 s [vector] applicative_appl: OK (0.01s)
  13679. 1345.08 s [vector] +++ OK, passed 100 tests.
  13680. 1345.08 s [vector] alternative_empty: OK
  13681. 1345.08 s [vector] +++ OK, passed 100 tests.
  13682. 1345.08 s [vector] alternative_or: OK
  13683. 1345.08 s [vector] +++ OK, passed 100 tests.
  13684. 1345.08 s [haskell-language-server] [3 of 8] Compiling Ide.Plugin.SemanticTokens.SemanticConfig ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/SemanticConfig.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.dyn_o )
  13685. 1345.08 s [haskell-language-server] [4 of 8] Compiling Ide.Plugin.SemanticTokens.Utils ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Utils.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.dyn_o )
  13686. 1345.08 s [haskell-language-server] [5 of 8] Compiling Ide.Plugin.SemanticTokens.Mappings ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Mappings.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.dyn_o )
  13687. 1345.08 s [haskell-language-server] [6 of 8] Compiling Ide.Plugin.SemanticTokens.Query ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Query.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.dyn_o )
  13688. 1345.10 s [vector] sequence: OK (0.02s)
  13689. 1345.10 s [vector] +++ OK, passed 100 tests.
  13690. 1345.11 s [haskell-language-server] [7 of 8] Compiling Ide.Plugin.SemanticTokens.Internal ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Internal.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.dyn_o )
  13691. 1345.11 s [vector] sequence_: OK
  13692. 1345.11 s [vector] +++ OK, passed 100 tests.
  13693. 1345.11 s [vector] glength: OK
  13694. 1345.11 s [vector] +++ OK, passed 100 tests.
  13695. 1345.11 s [vector] and: OK
  13696. 1345.11 s [vector] +++ OK, passed 100 tests.
  13697. 1345.11 s [vector] or: OK
  13698. 1345.11 s [vector] +++ OK, passed 100 tests.
  13699. 1345.11 s [vector] Int
  13700. 1345.11 s [vector] fromList.toList == id: OK
  13701. 1345.11 s [vector] +++ OK, passed 100 tests.
  13702. 1345.11 s [vector] toList.fromList == id: OK
  13703. 1345.11 s [vector] +++ OK, passed 100 tests.
  13704. 1345.11 s [vector] unstream.stream == id: OK
  13705. 1345.11 s [vector] +++ OK, passed 100 tests.
  13706. 1345.11 s [vector] stream.unstream == id: OK
  13707. 1345.11 s [vector] +++ OK, passed 100 tests.
  13708. 1345.11 s [vector] eq: OK
  13709. 1345.11 s [vector] +++ OK, passed 100 tests.
  13710. 1345.11 s [vector] length: OK
  13711. 1345.11 s [vector] +++ OK, passed 100 tests.
  13712. 1345.11 s [vector] null: OK
  13713. 1345.11 s [vector] +++ OK, passed 100 tests.
  13714. 1345.11 s [vector] index: OK
  13715. 1345.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13716. 1345.11 s [vector] safeIndex: OK
  13717. 1345.11 s [vector] +++ OK, passed 100 tests.
  13718. 1345.11 s [vector] head: OK
  13719. 1345.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13720. 1345.11 s [vector] last: OK
  13721. 1345.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13722. 1345.11 s [vector] unsafeIndex: OK
  13723. 1345.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13724. 1345.11 s [vector] unsafeHead: OK
  13725. 1345.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13726. 1345.11 s [vector] unsafeLast: OK
  13727. 1345.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13728. 1345.12 s [vector] slice: OK
  13729. 1345.12 s [vector] +++ OK, passed 100 tests.
  13730. 1345.12 s [vector] init: OK
  13731. 1345.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13732. 1345.12 s [vector] tail: OK
  13733. 1345.12 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13734. 1345.12 s [vector] take: OK
  13735. 1345.12 s [vector] +++ OK, passed 100 tests.
  13736. 1345.12 s [vector] drop: OK
  13737. 1345.12 s [vector] +++ OK, passed 100 tests.
  13738. 1345.12 s [vector] splitAt: OK
  13739. 1345.12 s [vector] +++ OK, passed 100 tests.
  13740. 1345.12 s [vector] empty: OK
  13741. 1345.12 s [vector] +++ OK, passed 100 tests.
  13742. 1345.12 s [vector] singleton: OK
  13743. 1345.12 s [vector] +++ OK, passed 100 tests.
  13744. 1345.12 s [vector] replicate: OK
  13745. 1345.12 s [vector] +++ OK, passed 100 tests.
  13746. 1345.14 s [vector] generate: OK
  13747. 1345.14 s [vector] +++ OK, passed 100 tests.
  13748. 1345.14 s [vector] iterateN: OK
  13749. 1345.14 s [vector] +++ OK, passed 100 tests.
  13750. 1345.17 s [vector] iterateNM: OK (0.02s)
  13751. 1345.17 s [vector] +++ OK, passed 100 tests.
  13752. 1345.17 s [vector] generateM: OK (0.02s)
  13753. 1345.17 s [vector] +++ OK, passed 100 tests.
  13754. 1345.18 s [vector] replicateM: OK
  13755. 1345.18 s [vector] +++ OK, passed 100 tests.
  13756. 1345.18 s [vector] create: OK
  13757. 1345.18 s [vector] +++ OK, passed 100 tests.
  13758. 1345.18 s [vector] createT: OK
  13759. 1345.18 s [vector] +++ OK, passed 100 tests.
  13760. 1345.18 s [vector] unfoldr: OK
  13761. 1345.18 s [vector] +++ OK, passed 100 tests.
  13762. 1345.18 s [vector] unfoldrN: OK
  13763. 1345.20 s [vector] +++ OK, passed 100 tests.
  13764. 1345.20 s [vector] unfoldrExactN: OK
  13765. 1345.20 s [vector] +++ OK, passed 100 tests.
  13766. 1345.20 s [vector] unfoldrM: OK
  13767. 1345.20 s [vector] +++ OK, passed 100 tests.
  13768. 1345.20 s [vector] unfoldrNM: OK
  13769. 1345.20 s [vector] +++ OK, passed 100 tests.
  13770. 1345.20 s [vector] unfoldrExactNM: OK (0.02s)
  13771. 1345.20 s [vector] +++ OK, passed 100 tests.
  13772. 1345.20 s [vector] constructN: OK
  13773. 1345.20 s [vector] +++ OK, passed 100 tests.
  13774. 1345.21 s [vector] constructrN: OK
  13775. 1345.21 s [vector] +++ OK, passed 100 tests.
  13776. 1345.21 s [vector] cons: OK
  13777. 1345.21 s [vector] +++ OK, passed 100 tests.
  13778. 1345.21 s [vector] snoc: OK
  13779. 1345.21 s [vector] +++ OK, passed 100 tests.
  13780. 1345.22 s [vector] append: OK
  13781. 1345.22 s [vector] +++ OK, passed 100 tests.
  13782. 1345.22 s [vector] concat: OK
  13783. 1345.22 s [vector] +++ OK, passed 100 tests.
  13784. 1345.22 s [vector] force: OK
  13785. 1345.22 s [vector] +++ OK, passed 100 tests.
  13786. 1345.22 s [vector] upd: OK
  13787. 1345.22 s [vector] +++ OK, passed 100 tests.
  13788. 1345.22 s [vector] accum: OK
  13789. 1345.22 s [vector] +++ OK, passed 100 tests.
  13790. 1345.22 s [vector] reverse: OK
  13791. 1345.22 s [vector] +++ OK, passed 100 tests.
  13792. 1345.22 s [vector] backpermute: OK
  13793. 1345.23 s [vector] +++ OK, passed 100 tests.
  13794. 1345.23 s [vector] map: OK
  13795. 1345.23 s [vector] +++ OK, passed 100 tests.
  13796. 1345.23 s [vector] imap: OK
  13797. 1345.23 s [vector] +++ OK, passed 100 tests.
  13798. 1345.23 s [vector] concatMap: OK
  13799. 1345.23 s [vector] +++ OK, passed 100 tests.
  13800. 1345.23 s [vector] mapM: OK
  13801. 1345.24 s [vector] +++ OK, passed 100 tests.
  13802. 1345.25 s [vector] mapM_: OK (0.02s)
  13803. 1345.25 s [vector] +++ OK, passed 100 tests.
  13804. 1345.26 s [vector] forM: OK
  13805. 1345.26 s [vector] +++ OK, passed 100 tests.
  13806. 1345.27 s [vector] forM_: OK (0.02s)
  13807. 1345.28 s [vector] +++ OK, passed 100 tests.
  13808. 1345.28 s [vector] imapM: OK
  13809. 1345.28 s [vector] +++ OK, passed 100 tests.
  13810. 1345.29 s [vector] imapM_: OK (0.02s)
  13811. 1345.29 s [vector] +++ OK, passed 100 tests.
  13812. 1345.29 s [vector] zipWith: OK
  13813. 1345.29 s [vector] +++ OK, passed 100 tests.
  13814. 1345.29 s [vector] zipWith3: OK
  13815. 1345.29 s [vector] +++ OK, passed 100 tests.
  13816. 1345.29 s [vector] izipWith: OK
  13817. 1345.29 s [vector] +++ OK, passed 100 tests.
  13818. 1345.30 s [vector] izipWith3: OK
  13819. 1345.30 s [vector] +++ OK, passed 100 tests.
  13820. 1345.30 s [vector] izipWithM: OK
  13821. 1345.30 s [vector] +++ OK, passed 100 tests.
  13822. 1345.31 s [vector] izipWithM_: OK (0.01s)
  13823. 1345.32 s [vector] +++ OK, passed 100 tests.
  13824. 1345.32 s [vector] zipWithM: OK
  13825. 1345.32 s [vector] +++ OK, passed 100 tests.
  13826. 1345.32 s [vector] zipWithM_: OK (0.01s)
  13827. 1345.32 s [vector] +++ OK, passed 100 tests.
  13828. 1345.32 s [vector] filter: OK
  13829. 1345.32 s [vector] +++ OK, passed 100 tests.
  13830. 1345.33 s [vector] ifilter: OK
  13831. 1345.33 s [vector] +++ OK, passed 100 tests.
  13832. 1345.35 s [vector] filterM: OK (0.03s)
  13833. 1345.36 s [vector] +++ OK, passed 100 tests.
  13834. 1345.36 s [vector] uniq: OK
  13835. 1345.36 s [vector] +++ OK, passed 100 tests.
  13836. 1345.36 s [vector] mapMaybe: OK
  13837. 1345.36 s [vector] +++ OK, passed 100 tests.
  13838. 1345.36 s [vector] imapMaybe: OK
  13839. 1345.36 s [vector] +++ OK, passed 100 tests.
  13840. 1345.36 s [vector] takeWhile: OK
  13841. 1345.36 s [vector] +++ OK, passed 100 tests.
  13842. 1345.36 s [vector] dropWhile: OK
  13843. 1345.36 s [vector] +++ OK, passed 100 tests.
  13844. 1345.36 s [vector] partition: OK
  13845. 1345.36 s [vector] +++ OK, passed 100 tests.
  13846. 1345.36 s [vector] partitionWith: OK
  13847. 1345.36 s [vector] +++ OK, passed 100 tests.
  13848. 1345.36 s [vector] span: OK
  13849. 1345.36 s [vector] +++ OK, passed 100 tests.
  13850. 1345.36 s [vector] break: OK
  13851. 1345.36 s [vector] +++ OK, passed 100 tests.
  13852. 1345.36 s [vector] spanR: OK
  13853. 1345.36 s [vector] +++ OK, passed 100 tests.
  13854. 1345.36 s [vector] breakR: OK
  13855. 1345.37 s [vector] +++ OK, passed 100 tests.
  13856. 1345.37 s [vector] groupBy: OK
  13857. 1345.37 s [vector] +++ OK, passed 100 tests.
  13858. 1345.37 s [vector] elem: OK
  13859. 1345.37 s [vector] +++ OK, passed 100 tests.
  13860. 1345.37 s [vector] notElem: OK
  13861. 1345.37 s [vector] +++ OK, passed 100 tests.
  13862. 1345.37 s [vector] find: OK
  13863. 1345.37 s [vector] +++ OK, passed 100 tests.
  13864. 1345.38 s [vector] findIndex: OK
  13865. 1345.38 s [vector] +++ OK, passed 100 tests.
  13866. 1345.38 s [vector] findIndexR: OK
  13867. 1345.38 s [vector] +++ OK, passed 100 tests.
  13868. 1345.38 s [vector] findIndices: OK
  13869. 1345.38 s [vector] +++ OK, passed 100 tests.
  13870. 1345.38 s [vector] elemIndex: OK
  13871. 1345.38 s [vector] +++ OK, passed 100 tests.
  13872. 1345.38 s [vector] elemIndices: OK
  13873. 1345.38 s [vector] +++ OK, passed 100 tests.
  13874. 1345.38 s [vector] foldl: OK
  13875. 1345.38 s [vector] +++ OK, passed 100 tests.
  13876. 1345.38 s [vector] foldl1: OK
  13877. 1345.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13878. 1345.38 s [vector] foldl': OK
  13879. 1345.38 s [vector] +++ OK, passed 100 tests.
  13880. 1345.39 s [vector] foldl1': OK
  13881. 1345.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13882. 1345.39 s [vector] foldr: OK
  13883. 1345.40 s [vector] +++ OK, passed 100 tests.
  13884. 1345.40 s [vector] foldr1: OK
  13885. 1345.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13886. 1345.41 s [vector] foldr': OK
  13887. 1345.41 s [vector] +++ OK, passed 100 tests.
  13888. 1345.41 s [vector] foldr1': OK
  13889. 1345.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13890. 1345.41 s [vector] ifoldl: OK
  13891. 1345.41 s [vector] +++ OK, passed 100 tests.
  13892. 1345.41 s [vector] ifoldl': OK
  13893. 1345.41 s [vector] +++ OK, passed 100 tests.
  13894. 1345.41 s [vector] ifoldr: OK
  13895. 1345.41 s [vector] +++ OK, passed 100 tests.
  13896. 1345.41 s [vector] ifoldr': OK
  13897. 1345.41 s [vector] +++ OK, passed 100 tests.
  13898. 1345.41 s [vector] ifoldM: OK
  13899. 1345.41 s [vector] +++ OK, passed 100 tests.
  13900. 1345.41 s [vector] ifoldM': OK
  13901. 1345.41 s [vector] +++ OK, passed 100 tests.
  13902. 1345.42 s [vector] ifoldM_: OK
  13903. 1345.42 s [vector] +++ OK, passed 100 tests.
  13904. 1345.44 s [vector] ifoldM'_: OK (0.02s)
  13905. 1345.44 s [vector] +++ OK, passed 100 tests.
  13906. 1345.44 s [vector] all: OK
  13907. 1345.44 s [vector] +++ OK, passed 100 tests.
  13908. 1345.44 s [vector] any: OK
  13909. 1345.44 s [vector] +++ OK, passed 100 tests.
  13910. 1345.45 s [vector] prescanl: OK
  13911. 1345.45 s [vector] +++ OK, passed 100 tests.
  13912. 1345.45 s [vector] prescanl': OK
  13913. 1345.45 s [vector] +++ OK, passed 100 tests.
  13914. 1345.46 s [vector] postscanl: OK
  13915. 1345.46 s [vector] +++ OK, passed 100 tests.
  13916. 1345.46 s [vector] postscanl': OK
  13917. 1345.46 s [vector] +++ OK, passed 100 tests.
  13918. 1345.46 s [vector] scanl: OK
  13919. 1345.46 s [vector] +++ OK, passed 100 tests.
  13920. 1345.47 s [vector] scanl': OK
  13921. 1345.47 s [vector] +++ OK, passed 100 tests.
  13922. 1345.47 s [vector] scanl1: OK
  13923. 1345.47 s [vector] +++ OK, passed 100 tests.
  13924. 1345.48 s [vector] scanl1': OK
  13925. 1345.48 s [vector] +++ OK, passed 100 tests.
  13926. 1345.48 s [vector] iscanl: OK
  13927. 1345.48 s [vector] +++ OK, passed 100 tests.
  13928. 1345.48 s [vector] iscanl': OK
  13929. 1345.48 s [vector] +++ OK, passed 100 tests.
  13930. 1345.49 s [vector] prescanr: OK
  13931. 1345.49 s [vector] +++ OK, passed 100 tests.
  13932. 1345.49 s [vector] prescanr': OK
  13933. 1345.49 s [vector] +++ OK, passed 100 tests.
  13934. 1345.49 s [vector] postscanr: OK
  13935. 1345.49 s [vector] +++ OK, passed 100 tests.
  13936. 1345.49 s [vector] postscanr': OK
  13937. 1345.49 s [vector] +++ OK, passed 100 tests.
  13938. 1345.49 s [vector] scanr: OK
  13939. 1345.49 s [vector] +++ OK, passed 100 tests.
  13940. 1345.49 s [vector] scanr': OK
  13941. 1345.49 s [vector] +++ OK, passed 100 tests.
  13942. 1345.50 s [vector] scanr1: OK
  13943. 1345.50 s [vector] +++ OK, passed 100 tests.
  13944. 1345.50 s [vector] scanr1': OK
  13945. 1345.50 s [vector] +++ OK, passed 100 tests.
  13946. 1345.50 s [vector] iscanr: OK
  13947. 1345.50 s [vector] +++ OK, passed 100 tests.
  13948. 1345.50 s [vector] iscanr': OK
  13949. 1345.50 s [vector] +++ OK, passed 100 tests.
  13950. 1345.50 s [vector] mut_read: OK
  13951. 1345.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13952. 1345.50 s [vector] mut_write: OK
  13953. 1345.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13954. 1345.50 s [vector] mut_modify: OK
  13955. 1345.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13956. 1345.50 s [vector] mut_generate: OK
  13957. 1345.50 s [vector] +++ OK, passed 100 tests.
  13958. 1345.51 s [vector] mut_generateM: OK
  13959. 1345.51 s [vector] +++ OK, passed 100 tests.
  13960. 1345.52 s [vector] mut_mapM_: OK (0.01s)
  13961. 1345.52 s [vector] +++ OK, passed 100 tests.
  13962. 1345.54 s [vector] mut_imapM_: OK (0.01s)
  13963. 1345.54 s [vector] +++ OK, passed 100 tests.
  13964. 1345.54 s [vector] mut_forM_: OK (0.01s)
  13965. 1345.54 s [vector] +++ OK, passed 100 tests.
  13966. 1345.55 s [vector] mut_iforM_: OK (0.01s)
  13967. 1345.55 s [vector] +++ OK, passed 100 tests.
  13968. 1345.55 s [vector] mut_foldr: OK
  13969. 1345.56 s [vector] +++ OK, passed 100 tests.
  13970. 1345.56 s [vector] mut_foldr': OK
  13971. 1345.56 s [vector] +++ OK, passed 100 tests.
  13972. 1345.56 s [vector] mut_foldl: OK
  13973. 1345.56 s [vector] +++ OK, passed 100 tests.
  13974. 1345.56 s [vector] mut_foldl': OK
  13975. 1345.56 s [vector] +++ OK, passed 100 tests.
  13976. 1345.56 s [vector] mut_ifoldr: OK
  13977. 1345.57 s [vector] +++ OK, passed 100 tests.
  13978. 1345.57 s [vector] mut_ifoldr': OK
  13979. 1345.57 s [vector] +++ OK, passed 100 tests.
  13980. 1345.58 s [vector] mut_ifoldl: OK
  13981. 1345.58 s [vector] +++ OK, passed 100 tests.
  13982. 1345.58 s [vector] mut_ifoldl': OK
  13983. 1345.58 s [vector] +++ OK, passed 100 tests.
  13984. 1345.58 s [vector] mut_foldM: OK
  13985. 1345.58 s [vector] +++ OK, passed 100 tests.
  13986. 1345.58 s [vector] mut_foldM': OK
  13987. 1345.58 s [vector] +++ OK, passed 100 tests.
  13988. 1345.58 s [vector] mut_foldrM: OK
  13989. 1345.58 s [vector] +++ OK, passed 100 tests.
  13990. 1345.58 s [vector] mut_foldrM': OK
  13991. 1345.58 s [vector] +++ OK, passed 100 tests.
  13992. 1345.58 s [vector] mut_ifoldM: OK
  13993. 1345.58 s [vector] +++ OK, passed 100 tests.
  13994. 1345.59 s [vector] mut_ifoldM': OK
  13995. 1345.59 s [vector] +++ OK, passed 100 tests.
  13996. 1345.59 s [vector] mut_ifoldrM: OK
  13997. 1345.59 s [vector] +++ OK, passed 100 tests.
  13998. 1345.59 s [vector] mut_ifoldrM': OK
  13999. 1345.59 s [vector] +++ OK, passed 100 tests.
  14000. 1345.59 s [vector] compare: OK
  14001. 1345.59 s [vector] +++ OK, passed 100 tests.
  14002. 1345.59 s [vector] maximum: OK
  14003. 1345.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14004. 1345.59 s [vector] minimum: OK
  14005. 1345.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14006. 1345.60 s [vector] minIndex: OK
  14007. 1345.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14008. 1345.60 s [vector] maxIndex: OK
  14009. 1345.60 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14010. 1345.60 s [vector] maximumBy: OK
  14011. 1345.60 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14012. 1345.60 s [vector] minimumBy: OK
  14013. 1345.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14014. 1345.60 s [vector] maximumOn: OK
  14015. 1345.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14016. 1345.60 s [vector] minimumOn: OK
  14017. 1345.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14018. 1345.60 s [vector] maxIndexBy: OK
  14019. 1345.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14020. 1345.60 s [vector] minIndexBy: OK
  14021. 1345.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14022. 1345.60 s [vector] ListFirstMaxIndexWins: OK
  14023. 1345.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14024. 1345.60 s [vector] FalseListFirstMaxIndexWins: OK
  14025. 1345.60 s [vector] +++ OK, failed as expected. (after 1 test):
  14026. 1345.60 s [vector] Exception:
  14027. 1345.60 s [vector] Prelude.foldr1: empty list
  14028. 1345.60 s [vector] CallStack (from HasCallStack):
  14029. 1345.60 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14030. 1345.60 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14031. 1345.60 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14032. 1345.60 s [vector] []
  14033. 1345.60 s [vector] zip: OK
  14034. 1345.60 s [vector] +++ OK, passed 100 tests.
  14035. 1345.60 s [vector] zip3: OK
  14036. 1345.60 s [vector] +++ OK, passed 100 tests.
  14037. 1345.60 s [vector] unzip: OK
  14038. 1345.60 s [vector] +++ OK, passed 100 tests.
  14039. 1345.60 s [vector] unzip3: OK
  14040. 1345.60 s [vector] +++ OK, passed 100 tests.
  14041. 1345.61 s [vector] indexed: OK
  14042. 1345.61 s [vector] +++ OK, passed 100 tests.
  14043. 1345.61 s [vector] update: OK
  14044. 1345.61 s [vector] +++ OK, passed 100 tests.
  14045. 1345.61 s [vector] concat: OK
  14046. 1345.61 s [vector] +++ OK, passed 100 tests.
  14047. 1345.61 s [vector] mempty: OK
  14048. 1345.61 s [vector] +++ OK, passed 100 tests.
  14049. 1345.62 s [vector] mappend: OK
  14050. 1345.62 s [vector] +++ OK, passed 100 tests.
  14051. 1345.62 s [vector] mconcat: OK
  14052. 1345.62 s [vector] +++ OK, passed 100 tests.
  14053. 1345.62 s [vector] fmap: OK
  14054. 1345.62 s [vector] +++ OK, passed 100 tests.
  14055. 1345.64 s [vector] return: OK
  14056. 1345.64 s [vector] +++ OK, passed 100 tests.
  14057. 1345.64 s [vector] bind: OK (0.01s)
  14058. 1345.64 s [vector] +++ OK, passed 100 tests.
  14059. 1345.64 s [vector] mzip: OK
  14060. 1345.64 s [vector] +++ OK, passed 100 tests.
  14061. 1345.64 s [vector] munzip: OK
  14062. 1345.64 s [vector] +++ OK, passed 100 tests.
  14063. 1345.66 s [vector] applicative_pure: OK
  14064. 1345.66 s [vector] +++ OK, passed 100 tests.
  14065. 1345.67 s [vector] applicative_appl: OK (0.03s)
  14066. 1345.67 s [vector] +++ OK, passed 100 tests.
  14067. 1345.68 s [vector] alternative_empty: OK
  14068. 1345.68 s [vector] +++ OK, passed 100 tests.
  14069. 1345.68 s [vector] alternative_or: OK
  14070. 1345.68 s [vector] +++ OK, passed 100 tests.
  14071. 1345.72 s [vector] sequence: OK (0.04s)
  14072. 1345.72 s [vector] +++ OK, passed 100 tests.
  14073. 1345.72 s [vector] sequence_: OK (0.01s)
  14074. 1345.72 s [vector] +++ OK, passed 100 tests.
  14075. 1345.72 s [vector] glength: OK
  14076. 1345.72 s [vector] +++ OK, passed 100 tests.
  14077. 1345.72 s [vector] sum: OK
  14078. 1345.72 s [vector] +++ OK, passed 100 tests.
  14079. 1345.72 s [vector] product: OK
  14080. 1345.72 s [vector] +++ OK, passed 100 tests.
  14081. 1345.72 s [vector] enumFromN: OK
  14082. 1345.72 s [vector] +++ OK, passed 100 tests.
  14083. 1345.72 s [vector] enumFromThenN: OK
  14084. 1345.72 s [vector] +++ OK, passed 100 tests.
  14085. 1345.72 s [vector] enumFromTo: OK
  14086. 1345.72 s [vector] +++ OK, passed 100 tests.
  14087. 1345.73 s [vector] enumFromThenTo: OK
  14088. 1345.73 s [vector] +++ OK, passed 100 tests; 10 discarded.
  14089. 1345.73 s [vector] unstream
  14090. 1345.73 s [vector] unstream == vunstream (exact): OK
  14091. 1345.73 s [vector] +++ OK, passed 100 tests.
  14092. 1345.73 s [vector] unstream == vunstream (unknown): OK
  14093. 1345.73 s [vector] +++ OK, passed 100 tests.
  14094. 1345.73 s [vector] unstreamR ~= vunstream (exact): OK
  14095. 1345.73 s [vector] +++ OK, passed 100 tests.
  14096. 1345.73 s [vector] unstreamR ~= vunstream (unknown): OK
  14097. 1345.73 s [vector] +++ OK, passed 100 tests.
  14098. 1345.73 s [vector] Tests.Vector.Unboxed
  14099. 1345.73 s [vector] ()
  14100. 1345.73 s [vector] fromList.toList == id: OK
  14101. 1345.73 s [vector] +++ OK, passed 100 tests.
  14102. 1345.73 s [vector] toList.fromList == id: OK
  14103. 1345.73 s [vector] +++ OK, passed 100 tests.
  14104. 1345.73 s [vector] unstream.stream == id: OK
  14105. 1345.73 s [vector] +++ OK, passed 100 tests.
  14106. 1345.73 s [vector] stream.unstream == id: OK
  14107. 1345.73 s [vector] +++ OK, passed 100 tests.
  14108. 1345.73 s [vector] eq: OK
  14109. 1345.73 s [vector] +++ OK, passed 100 tests.
  14110. 1345.73 s [vector] length: OK
  14111. 1345.73 s [vector] +++ OK, passed 100 tests.
  14112. 1345.73 s [vector] null: OK
  14113. 1345.73 s [vector] +++ OK, passed 100 tests.
  14114. 1345.73 s [vector] index: OK
  14115. 1345.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14116. 1345.73 s [vector] safeIndex: OK
  14117. 1345.73 s [vector] +++ OK, passed 100 tests.
  14118. 1345.73 s [vector] head: OK
  14119. 1345.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14120. 1345.73 s [vector] last: OK
  14121. 1345.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14122. 1345.73 s [vector] unsafeIndex: OK
  14123. 1345.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14124. 1345.73 s [vector] unsafeHead: OK
  14125. 1345.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14126. 1345.73 s [vector] unsafeLast: OK
  14127. 1345.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14128. 1345.74 s [vector] slice: OK
  14129. 1345.74 s [vector] +++ OK, passed 100 tests.
  14130. 1345.74 s [vector] init: OK
  14131. 1345.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14132. 1345.74 s [vector] tail: OK
  14133. 1345.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14134. 1345.74 s [vector] take: OK
  14135. 1345.74 s [vector] +++ OK, passed 100 tests.
  14136. 1345.74 s [vector] drop: OK
  14137. 1345.74 s [vector] +++ OK, passed 100 tests.
  14138. 1345.74 s [vector] splitAt: OK
  14139. 1345.74 s [vector] +++ OK, passed 100 tests.
  14140. 1345.74 s [vector] empty: OK
  14141. 1345.74 s [vector] +++ OK, passed 100 tests.
  14142. 1345.74 s [vector] singleton: OK
  14143. 1345.74 s [vector] +++ OK, passed 100 tests.
  14144. 1345.74 s [vector] replicate: OK
  14145. 1345.74 s [vector] +++ OK, passed 100 tests.
  14146. 1345.74 s [vector] generate: OK
  14147. 1345.74 s [vector] +++ OK, passed 100 tests.
  14148. 1345.74 s [vector] iterateN: OK
  14149. 1345.74 s [vector] +++ OK, passed 100 tests.
  14150. 1345.76 s [vector] iterateNM: OK (0.02s)
  14151. 1345.76 s [vector] +++ OK, passed 100 tests.
  14152. 1345.78 s [vector] generateM: OK (0.02s)
  14153. 1345.78 s [vector] +++ OK, passed 100 tests.
  14154. 1345.79 s [vector] replicateM: OK
  14155. 1345.79 s [vector] +++ OK, passed 100 tests.
  14156. 1345.79 s [vector] create: OK
  14157. 1345.79 s [vector] +++ OK, passed 100 tests.
  14158. 1345.79 s [vector] createT: OK
  14159. 1345.79 s [vector] +++ OK, passed 100 tests.
  14160. 1345.79 s [vector] unfoldr: OK
  14161. 1345.79 s [vector] +++ OK, passed 100 tests.
  14162. 1345.79 s [vector] unfoldrN: OK
  14163. 1345.79 s [vector] +++ OK, passed 100 tests.
  14164. 1345.79 s [vector] unfoldrExactN: OK
  14165. 1345.80 s [vector] +++ OK, passed 100 tests.
  14166. 1345.80 s [vector] unfoldrM: OK
  14167. 1345.80 s [vector] +++ OK, passed 100 tests.
  14168. 1345.80 s [vector] unfoldrNM: OK
  14169. 1345.80 s [vector] +++ OK, passed 100 tests.
  14170. 1345.84 s [vector] unfoldrExactNM: OK (0.04s)
  14171. 1345.84 s [vector] +++ OK, passed 100 tests.
  14172. 1345.84 s [vector] constructN: OK
  14173. 1345.84 s [vector] +++ OK, passed 100 tests.
  14174. 1345.84 s [vector] constructrN: OK
  14175. 1345.84 s [vector] +++ OK, passed 100 tests.
  14176. 1345.84 s [vector] cons: OK
  14177. 1345.84 s [vector] +++ OK, passed 100 tests.
  14178. 1345.84 s [vector] snoc: OK
  14179. 1345.85 s [vector] +++ OK, passed 100 tests.
  14180. 1345.85 s [vector] append: OK
  14181. 1345.85 s [vector] +++ OK, passed 100 tests.
  14182. 1345.85 s [vector] concat: OK
  14183. 1345.85 s [vector] +++ OK, passed 100 tests.
  14184. 1345.86 s [vector] force: OK
  14185. 1345.86 s [vector] +++ OK, passed 100 tests.
  14186. 1345.86 s [vector] upd: OK
  14187. 1345.86 s [vector] +++ OK, passed 100 tests.
  14188. 1345.86 s [vector] accum: OK
  14189. 1345.86 s [vector] +++ OK, passed 100 tests.
  14190. 1345.86 s [vector] reverse: OK
  14191. 1345.86 s [vector] +++ OK, passed 100 tests.
  14192. 1345.86 s [vector] backpermute: OK
  14193. 1345.86 s [vector] +++ OK, passed 100 tests.
  14194. 1345.86 s [vector] map: OK
  14195. 1345.86 s [vector] +++ OK, passed 100 tests.
  14196. 1345.86 s [vector] imap: OK
  14197. 1345.86 s [vector] +++ OK, passed 100 tests.
  14198. 1345.86 s [vector] concatMap: OK
  14199. 1345.87 s [vector] +++ OK, passed 100 tests.
  14200. 1345.88 s [vector] mapM: OK
  14201. 1345.88 s [vector] +++ OK, passed 100 tests.
  14202. 1345.88 s [vector] mapM_: OK
  14203. 1345.88 s [vector] +++ OK, passed 100 tests.
  14204. 1345.88 s [vector] forM: OK
  14205. 1345.88 s [vector] +++ OK, passed 100 tests.
  14206. 1345.89 s [vector] forM_: OK
  14207. 1345.89 s [vector] +++ OK, passed 100 tests.
  14208. 1345.89 s [vector] imapM: OK
  14209. 1345.90 s [vector] +++ OK, passed 100 tests.
  14210. 1345.90 s [vector] imapM_: OK (0.01s)
  14211. 1345.90 s [vector] +++ OK, passed 100 tests.
  14212. 1345.90 s [vector] zipWith: OK
  14213. 1345.90 s [vector] +++ OK, passed 100 tests.
  14214. 1345.90 s [vector] zipWith3: OK
  14215. 1345.90 s [vector] +++ OK, passed 100 tests.
  14216. 1345.90 s [vector] izipWith: OK
  14217. 1345.90 s [vector] +++ OK, passed 100 tests.
  14218. 1345.90 s [vector] izipWith3: OK
  14219. 1345.91 s [vector] +++ OK, passed 100 tests.
  14220. 1345.91 s [vector] izipWithM: OK
  14221. 1345.91 s [vector] +++ OK, passed 100 tests.
  14222. 1345.91 s [vector] izipWithM_: OK
  14223. 1345.92 s [vector] +++ OK, passed 100 tests.
  14224. 1345.92 s [vector] zipWithM: OK
  14225. 1345.92 s [vector] +++ OK, passed 100 tests.
  14226. 1345.92 s [vector] zipWithM_: OK (0.01s)
  14227. 1345.92 s [vector] +++ OK, passed 100 tests.
  14228. 1345.94 s [vector] filter: OK
  14229. 1345.94 s [vector] +++ OK, passed 100 tests.
  14230. 1345.94 s [vector] ifilter: OK
  14231. 1345.94 s [vector] +++ OK, passed 100 tests.
  14232. 1345.94 s [vector] filterM: OK (0.01s)
  14233. 1345.94 s [vector] +++ OK, passed 100 tests.
  14234. 1345.94 s [vector] uniq: OK
  14235. 1345.94 s [vector] +++ OK, passed 100 tests.
  14236. 1345.94 s [vector] mapMaybe: OK
  14237. 1345.94 s [vector] +++ OK, passed 100 tests.
  14238. 1345.94 s [vector] imapMaybe: OK
  14239. 1345.94 s [vector] +++ OK, passed 100 tests.
  14240. 1345.94 s [vector] takeWhile: OK
  14241. 1345.94 s [vector] +++ OK, passed 100 tests.
  14242. 1345.94 s [vector] dropWhile: OK
  14243. 1345.95 s [vector] +++ OK, passed 100 tests.
  14244. 1345.95 s [vector] partition: OK
  14245. 1345.95 s [vector] +++ OK, passed 100 tests.
  14246. 1345.95 s [vector] partitionWith: OK
  14247. 1345.95 s [vector] +++ OK, passed 100 tests.
  14248. 1345.95 s [vector] span: OK
  14249. 1345.95 s [vector] +++ OK, passed 100 tests.
  14250. 1345.95 s [vector] break: OK
  14251. 1345.95 s [vector] +++ OK, passed 100 tests.
  14252. 1345.95 s [vector] spanR: OK
  14253. 1345.95 s [vector] +++ OK, passed 100 tests.
  14254. 1345.95 s [vector] breakR: OK
  14255. 1345.95 s [vector] +++ OK, passed 100 tests.
  14256. 1345.95 s [vector] groupBy: OK
  14257. 1345.95 s [vector] +++ OK, passed 100 tests.
  14258. 1345.95 s [vector] elem: OK
  14259. 1345.95 s [vector] +++ OK, passed 100 tests.
  14260. 1345.95 s [vector] notElem: OK
  14261. 1345.95 s [vector] +++ OK, passed 100 tests.
  14262. 1345.95 s [vector] find: OK
  14263. 1345.95 s [vector] +++ OK, passed 100 tests.
  14264. 1345.95 s [vector] findIndex: OK
  14265. 1345.95 s [vector] +++ OK, passed 100 tests.
  14266. 1345.95 s [vector] findIndexR: OK
  14267. 1345.95 s [vector] +++ OK, passed 100 tests.
  14268. 1345.95 s [vector] findIndices: OK
  14269. 1345.95 s [vector] +++ OK, passed 100 tests.
  14270. 1345.95 s [vector] elemIndex: OK
  14271. 1345.95 s [vector] +++ OK, passed 100 tests.
  14272. 1345.95 s [vector] elemIndices: OK
  14273. 1345.95 s [vector] +++ OK, passed 100 tests.
  14274. 1345.95 s [vector] foldl: OK
  14275. 1345.95 s [vector] +++ OK, passed 100 tests.
  14276. 1345.95 s [vector] foldl1: OK
  14277. 1345.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14278. 1345.95 s [vector] foldl': OK
  14279. 1345.95 s [vector] +++ OK, passed 100 tests.
  14280. 1345.95 s [vector] foldl1': OK
  14281. 1345.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14282. 1345.95 s [vector] foldr: OK
  14283. 1345.95 s [vector] +++ OK, passed 100 tests.
  14284. 1345.95 s [vector] foldr1: OK
  14285. 1345.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14286. 1345.95 s [vector] foldr': OK
  14287. 1345.95 s [vector] +++ OK, passed 100 tests.
  14288. 1345.95 s [vector] foldr1': OK
  14289. 1345.95 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14290. 1345.95 s [vector] ifoldl: OK
  14291. 1345.95 s [vector] +++ OK, passed 100 tests.
  14292. 1345.96 s [vector] ifoldl': OK
  14293. 1345.96 s [vector] +++ OK, passed 100 tests.
  14294. 1345.96 s [vector] ifoldr: OK
  14295. 1345.96 s [vector] +++ OK, passed 100 tests.
  14296. 1345.96 s [vector] ifoldr': OK
  14297. 1345.96 s [vector] +++ OK, passed 100 tests.
  14298. 1345.96 s [vector] ifoldM: OK
  14299. 1345.96 s [vector] +++ OK, passed 100 tests.
  14300. 1345.96 s [vector] ifoldM': OK
  14301. 1345.96 s [vector] +++ OK, passed 100 tests.
  14302. 1345.98 s [vector] ifoldM_: OK (0.01s)
  14303. 1345.98 s [vector] +++ OK, passed 100 tests.
  14304. 1345.98 s [vector] ifoldM'_: OK
  14305. 1345.98 s [vector] +++ OK, passed 100 tests.
  14306. 1345.98 s [vector] all: OK
  14307. 1345.98 s [vector] +++ OK, passed 100 tests.
  14308. 1345.98 s [vector] any: OK
  14309. 1345.98 s [vector] +++ OK, passed 100 tests.
  14310. 1345.98 s [vector] prescanl: OK
  14311. 1345.99 s [vector] +++ OK, passed 100 tests.
  14312. 1345.99 s [vector] prescanl': OK
  14313. 1345.99 s [vector] +++ OK, passed 100 tests.
  14314. 1345.99 s [vector] postscanl: OK
  14315. 1345.99 s [vector] +++ OK, passed 100 tests.
  14316. 1345.99 s [vector] postscanl': OK
  14317. 1345.99 s [vector] +++ OK, passed 100 tests.
  14318. 1345.99 s [vector] scanl: OK
  14319. 1345.99 s [vector] +++ OK, passed 100 tests.
  14320. 1345.99 s [vector] scanl': OK
  14321. 1345.99 s [vector] +++ OK, passed 100 tests.
  14322. 1345.99 s [vector] scanl1: OK
  14323. 1345.99 s [vector] +++ OK, passed 100 tests.
  14324. 1345.99 s [vector] scanl1': OK
  14325. 1345.99 s [vector] +++ OK, passed 100 tests.
  14326. 1345.99 s [vector] iscanl: OK
  14327. 1345.99 s [vector] +++ OK, passed 100 tests.
  14328. 1345.99 s [vector] iscanl': OK
  14329. 1345.99 s [vector] +++ OK, passed 100 tests.
  14330. 1345.99 s [vector] prescanr: OK
  14331. 1345.99 s [vector] +++ OK, passed 100 tests.
  14332. 1346.00 s [vector] prescanr': OK
  14333. 1346.00 s [vector] +++ OK, passed 100 tests.
  14334. 1346.00 s [vector] postscanr: OK
  14335. 1346.00 s [vector] +++ OK, passed 100 tests.
  14336. 1346.00 s [vector] postscanr': OK
  14337. 1346.00 s [vector] +++ OK, passed 100 tests.
  14338. 1346.00 s [vector] scanr: OK
  14339. 1346.00 s [vector] +++ OK, passed 100 tests.
  14340. 1346.00 s [vector] scanr': OK
  14341. 1346.00 s [vector] +++ OK, passed 100 tests.
  14342. 1346.00 s [vector] scanr1: OK
  14343. 1346.00 s [vector] +++ OK, passed 100 tests.
  14344. 1346.00 s [vector] scanr1': OK
  14345. 1346.00 s [vector] +++ OK, passed 100 tests.
  14346. 1346.00 s [vector] iscanr: OK
  14347. 1346.00 s [vector] +++ OK, passed 100 tests.
  14348. 1346.00 s [vector] iscanr': OK
  14349. 1346.00 s [vector] +++ OK, passed 100 tests.
  14350. 1346.00 s [vector] mut_read: OK
  14351. 1346.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14352. 1346.00 s [vector] mut_write: OK
  14353. 1346.00 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14354. 1346.00 s [vector] mut_modify: OK
  14355. 1346.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14356. 1346.00 s [vector] mut_generate: OK
  14357. 1346.00 s [vector] +++ OK, passed 100 tests.
  14358. 1346.01 s [vector] mut_generateM: OK
  14359. 1346.01 s [vector] +++ OK, passed 100 tests.
  14360. 1346.02 s [vector] mut_mapM_: OK
  14361. 1346.02 s [vector] +++ OK, passed 100 tests.
  14362. 1346.02 s [vector] mut_imapM_: OK
  14363. 1346.02 s [vector] +++ OK, passed 100 tests.
  14364. 1346.04 s [vector] mut_forM_: OK (0.01s)
  14365. 1346.04 s [vector] +++ OK, passed 100 tests.
  14366. 1346.05 s [vector] mut_iforM_: OK
  14367. 1346.05 s [vector] +++ OK, passed 100 tests.
  14368. 1346.05 s [vector] mut_foldr: OK
  14369. 1346.05 s [vector] +++ OK, passed 100 tests.
  14370. 1346.05 s [vector] mut_foldr': OK
  14371. 1346.05 s [vector] +++ OK, passed 100 tests.
  14372. 1346.05 s [vector] mut_foldl: OK
  14373. 1346.05 s [vector] +++ OK, passed 100 tests.
  14374. 1346.05 s [vector] mut_foldl': OK
  14375. 1346.05 s [vector] +++ OK, passed 100 tests.
  14376. 1346.05 s [vector] mut_ifoldr: OK
  14377. 1346.05 s [vector] +++ OK, passed 100 tests.
  14378. 1346.05 s [vector] mut_ifoldr': OK
  14379. 1346.05 s [vector] +++ OK, passed 100 tests.
  14380. 1346.05 s [vector] mut_ifoldl: OK
  14381. 1346.05 s [vector] +++ OK, passed 100 tests.
  14382. 1346.05 s [vector] mut_ifoldl': OK
  14383. 1346.05 s [vector] +++ OK, passed 100 tests.
  14384. 1346.05 s [vector] mut_foldM: OK
  14385. 1346.05 s [vector] +++ OK, passed 100 tests.
  14386. 1346.05 s [vector] mut_foldM': OK
  14387. 1346.05 s [vector] +++ OK, passed 100 tests.
  14388. 1346.05 s [vector] mut_foldrM: OK
  14389. 1346.05 s [vector] +++ OK, passed 100 tests.
  14390. 1346.05 s [vector] mut_foldrM': OK
  14391. 1346.05 s [vector] +++ OK, passed 100 tests.
  14392. 1346.05 s [vector] mut_ifoldM: OK
  14393. 1346.05 s [vector] +++ OK, passed 100 tests.
  14394. 1346.05 s [vector] mut_ifoldM': OK
  14395. 1346.05 s [vector] +++ OK, passed 100 tests.
  14396. 1346.05 s [vector] mut_ifoldrM: OK
  14397. 1346.05 s [vector] +++ OK, passed 100 tests.
  14398. 1346.05 s [vector] mut_ifoldrM': OK
  14399. 1346.06 s [vector] +++ OK, passed 100 tests.
  14400. 1346.06 s [vector] compare: OK
  14401. 1346.06 s [vector] +++ OK, passed 100 tests.
  14402. 1346.06 s [vector] maximum: OK
  14403. 1346.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14404. 1346.06 s [vector] minimum: OK
  14405. 1346.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14406. 1346.06 s [vector] minIndex: OK
  14407. 1346.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14408. 1346.06 s [vector] maxIndex: OK
  14409. 1346.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14410. 1346.06 s [vector] maximumBy: OK
  14411. 1346.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14412. 1346.06 s [vector] minimumBy: OK
  14413. 1346.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14414. 1346.06 s [vector] maximumOn: OK
  14415. 1346.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14416. 1346.06 s [vector] minimumOn: OK
  14417. 1346.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14418. 1346.06 s [vector] maxIndexBy: OK
  14419. 1346.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14420. 1346.06 s [vector] minIndexBy: OK
  14421. 1346.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14422. 1346.06 s [vector] ListFirstMaxIndexWins: OK
  14423. 1346.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14424. 1346.06 s [vector] FalseListFirstMaxIndexWins: OK
  14425. 1346.06 s [vector] +++ OK, failed as expected. (after 1 test):
  14426. 1346.06 s [vector] Exception:
  14427. 1346.06 s [vector] Prelude.foldr1: empty list
  14428. 1346.06 s [vector] CallStack (from HasCallStack):
  14429. 1346.06 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14430. 1346.06 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14431. 1346.06 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14432. 1346.06 s [vector] []
  14433. 1346.06 s [vector] zip: OK
  14434. 1346.06 s [vector] +++ OK, passed 100 tests.
  14435. 1346.07 s [vector] zip3: OK
  14436. 1346.07 s [vector] +++ OK, passed 100 tests.
  14437. 1346.07 s [vector] unzip: OK
  14438. 1346.07 s [vector] +++ OK, passed 100 tests.
  14439. 1346.07 s [vector] unzip3: OK
  14440. 1346.07 s [vector] +++ OK, passed 100 tests.
  14441. 1346.07 s [vector] indexed: OK
  14442. 1346.07 s [vector] +++ OK, passed 100 tests.
  14443. 1346.07 s [vector] update: OK
  14444. 1346.07 s [vector] +++ OK, passed 100 tests.
  14445. 1346.07 s [vector] mempty: OK
  14446. 1346.07 s [vector] +++ OK, passed 100 tests.
  14447. 1346.07 s [vector] mappend: OK
  14448. 1346.08 s [vector] +++ OK, passed 100 tests.
  14449. 1346.08 s [vector] mconcat: OK
  14450. 1346.08 s [vector] +++ OK, passed 100 tests.
  14451. 1346.08 s [vector] glength: OK
  14452. 1346.08 s [vector] +++ OK, passed 100 tests.
  14453. 1346.08 s [vector] (Bool)
  14454. 1346.08 s [vector] fromList.toList == id: OK
  14455. 1346.08 s [vector] +++ OK, passed 100 tests.
  14456. 1346.08 s [vector] toList.fromList == id: OK
  14457. 1346.08 s [vector] +++ OK, passed 100 tests.
  14458. 1346.08 s [vector] unstream.stream == id: OK
  14459. 1346.08 s [vector] +++ OK, passed 100 tests.
  14460. 1346.08 s [vector] stream.unstream == id: OK
  14461. 1346.08 s [vector] +++ OK, passed 100 tests.
  14462. 1346.08 s [vector] eq: OK
  14463. 1346.08 s [vector] +++ OK, passed 100 tests.
  14464. 1346.09 s [vector] length: OK
  14465. 1346.09 s [vector] +++ OK, passed 100 tests.
  14466. 1346.09 s [vector] null: OK
  14467. 1346.09 s [vector] +++ OK, passed 100 tests.
  14468. 1346.09 s [vector] index: OK
  14469. 1346.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14470. 1346.09 s [vector] safeIndex: OK
  14471. 1346.09 s [vector] +++ OK, passed 100 tests.
  14472. 1346.09 s [vector] head: OK
  14473. 1346.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14474. 1346.09 s [vector] last: OK
  14475. 1346.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14476. 1346.09 s [vector] unsafeIndex: OK
  14477. 1346.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14478. 1346.09 s [vector] unsafeHead: OK
  14479. 1346.09 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14480. 1346.09 s [vector] unsafeLast: OK
  14481. 1346.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14482. 1346.09 s [vector] slice: OK
  14483. 1346.09 s [vector] +++ OK, passed 100 tests.
  14484. 1346.09 s [vector] init: OK
  14485. 1346.09 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14486. 1346.09 s [vector] tail: OK
  14487. 1346.09 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14488. 1346.09 s [vector] take: OK
  14489. 1346.09 s [vector] +++ OK, passed 100 tests.
  14490. 1346.09 s [vector] drop: OK
  14491. 1346.09 s [vector] +++ OK, passed 100 tests.
  14492. 1346.09 s [vector] splitAt: OK
  14493. 1346.09 s [vector] +++ OK, passed 100 tests.
  14494. 1346.09 s [vector] empty: OK
  14495. 1346.09 s [vector] +++ OK, passed 100 tests.
  14496. 1346.09 s [vector] singleton: OK
  14497. 1346.09 s [vector] +++ OK, passed 100 tests.
  14498. 1346.09 s [vector] replicate: OK
  14499. 1346.09 s [vector] +++ OK, passed 100 tests.
  14500. 1346.09 s [vector] generate: OK
  14501. 1346.09 s [vector] +++ OK, passed 100 tests.
  14502. 1346.10 s [vector] iterateN: OK
  14503. 1346.10 s [vector] +++ OK, passed 100 tests.
  14504. 1346.11 s [vector] iterateNM: OK (0.01s)
  14505. 1346.11 s [vector] +++ OK, passed 100 tests.
  14506. 1346.12 s [vector] generateM: OK
  14507. 1346.12 s [vector] +++ OK, passed 100 tests.
  14508. 1346.12 s [vector] replicateM: OK
  14509. 1346.12 s [vector] +++ OK, passed 100 tests.
  14510. 1346.12 s [vector] create: OK
  14511. 1346.12 s [vector] +++ OK, passed 100 tests.
  14512. 1346.12 s [vector] createT: OK
  14513. 1346.12 s [vector] +++ OK, passed 100 tests.
  14514. 1346.13 s [vector] unfoldr: OK
  14515. 1346.13 s [vector] +++ OK, passed 100 tests.
  14516. 1346.15 s [vector] unfoldrN: OK
  14517. 1346.15 s [vector] +++ OK, passed 100 tests.
  14518. 1346.16 s [vector] unfoldrExactN: OK
  14519. 1346.16 s [vector] +++ OK, passed 100 tests.
  14520. 1346.16 s [vector] unfoldrM: OK
  14521. 1346.16 s [vector] +++ OK, passed 100 tests.
  14522. 1346.16 s [vector] unfoldrNM: OK
  14523. 1346.16 s [vector] +++ OK, passed 100 tests.
  14524. 1346.17 s [vector] unfoldrExactNM: OK (0.03s)
  14525. 1346.17 s [vector] +++ OK, passed 100 tests.
  14526. 1346.18 s [vector] constructN: OK
  14527. 1346.18 s [vector] +++ OK, passed 100 tests.
  14528. 1346.18 s [vector] constructrN: OK
  14529. 1346.18 s [vector] +++ OK, passed 100 tests.
  14530. 1346.18 s [vector] cons: OK
  14531. 1346.18 s [vector] +++ OK, passed 100 tests.
  14532. 1346.18 s [vector] snoc: OK
  14533. 1346.18 s [vector] +++ OK, passed 100 tests.
  14534. 1346.18 s [vector] append: OK
  14535. 1346.18 s [vector] +++ OK, passed 100 tests.
  14536. 1346.18 s [vector] concat: OK (0.01s)
  14537. 1346.18 s [vector] +++ OK, passed 100 tests.
  14538. 1346.19 s [vector] force: OK
  14539. 1346.19 s [vector] +++ OK, passed 100 tests.
  14540. 1346.19 s [vector] upd: OK
  14541. 1346.19 s [vector] +++ OK, passed 100 tests.
  14542. 1346.19 s [vector] accum: OK
  14543. 1346.19 s [vector] +++ OK, passed 100 tests.
  14544. 1346.19 s [vector] reverse: OK
  14545. 1346.19 s [vector] +++ OK, passed 100 tests.
  14546. 1346.19 s [vector] backpermute: OK
  14547. 1346.19 s [vector] +++ OK, passed 100 tests.
  14548. 1346.20 s [vector] map: OK
  14549. 1346.20 s [vector] +++ OK, passed 100 tests.
  14550. 1346.20 s [vector] imap: OK
  14551. 1346.20 s [vector] +++ OK, passed 100 tests.
  14552. 1346.20 s [vector] concatMap: OK
  14553. 1346.20 s [vector] +++ OK, passed 100 tests.
  14554. 1346.20 s [vector] mapM: OK
  14555. 1346.20 s [vector] +++ OK, passed 100 tests.
  14556. 1346.21 s [vector] mapM_: OK (0.01s)
  14557. 1346.22 s [vector] +++ OK, passed 100 tests.
  14558. 1346.22 s [vector] forM: OK
  14559. 1346.22 s [vector] +++ OK, passed 100 tests.
  14560. 1346.22 s [vector] forM_: OK (0.01s)
  14561. 1346.22 s [vector] +++ OK, passed 100 tests.
  14562. 1346.22 s [vector] imapM: OK
  14563. 1346.22 s [vector] +++ OK, passed 100 tests.
  14564. 1346.23 s [vector] imapM_: OK
  14565. 1346.23 s [vector] +++ OK, passed 100 tests.
  14566. 1346.23 s [vector] zipWith: OK
  14567. 1346.23 s [vector] +++ OK, passed 100 tests.
  14568. 1346.24 s [vector] zipWith3: OK
  14569. 1346.24 s [vector] +++ OK, passed 100 tests.
  14570. 1346.24 s [vector] izipWith: OK
  14571. 1346.24 s [vector] +++ OK, passed 100 tests.
  14572. 1346.24 s [vector] izipWith3: OK
  14573. 1346.24 s [vector] +++ OK, passed 100 tests.
  14574. 1346.24 s [vector] izipWithM: OK
  14575. 1346.24 s [vector] +++ OK, passed 100 tests.
  14576. 1346.25 s [vector] izipWithM_: OK
  14577. 1346.25 s [vector] +++ OK, passed 100 tests.
  14578. 1346.25 s [vector] zipWithM: OK
  14579. 1346.26 s [vector] +++ OK, passed 100 tests.
  14580. 1346.26 s [vector] zipWithM_: OK
  14581. 1346.26 s [vector] +++ OK, passed 100 tests.
  14582. 1346.26 s [vector] filter: OK
  14583. 1346.26 s [vector] +++ OK, passed 100 tests.
  14584. 1346.26 s [vector] ifilter: OK
  14585. 1346.26 s [vector] +++ OK, passed 100 tests.
  14586. 1346.27 s [vector] filterM: OK (0.02s)
  14587. 1346.27 s [vector] +++ OK, passed 100 tests.
  14588. 1346.28 s [vector] uniq: OK
  14589. 1346.28 s [vector] +++ OK, passed 100 tests.
  14590. 1346.28 s [vector] mapMaybe: OK
  14591. 1346.28 s [vector] +++ OK, passed 100 tests.
  14592. 1346.28 s [vector] imapMaybe: OK
  14593. 1346.28 s [vector] +++ OK, passed 100 tests.
  14594. 1346.28 s [vector] takeWhile: OK
  14595. 1346.28 s [vector] +++ OK, passed 100 tests.
  14596. 1346.28 s [vector] dropWhile: OK
  14597. 1346.28 s [vector] +++ OK, passed 100 tests.
  14598. 1346.28 s [vector] partition: OK
  14599. 1346.28 s [vector] +++ OK, passed 100 tests.
  14600. 1346.28 s [vector] partitionWith: OK
  14601. 1346.28 s [vector] +++ OK, passed 100 tests.
  14602. 1346.28 s [vector] span: OK
  14603. 1346.28 s [vector] +++ OK, passed 100 tests.
  14604. 1346.28 s [vector] break: OK
  14605. 1346.28 s [vector] +++ OK, passed 100 tests.
  14606. 1346.29 s [vector] spanR: OK
  14607. 1346.29 s [vector] +++ OK, passed 100 tests.
  14608. 1346.29 s [vector] breakR: OK
  14609. 1346.29 s [vector] +++ OK, passed 100 tests.
  14610. 1346.29 s [vector] groupBy: OK
  14611. 1346.29 s [vector] +++ OK, passed 100 tests.
  14612. 1346.29 s [vector] elem: OK
  14613. 1346.29 s [vector] +++ OK, passed 100 tests.
  14614. 1346.29 s [vector] notElem: OK
  14615. 1346.29 s [vector] +++ OK, passed 100 tests.
  14616. 1346.29 s [vector] find: OK
  14617. 1346.29 s [vector] +++ OK, passed 100 tests.
  14618. 1346.29 s [vector] findIndex: OK
  14619. 1346.29 s [vector] +++ OK, passed 100 tests.
  14620. 1346.29 s [vector] findIndexR: OK
  14621. 1346.29 s [vector] +++ OK, passed 100 tests.
  14622. 1346.29 s [vector] findIndices: OK
  14623. 1346.29 s [vector] +++ OK, passed 100 tests.
  14624. 1346.29 s [vector] elemIndex: OK
  14625. 1346.29 s [vector] +++ OK, passed 100 tests.
  14626. 1346.29 s [vector] elemIndices: OK
  14627. 1346.30 s [vector] +++ OK, passed 100 tests.
  14628. 1346.30 s [vector] foldl: OK
  14629. 1346.30 s [vector] +++ OK, passed 100 tests.
  14630. 1346.30 s [vector] foldl1: OK
  14631. 1346.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14632. 1346.30 s [vector] foldl': OK
  14633. 1346.30 s [vector] +++ OK, passed 100 tests.
  14634. 1346.30 s [vector] foldl1': OK
  14635. 1346.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14636. 1346.30 s [vector] foldr: OK
  14637. 1346.30 s [vector] +++ OK, passed 100 tests.
  14638. 1346.30 s [vector] foldr1: OK
  14639. 1346.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14640. 1346.30 s [vector] foldr': OK
  14641. 1346.30 s [vector] +++ OK, passed 100 tests.
  14642. 1346.30 s [vector] foldr1': OK
  14643. 1346.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14644. 1346.31 s [vector] ifoldl: OK
  14645. 1346.31 s [vector] +++ OK, passed 100 tests.
  14646. 1346.32 s [vector] ifoldl': OK
  14647. 1346.32 s [vector] +++ OK, passed 100 tests.
  14648. 1346.32 s [vector] ifoldr: OK
  14649. 1346.32 s [vector] +++ OK, passed 100 tests.
  14650. 1346.32 s [vector] ifoldr': OK
  14651. 1346.32 s [vector] +++ OK, passed 100 tests.
  14652. 1346.32 s [vector] ifoldM: OK
  14653. 1346.32 s [vector] +++ OK, passed 100 tests.
  14654. 1346.33 s [vector] ifoldM': OK
  14655. 1346.33 s [vector] +++ OK, passed 100 tests.
  14656. 1346.33 s [vector] ifoldM_: OK (0.01s)
  14657. 1346.34 s [vector] +++ OK, passed 100 tests.
  14658. 1346.34 s [vector] ifoldM'_: OK (0.01s)
  14659. 1346.34 s [vector] +++ OK, passed 100 tests.
  14660. 1346.34 s [vector] all: OK
  14661. 1346.34 s [vector] +++ OK, passed 100 tests.
  14662. 1346.34 s [vector] any: OK
  14663. 1346.34 s [vector] +++ OK, passed 100 tests.
  14664. 1346.34 s [vector] prescanl: OK
  14665. 1346.34 s [vector] +++ OK, passed 100 tests.
  14666. 1346.34 s [vector] prescanl': OK
  14667. 1346.34 s [vector] +++ OK, passed 100 tests.
  14668. 1346.34 s [vector] postscanl: OK
  14669. 1346.34 s [vector] +++ OK, passed 100 tests.
  14670. 1346.34 s [vector] postscanl': OK
  14671. 1346.34 s [vector] +++ OK, passed 100 tests.
  14672. 1346.34 s [vector] scanl: OK
  14673. 1346.34 s [vector] +++ OK, passed 100 tests.
  14674. 1346.34 s [vector] scanl': OK
  14675. 1346.34 s [vector] +++ OK, passed 100 tests.
  14676. 1346.34 s [vector] scanl1: OK
  14677. 1346.35 s [vector] +++ OK, passed 100 tests.
  14678. 1346.35 s [vector] scanl1': OK
  14679. 1346.35 s [vector] +++ OK, passed 100 tests.
  14680. 1346.35 s [vector] iscanl: OK
  14681. 1346.35 s [vector] +++ OK, passed 100 tests.
  14682. 1346.35 s [vector] iscanl': OK
  14683. 1346.36 s [vector] +++ OK, passed 100 tests.
  14684. 1346.36 s [vector] prescanr: OK
  14685. 1346.36 s [vector] +++ OK, passed 100 tests.
  14686. 1346.36 s [vector] prescanr': OK
  14687. 1346.36 s [vector] +++ OK, passed 100 tests.
  14688. 1346.36 s [vector] postscanr: OK
  14689. 1346.36 s [vector] +++ OK, passed 100 tests.
  14690. 1346.36 s [vector] postscanr': OK
  14691. 1346.36 s [vector] +++ OK, passed 100 tests.
  14692. 1346.36 s [vector] scanr: OK
  14693. 1346.36 s [vector] +++ OK, passed 100 tests.
  14694. 1346.36 s [vector] scanr': OK
  14695. 1346.36 s [vector] +++ OK, passed 100 tests.
  14696. 1346.36 s [vector] scanr1: OK
  14697. 1346.36 s [vector] +++ OK, passed 100 tests.
  14698. 1346.36 s [vector] scanr1': OK
  14699. 1346.36 s [vector] +++ OK, passed 100 tests.
  14700. 1346.36 s [vector] iscanr: OK
  14701. 1346.36 s [vector] +++ OK, passed 100 tests.
  14702. 1346.36 s [vector] iscanr': OK
  14703. 1346.36 s [vector] +++ OK, passed 100 tests.
  14704. 1346.36 s [vector] mut_read: OK
  14705. 1346.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14706. 1346.37 s [vector] mut_write: OK
  14707. 1346.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14708. 1346.38 s [vector] mut_modify: OK
  14709. 1346.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14710. 1346.38 s [vector] mut_generate: OK
  14711. 1346.38 s [vector] +++ OK, passed 100 tests.
  14712. 1346.38 s [vector] mut_generateM: OK
  14713. 1346.38 s [vector] +++ OK, passed 100 tests.
  14714. 1346.38 s [vector] mut_mapM_: OK
  14715. 1346.38 s [vector] +++ OK, passed 100 tests.
  14716. 1346.40 s [vector] mut_imapM_: OK (0.01s)
  14717. 1346.40 s [vector] +++ OK, passed 100 tests.
  14718. 1346.42 s [vector] mut_forM_: OK (0.01s)
  14719. 1346.42 s [vector] +++ OK, passed 100 tests.
  14720. 1346.42 s [vector] mut_iforM_: OK (0.02s)
  14721. 1346.42 s [vector] +++ OK, passed 100 tests.
  14722. 1346.42 s [vector] mut_foldr: OK
  14723. 1346.42 s [vector] +++ OK, passed 100 tests.
  14724. 1346.43 s [vector] mut_foldr': OK
  14725. 1346.43 s [vector] +++ OK, passed 100 tests.
  14726. 1346.43 s [vector] mut_foldl: OK
  14727. 1346.43 s [vector] +++ OK, passed 100 tests.
  14728. 1346.43 s [vector] mut_foldl': OK
  14729. 1346.43 s [vector] +++ OK, passed 100 tests.
  14730. 1346.43 s [vector] mut_ifoldr: OK
  14731. 1346.43 s [vector] +++ OK, passed 100 tests.
  14732. 1346.43 s [vector] mut_ifoldr': OK
  14733. 1346.43 s [vector] +++ OK, passed 100 tests.
  14734. 1346.43 s [vector] mut_ifoldl: OK
  14735. 1346.43 s [vector] +++ OK, passed 100 tests.
  14736. 1346.44 s [vector] mut_ifoldl': OK
  14737. 1346.44 s [vector] +++ OK, passed 100 tests.
  14738. 1346.44 s [vector] mut_foldM: OK
  14739. 1346.44 s [vector] +++ OK, passed 100 tests.
  14740. 1346.44 s [vector] mut_foldM': OK
  14741. 1346.44 s [vector] +++ OK, passed 100 tests.
  14742. 1346.44 s [vector] mut_foldrM: OK
  14743. 1346.44 s [vector] +++ OK, passed 100 tests.
  14744. 1346.44 s [vector] mut_foldrM': OK
  14745. 1346.45 s [vector] +++ OK, passed 100 tests.
  14746. 1346.45 s [vector] mut_ifoldM: OK
  14747. 1346.45 s [vector] +++ OK, passed 100 tests.
  14748. 1346.45 s [vector] mut_ifoldM': OK
  14749. 1346.45 s [vector] +++ OK, passed 100 tests.
  14750. 1346.45 s [vector] mut_ifoldrM: OK
  14751. 1346.45 s [vector] +++ OK, passed 100 tests.
  14752. 1346.45 s [vector] mut_ifoldrM': OK
  14753. 1346.45 s [vector] +++ OK, passed 100 tests.
  14754. 1346.45 s [vector] compare: OK
  14755. 1346.45 s [vector] +++ OK, passed 100 tests.
  14756. 1346.45 s [vector] maximum: OK
  14757. 1346.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14758. 1346.45 s [vector] minimum: OK
  14759. 1346.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14760. 1346.45 s [vector] minIndex: OK
  14761. 1346.45 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14762. 1346.45 s [vector] maxIndex: OK
  14763. 1346.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14764. 1346.45 s [vector] maximumBy: OK
  14765. 1346.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14766. 1346.45 s [vector] minimumBy: OK
  14767. 1346.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14768. 1346.45 s [vector] maximumOn: OK
  14769. 1346.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14770. 1346.45 s [vector] minimumOn: OK
  14771. 1346.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14772. 1346.46 s [vector] maxIndexBy: OK
  14773. 1346.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14774. 1346.46 s [vector] minIndexBy: OK
  14775. 1346.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14776. 1346.46 s [vector] ListFirstMaxIndexWins: OK
  14777. 1346.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14778. 1346.46 s [vector] FalseListFirstMaxIndexWins: OK
  14779. 1346.46 s [vector] +++ OK, failed as expected. (after 1 test):
  14780. 1346.46 s [vector] Exception:
  14781. 1346.46 s [vector] Prelude.foldr1: empty list
  14782. 1346.46 s [vector] CallStack (from HasCallStack):
  14783. 1346.46 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14784. 1346.46 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14785. 1346.46 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14786. 1346.46 s [vector] []
  14787. 1346.46 s [vector] zip: OK
  14788. 1346.46 s [vector] +++ OK, passed 100 tests.
  14789. 1346.46 s [vector] zip3: OK
  14790. 1346.46 s [vector] +++ OK, passed 100 tests.
  14791. 1346.46 s [vector] unzip: OK
  14792. 1346.46 s [vector] +++ OK, passed 100 tests.
  14793. 1346.46 s [vector] unzip3: OK
  14794. 1346.46 s [vector] +++ OK, passed 100 tests.
  14795. 1346.46 s [vector] indexed: OK
  14796. 1346.46 s [vector] +++ OK, passed 100 tests.
  14797. 1346.47 s [vector] update: OK
  14798. 1346.47 s [vector] +++ OK, passed 100 tests.
  14799. 1346.47 s [vector] mempty: OK
  14800. 1346.48 s [vector] +++ OK, passed 100 tests.
  14801. 1346.48 s [vector] mappend: OK
  14802. 1346.48 s [vector] +++ OK, passed 100 tests.
  14803. 1346.48 s [vector] mconcat: OK (0.01s)
  14804. 1346.48 s [vector] +++ OK, passed 100 tests.
  14805. 1346.48 s [vector] glength: OK
  14806. 1346.48 s [vector] +++ OK, passed 100 tests.
  14807. 1346.48 s [vector] and: OK
  14808. 1346.48 s [vector] +++ OK, passed 100 tests.
  14809. 1346.49 s [vector] or: OK
  14810. 1346.49 s [vector] +++ OK, passed 100 tests.
  14811. 1346.49 s [vector] (Int)
  14812. 1346.49 s [vector] fromList.toList == id: OK
  14813. 1346.49 s [vector] +++ OK, passed 100 tests.
  14814. 1346.49 s [vector] toList.fromList == id: OK
  14815. 1346.49 s [vector] +++ OK, passed 100 tests.
  14816. 1346.49 s [vector] unstream.stream == id: OK
  14817. 1346.49 s [vector] +++ OK, passed 100 tests.
  14818. 1346.49 s [vector] stream.unstream == id: OK
  14819. 1346.49 s [vector] +++ OK, passed 100 tests.
  14820. 1346.49 s [vector] eq: OK
  14821. 1346.49 s [vector] +++ OK, passed 100 tests.
  14822. 1346.49 s [vector] length: OK
  14823. 1346.49 s [vector] +++ OK, passed 100 tests.
  14824. 1346.49 s [vector] null: OK
  14825. 1346.49 s [vector] +++ OK, passed 100 tests.
  14826. 1346.49 s [vector] index: OK
  14827. 1346.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14828. 1346.49 s [vector] safeIndex: OK
  14829. 1346.49 s [vector] +++ OK, passed 100 tests.
  14830. 1346.49 s [vector] head: OK
  14831. 1346.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14832. 1346.49 s [vector] last: OK
  14833. 1346.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14834. 1346.49 s [vector] unsafeIndex: OK
  14835. 1346.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14836. 1346.49 s [vector] unsafeHead: OK
  14837. 1346.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14838. 1346.49 s [vector] unsafeLast: OK
  14839. 1346.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14840. 1346.50 s [vector] slice: OK
  14841. 1346.50 s [vector] +++ OK, passed 100 tests.
  14842. 1346.50 s [vector] init: OK
  14843. 1346.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14844. 1346.50 s [vector] tail: OK
  14845. 1346.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14846. 1346.50 s [vector] take: OK
  14847. 1346.50 s [vector] +++ OK, passed 100 tests.
  14848. 1346.50 s [vector] drop: OK
  14849. 1346.50 s [vector] +++ OK, passed 100 tests.
  14850. 1346.50 s [vector] splitAt: OK
  14851. 1346.50 s [vector] +++ OK, passed 100 tests.
  14852. 1346.50 s [vector] empty: OK
  14853. 1346.50 s [vector] +++ OK, passed 100 tests.
  14854. 1346.50 s [vector] singleton: OK
  14855. 1346.50 s [vector] +++ OK, passed 100 tests.
  14856. 1346.50 s [vector] replicate: OK
  14857. 1346.50 s [vector] +++ OK, passed 100 tests.
  14858. 1346.50 s [vector] generate: OK
  14859. 1346.50 s [vector] +++ OK, passed 100 tests.
  14860. 1346.52 s [vector] iterateN: OK
  14861. 1346.52 s [vector] +++ OK, passed 100 tests.
  14862. 1346.52 s [vector] iterateNM: OK (0.01s)
  14863. 1346.52 s [vector] +++ OK, passed 100 tests.
  14864. 1346.55 s [vector] generateM: OK (0.03s)
  14865. 1346.55 s [vector] +++ OK, passed 100 tests.
  14866. 1346.55 s [vector] replicateM: OK
  14867. 1346.55 s [vector] +++ OK, passed 100 tests.
  14868. 1346.55 s [vector] create: OK
  14869. 1346.55 s [vector] +++ OK, passed 100 tests.
  14870. 1346.55 s [vector] createT: OK
  14871. 1346.55 s [vector] +++ OK, passed 100 tests.
  14872. 1346.55 s [vector] unfoldr: OK
  14873. 1346.55 s [vector] +++ OK, passed 100 tests.
  14874. 1346.55 s [vector] unfoldrN: OK
  14875. 1346.55 s [vector] +++ OK, passed 100 tests.
  14876. 1346.55 s [vector] unfoldrExactN: OK
  14877. 1346.55 s [vector] +++ OK, passed 100 tests.
  14878. 1346.56 s [vector] unfoldrM: OK
  14879. 1346.56 s [vector] +++ OK, passed 100 tests.
  14880. 1346.56 s [vector] unfoldrNM: OK
  14881. 1346.56 s [vector] +++ OK, passed 100 tests.
  14882. 1346.58 s [vector] unfoldrExactNM: OK (0.02s)
  14883. 1346.59 s [vector] +++ OK, passed 100 tests.
  14884. 1346.59 s [vector] constructN: OK
  14885. 1346.59 s [vector] +++ OK, passed 100 tests.
  14886. 1346.59 s [vector] constructrN: OK
  14887. 1346.59 s [vector] +++ OK, passed 100 tests.
  14888. 1346.59 s [vector] cons: OK
  14889. 1346.59 s [vector] +++ OK, passed 100 tests.
  14890. 1346.59 s [vector] snoc: OK
  14891. 1346.60 s [vector] +++ OK, passed 100 tests.
  14892. 1346.60 s [vector] append: OK
  14893. 1346.60 s [vector] +++ OK, passed 100 tests.
  14894. 1346.61 s [vector] concat: OK (0.01s)
  14895. 1346.61 s [vector] +++ OK, passed 100 tests.
  14896. 1346.61 s [vector] force: OK
  14897. 1346.61 s [vector] +++ OK, passed 100 tests.
  14898. 1346.61 s [vector] upd: OK
  14899. 1346.61 s [vector] +++ OK, passed 100 tests.
  14900. 1346.61 s [vector] accum: OK
  14901. 1346.61 s [vector] +++ OK, passed 100 tests.
  14902. 1346.61 s [vector] reverse: OK
  14903. 1346.61 s [vector] +++ OK, passed 100 tests.
  14904. 1346.61 s [vector] backpermute: OK
  14905. 1346.61 s [vector] +++ OK, passed 100 tests.
  14906. 1346.62 s [vector] map: OK
  14907. 1346.62 s [vector] +++ OK, passed 100 tests.
  14908. 1346.62 s [vector] imap: OK
  14909. 1346.62 s [vector] +++ OK, passed 100 tests.
  14910. 1346.62 s [vector] concatMap: OK
  14911. 1346.62 s [vector] +++ OK, passed 100 tests.
  14912. 1346.62 s [vector] mapM: OK
  14913. 1346.62 s [vector] +++ OK, passed 100 tests.
  14914. 1346.64 s [vector] mapM_: OK
  14915. 1346.64 s [vector] +++ OK, passed 100 tests.
  14916. 1346.64 s [vector] forM: OK
  14917. 1346.64 s [vector] +++ OK, passed 100 tests.
  14918. 1346.66 s [vector] forM_: OK (0.01s)
  14919. 1346.66 s [vector] +++ OK, passed 100 tests.
  14920. 1346.66 s [vector] imapM: OK
  14921. 1346.66 s [vector] +++ OK, passed 100 tests.
  14922. 1346.67 s [vector] imapM_: OK (0.01s)
  14923. 1346.67 s [vector] +++ OK, passed 100 tests.
  14924. 1346.68 s [vector] zipWith: OK
  14925. 1346.68 s [vector] +++ OK, passed 100 tests.
  14926. 1346.68 s [vector] zipWith3: OK
  14927. 1346.68 s [vector] +++ OK, passed 100 tests.
  14928. 1346.68 s [vector] izipWith: OK
  14929. 1346.68 s [vector] +++ OK, passed 100 tests.
  14930. 1346.68 s [vector] izipWith3: OK
  14931. 1346.68 s [vector] +++ OK, passed 100 tests.
  14932. 1346.68 s [vector] izipWithM: OK
  14933. 1346.68 s [vector] +++ OK, passed 100 tests.
  14934. 1346.70 s [vector] izipWithM_: OK (0.01s)
  14935. 1346.70 s [vector] +++ OK, passed 100 tests.
  14936. 1346.70 s [vector] zipWithM: OK
  14937. 1346.70 s [vector] +++ OK, passed 100 tests.
  14938. 1346.71 s [vector] zipWithM_: OK (0.01s)
  14939. 1346.71 s [vector] +++ OK, passed 100 tests.
  14940. 1346.71 s [vector] filter: OK
  14941. 1346.71 s [vector] +++ OK, passed 100 tests.
  14942. 1346.71 s [vector] ifilter: OK
  14943. 1346.71 s [vector] +++ OK, passed 100 tests.
  14944. 1346.73 s [vector] filterM: OK
  14945. 1346.73 s [vector] +++ OK, passed 100 tests.
  14946. 1346.73 s [vector] uniq: OK
  14947. 1346.73 s [vector] +++ OK, passed 100 tests.
  14948. 1346.73 s [vector] mapMaybe: OK
  14949. 1346.73 s [vector] +++ OK, passed 100 tests.
  14950. 1346.73 s [vector] imapMaybe: OK
  14951. 1346.73 s [vector] +++ OK, passed 100 tests.
  14952. 1346.73 s [vector] takeWhile: OK
  14953. 1346.73 s [vector] +++ OK, passed 100 tests.
  14954. 1346.74 s [vector] dropWhile: OK
  14955. 1346.74 s [vector] +++ OK, passed 100 tests.
  14956. 1346.74 s [vector] partition: OK
  14957. 1346.74 s [vector] +++ OK, passed 100 tests.
  14958. 1346.74 s [vector] partitionWith: OK
  14959. 1346.74 s [vector] +++ OK, passed 100 tests.
  14960. 1346.74 s [vector] span: OK
  14961. 1346.74 s [vector] +++ OK, passed 100 tests.
  14962. 1346.75 s [vector] break: OK
  14963. 1346.75 s [vector] +++ OK, passed 100 tests.
  14964. 1346.75 s [vector] spanR: OK
  14965. 1346.75 s [vector] +++ OK, passed 100 tests.
  14966. 1346.75 s [vector] breakR: OK
  14967. 1346.75 s [vector] +++ OK, passed 100 tests.
  14968. 1346.75 s [vector] groupBy: OK
  14969. 1346.75 s [vector] +++ OK, passed 100 tests.
  14970. 1346.75 s [vector] elem: OK
  14971. 1346.75 s [vector] +++ OK, passed 100 tests.
  14972. 1346.75 s [vector] notElem: OK
  14973. 1346.75 s [vector] +++ OK, passed 100 tests.
  14974. 1346.76 s [vector] find: OK
  14975. 1346.76 s [vector] +++ OK, passed 100 tests.
  14976. 1346.76 s [vector] findIndex: OK
  14977. 1346.76 s [vector] +++ OK, passed 100 tests.
  14978. 1346.76 s [vector] findIndexR: OK
  14979. 1346.76 s [vector] +++ OK, passed 100 tests.
  14980. 1346.77 s [vector] findIndices: OK
  14981. 1346.77 s [vector] +++ OK, passed 100 tests.
  14982. 1346.77 s [vector] elemIndex: OK
  14983. 1346.78 s [vector] +++ OK, passed 100 tests.
  14984. 1346.78 s [vector] elemIndices: OK
  14985. 1346.78 s [vector] +++ OK, passed 100 tests.
  14986. 1346.78 s [vector] foldl: OK
  14987. 1346.78 s [vector] +++ OK, passed 100 tests.
  14988. 1346.80 s [vector] foldl1: OK
  14989. 1346.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14990. 1346.80 s [vector] foldl': OK
  14991. 1346.80 s [vector] +++ OK, passed 100 tests.
  14992. 1346.80 s [vector] foldl1': OK
  14993. 1346.80 s [vector] +++ OK, passed 100 tests; 26 discarded.
  14994. 1346.80 s [vector] foldr: OK
  14995. 1346.80 s [vector] +++ OK, passed 100 tests.
  14996. 1346.80 s [vector] foldr1: OK
  14997. 1346.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14998. 1346.80 s [vector] foldr': OK
  14999. 1346.80 s [vector] +++ OK, passed 100 tests.
  15000. 1346.80 s [vector] foldr1': OK
  15001. 1346.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15002. 1346.80 s [vector] ifoldl: OK
  15003. 1346.80 s [vector] +++ OK, passed 100 tests.
  15004. 1346.80 s [vector] ifoldl': OK
  15005. 1346.80 s [vector] +++ OK, passed 100 tests.
  15006. 1346.80 s [vector] ifoldr: OK
  15007. 1346.80 s [vector] +++ OK, passed 100 tests.
  15008. 1346.80 s [vector] ifoldr': OK
  15009. 1346.80 s [vector] +++ OK, passed 100 tests.
  15010. 1346.80 s [vector] ifoldM: OK
  15011. 1346.80 s [vector] +++ OK, passed 100 tests.
  15012. 1346.80 s [vector] ifoldM': OK
  15013. 1346.80 s [vector] +++ OK, passed 100 tests.
  15014. 1346.80 s [vector] ifoldM_: OK (0.02s)
  15015. 1346.80 s [vector] +++ OK, passed 100 tests.
  15016. 1346.81 s [vector] ifoldM'_: OK (0.01s)
  15017. 1346.81 s [vector] +++ OK, passed 100 tests.
  15018. 1346.81 s [vector] all: OK
  15019. 1346.81 s [vector] +++ OK, passed 100 tests.
  15020. 1346.81 s [vector] any: OK
  15021. 1346.82 s [vector] +++ OK, passed 100 tests.
  15022. 1346.82 s [vector] prescanl: OK
  15023. 1346.82 s [vector] +++ OK, passed 100 tests.
  15024. 1346.82 s [vector] prescanl': OK
  15025. 1346.82 s [vector] +++ OK, passed 100 tests.
  15026. 1346.82 s [vector] postscanl: OK
  15027. 1346.83 s [vector] +++ OK, passed 100 tests.
  15028. 1346.83 s [vector] postscanl': OK
  15029. 1346.83 s [vector] +++ OK, passed 100 tests.
  15030. 1346.83 s [vector] scanl: OK
  15031. 1346.83 s [vector] +++ OK, passed 100 tests.
  15032. 1346.83 s [vector] scanl': OK
  15033. 1346.83 s [vector] +++ OK, passed 100 tests.
  15034. 1346.83 s [vector] scanl1: OK
  15035. 1346.84 s [vector] +++ OK, passed 100 tests.
  15036. 1346.84 s [vector] scanl1': OK
  15037. 1346.84 s [vector] +++ OK, passed 100 tests.
  15038. 1346.85 s [vector] iscanl: OK
  15039. 1346.85 s [vector] +++ OK, passed 100 tests.
  15040. 1346.85 s [vector] iscanl': OK
  15041. 1346.85 s [vector] +++ OK, passed 100 tests.
  15042. 1346.85 s [vector] prescanr: OK
  15043. 1346.86 s [vector] +++ OK, passed 100 tests.
  15044. 1346.86 s [vector] prescanr': OK
  15045. 1346.86 s [vector] +++ OK, passed 100 tests.
  15046. 1346.86 s [vector] postscanr: OK
  15047. 1346.86 s [vector] +++ OK, passed 100 tests.
  15048. 1346.86 s [vector] postscanr': OK
  15049. 1346.86 s [vector] +++ OK, passed 100 tests.
  15050. 1346.86 s [vector] scanr: OK
  15051. 1346.86 s [vector] +++ OK, passed 100 tests.
  15052. 1346.87 s [vector] scanr': OK
  15053. 1346.87 s [vector] +++ OK, passed 100 tests.
  15054. 1346.87 s [vector] scanr1: OK
  15055. 1346.87 s [vector] +++ OK, passed 100 tests.
  15056. 1346.87 s [vector] scanr1': OK
  15057. 1346.87 s [vector] +++ OK, passed 100 tests.
  15058. 1346.88 s [vector] iscanr: OK
  15059. 1346.88 s [vector] +++ OK, passed 100 tests.
  15060. 1346.88 s [vector] iscanr': OK
  15061. 1346.88 s [vector] +++ OK, passed 100 tests.
  15062. 1346.88 s [vector] mut_read: OK
  15063. 1346.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15064. 1346.88 s [vector] mut_write: OK
  15065. 1346.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15066. 1346.88 s [vector] mut_modify: OK
  15067. 1346.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15068. 1346.88 s [vector] mut_generate: OK
  15069. 1346.88 s [vector] +++ OK, passed 100 tests.
  15070. 1346.90 s [vector] mut_generateM: OK (0.01s)
  15071. 1346.90 s [vector] +++ OK, passed 100 tests.
  15072. 1346.92 s [vector] mut_mapM_: OK (0.02s)
  15073. 1346.92 s [vector] +++ OK, passed 100 tests.
  15074. 1346.94 s [vector] mut_imapM_: OK (0.02s)
  15075. 1346.94 s [vector] +++ OK, passed 100 tests.
  15076. 1346.94 s [vector] mut_forM_: OK (0.02s)
  15077. 1346.94 s [vector] +++ OK, passed 100 tests.
  15078. 1346.95 s [vector] mut_iforM_: OK (0.02s)
  15079. 1346.95 s [vector] +++ OK, passed 100 tests.
  15080. 1346.96 s [vector] mut_foldr: OK
  15081. 1346.96 s [vector] +++ OK, passed 100 tests.
  15082. 1346.96 s [vector] mut_foldr': OK
  15083. 1346.96 s [vector] +++ OK, passed 100 tests.
  15084. 1346.96 s [vector] mut_foldl: OK
  15085. 1346.96 s [vector] +++ OK, passed 100 tests.
  15086. 1346.96 s [vector] mut_foldl': OK
  15087. 1346.96 s [vector] +++ OK, passed 100 tests.
  15088. 1346.97 s [vector] mut_ifoldr: OK
  15089. 1346.97 s [vector] +++ OK, passed 100 tests.
  15090. 1346.97 s [vector] mut_ifoldr': OK
  15091. 1346.97 s [vector] +++ OK, passed 100 tests.
  15092. 1346.97 s [vector] mut_ifoldl: OK
  15093. 1346.97 s [vector] +++ OK, passed 100 tests.
  15094. 1346.97 s [vector] mut_ifoldl': OK
  15095. 1346.97 s [vector] +++ OK, passed 100 tests.
  15096. 1346.98 s [vector] mut_foldM: OK
  15097. 1346.98 s [vector] +++ OK, passed 100 tests.
  15098. 1346.98 s [vector] mut_foldM': OK
  15099. 1346.98 s [vector] +++ OK, passed 100 tests.
  15100. 1346.98 s [vector] mut_foldrM: OK
  15101. 1346.98 s [vector] +++ OK, passed 100 tests.
  15102. 1346.98 s [vector] mut_foldrM': OK
  15103. 1346.98 s [vector] +++ OK, passed 100 tests.
  15104. 1346.98 s [vector] mut_ifoldM: OK
  15105. 1346.99 s [vector] +++ OK, passed 100 tests.
  15106. 1346.99 s [vector] mut_ifoldM': OK
  15107. 1346.99 s [vector] +++ OK, passed 100 tests.
  15108. 1346.99 s [vector] mut_ifoldrM: OK
  15109. 1346.99 s [vector] +++ OK, passed 100 tests.
  15110. 1346.99 s [vector] mut_ifoldrM': OK
  15111. 1346.99 s [vector] +++ OK, passed 100 tests.
  15112. 1346.99 s [vector] compare: OK
  15113. 1346.99 s [vector] +++ OK, passed 100 tests.
  15114. 1346.99 s [vector] maximum: OK
  15115. 1346.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15116. 1346.99 s [vector] minimum: OK
  15117. 1346.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15118. 1346.99 s [vector] minIndex: OK
  15119. 1347.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15120. 1347.00 s [vector] maxIndex: OK
  15121. 1347.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15122. 1347.00 s [vector] maximumBy: OK
  15123. 1347.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15124. 1347.00 s [vector] minimumBy: OK
  15125. 1347.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15126. 1347.00 s [vector] maximumOn: OK
  15127. 1347.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15128. 1347.00 s [vector] minimumOn: OK
  15129. 1347.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15130. 1347.00 s [vector] maxIndexBy: OK
  15131. 1347.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15132. 1347.00 s [vector] minIndexBy: OK
  15133. 1347.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15134. 1347.00 s [vector] ListFirstMaxIndexWins: OK
  15135. 1347.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15136. 1347.00 s [vector] FalseListFirstMaxIndexWins: OK
  15137. 1347.00 s [vector] +++ OK, failed as expected. (after 1 test):
  15138. 1347.00 s [vector] Exception:
  15139. 1347.00 s [vector] Prelude.foldr1: empty list
  15140. 1347.00 s [vector] CallStack (from HasCallStack):
  15141. 1347.00 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15142. 1347.00 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15143. 1347.00 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15144. 1347.00 s [vector] []
  15145. 1347.00 s [vector] zip: OK
  15146. 1347.01 s [vector] +++ OK, passed 100 tests.
  15147. 1347.01 s [vector] zip3: OK
  15148. 1347.01 s [vector] +++ OK, passed 100 tests.
  15149. 1347.01 s [vector] unzip: OK
  15150. 1347.01 s [vector] +++ OK, passed 100 tests.
  15151. 1347.01 s [vector] unzip3: OK
  15152. 1347.01 s [vector] +++ OK, passed 100 tests.
  15153. 1347.01 s [vector] indexed: OK
  15154. 1347.01 s [vector] +++ OK, passed 100 tests.
  15155. 1347.01 s [vector] update: OK
  15156. 1347.01 s [vector] +++ OK, passed 100 tests.
  15157. 1347.01 s [vector] mempty: OK
  15158. 1347.01 s [vector] +++ OK, passed 100 tests.
  15159. 1347.02 s [vector] mappend: OK
  15160. 1347.02 s [vector] +++ OK, passed 100 tests.
  15161. 1347.03 s [vector] mconcat: OK (0.02s)
  15162. 1347.03 s [vector] +++ OK, passed 100 tests.
  15163. 1347.03 s [vector] glength: OK
  15164. 1347.03 s [vector] +++ OK, passed 100 tests.
  15165. 1347.03 s [vector] sum: OK
  15166. 1347.03 s [vector] +++ OK, passed 100 tests.
  15167. 1347.03 s [vector] product: OK
  15168. 1347.03 s [vector] +++ OK, passed 100 tests.
  15169. 1347.03 s [vector] enumFromN: OK
  15170. 1347.03 s [vector] +++ OK, passed 100 tests.
  15171. 1347.03 s [vector] enumFromThenN: OK
  15172. 1347.03 s [vector] +++ OK, passed 100 tests.
  15173. 1347.04 s [vector] enumFromTo: OK
  15174. 1347.04 s [vector] +++ OK, passed 100 tests.
  15175. 1347.04 s [vector] enumFromThenTo: OK
  15176. 1347.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15177. 1347.04 s [vector] (Float)
  15178. 1347.04 s [vector] fromList.toList == id: OK
  15179. 1347.04 s [vector] +++ OK, passed 100 tests.
  15180. 1347.04 s [vector] toList.fromList == id: OK
  15181. 1347.04 s [vector] +++ OK, passed 100 tests.
  15182. 1347.04 s [vector] unstream.stream == id: OK
  15183. 1347.04 s [vector] +++ OK, passed 100 tests.
  15184. 1347.04 s [vector] stream.unstream == id: OK
  15185. 1347.04 s [vector] +++ OK, passed 100 tests.
  15186. 1347.04 s [vector] eq: OK
  15187. 1347.04 s [vector] +++ OK, passed 100 tests.
  15188. 1347.04 s [vector] length: OK
  15189. 1347.04 s [vector] +++ OK, passed 100 tests.
  15190. 1347.04 s [vector] null: OK
  15191. 1347.04 s [vector] +++ OK, passed 100 tests.
  15192. 1347.04 s [vector] index: OK
  15193. 1347.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15194. 1347.04 s [vector] safeIndex: OK
  15195. 1347.04 s [vector] +++ OK, passed 100 tests.
  15196. 1347.04 s [vector] head: OK
  15197. 1347.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15198. 1347.04 s [vector] last: OK
  15199. 1347.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15200. 1347.04 s [vector] unsafeIndex: OK
  15201. 1347.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15202. 1347.05 s [vector] unsafeHead: OK
  15203. 1347.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15204. 1347.05 s [vector] unsafeLast: OK
  15205. 1347.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15206. 1347.05 s [vector] slice: OK
  15207. 1347.05 s [vector] +++ OK, passed 100 tests.
  15208. 1347.05 s [vector] init: OK
  15209. 1347.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15210. 1347.05 s [vector] tail: OK
  15211. 1347.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15212. 1347.05 s [vector] take: OK
  15213. 1347.05 s [vector] +++ OK, passed 100 tests.
  15214. 1347.05 s [vector] drop: OK
  15215. 1347.05 s [vector] +++ OK, passed 100 tests.
  15216. 1347.05 s [vector] splitAt: OK
  15217. 1347.05 s [vector] +++ OK, passed 100 tests.
  15218. 1347.05 s [vector] empty: OK
  15219. 1347.05 s [vector] +++ OK, passed 100 tests.
  15220. 1347.05 s [vector] singleton: OK
  15221. 1347.05 s [vector] +++ OK, passed 100 tests.
  15222. 1347.05 s [vector] replicate: OK
  15223. 1347.05 s [vector] +++ OK, passed 100 tests.
  15224. 1347.05 s [vector] generate: OK
  15225. 1347.06 s [vector] +++ OK, passed 100 tests.
  15226. 1347.06 s [vector] iterateN: OK
  15227. 1347.06 s [vector] +++ OK, passed 100 tests.
  15228. 1347.06 s [vector] iterateNM: OK
  15229. 1347.06 s [vector] +++ OK, passed 100 tests.
  15230. 1347.08 s [vector] generateM: OK
  15231. 1347.09 s [vector] +++ OK, passed 100 tests.
  15232. 1347.09 s [vector] replicateM: OK
  15233. 1347.09 s [vector] +++ OK, passed 100 tests.
  15234. 1347.09 s [vector] create: OK
  15235. 1347.09 s [vector] +++ OK, passed 100 tests.
  15236. 1347.09 s [vector] createT: OK
  15237. 1347.09 s [vector] +++ OK, passed 100 tests.
  15238. 1347.09 s [vector] unfoldr: OK
  15239. 1347.09 s [vector] +++ OK, passed 100 tests.
  15240. 1347.09 s [vector] unfoldrN: OK
  15241. 1347.10 s [vector] +++ OK, passed 100 tests.
  15242. 1347.10 s [vector] unfoldrExactN: OK
  15243. 1347.10 s [vector] +++ OK, passed 100 tests.
  15244. 1347.10 s [vector] unfoldrM: OK
  15245. 1347.10 s [vector] +++ OK, passed 100 tests.
  15246. 1347.10 s [vector] unfoldrNM: OK
  15247. 1347.10 s [vector] +++ OK, passed 100 tests.
  15248. 1347.12 s [vector] unfoldrExactNM: OK
  15249. 1347.12 s [vector] +++ OK, passed 100 tests.
  15250. 1347.13 s [vector] constructN: OK
  15251. 1347.13 s [vector] +++ OK, passed 100 tests.
  15252. 1347.13 s [vector] constructrN: OK
  15253. 1347.13 s [vector] +++ OK, passed 100 tests.
  15254. 1347.13 s [vector] cons: OK
  15255. 1347.14 s [vector] +++ OK, passed 100 tests.
  15256. 1347.14 s [vector] snoc: OK
  15257. 1347.14 s [vector] +++ OK, passed 100 tests.
  15258. 1347.14 s [vector] append: OK
  15259. 1347.14 s [vector] +++ OK, passed 100 tests.
  15260. 1347.16 s [vector] concat: OK (0.02s)
  15261. 1347.16 s [vector] +++ OK, passed 100 tests.
  15262. 1347.16 s [vector] force: OK
  15263. 1347.16 s [vector] +++ OK, passed 100 tests.
  15264. 1347.17 s [vector] upd: OK
  15265. 1347.17 s [vector] +++ OK, passed 100 tests.
  15266. 1347.17 s [vector] accum: OK
  15267. 1347.17 s [vector] +++ OK, passed 100 tests.
  15268. 1347.17 s [vector] reverse: OK
  15269. 1347.17 s [vector] +++ OK, passed 100 tests.
  15270. 1347.18 s [vector] backpermute: OK
  15271. 1347.18 s [vector] +++ OK, passed 100 tests.
  15272. 1347.18 s [vector] map: OK
  15273. 1347.18 s [vector] +++ OK, passed 100 tests.
  15274. 1347.19 s [vector] imap: OK
  15275. 1347.19 s [vector] +++ OK, passed 100 tests.
  15276. 1347.19 s [vector] concatMap: OK
  15277. 1347.19 s [vector] +++ OK, passed 100 tests.
  15278. 1347.20 s [vector] mapM: OK
  15279. 1347.20 s [vector] +++ OK, passed 100 tests.
  15280. 1347.23 s [vector] mapM_: OK (0.03s)
  15281. 1347.24 s [vector] +++ OK, passed 100 tests.
  15282. 1347.24 s [vector] forM: OK
  15283. 1347.24 s [vector] +++ OK, passed 100 tests.
  15284. 1347.27 s [vector] forM_: OK (0.03s)
  15285. 1347.28 s [vector] +++ OK, passed 100 tests.
  15286. 1347.28 s [vector] imapM: OK
  15287. 1347.28 s [vector] +++ OK, passed 100 tests.
  15288. 1347.31 s [vector] imapM_: OK (0.04s)
  15289. 1347.32 s [vector] +++ OK, passed 100 tests.
  15290. 1347.33 s [vector] zipWith: OK
  15291. 1347.34 s [vector] +++ OK, passed 100 tests.
  15292. 1347.34 s [vector] zipWith3: OK
  15293. 1347.34 s [vector] +++ OK, passed 100 tests.
  15294. 1347.36 s [vector] izipWith: OK
  15295. 1347.36 s [vector] +++ OK, passed 100 tests.
  15296. 1347.36 s [vector] izipWith3: OK
  15297. 1347.36 s [vector] +++ OK, passed 100 tests.
  15298. 1347.36 s [vector] izipWithM: OK
  15299. 1347.36 s [vector] +++ OK, passed 100 tests.
  15300. 1347.37 s [vector] izipWithM_: OK (0.02s)
  15301. 1347.38 s [vector] +++ OK, passed 100 tests.
  15302. 1347.38 s [vector] zipWithM: OK
  15303. 1347.38 s [vector] +++ OK, passed 100 tests.
  15304. 1347.40 s [vector] zipWithM_: OK (0.02s)
  15305. 1347.40 s [vector] +++ OK, passed 100 tests.
  15306. 1347.40 s [vector] filter: OK
  15307. 1347.40 s [vector] +++ OK, passed 100 tests.
  15308. 1347.40 s [vector] ifilter: OK
  15309. 1347.42 s [vector] +++ OK, passed 100 tests.
  15310. 1347.44 s [vector] filterM: OK (0.04s)
  15311. 1347.45 s [vector] +++ OK, passed 100 tests.
  15312. 1347.45 s [vector] uniq: OK
  15313. 1347.45 s [vector] +++ OK, passed 100 tests.
  15314. 1347.45 s [vector] mapMaybe: OK
  15315. 1347.45 s [vector] +++ OK, passed 100 tests.
  15316. 1347.45 s [vector] imapMaybe: OK
  15317. 1347.45 s [vector] +++ OK, passed 100 tests.
  15318. 1347.45 s [vector] takeWhile: OK
  15319. 1347.46 s [vector] +++ OK, passed 100 tests.
  15320. 1347.46 s [vector] dropWhile: OK
  15321. 1347.46 s [vector] +++ OK, passed 100 tests.
  15322. 1347.46 s [vector] partition: OK
  15323. 1347.47 s [vector] +++ OK, passed 100 tests.
  15324. 1347.47 s [vector] partitionWith: OK
  15325. 1347.47 s [vector] +++ OK, passed 100 tests.
  15326. 1347.47 s [vector] span: OK
  15327. 1347.47 s [vector] +++ OK, passed 100 tests.
  15328. 1347.47 s [vector] break: OK
  15329. 1347.47 s [vector] +++ OK, passed 100 tests.
  15330. 1347.48 s [vector] spanR: OK
  15331. 1347.48 s [vector] +++ OK, passed 100 tests.
  15332. 1347.48 s [vector] breakR: OK
  15333. 1347.48 s [vector] +++ OK, passed 100 tests.
  15334. 1347.48 s [vector] groupBy: OK
  15335. 1347.48 s [vector] +++ OK, passed 100 tests.
  15336. 1347.48 s [vector] elem: OK
  15337. 1347.48 s [vector] +++ OK, passed 100 tests.
  15338. 1347.48 s [vector] notElem: OK
  15339. 1347.48 s [vector] +++ OK, passed 100 tests.
  15340. 1347.48 s [vector] find: OK
  15341. 1347.48 s [vector] +++ OK, passed 100 tests.
  15342. 1347.48 s [vector] findIndex: OK
  15343. 1347.48 s [vector] +++ OK, passed 100 tests.
  15344. 1347.49 s [vector] findIndexR: OK
  15345. 1347.49 s [vector] +++ OK, passed 100 tests.
  15346. 1347.49 s [vector] findIndices: OK
  15347. 1347.49 s [vector] +++ OK, passed 100 tests.
  15348. 1347.49 s [vector] elemIndex: OK
  15349. 1347.49 s [vector] +++ OK, passed 100 tests.
  15350. 1347.50 s [vector] elemIndices: OK
  15351. 1347.50 s [vector] +++ OK, passed 100 tests.
  15352. 1347.50 s [vector] foldl: OK
  15353. 1347.50 s [vector] +++ OK, passed 100 tests.
  15354. 1347.51 s [vector] foldl1: OK
  15355. 1347.52 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15356. 1347.52 s [vector] foldl': OK
  15357. 1347.52 s [vector] +++ OK, passed 100 tests.
  15358. 1347.52 s [vector] foldl1': OK
  15359. 1347.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15360. 1347.53 s [vector] foldr: OK
  15361. 1347.53 s [vector] +++ OK, passed 100 tests.
  15362. 1347.54 s [vector] foldr1: OK
  15363. 1347.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15364. 1347.55 s [vector] foldr': OK
  15365. 1347.56 s [vector] +++ OK, passed 100 tests.
  15366. 1347.56 s [vector] foldr1': OK
  15367. 1347.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15368. 1347.56 s [vector] ifoldl: OK
  15369. 1347.56 s [vector] +++ OK, passed 100 tests.
  15370. 1347.57 s [vector] ifoldl': OK
  15371. 1347.58 s [vector] +++ OK, passed 100 tests.
  15372. 1347.58 s [vector] ifoldr: OK
  15373. 1347.58 s [vector] +++ OK, passed 100 tests.
  15374. 1347.58 s [vector] ifoldr': OK
  15375. 1347.58 s [vector] +++ OK, passed 100 tests.
  15376. 1347.59 s [vector] ifoldM: OK
  15377. 1347.59 s [vector] +++ OK, passed 100 tests.
  15378. 1347.59 s [vector] ifoldM': OK
  15379. 1347.59 s [vector] +++ OK, passed 100 tests.
  15380. 1347.64 s [vector] ifoldM_: OK (0.03s)
  15381. 1347.64 s [vector] +++ OK, passed 100 tests.
  15382. 1347.66 s [vector] ifoldM'_: OK (0.03s)
  15383. 1347.66 s [vector] +++ OK, passed 100 tests.
  15384. 1347.66 s [vector] all: OK
  15385. 1347.66 s [vector] +++ OK, passed 100 tests.
  15386. 1347.66 s [vector] any: OK
  15387. 1347.66 s [vector] +++ OK, passed 100 tests.
  15388. 1347.66 s [vector] prescanl: OK
  15389. 1347.66 s [vector] +++ OK, passed 100 tests.
  15390. 1347.67 s [vector] prescanl': OK
  15391. 1347.67 s [vector] +++ OK, passed 100 tests.
  15392. 1347.69 s [vector] postscanl: OK
  15393. 1347.69 s [vector] +++ OK, passed 100 tests.
  15394. 1347.70 s [vector] postscanl': OK
  15395. 1347.70 s [vector] +++ OK, passed 100 tests.
  15396. 1347.70 s [vector] scanl: OK
  15397. 1347.70 s [vector] +++ OK, passed 100 tests.
  15398. 1347.71 s [vector] scanl': OK
  15399. 1347.71 s [vector] +++ OK, passed 100 tests.
  15400. 1347.72 s [vector] scanl1: OK
  15401. 1347.72 s [vector] +++ OK, passed 100 tests.
  15402. 1347.72 s [vector] scanl1': OK
  15403. 1347.72 s [vector] +++ OK, passed 100 tests.
  15404. 1347.72 s [vector] iscanl: OK
  15405. 1347.72 s [vector] +++ OK, passed 100 tests.
  15406. 1347.74 s [vector] iscanl': OK
  15407. 1347.74 s [vector] +++ OK, passed 100 tests.
  15408. 1347.74 s [vector] prescanr: OK
  15409. 1347.74 s [vector] +++ OK, passed 100 tests.
  15410. 1347.75 s [vector] prescanr': OK
  15411. 1347.75 s [vector] +++ OK, passed 100 tests.
  15412. 1347.75 s [vector] postscanr: OK
  15413. 1347.75 s [vector] +++ OK, passed 100 tests.
  15414. 1347.76 s [vector] postscanr': OK
  15415. 1347.76 s [vector] +++ OK, passed 100 tests.
  15416. 1347.77 s [vector] scanr: OK
  15417. 1347.77 s [vector] +++ OK, passed 100 tests.
  15418. 1347.77 s [vector] scanr': OK
  15419. 1347.77 s [vector] +++ OK, passed 100 tests.
  15420. 1347.79 s [vector] scanr1: OK
  15421. 1347.79 s [vector] +++ OK, passed 100 tests.
  15422. 1347.80 s [vector] scanr1': OK
  15423. 1347.81 s [vector] +++ OK, passed 100 tests.
  15424. 1347.81 s [vector] iscanr: OK
  15425. 1347.81 s [vector] +++ OK, passed 100 tests.
  15426. 1347.81 s [vector] iscanr': OK
  15427. 1347.81 s [vector] +++ OK, passed 100 tests.
  15428. 1347.81 s [vector] mut_read: OK
  15429. 1347.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15430. 1347.81 s [vector] mut_write: OK
  15431. 1347.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15432. 1347.81 s [vector] mut_modify: OK
  15433. 1347.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15434. 1347.81 s [vector] mut_generate: OK
  15435. 1347.81 s [vector] +++ OK, passed 100 tests.
  15436. 1347.82 s [vector] mut_generateM: OK
  15437. 1347.82 s [vector] +++ OK, passed 100 tests.
  15438. 1347.86 s [vector] mut_mapM_: OK (0.03s)
  15439. 1347.86 s [vector] +++ OK, passed 100 tests.
  15440. 1347.88 s [vector] mut_imapM_: OK (0.03s)
  15441. 1347.88 s [vector] +++ OK, passed 100 tests.
  15442. 1347.92 s [vector] mut_forM_: OK (0.04s)
  15443. 1347.92 s [vector] +++ OK, passed 100 tests.
  15444. 1347.95 s [vector] mut_iforM_: OK (0.03s)
  15445. 1347.95 s [vector] +++ OK, passed 100 tests.
  15446. 1347.96 s [vector] mut_foldr: OK
  15447. 1347.96 s [vector] +++ OK, passed 100 tests.
  15448. 1347.97 s [vector] mut_foldr': OK
  15449. 1347.98 s [vector] +++ OK, passed 100 tests.
  15450. 1347.98 s [vector] mut_foldl: OK (0.01s)
  15451. 1347.98 s [vector] +++ OK, passed 100 tests.
  15452. 1347.98 s [vector] mut_foldl': OK
  15453. 1347.98 s [vector] +++ OK, passed 100 tests.
  15454. 1348.00 s [vector] mut_ifoldr: OK (0.01s)
  15455. 1348.00 s [vector] +++ OK, passed 100 tests.
  15456. 1348.00 s [vector] mut_ifoldr': OK
  15457. 1348.01 s [vector] +++ OK, passed 100 tests.
  15458. 1348.01 s [vector] mut_ifoldl: OK
  15459. 1348.25 s [vector] +++ OK, passed 100 tests.
  15460. 1348.25 s [vector] mut_ifoldl': OK
  15461. 1348.25 s [vector] +++ OK, passed 100 tests.
  15462. 1348.25 s [vector] mut_foldM: OK
  15463. 1348.25 s [vector] +++ OK, passed 100 tests.
  15464. 1348.25 s [vector] mut_foldM': OK
  15465. 1348.25 s [vector] +++ OK, passed 100 tests.
  15466. 1348.25 s [vector] mut_foldrM: OK
  15467. 1348.25 s [vector] +++ OK, passed 100 tests.
  15468. 1348.25 s [vector] mut_foldrM': OK
  15469. 1348.25 s [vector] +++ OK, passed 100 tests.
  15470. 1348.25 s [vector] mut_ifoldM: OK
  15471. 1348.25 s [vector] +++ OK, passed 100 tests.
  15472. 1348.25 s [vector] mut_ifoldM': OK (0.01s)
  15473. 1348.25 s [vector] +++ OK, passed 100 tests.
  15474. 1348.25 s [vector] mut_ifoldrM: OK
  15475. 1348.25 s [vector] +++ OK, passed 100 tests.
  15476. 1348.25 s [vector] mut_ifoldrM': OK
  15477. 1348.25 s [vector] +++ OK, passed 100 tests.
  15478. 1348.25 s [vector] compare: OK
  15479. 1348.25 s [vector] +++ OK, passed 100 tests.
  15480. 1348.25 s [vector] maximum: OK
  15481. 1348.25 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15482. 1348.25 s [vector] minimum: OK
  15483. 1348.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15484. 1348.25 s [vector] minIndex: OK
  15485. 1348.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15486. 1348.25 s [vector] maxIndex: OK
  15487. 1348.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15488. 1348.25 s [vector] maximumBy: OK
  15489. 1348.25 s [vector] +++ OK, passed 100 tests; 10 discarded.
  15490. 1348.25 s [vector] minimumBy: OK
  15491. 1348.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15492. 1348.25 s [vector] maximumOn: OK
  15493. 1348.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15494. 1348.25 s [vector] minimumOn: OK
  15495. 1348.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15496. 1348.25 s [vector] maxIndexBy: OK
  15497. 1348.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15498. 1348.25 s [vector] minIndexBy: OK
  15499. 1348.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15500. 1348.25 s [vector] ListFirstMaxIndexWins: OK
  15501. 1348.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15502. 1348.25 s [vector] FalseListFirstMaxIndexWins: OK
  15503. 1348.25 s [vector] +++ OK, failed as expected. (after 1 test):
  15504. 1348.25 s [vector] Exception:
  15505. 1348.25 s [vector] Prelude.foldr1: empty list
  15506. 1348.25 s [vector] CallStack (from HasCallStack):
  15507. 1348.25 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15508. 1348.25 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15509. 1348.25 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15510. 1348.25 s [vector] []
  15511. 1348.25 s [vector] zip: OK
  15512. 1348.25 s [vector] +++ OK, passed 100 tests.
  15513. 1348.25 s [vector] zip3: OK
  15514. 1348.25 s [vector] +++ OK, passed 100 tests.
  15515. 1348.25 s [vector] unzip: OK
  15516. 1348.25 s [vector] +++ OK, passed 100 tests.
  15517. 1348.25 s [vector] unzip3: OK
  15518. 1348.25 s [vector] +++ OK, passed 100 tests.
  15519. 1348.25 s [vector] indexed: OK
  15520. 1348.25 s [vector] +++ OK, passed 100 tests.
  15521. 1348.25 s [vector] update: OK
  15522. 1348.25 s [vector] +++ OK, passed 100 tests.
  15523. 1348.25 s [vector] mempty: OK
  15524. 1348.25 s [vector] +++ OK, passed 100 tests.
  15525. 1348.25 s [vector] mappend: OK
  15526. 1348.25 s [vector] +++ OK, passed 100 tests.
  15527. 1348.25 s [vector] mconcat: OK (0.02s)
  15528. 1348.25 s [vector] +++ OK, passed 100 tests.
  15529. 1348.25 s [vector] glength: OK
  15530. 1348.25 s [vector] +++ OK, passed 100 tests.
  15531. 1348.25 s [vector] sum: OK
  15532. 1348.25 s [vector] +++ OK, passed 100 tests.
  15533. 1348.25 s [vector] product: OK
  15534. 1348.25 s [vector] +++ OK, passed 100 tests.
  15535. 1348.25 s [vector] enumFromN: OK
  15536. 1348.25 s [vector] +++ OK, passed 100 tests.
  15537. 1348.25 s [vector] enumFromThenN: OK
  15538. 1348.25 s [vector] +++ OK, passed 100 tests.
  15539. 1348.25 s [vector] enumFromTo: OK
  15540. 1348.25 s [vector] +++ OK, passed 100 tests.
  15541. 1348.25 s [vector] enumFromThenTo: OK
  15542. 1348.25 s [vector] +++ OK, passed 100 tests; 1 discarded.
  15543. 1348.25 s [vector] (Double)
  15544. 1348.25 s [vector] fromList.toList == id: OK
  15545. 1348.25 s [vector] +++ OK, passed 100 tests.
  15546. 1348.25 s [vector] toList.fromList == id: OK
  15547. 1348.25 s [vector] +++ OK, passed 100 tests.
  15548. 1348.25 s [vector] unstream.stream == id: OK
  15549. 1348.25 s [vector] +++ OK, passed 100 tests.
  15550. 1348.25 s [vector] stream.unstream == id: OK
  15551. 1348.25 s [vector] +++ OK, passed 100 tests.
  15552. 1348.25 s [vector] eq: OK
  15553. 1348.25 s [vector] +++ OK, passed 100 tests.
  15554. 1348.25 s [vector] length: OK
  15555. 1348.25 s [vector] +++ OK, passed 100 tests.
  15556. 1348.25 s [vector] null: OK
  15557. 1348.25 s [vector] +++ OK, passed 100 tests.
  15558. 1348.25 s [vector] index: OK
  15559. 1348.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15560. 1348.25 s [vector] safeIndex: OK
  15561. 1348.25 s [vector] +++ OK, passed 100 tests.
  15562. 1348.25 s [vector] head: OK
  15563. 1348.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15564. 1348.25 s [vector] last: OK
  15565. 1348.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15566. 1348.25 s [vector] unsafeIndex: OK
  15567. 1348.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15568. 1348.25 s [vector] unsafeHead: OK
  15569. 1348.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15570. 1348.25 s [vector] unsafeLast: OK
  15571. 1348.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15572. 1348.25 s [vector] slice: OK
  15573. 1348.25 s [vector] +++ OK, passed 100 tests.
  15574. 1348.25 s [vector] init: OK
  15575. 1348.25 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15576. 1348.25 s [vector] tail: OK
  15577. 1348.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15578. 1348.25 s [vector] take: OK
  15579. 1348.25 s [vector] +++ OK, passed 100 tests.
  15580. 1348.25 s [vector] drop: OK
  15581. 1348.25 s [vector] +++ OK, passed 100 tests.
  15582. 1348.25 s [vector] splitAt: OK
  15583. 1348.25 s [vector] +++ OK, passed 100 tests.
  15584. 1348.25 s [vector] empty: OK
  15585. 1348.25 s [vector] +++ OK, passed 100 tests.
  15586. 1348.25 s [vector] singleton: OK
  15587. 1348.25 s [vector] +++ OK, passed 100 tests.
  15588. 1348.25 s [vector] replicate: OK
  15589. 1348.25 s [vector] +++ OK, passed 100 tests.
  15590. 1348.25 s [vector] generate: OK
  15591. 1348.25 s [vector] +++ OK, passed 100 tests.
  15592. 1348.25 s [vector] iterateN: OK
  15593. 1348.25 s [vector] +++ OK, passed 100 tests.
  15594. 1348.25 s [vector] iterateNM: OK (0.02s)
  15595. 1348.25 s [vector] +++ OK, passed 100 tests.
  15596. 1348.25 s [vector] generateM: OK (0.02s)
  15597. 1348.25 s [vector] +++ OK, passed 100 tests.
  15598. 1348.25 s [vector] replicateM: OK
  15599. 1348.25 s [vector] +++ OK, passed 100 tests.
  15600. 1348.25 s [vector] create: OK
  15601. 1348.25 s [vector] +++ OK, passed 100 tests.
  15602. 1348.25 s [vector] createT: OK
  15603. 1348.25 s [vector] +++ OK, passed 100 tests.
  15604. 1348.25 s [vector] unfoldr: OK
  15605. 1348.25 s [vector] +++ OK, passed 100 tests.
  15606. 1348.25 s [vector] unfoldrN: OK
  15607. 1348.25 s [vector] +++ OK, passed 100 tests.
  15608. 1348.25 s [vector] unfoldrExactN: OK
  15609. 1348.25 s [vector] +++ OK, passed 100 tests.
  15610. 1348.25 s [vector] unfoldrM: OK
  15611. 1348.25 s [vector] +++ OK, passed 100 tests.
  15612. 1348.25 s [vector] unfoldrNM: OK
  15613. 1348.25 s [vector] +++ OK, passed 100 tests.
  15614. 1348.25 s [vector] unfoldrExactNM: OK (0.01s)
  15615. 1348.25 s [vector] +++ OK, passed 100 tests.
  15616. 1348.26 s [vector] constructN: OK (0.02s)
  15617. 1348.26 s [vector] +++ OK, passed 100 tests.
  15618. 1348.26 s [vector] constructrN: OK (0.01s)
  15619. 1348.26 s [vector] +++ OK, passed 100 tests.
  15620. 1348.27 s [vector] cons: OK
  15621. 1348.27 s [vector] +++ OK, passed 100 tests.
  15622. 1348.28 s [vector] snoc: OK
  15623. 1348.28 s [vector] +++ OK, passed 100 tests.
  15624. 1348.28 s [vector] append: OK
  15625. 1348.28 s [vector] +++ OK, passed 100 tests.
  15626. 1348.29 s [vector] concat: OK (0.02s)
  15627. 1348.29 s [vector] +++ OK, passed 100 tests.
  15628. 1348.29 s [vector] force: OK
  15629. 1348.29 s [vector] +++ OK, passed 100 tests.
  15630. 1348.30 s [vector] upd: OK
  15631. 1348.30 s [vector] +++ OK, passed 100 tests.
  15632. 1348.30 s [vector] accum: OK (0.01s)
  15633. 1348.30 s [vector] +++ OK, passed 100 tests.
  15634. 1348.31 s [vector] reverse: OK
  15635. 1348.31 s [vector] +++ OK, passed 100 tests.
  15636. 1348.31 s [vector] backpermute: OK
  15637. 1348.31 s [vector] +++ OK, passed 100 tests.
  15638. 1348.32 s [vector] map: OK
  15639. 1348.32 s [vector] +++ OK, passed 100 tests.
  15640. 1348.33 s [vector] imap: OK
  15641. 1348.33 s [vector] +++ OK, passed 100 tests.
  15642. 1348.33 s [vector] concatMap: OK
  15643. 1348.34 s [vector] +++ OK, passed 100 tests.
  15644. 1348.34 s [vector] mapM: OK
  15645. 1348.34 s [vector] +++ OK, passed 100 tests.
  15646. 1348.38 s [vector] mapM_: OK (0.04s)
  15647. 1348.38 s [vector] +++ OK, passed 100 tests.
  15648. 1348.38 s [vector] forM: OK
  15649. 1348.38 s [vector] +++ OK, passed 100 tests.
  15650. 1348.42 s [vector] forM_: OK (0.04s)
  15651. 1348.42 s [vector] +++ OK, passed 100 tests.
  15652. 1348.42 s [vector] imapM: OK
  15653. 1348.44 s [vector] +++ OK, passed 100 tests.
  15654. 1348.46 s [vector] imapM_: OK (0.04s)
  15655. 1348.46 s [vector] +++ OK, passed 100 tests.
  15656. 1348.47 s [vector] zipWith: OK
  15657. 1348.48 s [vector] +++ OK, passed 100 tests.
  15658. 1348.48 s [vector] zipWith3: OK
  15659. 1348.48 s [vector] +++ OK, passed 100 tests.
  15660. 1348.49 s [vector] izipWith: OK
  15661. 1348.50 s [vector] +++ OK, passed 100 tests.
  15662. 1348.50 s [vector] izipWith3: OK
  15663. 1348.50 s [vector] +++ OK, passed 100 tests.
  15664. 1348.50 s [vector] izipWithM: OK
  15665. 1348.50 s [vector] +++ OK, passed 100 tests.
  15666. 1348.54 s [vector] izipWithM_: OK (0.03s)
  15667. 1348.54 s [vector] +++ OK, passed 100 tests.
  15668. 1348.56 s [vector] zipWithM: OK
  15669. 1348.56 s [vector] +++ OK, passed 100 tests.
  15670. 1348.57 s [vector] zipWithM_: OK (0.02s)
  15671. 1348.58 s [vector] +++ OK, passed 100 tests.
  15672. 1348.58 s [vector] filter: OK
  15673. 1348.58 s [vector] +++ OK, passed 100 tests.
  15674. 1348.58 s [vector] ifilter: OK
  15675. 1348.58 s [vector] +++ OK, passed 100 tests.
  15676. 1348.62 s [vector] filterM: OK (0.04s)
  15677. 1348.62 s [vector] +++ OK, passed 100 tests.
  15678. 1348.62 s [vector] uniq: OK
  15679. 1348.62 s [vector] +++ OK, passed 100 tests.
  15680. 1348.62 s [vector] mapMaybe: OK
  15681. 1348.62 s [vector] +++ OK, passed 100 tests.
  15682. 1348.63 s [vector] imapMaybe: OK
  15683. 1348.63 s [vector] +++ OK, passed 100 tests.
  15684. 1348.63 s [vector] takeWhile: OK
  15685. 1348.63 s [vector] +++ OK, passed 100 tests.
  15686. 1348.64 s [vector] dropWhile: OK
  15687. 1348.64 s [vector] +++ OK, passed 100 tests.
  15688. 1348.64 s [vector] partition: OK
  15689. 1348.64 s [vector] +++ OK, passed 100 tests.
  15690. 1348.65 s [vector] partitionWith: OK
  15691. 1348.65 s [vector] +++ OK, passed 100 tests.
  15692. 1348.65 s [vector] span: OK
  15693. 1348.65 s [vector] +++ OK, passed 100 tests.
  15694. 1348.65 s [vector] break: OK
  15695. 1348.65 s [vector] +++ OK, passed 100 tests.
  15696. 1348.65 s [vector] spanR: OK
  15697. 1348.65 s [vector] +++ OK, passed 100 tests.
  15698. 1348.65 s [vector] breakR: OK
  15699. 1348.66 s [vector] +++ OK, passed 100 tests.
  15700. 1348.66 s [vector] groupBy: OK
  15701. 1348.66 s [vector] +++ OK, passed 100 tests.
  15702. 1348.66 s [vector] elem: OK
  15703. 1348.66 s [vector] +++ OK, passed 100 tests.
  15704. 1348.66 s [vector] notElem: OK
  15705. 1348.66 s [vector] +++ OK, passed 100 tests.
  15706. 1348.67 s [vector] find: OK
  15707. 1348.67 s [vector] +++ OK, passed 100 tests.
  15708. 1348.67 s [vector] findIndex: OK
  15709. 1348.67 s [vector] +++ OK, passed 100 tests.
  15710. 1348.67 s [vector] findIndexR: OK
  15711. 1348.67 s [vector] +++ OK, passed 100 tests.
  15712. 1348.68 s [vector] findIndices: OK
  15713. 1348.68 s [vector] +++ OK, passed 100 tests.
  15714. 1348.68 s [vector] elemIndex: OK
  15715. 1348.68 s [vector] +++ OK, passed 100 tests.
  15716. 1348.68 s [vector] elemIndices: OK
  15717. 1348.68 s [vector] +++ OK, passed 100 tests.
  15718. 1348.70 s [vector] foldl: OK (0.01s)
  15719. 1348.70 s [vector] +++ OK, passed 100 tests.
  15720. 1348.71 s [vector] foldl1: OK (0.01s)
  15721. 1348.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15722. 1348.72 s [vector] foldl': OK (0.01s)
  15723. 1348.72 s [vector] +++ OK, passed 100 tests.
  15724. 1348.74 s [vector] foldl1': OK (0.01s)
  15725. 1348.74 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15726. 1348.74 s [vector] foldr: OK (0.01s)
  15727. 1348.74 s [vector] +++ OK, passed 100 tests.
  15728. 1348.75 s [vector] foldr1: OK (0.01s)
  15729. 1348.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15730. 1348.76 s [vector] foldr': OK
  15731. 1348.76 s [vector] +++ OK, passed 100 tests.
  15732. 1348.78 s [vector] foldr1': OK (0.01s)
  15733. 1348.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15734. 1348.80 s [vector] ifoldl: OK (0.02s)
  15735. 1348.80 s [vector] +++ OK, passed 100 tests.
  15736. 1348.82 s [vector] ifoldl': OK (0.02s)
  15737. 1348.82 s [vector] +++ OK, passed 100 tests.
  15738. 1348.82 s [vector] ifoldr: OK (0.01s)
  15739. 1348.82 s [vector] +++ OK, passed 100 tests.
  15740. 1348.84 s [vector] ifoldr': OK
  15741. 1348.84 s [vector] +++ OK, passed 100 tests.
  15742. 1348.86 s [vector] ifoldM: OK (0.02s)
  15743. 1348.86 s [vector] +++ OK, passed 100 tests.
  15744. 1348.88 s [vector] ifoldM': OK (0.01s)
  15745. 1348.88 s [vector] +++ OK, passed 100 tests.
  15746. 1348.92 s [vector] ifoldM_: OK (0.04s)
  15747. 1348.92 s [vector] +++ OK, passed 100 tests.
  15748. 1348.94 s [vector] ifoldM'_: OK (0.04s)
  15749. 1348.94 s [vector] +++ OK, passed 100 tests.
  15750. 1348.94 s [vector] all: OK
  15751. 1348.94 s [vector] +++ OK, passed 100 tests.
  15752. 1348.94 s [vector] any: OK
  15753. 1348.94 s [vector] +++ OK, passed 100 tests.
  15754. 1348.96 s [vector] prescanl: OK (0.01s)
  15755. 1348.96 s [vector] +++ OK, passed 100 tests.
  15756. 1348.98 s [vector] prescanl': OK (0.01s)
  15757. 1348.98 s [vector] +++ OK, passed 100 tests.
  15758. 1348.98 s [vector] postscanl: OK (0.01s)
  15759. 1348.98 s [vector] +++ OK, passed 100 tests.
  15760. 1348.99 s [vector] postscanl': OK (0.01s)
  15761. 1348.99 s [vector] +++ OK, passed 100 tests.
  15762. 1348.99 s [haskell-language-server] [8 of 8] Compiling Ide.Plugin.SemanticTokens ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.o, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.dyn_o )
  15763. 1349.01 s [vector] scanl: OK
  15764. 1349.01 s [vector] +++ OK, passed 100 tests.
  15765. 1349.02 s [vector] scanl': OK (0.01s)
  15766. 1349.02 s [vector] +++ OK, passed 100 tests.
  15767. 1349.04 s [vector] scanl1: OK (0.01s)
  15768. 1349.04 s [vector] +++ OK, passed 100 tests.
  15769. 1349.05 s [vector] scanl1': OK (0.01s)
  15770. 1349.05 s [vector] +++ OK, passed 100 tests.
  15771. 1349.06 s [vector] iscanl: OK
  15772. 1349.06 s [vector] +++ OK, passed 100 tests.
  15773. 1349.08 s [vector] iscanl': OK (0.01s)
  15774. 1349.08 s [vector] +++ OK, passed 100 tests.
  15775. 1349.08 s [vector] prescanr: OK (0.01s)
  15776. 1349.08 s [vector] +++ OK, passed 100 tests.
  15777. 1349.10 s [vector] prescanr': OK
  15778. 1349.10 s [vector] +++ OK, passed 100 tests.
  15779. 1349.12 s [vector] postscanr: OK (0.01s)
  15780. 1349.12 s [vector] +++ OK, passed 100 tests.
  15781. 1349.12 s [vector] postscanr': OK (0.01s)
  15782. 1349.12 s [vector] +++ OK, passed 100 tests.
  15783. 1349.13 s [vector] scanr: OK
  15784. 1349.13 s [vector] +++ OK, passed 100 tests.
  15785. 1349.16 s [vector] scanr': OK (0.01s)
  15786. 1349.16 s [vector] +++ OK, passed 100 tests.
  15787. 1349.17 s [vector] scanr1: OK (0.01s)
  15788. 1349.17 s [vector] +++ OK, passed 100 tests.
  15789. 1349.18 s [vector] scanr1': OK (0.01s)
  15790. 1349.18 s [vector] +++ OK, passed 100 tests.
  15791. 1349.20 s [vector] iscanr: OK (0.01s)
  15792. 1349.20 s [vector] +++ OK, passed 100 tests.
  15793. 1349.20 s [vector] iscanr': OK (0.02s)
  15794. 1349.20 s [vector] +++ OK, passed 100 tests.
  15795. 1349.20 s [vector] mut_read: OK
  15796. 1349.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15797. 1349.21 s [vector] mut_write: OK
  15798. 1349.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15799. 1349.22 s [vector] mut_modify: OK
  15800. 1349.22 s [vector] +++ OK, passed 100 tests; 25 discarded.
  15801. 1349.22 s [vector] mut_generate: OK
  15802. 1349.22 s [vector] +++ OK, passed 100 tests.
  15803. 1349.24 s [vector] mut_generateM: OK (0.02s)
  15804. 1349.24 s [vector] +++ OK, passed 100 tests.
  15805. 1349.25 s [vector] mut_mapM_: OK (0.03s)
  15806. 1349.25 s [vector] +++ OK, passed 100 tests.
  15807. 1349.30 s [vector] mut_imapM_: OK (0.03s)
  15808. 1349.30 s [vector] +++ OK, passed 100 tests.
  15809. 1349.34 s [vector] mut_forM_: OK (0.04s)
  15810. 1349.34 s [vector] +++ OK, passed 100 tests.
  15811. 1349.38 s [vector] mut_iforM_: OK (0.04s)
  15812. 1349.38 s [vector] +++ OK, passed 100 tests.
  15813. 1349.38 s [vector] mut_foldr: OK (0.01s)
  15814. 1349.38 s [vector] +++ OK, passed 100 tests.
  15815. 1349.40 s [vector] mut_foldr': OK (0.01s)
  15816. 1349.40 s [vector] +++ OK, passed 100 tests.
  15817. 1349.40 s [vector] mut_foldl: OK
  15818. 1349.40 s [vector] +++ OK, passed 100 tests.
  15819. 1349.42 s [vector] mut_foldl': OK (0.01s)
  15820. 1349.42 s [haskell-language-server]
  15821. 1349.42 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  15822. 1349.42 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  15823. 1349.42 s [haskell-language-server] but were not needed for compilation:
  15824. 1349.42 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy)
  15825. 1349.42 s [vector] +++ OK, passed 100 tests.
  15826. 1349.43 s [vector] mut_ifoldr: OK (0.01s)
  15827. 1349.44 s [haskell-language-server] [1 of 8] Compiling Ide.Plugin.SemanticTokens.Types ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Types.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Types.p_o )
  15828. 1349.44 s [vector] +++ OK, passed 100 tests.
  15829. 1349.44 s [vector] mut_ifoldr': OK (0.01s)
  15830. 1349.45 s [vector] +++ OK, passed 100 tests.
  15831. 1349.46 s [vector] mut_ifoldl: OK (0.01s)
  15832. 1349.46 s [vector] +++ OK, passed 100 tests.
  15833. 1349.46 s [vector] mut_ifoldl': OK (0.01s)
  15834. 1349.46 s [vector] +++ OK, passed 100 tests.
  15835. 1349.48 s [vector] mut_foldM: OK (0.01s)
  15836. 1349.48 s [vector] +++ OK, passed 100 tests.
  15837. 1349.48 s [vector] mut_foldM': OK (0.01s)
  15838. 1349.48 s [vector] +++ OK, passed 100 tests.
  15839. 1349.50 s [vector] mut_foldrM: OK
  15840. 1349.50 s [vector] +++ OK, passed 100 tests.
  15841. 1349.50 s [vector] mut_foldrM': OK (0.01s)
  15842. 1349.51 s [vector] +++ OK, passed 100 tests.
  15843. 1349.52 s [vector] mut_ifoldM: OK (0.01s)
  15844. 1349.52 s [vector] +++ OK, passed 100 tests.
  15845. 1349.54 s [vector] mut_ifoldM': OK (0.01s)
  15846. 1349.54 s [vector] +++ OK, passed 100 tests.
  15847. 1349.54 s [vector] mut_ifoldrM: OK (0.01s)
  15848. 1349.54 s [vector] +++ OK, passed 100 tests.
  15849. 1349.55 s [vector] mut_ifoldrM': OK (0.01s)
  15850. 1349.55 s [vector] +++ OK, passed 100 tests.
  15851. 1349.55 s [vector] compare: OK
  15852. 1349.55 s [vector] +++ OK, passed 100 tests.
  15853. 1349.55 s [vector] maximum: OK
  15854. 1349.55 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15855. 1349.56 s [vector] minimum: OK
  15856. 1349.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15857. 1349.56 s [vector] minIndex: OK
  15858. 1349.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15859. 1349.56 s [vector] maxIndex: OK
  15860. 1349.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15861. 1349.56 s [vector] maximumBy: OK
  15862. 1349.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15863. 1349.56 s [vector] minimumBy: OK
  15864. 1349.56 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15865. 1349.56 s [vector] maximumOn: OK
  15866. 1349.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15867. 1349.56 s [vector] minimumOn: OK
  15868. 1349.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15869. 1349.56 s [vector] maxIndexBy: OK
  15870. 1349.56 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15871. 1349.56 s [vector] minIndexBy: OK
  15872. 1349.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15873. 1349.56 s [vector] ListFirstMaxIndexWins: OK
  15874. 1349.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15875. 1349.56 s [vector] FalseListFirstMaxIndexWins: OK
  15876. 1349.57 s [vector] +++ OK, failed as expected. (after 1 test):
  15877. 1349.57 s [vector] Exception:
  15878. 1349.57 s [vector] Prelude.foldr1: empty list
  15879. 1349.57 s [vector] CallStack (from HasCallStack):
  15880. 1349.57 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15881. 1349.57 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15882. 1349.57 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15883. 1349.57 s [vector] []
  15884. 1349.57 s [vector] zip: OK
  15885. 1349.57 s [vector] +++ OK, passed 100 tests.
  15886. 1349.57 s [vector] zip3: OK
  15887. 1349.57 s [vector] +++ OK, passed 100 tests.
  15888. 1349.57 s [vector] unzip: OK
  15889. 1349.57 s [vector] +++ OK, passed 100 tests.
  15890. 1349.57 s [vector] unzip3: OK
  15891. 1349.57 s [vector] +++ OK, passed 100 tests.
  15892. 1349.57 s [vector] indexed: OK
  15893. 1349.57 s [vector] +++ OK, passed 100 tests.
  15894. 1349.57 s [vector] update: OK
  15895. 1349.57 s [vector] +++ OK, passed 100 tests.
  15896. 1349.57 s [vector] mempty: OK
  15897. 1349.58 s [vector] +++ OK, passed 100 tests.
  15898. 1349.58 s [vector] mappend: OK
  15899. 1349.58 s [vector] +++ OK, passed 100 tests.
  15900. 1349.60 s [vector] mconcat: OK (0.02s)
  15901. 1349.60 s [vector] +++ OK, passed 100 tests.
  15902. 1349.60 s [vector] glength: OK
  15903. 1349.60 s [vector] +++ OK, passed 100 tests.
  15904. 1349.60 s [vector] sum: OK
  15905. 1349.60 s [vector] +++ OK, passed 100 tests.
  15906. 1349.60 s [vector] product: OK
  15907. 1349.60 s [vector] +++ OK, passed 100 tests.
  15908. 1349.60 s [vector] enumFromN: OK
  15909. 1349.60 s [vector] +++ OK, passed 100 tests.
  15910. 1349.60 s [vector] enumFromThenN: OK
  15911. 1349.60 s [vector] +++ OK, passed 100 tests.
  15912. 1349.60 s [vector] enumFromTo: OK
  15913. 1349.60 s [vector] +++ OK, passed 100 tests.
  15914. 1349.60 s [vector] enumFromThenTo: OK
  15915. 1349.60 s [vector] +++ OK, passed 100 tests; 5 discarded.
  15916. 1349.60 s [vector] (Int,Bool)
  15917. 1349.60 s [vector] fromList.toList == id: OK
  15918. 1349.60 s [vector] +++ OK, passed 100 tests.
  15919. 1349.60 s [vector] toList.fromList == id: OK
  15920. 1349.60 s [vector] +++ OK, passed 100 tests.
  15921. 1349.60 s [vector] unstream.stream == id: OK
  15922. 1349.60 s [vector] +++ OK, passed 100 tests.
  15923. 1349.60 s [vector] stream.unstream == id: OK
  15924. 1349.60 s [vector] +++ OK, passed 100 tests.
  15925. 1349.61 s [vector] eq: OK
  15926. 1349.61 s [vector] +++ OK, passed 100 tests.
  15927. 1349.61 s [vector] length: OK
  15928. 1349.61 s [vector] +++ OK, passed 100 tests.
  15929. 1349.61 s [vector] null: OK
  15930. 1349.61 s [vector] +++ OK, passed 100 tests.
  15931. 1349.61 s [vector] index: OK
  15932. 1349.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15933. 1349.61 s [vector] safeIndex: OK
  15934. 1349.61 s [vector] +++ OK, passed 100 tests.
  15935. 1349.61 s [vector] head: OK
  15936. 1349.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15937. 1349.61 s [vector] last: OK
  15938. 1349.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15939. 1349.61 s [vector] unsafeIndex: OK
  15940. 1349.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15941. 1349.61 s [vector] unsafeHead: OK
  15942. 1349.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15943. 1349.61 s [vector] unsafeLast: OK
  15944. 1349.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15945. 1349.61 s [vector] slice: OK
  15946. 1349.61 s [vector] +++ OK, passed 100 tests.
  15947. 1349.61 s [vector] init: OK
  15948. 1349.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15949. 1349.62 s [vector] tail: OK
  15950. 1349.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15951. 1349.62 s [vector] take: OK
  15952. 1349.62 s [vector] +++ OK, passed 100 tests.
  15953. 1349.62 s [vector] drop: OK
  15954. 1349.62 s [vector] +++ OK, passed 100 tests.
  15955. 1349.62 s [vector] splitAt: OK
  15956. 1349.62 s [vector] +++ OK, passed 100 tests.
  15957. 1349.62 s [vector] empty: OK
  15958. 1349.62 s [vector] +++ OK, passed 100 tests.
  15959. 1349.62 s [vector] singleton: OK
  15960. 1349.62 s [vector] +++ OK, passed 100 tests.
  15961. 1349.62 s [vector] replicate: OK
  15962. 1349.62 s [vector] +++ OK, passed 100 tests.
  15963. 1349.62 s [vector] generate: OK
  15964. 1349.62 s [vector] +++ OK, passed 100 tests.
  15965. 1349.64 s [vector] iterateN: OK
  15966. 1349.64 s [vector] +++ OK, passed 100 tests.
  15967. 1349.64 s [vector] iterateNM: OK (0.01s)
  15968. 1349.64 s [vector] +++ OK, passed 100 tests.
  15969. 1349.67 s [vector] generateM: OK (0.03s)
  15970. 1349.67 s [vector] +++ OK, passed 100 tests.
  15971. 1349.67 s [vector] replicateM: OK
  15972. 1349.67 s [vector] +++ OK, passed 100 tests.
  15973. 1349.67 s [vector] create: OK
  15974. 1349.67 s [vector] +++ OK, passed 100 tests.
  15975. 1349.67 s [vector] createT: OK
  15976. 1349.68 s [vector] +++ OK, passed 100 tests.
  15977. 1349.68 s [vector] unfoldr: OK
  15978. 1349.68 s [vector] +++ OK, passed 100 tests.
  15979. 1349.68 s [vector] unfoldrN: OK
  15980. 1349.68 s [vector] +++ OK, passed 100 tests.
  15981. 1349.68 s [vector] unfoldrExactN: OK
  15982. 1349.68 s [vector] +++ OK, passed 100 tests.
  15983. 1349.68 s [vector] unfoldrM: OK
  15984. 1349.68 s [vector] +++ OK, passed 100 tests.
  15985. 1349.69 s [vector] unfoldrNM: OK
  15986. 1349.69 s [vector] +++ OK, passed 100 tests.
  15987. 1349.70 s [vector] unfoldrExactNM: OK (0.01s)
  15988. 1349.70 s [vector] +++ OK, passed 100 tests.
  15989. 1349.71 s [vector] constructN: OK
  15990. 1349.71 s [vector] +++ OK, passed 100 tests.
  15991. 1349.71 s [vector] constructrN: OK
  15992. 1349.71 s [vector] +++ OK, passed 100 tests.
  15993. 1349.71 s [vector] cons: OK
  15994. 1349.71 s [vector] +++ OK, passed 100 tests.
  15995. 1349.71 s [vector] snoc: OK
  15996. 1349.71 s [vector] +++ OK, passed 100 tests.
  15997. 1349.71 s [vector] append: OK
  15998. 1349.72 s [vector] +++ OK, passed 100 tests.
  15999. 1349.74 s [vector] concat: OK (0.03s)
  16000. 1349.75 s [vector] +++ OK, passed 100 tests.
  16001. 1349.75 s [vector] force: OK
  16002. 1349.75 s [vector] +++ OK, passed 100 tests.
  16003. 1349.76 s [vector] upd: OK
  16004. 1349.76 s [vector] +++ OK, passed 100 tests.
  16005. 1349.76 s [vector] accum: OK (0.01s)
  16006. 1349.76 s [vector] +++ OK, passed 100 tests.
  16007. 1349.77 s [vector] reverse: OK
  16008. 1349.77 s [vector] +++ OK, passed 100 tests.
  16009. 1349.77 s [vector] backpermute: OK
  16010. 1349.77 s [vector] +++ OK, passed 100 tests.
  16011. 1349.77 s [vector] map: OK
  16012. 1349.77 s [vector] +++ OK, passed 100 tests.
  16013. 1349.77 s [vector] imap: OK
  16014. 1349.77 s [vector] +++ OK, passed 100 tests.
  16015. 1349.78 s [vector] concatMap: OK
  16016. 1349.78 s [vector] +++ OK, passed 100 tests.
  16017. 1349.78 s [vector] mapM: OK
  16018. 1349.78 s [vector] +++ OK, passed 100 tests.
  16019. 1349.81 s [vector] mapM_: OK
  16020. 1349.82 s [vector] +++ OK, passed 100 tests.
  16021. 1349.82 s [vector] forM: OK
  16022. 1349.82 s [vector] +++ OK, passed 100 tests.
  16023. 1349.84 s [vector] forM_: OK (0.03s)
  16024. 1349.84 s [vector] +++ OK, passed 100 tests.
  16025. 1349.84 s [vector] imapM: OK
  16026. 1349.84 s [vector] +++ OK, passed 100 tests.
  16027. 1349.87 s [vector] imapM_: OK (0.03s)
  16028. 1349.88 s [vector] +++ OK, passed 100 tests.
  16029. 1349.88 s [vector] zipWith: OK
  16030. 1349.88 s [vector] +++ OK, passed 100 tests.
  16031. 1349.88 s [vector] zipWith3: OK
  16032. 1349.88 s [vector] +++ OK, passed 100 tests.
  16033. 1349.89 s [vector] izipWith: OK
  16034. 1349.89 s [vector] +++ OK, passed 100 tests.
  16035. 1349.90 s [vector] izipWith3: OK
  16036. 1349.90 s [vector] +++ OK, passed 100 tests.
  16037. 1349.90 s [vector] izipWithM: OK
  16038. 1349.90 s [vector] +++ OK, passed 100 tests.
  16039. 1349.92 s [vector] izipWithM_: OK (0.02s)
  16040. 1349.92 s [vector] +++ OK, passed 100 tests.
  16041. 1349.92 s [vector] zipWithM: OK
  16042. 1349.92 s [vector] +++ OK, passed 100 tests.
  16043. 1349.94 s [vector] zipWithM_: OK (0.02s)
  16044. 1349.94 s [vector] +++ OK, passed 100 tests.
  16045. 1349.94 s [vector] filter: OK
  16046. 1349.95 s [vector] +++ OK, passed 100 tests.
  16047. 1349.96 s [vector] ifilter: OK
  16048. 1349.96 s [vector] +++ OK, passed 100 tests.
  16049. 1350.00 s [vector] filterM: OK (0.05s)
  16050. 1350.00 s [vector] +++ OK, passed 100 tests.
  16051. 1350.00 s [vector] uniq: OK
  16052. 1350.00 s [vector] +++ OK, passed 100 tests.
  16053. 1350.00 s [vector] mapMaybe: OK
  16054. 1350.00 s [vector] +++ OK, passed 100 tests.
  16055. 1350.00 s [vector] imapMaybe: OK
  16056. 1350.01 s [vector] +++ OK, passed 100 tests.
  16057. 1350.01 s [vector] takeWhile: OK
  16058. 1350.01 s [vector] +++ OK, passed 100 tests.
  16059. 1350.01 s [vector] dropWhile: OK
  16060. 1350.01 s [vector] +++ OK, passed 100 tests.
  16061. 1350.01 s [vector] partition: OK
  16062. 1350.01 s [vector] +++ OK, passed 100 tests.
  16063. 1350.02 s [vector] partitionWith: OK
  16064. 1350.02 s [vector] +++ OK, passed 100 tests.
  16065. 1350.02 s [vector] span: OK
  16066. 1350.02 s [vector] +++ OK, passed 100 tests.
  16067. 1350.02 s [vector] break: OK
  16068. 1350.02 s [vector] +++ OK, passed 100 tests.
  16069. 1350.02 s [vector] spanR: OK
  16070. 1350.02 s [vector] +++ OK, passed 100 tests.
  16071. 1350.02 s [vector] breakR: OK
  16072. 1350.02 s [vector] +++ OK, passed 100 tests.
  16073. 1350.02 s [vector] groupBy: OK
  16074. 1350.02 s [vector] +++ OK, passed 100 tests.
  16075. 1350.03 s [vector] elem: OK
  16076. 1350.03 s [vector] +++ OK, passed 100 tests.
  16077. 1350.03 s [vector] notElem: OK
  16078. 1350.03 s [vector] +++ OK, passed 100 tests.
  16079. 1350.03 s [vector] find: OK
  16080. 1350.03 s [vector] +++ OK, passed 100 tests.
  16081. 1350.03 s [vector] findIndex: OK
  16082. 1350.03 s [vector] +++ OK, passed 100 tests.
  16083. 1350.03 s [vector] findIndexR: OK
  16084. 1350.03 s [vector] +++ OK, passed 100 tests.
  16085. 1350.03 s [vector] findIndices: OK
  16086. 1350.03 s [vector] +++ OK, passed 100 tests.
  16087. 1350.03 s [vector] elemIndex: OK
  16088. 1350.03 s [vector] +++ OK, passed 100 tests.
  16089. 1350.03 s [vector] elemIndices: OK
  16090. 1350.03 s [vector] +++ OK, passed 100 tests.
  16091. 1350.04 s [vector] foldl: OK
  16092. 1350.04 s [vector] +++ OK, passed 100 tests.
  16093. 1350.04 s [vector] foldl1: OK
  16094. 1350.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16095. 1350.05 s [vector] foldl': OK
  16096. 1350.05 s [vector] +++ OK, passed 100 tests.
  16097. 1350.05 s [vector] foldl1': OK
  16098. 1350.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16099. 1350.05 s [vector] foldr: OK
  16100. 1350.05 s [vector] +++ OK, passed 100 tests.
  16101. 1350.05 s [vector] foldr1: OK
  16102. 1350.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16103. 1350.06 s [vector] foldr': OK
  16104. 1350.06 s [vector] +++ OK, passed 100 tests.
  16105. 1350.06 s [vector] foldr1': OK
  16106. 1350.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16107. 1350.06 s [vector] ifoldl: OK
  16108. 1350.06 s [vector] +++ OK, passed 100 tests.
  16109. 1350.07 s [vector] ifoldl': OK
  16110. 1350.07 s [vector] +++ OK, passed 100 tests.
  16111. 1350.07 s [vector] ifoldr: OK
  16112. 1350.07 s [vector] +++ OK, passed 100 tests.
  16113. 1350.08 s [vector] ifoldr': OK
  16114. 1350.08 s [vector] +++ OK, passed 100 tests.
  16115. 1350.10 s [vector] ifoldM: OK
  16116. 1350.10 s [vector] +++ OK, passed 100 tests.
  16117. 1350.10 s [vector] ifoldM': OK
  16118. 1350.10 s [vector] +++ OK, passed 100 tests.
  16119. 1350.12 s [vector] ifoldM_: OK (0.02s)
  16120. 1350.12 s [vector] +++ OK, passed 100 tests.
  16121. 1350.14 s [vector] ifoldM'_: OK (0.03s)
  16122. 1350.14 s [vector] +++ OK, passed 100 tests.
  16123. 1350.14 s [vector] all: OK
  16124. 1350.14 s [vector] +++ OK, passed 100 tests.
  16125. 1350.14 s [vector] any: OK
  16126. 1350.14 s [vector] +++ OK, passed 100 tests.
  16127. 1350.15 s [vector] prescanl: OK
  16128. 1350.15 s [vector] +++ OK, passed 100 tests.
  16129. 1350.16 s [vector] prescanl': OK
  16130. 1350.16 s [vector] +++ OK, passed 100 tests.
  16131. 1350.16 s [vector] postscanl: OK
  16132. 1350.16 s [vector] +++ OK, passed 100 tests.
  16133. 1350.16 s [vector] postscanl': OK
  16134. 1350.16 s [vector] +++ OK, passed 100 tests.
  16135. 1350.16 s [vector] scanl: OK
  16136. 1350.17 s [vector] +++ OK, passed 100 tests.
  16137. 1350.17 s [vector] scanl': OK
  16138. 1350.18 s [vector] +++ OK, passed 100 tests.
  16139. 1350.18 s [vector] scanl1: OK
  16140. 1350.18 s [vector] +++ OK, passed 100 tests.
  16141. 1350.19 s [vector] scanl1': OK
  16142. 1350.19 s [vector] +++ OK, passed 100 tests.
  16143. 1350.19 s [vector] iscanl: OK
  16144. 1350.19 s [vector] +++ OK, passed 100 tests.
  16145. 1350.19 s [vector] iscanl': OK
  16146. 1350.19 s [vector] +++ OK, passed 100 tests.
  16147. 1350.20 s [vector] prescanr: OK
  16148. 1350.20 s [vector] +++ OK, passed 100 tests.
  16149. 1350.20 s [vector] prescanr': OK
  16150. 1350.20 s [vector] +++ OK, passed 100 tests.
  16151. 1350.21 s [vector] postscanr: OK
  16152. 1350.21 s [vector] +++ OK, passed 100 tests.
  16153. 1350.22 s [vector] postscanr': OK
  16154. 1350.22 s [vector] +++ OK, passed 100 tests.
  16155. 1350.22 s [vector] scanr: OK
  16156. 1350.23 s [vector] +++ OK, passed 100 tests.
  16157. 1350.23 s [vector] scanr': OK
  16158. 1350.23 s [vector] +++ OK, passed 100 tests.
  16159. 1350.23 s [vector] scanr1: OK
  16160. 1350.23 s [vector] +++ OK, passed 100 tests.
  16161. 1350.23 s [vector] scanr1': OK
  16162. 1350.23 s [vector] +++ OK, passed 100 tests.
  16163. 1350.24 s [vector] iscanr: OK
  16164. 1350.24 s [vector] +++ OK, passed 100 tests.
  16165. 1350.24 s [vector] iscanr': OK
  16166. 1350.24 s [vector] +++ OK, passed 100 tests.
  16167. 1350.24 s [vector] mut_read: OK
  16168. 1350.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16169. 1350.24 s [vector] mut_write: OK
  16170. 1350.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16171. 1350.25 s [vector] mut_modify: OK
  16172. 1350.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16173. 1350.26 s [vector] mut_generate: OK
  16174. 1350.26 s [vector] +++ OK, passed 100 tests.
  16175. 1350.28 s [vector] mut_generateM: OK (0.02s)
  16176. 1350.28 s [vector] +++ OK, passed 100 tests.
  16177. 1350.30 s [vector] mut_mapM_: OK (0.03s)
  16178. 1350.30 s [vector] +++ OK, passed 100 tests.
  16179. 1350.34 s [vector] mut_imapM_: OK (0.03s)
  16180. 1350.34 s [vector] +++ OK, passed 100 tests.
  16181. 1350.36 s [vector] mut_forM_: OK (0.03s)
  16182. 1350.36 s [vector] +++ OK, passed 100 tests.
  16183. 1350.38 s [vector] mut_iforM_: OK (0.03s)
  16184. 1350.38 s [vector] +++ OK, passed 100 tests.
  16185. 1350.38 s [vector] mut_foldr: OK
  16186. 1350.38 s [vector] +++ OK, passed 100 tests.
  16187. 1350.39 s [vector] mut_foldr': OK
  16188. 1350.39 s [vector] +++ OK, passed 100 tests.
  16189. 1350.39 s [vector] mut_foldl: OK
  16190. 1350.39 s [vector] +++ OK, passed 100 tests.
  16191. 1350.39 s [vector] mut_foldl': OK
  16192. 1350.40 s [vector] +++ OK, passed 100 tests.
  16193. 1350.40 s [vector] mut_ifoldr: OK
  16194. 1350.40 s [vector] +++ OK, passed 100 tests.
  16195. 1350.41 s [vector] mut_ifoldr': OK
  16196. 1350.41 s [vector] +++ OK, passed 100 tests.
  16197. 1350.41 s [vector] mut_ifoldl: OK
  16198. 1350.41 s [vector] +++ OK, passed 100 tests.
  16199. 1350.41 s [vector] mut_ifoldl': OK
  16200. 1350.41 s [vector] +++ OK, passed 100 tests.
  16201. 1350.42 s [vector] mut_foldM: OK
  16202. 1350.42 s [vector] +++ OK, passed 100 tests.
  16203. 1350.42 s [vector] mut_foldM': OK
  16204. 1350.42 s [vector] +++ OK, passed 100 tests.
  16205. 1350.42 s [vector] mut_foldrM: OK
  16206. 1350.42 s [vector] +++ OK, passed 100 tests.
  16207. 1350.42 s [vector] mut_foldrM': OK
  16208. 1350.43 s [vector] +++ OK, passed 100 tests.
  16209. 1350.43 s [vector] mut_ifoldM: OK
  16210. 1350.43 s [vector] +++ OK, passed 100 tests.
  16211. 1350.43 s [vector] mut_ifoldM': OK
  16212. 1350.43 s [vector] +++ OK, passed 100 tests.
  16213. 1350.43 s [vector] mut_ifoldrM: OK
  16214. 1350.44 s [vector] +++ OK, passed 100 tests.
  16215. 1350.44 s [vector] mut_ifoldrM': OK
  16216. 1350.44 s [vector] +++ OK, passed 100 tests.
  16217. 1350.44 s [vector] compare: OK
  16218. 1350.44 s [vector] +++ OK, passed 100 tests.
  16219. 1350.44 s [vector] maximum: OK
  16220. 1350.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16221. 1350.44 s [vector] minimum: OK
  16222. 1350.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16223. 1350.44 s [vector] minIndex: OK
  16224. 1350.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16225. 1350.44 s [vector] maxIndex: OK
  16226. 1350.44 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16227. 1350.44 s [vector] maximumBy: OK
  16228. 1350.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16229. 1350.45 s [vector] minimumBy: OK
  16230. 1350.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16231. 1350.45 s [vector] maximumOn: OK
  16232. 1350.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16233. 1350.45 s [vector] minimumOn: OK
  16234. 1350.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16235. 1350.45 s [vector] maxIndexBy: OK
  16236. 1350.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16237. 1350.45 s [vector] minIndexBy: OK
  16238. 1350.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16239. 1350.45 s [vector] ListFirstMaxIndexWins: OK
  16240. 1350.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16241. 1350.45 s [vector] FalseListFirstMaxIndexWins: OK
  16242. 1350.45 s [vector] +++ OK, failed as expected. (after 1 test):
  16243. 1350.45 s [vector] Exception:
  16244. 1350.45 s [vector] Prelude.foldr1: empty list
  16245. 1350.45 s [vector] CallStack (from HasCallStack):
  16246. 1350.45 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  16247. 1350.45 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  16248. 1350.45 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16249. 1350.45 s [vector] []
  16250. 1350.45 s [vector] zip: OK
  16251. 1350.46 s [vector] +++ OK, passed 100 tests.
  16252. 1350.46 s [vector] zip3: OK
  16253. 1350.46 s [vector] +++ OK, passed 100 tests.
  16254. 1350.46 s [vector] unzip: OK
  16255. 1350.46 s [vector] +++ OK, passed 100 tests.
  16256. 1350.46 s [vector] unzip3: OK
  16257. 1350.46 s [vector] +++ OK, passed 100 tests.
  16258. 1350.46 s [vector] indexed: OK
  16259. 1350.47 s [vector] +++ OK, passed 100 tests.
  16260. 1350.47 s [vector] update: OK
  16261. 1350.47 s [vector] +++ OK, passed 100 tests.
  16262. 1350.47 s [vector] mempty: OK
  16263. 1350.47 s [vector] +++ OK, passed 100 tests.
  16264. 1350.47 s [vector] mappend: OK
  16265. 1350.48 s [vector] +++ OK, passed 100 tests.
  16266. 1350.51 s [vector] mconcat: OK (0.04s)
  16267. 1350.51 s [vector] +++ OK, passed 100 tests.
  16268. 1350.51 s [vector] glength: OK
  16269. 1350.51 s [vector] +++ OK, passed 100 tests.
  16270. 1350.51 s [vector] (Int,Bool,Int)
  16271. 1350.51 s [vector] fromList.toList == id: OK
  16272. 1350.51 s [vector] +++ OK, passed 100 tests.
  16273. 1350.51 s [vector] toList.fromList == id: OK
  16274. 1350.51 s [vector] +++ OK, passed 100 tests.
  16275. 1350.51 s [vector] unstream.stream == id: OK
  16276. 1350.52 s [vector] +++ OK, passed 100 tests.
  16277. 1350.52 s [vector] stream.unstream == id: OK
  16278. 1350.52 s [vector] +++ OK, passed 100 tests.
  16279. 1350.52 s [vector] eq: OK
  16280. 1350.52 s [vector] +++ OK, passed 100 tests.
  16281. 1350.52 s [vector] length: OK
  16282. 1350.52 s [vector] +++ OK, passed 100 tests.
  16283. 1350.52 s [vector] null: OK
  16284. 1350.52 s [vector] +++ OK, passed 100 tests.
  16285. 1350.52 s [vector] index: OK
  16286. 1350.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16287. 1350.52 s [vector] safeIndex: OK
  16288. 1350.52 s [vector] +++ OK, passed 100 tests.
  16289. 1350.52 s [vector] head: OK
  16290. 1350.52 s [vector] +++ OK, passed 100 tests; 25 discarded.
  16291. 1350.52 s [vector] last: OK
  16292. 1350.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16293. 1350.53 s [vector] unsafeIndex: OK
  16294. 1350.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16295. 1350.53 s [vector] unsafeHead: OK
  16296. 1350.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16297. 1350.53 s [vector] unsafeLast: OK
  16298. 1350.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16299. 1350.53 s [vector] slice: OK
  16300. 1350.53 s [vector] +++ OK, passed 100 tests.
  16301. 1350.53 s [vector] init: OK
  16302. 1350.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16303. 1350.53 s [vector] tail: OK
  16304. 1350.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16305. 1350.53 s [vector] take: OK
  16306. 1350.54 s [vector] +++ OK, passed 100 tests.
  16307. 1350.54 s [vector] drop: OK
  16308. 1350.54 s [vector] +++ OK, passed 100 tests.
  16309. 1350.54 s [vector] splitAt: OK
  16310. 1350.54 s [vector] +++ OK, passed 100 tests.
  16311. 1350.54 s [vector] empty: OK
  16312. 1350.54 s [vector] +++ OK, passed 100 tests.
  16313. 1350.54 s [vector] singleton: OK
  16314. 1350.54 s [vector] +++ OK, passed 100 tests.
  16315. 1350.54 s [vector] replicate: OK
  16316. 1350.54 s [vector] +++ OK, passed 100 tests.
  16317. 1350.54 s [vector] generate: OK
  16318. 1350.54 s [vector] +++ OK, passed 100 tests.
  16319. 1350.56 s [vector] iterateN: OK
  16320. 1350.56 s [vector] +++ OK, passed 100 tests.
  16321. 1350.58 s [vector] iterateNM: OK (0.02s)
  16322. 1350.58 s [vector] +++ OK, passed 100 tests.
  16323. 1350.62 s [vector] generateM: OK (0.04s)
  16324. 1350.62 s [vector] +++ OK, passed 100 tests.
  16325. 1350.62 s [vector] replicateM: OK (0.01s)
  16326. 1350.62 s [vector] +++ OK, passed 100 tests.
  16327. 1350.62 s [vector] create: OK
  16328. 1350.62 s [vector] +++ OK, passed 100 tests.
  16329. 1350.62 s [vector] createT: OK
  16330. 1350.62 s [vector] +++ OK, passed 100 tests.
  16331. 1350.62 s [vector] unfoldr: OK
  16332. 1350.62 s [vector] +++ OK, passed 100 tests.
  16333. 1350.63 s [vector] unfoldrN: OK
  16334. 1350.63 s [vector] +++ OK, passed 100 tests.
  16335. 1350.63 s [vector] unfoldrExactN: OK
  16336. 1350.63 s [vector] +++ OK, passed 100 tests.
  16337. 1350.63 s [vector] unfoldrM: OK
  16338. 1350.63 s [vector] +++ OK, passed 100 tests.
  16339. 1350.63 s [vector] unfoldrNM: OK
  16340. 1350.64 s [vector] +++ OK, passed 100 tests.
  16341. 1350.65 s [vector] unfoldrExactNM: OK (0.01s)
  16342. 1350.66 s [vector] +++ OK, passed 100 tests.
  16343. 1350.66 s [vector] constructN: OK
  16344. 1350.66 s [vector] +++ OK, passed 100 tests.
  16345. 1350.66 s [vector] constructrN: OK
  16346. 1350.66 s [vector] +++ OK, passed 100 tests.
  16347. 1350.66 s [vector] cons: OK
  16348. 1350.66 s [vector] +++ OK, passed 100 tests.
  16349. 1350.66 s [vector] snoc: OK
  16350. 1350.66 s [vector] +++ OK, passed 100 tests.
  16351. 1350.67 s [vector] append: OK
  16352. 1350.68 s [vector] +++ OK, passed 100 tests.
  16353. 1350.71 s [vector] concat: OK (0.04s)
  16354. 1350.71 s [vector] +++ OK, passed 100 tests.
  16355. 1350.71 s [vector] force: OK
  16356. 1350.71 s [vector] +++ OK, passed 100 tests.
  16357. 1350.71 s [vector] upd: OK
  16358. 1350.71 s [vector] +++ OK, passed 100 tests.
  16359. 1350.72 s [vector] accum: OK
  16360. 1350.72 s [vector] +++ OK, passed 100 tests.
  16361. 1350.73 s [vector] reverse: OK
  16362. 1350.74 s [vector] +++ OK, passed 100 tests.
  16363. 1350.74 s [vector] backpermute: OK
  16364. 1350.75 s [vector] +++ OK, passed 100 tests.
  16365. 1350.76 s [vector] map: OK (0.01s)
  16366. 1350.76 s [vector] +++ OK, passed 100 tests.
  16367. 1350.76 s [vector] imap: OK
  16368. 1350.76 s [vector] +++ OK, passed 100 tests.
  16369. 1350.76 s [vector] concatMap: OK
  16370. 1350.76 s [vector] +++ OK, passed 100 tests.
  16371. 1350.76 s [vector] mapM: OK
  16372. 1350.76 s [vector] +++ OK, passed 100 tests.
  16373. 1350.79 s [vector] mapM_: OK (0.03s)
  16374. 1350.80 s [vector] +++ OK, passed 100 tests.
  16375. 1350.80 s [vector] forM: OK
  16376. 1350.80 s [vector] +++ OK, passed 100 tests.
  16377. 1350.84 s [vector] forM_: OK (0.04s)
  16378. 1350.84 s [vector] +++ OK, passed 100 tests.
  16379. 1350.84 s [vector] imapM: OK
  16380. 1350.84 s [vector] +++ OK, passed 100 tests.
  16381. 1350.88 s [vector] imapM_: OK (0.03s)
  16382. 1350.88 s [vector] +++ OK, passed 100 tests.
  16383. 1350.88 s [vector] zipWith: OK
  16384. 1350.88 s [vector] +++ OK, passed 100 tests.
  16385. 1350.89 s [vector] zipWith3: OK
  16386. 1350.90 s [vector] +++ OK, passed 100 tests.
  16387. 1350.90 s [vector] izipWith: OK
  16388. 1350.90 s [vector] +++ OK, passed 100 tests.
  16389. 1350.90 s [vector] izipWith3: OK
  16390. 1350.90 s [vector] +++ OK, passed 100 tests.
  16391. 1350.92 s [vector] izipWithM: OK
  16392. 1350.92 s [vector] +++ OK, passed 100 tests.
  16393. 1350.93 s [vector] izipWithM_: OK (0.03s)
  16394. 1350.93 s [vector] +++ OK, passed 100 tests.
  16395. 1350.94 s [vector] zipWithM: OK
  16396. 1350.94 s [vector] +++ OK, passed 100 tests.
  16397. 1350.97 s [vector] zipWithM_: OK (0.03s)
  16398. 1350.97 s [vector] +++ OK, passed 100 tests.
  16399. 1350.97 s [vector] filter: OK
  16400. 1350.97 s [vector] +++ OK, passed 100 tests.
  16401. 1350.98 s [vector] ifilter: OK
  16402. 1350.98 s [vector] +++ OK, passed 100 tests.
  16403. 1351.03 s [vector] filterM: OK (0.05s)
  16404. 1351.03 s [vector] +++ OK, passed 100 tests.
  16405. 1351.04 s [vector] uniq: OK
  16406. 1351.04 s [vector] +++ OK, passed 100 tests.
  16407. 1351.04 s [vector] mapMaybe: OK
  16408. 1351.04 s [vector] +++ OK, passed 100 tests.
  16409. 1351.05 s [vector] imapMaybe: OK
  16410. 1351.05 s [vector] +++ OK, passed 100 tests.
  16411. 1351.06 s [vector] takeWhile: OK
  16412. 1351.06 s [vector] +++ OK, passed 100 tests.
  16413. 1351.06 s [vector] dropWhile: OK
  16414. 1351.06 s [vector] +++ OK, passed 100 tests.
  16415. 1351.06 s [vector] partition: OK
  16416. 1351.06 s [vector] +++ OK, passed 100 tests.
  16417. 1351.06 s [vector] partitionWith: OK
  16418. 1351.06 s [vector] +++ OK, passed 100 tests.
  16419. 1351.06 s [vector] span: OK
  16420. 1351.06 s [vector] +++ OK, passed 100 tests.
  16421. 1351.06 s [vector] break: OK
  16422. 1351.06 s [vector] +++ OK, passed 100 tests.
  16423. 1351.06 s [vector] spanR: OK
  16424. 1351.06 s [vector] +++ OK, passed 100 tests.
  16425. 1351.07 s [vector] breakR: OK
  16426. 1351.07 s [vector] +++ OK, passed 100 tests.
  16427. 1351.07 s [vector] groupBy: OK
  16428. 1351.07 s [vector] +++ OK, passed 100 tests.
  16429. 1351.07 s [vector] elem: OK
  16430. 1351.07 s [vector] +++ OK, passed 100 tests.
  16431. 1351.07 s [vector] notElem: OK
  16432. 1351.07 s [vector] +++ OK, passed 100 tests.
  16433. 1351.07 s [vector] find: OK
  16434. 1351.07 s [vector] +++ OK, passed 100 tests.
  16435. 1351.07 s [vector] findIndex: OK
  16436. 1351.07 s [vector] +++ OK, passed 100 tests.
  16437. 1351.08 s [vector] findIndexR: OK
  16438. 1351.08 s [vector] +++ OK, passed 100 tests.
  16439. 1351.08 s [vector] findIndices: OK
  16440. 1351.09 s [vector] +++ OK, passed 100 tests.
  16441. 1351.09 s [vector] elemIndex: OK
  16442. 1351.09 s [vector] +++ OK, passed 100 tests.
  16443. 1351.09 s [vector] elemIndices: OK
  16444. 1351.09 s [vector] +++ OK, passed 100 tests.
  16445. 1351.09 s [vector] foldl: OK
  16446. 1351.09 s [vector] +++ OK, passed 100 tests.
  16447. 1351.11 s [vector] foldl1: OK
  16448. 1351.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16449. 1351.11 s [vector] foldl': OK
  16450. 1351.11 s [vector] +++ OK, passed 100 tests.
  16451. 1351.11 s [vector] foldl1': OK
  16452. 1351.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16453. 1351.12 s [vector] foldr: OK
  16454. 1351.12 s [vector] +++ OK, passed 100 tests.
  16455. 1351.13 s [vector] foldr1: OK (0.01s)
  16456. 1351.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16457. 1351.14 s [vector] foldr': OK
  16458. 1351.14 s [vector] +++ OK, passed 100 tests.
  16459. 1351.14 s [vector] foldr1': OK
  16460. 1351.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16461. 1351.16 s [vector] ifoldl: OK
  16462. 1351.16 s [vector] +++ OK, passed 100 tests.
  16463. 1351.16 s [vector] ifoldl': OK (0.01s)
  16464. 1351.16 s [vector] +++ OK, passed 100 tests.
  16465. 1351.17 s [vector] ifoldr: OK
  16466. 1351.17 s [vector] +++ OK, passed 100 tests.
  16467. 1351.18 s [vector] ifoldr': OK
  16468. 1351.18 s [vector] +++ OK, passed 100 tests.
  16469. 1351.18 s [vector] ifoldM: OK
  16470. 1351.18 s [vector] +++ OK, passed 100 tests.
  16471. 1351.19 s [vector] ifoldM': OK
  16472. 1351.19 s [vector] +++ OK, passed 100 tests.
  16473. 1351.23 s [vector] ifoldM_: OK (0.04s)
  16474. 1351.23 s [vector] +++ OK, passed 100 tests.
  16475. 1351.26 s [vector] ifoldM'_: OK (0.02s)
  16476. 1351.26 s [vector] +++ OK, passed 100 tests.
  16477. 1351.27 s [vector] all: OK
  16478. 1351.27 s [vector] +++ OK, passed 100 tests.
  16479. 1351.27 s [vector] any: OK
  16480. 1351.27 s [vector] +++ OK, passed 100 tests.
  16481. 1351.27 s [vector] prescanl: OK
  16482. 1351.27 s [vector] +++ OK, passed 100 tests.
  16483. 1351.27 s [vector] prescanl': OK
  16484. 1351.27 s [vector] +++ OK, passed 100 tests.
  16485. 1351.28 s [vector] postscanl: OK
  16486. 1351.28 s [vector] +++ OK, passed 100 tests.
  16487. 1351.29 s [vector] postscanl': OK
  16488. 1351.29 s [vector] +++ OK, passed 100 tests.
  16489. 1351.30 s [vector] scanl: OK
  16490. 1351.30 s [vector] +++ OK, passed 100 tests.
  16491. 1351.31 s [vector] scanl': OK
  16492. 1351.31 s [vector] +++ OK, passed 100 tests.
  16493. 1351.31 s [vector] scanl1: OK
  16494. 1351.31 s [vector] +++ OK, passed 100 tests.
  16495. 1351.32 s [vector] scanl1': OK
  16496. 1351.32 s [vector] +++ OK, passed 100 tests.
  16497. 1351.32 s [vector] iscanl: OK
  16498. 1351.32 s [vector] +++ OK, passed 100 tests.
  16499. 1351.33 s [vector] iscanl': OK
  16500. 1351.33 s [vector] +++ OK, passed 100 tests.
  16501. 1351.34 s [vector] prescanr: OK
  16502. 1351.34 s [vector] +++ OK, passed 100 tests.
  16503. 1351.34 s [vector] prescanr': OK
  16504. 1351.34 s [vector] +++ OK, passed 100 tests.
  16505. 1351.35 s [vector] postscanr: OK
  16506. 1351.35 s [vector] +++ OK, passed 100 tests.
  16507. 1351.36 s [vector] postscanr': OK
  16508. 1351.36 s [vector] +++ OK, passed 100 tests.
  16509. 1351.36 s [vector] scanr: OK
  16510. 1351.36 s [vector] +++ OK, passed 100 tests.
  16511. 1351.37 s [vector] scanr': OK
  16512. 1351.37 s [vector] +++ OK, passed 100 tests.
  16513. 1351.38 s [vector] scanr1: OK
  16514. 1351.38 s [vector] +++ OK, passed 100 tests.
  16515. 1351.38 s [vector] scanr1': OK
  16516. 1351.38 s [vector] +++ OK, passed 100 tests.
  16517. 1351.39 s [vector] iscanr: OK
  16518. 1351.39 s [vector] +++ OK, passed 100 tests.
  16519. 1351.39 s [vector] iscanr': OK
  16520. 1351.39 s [vector] +++ OK, passed 100 tests.
  16521. 1351.40 s [vector] mut_read: OK
  16522. 1351.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16523. 1351.40 s [vector] mut_write: OK
  16524. 1351.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16525. 1351.40 s [vector] mut_modify: OK
  16526. 1351.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16527. 1351.40 s [vector] mut_generate: OK
  16528. 1351.40 s [vector] +++ OK, passed 100 tests.
  16529. 1351.42 s [vector] mut_generateM: OK (0.02s)
  16530. 1351.42 s [vector] +++ OK, passed 100 tests.
  16531. 1351.46 s [vector] mut_mapM_: OK (0.04s)
  16532. 1351.46 s [vector] +++ OK, passed 100 tests.
  16533. 1351.49 s [haskell-language-server] [2 of 8] Compiling Ide.Plugin.SemanticTokens.Tokenize ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Tokenize.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Tokenize.p_o )
  16534. 1351.50 s [vector] mut_imapM_: OK (0.04s)
  16535. 1351.50 s [vector] +++ OK, passed 100 tests.
  16536. 1351.54 s [vector] mut_forM_: OK (0.03s)
  16537. 1351.54 s [vector] +++ OK, passed 100 tests.
  16538. 1351.57 s [vector] mut_iforM_: OK (0.04s)
  16539. 1351.58 s [vector] +++ OK, passed 100 tests.
  16540. 1351.58 s [vector] mut_foldr: OK
  16541. 1351.58 s [vector] +++ OK, passed 100 tests.
  16542. 1351.58 s [vector] mut_foldr': OK
  16543. 1351.59 s [vector] +++ OK, passed 100 tests.
  16544. 1351.60 s [vector] mut_foldl: OK
  16545. 1351.60 s [vector] +++ OK, passed 100 tests.
  16546. 1351.60 s [vector] mut_foldl': OK
  16547. 1351.60 s [vector] +++ OK, passed 100 tests.
  16548. 1351.60 s [vector] mut_ifoldr: OK
  16549. 1351.60 s [vector] +++ OK, passed 100 tests.
  16550. 1351.60 s [vector] mut_ifoldr': OK
  16551. 1351.60 s [vector] +++ OK, passed 100 tests.
  16552. 1351.62 s [vector] mut_ifoldl: OK
  16553. 1351.62 s [vector] +++ OK, passed 100 tests.
  16554. 1351.63 s [vector] mut_ifoldl': OK
  16555. 1351.63 s [vector] +++ OK, passed 100 tests.
  16556. 1351.63 s [vector] mut_foldM: OK
  16557. 1351.63 s [vector] +++ OK, passed 100 tests.
  16558. 1351.63 s [vector] mut_foldM': OK
  16559. 1351.63 s [vector] +++ OK, passed 100 tests.
  16560. 1351.64 s [vector] mut_foldrM: OK
  16561. 1351.64 s [vector] +++ OK, passed 100 tests.
  16562. 1351.65 s [vector] mut_foldrM': OK
  16563. 1351.65 s [vector] +++ OK, passed 100 tests.
  16564. 1351.65 s [vector] mut_ifoldM: OK
  16565. 1351.65 s [vector] +++ OK, passed 100 tests.
  16566. 1351.65 s [vector] mut_ifoldM': OK
  16567. 1351.65 s [vector] +++ OK, passed 100 tests.
  16568. 1351.66 s [vector] mut_ifoldrM: OK
  16569. 1351.66 s [vector] +++ OK, passed 100 tests.
  16570. 1351.66 s [vector] mut_ifoldrM': OK
  16571. 1351.66 s [vector] +++ OK, passed 100 tests.
  16572. 1351.66 s [vector] compare: OK
  16573. 1351.66 s [vector] +++ OK, passed 100 tests.
  16574. 1351.66 s [vector] maximum: OK
  16575. 1351.67 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16576. 1351.67 s [vector] minimum: OK
  16577. 1351.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16578. 1351.67 s [vector] minIndex: OK
  16579. 1351.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16580. 1351.67 s [vector] maxIndex: OK
  16581. 1351.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16582. 1351.67 s [vector] maximumBy: OK
  16583. 1351.67 s [vector] +++ OK, passed 100 tests; 22 discarded.
  16584. 1351.67 s [vector] minimumBy: OK
  16585. 1351.67 s [vector] +++ OK, passed 100 tests; 11 discarded.
  16586. 1351.67 s [vector] maximumOn: OK
  16587. 1351.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16588. 1351.67 s [vector] minimumOn: OK
  16589. 1351.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16590. 1351.68 s [vector] maxIndexBy: OK
  16591. 1351.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16592. 1351.68 s [vector] minIndexBy: OK
  16593. 1351.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16594. 1351.68 s [vector] ListFirstMaxIndexWins: OK
  16595. 1351.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16596. 1351.68 s [vector] FalseListFirstMaxIndexWins: OK
  16597. 1351.68 s [vector] +++ OK, failed as expected. (after 1 test):
  16598. 1351.68 s [vector] Exception:
  16599. 1351.68 s [vector] Prelude.foldr1: empty list
  16600. 1351.68 s [vector] CallStack (from HasCallStack):
  16601. 1351.69 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  16602. 1351.69 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  16603. 1351.69 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16604. 1351.69 s [vector] []
  16605. 1351.70 s [vector] zip: OK
  16606. 1351.70 s [vector] +++ OK, passed 100 tests.
  16607. 1351.70 s [vector] zip3: OK
  16608. 1351.70 s [vector] +++ OK, passed 100 tests.
  16609. 1351.70 s [vector] unzip: OK
  16610. 1351.70 s [vector] +++ OK, passed 100 tests.
  16611. 1351.70 s [vector] unzip3: OK
  16612. 1351.70 s [vector] +++ OK, passed 100 tests.
  16613. 1351.70 s [vector] indexed: OK
  16614. 1351.70 s [vector] +++ OK, passed 100 tests.
  16615. 1351.70 s [vector] update: OK
  16616. 1351.70 s [vector] +++ OK, passed 100 tests.
  16617. 1351.70 s [vector] mempty: OK
  16618. 1351.73 s [vector] +++ OK, passed 100 tests.
  16619. 1351.73 s [vector] mappend: OK
  16620. 1351.73 s [vector] +++ OK, passed 100 tests.
  16621. 1351.78 s [vector] mconcat: OK (0.07s)
  16622. 1351.78 s [vector] +++ OK, passed 100 tests.
  16623. 1351.78 s [vector] glength: OK
  16624. 1351.78 s [vector] +++ OK, passed 100 tests.
  16625. 1351.78 s [vector] unstream
  16626. 1351.78 s [vector] unstream == vunstream (exact): OK
  16627. 1351.78 s [vector] +++ OK, passed 100 tests.
  16628. 1351.78 s [vector] unstream == vunstream (unknown): OK
  16629. 1351.78 s [vector] +++ OK, passed 100 tests.
  16630. 1351.78 s [vector] unstreamR ~= vunstream (exact): OK
  16631. 1351.78 s [vector] +++ OK, passed 100 tests.
  16632. 1351.78 s [vector] unstreamR ~= vunstream (unknown): OK
  16633. 1351.78 s [vector] +++ OK, passed 100 tests.
  16634. 1351.78 s [vector] Data.Vector.Storable.Vector Alignment
  16635. 1351.78 s [vector] Aligned Double: OK
  16636. 1351.78 s [vector] Aligned Int: OK
  16637. 1351.78 s [vector] Regression tests
  16638. 1351.78 s [vector] enumFromTo crash #188
  16639. 1351.78 s [vector] Word8: OK
  16640. 1351.78 s [vector] Word16: OK
  16641. 1351.78 s [vector] Word32: OK
  16642. 1351.78 s [vector] Word64: OK
  16643. 1351.78 s [vector] Word: OK
  16644. 1351.78 s [vector] Int8: OK
  16645. 1351.78 s [vector] Int16: OK
  16646. 1351.78 s [vector] Int32: OK
  16647. 1351.78 s [vector] Int64: OK
  16648. 1351.78 s [vector] Int: OK
  16649. 1351.78 s [vector] Char: OK
  16650. 1351.78 s [vector] Negative tests
  16651. 1351.78 s [vector] slice out of bounds #257
  16652. 1351.78 s [vector] Boxed
  16653. 1351.78 s [vector] Negative ix: OK
  16654. 1351.78 s [vector] Negative size: OK
  16655. 1351.78 s [vector] Negative ix and size: OK
  16656. 1351.78 s [vector] Too large ix: OK
  16657. 1351.78 s [vector] Too large size: OK
  16658. 1351.78 s [vector] Too large ix and size: OK
  16659. 1351.78 s [vector] Overflow: OK
  16660. 1351.78 s [vector] OutOfMemory: OK
  16661. 1351.78 s [vector] Primitive
  16662. 1351.78 s [vector] Negative ix: OK
  16663. 1351.78 s [vector] Negative size: OK
  16664. 1351.78 s [vector] Negative ix and size: OK
  16665. 1351.78 s [vector] Too large ix: OK
  16666. 1351.78 s [vector] Too large size: OK
  16667. 1351.78 s [vector] Too large ix and size: OK
  16668. 1351.78 s [vector] Overflow: OK
  16669. 1351.78 s [vector] OutOfMemory: OK
  16670. 1351.78 s [vector] Storable
  16671. 1351.78 s [vector] Negative ix: OK
  16672. 1351.78 s [vector] Negative size: OK
  16673. 1351.78 s [vector] Negative ix and size: OK
  16674. 1351.78 s [vector] Too large ix: OK
  16675. 1351.78 s [vector] Too large size: OK
  16676. 1351.78 s [vector] Too large ix and size: OK
  16677. 1351.78 s [vector] Overflow: OK
  16678. 1351.78 s [vector] OutOfMemory: OK
  16679. 1351.78 s [vector] Unboxed
  16680. 1351.78 s [vector] Negative ix: OK
  16681. 1351.78 s [vector] Negative size: OK
  16682. 1351.78 s [vector] Negative ix and size: OK
  16683. 1351.78 s [vector] Too large ix: OK
  16684. 1351.78 s [vector] Too large size: OK
  16685. 1351.78 s [vector] Too large ix and size: OK
  16686. 1351.78 s [vector] Overflow: OK
  16687. 1351.78 s [vector] OutOfMemory: OK
  16688. 1351.78 s [vector] take #282
  16689. 1351.78 s [vector] Boxed: OK
  16690. 1351.78 s [vector] Primitive: OK
  16691. 1351.78 s [vector] Storable: OK
  16692. 1351.78 s [vector] Unboxed: OK
  16693. 1351.78 s [vector] Data.Vector
  16694. 1351.78 s [vector] MonadFix: OK
  16695. 1351.78 s [vector] toFromArray: OK
  16696. 1351.78 s [vector] toFromArraySlice: OK
  16697. 1351.78 s [vector] toFromArraySliceUnsafe: OK
  16698. 1351.78 s [vector] toFromMutableArray: OK
  16699. 1351.78 s [vector] Data.Vector.Mutable (Move): OK
  16700. 1351.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16701. 1351.78 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  16702. 1351.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16703. 1351.78 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  16704. 1351.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16705. 1351.78 s [vector] Data.Vector.Storable.Mutable (Move): OK
  16706. 1351.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16707. 1351.80 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  16708. 1351.80 s [vector] +++ OK, passed 100 tests.
  16709. 1351.80 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  16710. 1351.80 s [vector] +++ OK, passed 100 tests.
  16711. 1351.80 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  16712. 1351.80 s [vector] +++ OK, passed 100 tests.
  16713. 1351.80 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  16714. 1351.80 s [vector] +++ OK, passed 100 tests.
  16715. 1351.80 s [vector]
  16716. 1351.80 s [vector] All 2808 tests passed (12.36s)
  16717. 1351.81 s [vector] Test suite vector-tests-O2: PASS
  16718. 1351.81 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  16719. 1351.81 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  16720. 1351.83 s [vector] Phase: haddockPhase
  16721. 1351.84 s [vector] Phase: installPhase
  16722. 1351.94 s [vector] Installing library in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16723. 1352.24 s [haskell-language-server] [3 of 8] Compiling Ide.Plugin.SemanticTokens.SemanticConfig ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/SemanticConfig.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/SemanticConfig.p_o )
  16724. 1352.24 s [haskell-language-server] [4 of 8] Compiling Ide.Plugin.SemanticTokens.Utils ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Utils.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Utils.p_o )
  16725. 1352.24 s [haskell-language-server] [5 of 8] Compiling Ide.Plugin.SemanticTokens.Mappings ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Mappings.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Mappings.p_o )
  16726. 1352.24 s [haskell-language-server] [6 of 8] Compiling Ide.Plugin.SemanticTokens.Query ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Query.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Query.p_o )
  16727. 1352.41 s [haskell-language-server] [7 of 8] Compiling Ide.Plugin.SemanticTokens.Internal ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens/Internal.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens/Internal.p_o )
  16728. 1352.75 s [vector] Installing internal library benchmarks-O2 in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  16729. 1353.06 s [vector] Phase: fixupPhase
  16730. 1353.07 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16731. 1353.17 s [vector] shrinking /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSvector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2-ghc9.6.7.so
  16732. 1353.17 s [vector] shrinking /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSvector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I-ghc9.6.7.so
  16733. 1353.17 s [vector] checking for references to /build/ in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0...
  16734. 1353.17 s [vector] patching script interpreter paths in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16735. 1353.18 s [vector] stripping (with command strip and flags -S -p) in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib
  16736. 1353.94 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16737. 1354.31 s [vector:post-build] Nothing to push - all store paths are already on Cachix.
  16738. 1354.33 s [vector:post-build] Uploading to the NixCI cache: /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16739. 1354.39 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16740. 1354.41 s [vector:post-build] copying 1 paths...
  16741. 1354.41 s [vector:post-build] copying path '/nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  16742. 1369.87 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16743. 1369.95 s [vector:post-build] copying 0 paths...
  16744. 1369.97 s Progress: 17 of 34 built (1 building), 341 of 341 downloaded from cache
  16745. 1370.03 s Building /nix/store/mgqbzhznni1lmv74ccd86piizq0w3zhh-nothunks-0.3.1.drv
  16746. 1370.03 s [haskell-language-server] [8 of 8] Compiling Ide.Plugin.SemanticTokens ( plugins/hls-semantic-tokens-plugin/src/Ide/Plugin/SemanticTokens.hs, dist/build/hls-semantic-tokens-plugin/Ide/Plugin/SemanticTokens.p_o )
  16747. 1370.03 s [haskell-language-server] Preprocessing library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
  16748. 1370.03 s [haskell-language-server] Building library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0..
  16749. 1370.03 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Ormolu ( plugins/hls-ormolu-plugin/src/Ide/Plugin/Ormolu.hs, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.o, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.dyn_o )
  16750. 1370.03 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Ormolu ( plugins/hls-ormolu-plugin/src/Ide/Plugin/Ormolu.hs, dist/build/hls-ormolu-plugin/Ide/Plugin/Ormolu.p_o )
  16751. 1370.22 s [nothunks] Phase: setupCompilerEnvironmentPhase
  16752. 1370.22 s [nothunks] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  16753. 1370.44 s [nothunks] Phase: unpackPhase
  16754. 1370.45 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  16755. 1370.46 s [nothunks] source root is nothunks-0.3.1
  16756. 1370.46 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  16757. 1370.47 s [nothunks] Phase: patchPhase
  16758. 1370.47 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  16759. 1370.47 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  16760. 1370.49 s [nothunks] Phase: compileBuildDriverPhase
  16761. 1370.49 s [nothunks] setupCompileFlags: -package-db=/build/tmp.Ime7Ouv5Oq/setup-package.conf.d -threaded
  16762. 1370.55 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.Ime7Ouv5Oq/Main.o )
  16763. 1370.62 s [nothunks] [2 of 2] Linking Setup
  16764. 1372.07 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  16765. 1372.09 s [nothunks] Phase: configurePhase
  16766. 1372.14 s [nothunks] configureFlags: --verbose --prefix=/nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.Ime7Ouv5Oq/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  16767. 1372.15 s [nothunks] Using Parsec parser
  16768. 1372.15 s [nothunks] Configuring nothunks-0.3.1...
  16769. 1372.56 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  16770. 1372.56 s [nothunks] Dependency base: using base-4.18.3.0
  16771. 1372.56 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.11.5.4
  16772. 1372.56 s [nothunks] Dependency containers: using containers-0.6.7
  16773. 1372.56 s [nothunks] Dependency ghc-heap: using ghc-heap-9.6.7
  16774. 1372.56 s [nothunks] Dependency stm: using stm-2.5.1.0
  16775. 1372.56 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.0.2
  16776. 1372.56 s [nothunks] Dependency time: using time-1.12.2
  16777. 1372.56 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  16778. 1372.56 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  16779. 1372.56 s [nothunks] Dependency base: using base-4.18.3.0
  16780. 1372.56 s [nothunks] Dependency containers: using containers-0.6.7
  16781. 1372.56 s [nothunks] Dependency ghc-prim: using ghc-prim-0.10.0
  16782. 1372.56 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  16783. 1372.56 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  16784. 1372.56 s [nothunks] Dependency random: using random-1.2.1.3
  16785. 1372.56 s [nothunks] Dependency stm: using stm-2.5.1.0
  16786. 1372.56 s [nothunks] Dependency tasty: using tasty-1.5.3
  16787. 1372.56 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  16788. 1373.18 s [nothunks] Source component graph:
  16789. 1373.18 s [nothunks] component lib
  16790. 1373.18 s [nothunks] component test:nothunks-test dependency lib
  16791. 1373.18 s [nothunks] Configured component graph:
  16792. 1373.18 s [nothunks] component nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16793. 1373.18 s [nothunks] include base-4.18.3.0
  16794. 1373.18 s [nothunks] include bytestring-0.11.5.4
  16795. 1373.18 s [nothunks] include containers-0.6.7
  16796. 1373.18 s [nothunks] include ghc-heap-9.6.7
  16797. 1373.18 s [nothunks] include stm-2.5.1.0
  16798. 1373.18 s [nothunks] include text-2.0.2
  16799. 1373.18 s [nothunks] include time-1.12.2
  16800. 1373.18 s [nothunks] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16801. 1373.18 s [nothunks] include wherefrom-compat-0.1.1.1-43HQYtLkbP84BVZNd6Rc4M
  16802. 1373.18 s [nothunks] component nothunks-0.3.1-4NlKzo6jdWqI4ZYdpLBN7H-nothunks-test
  16803. 1373.18 s [nothunks] include base-4.18.3.0
  16804. 1373.18 s [nothunks] include containers-0.6.7
  16805. 1373.18 s [nothunks] include ghc-prim-0.10.0
  16806. 1373.18 s [nothunks] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  16807. 1373.18 s [nothunks] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16808. 1373.18 s [nothunks] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  16809. 1373.18 s [nothunks] include stm-2.5.1.0
  16810. 1373.18 s [nothunks] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  16811. 1373.18 s [nothunks] include tasty-hedgehog-1.4.0.2-1edJaqCm9fDJwUWc2yLVA
  16812. 1373.18 s [nothunks] Linked component graph:
  16813. 1373.18 s [nothunks] unit nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16814. 1373.18 s [nothunks] include base-4.18.3.0
  16815. 1373.18 s [nothunks] include bytestring-0.11.5.4
  16816. 1373.18 s [nothunks] include containers-0.6.7
  16817. 1373.18 s [nothunks] include ghc-heap-9.6.7
  16818. 1373.18 s [nothunks] include stm-2.5.1.0
  16819. 1373.18 s [nothunks] include text-2.0.2
  16820. 1373.18 s [nothunks] include time-1.12.2
  16821. 1373.18 s [nothunks] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16822. 1373.18 s [nothunks] include wherefrom-compat-0.1.1.1-43HQYtLkbP84BVZNd6Rc4M
  16823. 1373.18 s [nothunks] NoThunks.Class=nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf:NoThunks.Class
  16824. 1373.18 s [nothunks] unit nothunks-0.3.1-4NlKzo6jdWqI4ZYdpLBN7H-nothunks-test
  16825. 1373.18 s [nothunks] include base-4.18.3.0
  16826. 1373.18 s [nothunks] include containers-0.6.7
  16827. 1373.18 s [nothunks] include ghc-prim-0.10.0
  16828. 1373.18 s [nothunks] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  16829. 1373.18 s [nothunks] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16830. 1373.18 s [nothunks] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  16831. 1373.18 s [nothunks] include stm-2.5.1.0
  16832. 1373.18 s [nothunks] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  16833. 1373.18 s [nothunks] include tasty-hedgehog-1.4.0.2-1edJaqCm9fDJwUWc2yLVA
  16834. 1373.18 s [nothunks] Ready component graph:
  16835. 1373.19 s [nothunks] definite nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16836. 1373.19 s [nothunks] depends base-4.18.3.0
  16837. 1373.19 s [nothunks] depends bytestring-0.11.5.4
  16838. 1373.19 s [nothunks] depends containers-0.6.7
  16839. 1373.19 s [nothunks] depends ghc-heap-9.6.7
  16840. 1373.19 s [nothunks] depends stm-2.5.1.0
  16841. 1373.19 s [nothunks] depends text-2.0.2
  16842. 1373.19 s [nothunks] depends time-1.12.2
  16843. 1373.19 s [nothunks] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16844. 1373.19 s [nothunks] depends wherefrom-compat-0.1.1.1-43HQYtLkbP84BVZNd6Rc4M
  16845. 1373.19 s [nothunks] definite nothunks-0.3.1-4NlKzo6jdWqI4ZYdpLBN7H-nothunks-test
  16846. 1373.19 s [nothunks] depends base-4.18.3.0
  16847. 1373.19 s [nothunks] depends containers-0.6.7
  16848. 1373.19 s [nothunks] depends ghc-prim-0.10.0
  16849. 1373.19 s [nothunks] depends hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  16850. 1373.19 s [nothunks] depends nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16851. 1373.19 s [nothunks] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  16852. 1373.19 s [nothunks] depends stm-2.5.1.0
  16853. 1373.19 s [nothunks] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  16854. 1373.19 s [nothunks] depends tasty-hedgehog-1.4.0.2-1edJaqCm9fDJwUWc2yLVA
  16855. 1373.19 s [nothunks] Using Cabal-3.10.3.0 compiled by ghc-9.6
  16856. 1373.19 s [nothunks] Using compiler: ghc-9.6.7
  16857. 1373.19 s [nothunks] Using install prefix:
  16858. 1373.19 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1
  16859. 1373.19 s [nothunks] Executables installed in:
  16860. 1373.19 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/bin
  16861. 1373.19 s [nothunks] Libraries installed in:
  16862. 1373.19 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16863. 1373.19 s [nothunks] Dynamic Libraries installed in:
  16864. 1373.19 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  16865. 1373.19 s [nothunks] Private executables installed in:
  16866. 1373.19 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.6.7/nothunks-0.3.1
  16867. 1373.19 s [nothunks] Data files installed in:
  16868. 1373.19 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/share/x86_64-linux-ghc-9.6.7/nothunks-0.3.1
  16869. 1373.19 s [nothunks] Documentation installed in:
  16870. 1373.19 s [nothunks] /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  16871. 1373.19 s [nothunks] Configuration files installed in:
  16872. 1373.19 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/etc
  16873. 1373.19 s [nothunks] No alex found
  16874. 1373.19 s [nothunks] Using ar found on system at:
  16875. 1373.19 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16876. 1373.19 s [nothunks] No c2hs found
  16877. 1373.19 s [nothunks] No cpphs found
  16878. 1373.19 s [nothunks] No doctest found
  16879. 1373.19 s [nothunks] Using gcc version 14.3.0 given by user at:
  16880. 1373.19 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16881. 1373.19 s [nothunks] Using ghc version 9.6.7 found on system at:
  16882. 1373.19 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  16883. 1373.19 s [nothunks] Using ghc-pkg version 9.6.7 found on system at:
  16884. 1373.19 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  16885. 1373.19 s [nothunks] No ghcjs found
  16886. 1373.19 s [nothunks] No ghcjs-pkg found
  16887. 1373.19 s [nothunks] No greencard found
  16888. 1373.19 s [nothunks] Using haddock version 2.29.2 found on system at:
  16889. 1373.19 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  16890. 1373.19 s [nothunks] No happy found
  16891. 1373.19 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  16892. 1373.19 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16893. 1373.19 s [nothunks] No hmake found
  16894. 1373.19 s [nothunks] Using hpc version 0.68 found on system at:
  16895. 1373.19 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  16896. 1373.19 s [nothunks] Using hsc2hs version 0.68.9 found on system at:
  16897. 1373.19 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  16898. 1373.19 s [nothunks] Using hscolour version 1.25 found on system at:
  16899. 1373.19 s [nothunks] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  16900. 1373.19 s [nothunks] No jhc found
  16901. 1373.19 s [nothunks] Using ld found on system at:
  16902. 1373.19 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  16903. 1373.19 s [nothunks] No pkg-config found
  16904. 1373.19 s [nothunks] Using runghc version 9.6.7 found on system at:
  16905. 1373.19 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  16906. 1373.19 s [nothunks] Using strip version 2.44 found on system at:
  16907. 1373.19 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16908. 1373.19 s [nothunks] Using tar found on system at:
  16909. 1373.19 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16910. 1373.19 s [nothunks] No uhc found
  16911. 1373.45 s [nothunks] Phase: buildPhase
  16912. 1373.52 s [nothunks] Preprocessing library for nothunks-0.3.1..
  16913. 1373.52 s [nothunks] Building library for nothunks-0.3.1..
  16914. 1373.63 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  16915. 1377.39 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  16916. 1378.14 s [haskell-language-server] Preprocessing library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
  16917. 1378.14 s [haskell-language-server] Building library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0..
  16918. 1378.41 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFields ( plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.o, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.dyn_o )
  16919. 1382.20 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  16920. 1382.20 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
  16921. 1382.36 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 )
  16922. 1384.11 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFields ( plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs, dist/build/hls-explicit-record-fields-plugin/Ide/Plugin/ExplicitFields.p_o )
  16923. 1385.63 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  16924. 1386.30 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  16925. 1387.82 s [nothunks] Phase: checkPhase
  16926. 1387.90 s [nothunks] Running 1 test suites...
  16927. 1387.90 s [nothunks] Test suite nothunks-test: RUNNING...
  16928. 1387.91 s [nothunks] Tests
  16929. 1387.91 s [nothunks] NoThunks.Class
  16930. 1387.91 s [nothunks] Sanity
  16931. 1387.91 s [nothunks] IntNotNF: OK
  16932. 1387.91 s [nothunks] ✓ <interactive> passed 1 test.
  16933. 1387.91 s [nothunks] IntIsNF: OK
  16934. 1387.91 s [nothunks] ✓ <interactive> passed 1 test.
  16935. 1387.91 s [nothunks] Pair: OK
  16936. 1387.91 s [nothunks] ✓ <interactive> passed 1 test.
  16937. 1387.91 s [nothunks] Sum: OK
  16938. 1387.91 s [nothunks] ✓ <interactive> passed 1 test.
  16939. 1387.91 s [nothunks] Fn: OK
  16940. 1387.91 s [nothunks] ✓ <interactive> passed 1 test.
  16941. 1387.91 s [nothunks] IO: OK
  16942. 1387.92 s [nothunks] ✓ <interactive> passed 1 test.
  16943. 1387.92 s [nothunks] InspectHeap
  16944. 1387.94 s [nothunks] Int: OK (0.02s)
  16945. 1387.94 s [nothunks] ✓ <interactive> passed 1000 tests.
  16946. 1387.94 s [nothunks] Just ["Int"] 51% ██████████··········
  16947. 1387.94 s [nothunks] Nothing 49% █████████▉··········
  16948. 1387.96 s [nothunks] IntInt: OK (0.02s)
  16949. 1387.96 s [nothunks] ✓ <interactive> passed 1000 tests.
  16950. 1387.96 s [nothunks] Just ["(,)"] 50% ██████████··········
  16951. 1387.96 s [nothunks] Just ["Int","(,)"] 36% ███████▎············
  16952. 1387.96 s [nothunks] Nothing 13% ██▌·················
  16953. 1387.98 s [nothunks] SumInt: OK (0.02s)
  16954. 1387.98 s [nothunks] ✓ <interactive> passed 1000 tests.
  16955. 1387.98 s [nothunks] Just ["Either"] 32% ██████▍·············
  16956. 1387.98 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  16957. 1387.98 s [nothunks] Nothing 34% ██████▊·············
  16958. 1388.00 s [nothunks] ListInt: OK (0.02s)
  16959. 1388.00 s [nothunks] ✓ <interactive> passed 1000 tests.
  16960. 1388.00 s [nothunks] Just ["Int","List"] 22% ████▍···············
  16961. 1388.00 s [nothunks] Just ["List"] 42% ████████▌···········
  16962. 1388.00 s [nothunks] Nothing 35% ███████·············
  16963. 1388.02 s [nothunks] IntListInt: OK (0.03s)
  16964. 1388.02 s [nothunks] ✓ <interactive> passed 1000 tests.
  16965. 1388.02 s [nothunks] Just ["(,)"] 51% ██████████▏·········
  16966. 1388.02 s [nothunks] Just ["Int","(,)"] 26% █████▎··············
  16967. 1388.02 s [nothunks] Just ["Int","List","(,)"] 5% █···················
  16968. 1388.02 s [nothunks] Just ["List","(,)"] 11% ██▏·················
  16969. 1388.02 s [nothunks] Nothing 7% █▍··················
  16970. 1388.04 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  16971. 1388.04 s [nothunks] after 13 tests and 2 shrinks.
  16972. 1388.04 s [nothunks] shrink path: 13:cA
  16973. 1388.04 s [nothunks] Just ["Int","Seq"] 23% ████▌···············
  16974. 1388.04 s [nothunks] Nothing 69% █████████████▊······
  16975. 1388.04 s [nothunks]
  16976. 1388.04 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  16977. 1388.04 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  16978. 1388.04 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  16979. 1388.04 s [nothunks] 168 ┃ -> Proxy a
  16980. 1388.04 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  16981. 1388.04 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  16982. 1388.05 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  16983. 1388.05 s [nothunks] 172 ┃ -> Property
  16984. 1388.05 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  16985. 1388.05 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  16986. 1388.05 s [nothunks] ┃ │ Wrap
  16987. 1388.05 s [nothunks] ┃ │ { unwrap =
  16988. 1388.05 s [nothunks] ┃ │ SeqEnqueue
  16989. 1388.05 s [nothunks] ┃ │ (IntValue 0)
  16990. 1388.05 s [nothunks] ┃ │ (SeqEnqueue
  16991. 1388.05 s [nothunks] ┃ │ (IntValue 0)
  16992. 1388.05 s [nothunks] ┃ │ (SeqEnqueue
  16993. 1388.05 s [nothunks] ┃ │ (IntValue 0)
  16994. 1388.05 s [nothunks] ┃ │ (SeqEnqueue
  16995. 1388.05 s [nothunks] ┃ │ (IntValue 0)
  16996. 1388.05 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  16997. 1388.05 s [nothunks] ┃ │ }
  16998. 1388.05 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  16999. 1388.05 s [nothunks] 176 ┃ fromModel m $ \a -> do
  17000. 1388.05 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  17001. 1388.05 s [nothunks] ┃ │ IsNF
  17002. 1388.05 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  17003. 1388.05 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  17004. 1388.05 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17005. 1388.05 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  17006. 1388.05 s [nothunks] ┃ │ - Just
  17007. 1388.05 s [nothunks] ┃ │ - ThunkInfo
  17008. 1388.05 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  17009. 1388.05 s [nothunks] ┃ │ + Nothing
  17010. 1388.05 s [nothunks]
  17011. 1388.05 s [nothunks] This failure can be reproduced by running:
  17012. 1388.05 s [nothunks] > recheckAt (Seed 2913485479354267759 5776510677508669811) "13:cA" EXPECTED FAILURE
  17013. 1388.05 s [nothunks]
  17014. 1388.06 s [nothunks] OK (0.02s)
  17015. 1388.06 s [nothunks] ✓ <interactive> passed 1 test.
  17016. 1388.06 s [nothunks] Model
  17017. 1388.06 s [nothunks] Int: OK (0.01s)
  17018. 1388.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  17019. 1388.06 s [nothunks] Just ["Int"] 49% █████████▊··········
  17020. 1388.06 s [nothunks] Nothing 51% ██████████▏·········
  17021. 1388.08 s [nothunks] IntInt: OK (0.02s)
  17022. 1388.08 s [nothunks] ✓ <interactive> passed 1000 tests.
  17023. 1388.08 s [nothunks] Just ["(,)"] 50% █████████▉··········
  17024. 1388.08 s [nothunks] Just ["Int","(,)"] 39% ███████▊············
  17025. 1388.08 s [nothunks] Nothing 11% ██▏·················
  17026. 1388.10 s [nothunks] SumInt: OK (0.02s)
  17027. 1388.10 s [nothunks] ✓ <interactive> passed 1000 tests.
  17028. 1388.10 s [nothunks] Just ["Either"] 36% ███████·············
  17029. 1388.10 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  17030. 1388.10 s [nothunks] Nothing 30% ██████··············
  17031. 1388.12 s [nothunks] ListInt: OK (0.02s)
  17032. 1388.12 s [nothunks] ✓ <interactive> passed 1000 tests.
  17033. 1388.12 s [nothunks] Just ["Int","List"] 23% ████▌···············
  17034. 1388.12 s [nothunks] Just ["List"] 45% █████████···········
  17035. 1388.12 s [nothunks] Nothing 32% ██████▍·············
  17036. 1388.14 s [nothunks] IntListInt: OK (0.03s)
  17037. 1388.14 s [nothunks] ✓ <interactive> passed 1000 tests.
  17038. 1388.14 s [nothunks] Just ["(,)"] 51% ██████████▏·········
  17039. 1388.14 s [nothunks] Just ["Int","(,)"] 28% █████▌··············
  17040. 1388.14 s [nothunks] Just ["Int","List","(,)"] 4% ▉···················
  17041. 1388.14 s [nothunks] Just ["List","(,)"] 10% █▉··················
  17042. 1388.14 s [nothunks] Nothing 8% █▌··················
  17043. 1388.22 s [nothunks] SeqInt: OK (0.08s)
  17044. 1388.22 s [nothunks] ✓ <interactive> passed 1000 tests.
  17045. 1388.22 s [nothunks] Just ["Int","Seq"] 47% █████████▍··········
  17046. 1388.22 s [nothunks] Nothing 53% ██████████▌·········
  17047. 1388.26 s [nothunks] AllowThunksIn: OK (0.04s)
  17048. 1388.26 s [nothunks] ✓ <interactive> passed 1000 tests.
  17049. 1388.26 s [nothunks] Just ["Int","field2","Record"] 26% █████▎··············
  17050. 1388.26 s [nothunks] Just ["Record"] 51% ██████████▏·········
  17051. 1388.26 s [nothunks] Nothing 22% ████▌···············
  17052. 1388.28 s [nothunks] Fn: OK (0.01s)
  17053. 1388.28 s [nothunks] ✓ <interactive> passed 1000 tests.
  17054. 1388.28 s [nothunks] Just ["->"] 26% █████▏··············
  17055. 1388.28 s [nothunks] Nothing 74% ██████████████▊·····
  17056. 1388.28 s [nothunks] IO: OK (0.01s)
  17057. 1388.28 s [nothunks] ✓ <interactive> passed 1000 tests.
  17058. 1388.28 s [nothunks] Just ["IO"] 25% ████▉···············
  17059. 1388.28 s [nothunks] Nothing 75% ███████████████·····
  17060. 1388.30 s [nothunks] ThunkFreeFn: OK (0.01s)
  17061. 1388.30 s [nothunks] ✓ <interactive> passed 1000 tests.
  17062. 1388.30 s [nothunks] Just ["->"] 27% █████▎··············
  17063. 1388.30 s [nothunks] Just ["...","->"] 36% ███████▏············
  17064. 1388.30 s [nothunks] Nothing 38% ███████▌············
  17065. 1388.30 s [nothunks] ThunkFreeIO: OK (0.01s)
  17066. 1388.30 s [nothunks] ✓ <interactive> passed 1000 tests.
  17067. 1388.30 s [nothunks] Just ["...","IO"] 37% ███████▍············
  17068. 1388.30 s [nothunks] Just ["IO"] 25% █████···············
  17069. 1388.30 s [nothunks] Nothing 38% ███████▌············
  17070. 1388.30 s [nothunks] MutableVars
  17071. 1388.30 s [nothunks] IORef
  17072. 1388.30 s [nothunks] NotNF: OK
  17073. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17074. 1388.30 s [nothunks] NF: OK
  17075. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17076. 1388.30 s [nothunks] NotNFPure: OK
  17077. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17078. 1388.30 s [nothunks] NFPure: OK
  17079. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17080. 1388.30 s [nothunks] NotNFAtomically: OK
  17081. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17082. 1388.30 s [nothunks] NFAtomically: OK
  17083. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17084. 1388.30 s [nothunks] MVar
  17085. 1388.30 s [nothunks] NotNF: OK
  17086. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17087. 1388.30 s [nothunks] NF: OK
  17088. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17089. 1388.30 s [nothunks] NotNFPure: OK
  17090. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17091. 1388.30 s [nothunks] NFPure: OK
  17092. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17093. 1388.30 s [nothunks] NotNFAtomically: OK
  17094. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17095. 1388.30 s [nothunks] NFAtomically: OK
  17096. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17097. 1388.30 s [nothunks] TVar
  17098. 1388.30 s [nothunks] NotNF: OK
  17099. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17100. 1388.30 s [nothunks] NF: OK
  17101. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17102. 1388.30 s [nothunks] NotNFPure: OK
  17103. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17104. 1388.30 s [nothunks] NFPure: OK
  17105. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17106. 1388.30 s [nothunks] NotNFAtomically: OK
  17107. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17108. 1388.30 s [nothunks] NFAtomically: OK
  17109. 1388.30 s [nothunks] ✓ <interactive> passed 1 test.
  17110. 1388.30 s [nothunks]
  17111. 1388.30 s [nothunks] All 41 tests passed (0.39s)
  17112. 1388.31 s [nothunks] Test suite nothunks-test: PASS
  17113. 1388.32 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  17114. 1388.32 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  17115. 1388.33 s [nothunks] Phase: haddockPhase
  17116. 1388.53 s [nothunks] Preprocessing library for nothunks-0.3.1..
  17117. 1388.53 s [nothunks] Running Haddock on library for nothunks-0.3.1..
  17118. 1388.53 s [nothunks] Warning: The documentation for the following packages are not installed. No
  17119. 1388.53 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  17120. 1388.61 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17121. 1389.71 s [nothunks] Warning: 'GHC' is out of scope.
  17122. 1389.71 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17123. 1389.71 s [nothunks] Warning: 'a' is out of scope.
  17124. 1389.75 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17125. 1389.75 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  17126. 1389.75 s [nothunks] Missing documentation for:
  17127. 1389.75 s [nothunks] Module header
  17128. 1390.35 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  17129. 1390.35 s [nothunks] - Data.Vector.Vector
  17130. 1390.35 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  17131. 1390.35 s [nothunks] - NoThunks.Class.HasFields
  17132. 1390.35 s [nothunks] - NoThunks.Class.Elem
  17133. 1390.35 s [nothunks] - NoThunks.Class.GShowTypeOf
  17134. 1390.35 s [nothunks] - NoThunks.Class.GWRecordField
  17135. 1390.35 s [nothunks] - NoThunks.Class.checkContainsThunks
  17136. 1394.94 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  17137. 1394.95 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  17138. 1395.05 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  17139. 1395.07 s [nothunks] Phase: installPhase
  17140. 1395.19 s [nothunks] Installing library in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17141. 1395.48 s [nothunks] Phase: fixupPhase
  17142. 1395.50 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1
  17143. 1395.51 s [nothunks] shrinking /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSnothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf-ghc9.6.7.so
  17144. 1395.52 s [nothunks] checking for references to /build/ in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1...
  17145. 1395.54 s [nothunks] patching script interpreter paths in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1
  17146. 1395.55 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib
  17147. 1395.62 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17148. 1395.63 s [nothunks] checking for references to /build/ in /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc...
  17149. 1395.65 s [nothunks] patching script interpreter paths in /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17150. 1395.77 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1 /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17151. 1396.21 s [nothunks:post-build] Nothing to push - all store paths are already on Cachix.
  17152. 1396.24 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1 /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17153. 1396.31 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17154. 1396.36 s [nothunks:post-build] copying 1 paths...
  17155. 1396.36 s [nothunks:post-build] copying path '/nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  17156. 1397.33 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17157. 1397.48 s [nothunks:post-build] copying 0 paths...
  17158. 1397.52 s Progress: 18 of 34 built (1 building), 341 of 341 downloaded from cache
  17159. 1397.64 s Building /nix/store/r6c54pd7rjdnrnb1680lxsm637gx7aas-unordered-containers-0.2.20.1.drv
  17160. 1397.90 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  17161. 1397.92 s [unordered-containers] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  17162. 1398.24 s [unordered-containers] Phase: unpackPhase
  17163. 1398.31 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  17164. 1398.32 s [unordered-containers] source root is unordered-containers-0.2.20.1
  17165. 1398.33 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  17166. 1398.33 s [unordered-containers] Phase: patchPhase
  17167. 1398.34 s [unordered-containers] Phase: compileBuildDriverPhase
  17168. 1398.36 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.ZzZJhaAi6m/setup-package.conf.d -threaded
  17169. 1398.42 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ZzZJhaAi6m/Main.o )
  17170. 1398.47 s [unordered-containers] [2 of 2] Linking Setup
  17171. 1398.59 s [haskell-language-server] Preprocessing library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
  17172. 1398.59 s [haskell-language-server] Building library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0..
  17173. 1398.72 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalGild ( plugins/hls-cabal-gild-plugin/src/Ide/Plugin/CabalGild.hs, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.o, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.dyn_o )
  17174. 1400.19 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  17175. 1400.21 s [unordered-containers] Phase: configurePhase
  17176. 1400.22 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.ZzZJhaAi6m/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  17177. 1400.24 s [unordered-containers] Using Parsec parser
  17178. 1400.24 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  17179. 1400.70 s [unordered-containers] Flags chosen: debug=False
  17180. 1400.70 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.18.3.0
  17181. 1400.70 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.4.8.1
  17182. 1400.70 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  17183. 1400.70 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.20.0.0
  17184. 1400.70 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  17185. 1400.70 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  17186. 1400.70 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  17187. 1400.70 s [unordered-containers] Dependency base: using base-4.18.3.0
  17188. 1400.70 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.7
  17189. 1400.70 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  17190. 1400.70 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  17191. 1400.70 s [unordered-containers] Dependency random: using random-1.2.1.3
  17192. 1400.70 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  17193. 1400.70 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  17194. 1400.70 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  17195. 1400.70 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  17196. 1400.79 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalGild ( plugins/hls-cabal-gild-plugin/src/Ide/Plugin/CabalGild.hs, dist/build/hls-cabal-gild-plugin/Ide/Plugin/CabalGild.p_o )
  17197. 1401.19 s [unordered-containers] Source component graph:
  17198. 1401.19 s [unordered-containers] component lib
  17199. 1401.19 s [unordered-containers] component test:unordered-containers-tests dependency lib
  17200. 1401.19 s [unordered-containers] Configured component graph:
  17201. 1401.19 s [unordered-containers] component unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17202. 1401.19 s [unordered-containers] include base-4.18.3.0
  17203. 1401.19 s [unordered-containers] include deepseq-1.4.8.1
  17204. 1401.19 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17205. 1401.19 s [unordered-containers] include template-haskell-2.20.0.0
  17206. 1401.19 s [unordered-containers] component unordered-containers-0.2.20.1-Lv2DtJYil3NKky7HcVKF3w-unordered-containers-tests
  17207. 1401.19 s [unordered-containers] include ChasingBottoms-1.3.1.17-KXmTvzLsrA6HUnYEAv9Scg
  17208. 1401.19 s [unordered-containers] include HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  17209. 1401.19 s [unordered-containers] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  17210. 1401.19 s [unordered-containers] include base-4.18.3.0
  17211. 1401.19 s [unordered-containers] include containers-0.6.7
  17212. 1401.19 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17213. 1401.19 s [unordered-containers] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17214. 1401.19 s [unordered-containers] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  17215. 1401.19 s [unordered-containers] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  17216. 1401.19 s [unordered-containers] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  17217. 1401.19 s [unordered-containers] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  17218. 1401.20 s [unordered-containers] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17219. 1401.20 s [unordered-containers] Linked component graph:
  17220. 1401.20 s [unordered-containers] unit unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17221. 1401.20 s [unordered-containers] include base-4.18.3.0
  17222. 1401.20 s [unordered-containers] include deepseq-1.4.8.1
  17223. 1401.20 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17224. 1401.20 s [unordered-containers] include template-haskell-2.20.0.0
  17225. 1401.20 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashSet.Internal
  17226. 1401.20 s [unordered-containers] unit unordered-containers-0.2.20.1-Lv2DtJYil3NKky7HcVKF3w-unordered-containers-tests
  17227. 1401.20 s [unordered-containers] include ChasingBottoms-1.3.1.17-KXmTvzLsrA6HUnYEAv9Scg
  17228. 1401.20 s [unordered-containers] include HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  17229. 1401.20 s [unordered-containers] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  17230. 1401.20 s [unordered-containers] include base-4.18.3.0
  17231. 1401.20 s [unordered-containers] include containers-0.6.7
  17232. 1401.20 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17233. 1401.20 s [unordered-containers] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17234. 1401.20 s [unordered-containers] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  17235. 1401.20 s [unordered-containers] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  17236. 1401.20 s [unordered-containers] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  17237. 1401.20 s [unordered-containers] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  17238. 1401.20 s [unordered-containers] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17239. 1401.20 s [unordered-containers] Ready component graph:
  17240. 1401.20 s [unordered-containers] definite unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17241. 1401.20 s [unordered-containers] depends base-4.18.3.0
  17242. 1401.20 s [unordered-containers] depends deepseq-1.4.8.1
  17243. 1401.20 s [unordered-containers] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17244. 1401.20 s [unordered-containers] depends template-haskell-2.20.0.0
  17245. 1401.20 s [unordered-containers] definite unordered-containers-0.2.20.1-Lv2DtJYil3NKky7HcVKF3w-unordered-containers-tests
  17246. 1401.20 s [unordered-containers] depends ChasingBottoms-1.3.1.17-KXmTvzLsrA6HUnYEAv9Scg
  17247. 1401.20 s [unordered-containers] depends HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  17248. 1401.20 s [unordered-containers] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  17249. 1401.20 s [unordered-containers] depends base-4.18.3.0
  17250. 1401.20 s [unordered-containers] depends containers-0.6.7
  17251. 1401.20 s [unordered-containers] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17252. 1401.20 s [unordered-containers] depends nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17253. 1401.20 s [unordered-containers] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  17254. 1401.20 s [unordered-containers] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  17255. 1401.20 s [unordered-containers] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  17256. 1401.20 s [unordered-containers] depends tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  17257. 1401.20 s [unordered-containers] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17258. 1401.20 s [unordered-containers] Using Cabal-3.10.3.0 compiled by ghc-9.6
  17259. 1401.20 s [unordered-containers] Using compiler: ghc-9.6.7
  17260. 1401.20 s [unordered-containers] Using install prefix:
  17261. 1401.20 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  17262. 1401.20 s [unordered-containers] Executables installed in:
  17263. 1401.20 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/bin
  17264. 1401.20 s [unordered-containers] Libraries installed in:
  17265. 1401.20 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17266. 1401.20 s [unordered-containers] Dynamic Libraries installed in:
  17267. 1401.20 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  17268. 1401.20 s [unordered-containers] Private executables installed in:
  17269. 1401.20 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1
  17270. 1401.20 s [unordered-containers] Data files installed in:
  17271. 1401.20 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1
  17272. 1401.20 s [unordered-containers] Documentation installed in:
  17273. 1401.20 s [unordered-containers] /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  17274. 1401.20 s [unordered-containers] Configuration files installed in:
  17275. 1401.20 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/etc
  17276. 1401.20 s [unordered-containers] No alex found
  17277. 1401.20 s [unordered-containers] Using ar found on system at:
  17278. 1401.20 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17279. 1401.20 s [unordered-containers] No c2hs found
  17280. 1401.20 s [unordered-containers] No cpphs found
  17281. 1401.20 s [unordered-containers] No doctest found
  17282. 1401.20 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  17283. 1401.20 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17284. 1401.20 s [unordered-containers] Using ghc version 9.6.7 found on system at:
  17285. 1401.20 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  17286. 1401.20 s [unordered-containers] Using ghc-pkg version 9.6.7 found on system at:
  17287. 1401.20 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  17288. 1401.20 s [unordered-containers] No ghcjs found
  17289. 1401.20 s [unordered-containers] No ghcjs-pkg found
  17290. 1401.20 s [unordered-containers] No greencard found
  17291. 1401.20 s [unordered-containers] Using haddock version 2.29.2 found on system at:
  17292. 1401.20 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  17293. 1401.20 s [unordered-containers] No happy found
  17294. 1401.20 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  17295. 1401.20 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17296. 1401.20 s [unordered-containers] No hmake found
  17297. 1401.20 s [unordered-containers] Using hpc version 0.68 found on system at:
  17298. 1401.20 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  17299. 1401.20 s [unordered-containers] Using hsc2hs version 0.68.9 found on system at:
  17300. 1401.20 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  17301. 1401.20 s [unordered-containers] Using hscolour version 1.25 found on system at:
  17302. 1401.20 s [unordered-containers] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  17303. 1401.20 s [unordered-containers] No jhc found
  17304. 1401.20 s [unordered-containers] Using ld found on system at:
  17305. 1401.20 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  17306. 1401.20 s [unordered-containers] No pkg-config found
  17307. 1401.20 s [unordered-containers] Using runghc version 9.6.7 found on system at:
  17308. 1401.20 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  17309. 1401.20 s [unordered-containers] Using strip version 2.44 found on system at:
  17310. 1401.20 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17311. 1401.20 s [unordered-containers] Using tar found on system at:
  17312. 1401.20 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17313. 1401.20 s [unordered-containers] No uhc found
  17314. 1401.47 s [unordered-containers] Phase: buildPhase
  17315. 1401.54 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  17316. 1401.55 s [unordered-containers] Building library for unordered-containers-0.2.20.1..
  17317. 1401.65 s [unordered-containers]
  17318. 1401.65 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  17319. 1401.65 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17320. 1401.65 s [unordered-containers] |
  17321. 1401.65 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17322. 1401.65 s [unordered-containers] | ^^^^^^^^^^
  17323. 1401.84 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 )
  17324. 1402.01 s [unordered-containers]
  17325. 1402.01 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  17326. 1402.01 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17327. 1402.01 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17328. 1402.01 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17329. 1402.01 s [unordered-containers] |
  17330. 1402.01 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17331. 1402.01 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17332. 1402.65 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 )
  17333. 1402.65 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 )
  17334. 1410.38 s [haskell-language-server] Preprocessing library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
  17335. 1410.39 s [haskell-language-server] Building library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0..
  17336. 1410.69 s [haskell-language-server] [ 1 of 24] Compiling Ide.Plugin.Cabal.Completion.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.dyn_o )
  17337. 1411.85 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 )
  17338. 1412.65 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 )
  17339. 1413.63 s [haskell-language-server] [ 2 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.dyn_o )
  17340. 1413.74 s [haskell-language-server] [ 3 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Paths ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Paths.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.dyn_o )
  17341. 1413.84 s [haskell-language-server] [ 4 of 24] Compiling Ide.Plugin.Cabal.Completion.CabalFields ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/CabalFields.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.dyn_o )
  17342. 1413.91 s [haskell-language-server] [ 5 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Simple ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Simple.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.dyn_o )
  17343. 1414.12 s [haskell-language-server] [ 6 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Snippet ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Snippet.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.dyn_o )
  17344. 1414.40 s [haskell-language-server] [ 7 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.FilePath ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/FilePath.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.dyn_o )
  17345. 1414.40 s [haskell-language-server] [ 8 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Module ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Module.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.dyn_o )
  17346. 1414.53 s [haskell-language-server] [ 9 of 24] Compiling Ide.Plugin.Cabal.Diagnostics ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Diagnostics.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.dyn_o )
  17347. 1414.53 s [haskell-language-server] [10 of 24] Compiling Ide.Plugin.Cabal.FieldSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/FieldSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.dyn_o )
  17348. 1414.53 s [haskell-language-server] [11 of 24] Compiling Ide.Plugin.Cabal.LicenseSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/LicenseSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.dyn_o )
  17349. 1414.53 s [haskell-language-server] [12 of 24] Compiling Ide.Plugin.Cabal.Completion.Data ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Data.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.dyn_o )
  17350. 1415.07 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 )
  17351. 1415.07 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  17352. 1415.07 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 )
  17353. 1415.09 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 )
  17354. 1415.17 s [haskell-language-server] [13 of 24] Compiling Ide.Plugin.Cabal.Completion.Completions ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completions.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.dyn_o )
  17355. 1415.46 s [unordered-containers]
  17356. 1415.46 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  17357. 1415.48 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17358. 1415.48 s [unordered-containers] |
  17359. 1415.48 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17360. 1415.48 s [unordered-containers] | ^^^^^^^^^^
  17361. 1415.53 s [haskell-language-server] [14 of 24] Compiling Ide.Plugin.Cabal.Orphans ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Orphans.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.dyn_o )
  17362. 1415.53 s [haskell-language-server] [15 of 24] Compiling Ide.Plugin.Cabal.OfInterest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/OfInterest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.dyn_o )
  17363. 1415.53 s [haskell-language-server] [16 of 24] Compiling Ide.Plugin.Cabal.Files ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Files.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.dyn_o )
  17364. 1415.53 s [haskell-language-server] [17 of 24] Compiling Ide.Plugin.Cabal.Definition ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Definition.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.dyn_o )
  17365. 1415.53 s [haskell-language-server] [18 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.dyn_o )
  17366. 1415.53 s [haskell-language-server] [19 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Command ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Command.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.dyn_o )
  17367. 1415.53 s [haskell-language-server] [20 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.CodeAction ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/CodeAction.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.dyn_o )
  17368. 1415.53 s [haskell-language-server] [21 of 24] Compiling Ide.Plugin.Cabal.Outline ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Outline.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.dyn_o )
  17369. 1415.53 s [haskell-language-server] [22 of 24] Compiling Ide.Plugin.Cabal.Parse ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Parse.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.dyn_o )
  17370. 1415.53 s [haskell-language-server] [23 of 24] Compiling Ide.Plugin.Cabal.Rules ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Rules.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.dyn_o )
  17371. 1415.53 s [haskell-language-server] [24 of 24] Compiling Ide.Plugin.Cabal ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.dyn_o )
  17372. 1415.58 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  17373. 1415.74 s [unordered-containers]
  17374. 1415.74 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  17375. 1415.74 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17376. 1415.74 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17377. 1415.74 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17378. 1415.74 s [unordered-containers] |
  17379. 1415.74 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17380. 1415.74 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17381. 1416.65 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  17382. 1416.65 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  17383. 1416.95 s [haskell-language-server] [ 1 of 24] Compiling Ide.Plugin.Cabal.Completion.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Types.p_o )
  17384. 1419.05 s Waiting for lock on pandoc-lua-engine
  17385. 1419.05 s Waiting for lock on pandoc-server-0.1.0.11-doc
  17386. 1419.21 s [haskell-language-server] [ 2 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Types.p_o )
  17387. 1419.49 s [haskell-language-server] [ 3 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Paths ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Paths.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Paths.p_o )
  17388. 1419.61 s [haskell-language-server] [ 4 of 24] Compiling Ide.Plugin.Cabal.Completion.CabalFields ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/CabalFields.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/CabalFields.p_o )
  17389. 1419.81 s [haskell-language-server] [ 5 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Simple ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Simple.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Simple.p_o )
  17390. 1420.27 s [haskell-language-server] [ 6 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Snippet ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Snippet.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Snippet.p_o )
  17391. 1420.73 s [haskell-language-server] [ 7 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.FilePath ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/FilePath.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/FilePath.p_o )
  17392. 1420.74 s [haskell-language-server] [ 8 of 24] Compiling Ide.Plugin.Cabal.Completion.Completer.Module ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completer/Module.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completer/Module.p_o )
  17393. 1421.07 s [haskell-language-server] [ 9 of 24] Compiling Ide.Plugin.Cabal.Diagnostics ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Diagnostics.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Diagnostics.p_o )
  17394. 1421.07 s [haskell-language-server] [10 of 24] Compiling Ide.Plugin.Cabal.FieldSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/FieldSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/FieldSuggest.p_o )
  17395. 1421.07 s [haskell-language-server] [11 of 24] Compiling Ide.Plugin.Cabal.LicenseSuggest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/LicenseSuggest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/LicenseSuggest.p_o )
  17396. 1421.07 s [haskell-language-server] [12 of 24] Compiling Ide.Plugin.Cabal.Completion.Data ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Data.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Data.p_o )
  17397. 1422.05 s [haskell-language-server] [13 of 24] Compiling Ide.Plugin.Cabal.Completion.Completions ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Completion/Completions.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.p_o )
  17398. 1422.58 s [haskell-language-server] [14 of 24] Compiling Ide.Plugin.Cabal.Orphans ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Orphans.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Orphans.p_o )
  17399. 1422.58 s [haskell-language-server] [15 of 24] Compiling Ide.Plugin.Cabal.OfInterest ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/OfInterest.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/OfInterest.p_o )
  17400. 1422.58 s [haskell-language-server] [16 of 24] Compiling Ide.Plugin.Cabal.Files ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Files.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Files.p_o )
  17401. 1422.58 s [haskell-language-server] [17 of 24] Compiling Ide.Plugin.Cabal.Definition ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Definition.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Definition.p_o )
  17402. 1422.58 s [haskell-language-server] [18 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Types ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Types.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Types.p_o )
  17403. 1424.00 s [haskell-language-server] [19 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.Command ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/Command.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/Command.p_o )
  17404. 1424.69 s [haskell-language-server] [20 of 24] Compiling Ide.Plugin.Cabal.CabalAdd.CodeAction ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/CabalAdd/CodeAction.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/CabalAdd/CodeAction.p_o )
  17405. 1424.69 s [haskell-language-server] [21 of 24] Compiling Ide.Plugin.Cabal.Outline ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Outline.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Outline.p_o )
  17406. 1424.69 s [haskell-language-server] [22 of 24] Compiling Ide.Plugin.Cabal.Parse ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Parse.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Parse.p_o )
  17407. 1424.69 s [haskell-language-server] [23 of 24] Compiling Ide.Plugin.Cabal.Rules ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal/Rules.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Rules.p_o )
  17408. 1424.69 s [haskell-language-server] [24 of 24] Compiling Ide.Plugin.Cabal ( plugins/hls-cabal-plugin/src/Ide/Plugin/Cabal.hs, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal.p_o )
  17409. 1429.46 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  17410. 1430.39 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  17411. 1434.62 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  17412. 1434.62 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  17413. 1434.65 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  17414. 1434.82 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  17415. 1438.30 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17416. 1438.30 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17417. 1438.58 s [haskell-language-server] Preprocessing library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
  17418. 1438.58 s [haskell-language-server] Building library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0..
  17419. 1438.60 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 )
  17420. 1438.88 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Hlint ( plugins/hls-hlint-plugin/src/Ide/Plugin/Hlint.hs, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.o, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.dyn_o )
  17421. 1438.98 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  17422. 1442.53 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 )
  17423. 1442.55 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  17424. 1442.55 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 )
  17425. 1442.55 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 )
  17426. 1449.60 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Hlint ( plugins/hls-hlint-plugin/src/Ide/Plugin/Hlint.hs, dist/build/hls-hlint-plugin/Ide/Plugin/Hlint.p_o )
  17427. 1451.84 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 )
  17428. 1451.84 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  17429. 1451.87 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  17430. 1452.48 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  17431. 1453.99 s [unordered-containers] buildPhase completed in 53 seconds
  17432. 1454.00 s [unordered-containers] Phase: checkPhase
  17433. 1454.05 s [unordered-containers] Running 1 test suites...
  17434. 1454.05 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  17435. 1454.07 s [unordered-containers] All
  17436. 1454.07 s [unordered-containers] Properties
  17437. 1454.07 s [unordered-containers] Data.HashMap.Lazy
  17438. 1454.07 s [unordered-containers] instances
  17439. 1454.07 s [unordered-containers] Eq
  17440. 1454.12 s [unordered-containers] ==: OK (0.05s)
  17441. 1454.12 s [unordered-containers] +++ OK, passed 100 tests.
  17442. 1454.12 s [unordered-containers] /=: OK (0.05s)
  17443. 1454.12 s [unordered-containers] +++ OK, passed 100 tests.
  17444. 1454.12 s [unordered-containers] Ord
  17445. 1454.12 s [unordered-containers] compare reflexive: OK (0.03s)
  17446. 1454.12 s [unordered-containers] +++ OK, passed 100 tests.
  17447. 1454.12 s [unordered-containers] compare transitive: OK (0.02s)
  17448. 1454.12 s [unordered-containers] +++ OK, passed 100 tests.
  17449. 1454.12 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17450. 1454.12 s [unordered-containers] +++ OK, passed 100 tests.
  17451. 1454.12 s [unordered-containers] Ord => Eq: OK (0.03s)
  17452. 1454.12 s [unordered-containers] +++ OK, passed 100 tests.
  17453. 1454.19 s [unordered-containers] Read/Show: OK (0.13s)
  17454. 1454.19 s [unordered-containers] +++ OK, passed 100 tests.
  17455. 1454.19 s [unordered-containers] Functor: OK (0.03s)
  17456. 1454.19 s [unordered-containers] +++ OK, passed 100 tests.
  17457. 1454.21 s [unordered-containers] Foldable: OK
  17458. 1454.24 s [unordered-containers] +++ OK, passed 100 tests.
  17459. 1454.24 s [unordered-containers] Bifoldable
  17460. 1454.24 s [unordered-containers] bifoldMap: OK (0.01s)
  17461. 1454.24 s [unordered-containers] +++ OK, passed 100 tests.
  17462. 1454.24 s [unordered-containers] bifoldr: OK (0.04s)
  17463. 1454.24 s [unordered-containers] +++ OK, passed 100 tests.
  17464. 1454.27 s [unordered-containers] bifoldl: OK
  17465. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17466. 1454.27 s [unordered-containers] Hashable: OK (0.02s)
  17467. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17468. 1454.27 s [unordered-containers] empty
  17469. 1454.27 s [unordered-containers] valid: OK
  17470. 1454.27 s [unordered-containers] +++ OK, passed 1 test.
  17471. 1454.27 s [unordered-containers] singleton
  17472. 1454.27 s [unordered-containers] valid: OK
  17473. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17474. 1454.27 s [unordered-containers] size: OK (0.02s)
  17475. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17476. 1454.27 s [unordered-containers] member: OK (0.01s)
  17477. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17478. 1454.27 s [unordered-containers] lookup: OK (0.03s)
  17479. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17480. 1454.27 s [unordered-containers] !?: OK
  17481. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17482. 1454.27 s [unordered-containers] insert
  17483. 1454.27 s [unordered-containers] model: OK
  17484. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17485. 1454.27 s [unordered-containers] valid: OK
  17486. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17487. 1454.27 s [unordered-containers] insertWith
  17488. 1454.27 s [unordered-containers] insertWith: OK
  17489. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17490. 1454.27 s [unordered-containers] valid: OK
  17491. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17492. 1454.27 s [unordered-containers] delete
  17493. 1454.27 s [unordered-containers] model: OK
  17494. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17495. 1454.27 s [unordered-containers] valid: OK
  17496. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17497. 1454.27 s [unordered-containers] adjust
  17498. 1454.27 s [unordered-containers] model: OK (0.05s)
  17499. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17500. 1454.27 s [unordered-containers] valid: OK
  17501. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17502. 1454.27 s [unordered-containers] update
  17503. 1454.27 s [unordered-containers] model: OK (0.01s)
  17504. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17505. 1454.27 s [unordered-containers] valid: OK
  17506. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17507. 1454.27 s [unordered-containers] alter
  17508. 1454.27 s [unordered-containers] model: OK
  17509. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17510. 1454.27 s [unordered-containers] valid: OK
  17511. 1454.27 s [unordered-containers] +++ OK, passed 100 tests.
  17512. 1454.28 s [unordered-containers] alterF
  17513. 1454.28 s [unordered-containers] model
  17514. 1454.28 s [unordered-containers] []: OK (0.05s)
  17515. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17516. 1454.28 s [unordered-containers] adjust: OK
  17517. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17518. 1454.28 s [unordered-containers] insert: OK
  17519. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17520. 1454.28 s [unordered-containers] insertWith: OK (0.01s)
  17521. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17522. 1454.28 s [unordered-containers] delete: OK (0.02s)
  17523. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17524. 1454.28 s [unordered-containers] lookup: OK (0.01s)
  17525. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17526. 1454.28 s [unordered-containers] valid: OK (0.02s)
  17527. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17528. 1454.28 s [unordered-containers] isSubmapOf
  17529. 1454.28 s [unordered-containers] model: OK (0.01s)
  17530. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17531. 1454.28 s [unordered-containers] m ⊆ m: OK (0.01s)
  17532. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17533. 1454.28 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.01s)
  17534. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17535. 1454.28 s [unordered-containers] m1\m2 ⊆ m1: OK (0.01s)
  17536. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17537. 1454.28 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.04s)
  17538. 1454.28 s [unordered-containers] +++ OK, passed 100 tests; 136 discarded.
  17539. 1454.28 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  17540. 1454.28 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17541. 1454.28 s [unordered-containers] m ⊈ delete k m : OK
  17542. 1454.28 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  17543. 1454.28 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  17544. 1454.28 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17545. 1454.28 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.01s)
  17546. 1454.28 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  17547. 1454.28 s [unordered-containers] union
  17548. 1454.28 s [unordered-containers] model: OK (0.02s)
  17549. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17550. 1454.28 s [unordered-containers] valid: OK (0.01s)
  17551. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17552. 1454.28 s [unordered-containers] unionWith
  17553. 1454.28 s [unordered-containers] model: OK (0.03s)
  17554. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17555. 1454.28 s [unordered-containers] valid: OK
  17556. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17557. 1454.28 s [unordered-containers] unionWithKey
  17558. 1454.28 s [unordered-containers] model: OK (0.04s)
  17559. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17560. 1454.28 s [unordered-containers] valid: OK
  17561. 1454.28 s [unordered-containers] +++ OK, passed 100 tests.
  17562. 1454.28 s [unordered-containers] unions
  17563. 1455.58 s [unordered-containers] model: OK (1.46s)
  17564. 1455.58 s [unordered-containers] +++ OK, passed 100 tests.
  17565. 1455.62 s [unordered-containers] valid: OK (0.30s)
  17566. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17567. 1455.62 s [unordered-containers] difference
  17568. 1455.62 s [unordered-containers] model: OK (0.03s)
  17569. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17570. 1455.62 s [unordered-containers] valid: OK (0.02s)
  17571. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17572. 1455.62 s [unordered-containers] differenceWith
  17573. 1455.62 s [unordered-containers] model: OK (0.06s)
  17574. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17575. 1455.62 s [unordered-containers] valid: OK (0.02s)
  17576. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17577. 1455.62 s [unordered-containers] intersection
  17578. 1455.62 s [unordered-containers] model: OK (0.01s)
  17579. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17580. 1455.62 s [unordered-containers] valid: OK
  17581. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17582. 1455.62 s [unordered-containers] intersectionWith
  17583. 1455.62 s [unordered-containers] model: OK (0.04s)
  17584. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17585. 1455.62 s [unordered-containers] valid: OK
  17586. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17587. 1455.62 s [unordered-containers] intersectionWithKey
  17588. 1455.62 s [unordered-containers] model: OK (0.12s)
  17589. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17590. 1455.62 s [unordered-containers] valid: OK
  17591. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17592. 1455.62 s [unordered-containers] compose
  17593. 1455.62 s [unordered-containers] valid: OK
  17594. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17595. 1455.62 s [unordered-containers] map
  17596. 1455.62 s [unordered-containers] model: OK (0.08s)
  17597. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17598. 1455.62 s [unordered-containers] valid: OK (0.01s)
  17599. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17600. 1455.62 s [unordered-containers] traverseWithKey
  17601. 1455.62 s [unordered-containers] model: OK (0.04s)
  17602. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17603. 1455.62 s [unordered-containers] valid: OK
  17604. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17605. 1455.62 s [unordered-containers] mapKeys
  17606. 1455.62 s [unordered-containers] model: OK
  17607. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17608. 1455.62 s [unordered-containers] valid: OK (0.48s)
  17609. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17610. 1455.62 s [unordered-containers] foldr: OK
  17611. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17612. 1455.62 s [unordered-containers] foldl: OK (0.04s)
  17613. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17614. 1455.62 s [unordered-containers] foldrWithKey: OK (0.02s)
  17615. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17616. 1455.62 s [unordered-containers] foldlWithKey: OK (0.01s)
  17617. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17618. 1455.62 s [unordered-containers] foldrWithKey': OK
  17619. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17620. 1455.62 s [unordered-containers] foldlWithKey': OK (0.01s)
  17621. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17622. 1455.62 s [unordered-containers] foldl': OK
  17623. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17624. 1455.62 s [unordered-containers] foldr': OK (0.01s)
  17625. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17626. 1455.62 s [unordered-containers] foldMapWithKey: OK
  17627. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17628. 1455.62 s [unordered-containers] filter
  17629. 1455.62 s [unordered-containers] model: OK (0.04s)
  17630. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17631. 1455.62 s [unordered-containers] valid: OK (0.04s)
  17632. 1455.62 s [unordered-containers] +++ OK, passed 100 tests.
  17633. 1455.62 s [unordered-containers] filterWithKey
  17634. 1456.13 s [unordered-containers] model: OK (1.97s)
  17635. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17636. 1456.13 s [unordered-containers] valid: OK (1.08s)
  17637. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17638. 1456.13 s [unordered-containers] mapMaybe
  17639. 1456.13 s [unordered-containers] model: OK (0.09s)
  17640. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17641. 1456.13 s [unordered-containers] valid: OK (0.04s)
  17642. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17643. 1456.13 s [unordered-containers] mapMaybeWithKey
  17644. 1456.13 s [unordered-containers] model: OK (1.84s)
  17645. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17646. 1456.13 s [unordered-containers] valid: OK (0.96s)
  17647. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17648. 1456.13 s [unordered-containers] elems: OK (0.01s)
  17649. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17650. 1456.13 s [unordered-containers] keys: OK (0.02s)
  17651. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17652. 1456.13 s [unordered-containers] fromList
  17653. 1456.13 s [unordered-containers] model: OK (0.01s)
  17654. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17655. 1456.13 s [unordered-containers] valid: OK
  17656. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17657. 1456.13 s [unordered-containers] fromListWith
  17658. 1456.13 s [unordered-containers] model: OK (0.03s)
  17659. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17660. 1456.13 s [unordered-containers] valid: OK
  17661. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17662. 1456.13 s [unordered-containers] fromListWithKey
  17663. 1456.13 s [unordered-containers] model: OK (0.02s)
  17664. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17665. 1456.13 s [unordered-containers] valid: OK
  17666. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17667. 1456.13 s [unordered-containers] toList: OK (0.02s)
  17668. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17669. 1456.13 s [unordered-containers] Data.HashMap.Strict
  17670. 1456.13 s [unordered-containers] instances
  17671. 1456.13 s [unordered-containers] Eq
  17672. 1456.13 s [unordered-containers] ==: OK (0.03s)
  17673. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17674. 1456.13 s [unordered-containers] /=: OK (0.04s)
  17675. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17676. 1456.13 s [unordered-containers] Ord
  17677. 1456.13 s [unordered-containers] compare reflexive: OK
  17678. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17679. 1456.13 s [unordered-containers] compare transitive: OK (0.04s)
  17680. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17681. 1456.13 s [unordered-containers] compare antisymmetric: OK (0.03s)
  17682. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17683. 1456.13 s [unordered-containers] Ord => Eq: OK (0.02s)
  17684. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17685. 1456.13 s [unordered-containers] Read/Show: OK (0.51s)
  17686. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17687. 1456.13 s [unordered-containers] Functor: OK (0.16s)
  17688. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17689. 1456.13 s [unordered-containers] Foldable: OK (0.02s)
  17690. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17691. 1456.13 s [unordered-containers] Bifoldable
  17692. 1456.13 s [unordered-containers] bifoldMap: OK (0.02s)
  17693. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17694. 1456.13 s [unordered-containers] bifoldr: OK (0.02s)
  17695. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17696. 1456.13 s [unordered-containers] bifoldl: OK (0.04s)
  17697. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17698. 1456.13 s [unordered-containers] Hashable: OK (0.03s)
  17699. 1456.13 s [unordered-containers] +++ OK, passed 100 tests.
  17700. 1456.13 s [unordered-containers] empty
  17701. 1456.13 s [unordered-containers] valid: OK
  17702. 1456.13 s [unordered-containers] +++ OK, passed 1 test.
  17703. 1456.14 s [unordered-containers] singleton
  17704. 1456.14 s [unordered-containers] valid: OK
  17705. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17706. 1456.14 s [unordered-containers] size: OK
  17707. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17708. 1456.14 s [unordered-containers] member: OK (0.02s)
  17709. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17710. 1456.14 s [unordered-containers] lookup: OK (0.02s)
  17711. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17712. 1456.14 s [unordered-containers] !?: OK (0.01s)
  17713. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17714. 1456.14 s [unordered-containers] insert
  17715. 1456.14 s [unordered-containers] model: OK (0.01s)
  17716. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17717. 1456.14 s [unordered-containers] valid: OK (0.01s)
  17718. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17719. 1456.14 s [unordered-containers] insertWith
  17720. 1456.14 s [unordered-containers] insertWith: OK (0.02s)
  17721. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17722. 1456.14 s [unordered-containers] valid: OK (0.02s)
  17723. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17724. 1456.14 s [unordered-containers] delete
  17725. 1456.14 s [unordered-containers] model: OK (0.02s)
  17726. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17727. 1456.14 s [unordered-containers] valid: OK (0.03s)
  17728. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17729. 1456.14 s [unordered-containers] adjust
  17730. 1456.14 s [unordered-containers] model: OK (0.02s)
  17731. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17732. 1456.14 s [unordered-containers] valid: OK (0.02s)
  17733. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17734. 1456.14 s [unordered-containers] update
  17735. 1456.14 s [unordered-containers] model: OK (0.03s)
  17736. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17737. 1456.14 s [unordered-containers] valid: OK (0.01s)
  17738. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17739. 1456.14 s [unordered-containers] alter
  17740. 1456.14 s [unordered-containers] model: OK (0.04s)
  17741. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17742. 1456.14 s [unordered-containers] valid: OK (0.02s)
  17743. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17744. 1456.14 s [unordered-containers] alterF
  17745. 1456.14 s [unordered-containers] model
  17746. 1456.14 s [unordered-containers] []: OK (0.26s)
  17747. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17748. 1456.14 s [unordered-containers] adjust: OK (0.02s)
  17749. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17750. 1456.14 s [unordered-containers] insert: OK (0.07s)
  17751. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17752. 1456.14 s [unordered-containers] insertWith: OK (0.02s)
  17753. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17754. 1456.14 s [unordered-containers] delete: OK (0.02s)
  17755. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17756. 1456.14 s [unordered-containers] lookup: OK (0.01s)
  17757. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17758. 1456.14 s [unordered-containers] valid: OK (0.07s)
  17759. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17760. 1456.14 s [unordered-containers] isSubmapOf
  17761. 1456.14 s [unordered-containers] model: OK (0.06s)
  17762. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17763. 1456.14 s [unordered-containers] m ⊆ m: OK (0.01s)
  17764. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17765. 1456.14 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.02s)
  17766. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17767. 1456.14 s [unordered-containers] m1\m2 ⊆ m1: OK (0.07s)
  17768. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17769. 1456.14 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.13s)
  17770. 1456.14 s [unordered-containers] +++ OK, passed 100 tests; 149 discarded.
  17771. 1456.14 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  17772. 1456.14 s [unordered-containers] +++ OK, passed 100 tests; 23 discarded.
  17773. 1456.14 s [unordered-containers] m ⊈ delete k m : OK (0.05s)
  17774. 1456.14 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  17775. 1456.14 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  17776. 1456.14 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  17777. 1456.14 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.04s)
  17778. 1456.14 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  17779. 1456.14 s [unordered-containers] union
  17780. 1456.14 s [unordered-containers] model: OK (0.10s)
  17781. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17782. 1456.14 s [unordered-containers] valid: OK (0.05s)
  17783. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17784. 1456.14 s [unordered-containers] unionWith
  17785. 1456.14 s [unordered-containers] model: OK (0.17s)
  17786. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17787. 1456.14 s [unordered-containers] valid: OK (0.07s)
  17788. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17789. 1456.14 s [unordered-containers] unionWithKey
  17790. 1456.14 s [unordered-containers] model: OK (0.26s)
  17791. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17792. 1456.14 s [unordered-containers] valid: OK (0.16s)
  17793. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17794. 1456.14 s [unordered-containers] unions
  17795. 1456.14 s [unordered-containers] model: OK (1.39s)
  17796. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17797. 1456.14 s [unordered-containers] valid: OK (1.10s)
  17798. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17799. 1456.14 s [unordered-containers] difference
  17800. 1456.14 s [unordered-containers] model: OK (0.06s)
  17801. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17802. 1456.14 s [unordered-containers] valid: OK (0.05s)
  17803. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17804. 1456.14 s [unordered-containers] differenceWith
  17805. 1456.14 s [unordered-containers] model: OK (0.13s)
  17806. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17807. 1456.14 s [unordered-containers] valid: OK (0.10s)
  17808. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17809. 1456.14 s [unordered-containers] intersection
  17810. 1456.14 s [unordered-containers] model: OK (0.06s)
  17811. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17812. 1456.14 s [unordered-containers] valid: OK (0.03s)
  17813. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17814. 1456.14 s [unordered-containers] intersectionWith
  17815. 1456.14 s [unordered-containers] model: OK (0.12s)
  17816. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17817. 1456.14 s [unordered-containers] valid: OK (0.10s)
  17818. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17819. 1456.14 s [unordered-containers] intersectionWithKey
  17820. 1456.14 s [unordered-containers] model: OK (0.27s)
  17821. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17822. 1456.14 s [unordered-containers] valid: OK (0.12s)
  17823. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17824. 1456.14 s [unordered-containers] compose
  17825. 1456.14 s [unordered-containers] valid: OK (0.04s)
  17826. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17827. 1456.14 s [unordered-containers] map
  17828. 1456.14 s [unordered-containers] model: OK (0.11s)
  17829. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17830. 1456.14 s [unordered-containers] valid: OK (0.07s)
  17831. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17832. 1456.14 s [unordered-containers] traverseWithKey
  17833. 1456.14 s [unordered-containers] model: OK (0.40s)
  17834. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17835. 1456.14 s [unordered-containers] valid: OK (0.02s)
  17836. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17837. 1456.14 s [unordered-containers] mapKeys
  17838. 1456.14 s [unordered-containers] model: OK (0.02s)
  17839. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17840. 1456.14 s [unordered-containers] valid: OK (0.86s)
  17841. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17842. 1456.14 s [unordered-containers] foldr: OK (0.02s)
  17843. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17844. 1456.14 s [unordered-containers] foldl: OK (0.02s)
  17845. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17846. 1456.14 s [unordered-containers] foldrWithKey: OK (0.05s)
  17847. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17848. 1456.14 s [unordered-containers] foldlWithKey: OK (0.02s)
  17849. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17850. 1456.14 s [unordered-containers] foldrWithKey': OK (0.03s)
  17851. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17852. 1456.14 s [unordered-containers] foldlWithKey': OK (0.03s)
  17853. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17854. 1456.14 s [unordered-containers] foldl': OK (0.05s)
  17855. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17856. 1456.14 s [unordered-containers] foldr': OK (0.03s)
  17857. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17858. 1456.14 s [unordered-containers] foldMapWithKey: OK (0.01s)
  17859. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17860. 1456.14 s [unordered-containers] filter
  17861. 1456.14 s [unordered-containers] model: OK (0.21s)
  17862. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17863. 1456.14 s [unordered-containers] valid: OK (0.14s)
  17864. 1456.14 s [unordered-containers] +++ OK, passed 100 tests.
  17865. 1456.14 s [unordered-containers] filterWithKey
  17866. 1456.37 s [unordered-containers] model: OK (1.63s)
  17867. 1456.37 s [unordered-containers] +++ OK, passed 100 tests.
  17868. 1456.37 s [unordered-containers] valid: OK (1.09s)
  17869. 1456.37 s [unordered-containers] +++ OK, passed 100 tests.
  17870. 1456.37 s [unordered-containers] mapMaybe
  17871. 1456.37 s [unordered-containers] model: OK (0.31s)
  17872. 1456.37 s [unordered-containers] +++ OK, passed 100 tests.
  17873. 1456.37 s [unordered-containers] valid: OK (0.13s)
  17874. 1456.37 s [unordered-containers] +++ OK, passed 100 tests.
  17875. 1456.37 s [unordered-containers] mapMaybeWithKey
  17876. 1456.42 s [unordered-containers] model: OK (1.57s)
  17877. 1456.42 s [unordered-containers] +++ OK, passed 100 tests.
  17878. 1456.42 s [unordered-containers] valid: OK (0.97s)
  17879. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17880. 1456.43 s [unordered-containers] elems: OK (0.10s)
  17881. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17882. 1456.43 s [unordered-containers] keys: OK (0.11s)
  17883. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17884. 1456.43 s [unordered-containers] fromList
  17885. 1456.43 s [unordered-containers] model: OK (0.01s)
  17886. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17887. 1456.43 s [unordered-containers] valid: OK (0.05s)
  17888. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17889. 1456.43 s [unordered-containers] fromListWith
  17890. 1456.43 s [unordered-containers] model: OK (0.05s)
  17891. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17892. 1456.43 s [unordered-containers] valid: OK (0.09s)
  17893. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17894. 1456.43 s [unordered-containers] fromListWithKey
  17895. 1456.43 s [unordered-containers] model: OK (0.12s)
  17896. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17897. 1456.43 s [unordered-containers] valid: OK (0.16s)
  17898. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17899. 1456.43 s [unordered-containers] toList: OK (0.03s)
  17900. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17901. 1456.43 s [unordered-containers] Data.HashSet
  17902. 1456.43 s [unordered-containers] instances
  17903. 1456.43 s [unordered-containers] Eq
  17904. 1456.43 s [unordered-containers] ==: OK (0.09s)
  17905. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17906. 1456.43 s [unordered-containers] == permutations: OK (0.06s)
  17907. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17908. 1456.43 s [unordered-containers] /=: OK (0.05s)
  17909. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17910. 1456.43 s [unordered-containers] Ord
  17911. 1456.43 s [unordered-containers] compare reflexive: OK (0.03s)
  17912. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17913. 1456.43 s [unordered-containers] compare transitive: OK (0.06s)
  17914. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17915. 1456.43 s [unordered-containers] compare antisymmetric: OK (0.04s)
  17916. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17917. 1456.43 s [unordered-containers] Ord => Eq: OK (0.04s)
  17918. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17919. 1456.43 s [unordered-containers] Read/Show: OK (0.31s)
  17920. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17921. 1456.43 s [unordered-containers] Foldable: OK (0.02s)
  17922. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17923. 1456.43 s [unordered-containers] Hashable: OK (0.03s)
  17924. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17925. 1456.43 s [unordered-containers] size: OK (0.01s)
  17926. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17927. 1456.43 s [unordered-containers] member: OK (0.03s)
  17928. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17929. 1456.43 s [unordered-containers] insert: OK (0.01s)
  17930. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17931. 1456.43 s [unordered-containers] delete: OK (0.03s)
  17932. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17933. 1456.43 s [unordered-containers] union: OK (0.05s)
  17934. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17935. 1456.43 s [unordered-containers] map: OK (1.01s)
  17936. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17937. 1456.43 s [unordered-containers] foldr: OK (0.02s)
  17938. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17939. 1456.43 s [unordered-containers] foldl': OK (0.02s)
  17940. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17941. 1456.43 s [unordered-containers] filter: OK (0.95s)
  17942. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17943. 1456.43 s [unordered-containers] toList: OK (0.03s)
  17944. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17945. 1456.43 s [unordered-containers] Data.HashMap.Internal.List
  17946. 1456.43 s [unordered-containers] isPermutationBy: OK (0.04s)
  17947. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17948. 1456.43 s [unordered-containers] isPermutationBy of different length: OK (0.02s)
  17949. 1456.43 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  17950. 1456.43 s [unordered-containers] pUnorderedCompare: OK (0.07s)
  17951. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17952. 1456.43 s [unordered-containers] modelUnorderedCompare
  17953. 1456.43 s [unordered-containers] reflexive: OK (0.02s)
  17954. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17955. 1456.43 s [unordered-containers] anti-symmetric: OK
  17956. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17957. 1456.43 s [unordered-containers] transitive: OK (0.02s)
  17958. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17959. 1456.43 s [unordered-containers] Regression tests
  17960. 1456.43 s [unordered-containers] issue32: OK
  17961. 1456.43 s [unordered-containers] issue39a: OK
  17962. 1456.43 s [unordered-containers] issue39b: OK (0.02s)
  17963. 1456.43 s [unordered-containers] +++ OK, passed 100 tests.
  17964. 1456.43 s [unordered-containers] issue254 lazy: OK (0.02s)
  17965. 1456.43 s [unordered-containers] issue254 strict: OK
  17966. 1456.43 s [unordered-containers] issue379
  17967. 1456.43 s [unordered-containers] Lazy.unionWith: OK
  17968. 1456.43 s [unordered-containers] union: OK
  17969. 1456.43 s [unordered-containers] Strict.unionWith: OK
  17970. 1456.43 s [unordered-containers] Strict.unionWithKey: OK
  17971. 1456.43 s [unordered-containers] issue381
  17972. 1456.43 s [unordered-containers] mapMaybe: OK
  17973. 1456.43 s [unordered-containers] mapMaybeWithKey: OK
  17974. 1456.43 s [unordered-containers] issue382: OK
  17975. 1456.43 s [unordered-containers] issue383: OK
  17976. 1456.43 s [unordered-containers] issue420: OK
  17977. 1456.44 s [unordered-containers] issue491
  17978. 1456.44 s [unordered-containers] 1: OK
  17979. 1456.44 s [unordered-containers] 2: OK
  17980. 1456.44 s [unordered-containers] 3: OK
  17981. 1456.44 s [unordered-containers] Strictness
  17982. 1456.44 s [unordered-containers] HashMap.Strict
  17983. 1456.44 s [unordered-containers] singleton is key-strict: OK
  17984. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17985. 1456.44 s [unordered-containers] singleton is value-strict: OK
  17986. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17987. 1456.44 s [unordered-containers] member is key-strict: OK
  17988. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17989. 1456.44 s [unordered-containers] lookup is key-strict: OK
  17990. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17991. 1456.44 s [unordered-containers] lookupDefault is key-strict: OK
  17992. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17993. 1456.44 s [unordered-containers] findWithDefault is key-strict: OK
  17994. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17995. 1456.44 s [unordered-containers] ! is key-strict: OK
  17996. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17997. 1456.44 s [unordered-containers] delete is key-strict: OK
  17998. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  17999. 1456.44 s [unordered-containers] adjust is key-strict: OK
  18000. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18001. 1456.44 s [unordered-containers] adjust is value-strict: OK (0.01s)
  18002. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18003. 1456.44 s [unordered-containers] insert is key-strict: OK
  18004. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18005. 1456.44 s [unordered-containers] insert is value-strict: OK (0.01s)
  18006. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18007. 1456.44 s [unordered-containers] insertWith is key-strict: OK
  18008. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18009. 1456.44 s [unordered-containers] insertWith is value-strict: OK (0.01s)
  18010. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18011. 1456.44 s [unordered-containers] fromList is key-strict: OK
  18012. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18013. 1456.44 s [unordered-containers] fromList is value-strict: OK
  18014. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18015. 1456.44 s [unordered-containers] fromListWith is key-strict: OK
  18016. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18017. 1456.44 s [unordered-containers] fromListWith is value-strict: OK
  18018. 1456.44 s [unordered-containers] +++ OK, passed 100 tests.
  18019. 1456.44 s [unordered-containers]
  18020. 1456.44 s [unordered-containers] All 257 tests passed (2.37s)
  18021. 1456.45 s [unordered-containers] Test suite unordered-containers-tests: PASS
  18022. 1456.45 s [unordered-containers] Test suite logged to:
  18023. 1456.45 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  18024. 1456.46 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  18025. 1456.47 s [unordered-containers] Phase: haddockPhase
  18026. 1456.80 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  18027. 1456.82 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
  18028. 1456.96 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18029. 1457.36 s [unordered-containers]
  18030. 1457.36 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  18031. 1457.36 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  18032. 1457.36 s [unordered-containers] |
  18033. 1457.36 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  18034. 1457.36 s [unordered-containers] | ^^^^^^^^^^
  18035. 1458.39 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  18036. 1458.39 s [unordered-containers] Missing documentation for:
  18037. 1458.39 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  18038. 1458.39 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  18039. 1458.39 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:207)
  18040. 1458.39 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:224)
  18041. 1458.39 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:228)
  18042. 1458.39 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:232)
  18043. 1458.39 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:241)
  18044. 1458.39 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:153)
  18045. 1458.39 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:161)
  18046. 1458.39 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:248)
  18047. 1458.39 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:254)
  18048. 1458.39 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:261)
  18049. 1458.39 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:273)
  18050. 1458.39 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:267)
  18051. 1458.39 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:139)
  18052. 1458.39 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:279)
  18053. 1458.39 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:285)
  18054. 1458.39 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:135)
  18055. 1458.39 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:291)
  18056. 1458.39 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:313)
  18057. 1458.39 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:403)
  18058. 1458.39 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:374)
  18059. 1458.39 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:393)
  18060. 1458.39 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:384)
  18061. 1458.40 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:416)
  18062. 1458.40 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:435)
  18063. 1458.40 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:460)
  18064. 1458.40 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:536)
  18065. 1458.40 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:552)
  18066. 1458.40 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:528)
  18067. 1458.40 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:493)
  18068. 1458.40 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:505)
  18069. 1458.58 s [unordered-containers]
  18070. 1458.58 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  18071. 1458.58 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  18072. 1458.58 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  18073. 1458.58 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  18074. 1458.58 s [unordered-containers] |
  18075. 1458.58 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  18076. 1458.58 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  18077. 1458.70 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  18078. 1458.70 s [unordered-containers] Missing documentation for:
  18079. 1458.70 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:39)
  18080. 1458.70 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:82)
  18081. 1458.70 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:67)
  18082. 1459.34 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  18083. 1459.34 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  18084. 1459.34 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  18085. 1459.34 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  18086. 1459.34 s [unordered-containers] by specifying the type/value namespace explicitly.
  18087. 1459.34 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  18088. 1459.36 s [unordered-containers] Warning: 'at' is out of scope.
  18089. 1459.36 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18090. 1459.39 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  18091. 1459.39 s [unordered-containers] Missing documentation for:
  18092. 1459.39 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  18093. 1459.39 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1858)
  18094. 1459.39 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2372)
  18095. 1459.39 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:512)
  18096. 1459.39 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:496)
  18097. 1459.39 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:679)
  18098. 1459.39 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  18099. 1459.39 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:661)
  18100. 1459.39 s [unordered-containers] insert' (Data/HashMap/Internal.hs:807)
  18101. 1459.39 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1125)
  18102. 1459.39 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:849)
  18103. 1459.39 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:884)
  18104. 1460.25 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  18105. 1460.25 s [unordered-containers] Missing documentation for:
  18106. 1460.25 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:97)
  18107. 1460.25 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  18108. 1460.25 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  18109. 1460.35 s [unordered-containers] Warning: 'lookup' is out of scope.
  18110. 1460.35 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18111. 1460.35 s [unordered-containers] Warning: 'at' is out of scope.
  18112. 1460.35 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18113. 1460.36 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  18114. 1460.55 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  18115. 1460.60 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  18116. 1460.61 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  18117. 1460.61 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  18118. 1466.48 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  18119. 1466.48 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  18120. 1466.54 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  18121. 1466.56 s [unordered-containers] Phase: installPhase
  18122. 1466.63 s [unordered-containers] Installing library in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18123. 1467.02 s [unordered-containers] Phase: fixupPhase
  18124. 1467.04 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18125. 1467.05 s [unordered-containers] shrinking /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSunordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM-ghc9.6.7.so
  18126. 1467.06 s [unordered-containers] checking for references to /build/ in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1...
  18127. 1467.09 s [unordered-containers] patching script interpreter paths in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18128. 1467.10 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib
  18129. 1467.28 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc
  18130. 1467.29 s [unordered-containers] checking for references to /build/ in /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc...
  18131. 1467.32 s [unordered-containers] patching script interpreter paths in /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc
  18132. 1467.46 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18133. 1467.95 s [unordered-containers:post-build] Nothing to push - all store paths are already on Cachix.
  18134. 1467.98 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18135. 1468.06 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18136. 1468.17 s [unordered-containers:post-build] copying 1 paths...
  18137. 1468.17 s [unordered-containers:post-build] copying path '/nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  18138. 1471.12 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18139. 1471.23 s [unordered-containers:post-build] copying 0 paths...
  18140. 1471.26 s Progress: 19 of 33 built (1 building), 341 of 341 downloaded from cache
  18141. 1471.32 s Building /nix/store/mhwhijz5wvy4bhp1z51p2l6vbhw1cfkk-quickcheck-instances-0.3.33.drv
  18142. 1471.32 s [haskell-language-server] Preprocessing library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
  18143. 1471.32 s [haskell-language-server] Building library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0..
  18144. 1471.32 s [haskell-language-server]
  18145. 1471.32 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  18146. 1471.32 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  18147. 1471.32 s [haskell-language-server] but were not needed for compilation:
  18148. 1471.32 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
  18149. 1471.32 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)
  18150. 1471.32 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.dyn_o )
  18151. 1471.35 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.dyn_o )
  18152. 1471.48 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  18153. 1471.49 s [quickcheck-instances] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  18154. 1471.76 s [quickcheck-instances] Phase: unpackPhase
  18155. 1471.76 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  18156. 1471.77 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  18157. 1471.78 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  18158. 1471.79 s [quickcheck-instances] Phase: patchPhase
  18159. 1471.79 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  18160. 1471.80 s [quickcheck-instances] Phase: compileBuildDriverPhase
  18161. 1471.81 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.eUVlMA4jM6/setup-package.conf.d -threaded
  18162. 1471.90 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.eUVlMA4jM6/Main.o )
  18163. 1471.98 s [quickcheck-instances] [2 of 2] Linking Setup
  18164. 1473.71 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  18165. 1473.72 s [quickcheck-instances] Phase: configurePhase
  18166. 1473.73 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.eUVlMA4jM6/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18167. 1473.74 s [quickcheck-instances] Using Parsec parser
  18168. 1473.74 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  18169. 1474.19 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  18170. 1474.19 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  18171. 1474.19 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  18172. 1474.19 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.18.3.0
  18173. 1474.19 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.4
  18174. 1474.19 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  18175. 1474.19 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.7
  18176. 1474.19 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  18177. 1474.19 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  18178. 1474.19 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  18179. 1474.19 s [quickcheck-instances] integer-logarithms-1.0.4
  18180. 1474.19 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  18181. 1474.19 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  18182. 1474.19 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  18183. 1474.19 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  18184. 1474.19 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  18185. 1474.19 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  18186. 1474.19 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  18187. 1474.19 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  18188. 1474.19 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  18189. 1474.19 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  18190. 1474.19 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  18191. 1474.19 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  18192. 1474.19 s [quickcheck-instances] unordered-containers-0.2.20.1
  18193. 1474.19 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  18194. 1474.19 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  18195. 1474.19 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  18196. 1474.19 s [quickcheck-instances] Dependency base: using base-4.18.3.0
  18197. 1474.19 s [quickcheck-instances] Dependency containers: using containers-0.6.7
  18198. 1474.20 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  18199. 1474.20 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  18200. 1474.20 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  18201. 1474.20 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  18202. 1474.65 s [quickcheck-instances] Source component graph:
  18203. 1474.65 s [quickcheck-instances] component lib
  18204. 1474.65 s [quickcheck-instances] component test:self-test dependency lib
  18205. 1474.65 s [quickcheck-instances] Configured component graph:
  18206. 1474.65 s [quickcheck-instances] component quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18207. 1474.65 s [quickcheck-instances] include OneTuple-0.4.2-E6LMDiDR57u1sdMFWqvEaZ
  18208. 1474.65 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18209. 1474.65 s [quickcheck-instances] include array-0.5.8.0
  18210. 1474.65 s [quickcheck-instances] include base-4.18.3.0
  18211. 1474.65 s [quickcheck-instances] include bytestring-0.11.5.4
  18212. 1474.65 s [quickcheck-instances] include case-insensitive-1.2.1.0-GWWJ6ZWVp6tA7ngBCihzBU
  18213. 1474.65 s [quickcheck-instances] include containers-0.6.7
  18214. 1474.65 s [quickcheck-instances] include data-fix-0.3.4-AcAPhugfrDwIDrYImKkD5s
  18215. 1474.66 s [quickcheck-instances] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  18216. 1474.66 s [quickcheck-instances] include integer-logarithms-1.0.4-Kqj40tLB9M5QvuRzlkGw5
  18217. 1474.66 s [quickcheck-instances] include old-time-1.1.0.4-7AzLy2qj38ABPDdVX4FG2O
  18218. 1474.66 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18219. 1474.66 s [quickcheck-instances] include scientific-0.3.8.0-FOrGyw7jA1i5To2VDVtr2u
  18220. 1474.66 s [quickcheck-instances] include splitmix-0.1.3.1-JNqGhIvJBLcIrlYC1TgNv5
  18221. 1474.66 s [quickcheck-instances] include strict-0.5.1-BVr8qLht12993kusR3GXIV
  18222. 1474.66 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18223. 1474.66 s [quickcheck-instances] include text-2.0.2
  18224. 1474.66 s [quickcheck-instances] include text-short-0.1.6-ClzZv9zBabOFPQm5gd1kWn
  18225. 1474.66 s [quickcheck-instances] include these-1.2.1-JLGGsXaGNeM2KSRfWwKtkj
  18226. 1474.66 s [quickcheck-instances] include time-compat-1.9.8-CD8fmPidPr6BzOD9ykPsxD
  18227. 1474.66 s [quickcheck-instances] include transformers-0.6.1.0
  18228. 1474.66 s [quickcheck-instances] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18229. 1474.66 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18230. 1474.66 s [quickcheck-instances] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  18231. 1474.66 s [quickcheck-instances] component quickcheck-instances-0.3.33-Hfj2WsaCXK7JsuTXgkyNSA-self-test
  18232. 1474.66 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18233. 1474.66 s [quickcheck-instances] include base-4.18.3.0
  18234. 1474.66 s [quickcheck-instances] include containers-0.6.7
  18235. 1474.66 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18236. 1474.66 s [quickcheck-instances] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18237. 1474.66 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18238. 1474.66 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18239. 1474.66 s [quickcheck-instances] Linked component graph:
  18240. 1474.66 s [quickcheck-instances] unit quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18241. 1474.66 s [quickcheck-instances] include OneTuple-0.4.2-E6LMDiDR57u1sdMFWqvEaZ
  18242. 1474.66 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18243. 1474.66 s [quickcheck-instances] include array-0.5.8.0
  18244. 1474.66 s [quickcheck-instances] include base-4.18.3.0
  18245. 1474.66 s [quickcheck-instances] include bytestring-0.11.5.4
  18246. 1474.66 s [quickcheck-instances] include case-insensitive-1.2.1.0-GWWJ6ZWVp6tA7ngBCihzBU
  18247. 1474.66 s [quickcheck-instances] include containers-0.6.7
  18248. 1474.66 s [quickcheck-instances] include data-fix-0.3.4-AcAPhugfrDwIDrYImKkD5s
  18249. 1474.66 s [quickcheck-instances] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  18250. 1474.66 s [quickcheck-instances] include integer-logarithms-1.0.4-Kqj40tLB9M5QvuRzlkGw5
  18251. 1474.66 s [quickcheck-instances] include old-time-1.1.0.4-7AzLy2qj38ABPDdVX4FG2O
  18252. 1474.66 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18253. 1474.66 s [quickcheck-instances] include scientific-0.3.8.0-FOrGyw7jA1i5To2VDVtr2u
  18254. 1474.66 s [quickcheck-instances] include splitmix-0.1.3.1-JNqGhIvJBLcIrlYC1TgNv5
  18255. 1474.66 s [quickcheck-instances] include strict-0.5.1-BVr8qLht12993kusR3GXIV
  18256. 1474.66 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18257. 1474.66 s [quickcheck-instances] include text-2.0.2
  18258. 1474.66 s [quickcheck-instances] include text-short-0.1.6-ClzZv9zBabOFPQm5gd1kWn
  18259. 1474.66 s [quickcheck-instances] include these-1.2.1-JLGGsXaGNeM2KSRfWwKtkj
  18260. 1474.66 s [quickcheck-instances] include time-compat-1.9.8-CD8fmPidPr6BzOD9ykPsxD
  18261. 1474.66 s [quickcheck-instances] include transformers-0.6.1.0
  18262. 1474.66 s [quickcheck-instances] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18263. 1474.66 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18264. 1474.66 s [quickcheck-instances] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  18265. 1474.66 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Void
  18266. 1474.66 s [quickcheck-instances] unit quickcheck-instances-0.3.33-Hfj2WsaCXK7JsuTXgkyNSA-self-test
  18267. 1474.66 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18268. 1474.66 s [quickcheck-instances] include base-4.18.3.0
  18269. 1474.66 s [quickcheck-instances] include containers-0.6.7
  18270. 1474.66 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18271. 1474.66 s [quickcheck-instances] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18272. 1474.66 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18273. 1474.66 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18274. 1474.66 s [quickcheck-instances] Ready component graph:
  18275. 1474.66 s [quickcheck-instances] definite quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18276. 1474.66 s [quickcheck-instances] depends OneTuple-0.4.2-E6LMDiDR57u1sdMFWqvEaZ
  18277. 1474.66 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18278. 1474.66 s [quickcheck-instances] depends array-0.5.8.0
  18279. 1474.66 s [quickcheck-instances] depends base-4.18.3.0
  18280. 1474.66 s [quickcheck-instances] depends bytestring-0.11.5.4
  18281. 1474.66 s [quickcheck-instances] depends case-insensitive-1.2.1.0-GWWJ6ZWVp6tA7ngBCihzBU
  18282. 1474.66 s [quickcheck-instances] depends containers-0.6.7
  18283. 1474.66 s [quickcheck-instances] depends data-fix-0.3.4-AcAPhugfrDwIDrYImKkD5s
  18284. 1474.66 s [quickcheck-instances] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  18285. 1474.66 s [quickcheck-instances] depends integer-logarithms-1.0.4-Kqj40tLB9M5QvuRzlkGw5
  18286. 1474.66 s [quickcheck-instances] depends old-time-1.1.0.4-7AzLy2qj38ABPDdVX4FG2O
  18287. 1474.66 s [quickcheck-instances] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18288. 1474.66 s [quickcheck-instances] depends scientific-0.3.8.0-FOrGyw7jA1i5To2VDVtr2u
  18289. 1474.66 s [quickcheck-instances] depends splitmix-0.1.3.1-JNqGhIvJBLcIrlYC1TgNv5
  18290. 1474.66 s [quickcheck-instances] depends strict-0.5.1-BVr8qLht12993kusR3GXIV
  18291. 1474.66 s [quickcheck-instances] depends tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18292. 1474.66 s [quickcheck-instances] depends text-2.0.2
  18293. 1474.66 s [quickcheck-instances] depends text-short-0.1.6-ClzZv9zBabOFPQm5gd1kWn
  18294. 1474.66 s [quickcheck-instances] depends these-1.2.1-JLGGsXaGNeM2KSRfWwKtkj
  18295. 1474.66 s [quickcheck-instances] depends time-compat-1.9.8-CD8fmPidPr6BzOD9ykPsxD
  18296. 1474.66 s [quickcheck-instances] depends transformers-0.6.1.0
  18297. 1474.66 s [quickcheck-instances] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18298. 1474.66 s [quickcheck-instances] depends uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18299. 1474.66 s [quickcheck-instances] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  18300. 1474.66 s [quickcheck-instances] definite quickcheck-instances-0.3.33-Hfj2WsaCXK7JsuTXgkyNSA-self-test
  18301. 1474.66 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18302. 1474.66 s [quickcheck-instances] depends base-4.18.3.0
  18303. 1474.66 s [quickcheck-instances] depends containers-0.6.7
  18304. 1474.66 s [quickcheck-instances] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18305. 1474.66 s [quickcheck-instances] depends quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18306. 1474.68 s [quickcheck-instances] depends tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18307. 1474.68 s [quickcheck-instances] depends uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18308. 1474.68 s [quickcheck-instances] Using Cabal-3.10.3.0 compiled by ghc-9.6
  18309. 1474.68 s [quickcheck-instances] Using compiler: ghc-9.6.7
  18310. 1474.68 s [quickcheck-instances] Using install prefix:
  18311. 1474.68 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33
  18312. 1474.68 s [quickcheck-instances] Executables installed in:
  18313. 1474.68 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/bin
  18314. 1474.68 s [quickcheck-instances] Libraries installed in:
  18315. 1474.68 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18316. 1474.68 s [quickcheck-instances] Dynamic Libraries installed in:
  18317. 1474.68 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  18318. 1474.68 s [quickcheck-instances] Private executables installed in:
  18319. 1474.68 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33
  18320. 1474.68 s [quickcheck-instances] Data files installed in:
  18321. 1474.68 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33
  18322. 1474.68 s [quickcheck-instances] Documentation installed in:
  18323. 1474.68 s [quickcheck-instances] /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  18324. 1474.68 s [quickcheck-instances] Configuration files installed in:
  18325. 1474.68 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/etc
  18326. 1474.68 s [quickcheck-instances] No alex found
  18327. 1474.68 s [quickcheck-instances] Using ar found on system at:
  18328. 1474.68 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18329. 1474.68 s [quickcheck-instances] No c2hs found
  18330. 1474.68 s [quickcheck-instances] No cpphs found
  18331. 1474.68 s [quickcheck-instances] No doctest found
  18332. 1474.68 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  18333. 1474.68 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18334. 1474.68 s [quickcheck-instances] Using ghc version 9.6.7 found on system at:
  18335. 1474.68 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  18336. 1474.68 s [quickcheck-instances] Using ghc-pkg version 9.6.7 found on system at:
  18337. 1474.68 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  18338. 1474.68 s [quickcheck-instances] No ghcjs found
  18339. 1474.68 s [quickcheck-instances] No ghcjs-pkg found
  18340. 1474.68 s [quickcheck-instances] No greencard found
  18341. 1474.68 s [quickcheck-instances] Using haddock version 2.29.2 found on system at:
  18342. 1474.68 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  18343. 1474.68 s [quickcheck-instances] No happy found
  18344. 1474.68 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  18345. 1474.68 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18346. 1474.68 s [quickcheck-instances] No hmake found
  18347. 1474.68 s [quickcheck-instances] Using hpc version 0.68 found on system at:
  18348. 1474.68 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  18349. 1474.68 s [quickcheck-instances] Using hsc2hs version 0.68.9 found on system at:
  18350. 1474.68 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  18351. 1474.68 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  18352. 1474.68 s [quickcheck-instances] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  18353. 1474.68 s [quickcheck-instances] No jhc found
  18354. 1474.68 s [quickcheck-instances] Using ld found on system at:
  18355. 1474.68 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18356. 1474.68 s [quickcheck-instances] No pkg-config found
  18357. 1474.68 s [quickcheck-instances] Using runghc version 9.6.7 found on system at:
  18358. 1474.68 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  18359. 1474.68 s [quickcheck-instances] Using strip version 2.44 found on system at:
  18360. 1474.68 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18361. 1474.68 s [quickcheck-instances] Using tar found on system at:
  18362. 1474.68 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18363. 1474.68 s [quickcheck-instances] No uhc found
  18364. 1474.96 s [quickcheck-instances] Phase: buildPhase
  18365. 1475.06 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18366. 1475.07 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33..
  18367. 1475.27 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 )
  18368. 1475.33 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 )
  18369. 1476.15 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 )
  18370. 1476.28 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 )
  18371. 1476.28 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 )
  18372. 1476.45 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 )
  18373. 1476.45 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 )
  18374. 1476.45 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 )
  18375. 1476.45 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 )
  18376. 1476.45 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 )
  18377. 1476.45 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 )
  18378. 1476.45 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 )
  18379. 1476.45 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 )
  18380. 1476.45 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 )
  18381. 1476.45 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 )
  18382. 1476.45 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 )
  18383. 1476.45 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 )
  18384. 1476.47 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 )
  18385. 1476.47 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 )
  18386. 1476.47 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 )
  18387. 1477.07 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 )
  18388. 1477.10 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 )
  18389. 1477.10 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 )
  18390. 1477.10 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 )
  18391. 1477.10 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 )
  18392. 1477.10 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 )
  18393. 1477.43 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 )
  18394. 1477.62 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 )
  18395. 1477.63 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 )
  18396. 1478.06 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 )
  18397. 1478.41 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 )
  18398. 1478.41 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 )
  18399. 1478.41 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 )
  18400. 1478.41 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 )
  18401. 1478.42 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 )
  18402. 1478.42 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 )
  18403. 1478.42 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 )
  18404. 1478.42 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 )
  18405. 1478.42 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 )
  18406. 1478.42 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 )
  18407. 1478.42 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 )
  18408. 1478.48 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 )
  18409. 1478.48 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 )
  18410. 1478.48 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 )
  18411. 1478.48 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 )
  18412. 1478.61 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 )
  18413. 1478.92 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 )
  18414. 1478.92 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 )
  18415. 1478.92 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 )
  18416. 1478.92 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 )
  18417. 1478.93 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 )
  18418. 1478.93 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  18419. 1480.82 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18420. 1480.82 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
  18421. 1480.90 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  18422. 1481.24 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  18423. 1482.18 s [quickcheck-instances] Phase: checkPhase
  18424. 1482.21 s [quickcheck-instances] Running 1 test suites...
  18425. 1482.21 s [quickcheck-instances] Test suite self-test: RUNNING...
  18426. 1482.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  18427. 1482.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  18428. 1482.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  18429. 1482.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  18430. 1482.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  18431. 1482.23 s [quickcheck-instances] Test suite self-test: PASS
  18432. 1482.23 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  18433. 1482.23 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  18434. 1482.24 s [quickcheck-instances] Phase: haddockPhase
  18435. 1482.39 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18436. 1482.41 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
  18437. 1482.42 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  18438. 1482.42 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  18439. 1482.47 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18440. 1482.71 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  18441. 1482.71 s [quickcheck-instances] Missing documentation for:
  18442. 1482.71 s [quickcheck-instances] Module header
  18443. 1482.89 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  18444. 1482.89 s [quickcheck-instances] Missing documentation for:
  18445. 1482.89 s [quickcheck-instances] Module header
  18446. 1482.94 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  18447. 1482.94 s [quickcheck-instances] Missing documentation for:
  18448. 1482.94 s [quickcheck-instances] Module header
  18449. 1482.98 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  18450. 1482.98 s [quickcheck-instances] Missing documentation for:
  18451. 1482.98 s [quickcheck-instances] Module header
  18452. 1482.99 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  18453. 1482.99 s [quickcheck-instances] Missing documentation for:
  18454. 1482.99 s [quickcheck-instances] Module header
  18455. 1483.00 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  18456. 1483.00 s [quickcheck-instances] Missing documentation for:
  18457. 1483.00 s [quickcheck-instances] Module header
  18458. 1483.01 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  18459. 1483.01 s [quickcheck-instances] Missing documentation for:
  18460. 1483.01 s [quickcheck-instances] Module header
  18461. 1483.03 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18462. 1483.03 s [quickcheck-instances] Missing documentation for:
  18463. 1483.03 s [quickcheck-instances] Module header
  18464. 1483.12 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18465. 1483.12 s [quickcheck-instances] Missing documentation for:
  18466. 1483.12 s [quickcheck-instances] Module header
  18467. 1483.12 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18468. 1483.12 s [quickcheck-instances] Missing documentation for:
  18469. 1483.12 s [quickcheck-instances] Module header
  18470. 1483.13 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18471. 1483.13 s [quickcheck-instances] Missing documentation for:
  18472. 1483.13 s [quickcheck-instances] Module header
  18473. 1483.25 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18474. 1483.25 s [quickcheck-instances] Missing documentation for:
  18475. 1483.25 s [quickcheck-instances] Module header
  18476. 1483.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18477. 1483.27 s [quickcheck-instances] Missing documentation for:
  18478. 1483.27 s [quickcheck-instances] Module header
  18479. 1483.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18480. 1483.30 s [quickcheck-instances] Missing documentation for:
  18481. 1483.30 s [quickcheck-instances] Module header
  18482. 1483.35 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18483. 1483.35 s [quickcheck-instances] Missing documentation for:
  18484. 1483.35 s [quickcheck-instances] Module header
  18485. 1483.36 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18486. 1483.36 s [quickcheck-instances] Missing documentation for:
  18487. 1483.36 s [quickcheck-instances] Module header
  18488. 1483.36 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18489. 1483.36 s [quickcheck-instances] Missing documentation for:
  18490. 1483.36 s [quickcheck-instances] Module header
  18491. 1483.37 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18492. 1483.37 s [quickcheck-instances] Missing documentation for:
  18493. 1483.37 s [quickcheck-instances] Module header
  18494. 1483.46 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18495. 1483.46 s [quickcheck-instances] Missing documentation for:
  18496. 1483.46 s [quickcheck-instances] Module header
  18497. 1483.53 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18498. 1483.53 s [quickcheck-instances] Missing documentation for:
  18499. 1483.53 s [quickcheck-instances] Module header
  18500. 1483.56 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18501. 1483.56 s [quickcheck-instances] Missing documentation for:
  18502. 1483.56 s [quickcheck-instances] Module header
  18503. 1483.58 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18504. 1483.58 s [quickcheck-instances] Missing documentation for:
  18505. 1483.58 s [quickcheck-instances] Module header
  18506. 1483.75 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18507. 1483.76 s [quickcheck-instances] Missing documentation for:
  18508. 1483.76 s [quickcheck-instances] Module header
  18509. 1483.78 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18510. 1483.78 s [quickcheck-instances] Missing documentation for:
  18511. 1483.78 s [quickcheck-instances] Module header
  18512. 1483.79 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18513. 1484.59 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18514. 1484.59 s [quickcheck-instances] - Data.Vector.Vector
  18515. 1484.59 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18516. 1484.59 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18517. 1484.59 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18518. 1484.59 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18519. 1484.59 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18520. 1489.06 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  18521. 1489.08 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18522. 1489.12 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18523. 1489.13 s [quickcheck-instances] Phase: installPhase
  18524. 1489.20 s [quickcheck-instances] Installing library in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18525. 1489.44 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.dyn_o )
  18526. 1489.44 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.dyn_o )
  18527. 1489.44 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.dyn_o )
  18528. 1489.54 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.dyn_o )
  18529. 1489.75 s [quickcheck-instances] Phase: fixupPhase
  18530. 1489.77 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33
  18531. 1489.77 s [quickcheck-instances] shrinking /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSquickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG-ghc9.6.7.so
  18532. 1489.81 s [quickcheck-instances] checking for references to /build/ in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33...
  18533. 1489.84 s [quickcheck-instances] patching script interpreter paths in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33
  18534. 1489.85 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib
  18535. 1490.04 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18536. 1490.06 s [quickcheck-instances] checking for references to /build/ in /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc...
  18537. 1490.08 s [quickcheck-instances] patching script interpreter paths in /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18538. 1490.20 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33 /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18539. 1490.59 s [quickcheck-instances:post-build] Nothing to push - all store paths are already on Cachix.
  18540. 1490.61 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33 /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18541. 1490.69 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18542. 1490.73 s [quickcheck-instances:post-build] copying 1 paths...
  18543. 1490.73 s [quickcheck-instances:post-build] copying path '/nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18544. 1492.40 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18545. 1492.50 s [quickcheck-instances:post-build] copying 0 paths...
  18546. 1492.52 s Progress: 20 of 32 built (1 building), 341 of 341 downloaded from cache
  18547. 1492.57 s Building /nix/store/3rrsnsd4hgj7rn4hwa31j58wlp8sw3px-extra-1.8.1.drv
  18548. 1492.57 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.dyn_o )
  18549. 1492.57 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.dyn_o )
  18550. 1492.57 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.dyn_o )
  18551. 1492.57 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.dyn_o )
  18552. 1492.57 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.dyn_o )
  18553. 1492.57 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.dyn_o )
  18554. 1492.57 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.o, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.dyn_o )
  18555. 1492.73 s [extra] Phase: setupCompilerEnvironmentPhase
  18556. 1492.73 s [extra] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  18557. 1492.94 s [extra] Phase: unpackPhase
  18558. 1492.95 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18559. 1492.96 s [extra] source root is extra-1.8.1
  18560. 1492.96 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18561. 1492.97 s [extra] Phase: patchPhase
  18562. 1492.98 s [extra] Phase: compileBuildDriverPhase
  18563. 1492.98 s [extra] setupCompileFlags: -package-db=/build/tmp.S7uQQKKMkC/setup-package.conf.d -threaded
  18564. 1493.03 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.S7uQQKKMkC/Main.o )
  18565. 1493.09 s [extra] [2 of 2] Linking Setup
  18566. 1494.57 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18567. 1494.59 s [extra] Phase: configurePhase
  18568. 1494.59 s [extra] configureFlags: --verbose --prefix=/nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.S7uQQKKMkC/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18569. 1494.59 s [extra] Using Parsec parser
  18570. 1494.59 s [extra] Configuring extra-1.8.1...
  18571. 1494.95 s [extra] Dependency base >=4.9 && <5: using base-4.18.3.0
  18572. 1494.95 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18573. 1494.95 s [extra] Dependency directory: using directory-1.3.8.5
  18574. 1494.95 s [extra] Dependency filepath: using filepath-1.4.301.0
  18575. 1494.95 s [extra] Dependency process: using process-1.6.19.0
  18576. 1494.95 s [extra] Dependency time: using time-1.12.2
  18577. 1494.95 s [extra] Dependency unix: using unix-2.8.6.0
  18578. 1494.95 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18579. 1494.95 s [extra] Dependency base >=4 && <5: using base-4.18.3.0
  18580. 1494.96 s [extra] Dependency directory: using directory-1.3.8.5
  18581. 1494.96 s [extra] Dependency extra: using extra-1.8.1
  18582. 1494.96 s [extra] Dependency filepath: using filepath-1.4.301.0
  18583. 1494.96 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18584. 1494.96 s [extra] Dependency unix: using unix-2.8.6.0
  18585. 1495.30 s [extra] Source component graph:
  18586. 1495.30 s [extra] component lib
  18587. 1495.30 s [extra] component test:extra-test dependency lib
  18588. 1495.30 s [extra] Configured component graph:
  18589. 1495.30 s [extra] component extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18590. 1495.30 s [extra] include base-4.18.3.0
  18591. 1495.30 s [extra] include clock-0.8.4-H1jR5WrkMt9F2ejdYkzAGi
  18592. 1495.30 s [extra] include directory-1.3.8.5
  18593. 1495.30 s [extra] include filepath-1.4.301.0
  18594. 1495.30 s [extra] include process-1.6.19.0
  18595. 1495.30 s [extra] include time-1.12.2
  18596. 1495.30 s [extra] include unix-2.8.6.0
  18597. 1495.30 s [extra] component extra-1.8.1-If46t5tU3xvFUhIUlXGutj-extra-test
  18598. 1495.30 s [extra] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18599. 1495.30 s [extra] include base-4.18.3.0
  18600. 1495.30 s [extra] include directory-1.3.8.5
  18601. 1495.30 s [extra] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18602. 1495.30 s [extra] include filepath-1.4.301.0
  18603. 1495.30 s [extra] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18604. 1495.30 s [extra] include unix-2.8.6.0
  18605. 1495.30 s [extra] Linked component graph:
  18606. 1495.30 s [extra] unit extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18607. 1495.30 s [extra] include base-4.18.3.0
  18608. 1495.30 s [extra] include clock-0.8.4-H1jR5WrkMt9F2ejdYkzAGi
  18609. 1495.30 s [extra] include directory-1.3.8.5
  18610. 1495.30 s [extra] include filepath-1.4.301.0
  18611. 1495.30 s [extra] include process-1.6.19.0
  18612. 1495.30 s [extra] include time-1.12.2
  18613. 1495.30 s [extra] include unix-2.8.6.0
  18614. 1495.30 s [extra] Control.Concurrent.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Version.Extra,Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Extra,Numeric.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Numeric.Extra,System.Directory.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Environment.Extra,System.IO.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.IO.Extra,System.Info.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Info.Extra,System.Process.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Process.Extra,System.Time.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Time.Extra,Text.Read.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Text.Read.Extra
  18615. 1495.30 s [extra] unit extra-1.8.1-If46t5tU3xvFUhIUlXGutj-extra-test
  18616. 1495.30 s [extra] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18617. 1495.30 s [extra] include base-4.18.3.0
  18618. 1495.30 s [extra] include directory-1.3.8.5
  18619. 1495.30 s [extra] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18620. 1495.30 s [extra] include filepath-1.4.301.0
  18621. 1495.30 s [extra] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18622. 1495.30 s [extra] include unix-2.8.6.0
  18623. 1495.30 s [extra] Ready component graph:
  18624. 1495.30 s [extra] definite extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18625. 1495.30 s [extra] depends base-4.18.3.0
  18626. 1495.30 s [extra] depends clock-0.8.4-H1jR5WrkMt9F2ejdYkzAGi
  18627. 1495.30 s [extra] depends directory-1.3.8.5
  18628. 1495.30 s [extra] depends filepath-1.4.301.0
  18629. 1495.30 s [extra] depends process-1.6.19.0
  18630. 1495.30 s [extra] depends time-1.12.2
  18631. 1495.30 s [extra] depends unix-2.8.6.0
  18632. 1495.30 s [extra] definite extra-1.8.1-If46t5tU3xvFUhIUlXGutj-extra-test
  18633. 1495.30 s [extra] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18634. 1495.30 s [extra] depends base-4.18.3.0
  18635. 1495.30 s [extra] depends directory-1.3.8.5
  18636. 1495.30 s [extra] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18637. 1495.31 s [extra] depends filepath-1.4.301.0
  18638. 1495.31 s [extra] depends quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18639. 1495.31 s [extra] depends unix-2.8.6.0
  18640. 1495.31 s [extra] Using Cabal-3.10.3.0 compiled by ghc-9.6
  18641. 1495.31 s [extra] Using compiler: ghc-9.6.7
  18642. 1495.31 s [extra] Using install prefix: /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  18643. 1495.31 s [extra] Executables installed in:
  18644. 1495.31 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/bin
  18645. 1495.31 s [extra] Libraries installed in:
  18646. 1495.31 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18647. 1495.31 s [extra] Dynamic Libraries installed in:
  18648. 1495.31 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  18649. 1495.31 s [extra] Private executables installed in:
  18650. 1495.31 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/libexec/x86_64-linux-ghc-9.6.7/extra-1.8.1
  18651. 1495.31 s [extra] Data files installed in:
  18652. 1495.31 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/share/x86_64-linux-ghc-9.6.7/extra-1.8.1
  18653. 1495.31 s [extra] Documentation installed in:
  18654. 1495.31 s [extra] /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc/share/doc/extra-1.8.1
  18655. 1495.31 s [extra] Configuration files installed in:
  18656. 1495.31 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/etc
  18657. 1495.31 s [extra] No alex found
  18658. 1495.31 s [extra] Using ar found on system at:
  18659. 1495.31 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18660. 1495.31 s [extra] No c2hs found
  18661. 1495.31 s [extra] No cpphs found
  18662. 1495.31 s [extra] No doctest found
  18663. 1495.31 s [extra] Using gcc version 14.3.0 given by user at:
  18664. 1495.31 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18665. 1495.31 s [extra] Using ghc version 9.6.7 found on system at:
  18666. 1495.31 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  18667. 1495.31 s [extra] Using ghc-pkg version 9.6.7 found on system at:
  18668. 1495.31 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  18669. 1495.31 s [extra] No ghcjs found
  18670. 1495.31 s [extra] No ghcjs-pkg found
  18671. 1495.31 s [extra] No greencard found
  18672. 1495.31 s [extra] Using haddock version 2.29.2 found on system at:
  18673. 1495.31 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  18674. 1495.31 s [extra] No happy found
  18675. 1495.31 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18676. 1495.31 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18677. 1495.31 s [extra] No hmake found
  18678. 1495.31 s [extra] Using hpc version 0.68 found on system at:
  18679. 1495.31 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  18680. 1495.31 s [extra] Using hsc2hs version 0.68.9 found on system at:
  18681. 1495.31 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  18682. 1495.31 s [extra] Using hscolour version 1.25 found on system at:
  18683. 1495.31 s [extra] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  18684. 1495.31 s [extra] No jhc found
  18685. 1495.31 s [extra] Using ld found on system at:
  18686. 1495.31 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18687. 1495.31 s [extra] No pkg-config found
  18688. 1495.31 s [extra] Using runghc version 9.6.7 found on system at:
  18689. 1495.31 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  18690. 1495.31 s [extra] Using strip version 2.44 found on system at:
  18691. 1495.31 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18692. 1495.31 s [extra] Using tar found on system at:
  18693. 1495.31 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18694. 1495.31 s [extra] No uhc found
  18695. 1495.56 s [extra] Phase: buildPhase
  18696. 1495.64 s [extra] Preprocessing library for extra-1.8.1..
  18697. 1495.66 s [extra] Building library for extra-1.8.1..
  18698. 1496.04 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 )
  18699. 1496.16 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 )
  18700. 1496.16 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 )
  18701. 1496.19 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 )
  18702. 1496.19 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18703. 1496.19 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18704. 1496.19 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 )
  18705. 1497.54 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 )
  18706. 1498.60 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 )
  18707. 1498.61 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 )
  18708. 1498.61 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 )
  18709. 1498.61 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 )
  18710. 1498.94 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 )
  18711. 1499.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 )
  18712. 1499.23 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 )
  18713. 1499.23 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 )
  18714. 1499.23 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 )
  18715. 1499.41 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 )
  18716. 1499.42 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 )
  18717. 1499.47 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 )
  18718. 1499.47 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18719. 1499.57 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 )
  18720. 1499.99 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18721. 1500.20 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18722. 1500.21 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18723. 1500.29 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18724. 1500.29 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18725. 1500.29 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18726. 1500.29 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18727. 1501.56 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18728. 1501.56 s [haskell-language-server]
  18729. 1501.56 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  18730. 1501.56 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  18731. 1501.56 s [haskell-language-server] but were not needed for compilation:
  18732. 1501.56 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-6dPx05vuZtC98jWEy51OFC)
  18733. 1501.56 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-3pdXtU0qS4UJjhlyBOBCtM)
  18734. 1501.59 s [haskell-language-server] [ 1 of 13] Compiling Development.IDE.GHC.Compat.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Compat/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Compat/ExactPrint.p_o )
  18735. 1501.78 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18736. 1501.87 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18737. 1501.87 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18738. 1501.88 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18739. 1502.11 s [haskell-language-server] [ 2 of 13] Compiling Development.IDE.GHC.Dump ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/Dump.p_o )
  18740. 1502.32 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18741. 1502.57 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18742. 1502.89 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18743. 1502.89 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18744. 1502.89 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18745. 1503.16 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18746. 1503.16 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18747. 1503.35 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18748. 1503.35 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18749. 1503.53 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18750. 1504.55 s Waiting for lock on pandoc-cli
  18751. 1504.88 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  18752. 1504.88 s [extra] Building test suite 'extra-test' for extra-1.8.1..
  18753. 1504.98 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18754. 1505.43 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18755. 1507.57 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18756. 1507.57 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18757. 1507.94 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18758. 1508.92 s [extra] Phase: checkPhase
  18759. 1508.95 s [extra] Running 1 test suites...
  18760. 1508.95 s [extra] Test suite extra-test: RUNNING...
  18761. 1508.96 s [extra] withTempFile
  18762. 1508.96 s [extra] +++ OK, passed 100 tests.
  18763. 1508.96 s [extra] captureOutput
  18764. 1508.96 s [extra] +++ OK, passed 100 tests.
  18765. 1508.96 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18766. 1509.00 s [extra] +++ OK, passed 100 tests.
  18767. 1509.00 s [extra] \(x :: IO Int) -> join (once x) == x
  18768. 1509.04 s [extra] +++ OK, passed 100 tests.
  18769. 1509.04 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18770. 1509.07 s [extra] +++ OK, passed 100 tests.
  18771. 1509.07 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18772. 1509.11 s [extra] +++ OK, passed 100 tests.
  18773. 1509.11 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18774. 1509.15 s [extra] +++ OK, passed 100 tests.
  18775. 1509.15 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18776. 1509.18 s [extra] +++ OK, passed 100 tests.
  18777. 1509.18 s [extra] stringException "test" == pure "test"
  18778. 1509.18 s [extra] +++ OK, passed 100 tests.
  18779. 1509.18 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18780. 1509.18 s [extra] +++ OK, passed 100 tests.
  18781. 1509.18 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18782. 1509.18 s [extra] +++ OK, passed 100 tests.
  18783. 1509.18 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18784. 1509.18 s [extra] +++ OK, passed 100 tests.
  18785. 1509.18 s [extra] ignore (print 1) == print 1
  18786. 1509.18 s [extra] +++ OK, passed 100 tests.
  18787. 1509.18 s [extra] ignore (fail "die") == pure ()
  18788. 1509.18 s [extra] +++ OK, passed 100 tests.
  18789. 1509.18 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18790. 1509.18 s [extra] +++ OK, passed 100 tests.
  18791. 1509.18 s [extra] seq (errorIO "foo") (print 1) == print 1
  18792. 1509.18 s [extra] +++ OK, passed 100 tests.
  18793. 1509.18 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18794. 1509.18 s [extra] +++ OK, passed 100 tests.
  18795. 1509.18 s [extra] seq (assertIO False) (print 1) == print 1
  18796. 1509.18 s [extra] +++ OK, passed 100 tests.
  18797. 1509.18 s [extra] retry 1 (print "x") == print "x"
  18798. 1509.18 s [extra] +++ OK, passed 100 tests.
  18799. 1509.19 s [extra] retry 3 (fail "die") == fail "die"
  18800. 1509.19 s [extra] +++ OK, passed 100 tests.
  18801. 1509.19 s [extra] whenJust Nothing print == pure ()
  18802. 1509.19 s [extra] +++ OK, passed 100 tests.
  18803. 1509.19 s [extra] whenJust (Just 1) print == print 1
  18804. 1509.19 s [extra] +++ OK, passed 100 tests.
  18805. 1509.19 s [extra] pureIf @Maybe True 5 == Just 5
  18806. 1509.19 s [extra] +++ OK, passed 100 tests.
  18807. 1509.19 s [extra] pureIf @Maybe False 5 == Nothing
  18808. 1509.19 s [extra] +++ OK, passed 100 tests.
  18809. 1509.19 s [extra] pureIf @[] True 5 == [5]
  18810. 1509.19 s [extra] +++ OK, passed 100 tests.
  18811. 1509.19 s [extra] pureIf @[] False 5 == []
  18812. 1509.19 s [extra] +++ OK, passed 100 tests.
  18813. 1509.19 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18814. 1509.19 s [extra] +++ OK, passed 100 tests.
  18815. 1509.19 s [extra] whenMaybe False (print 1) == pure Nothing
  18816. 1509.19 s [extra] +++ OK, passed 100 tests.
  18817. 1509.19 s [extra] \(x :: Maybe ()) -> unit x == x
  18818. 1509.19 s [extra] +++ OK, passed 100 tests.
  18819. 1509.19 s [extra] guarded even 2 == [2]
  18820. 1509.19 s [extra] +++ OK, passed 100 tests.
  18821. 1509.19 s [extra] guarded odd 2 == Nothing
  18822. 1509.19 s [extra] +++ OK, passed 100 tests.
  18823. 1509.19 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18824. 1509.19 s [extra] +++ OK, passed 100 tests.
  18825. 1509.19 s [extra] guardedA (return . even) 42 == Just [42]
  18826. 1509.19 s [extra] +++ OK, passed 100 tests.
  18827. 1509.19 s [extra] guardedA (return . odd) 42 == Just []
  18828. 1509.19 s [extra] +++ OK, passed 100 tests.
  18829. 1509.19 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18830. 1509.19 s [extra] +++ OK, passed 100 tests.
  18831. 1509.19 s [extra] fold1M (\x y -> Just x) [] == undefined
  18832. 1509.19 s [extra] +++ OK, passed 100 tests.
  18833. 1509.19 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18834. 1509.19 s [extra] +++ OK, passed 100 tests.
  18835. 1509.20 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18836. 1509.20 s [extra] +++ OK, passed 100 tests.
  18837. 1509.20 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18838. 1509.20 s [extra] +++ OK, passed 100 tests.
  18839. 1509.20 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18840. 1509.20 s [extra] +++ OK, passed 100 tests.
  18841. 1509.20 s [extra] Just True ||^ undefined == Just True
  18842. 1509.20 s [extra] +++ OK, passed 100 tests.
  18843. 1509.20 s [extra] Just False ||^ Just True == Just True
  18844. 1509.20 s [extra] +++ OK, passed 100 tests.
  18845. 1509.20 s [extra] Just False ||^ Just False == Just False
  18846. 1509.20 s [extra] +++ OK, passed 100 tests.
  18847. 1509.20 s [extra] Just False &&^ undefined == Just False
  18848. 1509.20 s [extra] +++ OK, passed 100 tests.
  18849. 1509.20 s [extra] Just True &&^ Just True == Just True
  18850. 1509.20 s [extra] +++ OK, passed 100 tests.
  18851. 1509.20 s [extra] Just True &&^ Just False == Just False
  18852. 1509.20 s [extra] +++ OK, passed 100 tests.
  18853. 1509.20 s [extra] anyM Just [False,True ,undefined] == Just True
  18854. 1509.20 s [extra] +++ OK, passed 100 tests.
  18855. 1509.20 s [extra] anyM Just [False,False,undefined] == undefined
  18856. 1509.20 s [extra] +++ OK, passed 100 tests.
  18857. 1509.20 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18858. 1509.20 s [extra] +++ OK, passed 100 tests.
  18859. 1509.20 s [extra] allM Just [True,False,undefined] == Just False
  18860. 1509.20 s [extra] +++ OK, passed 100 tests.
  18861. 1509.20 s [extra] allM Just [True,True ,undefined] == undefined
  18862. 1509.20 s [extra] +++ OK, passed 100 tests.
  18863. 1509.20 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18864. 1509.20 s [extra] +++ OK, passed 100 tests.
  18865. 1509.20 s [extra] orM [Just False,Just True ,undefined] == Just True
  18866. 1509.20 s [extra] +++ OK, passed 100 tests.
  18867. 1509.20 s [extra] orM [Just False,Just False,undefined] == undefined
  18868. 1509.20 s [extra] +++ OK, passed 100 tests.
  18869. 1509.20 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18870. 1509.20 s [extra] +++ OK, passed 100 tests.
  18871. 1509.20 s [extra] andM [Just True,Just False,undefined] == Just False
  18872. 1509.20 s [extra] +++ OK, passed 100 tests.
  18873. 1509.20 s [extra] andM [Just True,Just True ,undefined] == undefined
  18874. 1509.20 s [extra] +++ OK, passed 100 tests.
  18875. 1509.20 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18876. 1509.20 s [extra] +++ OK, passed 100 tests.
  18877. 1509.20 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18878. 1509.20 s [extra] +++ OK, passed 100 tests.
  18879. 1509.20 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18880. 1509.20 s [extra] +++ OK, passed 100 tests.
  18881. 1509.20 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18882. 1509.20 s [extra] +++ OK, passed 100 tests.
  18883. 1509.20 s [extra] fromLeft 1 (Left 3) == 3
  18884. 1509.20 s [extra] +++ OK, passed 100 tests.
  18885. 1509.20 s [extra] fromLeft 1 (Right "foo") == 1
  18886. 1509.20 s [extra] +++ OK, passed 100 tests.
  18887. 1509.20 s [extra] fromRight 1 (Right 3) == 3
  18888. 1509.20 s [extra] +++ OK, passed 100 tests.
  18889. 1509.20 s [extra] fromRight 1 (Left "foo") == 1
  18890. 1509.20 s [extra] +++ OK, passed 100 tests.
  18891. 1509.20 s [extra] \x -> fromLeft' (Left x) == x
  18892. 1509.20 s [extra] +++ OK, passed 100 tests.
  18893. 1509.20 s [extra] \x -> fromLeft' (Right x) == undefined
  18894. 1509.20 s [extra] +++ OK, passed 100 tests.
  18895. 1509.20 s [extra] \x -> fromRight' (Right x) == x
  18896. 1509.20 s [extra] +++ OK, passed 100 tests.
  18897. 1509.20 s [extra] \x -> fromRight' (Left x) == undefined
  18898. 1509.20 s [extra] +++ OK, passed 100 tests.
  18899. 1509.20 s [extra] \x -> fromEither (Left x ) == x
  18900. 1509.20 s [extra] +++ OK, passed 100 tests.
  18901. 1509.20 s [extra] \x -> fromEither (Right x) == x
  18902. 1509.20 s [extra] +++ OK, passed 100 tests.
  18903. 1509.20 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18904. 1509.20 s [extra] +++ OK, passed 100 tests.
  18905. 1509.20 s [extra] \a -> maybeToEither a Nothing == Left a
  18906. 1509.20 s [extra] +++ OK, passed 100 tests.
  18907. 1509.20 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18908. 1509.20 s [extra] +++ OK, passed 100 tests.
  18909. 1509.20 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18910. 1509.20 s [extra] +++ OK, passed 100 tests.
  18911. 1509.20 s [extra] mapLeft show (Left 1) == Left "1"
  18912. 1509.20 s [extra] +++ OK, passed 100 tests.
  18913. 1509.20 s [extra] mapLeft show (Right True) == Right True
  18914. 1509.21 s [extra] +++ OK, passed 100 tests.
  18915. 1509.21 s [extra] mapRight show (Left 1) == Left 1
  18916. 1509.21 s [extra] +++ OK, passed 100 tests.
  18917. 1509.21 s [extra] mapRight show (Right True) == Right "True"
  18918. 1509.21 s [extra] +++ OK, passed 100 tests.
  18919. 1509.21 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18920. 1509.21 s [extra] +++ OK, passed 100 tests.
  18921. 1509.21 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18922. 1509.21 s [extra] +++ OK, passed 100 tests.
  18923. 1509.21 s [extra] \xs -> repeatedly line1 xs == lines xs
  18924. 1509.21 s [extra] +++ OK, passed 100 tests.
  18925. 1509.21 s [extra] disjoint [1,2,3] [4,5] == True
  18926. 1509.21 s [extra] +++ OK, passed 100 tests.
  18927. 1509.21 s [extra] disjoint [1,2,3] [4,1] == False
  18928. 1509.21 s [extra] +++ OK, passed 100 tests.
  18929. 1509.21 s [extra] disjointOrd [1,2,3] [4,5] == True
  18930. 1509.21 s [extra] +++ OK, passed 100 tests.
  18931. 1509.21 s [extra] disjointOrd [1,2,3] [4,1] == False
  18932. 1509.21 s [extra] +++ OK, passed 100 tests.
  18933. 1509.21 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18934. 1509.21 s [extra] +++ OK, passed 100 tests.
  18935. 1509.21 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18936. 1509.21 s [extra] +++ OK, passed 100 tests.
  18937. 1509.21 s [extra] anySame [1,1,2] == True
  18938. 1509.21 s [extra] +++ OK, passed 100 tests.
  18939. 1509.21 s [extra] anySame [1,2,3] == False
  18940. 1509.21 s [extra] +++ OK, passed 100 tests.
  18941. 1509.21 s [extra] anySame (1:2:1:undefined) == True
  18942. 1509.21 s [extra] +++ OK, passed 100 tests.
  18943. 1509.21 s [extra] anySame [] == False
  18944. 1509.21 s [extra] +++ OK, passed 100 tests.
  18945. 1509.21 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18946. 1509.21 s [extra] +++ OK, passed 100 tests.
  18947. 1509.21 s [extra] allSame [1,1,2] == False
  18948. 1509.21 s [extra] +++ OK, passed 100 tests.
  18949. 1509.21 s [extra] allSame [1,1,1] == True
  18950. 1509.21 s [extra] +++ OK, passed 100 tests.
  18951. 1509.21 s [extra] allSame [1] == True
  18952. 1509.21 s [extra] +++ OK, passed 100 tests.
  18953. 1509.21 s [extra] allSame [] == True
  18954. 1509.21 s [extra] +++ OK, passed 100 tests.
  18955. 1509.21 s [extra] allSame (1:1:2:undefined) == False
  18956. 1509.21 s [extra] +++ OK, passed 100 tests.
  18957. 1509.21 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18958. 1509.21 s [extra] +++ OK, passed 100 tests.
  18959. 1509.21 s [extra] headDef 1 [] == 1
  18960. 1509.21 s [extra] +++ OK, passed 100 tests.
  18961. 1509.21 s [extra] headDef 1 [2,3,4] == 2
  18962. 1509.21 s [extra] +++ OK, passed 100 tests.
  18963. 1509.21 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18964. 1509.21 s [extra] +++ OK, passed 100 tests.
  18965. 1509.21 s [extra] lastDef 1 [] == 1
  18966. 1509.21 s [extra] +++ OK, passed 100 tests.
  18967. 1509.21 s [extra] lastDef 1 [2,3,4] == 4
  18968. 1509.21 s [extra] +++ OK, passed 100 tests.
  18969. 1509.21 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18970. 1509.21 s [extra] +++ OK, passed 100 tests.
  18971. 1509.21 s [extra] [2,3,4] !? 1 == Just 3
  18972. 1509.21 s [extra] +++ OK, passed 100 tests.
  18973. 1509.21 s [extra] [2,3,4] !? (-1) == Nothing
  18974. 1509.21 s [extra] +++ OK, passed 100 tests.
  18975. 1509.21 s [extra] [] !? 0 == Nothing
  18976. 1509.21 s [extra] +++ OK, passed 100 tests.
  18977. 1509.21 s [extra] notNull [] == False
  18978. 1509.21 s [extra] +++ OK, passed 100 tests.
  18979. 1509.21 s [extra] notNull [1] == True
  18980. 1509.21 s [extra] +++ OK, passed 100 tests.
  18981. 1509.21 s [extra] \xs -> notNull xs == not (null xs)
  18982. 1509.21 s [extra] +++ OK, passed 100 tests.
  18983. 1509.21 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18984. 1509.21 s [extra] +++ OK, passed 100 tests.
  18985. 1509.21 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18986. 1509.21 s [extra] +++ OK, passed 100 tests.
  18987. 1509.21 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  18988. 1509.21 s [extra] +++ OK, passed 100 tests.
  18989. 1509.21 s [extra] unsnoc "test" == Just ("tes",'t')
  18990. 1509.21 s [extra] +++ OK, passed 100 tests.
  18991. 1509.21 s [extra] unsnoc "" == Nothing
  18992. 1509.21 s [extra] +++ OK, passed 100 tests.
  18993. 1509.21 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  18994. 1509.22 s [extra] +++ OK, passed 100 tests.
  18995. 1509.22 s [extra] cons 't' "est" == "test"
  18996. 1509.22 s [extra] +++ OK, passed 100 tests.
  18997. 1509.22 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  18998. 1509.22 s [extra] +++ OK, passed 100 tests.
  18999. 1509.22 s [extra] snoc "tes" 't' == "test"
  19000. 1509.22 s [extra] +++ OK, passed 100 tests.
  19001. 1509.22 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  19002. 1509.22 s [extra] +++ OK, passed 100 tests.
  19003. 1509.22 s [extra] enumerate == [False, True]
  19004. 1509.22 s [extra] +++ OK, passed 100 tests.
  19005. 1509.22 s [extra] takeEnd 3 "hello" == "llo"
  19006. 1509.22 s [extra] +++ OK, passed 100 tests.
  19007. 1509.22 s [extra] takeEnd 5 "bye" == "bye"
  19008. 1509.22 s [extra] +++ OK, passed 100 tests.
  19009. 1509.22 s [extra] takeEnd (-1) "bye" == ""
  19010. 1509.22 s [extra] +++ OK, passed 100 tests.
  19011. 1509.22 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  19012. 1509.22 s [extra] +++ OK, passed 100 tests.
  19013. 1509.22 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  19014. 1509.22 s [extra] +++ OK, passed 100 tests.
  19015. 1509.22 s [extra] dropEnd 3 "hello" == "he"
  19016. 1509.22 s [extra] +++ OK, passed 100 tests.
  19017. 1509.22 s [extra] dropEnd 5 "bye" == ""
  19018. 1509.22 s [extra] +++ OK, passed 100 tests.
  19019. 1509.22 s [extra] dropEnd (-1) "bye" == "bye"
  19020. 1509.22 s [extra] +++ OK, passed 100 tests.
  19021. 1509.22 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  19022. 1509.22 s [extra] +++ OK, passed 100 tests.
  19023. 1509.22 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  19024. 1509.22 s [extra] +++ OK, passed 100 tests.
  19025. 1509.22 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  19026. 1509.22 s [extra] +++ OK, passed 100 tests.
  19027. 1509.22 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  19028. 1509.22 s [extra] +++ OK, passed 100 tests.
  19029. 1509.22 s [extra] splitAtEnd 3 "he" == ("", "he")
  19030. 1509.22 s [extra] +++ OK, passed 100 tests.
  19031. 1509.22 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  19032. 1509.22 s [extra] +++ OK, passed 100 tests.
  19033. 1509.22 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  19034. 1509.22 s [extra] +++ OK, passed 100 tests.
  19035. 1509.22 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  19036. 1509.22 s [extra] +++ OK, passed 100 tests.
  19037. 1509.22 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  19038. 1509.22 s [extra] +++ OK, passed 100 tests.
  19039. 1509.22 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  19040. 1509.22 s [extra] +++ OK, passed 100 tests.
  19041. 1509.22 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  19042. 1509.22 s [extra] +++ OK, passed 100 tests.
  19043. 1509.22 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  19044. 1509.22 s [extra] +++ OK, passed 100 tests.
  19045. 1509.22 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  19046. 1509.22 s [extra] +++ OK, passed 100 tests.
  19047. 1509.22 s [extra] trim " hello " == "hello"
  19048. 1509.22 s [extra] +++ OK, passed 100 tests.
  19049. 1509.22 s [extra] trimStart " hello " == "hello "
  19050. 1509.22 s [extra] +++ OK, passed 100 tests.
  19051. 1509.22 s [extra] trimEnd " hello " == " hello"
  19052. 1509.22 s [extra] +++ OK, passed 100 tests.
  19053. 1509.22 s [extra] \s -> trim s == trimEnd (trimStart s)
  19054. 1509.22 s [extra] +++ OK, passed 100 tests.
  19055. 1509.22 s [extra] lower "This is A TEST" == "this is a test"
  19056. 1509.22 s [extra] +++ OK, passed 100 tests.
  19057. 1509.22 s [extra] lower "" == ""
  19058. 1509.22 s [extra] +++ OK, passed 100 tests.
  19059. 1509.22 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  19060. 1509.22 s [extra] +++ OK, passed 100 tests.
  19061. 1509.22 s [extra] upper "" == ""
  19062. 1509.22 s [extra] +++ OK, passed 100 tests.
  19063. 1509.22 s [extra] word1 "" == ("", "")
  19064. 1509.22 s [extra] +++ OK, passed 100 tests.
  19065. 1509.22 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  19066. 1509.22 s [extra] +++ OK, passed 100 tests.
  19067. 1509.22 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  19068. 1509.22 s [extra] +++ OK, passed 100 tests.
  19069. 1509.22 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  19070. 1509.22 s [extra] +++ OK, passed 100 tests.
  19071. 1509.22 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  19072. 1509.23 s [extra] +++ OK, passed 100 tests.
  19073. 1509.23 s [extra] line1 "" == ("", "")
  19074. 1509.23 s [extra] +++ OK, passed 100 tests.
  19075. 1509.23 s [extra] line1 "test" == ("test","")
  19076. 1509.23 s [extra] +++ OK, passed 100 tests.
  19077. 1509.23 s [extra] line1 "test\n" == ("test","")
  19078. 1509.23 s [extra] +++ OK, passed 100 tests.
  19079. 1509.23 s [extra] line1 "test\nrest" == ("test","rest")
  19080. 1509.23 s [extra] +++ OK, passed 100 tests.
  19081. 1509.23 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  19082. 1509.23 s [extra] +++ OK, passed 100 tests.
  19083. 1509.23 s [extra] escapeHTML "this is a test" == "this is a test"
  19084. 1509.23 s [extra] +++ OK, passed 100 tests.
  19085. 1509.23 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  19086. 1509.23 s [extra] +++ OK, passed 100 tests.
  19087. 1509.23 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  19088. 1509.23 s [extra] +++ OK, passed 100 tests.
  19089. 1509.23 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  19090. 1509.23 s [extra] +++ OK, passed 100 tests.
  19091. 1509.23 s [extra] escapeJSON "this is a test" == "this is a test"
  19092. 1509.23 s [extra] +++ OK, passed 100 tests.
  19093. 1509.23 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  19094. 1509.23 s [extra] +++ OK, passed 100 tests.
  19095. 1509.23 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  19096. 1509.23 s [extra] +++ OK, passed 100 tests.
  19097. 1509.23 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  19098. 1509.23 s [extra] +++ OK, passed 100 tests.
  19099. 1509.23 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  19100. 1509.23 s [extra] +++ OK, passed 100 tests.
  19101. 1509.23 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  19102. 1509.23 s [extra] +++ OK, passed 100 tests.
  19103. 1509.23 s [extra] maximumOn id [] == undefined
  19104. 1509.23 s [extra] +++ OK, passed 100 tests.
  19105. 1509.23 s [extra] maximumOn length ["test","extra","a"] == "extra"
  19106. 1509.23 s [extra] +++ OK, passed 100 tests.
  19107. 1509.23 s [extra] minimumOn id [] == undefined
  19108. 1509.23 s [extra] +++ OK, passed 100 tests.
  19109. 1509.23 s [extra] minimumOn length ["test","extra","a"] == "a"
  19110. 1509.23 s [extra] +++ OK, passed 100 tests.
  19111. 1509.23 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  19112. 1509.23 s [extra] +++ OK, passed 100 tests.
  19113. 1509.23 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  19114. 1509.23 s [extra] +++ OK, passed 100 tests.
  19115. 1509.23 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  19116. 1509.23 s [extra] +++ OK, passed 100 tests.
  19117. 1509.23 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19118. 1509.23 s [extra] +++ OK, passed 100 tests.
  19119. 1509.23 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19120. 1509.23 s [extra] +++ OK, passed 100 tests.
  19121. 1509.23 s [extra] sum' [1, 2, 3] == 6
  19122. 1509.23 s [extra] +++ OK, passed 100 tests.
  19123. 1509.23 s [extra] sumOn' read ["1", "2", "3"] == 6
  19124. 1509.23 s [extra] +++ OK, passed 100 tests.
  19125. 1509.23 s [extra] product' [1, 2, 4] == 8
  19126. 1509.23 s [extra] +++ OK, passed 100 tests.
  19127. 1509.23 s [extra] productOn' read ["1", "2", "4"] == 8
  19128. 1509.23 s [extra] +++ OK, passed 100 tests.
  19129. 1509.23 s [extra] merge "ace" "bd" == "abcde"
  19130. 1509.23 s [extra] +++ OK, passed 100 tests.
  19131. 1509.23 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  19132. 1509.24 s [extra] +++ OK, passed 100 tests.
  19133. 1509.24 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  19134. 1509.24 s [extra] +++ OK, passed 100 tests.
  19135. 1509.24 s [extra] replace "el" "e" "Hello" == "Helo"
  19136. 1509.24 s [extra] +++ OK, passed 100 tests.
  19137. 1509.24 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  19138. 1509.24 s [extra] +++ OK, passed 100 tests.
  19139. 1509.24 s [extra] replace "" "x" "" == "x"
  19140. 1509.24 s [extra] +++ OK, passed 100 tests.
  19141. 1509.24 s [extra] \xs ys -> replace xs xs ys == ys
  19142. 1509.24 s [extra] +++ OK, passed 100 tests.
  19143. 1509.24 s [extra] breakEnd isLower "youRE" == ("you","RE")
  19144. 1509.24 s [extra] +++ OK, passed 100 tests.
  19145. 1509.24 s [extra] breakEnd isLower "youre" == ("youre","")
  19146. 1509.24 s [extra] +++ OK, passed 100 tests.
  19147. 1509.24 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  19148. 1509.24 s [extra] +++ OK, passed 100 tests.
  19149. 1509.24 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  19150. 1509.24 s [extra] +++ OK, passed 100 tests.
  19151. 1509.24 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  19152. 1509.24 s [extra] +++ OK, passed 100 tests.
  19153. 1509.24 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  19154. 1509.24 s [extra] +++ OK, passed 100 tests.
  19155. 1509.24 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  19156. 1509.24 s [extra] +++ OK, passed 100 tests.
  19157. 1509.24 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  19158. 1509.24 s [extra] +++ OK, passed 100 tests.
  19159. 1509.24 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  19160. 1509.24 s [extra] +++ OK, passed 100 tests.
  19161. 1509.24 s [extra] \s -> wordsBy isSpace s == words s
  19162. 1509.24 s [extra] +++ OK, passed 100 tests.
  19163. 1509.24 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  19164. 1509.24 s [extra] +++ OK, passed 100 tests.
  19165. 1509.24 s [extra] \s -> linesBy (== '\n') s == lines s
  19166. 1509.24 s [extra] +++ OK, passed 100 tests.
  19167. 1509.24 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  19168. 1509.24 s [extra] +++ OK, passed 100 tests.
  19169. 1509.24 s [extra] firstJust id [Nothing,Just 3] == Just 3
  19170. 1509.24 s [extra] +++ OK, passed 100 tests.
  19171. 1509.24 s [extra] firstJust id [Nothing,Nothing] == Nothing
  19172. 1509.24 s [extra] +++ OK, passed 100 tests.
  19173. 1509.24 s [extra] drop1 "" == ""
  19174. 1509.24 s [extra] +++ OK, passed 100 tests.
  19175. 1509.24 s [extra] drop1 "test" == "est"
  19176. 1509.24 s [extra] +++ OK, passed 100 tests.
  19177. 1509.24 s [extra] \xs -> drop 1 xs == drop1 xs
  19178. 1509.24 s [extra] +++ OK, passed 100 tests.
  19179. 1509.24 s [extra] dropEnd1 "" == ""
  19180. 1509.24 s [extra] +++ OK, passed 100 tests.
  19181. 1509.24 s [extra] dropEnd1 "test" == "tes"
  19182. 1509.24 s [extra] +++ OK, passed 100 tests.
  19183. 1509.24 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  19184. 1509.24 s [extra] +++ OK, passed 100 tests.
  19185. 1509.24 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  19186. 1509.24 s [extra] +++ OK, passed 100 tests.
  19187. 1509.24 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  19188. 1509.26 s [extra] +++ OK, passed 100 tests.
  19189. 1509.26 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  19190. 1509.26 s [extra] +++ OK, passed 100 tests.
  19191. 1509.26 s [extra] breakOn "/" "foobar" == ("foobar", "")
  19192. 1509.26 s [extra] +++ OK, passed 100 tests.
  19193. 1509.26 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  19194. 1509.26 s [extra] +++ OK, passed 100 tests.
  19195. 1509.26 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  19196. 1509.26 s [extra] +++ OK, passed 100 tests.
  19197. 1509.26 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  19198. 1509.26 s [extra] +++ OK, passed 100 tests.
  19199. 1509.26 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  19200. 1509.26 s [extra] +++ OK, passed 100 tests.
  19201. 1509.26 s [extra] splitOn "x" "x" == ["",""]
  19202. 1509.26 s [extra] +++ OK, passed 100 tests.
  19203. 1509.26 s [extra] splitOn "x" "" == [""]
  19204. 1509.26 s [extra] +++ OK, passed 100 tests.
  19205. 1509.26 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  19206. 1509.26 s [extra] +++ OK, passed 100 tests; 17 discarded.
  19207. 1509.26 s [extra] \c x -> splitOn [c] x == split (==c) x
  19208. 1509.26 s [extra] +++ OK, passed 100 tests.
  19209. 1509.26 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  19210. 1509.26 s [extra] +++ OK, passed 100 tests.
  19211. 1509.26 s [extra] split (== 'a') "" == [""]
  19212. 1509.26 s [extra] +++ OK, passed 100 tests.
  19213. 1509.26 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  19214. 1509.26 s [extra] +++ OK, passed 100 tests.
  19215. 1509.26 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  19216. 1509.26 s [extra] +++ OK, passed 100 tests.
  19217. 1509.26 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  19218. 1509.26 s [extra] +++ OK, passed 100 tests.
  19219. 1509.26 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  19220. 1509.26 s [extra] +++ OK, passed 100 tests.
  19221. 1509.26 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  19222. 1509.26 s [extra] +++ OK, passed 100 tests.
  19223. 1509.26 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  19224. 1509.26 s [extra] +++ OK, passed 100 tests.
  19225. 1509.26 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  19226. 1509.26 s [extra] +++ OK, passed 100 tests.
  19227. 1509.26 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  19228. 1509.26 s [extra] +++ OK, passed 100 tests.
  19229. 1509.26 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  19230. 1509.26 s [extra] +++ OK, passed 100 tests.
  19231. 1509.26 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  19232. 1509.26 s [extra] +++ OK, passed 100 tests.
  19233. 1509.26 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  19234. 1509.26 s [extra] +++ OK, passed 100 tests.
  19235. 1509.26 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  19236. 1509.26 s [extra] +++ OK, passed 100 tests.
  19237. 1509.26 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  19238. 1509.26 s [extra] +++ OK, passed 100 tests.
  19239. 1509.26 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  19240. 1509.26 s [extra] +++ OK, passed 100 tests.
  19241. 1509.26 s [extra] stripSuffix "" "baz" == Just "baz"
  19242. 1509.26 s [extra] +++ OK, passed 100 tests.
  19243. 1509.26 s [extra] stripSuffix "foo" "quux" == Nothing
  19244. 1509.26 s [extra] +++ OK, passed 100 tests.
  19245. 1509.26 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  19246. 1509.26 s [extra] +++ OK, passed 100 tests.
  19247. 1509.26 s [extra] stripInfix "/" "foobar" == Nothing
  19248. 1509.26 s [extra] +++ OK, passed 100 tests.
  19249. 1509.26 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  19250. 1509.26 s [extra] +++ OK, passed 100 tests.
  19251. 1509.26 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  19252. 1509.26 s [extra] +++ OK, passed 100 tests.
  19253. 1509.26 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  19254. 1509.26 s [extra] +++ OK, passed 100 tests.
  19255. 1509.26 s [extra] chunksOf 8 "" == []
  19256. 1509.26 s [extra] +++ OK, passed 100 tests.
  19257. 1509.26 s [extra] chunksOf 0 "test" == undefined
  19258. 1509.26 s [extra] +++ OK, passed 100 tests.
  19259. 1509.26 s [extra] nubSort "this is a test" == " aehist"
  19260. 1509.26 s [extra] +++ OK, passed 100 tests.
  19261. 1509.26 s [extra] \xs -> nubSort xs == nub (sort xs)
  19262. 1509.27 s [extra] +++ OK, passed 100 tests.
  19263. 1509.27 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  19264. 1509.27 s [extra] +++ OK, passed 100 tests.
  19265. 1509.27 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  19266. 1509.27 s [extra] +++ OK, passed 100 tests.
  19267. 1509.27 s [extra] nubOrd "this is a test" == "this ae"
  19268. 1509.27 s [extra] +++ OK, passed 100 tests.
  19269. 1509.27 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  19270. 1509.27 s [extra] +++ OK, passed 100 tests.
  19271. 1509.27 s [extra] \xs -> nubOrd xs == nub xs
  19272. 1509.27 s [extra] +++ OK, passed 100 tests.
  19273. 1509.27 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  19274. 1509.27 s [extra] +++ OK, passed 100 tests.
  19275. 1509.27 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  19276. 1509.27 s [extra] +++ OK, passed 100 tests.
  19277. 1509.27 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  19278. 1509.27 s [extra] +++ OK, passed 100 tests.
  19279. 1509.27 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  19280. 1509.27 s [extra] +++ OK, passed 100 tests.
  19281. 1509.27 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  19282. 1509.27 s [extra] +++ OK, passed 100 tests.
  19283. 1509.27 s [extra] comparingLength [1,2,3] [False] == GT
  19284. 1509.27 s [extra] +++ OK, passed 100 tests.
  19285. 1509.27 s [extra] comparingLength [1,2] "ab" == EQ
  19286. 1509.27 s [extra] +++ OK, passed 100 tests.
  19287. 1509.27 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  19288. 1509.27 s [extra] +++ OK, passed 100 tests.
  19289. 1509.27 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  19290. 1509.27 s [extra] +++ OK, passed 100 tests.
  19291. 1509.27 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  19292. 1509.27 s [extra] +++ OK, passed 100 tests.
  19293. 1509.27 s [extra] mwhen True "test" == "test"
  19294. 1509.27 s [extra] +++ OK, passed 100 tests.
  19295. 1509.27 s [extra] mwhen False "test" == ""
  19296. 1509.27 s [extra] +++ OK, passed 100 tests.
  19297. 1509.27 s [extra] first succ (1,"test") == (2,"test")
  19298. 1509.27 s [extra] +++ OK, passed 100 tests.
  19299. 1509.27 s [extra] second reverse (1,"test") == (1,"tset")
  19300. 1509.27 s [extra] +++ OK, passed 100 tests.
  19301. 1509.27 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  19302. 1509.27 s [extra] +++ OK, passed 100 tests.
  19303. 1509.27 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  19304. 1509.27 s [extra] +++ OK, passed 100 tests.
  19305. 1509.27 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  19306. 1509.27 s [extra] +++ OK, passed 100 tests.
  19307. 1509.27 s [extra] (succ &&& pred) 1 == (2,0)
  19308. 1509.27 s [extra] +++ OK, passed 100 tests.
  19309. 1509.27 s [extra] dupe 12 == (12, 12)
  19310. 1509.27 s [extra] +++ OK, passed 100 tests.
  19311. 1509.27 s [extra] both succ (1,2) == (2,3)
  19312. 1509.27 s [extra] +++ OK, passed 100 tests.
  19313. 1509.27 s [extra] first3 succ (1,1,1) == (2,1,1)
  19314. 1509.27 s [extra] +++ OK, passed 100 tests.
  19315. 1509.27 s [extra] second3 succ (1,1,1) == (1,2,1)
  19316. 1509.27 s [extra] +++ OK, passed 100 tests.
  19317. 1509.27 s [extra] third3 succ (1,1,1) == (1,1,2)
  19318. 1509.27 s [extra] +++ OK, passed 100 tests.
  19319. 1509.27 s [extra] \x -> readVersion (showVersion x) == x
  19320. 1509.27 s [extra] +++ OK, passed 100 tests.
  19321. 1509.27 s [extra] readVersion "hello" == undefined
  19322. 1509.27 s [extra] +++ OK, passed 100 tests.
  19323. 1509.27 s [extra] showDP 4 pi == "3.1416"
  19324. 1509.27 s [extra] +++ OK, passed 100 tests.
  19325. 1509.27 s [extra] showDP 0 pi == "3"
  19326. 1509.27 s [extra] +++ OK, passed 100 tests.
  19327. 1509.27 s [extra] showDP 2 3 == "3.00"
  19328. 1509.27 s [extra] +++ OK, passed 100 tests.
  19329. 1509.27 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  19330. 1509.27 s [extra] +++ OK, passed 100 tests.
  19331. 1509.27 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  19332. 1509.27 s [extra] +++ OK, passed 100 tests.
  19333. 1509.27 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  19334. 1509.27 s [extra] +++ OK, passed 100 tests.
  19335. 1509.27 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  19336. 1509.27 s [extra] +++ OK, passed 100 tests.
  19337. 1509.27 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  19338. 1509.27 s [extra] +++ OK, passed 100 tests.
  19339. 1509.27 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19340. 1509.27 s [extra] +++ OK, passed 100 tests.
  19341. 1509.27 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19342. 1509.27 s [extra] +++ OK, passed 100 tests.
  19343. 1509.27 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  19344. 1509.27 s [extra] +++ OK, passed 100 tests.
  19345. 1509.27 s [extra] isWindows == (os == "mingw32")
  19346. 1509.27 s [extra] +++ OK, passed 100 tests.
  19347. 1509.28 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  19348. 1509.29 s [extra] +++ OK, passed 100 tests.
  19349. 1509.29 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  19350. 1509.31 s [extra] +++ OK, passed 100 tests.
  19351. 1509.31 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  19352. 1509.33 s [extra] +++ OK, passed 100 tests.
  19353. 1509.33 s [extra] captureOutput (print 1) == pure ("1\n",())
  19354. 1509.33 s [extra] +++ OK, passed 100 tests.
  19355. 1509.33 s [extra] withTempFile doesFileExist == pure True
  19356. 1509.33 s [extra] +++ OK, passed 100 tests.
  19357. 1509.33 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  19358. 1509.33 s [extra] +++ OK, passed 100 tests.
  19359. 1509.33 s [extra] withTempFile readFile' == pure ""
  19360. 1509.33 s [extra] +++ OK, passed 100 tests.
  19361. 1509.33 s [extra] withTempDir doesDirectoryExist == pure True
  19362. 1509.33 s [extra] +++ OK, passed 100 tests.
  19363. 1509.33 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  19364. 1509.34 s [extra] +++ OK, passed 100 tests.
  19365. 1509.34 s [extra] withTempDir listFiles == pure []
  19366. 1509.34 s [extra] +++ OK, passed 100 tests.
  19367. 1509.34 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  19368. 1509.34 s [extra] +++ OK, passed 100 tests.
  19369. 1509.34 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  19370. 1509.34 s [extra] +++ OK, passed 100 tests.
  19371. 1509.34 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  19372. 1509.34 s [extra] +++ OK, passed 100 tests.
  19373. 1509.34 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  19374. 1509.34 s [extra] +++ OK, passed 100 tests.
  19375. 1509.34 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  19376. 1509.34 s [extra] +++ OK, passed 100 tests.
  19377. 1509.34 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  19378. 1509.34 s [extra] +++ OK, passed 100 tests.
  19379. 1509.34 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  19380. 1510.34 s [extra] +++ OK, passed 100 tests.
  19381. 1510.34 s [extra] timeout (-3) (print 1) == pure Nothing
  19382. 1510.40 s [extra] +++ OK, passed 100 tests.
  19383. 1510.40 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  19384. 1510.40 s [extra] +++ OK, passed 100 tests.
  19385. 1510.40 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  19386. 1510.44 s [extra] 0.100318637
  19387. 1510.44 s [extra] +++ OK, passed 100 tests.
  19388. 1510.44 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  19389. 1510.54 s [extra] +++ OK, passed 100 tests.
  19390. 1510.54 s [extra] showDuration 3.435 == "3.44s"
  19391. 1510.54 s [extra] +++ OK, passed 100 tests.
  19392. 1510.54 s [extra] showDuration 623.8 == "10m24s"
  19393. 1510.54 s [extra] +++ OK, passed 100 tests.
  19394. 1510.54 s [extra] showDuration 62003.8 == "17h13m"
  19395. 1510.54 s [extra] +++ OK, passed 100 tests.
  19396. 1510.54 s [extra] showDuration 1e8 == "27777h47m"
  19397. 1510.54 s [extra] +++ OK, passed 100 tests.
  19398. 1510.54 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  19399. 1510.54 s [extra] +++ OK, passed 100 tests.
  19400. 1510.54 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  19401. 1511.54 s [extra] +++ OK, passed 100 tests.
  19402. 1511.54 s [extra] Extra export
  19403. 1511.54 s [extra] +++ OK, passed 100 tests.
  19404. 1511.54 s [extra] withTempFile
  19405. 1511.55 s [extra] ....done
  19406. 1511.55 s [extra] withTempDir
  19407. 1511.57 s [extra] ....done
  19408. 1511.57 s [extra] retry
  19409. 1511.57 s [extra] +++ OK, passed 100 tests.
  19410. 1511.57 s [extra] barrier
  19411. 1511.57 s [extra] Success (325 tests)
  19412. 1511.60 s [extra] Test suite extra-test: PASS
  19413. 1511.60 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  19414. 1511.60 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  19415. 1511.61 s [extra] Phase: haddockPhase
  19416. 1511.75 s [extra] Preprocessing library for extra-1.8.1..
  19417. 1511.76 s [extra] Running Haddock on library for extra-1.8.1..
  19418. 1511.83 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  19419. 1512.22 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  19420. 1512.23 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  19421. 1512.25 s [extra] Warning: 'Arrow' is out of scope.
  19422. 1512.25 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19423. 1512.25 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  19424. 1512.26 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  19425. 1512.28 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  19426. 1512.47 s [extra] Warning: '(:)' is out of scope.
  19427. 1512.47 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19428. 1512.48 s [extra] Warning: 'firstJustM' is out of scope.
  19429. 1512.48 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19430. 1512.48 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  19431. 1512.74 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  19432. 1512.77 s [extra] Warning: 'length' is ambiguous. It is defined
  19433. 1512.77 s [extra] * in ‘Data.Foldable’
  19434. 1512.77 s [extra] * in ‘Data.List.NonEmpty’
  19435. 1512.77 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19436. 1512.77 s [extra] by specifying the type/value namespace explicitly.
  19437. 1512.77 s [extra] Defaulting to the one defined in ‘Data.Foldable’
  19438. 1512.77 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  19439. 1512.80 s [extra] Warning: 'fromJust' is out of scope.
  19440. 1512.80 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19441. 1512.81 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  19442. 1512.85 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19443. 1512.93 s [extra] Warning: 'partition' is out of scope.
  19444. 1512.93 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19445. 1512.93 s [extra] Warning: 'mconcatMap' is out of scope.
  19446. 1512.93 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19447. 1512.93 s [extra] Warning: 'find' is out of scope.
  19448. 1512.93 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19449. 1512.94 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19450. 1513.01 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19451. 1513.01 s [extra] Missing documentation for:
  19452. 1513.01 s [extra] Module header
  19453. 1513.05 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19454. 1513.23 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19455. 1513.25 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19456. 1513.32 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19457. 1513.37 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19458. 1513.39 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19459. 1513.42 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19460. 1513.64 s [extra] 100% (270 /270) in 'Extra'
  19461. 1513.80 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19462. 1517.64 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  19463. 1517.71 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  19464. 1517.74 s [extra] Phase: installPhase
  19465. 1517.82 s [extra] Installing library in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19466. 1518.33 s [extra] Phase: fixupPhase
  19467. 1518.36 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19468. 1518.36 s [extra] shrinking /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSextra-1.8.1-mqL7YRifC8HhGrjpGYIL3-ghc9.6.7.so
  19469. 1518.38 s [extra] checking for references to /build/ in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1...
  19470. 1518.41 s [extra] patching script interpreter paths in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19471. 1518.41 s [haskell-language-server] [ 3 of 13] Compiling Development.IDE.GHC.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/GHC/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/GHC/ExactPrint.p_o )
  19472. 1518.41 s [haskell-language-server] [ 4 of 13] Compiling Development.IDE.Plugin.CodeAction.PositionIndexed ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/PositionIndexed.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/PositionIndexed.p_o )
  19473. 1518.41 s [haskell-language-server] [ 5 of 13] Compiling Development.IDE.Plugin.CodeAction.Util ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Util.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Util.p_o )
  19474. 1518.42 s [extra] stripping (with command strip and flags -S -p) in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib
  19475. 1518.53 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc
  19476. 1518.55 s [extra] checking for references to /build/ in /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc...
  19477. 1518.59 s [extra] patching script interpreter paths in /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc
  19478. 1518.72 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19479. 1519.17 s [extra:post-build] Nothing to push - all store paths are already on Cachix.
  19480. 1519.19 s [extra:post-build] Uploading to the NixCI cache: /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19481. 1519.24 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19482. 1519.28 s [extra:post-build] copying 1 paths...
  19483. 1519.28 s [extra:post-build] copying path '/nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19484. 1520.64 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19485. 1520.74 s [extra:post-build] copying 0 paths...
  19486. 1520.78 s Progress: 21 of 31 built (1 building), 341 of 341 downloaded from cache
  19487. 1520.83 s Building /nix/store/5mjvdf48pmvcbc8jll342q9vilpiv5lj-algebraic-graphs-0.7.drv
  19488. 1520.83 s [haskell-language-server] [ 6 of 13] Compiling Development.IDE.Plugin.CodeAction.ExactPrint ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/ExactPrint.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/ExactPrint.p_o )
  19489. 1520.83 s [haskell-language-server] [ 7 of 13] Compiling Development.IDE.Plugin.CodeAction.Args ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction/Args.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction/Args.p_o )
  19490. 1520.83 s [haskell-language-server] [ 8 of 13] Compiling Development.IDE.Plugin.Plugins.Diagnostic ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/Diagnostic.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/Diagnostic.p_o )
  19491. 1520.83 s [haskell-language-server] [ 9 of 13] Compiling Development.IDE.Plugin.Plugins.AddArgument ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/AddArgument.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/AddArgument.p_o )
  19492. 1520.83 s [haskell-language-server] [10 of 13] Compiling Development.IDE.Plugin.Plugins.FillHole ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillHole.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillHole.p_o )
  19493. 1520.83 s [haskell-language-server] [11 of 13] Compiling Development.IDE.Plugin.Plugins.FillTypeWildcard ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/FillTypeWildcard.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/FillTypeWildcard.p_o )
  19494. 1520.83 s [haskell-language-server] [12 of 13] Compiling Development.IDE.Plugin.Plugins.ImportUtils ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/Plugins/ImportUtils.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/Plugins/ImportUtils.p_o )
  19495. 1520.83 s [haskell-language-server] [13 of 13] Compiling Development.IDE.Plugin.CodeAction ( plugins/hls-refactor-plugin/src/Development/IDE/Plugin/CodeAction.hs, dist/build/hls-refactor-plugin/Development/IDE/Plugin/CodeAction.p_o )
  19496. 1520.92 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19497. 1520.93 s [algebraic-graphs] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  19498. 1521.07 s [algebraic-graphs] Phase: unpackPhase
  19499. 1521.08 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19500. 1521.09 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19501. 1521.09 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19502. 1521.10 s [algebraic-graphs] Phase: patchPhase
  19503. 1521.10 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19504. 1521.11 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19505. 1521.11 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19506. 1521.12 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19507. 1521.12 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.cSkGJvVPnT/setup-package.conf.d -threaded
  19508. 1521.17 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.cSkGJvVPnT/Main.o )
  19509. 1521.23 s [algebraic-graphs] [2 of 2] Linking Setup
  19510. 1523.31 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19511. 1523.39 s [algebraic-graphs] Phase: configurePhase
  19512. 1523.48 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.cSkGJvVPnT/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  19513. 1523.50 s [algebraic-graphs] Using Parsec parser
  19514. 1523.50 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19515. 1523.87 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19516. 1523.87 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.3.0
  19517. 1523.87 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19518. 1523.87 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  19519. 1523.87 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19520. 1523.87 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19521. 1523.87 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19522. 1523.87 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19523. 1523.87 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.3.0
  19524. 1523.87 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19525. 1523.87 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  19526. 1523.87 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19527. 1523.87 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19528. 1523.87 s [algebraic-graphs] inspection-testing-0.6.2
  19529. 1523.87 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19530. 1524.22 s [algebraic-graphs] Source component graph:
  19531. 1524.22 s [algebraic-graphs] component lib
  19532. 1524.22 s [algebraic-graphs] component test:main dependency lib
  19533. 1524.22 s [algebraic-graphs] Configured component graph:
  19534. 1524.22 s [algebraic-graphs] component algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19535. 1524.22 s [algebraic-graphs] include array-0.5.8.0
  19536. 1524.22 s [algebraic-graphs] include base-4.18.3.0
  19537. 1524.22 s [algebraic-graphs] include containers-0.6.7
  19538. 1524.22 s [algebraic-graphs] include deepseq-1.4.8.1
  19539. 1524.22 s [algebraic-graphs] include transformers-0.6.1.0
  19540. 1524.22 s [algebraic-graphs] component algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  19541. 1524.22 s [algebraic-graphs] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  19542. 1524.22 s [algebraic-graphs] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19543. 1524.22 s [algebraic-graphs] include array-0.5.8.0
  19544. 1524.22 s [algebraic-graphs] include base-4.18.3.0
  19545. 1524.22 s [algebraic-graphs] include containers-0.6.7
  19546. 1524.22 s [algebraic-graphs] include deepseq-1.4.8.1
  19547. 1524.22 s [algebraic-graphs] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19548. 1524.22 s [algebraic-graphs] include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  19549. 1524.22 s [algebraic-graphs] include transformers-0.6.1.0
  19550. 1524.22 s [algebraic-graphs] Linked component graph:
  19551. 1524.22 s [algebraic-graphs] unit algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19552. 1524.22 s [algebraic-graphs] include array-0.5.8.0
  19553. 1524.22 s [algebraic-graphs] include base-4.18.3.0
  19554. 1524.22 s [algebraic-graphs] include containers-0.6.7
  19555. 1524.22 s [algebraic-graphs] include deepseq-1.4.8.1
  19556. 1524.22 s [algebraic-graphs] include transformers-0.6.1.0
  19557. 1524.22 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Data.Graph.Typed
  19558. 1524.22 s [algebraic-graphs] unit algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  19559. 1524.22 s [algebraic-graphs] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  19560. 1524.22 s [algebraic-graphs] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19561. 1524.22 s [algebraic-graphs] include array-0.5.8.0
  19562. 1524.22 s [algebraic-graphs] include base-4.18.3.0
  19563. 1524.22 s [algebraic-graphs] include containers-0.6.7
  19564. 1524.22 s [algebraic-graphs] include deepseq-1.4.8.1
  19565. 1524.22 s [algebraic-graphs] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19566. 1524.22 s [algebraic-graphs] include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  19567. 1524.22 s [algebraic-graphs] include transformers-0.6.1.0
  19568. 1524.22 s [algebraic-graphs] Ready component graph:
  19569. 1524.22 s [algebraic-graphs] definite algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19570. 1524.22 s [algebraic-graphs] depends array-0.5.8.0
  19571. 1524.22 s [algebraic-graphs] depends base-4.18.3.0
  19572. 1524.22 s [algebraic-graphs] depends containers-0.6.7
  19573. 1524.22 s [algebraic-graphs] depends deepseq-1.4.8.1
  19574. 1524.22 s [algebraic-graphs] depends transformers-0.6.1.0
  19575. 1524.22 s [algebraic-graphs] definite algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  19576. 1524.22 s [algebraic-graphs] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  19577. 1524.22 s [algebraic-graphs] depends algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19578. 1524.22 s [algebraic-graphs] depends array-0.5.8.0
  19579. 1524.22 s [algebraic-graphs] depends base-4.18.3.0
  19580. 1524.22 s [algebraic-graphs] depends containers-0.6.7
  19581. 1524.22 s [algebraic-graphs] depends deepseq-1.4.8.1
  19582. 1524.22 s [algebraic-graphs] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19583. 1524.22 s [algebraic-graphs] depends inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  19584. 1524.22 s [algebraic-graphs] depends transformers-0.6.1.0
  19585. 1524.22 s [algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.6
  19586. 1524.22 s [algebraic-graphs] Using compiler: ghc-9.6.7
  19587. 1524.22 s [algebraic-graphs] Using install prefix:
  19588. 1524.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  19589. 1524.22 s [algebraic-graphs] Executables installed in:
  19590. 1524.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/bin
  19591. 1524.22 s [algebraic-graphs] Libraries installed in:
  19592. 1524.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19593. 1524.22 s [algebraic-graphs] Dynamic Libraries installed in:
  19594. 1524.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  19595. 1524.22 s [algebraic-graphs] Private executables installed in:
  19596. 1524.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
  19597. 1524.22 s [algebraic-graphs] Data files installed in:
  19598. 1524.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
  19599. 1524.22 s [algebraic-graphs] Documentation installed in:
  19600. 1524.22 s [algebraic-graphs] /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19601. 1524.22 s [algebraic-graphs] Configuration files installed in:
  19602. 1524.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/etc
  19603. 1524.22 s [algebraic-graphs] No alex found
  19604. 1524.22 s [algebraic-graphs] Using ar found on system at:
  19605. 1524.22 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  19606. 1524.22 s [algebraic-graphs] No c2hs found
  19607. 1524.22 s [algebraic-graphs] No cpphs found
  19608. 1524.22 s [algebraic-graphs] No doctest found
  19609. 1524.22 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19610. 1524.22 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  19611. 1524.22 s [algebraic-graphs] Using ghc version 9.6.7 found on system at:
  19612. 1524.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  19613. 1524.22 s [algebraic-graphs] Using ghc-pkg version 9.6.7 found on system at:
  19614. 1524.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  19615. 1524.22 s [algebraic-graphs] No ghcjs found
  19616. 1524.22 s [algebraic-graphs] No ghcjs-pkg found
  19617. 1524.22 s [algebraic-graphs] No greencard found
  19618. 1524.22 s [algebraic-graphs] Using haddock version 2.29.2 found on system at:
  19619. 1524.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  19620. 1524.22 s [algebraic-graphs] No happy found
  19621. 1524.22 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19622. 1524.22 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19623. 1524.22 s [algebraic-graphs] No hmake found
  19624. 1524.22 s [algebraic-graphs] Using hpc version 0.68 found on system at:
  19625. 1524.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  19626. 1524.22 s [algebraic-graphs] Using hsc2hs version 0.68.9 found on system at:
  19627. 1524.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  19628. 1524.22 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19629. 1524.22 s [algebraic-graphs] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  19630. 1524.22 s [algebraic-graphs] No jhc found
  19631. 1524.22 s [algebraic-graphs] Using ld found on system at:
  19632. 1524.22 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  19633. 1524.22 s [algebraic-graphs] No pkg-config found
  19634. 1524.22 s [algebraic-graphs] Using runghc version 9.6.7 found on system at:
  19635. 1524.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  19636. 1524.22 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19637. 1524.22 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  19638. 1524.22 s [algebraic-graphs] Using tar found on system at:
  19639. 1524.22 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  19640. 1524.22 s [algebraic-graphs] No uhc found
  19641. 1524.43 s [algebraic-graphs] Phase: buildPhase
  19642. 1524.49 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19643. 1524.49 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  19644. 1524.64 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 )
  19645. 1525.67 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 )
  19646. 1526.40 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 )
  19647. 1526.78 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 )
  19648. 1526.78 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19649. 1528.14 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 )
  19650. 1528.43 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 )
  19651. 1528.97 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 )
  19652. 1529.79 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 )
  19653. 1529.79 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 )
  19654. 1529.79 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 )
  19655. 1529.79 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 )
  19656. 1529.79 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 )
  19657. 1529.79 s [algebraic-graphs]
  19658. 1529.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19659. 1529.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19660. 1529.79 s [algebraic-graphs] will become an error in a future GHC release.
  19661. 1529.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19662. 1529.79 s [algebraic-graphs] |
  19663. 1529.79 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19664. 1529.79 s [algebraic-graphs] | ^
  19665. 1529.79 s [algebraic-graphs]
  19666. 1529.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19667. 1529.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19668. 1529.79 s [algebraic-graphs] will become an error in a future GHC release.
  19669. 1529.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19670. 1529.79 s [algebraic-graphs] |
  19671. 1529.79 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19672. 1529.79 s [algebraic-graphs] | ^
  19673. 1529.79 s [algebraic-graphs]
  19674. 1529.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19675. 1529.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19676. 1529.79 s [algebraic-graphs] will become an error in a future GHC release.
  19677. 1529.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19678. 1529.79 s [algebraic-graphs] |
  19679. 1529.79 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19680. 1529.79 s [algebraic-graphs] | ^
  19681. 1529.79 s [algebraic-graphs]
  19682. 1529.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19683. 1529.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19684. 1529.79 s [algebraic-graphs] will become an error in a future GHC release.
  19685. 1529.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19686. 1529.79 s [algebraic-graphs] |
  19687. 1529.79 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19688. 1529.79 s [algebraic-graphs] | ^
  19689. 1529.79 s [algebraic-graphs]
  19690. 1529.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19691. 1529.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19692. 1529.79 s [algebraic-graphs] will become an error in a future GHC release.
  19693. 1529.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19694. 1529.79 s [algebraic-graphs] |
  19695. 1529.79 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19696. 1529.79 s [algebraic-graphs] | ^
  19697. 1529.79 s [algebraic-graphs]
  19698. 1529.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19699. 1529.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19700. 1529.79 s [algebraic-graphs] will become an error in a future GHC release.
  19701. 1529.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19702. 1529.79 s [algebraic-graphs] |
  19703. 1529.79 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19704. 1529.79 s [algebraic-graphs] | ^
  19705. 1529.79 s [algebraic-graphs]
  19706. 1529.79 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19707. 1529.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19708. 1529.79 s [algebraic-graphs] will become an error in a future GHC release.
  19709. 1529.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19710. 1529.79 s [algebraic-graphs] |
  19711. 1529.79 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19712. 1529.79 s [algebraic-graphs] | ^
  19713. 1529.79 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 )
  19714. 1530.00 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 )
  19715. 1530.32 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 )
  19716. 1530.32 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 )
  19717. 1530.32 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 )
  19718. 1530.84 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 )
  19719. 1531.01 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 )
  19720. 1531.23 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 )
  19721. 1531.23 s [algebraic-graphs]
  19722. 1531.23 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19723. 1531.23 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19724. 1531.23 s [algebraic-graphs] will become an error in a future GHC release.
  19725. 1531.23 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19726. 1531.23 s [algebraic-graphs] |
  19727. 1531.23 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19728. 1531.23 s [algebraic-graphs] | ^
  19729. 1531.23 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 )
  19730. 1531.23 s [algebraic-graphs]
  19731. 1531.23 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19732. 1531.23 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19733. 1531.23 s [algebraic-graphs] will become an error in a future GHC release.
  19734. 1531.23 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19735. 1531.23 s [algebraic-graphs] |
  19736. 1531.23 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19737. 1531.23 s [algebraic-graphs] | ^
  19738. 1531.23 s [algebraic-graphs]
  19739. 1531.23 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19740. 1531.23 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19741. 1531.23 s [algebraic-graphs] will become an error in a future GHC release.
  19742. 1531.23 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19743. 1531.23 s [algebraic-graphs] |
  19744. 1531.23 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19745. 1531.23 s [algebraic-graphs] | ^
  19746. 1531.23 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 )
  19747. 1531.23 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 )
  19748. 1531.23 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 )
  19749. 1531.23 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 )
  19750. 1531.23 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 )
  19751. 1531.23 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 )
  19752. 1531.23 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 )
  19753. 1531.57 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19754. 1532.80 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19755. 1533.59 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 )
  19756. 1533.96 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19757. 1533.96 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19758. 1535.31 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 )
  19759. 1535.51 s [haskell-language-server] Preprocessing library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
  19760. 1535.51 s [haskell-language-server] Building library 'hls-rename-plugin' for haskell-language-server-2.12.0.0..
  19761. 1535.91 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Rename ( plugins/hls-rename-plugin/src/Ide/Plugin/Rename.hs, dist/build/hls-rename-plugin/Ide/Plugin/Rename.o, dist/build/hls-rename-plugin/Ide/Plugin/Rename.dyn_o )
  19762. 1535.93 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 )
  19763. 1536.11 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 )
  19764. 1536.90 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19765. 1536.90 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 )
  19766. 1536.90 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 )
  19767. 1536.90 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 )
  19768. 1536.90 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19769. 1536.90 s [algebraic-graphs]
  19770. 1536.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19771. 1536.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19772. 1536.90 s [algebraic-graphs] will become an error in a future GHC release.
  19773. 1536.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19774. 1536.90 s [algebraic-graphs] |
  19775. 1536.90 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19776. 1536.90 s [algebraic-graphs] | ^
  19777. 1536.90 s [algebraic-graphs]
  19778. 1536.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19779. 1536.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19780. 1536.90 s [algebraic-graphs] will become an error in a future GHC release.
  19781. 1536.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19782. 1536.90 s [algebraic-graphs] |
  19783. 1536.90 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19784. 1536.90 s [algebraic-graphs] | ^
  19785. 1536.90 s [algebraic-graphs]
  19786. 1536.91 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19787. 1536.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19788. 1536.91 s [algebraic-graphs] will become an error in a future GHC release.
  19789. 1536.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19790. 1536.91 s [algebraic-graphs] |
  19791. 1536.91 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19792. 1536.91 s [algebraic-graphs] | ^
  19793. 1536.91 s [algebraic-graphs]
  19794. 1536.91 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19795. 1536.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19796. 1536.91 s [algebraic-graphs] will become an error in a future GHC release.
  19797. 1536.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19798. 1536.91 s [algebraic-graphs] |
  19799. 1536.91 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19800. 1536.91 s [algebraic-graphs] | ^
  19801. 1536.91 s [algebraic-graphs]
  19802. 1536.91 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19803. 1536.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19804. 1536.91 s [algebraic-graphs] will become an error in a future GHC release.
  19805. 1536.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19806. 1536.91 s [algebraic-graphs] |
  19807. 1536.91 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19808. 1536.91 s [algebraic-graphs] | ^
  19809. 1536.91 s [algebraic-graphs]
  19810. 1536.91 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19811. 1536.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19812. 1536.91 s [algebraic-graphs] will become an error in a future GHC release.
  19813. 1536.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19814. 1536.91 s [algebraic-graphs] |
  19815. 1536.91 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19816. 1536.91 s [algebraic-graphs] | ^
  19817. 1536.91 s [algebraic-graphs]
  19818. 1536.91 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19819. 1536.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19820. 1536.91 s [algebraic-graphs] will become an error in a future GHC release.
  19821. 1536.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19822. 1536.91 s [algebraic-graphs] |
  19823. 1536.91 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19824. 1536.91 s [algebraic-graphs] | ^
  19825. 1536.91 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19826. 1537.17 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 )
  19827. 1537.64 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19828. 1537.64 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 )
  19829. 1537.64 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19830. 1538.19 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 )
  19831. 1538.45 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 )
  19832. 1538.56 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Rename ( plugins/hls-rename-plugin/src/Ide/Plugin/Rename.hs, dist/build/hls-rename-plugin/Ide/Plugin/Rename.p_o )
  19833. 1538.64 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19834. 1538.64 s [algebraic-graphs]
  19835. 1538.64 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19836. 1538.64 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19837. 1538.64 s [algebraic-graphs] will become an error in a future GHC release.
  19838. 1538.64 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19839. 1538.64 s [algebraic-graphs] |
  19840. 1538.64 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19841. 1538.64 s [algebraic-graphs] | ^
  19842. 1538.64 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 )
  19843. 1538.64 s [algebraic-graphs]
  19844. 1538.64 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19845. 1538.64 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19846. 1538.64 s [algebraic-graphs] will become an error in a future GHC release.
  19847. 1538.64 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19848. 1538.64 s [algebraic-graphs] |
  19849. 1538.64 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19850. 1538.64 s [algebraic-graphs] | ^
  19851. 1538.64 s [algebraic-graphs]
  19852. 1538.64 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19853. 1538.64 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19854. 1538.64 s [algebraic-graphs] will become an error in a future GHC release.
  19855. 1538.64 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19856. 1538.64 s [algebraic-graphs] |
  19857. 1538.64 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19858. 1538.64 s [algebraic-graphs] | ^
  19859. 1538.64 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19860. 1538.64 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19861. 1538.64 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 )
  19862. 1538.67 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
  19863. 1538.69 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 )
  19864. 1538.69 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 )
  19865. 1538.73 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19866. 1539.87 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  19867. 1539.87 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  19868. 1540.00 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 )
  19869. 1541.11 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 )
  19870. 1543.62 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 )
  19871. 1543.62 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 )
  19872. 1543.62 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 )
  19873. 1545.80 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 )
  19874. 1545.80 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 )
  19875. 1545.80 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 )
  19876. 1548.00 s [haskell-language-server] Preprocessing library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
  19877. 1548.00 s [haskell-language-server] Building library 'hls-splice-plugin' for haskell-language-server-2.12.0.0..
  19878. 1548.20 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.Splice.Types ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice/Types.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.o, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.dyn_o )
  19879. 1549.40 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 )
  19880. 1549.57 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 )
  19881. 1549.57 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 )
  19882. 1550.15 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 )
  19883. 1550.15 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 )
  19884. 1550.15 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 )
  19885. 1550.43 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.Splice ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice.o, dist/build/hls-splice-plugin/Ide/Plugin/Splice.dyn_o )
  19886. 1551.13 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 )
  19887. 1551.13 s [algebraic-graphs] [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
  19888. 1551.13 s [algebraic-graphs] [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
  19889. 1551.13 s [algebraic-graphs] [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
  19890. 1551.13 s [algebraic-graphs] [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
  19891. 1551.14 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 )
  19892. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19893. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19894. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19895. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19896. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19897. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19898. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19899. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19900. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19901. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19902. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19903. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19904. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19905. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19906. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19907. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19908. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19909. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19910. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19911. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19912. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19913. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19914. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19915. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19916. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19917. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19918. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19919. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19920. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19921. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19922. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19923. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19924. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19925. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19926. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19927. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19928. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19929. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19930. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19931. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19932. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19933. 1551.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19934. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19935. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19936. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19937. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19938. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19939. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19940. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19941. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19942. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19943. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19944. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19945. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19946. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19947. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19948. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19949. 1551.15 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19950. 1551.15 s [algebraic-graphs] inspection testing successful
  19951. 1551.15 s [algebraic-graphs] expected successes: 58
  19952. 1551.15 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 )
  19953. 1551.15 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 )
  19954. 1551.15 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 )
  19955. 1551.95 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19956. 1552.96 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.Splice.Types ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice/Types.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice/Types.p_o )
  19957. 1553.05 s [algebraic-graphs] Phase: checkPhase
  19958. 1553.08 s [algebraic-graphs] Running 1 test suites...
  19959. 1553.08 s [algebraic-graphs] Test suite main: RUNNING...
  19960. 1556.85 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.Splice ( plugins/hls-splice-plugin/src/Ide/Plugin/Splice.hs, dist/build/hls-splice-plugin/Ide/Plugin/Splice.p_o )
  19961. 1560.42 s [algebraic-graphs]
  19962. 1560.42 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19963. 1560.42 s [algebraic-graphs] OK: show empty == "empty"
  19964. 1560.44 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19965. 1560.44 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19966. 1560.44 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19967. 1560.44 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19968. 1560.44 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19969. 1560.44 s [algebraic-graphs]
  19970. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19971. 1560.44 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19972. 1560.44 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19973. 1560.44 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19974. 1560.44 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19975. 1560.44 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19976. 1560.44 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19977. 1560.44 s [algebraic-graphs]
  19978. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19979. 1560.44 s [algebraic-graphs] OK: isEmpty empty == True
  19980. 1560.44 s [algebraic-graphs] OK: hasVertex x empty == False
  19981. 1560.44 s [algebraic-graphs] OK: vertexCount empty == 0
  19982. 1560.44 s [algebraic-graphs] OK: edgeCount empty == 0
  19983. 1560.44 s [algebraic-graphs]
  19984. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19985. 1560.44 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19986. 1560.44 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19987. 1560.44 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19988. 1560.44 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19989. 1560.44 s [algebraic-graphs]
  19990. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19991. 1560.44 s [algebraic-graphs] OK: vertices [] == empty
  19992. 1560.44 s [algebraic-graphs] OK: vertices [x] == vertex x
  19993. 1560.44 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19994. 1560.44 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19995. 1560.44 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19996. 1560.44 s [algebraic-graphs]
  19997. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  19998. 1560.44 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  19999. 1560.44 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  20000. 1560.44 s [algebraic-graphs]
  20001. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  20002. 1560.44 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  20003. 1560.44 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  20004. 1560.44 s [algebraic-graphs]
  20005. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  20006. 1560.44 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20007. 1560.44 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20008. 1560.44 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20009. 1560.44 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  20010. 1560.44 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20011. 1560.44 s [algebraic-graphs]
  20012. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  20013. 1560.44 s [algebraic-graphs] OK: isEmpty empty == True
  20014. 1560.44 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20015. 1560.44 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20016. 1560.44 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  20017. 1560.44 s [algebraic-graphs]
  20018. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  20019. 1560.44 s [algebraic-graphs] OK: hasVertex x empty == False
  20020. 1560.44 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20021. 1560.44 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20022. 1560.44 s [algebraic-graphs]
  20023. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  20024. 1560.44 s [algebraic-graphs] OK: hasEdge x y empty == False
  20025. 1560.44 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20026. 1560.44 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  20027. 1560.44 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20028. 1560.44 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20029. 1560.44 s [algebraic-graphs]
  20030. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  20031. 1560.44 s [algebraic-graphs] OK: vertexCount empty == 0
  20032. 1560.44 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20033. 1560.44 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20034. 1560.44 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20035. 1560.44 s [algebraic-graphs]
  20036. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  20037. 1560.44 s [algebraic-graphs] OK: edgeCount empty == 0
  20038. 1560.44 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20039. 1560.44 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  20040. 1560.44 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20041. 1560.44 s [algebraic-graphs]
  20042. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  20043. 1560.44 s [algebraic-graphs] OK: vertexList empty == []
  20044. 1560.44 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20045. 1560.44 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20046. 1560.44 s [algebraic-graphs]
  20047. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  20048. 1560.44 s [algebraic-graphs] OK: edgeList empty == []
  20049. 1560.44 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20050. 1560.44 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  20051. 1560.44 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20052. 1560.44 s [algebraic-graphs]
  20053. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  20054. 1560.44 s [algebraic-graphs] OK: adjacencyList empty == []
  20055. 1560.44 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20056. 1560.44 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  20057. 1560.44 s [algebraic-graphs]
  20058. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  20059. 1560.44 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20060. 1560.44 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20061. 1560.44 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20062. 1560.44 s [algebraic-graphs]
  20063. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  20064. 1560.44 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20065. 1560.44 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20066. 1560.44 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  20067. 1560.44 s [algebraic-graphs]
  20068. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  20069. 1560.44 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20070. 1560.44 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20071. 1560.44 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  20072. 1560.44 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  20073. 1560.44 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  20074. 1560.44 s [algebraic-graphs]
  20075. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  20076. 1560.44 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20077. 1560.44 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20078. 1560.44 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  20079. 1560.44 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  20080. 1560.44 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  20081. 1560.44 s [algebraic-graphs]
  20082. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  20083. 1560.44 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20084. 1560.44 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20085. 1560.44 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  20086. 1560.44 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20087. 1560.44 s [algebraic-graphs]
  20088. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  20089. 1560.44 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  20090. 1560.44 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20091. 1560.44 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20092. 1560.44 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  20093. 1560.44 s [algebraic-graphs]
  20094. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  20095. 1560.44 s [algebraic-graphs] OK: transpose empty == empty
  20096. 1560.44 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20097. 1560.44 s [algebraic-graphs] OK: transpose . transpose == id
  20098. 1560.44 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20099. 1560.44 s [algebraic-graphs]
  20100. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  20101. 1560.44 s [algebraic-graphs] OK: induce (const True ) x == x
  20102. 1560.44 s [algebraic-graphs] OK: induce (const False) x == empty
  20103. 1560.44 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20104. 1560.44 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20105. 1560.44 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20106. 1560.44 s [algebraic-graphs]
  20107. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  20108. 1560.44 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20109. 1560.44 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  20110. 1560.44 s [algebraic-graphs]
  20111. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  20112. 1560.44 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  20113. 1560.44 s [algebraic-graphs]
  20114. 1560.44 s [algebraic-graphs] OK: box x y ~~ box y x
  20115. 1560.44 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20116. 1560.44 s [algebraic-graphs] OK: box x empty ~~ empty
  20117. 1560.44 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20118. 1560.44 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20119. 1560.44 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20120. 1560.44 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20121. 1560.44 s [algebraic-graphs]
  20122. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  20123. 1560.44 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20124. 1560.44 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20125. 1560.44 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  20126. 1560.44 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20127. 1560.44 s [algebraic-graphs]
  20128. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  20129. 1560.44 s [algebraic-graphs] OK: topSort empty == []
  20130. 1560.44 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  20131. 1560.44 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  20132. 1560.44 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  20133. 1560.44 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  20134. 1560.44 s [algebraic-graphs]
  20135. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  20136. 1560.44 s [algebraic-graphs] OK: scc empty == empty
  20137. 1560.44 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20138. 1560.44 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20139. 1560.44 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  20140. 1560.44 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20141. 1560.44 s [algebraic-graphs]
  20142. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  20143. 1560.44 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  20144. 1560.44 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  20145. 1560.44 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  20146. 1560.44 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  20147. 1560.44 s [algebraic-graphs]
  20148. 1560.44 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  20149. 1560.44 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  20150. 1560.44 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  20151. 1560.44 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  20152. 1560.44 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  20153. 1560.44 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  20154. 1560.44 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  20155. 1563.97 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  20156. 1563.97 s [algebraic-graphs]
  20157. 1563.97 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  20158. 1563.97 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  20159. 1563.97 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  20160. 1563.97 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  20161. 1563.97 s [algebraic-graphs]
  20162. 1563.97 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  20163. 1563.97 s [algebraic-graphs] OK: Arbitrary
  20164. 1563.97 s [algebraic-graphs] OK: empty
  20165. 1563.97 s [algebraic-graphs] OK: vertex
  20166. 1563.97 s [algebraic-graphs] OK: vertices
  20167. 1563.97 s [algebraic-graphs] OK: union
  20168. 1563.97 s [algebraic-graphs] OK: join
  20169. 1563.97 s [algebraic-graphs] OK: transpose
  20170. 1563.97 s [algebraic-graphs] OK: box
  20171. 1563.97 s [algebraic-graphs] OK: transitiveClosure
  20172. 1563.97 s [algebraic-graphs] OK: scc
  20173. 1563.97 s [algebraic-graphs] OK: toAcyclic
  20174. 1563.97 s [algebraic-graphs] OK: toAcyclicOrd
  20175. 1563.97 s [algebraic-graphs]
  20176. 1563.97 s [algebraic-graphs] ============ AdjacencyIntMap ============
  20177. 1563.97 s [algebraic-graphs] OK: Axioms of graphs
  20178. 1563.97 s [algebraic-graphs]
  20179. 1563.97 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  20180. 1563.97 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  20181. 1563.97 s [algebraic-graphs]
  20182. 1563.97 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  20183. 1563.97 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20184. 1563.97 s [algebraic-graphs]
  20185. 1563.97 s [algebraic-graphs] OK: consistent empty == True
  20186. 1563.97 s [algebraic-graphs] OK: consistent (vertex x) == True
  20187. 1563.97 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20188. 1563.97 s [algebraic-graphs] OK: consistent (connect x y) == True
  20189. 1563.97 s [algebraic-graphs] OK: consistent (edge x y) == True
  20190. 1563.97 s [algebraic-graphs] OK: consistent (edges xs) == True
  20191. 1563.97 s [algebraic-graphs] OK: consistent (stars xs) == True
  20192. 1563.97 s [algebraic-graphs]
  20193. 1563.97 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  20194. 1563.97 s [algebraic-graphs] OK: show (empty ) == "empty"
  20195. 1563.97 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20196. 1563.97 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20197. 1563.97 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20198. 1563.97 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20199. 1563.97 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20200. 1563.97 s [algebraic-graphs]
  20201. 1563.97 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20202. 1563.97 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20203. 1563.97 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20204. 1563.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20205. 1563.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20206. 1563.97 s [algebraic-graphs]
  20207. 1563.97 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  20208. 1563.97 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20209. 1563.97 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20210. 1563.97 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20211. 1563.97 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20212. 1563.97 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20213. 1563.97 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20214. 1563.97 s [algebraic-graphs] OK: x <= x + y
  20215. 1563.97 s [algebraic-graphs] OK: x + y <= x * y
  20216. 1563.97 s [algebraic-graphs]
  20217. 1563.97 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  20218. 1563.98 s [algebraic-graphs] OK: isEmpty empty == True
  20219. 1563.98 s [algebraic-graphs] OK: hasVertex x empty == False
  20220. 1563.98 s [algebraic-graphs] OK: vertexCount empty == 0
  20221. 1563.98 s [algebraic-graphs] OK: edgeCount empty == 0
  20222. 1563.98 s [algebraic-graphs]
  20223. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  20224. 1563.98 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20225. 1563.98 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20226. 1563.98 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20227. 1563.98 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20228. 1563.98 s [algebraic-graphs]
  20229. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  20230. 1563.98 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20231. 1563.98 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20232. 1563.98 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20233. 1563.98 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20234. 1563.98 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20235. 1563.98 s [algebraic-graphs]
  20236. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  20237. 1563.98 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20238. 1563.98 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20239. 1563.98 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20240. 1563.98 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20241. 1563.98 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20242. 1563.98 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20243. 1563.98 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20244. 1563.98 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20245. 1563.98 s [algebraic-graphs]
  20246. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  20247. 1563.98 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20248. 1563.98 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20249. 1563.98 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20250. 1563.98 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20251. 1563.98 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20252. 1563.98 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20253. 1563.98 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20254. 1563.98 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20255. 1563.98 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20256. 1563.98 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20257. 1563.98 s [algebraic-graphs]
  20258. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  20259. 1563.98 s [algebraic-graphs] OK: vertices [] == empty
  20260. 1563.98 s [algebraic-graphs] OK: vertices [x] == vertex x
  20261. 1563.98 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20262. 1563.98 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20263. 1563.98 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20264. 1563.98 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20265. 1563.98 s [algebraic-graphs]
  20266. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  20267. 1563.98 s [algebraic-graphs] OK: edges [] == empty
  20268. 1563.98 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20269. 1563.98 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20270. 1563.98 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20271. 1563.98 s [algebraic-graphs]
  20272. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  20273. 1563.98 s [algebraic-graphs] OK: overlays [] == empty
  20274. 1563.98 s [algebraic-graphs] OK: overlays [x] == x
  20275. 1563.98 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20276. 1563.98 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20277. 1563.98 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20278. 1563.98 s [algebraic-graphs]
  20279. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  20280. 1563.98 s [algebraic-graphs] OK: connects [] == empty
  20281. 1563.98 s [algebraic-graphs] OK: connects [x] == x
  20282. 1563.98 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20283. 1563.98 s [algebraic-graphs] OK: connects == foldr connect empty
  20284. 1563.98 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20285. 1563.98 s [algebraic-graphs]
  20286. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  20287. 1563.98 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  20288. 1563.98 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  20289. 1563.98 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  20290. 1563.98 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  20291. 1563.98 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  20292. 1563.98 s [algebraic-graphs]
  20293. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  20294. 1563.98 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20295. 1563.98 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20296. 1563.98 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20297. 1563.98 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20298. 1563.98 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20299. 1563.98 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20300. 1563.98 s [algebraic-graphs]
  20301. 1563.98 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  20302. 1563.98 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20303. 1563.98 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20304. 1563.98 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20305. 1563.98 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20306. 1563.98 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20307. 1563.98 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20308. 1563.98 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20309. 1563.98 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20310. 1563.98 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20311. 1563.98 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20312. 1563.98 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20313. 1563.98 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20314. 1563.98 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20315. 1563.98 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20316. 1563.98 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20317. 1563.98 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20318. 1563.98 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20319. 1563.98 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20320. 1563.98 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20321. 1563.98 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20322. 1563.98 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20323. 1563.98 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20324. 1563.98 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20325. 1563.98 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20326. 1563.98 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20327. 1563.98 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20328. 1563.98 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20329. 1563.98 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20330. 1563.98 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20331. 1563.98 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20332. 1563.98 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20333. 1563.98 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20334. 1563.98 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20335. 1563.98 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20336. 1564.79 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20337. 1564.79 s [algebraic-graphs]
  20338. 1564.79 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  20339. 1564.79 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20340. 1564.79 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20341. 1564.79 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20342. 1564.79 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20343. 1564.79 s [algebraic-graphs]
  20344. 1564.79 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  20345. 1564.79 s [algebraic-graphs] OK: isEmpty empty == True
  20346. 1564.79 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20347. 1564.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20348. 1564.79 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20349. 1564.79 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20350. 1564.79 s [algebraic-graphs]
  20351. 1564.79 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  20352. 1564.79 s [algebraic-graphs] OK: hasVertex x empty == False
  20353. 1564.79 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20354. 1564.79 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20355. 1564.79 s [algebraic-graphs]
  20356. 1564.79 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  20357. 1564.79 s [algebraic-graphs] OK: hasEdge x y empty == False
  20358. 1564.79 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20359. 1564.79 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20360. 1564.79 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20361. 1564.79 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20362. 1564.79 s [algebraic-graphs]
  20363. 1564.79 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20364. 1564.79 s [algebraic-graphs] OK: vertexCount empty == 0
  20365. 1564.79 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20366. 1564.79 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20367. 1564.79 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20368. 1564.79 s [algebraic-graphs]
  20369. 1564.79 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20370. 1564.79 s [algebraic-graphs] OK: edgeCount empty == 0
  20371. 1564.79 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20372. 1564.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20373. 1564.80 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20374. 1564.80 s [algebraic-graphs]
  20375. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20376. 1564.80 s [algebraic-graphs] OK: vertexList empty == []
  20377. 1564.80 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20378. 1564.80 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20379. 1564.80 s [algebraic-graphs]
  20380. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20381. 1564.80 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20382. 1564.80 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20383. 1564.80 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20384. 1564.80 s [algebraic-graphs]
  20385. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20386. 1564.80 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20387. 1564.80 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20388. 1564.80 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20389. 1564.80 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20390. 1564.80 s [algebraic-graphs]
  20391. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20392. 1564.80 s [algebraic-graphs] OK: edgeList empty == []
  20393. 1564.80 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20394. 1564.80 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20395. 1564.80 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20396. 1564.80 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20397. 1564.80 s [algebraic-graphs]
  20398. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20399. 1564.80 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20400. 1564.80 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20401. 1564.80 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20402. 1564.80 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20403. 1564.80 s [algebraic-graphs]
  20404. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20405. 1564.80 s [algebraic-graphs] OK: adjacencyList empty == []
  20406. 1564.80 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20407. 1564.80 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20408. 1564.80 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20409. 1564.80 s [algebraic-graphs]
  20410. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20411. 1564.80 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20412. 1564.80 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20413. 1564.80 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20414. 1564.80 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20415. 1564.80 s [algebraic-graphs]
  20416. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20417. 1564.80 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20418. 1564.80 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20419. 1564.80 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20420. 1564.80 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20421. 1564.80 s [algebraic-graphs]
  20422. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20423. 1564.80 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20424. 1564.80 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20425. 1564.80 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20426. 1564.80 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20427. 1564.80 s [algebraic-graphs]
  20428. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20429. 1564.80 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20430. 1564.80 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20431. 1564.80 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20432. 1564.80 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20433. 1564.80 s [algebraic-graphs]
  20434. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20435. 1564.80 s [algebraic-graphs] OK: path [] == empty
  20436. 1564.80 s [algebraic-graphs] OK: path [x] == vertex x
  20437. 1564.80 s [algebraic-graphs] OK: path [x,y] == edge x y
  20438. 1564.80 s [algebraic-graphs]
  20439. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20440. 1564.80 s [algebraic-graphs] OK: circuit [] == empty
  20441. 1564.80 s [algebraic-graphs] OK: circuit [x] == edge x x
  20442. 1564.80 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20443. 1564.80 s [algebraic-graphs]
  20444. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20445. 1564.80 s [algebraic-graphs] OK: clique [] == empty
  20446. 1564.80 s [algebraic-graphs] OK: clique [x] == vertex x
  20447. 1564.80 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20448. 1564.80 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20449. 1564.80 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20450. 1564.80 s [algebraic-graphs]
  20451. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20452. 1564.80 s [algebraic-graphs] OK: biclique [] [] == empty
  20453. 1564.80 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20454. 1564.80 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20455. 1564.80 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20456. 1564.80 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20457. 1564.80 s [algebraic-graphs]
  20458. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20459. 1564.80 s [algebraic-graphs] OK: star x [] == vertex x
  20460. 1564.80 s [algebraic-graphs] OK: star x [y] == edge x y
  20461. 1564.80 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20462. 1564.80 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20463. 1564.80 s [algebraic-graphs]
  20464. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20465. 1564.80 s [algebraic-graphs] OK: stars [] == empty
  20466. 1564.80 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20467. 1564.80 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20468. 1564.80 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20469. 1564.80 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20470. 1564.80 s [algebraic-graphs] OK: stars . adjacencyList == id
  20471. 1564.80 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20472. 1564.80 s [algebraic-graphs]
  20473. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20474. 1564.80 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20475. 1564.80 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20476. 1564.80 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20477. 1564.80 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20478. 1564.80 s [algebraic-graphs]
  20479. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20480. 1564.80 s [algebraic-graphs] OK: forest [] == empty
  20481. 1564.80 s [algebraic-graphs] OK: forest [x] == tree x
  20482. 1564.80 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20483. 1564.80 s [algebraic-graphs] OK: forest == overlays . map tree
  20484. 1564.80 s [algebraic-graphs]
  20485. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20486. 1564.80 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20487. 1564.80 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20488. 1564.80 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20489. 1564.80 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20490. 1564.80 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20491. 1564.80 s [algebraic-graphs]
  20492. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20493. 1564.80 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20494. 1564.80 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20495. 1564.80 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20496. 1564.80 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20497. 1564.80 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20498. 1564.80 s [algebraic-graphs]
  20499. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20500. 1564.80 s [algebraic-graphs] OK: replaceVertex x x == id
  20501. 1564.80 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20502. 1564.80 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20503. 1564.80 s [algebraic-graphs]
  20504. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20505. 1564.80 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20506. 1564.80 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20507. 1564.80 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20508. 1564.80 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20509. 1564.80 s [algebraic-graphs]
  20510. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20511. 1564.80 s [algebraic-graphs] OK: transpose empty == empty
  20512. 1564.80 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20513. 1564.80 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20514. 1564.80 s [algebraic-graphs] OK: transpose . transpose == id
  20515. 1564.80 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20516. 1564.80 s [algebraic-graphs]
  20517. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20518. 1564.80 s [algebraic-graphs] OK: gmap f empty == empty
  20519. 1564.80 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20520. 1564.80 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20521. 1564.80 s [algebraic-graphs] OK: gmap id == id
  20522. 1564.80 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20523. 1564.80 s [algebraic-graphs]
  20524. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20525. 1564.80 s [algebraic-graphs] OK: induce (const True ) x == x
  20526. 1564.80 s [algebraic-graphs] OK: induce (const False) x == empty
  20527. 1564.80 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20528. 1564.80 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20529. 1564.80 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20530. 1564.80 s [algebraic-graphs]
  20531. 1564.80 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20532. 1564.80 s [algebraic-graphs] OK: compose empty x == empty
  20533. 1564.80 s [algebraic-graphs] OK: compose x empty == empty
  20534. 1564.80 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20535. 1564.80 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20536. 1564.80 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20537. 1564.80 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20538. 1565.00 s [haskell-language-server] Preprocessing library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
  20539. 1565.00 s [haskell-language-server] Building library 'hls-retrie-plugin' for haskell-language-server-2.12.0.0..
  20540. 1565.03 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20541. 1565.03 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20542. 1565.03 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20543. 1565.03 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20544. 1565.03 s [algebraic-graphs]
  20545. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20546. 1565.03 s [algebraic-graphs] OK: closure empty == empty
  20547. 1565.03 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20548. 1565.03 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20549. 1565.03 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20550. 1565.03 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20551. 1565.03 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20552. 1565.03 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20553. 1565.03 s [algebraic-graphs] OK: closure . closure == closure
  20554. 1565.03 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20555. 1565.03 s [algebraic-graphs]
  20556. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20557. 1565.03 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20558. 1565.03 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20559. 1565.03 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20560. 1565.03 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20561. 1565.03 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20562. 1565.03 s [algebraic-graphs]
  20563. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20564. 1565.03 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20565. 1565.03 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20566. 1565.03 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20567. 1565.03 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20568. 1565.03 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20569. 1565.03 s [algebraic-graphs]
  20570. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20571. 1565.03 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20572. 1565.03 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20573. 1565.03 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20574. 1565.03 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20575. 1565.03 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20576. 1565.03 s [algebraic-graphs]
  20577. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20578. 1565.03 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20579. 1565.03 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20580. 1565.03 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20581. 1565.03 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20582. 1565.03 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20583. 1565.03 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20584. 1565.03 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20585. 1565.03 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20586. 1565.03 s [algebraic-graphs] OK: bfsForest x [] == []
  20587. 1565.03 s [algebraic-graphs] OK: bfsForest empty vs == []
  20588. 1565.03 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20589. 1565.03 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20590. 1565.03 s [algebraic-graphs]
  20591. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20592. 1565.03 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20593. 1565.03 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20594. 1565.03 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20595. 1565.03 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20596. 1565.03 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20597. 1565.03 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20598. 1565.03 s [algebraic-graphs] OK: bfs empty vs == []
  20599. 1565.03 s [algebraic-graphs] OK: bfs x [] == []
  20600. 1565.03 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20601. 1565.03 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20602. 1565.03 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20603. 1565.03 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20604. 1565.03 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20605. 1565.03 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20606. 1565.03 s [algebraic-graphs]
  20607. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20608. 1565.03 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20609. 1565.03 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20610. 1565.03 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20611. 1565.03 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20612. 1565.03 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20613. 1565.03 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20614. 1565.03 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20615. 1565.03 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20616. 1565.03 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20617. 1565.03 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20618. 1565.03 s [algebraic-graphs]
  20619. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20620. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20621. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20622. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20623. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20624. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20625. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20626. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20627. 1565.03 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20628. 1565.03 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20629. 1565.03 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20630. 1565.03 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20631. 1565.03 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20632. 1565.03 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20633. 1565.03 s [algebraic-graphs]
  20634. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20635. 1565.03 s [algebraic-graphs] OK: dfs empty vs == []
  20636. 1565.03 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20637. 1565.03 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20638. 1565.03 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20639. 1565.03 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20640. 1565.03 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20641. 1565.03 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20642. 1565.03 s [algebraic-graphs] OK: dfs x [] == []
  20643. 1565.03 s [algebraic-graphs]
  20644. 1565.03 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20645. 1565.03 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20646. 1565.03 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20647. 1565.03 s [algebraic-graphs]
  20648. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20649. 1565.03 s [algebraic-graphs] OK: reachable empty x == []
  20650. 1565.03 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20651. 1565.03 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20652. 1565.03 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20653. 1565.03 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20654. 1565.03 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20655. 1565.03 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20656. 1565.03 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20657. 1565.03 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20658. 1565.03 s [algebraic-graphs]
  20659. 1565.03 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20660. 1565.03 s [algebraic-graphs]
  20661. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20662. 1565.03 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20663. 1565.03 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20664. 1565.03 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20665. 1565.03 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20666. 1565.03 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20667. 1565.03 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20668. 1565.03 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20669. 1565.03 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20670. 1565.03 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20671. 1565.03 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20672. 1565.03 s [algebraic-graphs]
  20673. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20674. 1565.03 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20675. 1565.03 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20676. 1565.03 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20677. 1565.03 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20678. 1565.03 s [algebraic-graphs]
  20679. 1565.03 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20680. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20681. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20682. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20683. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20684. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20685. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20686. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20687. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20688. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20689. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20690. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20691. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20692. 1565.03 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20693. 1565.17 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Retrie ( plugins/hls-retrie-plugin/src/Ide/Plugin/Retrie.hs, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.o, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.dyn_o )
  20694. 1570.41 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20695. 1570.41 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20696. 1570.43 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20697. 1570.43 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20698. 1570.43 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20699. 1570.43 s [algebraic-graphs]
  20700. 1570.43 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20701. 1570.43 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20702. 1570.43 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20703. 1570.43 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20704. 1570.43 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20705. 1570.43 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20706. 1570.43 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20707. 1570.43 s [algebraic-graphs]
  20708. 1570.43 s [algebraic-graphs] ============ AdjacencyMap ============
  20709. 1570.43 s [algebraic-graphs] OK: Axioms of graphs
  20710. 1570.43 s [algebraic-graphs]
  20711. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20712. 1570.43 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20713. 1570.43 s [algebraic-graphs]
  20714. 1570.43 s [algebraic-graphs] OK: consistent empty == True
  20715. 1570.43 s [algebraic-graphs] OK: consistent (vertex x) == True
  20716. 1570.43 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20717. 1570.43 s [algebraic-graphs] OK: consistent (connect x y) == True
  20718. 1570.43 s [algebraic-graphs] OK: consistent (edge x y) == True
  20719. 1570.43 s [algebraic-graphs] OK: consistent (edges xs) == True
  20720. 1570.43 s [algebraic-graphs] OK: consistent (stars xs) == True
  20721. 1570.43 s [algebraic-graphs]
  20722. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20723. 1570.43 s [algebraic-graphs] OK: show (empty ) == "empty"
  20724. 1570.43 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20725. 1570.43 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20726. 1570.43 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20727. 1570.43 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20728. 1570.43 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20729. 1570.43 s [algebraic-graphs]
  20730. 1570.43 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20731. 1570.43 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20732. 1570.43 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20733. 1570.43 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20734. 1570.43 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20735. 1570.43 s [algebraic-graphs]
  20736. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20737. 1570.43 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20738. 1570.43 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20739. 1570.43 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20740. 1570.43 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20741. 1570.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20742. 1570.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20743. 1570.43 s [algebraic-graphs] OK: x <= x + y
  20744. 1570.43 s [algebraic-graphs] OK: x + y <= x * y
  20745. 1570.43 s [algebraic-graphs]
  20746. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20747. 1570.43 s [algebraic-graphs] OK: isEmpty empty == True
  20748. 1570.43 s [algebraic-graphs] OK: hasVertex x empty == False
  20749. 1570.43 s [algebraic-graphs] OK: vertexCount empty == 0
  20750. 1570.43 s [algebraic-graphs] OK: edgeCount empty == 0
  20751. 1570.43 s [algebraic-graphs]
  20752. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20753. 1570.43 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20754. 1570.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20755. 1570.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20756. 1570.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20757. 1570.43 s [algebraic-graphs]
  20758. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20759. 1570.43 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20760. 1570.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20761. 1570.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20762. 1570.43 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20763. 1570.43 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20764. 1570.43 s [algebraic-graphs]
  20765. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20766. 1570.43 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20767. 1570.43 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20768. 1570.43 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20769. 1570.43 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20770. 1570.43 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20771. 1570.43 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20772. 1570.43 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20773. 1570.43 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20774. 1570.43 s [algebraic-graphs]
  20775. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20776. 1570.43 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20777. 1570.43 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20778. 1570.43 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20779. 1570.43 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20780. 1570.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20781. 1570.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20782. 1570.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20783. 1570.43 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20784. 1570.43 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20785. 1570.43 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20786. 1570.43 s [algebraic-graphs]
  20787. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20788. 1570.43 s [algebraic-graphs] OK: vertices [] == empty
  20789. 1570.43 s [algebraic-graphs] OK: vertices [x] == vertex x
  20790. 1570.43 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20791. 1570.43 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20792. 1570.43 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20793. 1570.43 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20794. 1570.43 s [algebraic-graphs]
  20795. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20796. 1570.43 s [algebraic-graphs] OK: edges [] == empty
  20797. 1570.43 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20798. 1570.43 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20799. 1570.43 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20800. 1570.43 s [algebraic-graphs]
  20801. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20802. 1570.43 s [algebraic-graphs] OK: overlays [] == empty
  20803. 1570.43 s [algebraic-graphs] OK: overlays [x] == x
  20804. 1570.43 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20805. 1570.43 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20806. 1570.43 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20807. 1570.43 s [algebraic-graphs]
  20808. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20809. 1570.43 s [algebraic-graphs] OK: connects [] == empty
  20810. 1570.43 s [algebraic-graphs] OK: connects [x] == x
  20811. 1570.43 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20812. 1570.43 s [algebraic-graphs] OK: connects == foldr connect empty
  20813. 1570.43 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20814. 1570.43 s [algebraic-graphs]
  20815. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20816. 1570.43 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20817. 1570.43 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20818. 1570.43 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20819. 1570.43 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20820. 1570.43 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20821. 1570.43 s [algebraic-graphs]
  20822. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20823. 1570.43 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20824. 1570.43 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20825. 1570.43 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20826. 1570.43 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20827. 1570.43 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20828. 1570.43 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20829. 1570.43 s [algebraic-graphs]
  20830. 1570.43 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20831. 1570.43 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20832. 1570.43 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20833. 1570.43 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20834. 1570.43 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20835. 1570.43 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20836. 1570.43 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20837. 1570.43 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20838. 1570.43 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20839. 1570.43 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20840. 1570.43 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20841. 1570.43 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20842. 1570.43 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20843. 1570.43 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20844. 1570.43 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20845. 1570.43 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20846. 1570.43 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20847. 1570.43 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20848. 1570.43 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20849. 1570.43 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20850. 1570.43 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20851. 1570.43 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20852. 1570.43 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20853. 1570.43 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20854. 1570.43 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20855. 1570.43 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20856. 1570.43 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20857. 1570.43 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20858. 1570.43 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20859. 1570.43 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20860. 1570.43 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20861. 1570.43 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20862. 1570.43 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20863. 1570.43 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20864. 1572.26 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20865. 1572.26 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20866. 1572.26 s [algebraic-graphs]
  20867. 1572.26 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20868. 1572.26 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20869. 1572.26 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20870. 1572.26 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20871. 1572.26 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20872. 1572.26 s [algebraic-graphs]
  20873. 1572.26 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20874. 1572.26 s [algebraic-graphs] OK: isEmpty empty == True
  20875. 1572.26 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20876. 1572.26 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20877. 1572.26 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20878. 1572.26 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20879. 1572.27 s [algebraic-graphs]
  20880. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20881. 1572.27 s [algebraic-graphs] OK: hasVertex x empty == False
  20882. 1572.27 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20883. 1572.27 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20884. 1572.27 s [algebraic-graphs]
  20885. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20886. 1572.27 s [algebraic-graphs] OK: hasEdge x y empty == False
  20887. 1572.27 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20888. 1572.27 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20889. 1572.27 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20890. 1572.27 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20891. 1572.27 s [algebraic-graphs]
  20892. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20893. 1572.27 s [algebraic-graphs] OK: vertexCount empty == 0
  20894. 1572.27 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20895. 1572.27 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20896. 1572.27 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20897. 1572.27 s [algebraic-graphs]
  20898. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20899. 1572.27 s [algebraic-graphs] OK: edgeCount empty == 0
  20900. 1572.27 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20901. 1572.27 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20902. 1572.27 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20903. 1572.27 s [algebraic-graphs]
  20904. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20905. 1572.27 s [algebraic-graphs] OK: vertexList empty == []
  20906. 1572.27 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20907. 1572.27 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20908. 1572.27 s [algebraic-graphs]
  20909. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20910. 1572.27 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20911. 1572.27 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20912. 1572.27 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20913. 1572.27 s [algebraic-graphs]
  20914. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20915. 1572.27 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20916. 1572.27 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20917. 1572.27 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20918. 1572.27 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20919. 1572.27 s [algebraic-graphs]
  20920. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20921. 1572.27 s [algebraic-graphs] OK: edgeList empty == []
  20922. 1572.27 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20923. 1572.27 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20924. 1572.27 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20925. 1572.27 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20926. 1572.27 s [algebraic-graphs]
  20927. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20928. 1572.27 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20929. 1572.27 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20930. 1572.27 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20931. 1572.27 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20932. 1572.27 s [algebraic-graphs]
  20933. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20934. 1572.27 s [algebraic-graphs] OK: adjacencyList empty == []
  20935. 1572.27 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20936. 1572.27 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20937. 1572.27 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20938. 1572.27 s [algebraic-graphs]
  20939. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20940. 1572.27 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20941. 1572.27 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20942. 1572.27 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20943. 1572.27 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20944. 1572.27 s [algebraic-graphs]
  20945. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20946. 1572.27 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20947. 1572.27 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20948. 1572.27 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20949. 1572.27 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20950. 1572.27 s [algebraic-graphs]
  20951. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20952. 1572.27 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20953. 1572.27 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20954. 1572.27 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20955. 1572.27 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20956. 1572.27 s [algebraic-graphs]
  20957. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20958. 1572.27 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20959. 1572.27 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20960. 1572.27 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20961. 1572.27 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20962. 1572.27 s [algebraic-graphs]
  20963. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20964. 1572.27 s [algebraic-graphs] OK: path [] == empty
  20965. 1572.27 s [algebraic-graphs] OK: path [x] == vertex x
  20966. 1572.27 s [algebraic-graphs] OK: path [x,y] == edge x y
  20967. 1572.27 s [algebraic-graphs]
  20968. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20969. 1572.27 s [algebraic-graphs] OK: circuit [] == empty
  20970. 1572.27 s [algebraic-graphs] OK: circuit [x] == edge x x
  20971. 1572.27 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20972. 1572.27 s [algebraic-graphs]
  20973. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20974. 1572.27 s [algebraic-graphs] OK: clique [] == empty
  20975. 1572.27 s [algebraic-graphs] OK: clique [x] == vertex x
  20976. 1572.27 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20977. 1572.27 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20978. 1572.27 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20979. 1572.27 s [algebraic-graphs]
  20980. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20981. 1572.27 s [algebraic-graphs] OK: biclique [] [] == empty
  20982. 1572.27 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20983. 1572.27 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20984. 1572.27 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20985. 1572.27 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20986. 1572.27 s [algebraic-graphs]
  20987. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20988. 1572.27 s [algebraic-graphs] OK: star x [] == vertex x
  20989. 1572.27 s [algebraic-graphs] OK: star x [y] == edge x y
  20990. 1572.27 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20991. 1572.27 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20992. 1572.27 s [algebraic-graphs]
  20993. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20994. 1572.27 s [algebraic-graphs] OK: stars [] == empty
  20995. 1572.27 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20996. 1572.27 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20997. 1572.27 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20998. 1572.27 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20999. 1572.27 s [algebraic-graphs] OK: stars . adjacencyList == id
  21000. 1572.27 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21001. 1572.27 s [algebraic-graphs]
  21002. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  21003. 1572.27 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21004. 1572.27 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21005. 1572.27 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21006. 1572.27 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21007. 1572.27 s [algebraic-graphs]
  21008. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  21009. 1572.27 s [algebraic-graphs] OK: forest [] == empty
  21010. 1572.27 s [algebraic-graphs] OK: forest [x] == tree x
  21011. 1572.27 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21012. 1572.27 s [algebraic-graphs] OK: forest == overlays . map tree
  21013. 1572.27 s [algebraic-graphs]
  21014. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  21015. 1572.27 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21016. 1572.27 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21017. 1572.27 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21018. 1572.27 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21019. 1572.27 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21020. 1572.27 s [algebraic-graphs]
  21021. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  21022. 1572.27 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21023. 1572.27 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21024. 1572.27 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21025. 1572.27 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21026. 1572.27 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21027. 1572.27 s [algebraic-graphs]
  21028. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  21029. 1572.27 s [algebraic-graphs] OK: replaceVertex x x == id
  21030. 1572.27 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21031. 1572.27 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21032. 1572.27 s [algebraic-graphs]
  21033. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  21034. 1572.27 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21035. 1572.27 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21036. 1572.27 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21037. 1572.27 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21038. 1572.27 s [algebraic-graphs]
  21039. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  21040. 1572.27 s [algebraic-graphs] OK: transpose empty == empty
  21041. 1572.27 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21042. 1572.27 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21043. 1572.27 s [algebraic-graphs] OK: transpose . transpose == id
  21044. 1572.27 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21045. 1572.27 s [algebraic-graphs]
  21046. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  21047. 1572.27 s [algebraic-graphs] OK: gmap f empty == empty
  21048. 1572.27 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21049. 1572.27 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21050. 1572.27 s [algebraic-graphs] OK: gmap id == id
  21051. 1572.27 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21052. 1572.27 s [algebraic-graphs]
  21053. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  21054. 1572.27 s [algebraic-graphs] OK: induce (const True ) x == x
  21055. 1572.27 s [algebraic-graphs] OK: induce (const False) x == empty
  21056. 1572.27 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21057. 1572.27 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21058. 1572.27 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21059. 1572.27 s [algebraic-graphs]
  21060. 1572.27 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  21061. 1572.27 s [algebraic-graphs] OK: compose empty x == empty
  21062. 1572.27 s [algebraic-graphs] OK: compose x empty == empty
  21063. 1572.27 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21064. 1572.27 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21065. 1572.27 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21066. 1572.27 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21067. 1574.54 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21068. 1574.54 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21069. 1574.54 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21070. 1574.54 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21071. 1574.54 s [algebraic-graphs]
  21072. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  21073. 1574.54 s [algebraic-graphs] OK: closure empty == empty
  21074. 1574.54 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  21075. 1574.54 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  21076. 1574.54 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21077. 1574.54 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  21078. 1574.54 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  21079. 1574.54 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  21080. 1574.54 s [algebraic-graphs] OK: closure . closure == closure
  21081. 1574.54 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  21082. 1574.54 s [algebraic-graphs]
  21083. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  21084. 1574.54 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  21085. 1574.54 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  21086. 1574.54 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  21087. 1574.54 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21088. 1574.54 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  21089. 1574.54 s [algebraic-graphs]
  21090. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  21091. 1574.54 s [algebraic-graphs] OK: symmetricClosure empty == empty
  21092. 1574.54 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  21093. 1574.54 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  21094. 1574.54 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  21095. 1574.54 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  21096. 1574.54 s [algebraic-graphs]
  21097. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  21098. 1574.54 s [algebraic-graphs] OK: transitiveClosure empty == empty
  21099. 1574.54 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  21100. 1574.54 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  21101. 1574.54 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  21102. 1574.54 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  21103. 1574.54 s [algebraic-graphs]
  21104. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.box ============
  21105. 1574.54 s [algebraic-graphs] OK: box x y ~~ box y x
  21106. 1574.54 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21107. 1574.54 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21108. 1574.54 s [algebraic-graphs] OK: box x empty ~~ empty
  21109. 1574.54 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21110. 1574.54 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21111. 1574.54 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21112. 1574.54 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21113. 1574.54 s [algebraic-graphs]
  21114. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  21115. 1574.54 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  21116. 1574.54 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  21117. 1574.54 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  21118. 1574.54 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  21119. 1574.54 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  21120. 1574.54 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  21121. 1574.54 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  21122. 1574.54 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  21123. 1574.54 s [algebraic-graphs] OK: bfsForest x [] == []
  21124. 1574.54 s [algebraic-graphs] OK: bfsForest empty vs == []
  21125. 1574.54 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21126. 1574.54 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  21127. 1574.54 s [algebraic-graphs]
  21128. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  21129. 1574.54 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  21130. 1574.54 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  21131. 1574.54 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  21132. 1574.54 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  21133. 1574.54 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  21134. 1574.54 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  21135. 1574.54 s [algebraic-graphs] OK: bfs empty vs == []
  21136. 1574.54 s [algebraic-graphs] OK: bfs x [] == []
  21137. 1574.54 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  21138. 1574.54 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  21139. 1574.54 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  21140. 1574.54 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  21141. 1574.54 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  21142. 1574.54 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  21143. 1574.54 s [algebraic-graphs]
  21144. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  21145. 1574.54 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  21146. 1574.54 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  21147. 1574.54 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  21148. 1574.54 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  21149. 1574.54 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  21150. 1574.54 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  21151. 1574.54 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  21152. 1574.54 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  21153. 1574.54 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  21154. 1574.54 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  21155. 1574.54 s [algebraic-graphs]
  21156. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  21157. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  21158. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  21159. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  21160. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  21161. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  21162. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  21163. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  21164. 1574.54 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  21165. 1574.54 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  21166. 1574.54 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  21167. 1574.54 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  21168. 1574.54 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21169. 1574.54 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  21170. 1574.54 s [algebraic-graphs]
  21171. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21172. 1574.54 s [algebraic-graphs] OK: dfs empty vs == []
  21173. 1574.54 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  21174. 1574.54 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  21175. 1574.54 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  21176. 1574.54 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  21177. 1574.54 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  21178. 1574.54 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  21179. 1574.54 s [algebraic-graphs] OK: dfs x [] == []
  21180. 1574.54 s [algebraic-graphs]
  21181. 1574.54 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  21182. 1574.54 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  21183. 1574.54 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  21184. 1574.54 s [algebraic-graphs]
  21185. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21186. 1574.54 s [algebraic-graphs] OK: reachable empty x == []
  21187. 1574.54 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  21188. 1574.54 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  21189. 1574.54 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  21190. 1574.54 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  21191. 1574.54 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  21192. 1574.54 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  21193. 1574.54 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  21194. 1574.54 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  21195. 1574.54 s [algebraic-graphs]
  21196. 1574.54 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  21197. 1574.54 s [algebraic-graphs]
  21198. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  21199. 1574.54 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  21200. 1574.54 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  21201. 1574.54 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  21202. 1574.54 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  21203. 1574.54 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  21204. 1574.54 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  21205. 1574.54 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  21206. 1574.54 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  21207. 1574.54 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  21208. 1574.54 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  21209. 1574.54 s [algebraic-graphs]
  21210. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  21211. 1574.54 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  21212. 1574.54 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  21213. 1574.54 s [algebraic-graphs] OK: isAcyclic . circuit == null
  21214. 1574.54 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  21215. 1574.54 s [algebraic-graphs]
  21216. 1574.54 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  21217. 1574.54 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  21218. 1574.54 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  21219. 1574.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  21220. 1574.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  21221. 1574.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  21222. 1574.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  21223. 1574.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  21224. 1575.78 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Retrie ( plugins/hls-retrie-plugin/src/Ide/Plugin/Retrie.hs, dist/build/hls-retrie-plugin/Ide/Plugin/Retrie.p_o )
  21225. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  21226. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  21227. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  21228. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  21229. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  21230. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  21231. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  21232. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  21233. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  21234. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  21235. 1580.54 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  21236. 1580.54 s [algebraic-graphs]
  21237. 1580.54 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  21238. 1580.54 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  21239. 1580.54 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  21240. 1580.54 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  21241. 1580.54 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  21242. 1580.54 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  21243. 1580.54 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  21244. 1580.54 s [algebraic-graphs]
  21245. 1580.54 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  21246. 1580.54 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21247. 1580.54 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21248. 1580.54 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21249. 1580.54 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21250. 1580.54 s [algebraic-graphs]
  21251. 1580.54 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  21252. 1580.54 s [algebraic-graphs] OK: scc empty == empty
  21253. 1580.54 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  21254. 1580.54 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  21255. 1580.54 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  21256. 1580.54 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  21257. 1580.54 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  21258. 1580.54 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  21259. 1580.54 s [algebraic-graphs] OK: isAcyclic . scc == const True
  21260. 1580.54 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  21261. 1580.54 s [algebraic-graphs] OK: scc g == KL.scc g
  21262. 1580.54 s [algebraic-graphs]
  21263. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  21264. 1580.54 s [algebraic-graphs] OK: 0 == rightVertex 0
  21265. 1580.54 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  21266. 1580.54 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  21267. 1580.54 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  21268. 1580.54 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  21269. 1580.54 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  21270. 1580.54 s [algebraic-graphs]
  21271. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  21272. 1580.54 s [algebraic-graphs] OK: show empty == "empty"
  21273. 1580.54 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  21274. 1580.54 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  21275. 1580.54 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  21276. 1580.54 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  21277. 1580.54 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  21278. 1580.54 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  21279. 1580.54 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  21280. 1580.54 s [algebraic-graphs]
  21281. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  21282. 1580.54 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  21283. 1580.54 s [algebraic-graphs]
  21284. 1580.54 s [algebraic-graphs] OK: x + y == y + x
  21285. 1580.54 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  21286. 1580.54 s [algebraic-graphs] OK: x * empty == x
  21287. 1580.54 s [algebraic-graphs] OK: empty * x == x
  21288. 1580.54 s [algebraic-graphs] OK: x * y == y * x
  21289. 1580.54 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  21290. 1580.54 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  21291. 1580.54 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  21292. 1580.54 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  21293. 1580.54 s [algebraic-graphs] OK: x + empty == x
  21294. 1580.54 s [algebraic-graphs] OK: empty + x == x
  21295. 1580.54 s [algebraic-graphs] OK: x + x == x
  21296. 1580.54 s [algebraic-graphs] OK: x * y + x + y == x * y
  21297. 1580.54 s [algebraic-graphs] OK: x * x * x == x * x
  21298. 1580.54 s [algebraic-graphs]
  21299. 1580.54 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  21300. 1580.54 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  21301. 1580.54 s [algebraic-graphs]
  21302. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  21303. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21304. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21305. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21306. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21307. 1580.54 s [algebraic-graphs]
  21308. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  21309. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21310. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21311. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21312. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21313. 1580.54 s [algebraic-graphs]
  21314. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  21315. 1580.54 s [algebraic-graphs] OK: isEmpty empty == True
  21316. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21317. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21318. 1580.54 s [algebraic-graphs] OK: hasVertex x empty == False
  21319. 1580.54 s [algebraic-graphs]
  21320. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  21321. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21322. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21323. 1580.54 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21324. 1580.54 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21325. 1580.54 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  21326. 1580.54 s [algebraic-graphs]
  21327. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  21328. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21329. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21330. 1580.54 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21331. 1580.54 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21332. 1580.54 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  21333. 1580.54 s [algebraic-graphs]
  21334. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  21335. 1580.54 s [algebraic-graphs] OK: vertex . Left == leftVertex
  21336. 1580.54 s [algebraic-graphs] OK: vertex . Right == rightVertex
  21337. 1580.54 s [algebraic-graphs]
  21338. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  21339. 1580.54 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  21340. 1580.54 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21341. 1580.54 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21342. 1580.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21343. 1580.54 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  21344. 1580.54 s [algebraic-graphs]
  21345. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  21346. 1580.54 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21347. 1580.54 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21348. 1580.54 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21349. 1580.54 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21350. 1580.54 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21351. 1580.54 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21352. 1580.54 s [algebraic-graphs]
  21353. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  21354. 1580.54 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  21355. 1580.54 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  21356. 1580.54 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  21357. 1580.54 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  21358. 1580.54 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  21359. 1580.54 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21360. 1580.54 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21361. 1580.54 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21362. 1580.54 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21363. 1580.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21364. 1580.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  21365. 1580.54 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21366. 1580.54 s [algebraic-graphs]
  21367. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21368. 1580.54 s [algebraic-graphs] OK: vertices [] [] == empty
  21369. 1580.54 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21370. 1580.54 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21371. 1580.54 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21372. 1580.54 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21373. 1580.54 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21374. 1580.54 s [algebraic-graphs]
  21375. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21376. 1580.54 s [algebraic-graphs] OK: edges [] == empty
  21377. 1580.54 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21378. 1580.54 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21379. 1580.54 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21380. 1580.54 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21381. 1580.54 s [algebraic-graphs]
  21382. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21383. 1580.54 s [algebraic-graphs] OK: overlays [] == empty
  21384. 1580.54 s [algebraic-graphs] OK: overlays [x] == x
  21385. 1580.54 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21386. 1580.54 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21387. 1580.54 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21388. 1580.54 s [algebraic-graphs]
  21389. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21390. 1580.54 s [algebraic-graphs] OK: connects [] == empty
  21391. 1580.54 s [algebraic-graphs] OK: connects [x] == x
  21392. 1580.54 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21393. 1580.54 s [algebraic-graphs] OK: connects == foldr connect empty
  21394. 1580.54 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21395. 1580.54 s [algebraic-graphs]
  21396. 1580.54 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21397. 1581.89 s [algebraic-graphs] OK: swap empty == empty
  21398. 1581.89 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21399. 1581.89 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21400. 1581.93 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21401. 1581.93 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21402. 1581.93 s [algebraic-graphs] OK: swap . swap == id
  21403. 1581.93 s [algebraic-graphs]
  21404. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21405. 1581.93 s [algebraic-graphs] OK: toBipartite empty == empty
  21406. 1581.93 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21407. 1581.93 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21408. 1581.93 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21409. 1581.93 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21410. 1581.93 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21411. 1581.93 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21412. 1581.93 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21413. 1581.93 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21414. 1581.93 s [algebraic-graphs]
  21415. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21416. 1581.93 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21417. 1581.93 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21418. 1581.93 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21419. 1581.93 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21420. 1581.93 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21421. 1581.93 s [algebraic-graphs]
  21422. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21423. 1581.93 s [algebraic-graphs] OK: fromBipartite empty == empty
  21424. 1581.93 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21425. 1581.93 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21426. 1581.93 s [algebraic-graphs]
  21427. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21428. 1581.93 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21429. 1581.93 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21430. 1581.93 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21431. 1581.93 s [algebraic-graphs]
  21432. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21433. 1581.93 s [algebraic-graphs] OK: isEmpty empty == True
  21434. 1581.93 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21435. 1581.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21436. 1581.93 s [algebraic-graphs] OK: isEmpty == (==) empty
  21437. 1581.93 s [algebraic-graphs]
  21438. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21439. 1581.93 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21440. 1581.93 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21441. 1581.93 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21442. 1581.93 s [algebraic-graphs]
  21443. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21444. 1581.93 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21445. 1581.93 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21446. 1581.93 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21447. 1581.93 s [algebraic-graphs]
  21448. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21449. 1581.93 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21450. 1581.93 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21451. 1581.93 s [algebraic-graphs]
  21452. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21453. 1581.93 s [algebraic-graphs] OK: hasEdge x y empty == False
  21454. 1581.93 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21455. 1581.93 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21456. 1581.93 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21457. 1581.93 s [algebraic-graphs]
  21458. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21459. 1581.93 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21460. 1581.93 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21461. 1581.93 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21462. 1581.93 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21463. 1581.93 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21464. 1581.93 s [algebraic-graphs]
  21465. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21466. 1581.93 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21467. 1581.93 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21468. 1581.93 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21469. 1581.93 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21470. 1581.93 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21471. 1581.93 s [algebraic-graphs]
  21472. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21473. 1581.93 s [algebraic-graphs] OK: vertexCount empty == 0
  21474. 1581.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21475. 1581.93 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21476. 1581.93 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21477. 1581.93 s [algebraic-graphs]
  21478. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21479. 1581.93 s [algebraic-graphs] OK: edgeCount empty == 0
  21480. 1581.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21481. 1581.93 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21482. 1581.93 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21483. 1581.93 s [algebraic-graphs]
  21484. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21485. 1581.93 s [algebraic-graphs] OK: leftVertexList empty == []
  21486. 1581.93 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21487. 1581.93 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21488. 1581.93 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21489. 1581.93 s [algebraic-graphs]
  21490. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21491. 1581.93 s [algebraic-graphs] OK: rightVertexList empty == []
  21492. 1581.93 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21493. 1581.93 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21494. 1581.93 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21495. 1581.93 s [algebraic-graphs]
  21496. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21497. 1581.93 s [algebraic-graphs] OK: vertexList empty == []
  21498. 1581.93 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21499. 1581.93 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21500. 1581.93 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21501. 1581.93 s [algebraic-graphs]
  21502. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21503. 1581.93 s [algebraic-graphs] OK: edgeList empty == []
  21504. 1581.93 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21505. 1581.93 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21506. 1581.93 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21507. 1581.93 s [algebraic-graphs]
  21508. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21509. 1581.93 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21510. 1581.93 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21511. 1581.93 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21512. 1581.93 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21513. 1581.93 s [algebraic-graphs]
  21514. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21515. 1581.93 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21516. 1581.93 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21517. 1581.93 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21518. 1581.93 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21519. 1581.93 s [algebraic-graphs]
  21520. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21521. 1581.93 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21522. 1581.93 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21523. 1581.93 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21524. 1581.93 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21525. 1581.93 s [algebraic-graphs]
  21526. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21527. 1581.93 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21528. 1581.93 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21529. 1581.93 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21530. 1581.93 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21531. 1581.93 s [algebraic-graphs]
  21532. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21533. 1581.93 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21534. 1581.93 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21535. 1581.93 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21536. 1581.93 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21537. 1581.93 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21538. 1581.93 s [algebraic-graphs]
  21539. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21540. 1581.93 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21541. 1581.93 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21542. 1581.93 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21543. 1581.93 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21544. 1581.93 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21545. 1581.93 s [algebraic-graphs]
  21546. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21547. 1581.93 s [algebraic-graphs] OK: evenList [] == Nil
  21548. 1581.93 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21549. 1581.93 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21550. 1581.93 s [algebraic-graphs]
  21551. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21552. 1581.93 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21553. 1581.93 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21554. 1581.93 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21555. 1581.93 s [algebraic-graphs]
  21556. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21557. 1581.93 s [algebraic-graphs] OK: path Nil == empty
  21558. 1581.93 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21559. 1581.93 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21560. 1581.93 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21561. 1581.93 s [algebraic-graphs]
  21562. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21563. 1581.93 s [algebraic-graphs] OK: circuit [] == empty
  21564. 1581.93 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21565. 1581.93 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21566. 1581.93 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21567. 1581.93 s [algebraic-graphs]
  21568. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21569. 1581.93 s [algebraic-graphs] OK: biclique [] [] == empty
  21570. 1581.93 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21571. 1581.93 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21572. 1581.93 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21573. 1581.93 s [algebraic-graphs]
  21574. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21575. 1581.93 s [algebraic-graphs] OK: star x [] == leftVertex x
  21576. 1581.93 s [algebraic-graphs] OK: star x [y] == edge x y
  21577. 1581.93 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21578. 1581.93 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21579. 1581.93 s [algebraic-graphs]
  21580. 1581.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21581. 1581.93 s [algebraic-graphs] OK: stars [] == empty
  21582. 1581.93 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21583. 1581.94 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21584. 1581.94 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21585. 1594.43 s [haskell-language-server] Preprocessing library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
  21586. 1594.44 s [haskell-language-server] Building library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0..
  21587. 1594.56 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.o, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.dyn_o )
  21588. 1594.97 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21589. 1594.97 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21590. 1594.97 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21591. 1594.97 s [algebraic-graphs]
  21592. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21593. 1594.97 s [algebraic-graphs] OK: mesh xs [] == empty
  21594. 1594.97 s [algebraic-graphs] OK: mesh [] ys == empty
  21595. 1594.97 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21596. 1594.97 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21597. 1594.97 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21598. 1594.97 s [algebraic-graphs]
  21599. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21600. 1594.97 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21601. 1594.97 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21602. 1594.97 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21603. 1594.97 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21604. 1594.97 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21605. 1594.97 s [algebraic-graphs]
  21606. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21607. 1594.97 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21608. 1594.97 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21609. 1594.97 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21610. 1594.97 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21611. 1594.97 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21612. 1594.97 s [algebraic-graphs]
  21613. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21614. 1594.97 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21615. 1594.97 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21616. 1594.97 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21617. 1594.97 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21618. 1594.97 s [algebraic-graphs]
  21619. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21620. 1594.97 s [algebraic-graphs] OK: bimap f g empty == empty
  21621. 1594.97 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21622. 1594.97 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21623. 1594.97 s [algebraic-graphs] OK: bimap id id == id
  21624. 1594.97 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21625. 1594.97 s [algebraic-graphs]
  21626. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21627. 1594.97 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21628. 1594.97 s [algebraic-graphs]
  21629. 1594.97 s [algebraic-graphs] OK: box x y ~~ box y x
  21630. 1594.97 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21631. 1594.97 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21632. 1594.97 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21633. 1594.97 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21634. 1594.97 s [algebraic-graphs] OK: box x empty ~~ empty
  21635. 1594.97 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21636. 1594.97 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21637. 1594.97 s [algebraic-graphs]
  21638. 1594.97 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21639. 1594.97 s [algebraic-graphs]
  21640. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21641. 1594.97 s [algebraic-graphs] OK: consistent empty == True
  21642. 1594.97 s [algebraic-graphs] OK: consistent (vertex x) == True
  21643. 1594.97 s [algebraic-graphs] OK: consistent (edge x y) == True
  21644. 1594.97 s [algebraic-graphs] OK: consistent (edges x) == True
  21645. 1594.97 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21646. 1594.97 s [algebraic-graphs] OK: consistent (swap x) == True
  21647. 1594.97 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21648. 1594.97 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21649. 1594.97 s [algebraic-graphs]
  21650. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21651. 1594.97 s [algebraic-graphs] OK: detectParts empty == Right empty
  21652. 1594.97 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21653. 1594.97 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21654. 1594.97 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21655. 1594.97 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21656. 1594.97 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21657. 1594.97 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21658. 1594.97 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21659. 1594.97 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21660. 1594.97 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21661. 1594.97 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21662. 1594.97 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21663. 1594.97 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21664. 1594.97 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21665. 1594.97 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21666. 1594.97 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21667. 1594.97 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21668. 1594.97 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21669. 1594.97 s [algebraic-graphs]
  21670. 1594.97 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21671. 1594.97 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21672. 1594.97 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21673. 1594.97 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21674. 1594.97 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21675. 1594.97 s [algebraic-graphs]
  21676. 1594.97 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21677. 1594.97 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21678. 1594.97 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21679. 1594.97 s [algebraic-graphs]
  21680. 1594.97 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21681. 1594.97 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21682. 1594.97 s [algebraic-graphs]
  21683. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21684. 1594.97 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21685. 1594.97 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21686. 1594.97 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21687. 1594.97 s [algebraic-graphs]
  21688. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21689. 1594.97 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21690. 1594.97 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21691. 1594.97 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21692. 1594.97 s [algebraic-graphs]
  21693. 1594.97 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21694. 1594.98 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21695. 1594.98 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21696. 1594.98 s [algebraic-graphs]
  21697. 1594.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21698. 1594.98 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21699. 1594.98 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21700. 1594.98 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21701. 1594.98 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21702. 1594.98 s [algebraic-graphs]
  21703. 1594.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21704. 1594.98 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21705. 1594.98 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21706. 1594.98 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21707. 1594.98 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21708. 1594.98 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21709. 1594.98 s [algebraic-graphs]
  21710. 1594.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21711. 1594.98 s [algebraic-graphs] OK: maxMatching empty == matching []
  21712. 1594.98 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21713. 1594.98 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21714. 1594.98 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21715. 1594.98 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21716. 1594.98 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21717. 1594.98 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21718. 1594.98 s [algebraic-graphs]
  21719. 1594.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21720. 1594.98 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21721. 1594.98 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21722. 1594.98 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21723. 1594.98 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21724. 1594.98 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21725. 1594.98 s [algebraic-graphs]
  21726. 1594.98 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21727. 1594.98 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21728. 1595.49 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.GADT ( plugins/hls-gadt-plugin/src/Ide/Plugin/GADT.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.o, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.dyn_o )
  21729. 1597.24 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21730. 1597.24 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21731. 1597.24 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21732. 1597.24 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21733. 1597.24 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21734. 1597.24 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21735. 1597.24 s [algebraic-graphs]
  21736. 1597.24 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21737. 1597.24 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21738. 1597.24 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21739. 1597.24 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21740. 1597.24 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21741. 1597.24 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21742. 1597.24 s [algebraic-graphs]
  21743. 1597.24 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21744. 1597.24 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21745. 1597.24 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21746. 1597.24 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21747. 1597.24 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21748. 1597.24 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21749. 1597.24 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21750. 1597.24 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21751. 1597.24 s [algebraic-graphs]
  21752. 1597.24 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21753. 1597.24 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21754. 1597.24 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21755. 1597.24 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21756. 1597.24 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21757. 1597.24 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21758. 1597.24 s [algebraic-graphs]
  21759. 1597.24 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21760. 1597.24 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21761. 1597.24 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21762. 1597.24 s [algebraic-graphs]
  21763. 1597.24 s [algebraic-graphs] ============ Export.Eq ============
  21764. 1597.24 s [algebraic-graphs] OK: mempty /= literal ""
  21765. 1597.24 s [algebraic-graphs]
  21766. 1597.24 s [algebraic-graphs] ============ Export.Ord ============
  21767. 1597.24 s [algebraic-graphs] OK: mempty < literal ""
  21768. 1597.24 s [algebraic-graphs]
  21769. 1597.24 s [algebraic-graphs] ============ Export.isEmpty ============
  21770. 1597.24 s [algebraic-graphs] OK: isEmpty mempty == True
  21771. 1597.24 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21772. 1597.24 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21773. 1597.24 s [algebraic-graphs]
  21774. 1597.24 s [algebraic-graphs] ============ Export.literal ============
  21775. 1597.24 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21776. 1597.25 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21777. 1597.25 s [algebraic-graphs] OK: render . literal == id
  21778. 1597.25 s [algebraic-graphs]
  21779. 1597.25 s [algebraic-graphs] ============ Export.render ============
  21780. 1597.25 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21781. 1597.25 s [algebraic-graphs] OK: render mempty == mempty
  21782. 1597.25 s [algebraic-graphs]
  21783. 1597.25 s [algebraic-graphs] ============ Export.<+> ============
  21784. 1597.25 s [algebraic-graphs] OK: x <+> mempty == x
  21785. 1597.25 s [algebraic-graphs] OK: mempty <+> x == x
  21786. 1597.25 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21787. 1597.25 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21788. 1597.25 s [algebraic-graphs]
  21789. 1597.25 s [algebraic-graphs] ============ Export.brackets ============
  21790. 1597.25 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21791. 1597.25 s [algebraic-graphs] OK: brackets mempty == "[]"
  21792. 1597.25 s [algebraic-graphs]
  21793. 1597.25 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21794. 1597.25 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21795. 1597.25 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21796. 1597.25 s [algebraic-graphs]
  21797. 1597.25 s [algebraic-graphs] ============ Export.indent ============
  21798. 1597.25 s [algebraic-graphs] OK: indent 0 == id
  21799. 1597.25 s [algebraic-graphs] OK: indent 1 mempty == " "
  21800. 1597.25 s [algebraic-graphs]
  21801. 1597.25 s [algebraic-graphs] ============ Export.unlines ============
  21802. 1597.25 s [algebraic-graphs] OK: unlines [] == mempty
  21803. 1597.25 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21804. 1597.25 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21805. 1597.25 s [algebraic-graphs]
  21806. 1597.25 s [algebraic-graphs] ============ Export.export ============
  21807. 1597.25 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21808. 1597.25 s [algebraic-graphs]
  21809. 1597.25 s [algebraic-graphs] ============ Export.Dot.export ============
  21810. 1597.25 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21811. 1597.25 s [algebraic-graphs]
  21812. 1597.25 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21813. 1597.25 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21814. 1597.25 s [algebraic-graphs]
  21815. 1597.25 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21816. 1597.25 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21817. 1597.25 s [algebraic-graphs]
  21818. 1597.25 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21819. 1597.25 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21820. 1597.25 s [algebraic-graphs]
  21821. 1597.25 s [algebraic-graphs] ============ Graph ============
  21822. 1597.25 s [algebraic-graphs] OK: Axioms of graphs
  21823. 1597.25 s [algebraic-graphs] OK: Theorems of graphs
  21824. 1597.25 s [algebraic-graphs]
  21825. 1597.25 s [algebraic-graphs] ============ Graph.Ord ============
  21826. 1597.25 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21827. 1597.25 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21828. 1597.25 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21829. 1597.25 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21830. 1597.25 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21831. 1597.25 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21832. 1597.25 s [algebraic-graphs] OK: x <= x + y
  21833. 1597.25 s [algebraic-graphs] OK: x + y <= x * y
  21834. 1597.25 s [algebraic-graphs]
  21835. 1597.25 s [algebraic-graphs] ============ Graph.empty ============
  21836. 1597.25 s [algebraic-graphs] OK: isEmpty empty == True
  21837. 1597.25 s [algebraic-graphs] OK: hasVertex x empty == False
  21838. 1597.25 s [algebraic-graphs] OK: vertexCount empty == 0
  21839. 1597.25 s [algebraic-graphs] OK: edgeCount empty == 0
  21840. 1597.25 s [algebraic-graphs]
  21841. 1597.25 s [algebraic-graphs] ============ Graph.vertex ============
  21842. 1597.25 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21843. 1597.25 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21844. 1597.25 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21845. 1597.25 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21846. 1597.25 s [algebraic-graphs]
  21847. 1597.25 s [algebraic-graphs] ============ Graph.edge ============
  21848. 1597.25 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21849. 1597.25 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21850. 1597.25 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21851. 1597.25 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21852. 1597.25 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21853. 1597.25 s [algebraic-graphs]
  21854. 1597.25 s [algebraic-graphs] ============ Graph.overlay ============
  21855. 1597.25 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21856. 1597.25 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21857. 1597.25 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21858. 1597.25 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21859. 1597.25 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21860. 1597.25 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21861. 1597.25 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21862. 1597.25 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21863. 1597.25 s [algebraic-graphs]
  21864. 1597.25 s [algebraic-graphs] ============ Graph.connect ============
  21865. 1597.25 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21866. 1597.25 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21867. 1597.25 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21868. 1597.25 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21869. 1597.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21870. 1597.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21871. 1597.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21872. 1597.25 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21873. 1597.25 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21874. 1597.25 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21875. 1597.25 s [algebraic-graphs]
  21876. 1597.25 s [algebraic-graphs] ============ Graph.vertices ============
  21877. 1597.25 s [algebraic-graphs] OK: vertices [] == empty
  21878. 1597.25 s [algebraic-graphs] OK: vertices [x] == vertex x
  21879. 1597.25 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21880. 1597.25 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21881. 1597.25 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21882. 1597.25 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21883. 1597.25 s [algebraic-graphs]
  21884. 1597.25 s [algebraic-graphs] ============ Graph.edges ============
  21885. 1597.25 s [algebraic-graphs] OK: edges [] == empty
  21886. 1597.25 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21887. 1597.25 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21888. 1597.25 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21889. 1597.25 s [algebraic-graphs]
  21890. 1597.25 s [algebraic-graphs] ============ Graph.overlays ============
  21891. 1597.25 s [algebraic-graphs] OK: overlays [] == empty
  21892. 1597.25 s [algebraic-graphs] OK: overlays [x] == x
  21893. 1597.25 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21894. 1597.25 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21895. 1597.25 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21896. 1597.25 s [algebraic-graphs]
  21897. 1597.25 s [algebraic-graphs] ============ Graph.connects ============
  21898. 1597.25 s [algebraic-graphs] OK: connects [] == empty
  21899. 1597.25 s [algebraic-graphs] OK: connects [x] == x
  21900. 1597.25 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21901. 1597.25 s [algebraic-graphs] OK: connects == foldr connect empty
  21902. 1597.25 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21903. 1597.25 s [algebraic-graphs]
  21904. 1597.25 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21905. 1597.25 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21906. 1597.25 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21907. 1597.25 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21908. 1597.25 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21909. 1597.25 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21910. 1597.25 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21911. 1597.25 s [algebraic-graphs]
  21912. 1597.25 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21913. 1597.25 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21914. 1597.25 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21915. 1597.25 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21916. 1597.25 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21917. 1597.25 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21918. 1597.25 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21919. 1597.25 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21920. 1597.25 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21921. 1597.25 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21922. 1597.70 s [haskell-language-server] [1 of 2] Compiling Ide.Plugin.GHC ( plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GHC.p_o )
  21923. 1598.02 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21924. 1598.02 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21925. 1598.02 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21926. 1598.02 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21927. 1598.02 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21928. 1598.02 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21929. 1598.02 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21930. 1598.02 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21931. 1598.02 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21932. 1598.02 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21933. 1598.02 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21934. 1598.02 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21935. 1598.02 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21936. 1598.02 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21937. 1598.02 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21938. 1598.02 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21939. 1598.02 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21940. 1598.02 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21941. 1598.02 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21942. 1598.02 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21943. 1598.02 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21944. 1598.02 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21945. 1598.02 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21946. 1598.02 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21947. 1598.02 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21948. 1598.02 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21949. 1598.02 s [algebraic-graphs]
  21950. 1598.02 s [algebraic-graphs] ============ Graph.foldg ============
  21951. 1598.02 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21952. 1598.02 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21953. 1598.02 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21954. 1598.02 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21955. 1598.02 s [algebraic-graphs]
  21956. 1598.02 s [algebraic-graphs] ============ Graph.isEmpty ============
  21957. 1598.02 s [algebraic-graphs] OK: isEmpty empty == True
  21958. 1598.02 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21959. 1598.02 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21960. 1598.02 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21961. 1598.02 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21962. 1598.02 s [algebraic-graphs]
  21963. 1598.02 s [algebraic-graphs] ============ Graph.hasVertex ============
  21964. 1598.02 s [algebraic-graphs] OK: hasVertex x empty == False
  21965. 1598.02 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21966. 1598.02 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21967. 1598.02 s [algebraic-graphs]
  21968. 1598.02 s [algebraic-graphs] ============ Graph.hasEdge ============
  21969. 1598.02 s [algebraic-graphs] OK: hasEdge x y empty == False
  21970. 1598.02 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21971. 1598.02 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21972. 1598.02 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21973. 1598.02 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21974. 1598.02 s [algebraic-graphs]
  21975. 1598.02 s [algebraic-graphs] ============ Graph.vertexCount ============
  21976. 1598.02 s [algebraic-graphs] OK: vertexCount empty == 0
  21977. 1598.02 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21978. 1598.02 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21979. 1598.02 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21980. 1598.03 s [algebraic-graphs]
  21981. 1598.03 s [algebraic-graphs] ============ Graph.edgeCount ============
  21982. 1598.03 s [algebraic-graphs] OK: edgeCount empty == 0
  21983. 1598.03 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21984. 1598.03 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21985. 1598.03 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21986. 1598.03 s [algebraic-graphs]
  21987. 1598.03 s [algebraic-graphs] ============ Graph.vertexList ============
  21988. 1598.03 s [algebraic-graphs] OK: vertexList empty == []
  21989. 1598.03 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21990. 1598.03 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21991. 1598.03 s [algebraic-graphs]
  21992. 1598.03 s [algebraic-graphs] ============ Graph.vertexSet ============
  21993. 1598.03 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21994. 1598.03 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21995. 1598.03 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21996. 1598.03 s [algebraic-graphs]
  21997. 1598.03 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21998. 1598.03 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21999. 1598.03 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  22000. 1598.03 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  22001. 1598.03 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  22002. 1598.03 s [algebraic-graphs]
  22003. 1598.03 s [algebraic-graphs] ============ Graph.edgeList ============
  22004. 1598.03 s [algebraic-graphs] OK: edgeList empty == []
  22005. 1598.03 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22006. 1598.03 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22007. 1598.03 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22008. 1598.03 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  22009. 1598.03 s [algebraic-graphs]
  22010. 1598.03 s [algebraic-graphs] ============ Graph.edgeSet ============
  22011. 1598.03 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22012. 1598.03 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22013. 1598.03 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22014. 1598.03 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  22015. 1598.03 s [algebraic-graphs]
  22016. 1598.03 s [algebraic-graphs] ============ Graph.adjacencyList ============
  22017. 1598.03 s [algebraic-graphs] OK: adjacencyList empty == []
  22018. 1598.03 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  22019. 1598.03 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  22020. 1598.03 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  22021. 1598.03 s [algebraic-graphs]
  22022. 1598.03 s [algebraic-graphs] ============ Graph.preSet ============
  22023. 1598.03 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22024. 1598.03 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22025. 1598.03 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22026. 1598.03 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22027. 1598.03 s [algebraic-graphs]
  22028. 1598.03 s [algebraic-graphs] ============ Graph.preIntSet ============
  22029. 1598.03 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  22030. 1598.03 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  22031. 1598.03 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  22032. 1598.03 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  22033. 1598.03 s [algebraic-graphs]
  22034. 1598.03 s [algebraic-graphs] ============ Graph.postSet ============
  22035. 1598.03 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22036. 1598.03 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22037. 1598.03 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22038. 1598.03 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22039. 1598.03 s [algebraic-graphs]
  22040. 1598.03 s [algebraic-graphs] ============ Graph.postIntSet ============
  22041. 1598.03 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  22042. 1598.03 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  22043. 1598.03 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  22044. 1598.03 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  22045. 1598.03 s [algebraic-graphs]
  22046. 1598.03 s [algebraic-graphs] ============ Graph.size ============
  22047. 1598.03 s [algebraic-graphs] OK: size empty == 1
  22048. 1598.03 s [algebraic-graphs] OK: size (vertex x) == 1
  22049. 1598.03 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22050. 1598.03 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22051. 1598.03 s [algebraic-graphs] OK: size x >= 1
  22052. 1598.03 s [algebraic-graphs] OK: size x >= vertexCount x
  22053. 1598.03 s [algebraic-graphs]
  22054. 1598.03 s [algebraic-graphs] ============ Graph.path ============
  22055. 1598.03 s [algebraic-graphs] OK: path [] == empty
  22056. 1598.03 s [algebraic-graphs] OK: path [x] == vertex x
  22057. 1598.03 s [algebraic-graphs] OK: path [x,y] == edge x y
  22058. 1598.03 s [algebraic-graphs]
  22059. 1598.03 s [algebraic-graphs] ============ Graph.circuit ============
  22060. 1598.03 s [algebraic-graphs] OK: circuit [] == empty
  22061. 1598.03 s [algebraic-graphs] OK: circuit [x] == edge x x
  22062. 1598.03 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  22063. 1598.03 s [algebraic-graphs]
  22064. 1598.03 s [algebraic-graphs] ============ Graph.clique ============
  22065. 1598.03 s [algebraic-graphs] OK: clique [] == empty
  22066. 1598.03 s [algebraic-graphs] OK: clique [x] == vertex x
  22067. 1598.03 s [algebraic-graphs] OK: clique [x,y] == edge x y
  22068. 1598.03 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  22069. 1598.03 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  22070. 1598.03 s [algebraic-graphs]
  22071. 1598.03 s [algebraic-graphs] ============ Graph.biclique ============
  22072. 1598.03 s [algebraic-graphs] OK: biclique [] [] == empty
  22073. 1598.03 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  22074. 1598.03 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  22075. 1598.03 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22076. 1598.03 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  22077. 1598.03 s [algebraic-graphs]
  22078. 1598.03 s [algebraic-graphs] ============ Graph.star ============
  22079. 1598.03 s [algebraic-graphs] OK: star x [] == vertex x
  22080. 1598.03 s [algebraic-graphs] OK: star x [y] == edge x y
  22081. 1598.03 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  22082. 1598.03 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  22083. 1598.03 s [algebraic-graphs]
  22084. 1598.03 s [algebraic-graphs] ============ Graph.stars ============
  22085. 1598.03 s [algebraic-graphs] OK: stars [] == empty
  22086. 1598.03 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  22087. 1598.03 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  22088. 1598.03 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  22089. 1598.03 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  22090. 1598.03 s [algebraic-graphs] OK: stars . adjacencyList == id
  22091. 1598.03 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  22092. 1598.03 s [algebraic-graphs]
  22093. 1598.03 s [algebraic-graphs] ============ Graph.tree ============
  22094. 1598.03 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22095. 1598.03 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  22096. 1598.03 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22097. 1598.03 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  22098. 1598.03 s [algebraic-graphs]
  22099. 1598.03 s [algebraic-graphs] ============ Graph.forest ============
  22100. 1598.03 s [algebraic-graphs] OK: forest [] == empty
  22101. 1598.03 s [algebraic-graphs] OK: forest [x] == tree x
  22102. 1598.03 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  22103. 1598.03 s [algebraic-graphs] OK: forest == overlays . map tree
  22104. 1598.03 s [algebraic-graphs]
  22105. 1598.03 s [algebraic-graphs] ============ Graph.removeVertex ============
  22106. 1598.67 s [haskell-language-server] [2 of 2] Compiling Ide.Plugin.GADT ( plugins/hls-gadt-plugin/src/Ide/Plugin/GADT.hs, dist/build/hls-gadt-plugin/Ide/Plugin/GADT.p_o )
  22107. 1601.48 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22108. 1601.48 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22109. 1601.48 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  22110. 1601.59 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  22111. 1601.59 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22112. 1601.59 s [algebraic-graphs]
  22113. 1601.59 s [algebraic-graphs] ============ Graph.removeEdge ============
  22114. 1601.59 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  22115. 1601.59 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22116. 1601.59 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22117. 1601.59 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22118. 1601.59 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22119. 1601.59 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22120. 1601.59 s [algebraic-graphs]
  22121. 1601.59 s [algebraic-graphs] ============ Graph.replaceVertex ============
  22122. 1601.59 s [algebraic-graphs] OK: replaceVertex x x == id
  22123. 1601.59 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22124. 1601.59 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22125. 1601.59 s [algebraic-graphs]
  22126. 1601.59 s [algebraic-graphs] ============ Graph.mergeVertices ============
  22127. 1601.59 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22128. 1601.59 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22129. 1601.59 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22130. 1601.59 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22131. 1601.59 s [algebraic-graphs]
  22132. 1601.59 s [algebraic-graphs] ============ Graph.transpose ============
  22133. 1601.59 s [algebraic-graphs] OK: transpose empty == empty
  22134. 1601.59 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22135. 1601.59 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22136. 1601.59 s [algebraic-graphs] OK: transpose . transpose == id
  22137. 1601.60 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22138. 1601.60 s [algebraic-graphs]
  22139. 1601.60 s [algebraic-graphs] ============ Graph.gmap ============
  22140. 1601.60 s [algebraic-graphs] OK: gmap f empty == empty
  22141. 1601.60 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22142. 1601.60 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22143. 1601.60 s [algebraic-graphs] OK: gmap id == id
  22144. 1601.60 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22145. 1601.60 s [algebraic-graphs]
  22146. 1601.60 s [algebraic-graphs] ============ Graph.induce ============
  22147. 1601.60 s [algebraic-graphs] OK: induce (const True ) x == x
  22148. 1601.60 s [algebraic-graphs] OK: induce (const False) x == empty
  22149. 1601.60 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22150. 1601.60 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22151. 1601.60 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22152. 1601.60 s [algebraic-graphs]
  22153. 1601.60 s [algebraic-graphs] ============ Graph.induceJust ============
  22154. 1601.60 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22155. 1601.60 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22156. 1601.60 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22157. 1601.60 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22158. 1601.60 s [algebraic-graphs]
  22159. 1601.60 s [algebraic-graphs] ============ Graph.compose ============
  22160. 1601.60 s [algebraic-graphs] OK: compose empty x == empty
  22161. 1601.60 s [algebraic-graphs] OK: compose x empty == empty
  22162. 1601.60 s [algebraic-graphs] OK: compose (vertex x) y == empty
  22163. 1601.60 s [algebraic-graphs] OK: compose x (vertex y) == empty
  22164. 1601.60 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  22165. 1601.60 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  22166. 1601.60 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  22167. 1601.60 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  22168. 1601.60 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  22169. 1601.60 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  22170. 1601.60 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  22171. 1601.60 s [algebraic-graphs]
  22172. 1601.60 s [algebraic-graphs] ============ Graph.(===) ============
  22173. 1601.60 s [algebraic-graphs] OK: x === x == True
  22174. 1601.60 s [algebraic-graphs] OK: x === x + empty == False
  22175. 1601.60 s [algebraic-graphs] OK: x + y === x + y == True
  22176. 1601.60 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22177. 1601.60 s [algebraic-graphs] OK: x + y === x * y == False
  22178. 1601.60 s [algebraic-graphs]
  22179. 1601.60 s [algebraic-graphs] ============ Graph.mesh ============
  22180. 1601.60 s [algebraic-graphs] OK: mesh xs [] == empty
  22181. 1601.60 s [algebraic-graphs] OK: mesh [] ys == empty
  22182. 1601.60 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  22183. 1601.60 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  22184. 1601.60 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  22185. 1601.60 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22186. 1601.60 s [algebraic-graphs]
  22187. 1601.60 s [algebraic-graphs] ============ Graph.torus ============
  22188. 1601.60 s [algebraic-graphs] OK: torus xs [] == empty
  22189. 1601.60 s [algebraic-graphs] OK: torus [] ys == empty
  22190. 1601.60 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  22191. 1601.60 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  22192. 1601.60 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  22193. 1601.60 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  22194. 1601.60 s [algebraic-graphs]
  22195. 1601.60 s [algebraic-graphs] ============ Graph.deBruijn ============
  22196. 1601.60 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  22197. 1601.60 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  22198. 1601.60 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  22199. 1601.60 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  22200. 1601.60 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  22201. 1601.60 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  22202. 1601.60 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  22203. 1601.60 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  22204. 1601.60 s [algebraic-graphs]
  22205. 1601.60 s [algebraic-graphs] ============ Graph.splitVertex ============
  22206. 1601.60 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  22207. 1601.60 s [algebraic-graphs] OK: splitVertex x [x] == id
  22208. 1601.60 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  22209. 1601.60 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22210. 1601.60 s [algebraic-graphs]
  22211. 1601.60 s [algebraic-graphs] ============ Graph.bind ============
  22212. 1601.60 s [algebraic-graphs] OK: bind empty f == empty
  22213. 1601.60 s [algebraic-graphs] OK: bind (vertex x) f == f x
  22214. 1601.60 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  22215. 1601.60 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  22216. 1601.60 s [algebraic-graphs] OK: bind x (const empty) == empty
  22217. 1601.60 s [algebraic-graphs] OK: bind x vertex == x
  22218. 1601.60 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  22219. 1601.60 s [algebraic-graphs]
  22220. 1601.60 s [algebraic-graphs] ============ Graph.simplify ============
  22221. 1601.60 s [algebraic-graphs] OK: simplify == id
  22222. 1601.60 s [algebraic-graphs] OK: size (simplify x) <= size x
  22223. 1601.60 s [algebraic-graphs]
  22224. 1601.60 s [algebraic-graphs] ============ Graph.box ============
  22225. 1601.60 s [algebraic-graphs] OK: box x y ~~ box y x
  22226. 1601.60 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22227. 1601.60 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22228. 1601.60 s [algebraic-graphs] OK: box x empty ~~ empty
  22229. 1601.60 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22230. 1601.60 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22231. 1601.60 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22232. 1601.60 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22233. 1601.60 s [algebraic-graphs]
  22234. 1601.60 s [algebraic-graphs] ============ Graph.sparsify ============
  22235. 1601.60 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22236. 1601.60 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22237. 1601.60 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22238. 1601.60 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22239. 1601.60 s [algebraic-graphs]
  22240. 1601.60 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  22241. 1601.60 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22242. 1601.60 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22243. 1601.60 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22244. 1601.60 s [algebraic-graphs]
  22245. 1601.60 s [algebraic-graphs] ============ Graph.context ============
  22246. 1601.60 s [algebraic-graphs] OK: context (const False) x == Nothing
  22247. 1601.60 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  22248. 1601.60 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  22249. 1601.60 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  22250. 1601.60 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  22251. 1601.60 s [algebraic-graphs]
  22252. 1601.60 s [algebraic-graphs] ============ Graph.buildg ============
  22253. 1601.60 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  22254. 1601.60 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  22255. 1601.60 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
  22256. 1601.60 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
  22257. 1601.60 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  22258. 1601.60 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  22259. 1601.60 s [algebraic-graphs]
  22260. 1601.60 s [algebraic-graphs] ============ Internal.List ============
  22261. 1601.60 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  22262. 1601.60 s [algebraic-graphs]
  22263. 1601.60 s [algebraic-graphs] ============ Graph.Label ============
  22264. 1601.60 s [algebraic-graphs]
  22265. 1601.60 s [algebraic-graphs] ============ Any: instances ============
  22266. 1601.60 s [algebraic-graphs] OK: Semiring
  22267. 1601.60 s [algebraic-graphs] OK: StarSemiring
  22268. 1601.60 s [algebraic-graphs] OK: Dioid
  22269. 1601.60 s [algebraic-graphs]
  22270. 1601.60 s [algebraic-graphs] ============ Distance Int: instances ============
  22271. 1601.60 s [algebraic-graphs] OK: Semiring
  22272. 1601.60 s [algebraic-graphs] OK: StarSemiring
  22273. 1601.60 s [algebraic-graphs] OK: Dioid
  22274. 1601.60 s [algebraic-graphs]
  22275. 1601.60 s [algebraic-graphs] ============ Capacity Int: instances ============
  22276. 1601.60 s [algebraic-graphs] OK: Semiring
  22277. 1601.60 s [algebraic-graphs] OK: StarSemiring
  22278. 1601.60 s [algebraic-graphs] OK: Dioid
  22279. 1601.60 s [algebraic-graphs]
  22280. 1601.60 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  22281. 1601.60 s [algebraic-graphs] OK: LeftNearRing
  22282. 1601.60 s [algebraic-graphs]
  22283. 1601.60 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  22284. 1601.60 s [algebraic-graphs] OK: Semiring
  22285. 1601.60 s [algebraic-graphs] OK: Dioid
  22286. 1601.60 s [algebraic-graphs]
  22287. 1601.60 s [algebraic-graphs] ============ Count Int: instances ============
  22288. 1601.60 s [algebraic-graphs] OK: Semiring
  22289. 1601.60 s [algebraic-graphs] OK: StarSemiring
  22290. 1601.60 s [algebraic-graphs]
  22291. 1601.60 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  22292. 1601.60 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  22293. 1601.60 s [algebraic-graphs] OK: empty
  22294. 1601.60 s [algebraic-graphs] OK: vertex
  22295. 1601.60 s [algebraic-graphs] OK: edge
  22296. 1601.60 s [algebraic-graphs] OK: overlay
  22297. 1601.60 s [algebraic-graphs] OK: connect
  22298. 1601.60 s [algebraic-graphs] OK: vertices
  22299. 1601.60 s [algebraic-graphs] OK: edges
  22300. 1601.60 s [algebraic-graphs] OK: overlays
  22301. 1601.60 s [algebraic-graphs] OK: fromAdjacencyMaps
  22302. 1601.60 s [algebraic-graphs] OK: removeVertex
  22303. 1601.60 s [algebraic-graphs] OK: removeEdge
  22304. 1601.60 s [algebraic-graphs] OK: replaceVertex
  22305. 1601.60 s [algebraic-graphs] OK: replaceEdge
  22306. 1601.60 s [algebraic-graphs] OK: transpose
  22307. 1601.60 s [algebraic-graphs] OK: gmap
  22308. 1601.60 s [algebraic-graphs] OK: emap
  22309. 1601.60 s [algebraic-graphs] OK: induce
  22310. 1601.60 s [algebraic-graphs] OK: closure
  22311. 1601.60 s [algebraic-graphs] OK: reflexiveClosure
  22312. 1601.60 s [algebraic-graphs] OK: symmetricClosure
  22313. 1601.60 s [algebraic-graphs] OK: transitiveClosure
  22314. 1601.60 s [algebraic-graphs]
  22315. 1601.60 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  22316. 1601.60 s [algebraic-graphs] OK: isEmpty empty == True
  22317. 1601.60 s [algebraic-graphs] OK: hasVertex x empty == False
  22318. 1601.60 s [algebraic-graphs] OK: vertexCount empty == 0
  22319. 1601.60 s [algebraic-graphs] OK: edgeCount empty == 0
  22320. 1601.60 s [algebraic-graphs]
  22321. 1601.60 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  22322. 1601.60 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22323. 1601.60 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22324. 1601.60 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22325. 1601.60 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22326. 1601.60 s [algebraic-graphs]
  22327. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  22328. 1604.06 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22329. 1604.06 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22330. 1604.06 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22331. 1604.06 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22332. 1604.06 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22333. 1604.06 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22334. 1604.06 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22335. 1604.06 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22336. 1604.06 s [algebraic-graphs]
  22337. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  22338. 1604.06 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22339. 1604.06 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22340. 1604.06 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22341. 1604.06 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22342. 1604.06 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22343. 1604.06 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22344. 1604.06 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22345. 1604.06 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22346. 1604.06 s [algebraic-graphs]
  22347. 1604.06 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22348. 1604.06 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22349. 1604.06 s [algebraic-graphs]
  22350. 1604.06 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22351. 1604.06 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22352. 1604.06 s [algebraic-graphs]
  22353. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  22354. 1604.06 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22355. 1604.06 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22356. 1604.06 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22357. 1604.06 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22358. 1604.06 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22359. 1604.06 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22360. 1604.06 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22361. 1604.06 s [algebraic-graphs]
  22362. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  22363. 1604.06 s [algebraic-graphs] OK: vertices [] == empty
  22364. 1604.06 s [algebraic-graphs] OK: vertices [x] == vertex x
  22365. 1604.06 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22366. 1604.06 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22367. 1604.06 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22368. 1604.06 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22369. 1604.06 s [algebraic-graphs]
  22370. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  22371. 1604.06 s [algebraic-graphs] OK: edges [] == empty
  22372. 1604.06 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22373. 1604.06 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22374. 1604.06 s [algebraic-graphs]
  22375. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22376. 1604.06 s [algebraic-graphs] OK: overlays [] == empty
  22377. 1604.06 s [algebraic-graphs] OK: overlays [x] == x
  22378. 1604.06 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22379. 1604.06 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22380. 1604.06 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22381. 1604.06 s [algebraic-graphs]
  22382. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22383. 1604.06 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22384. 1604.06 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22385. 1604.06 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22386. 1604.06 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22387. 1604.06 s [algebraic-graphs]
  22388. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22389. 1604.06 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22390. 1604.06 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22391. 1604.06 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22392. 1604.06 s [algebraic-graphs]
  22393. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22394. 1604.06 s [algebraic-graphs] OK: isEmpty empty == True
  22395. 1604.06 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22396. 1604.06 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22397. 1604.06 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22398. 1604.06 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22399. 1604.06 s [algebraic-graphs]
  22400. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22401. 1604.06 s [algebraic-graphs] OK: hasVertex x empty == False
  22402. 1604.06 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22403. 1604.06 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22404. 1604.06 s [algebraic-graphs]
  22405. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22406. 1604.06 s [algebraic-graphs] OK: hasEdge x y empty == False
  22407. 1604.06 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22408. 1604.06 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22409. 1604.06 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22410. 1604.06 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22411. 1604.06 s [algebraic-graphs]
  22412. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22413. 1604.06 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22414. 1604.06 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22415. 1604.06 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22416. 1604.06 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22417. 1604.06 s [algebraic-graphs]
  22418. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22419. 1604.06 s [algebraic-graphs] OK: vertexCount empty == 0
  22420. 1604.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22421. 1604.06 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22422. 1604.06 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22423. 1604.06 s [algebraic-graphs]
  22424. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22425. 1604.06 s [algebraic-graphs] OK: edgeCount empty == 0
  22426. 1604.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22427. 1604.06 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22428. 1604.06 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22429. 1604.06 s [algebraic-graphs]
  22430. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22431. 1604.06 s [algebraic-graphs] OK: vertexList empty == []
  22432. 1604.06 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22433. 1604.06 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22434. 1604.06 s [algebraic-graphs]
  22435. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22436. 1604.06 s [algebraic-graphs] OK: edgeList empty == []
  22437. 1604.06 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22438. 1604.06 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22439. 1604.06 s [algebraic-graphs]
  22440. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22441. 1604.06 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22442. 1604.06 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22443. 1604.06 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22444. 1604.06 s [algebraic-graphs]
  22445. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22446. 1604.06 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22447. 1604.06 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22448. 1604.06 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22449. 1604.06 s [algebraic-graphs]
  22450. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22451. 1604.06 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22452. 1604.06 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22453. 1604.06 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22454. 1604.06 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22455. 1604.06 s [algebraic-graphs]
  22456. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22457. 1604.06 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22458. 1604.06 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22459. 1604.06 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22460. 1604.06 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22461. 1604.06 s [algebraic-graphs]
  22462. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22463. 1604.06 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22464. 1604.06 s [algebraic-graphs]
  22465. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22466. 1604.06 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22467. 1604.06 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22468. 1604.06 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22469. 1604.06 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22470. 1604.06 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22471. 1604.06 s [algebraic-graphs]
  22472. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22473. 1604.06 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22474. 1604.06 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22475. 1604.06 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22476. 1604.06 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22477. 1604.06 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22478. 1604.06 s [algebraic-graphs]
  22479. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22480. 1604.06 s [algebraic-graphs] OK: replaceVertex x x == id
  22481. 1604.06 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22482. 1604.06 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22483. 1604.06 s [algebraic-graphs]
  22484. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22485. 1604.06 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22486. 1604.06 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22487. 1604.06 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22488. 1604.06 s [algebraic-graphs]
  22489. 1604.06 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22490. 1604.06 s [algebraic-graphs] OK: transpose empty == empty
  22491. 1604.06 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22492. 1604.06 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22493. 1604.06 s [algebraic-graphs] OK: transpose . transpose == id
  22494. 1604.07 s [algebraic-graphs]
  22495. 1604.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22496. 1604.07 s [algebraic-graphs] OK: gmap f empty == empty
  22497. 1604.07 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22498. 1604.07 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22499. 1604.07 s [algebraic-graphs] OK: gmap id == id
  22500. 1604.07 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22501. 1604.07 s [algebraic-graphs]
  22502. 1604.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22503. 1604.07 s [algebraic-graphs] OK: emap h empty == empty
  22504. 1604.07 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22505. 1604.07 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22506. 1604.07 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22507. 1604.07 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22508. 1604.07 s [algebraic-graphs] OK: emap id == id
  22509. 1604.07 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22510. 1604.07 s [algebraic-graphs]
  22511. 1604.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22512. 1604.07 s [algebraic-graphs] OK: induce (const True ) x == x
  22513. 1604.07 s [algebraic-graphs] OK: induce (const False) x == empty
  22514. 1604.07 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22515. 1604.07 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22516. 1604.07 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22517. 1604.07 s [algebraic-graphs]
  22518. 1604.07 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22519. 1605.33 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22520. 1605.33 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22521. 1605.33 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22522. 1605.33 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22523. 1605.33 s [algebraic-graphs]
  22524. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22525. 1605.33 s [algebraic-graphs] OK: closure empty == empty
  22526. 1605.33 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22527. 1605.33 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22528. 1605.33 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22529. 1605.33 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22530. 1605.33 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22531. 1605.33 s [algebraic-graphs] OK: closure . closure == closure
  22532. 1605.33 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22533. 1605.33 s [algebraic-graphs]
  22534. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22535. 1605.33 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22536. 1605.33 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22537. 1605.33 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22538. 1605.33 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22539. 1605.33 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22540. 1605.33 s [algebraic-graphs]
  22541. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22542. 1605.33 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22543. 1605.33 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22544. 1605.33 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22545. 1605.33 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22546. 1605.33 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22547. 1605.33 s [algebraic-graphs]
  22548. 1605.33 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22549. 1605.33 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22550. 1605.33 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22551. 1605.33 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22552. 1605.33 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22553. 1605.33 s [algebraic-graphs]
  22554. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22555. 1605.33 s [algebraic-graphs] OK: isEmpty empty == True
  22556. 1605.33 s [algebraic-graphs] OK: hasVertex x empty == False
  22557. 1605.33 s [algebraic-graphs] OK: vertexCount empty == 0
  22558. 1605.33 s [algebraic-graphs] OK: edgeCount empty == 0
  22559. 1605.33 s [algebraic-graphs]
  22560. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22561. 1605.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22562. 1605.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22563. 1605.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22564. 1605.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22565. 1605.33 s [algebraic-graphs]
  22566. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22567. 1605.33 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22568. 1605.33 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22569. 1605.33 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22570. 1605.33 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22571. 1605.33 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22572. 1605.33 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22573. 1605.33 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22574. 1605.33 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22575. 1605.33 s [algebraic-graphs]
  22576. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22577. 1605.33 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22578. 1605.33 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22579. 1605.33 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22580. 1605.33 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22581. 1605.33 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22582. 1605.33 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22583. 1605.33 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22584. 1605.33 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22585. 1605.33 s [algebraic-graphs]
  22586. 1605.33 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22587. 1605.33 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22588. 1605.33 s [algebraic-graphs]
  22589. 1605.33 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22590. 1605.33 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22591. 1605.33 s [algebraic-graphs]
  22592. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22593. 1605.33 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22594. 1605.33 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22595. 1605.33 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22596. 1605.33 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22597. 1605.33 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22598. 1605.33 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22599. 1605.33 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22600. 1605.33 s [algebraic-graphs]
  22601. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22602. 1605.33 s [algebraic-graphs] OK: vertices [] == empty
  22603. 1605.33 s [algebraic-graphs] OK: vertices [x] == vertex x
  22604. 1605.33 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22605. 1605.33 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22606. 1605.33 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22607. 1605.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22608. 1605.33 s [algebraic-graphs]
  22609. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22610. 1605.33 s [algebraic-graphs] OK: edges [] == empty
  22611. 1605.33 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22612. 1605.33 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22613. 1605.33 s [algebraic-graphs]
  22614. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22615. 1605.33 s [algebraic-graphs] OK: overlays [] == empty
  22616. 1605.33 s [algebraic-graphs] OK: overlays [x] == x
  22617. 1605.33 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22618. 1605.33 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22619. 1605.33 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22620. 1605.33 s [algebraic-graphs]
  22621. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22622. 1605.33 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22623. 1605.33 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22624. 1605.33 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22625. 1605.33 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22626. 1605.33 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22627. 1605.33 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22628. 1605.33 s [algebraic-graphs]
  22629. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22630. 1605.33 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22631. 1605.33 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22632. 1605.33 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22633. 1605.33 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22634. 1605.33 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22635. 1605.33 s [algebraic-graphs]
  22636. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22637. 1605.33 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22638. 1605.33 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22639. 1605.33 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22640. 1605.33 s [algebraic-graphs]
  22641. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22642. 1605.33 s [algebraic-graphs] OK: isEmpty empty == True
  22643. 1605.33 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22644. 1605.33 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22645. 1605.33 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22646. 1605.33 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22647. 1605.33 s [algebraic-graphs]
  22648. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22649. 1605.33 s [algebraic-graphs] OK: size empty == 1
  22650. 1605.33 s [algebraic-graphs] OK: size (vertex x) == 1
  22651. 1605.33 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22652. 1605.33 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22653. 1605.33 s [algebraic-graphs] OK: size x >= 1
  22654. 1605.33 s [algebraic-graphs] OK: size x >= vertexCount x
  22655. 1605.33 s [algebraic-graphs]
  22656. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22657. 1605.33 s [algebraic-graphs] OK: hasVertex x empty == False
  22658. 1605.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22659. 1605.33 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22660. 1605.33 s [algebraic-graphs]
  22661. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22662. 1605.33 s [algebraic-graphs] OK: hasEdge x y empty == False
  22663. 1605.33 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22664. 1605.33 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22665. 1605.33 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22666. 1605.33 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22667. 1605.33 s [algebraic-graphs]
  22668. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22669. 1605.33 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22670. 1605.33 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22671. 1605.33 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22672. 1605.33 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22673. 1605.33 s [algebraic-graphs]
  22674. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22675. 1605.33 s [algebraic-graphs] OK: vertexCount empty == 0
  22676. 1605.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22677. 1605.33 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22678. 1605.33 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22679. 1605.33 s [algebraic-graphs]
  22680. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22681. 1605.33 s [algebraic-graphs] OK: edgeCount empty == 0
  22682. 1605.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22683. 1605.33 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22684. 1605.33 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22685. 1605.33 s [algebraic-graphs]
  22686. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22687. 1605.33 s [algebraic-graphs] OK: vertexList empty == []
  22688. 1605.33 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22689. 1605.33 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22690. 1605.33 s [algebraic-graphs]
  22691. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22692. 1605.33 s [algebraic-graphs] OK: edgeList empty == []
  22693. 1605.33 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22694. 1605.33 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22695. 1605.33 s [algebraic-graphs]
  22696. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22697. 1605.33 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22698. 1605.33 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22699. 1605.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22700. 1605.33 s [algebraic-graphs]
  22701. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22702. 1605.33 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22703. 1605.33 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22704. 1605.33 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22705. 1605.33 s [algebraic-graphs]
  22706. 1605.33 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22707. 1605.33 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22708. 1605.33 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22709. 1606.34 s Waiting for lock on shellcheck
  22710. 1606.77 s [haskell-language-server] Preprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  22711. 1606.77 s [haskell-language-server] Building library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0..
  22712. 1606.96 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.Literals ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Literals.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.dyn_o )
  22713. 1608.43 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22714. 1608.43 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22715. 1608.43 s [algebraic-graphs]
  22716. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22717. 1608.43 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22718. 1608.43 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22719. 1608.43 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22720. 1608.43 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22721. 1608.43 s [algebraic-graphs]
  22722. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22723. 1608.43 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22724. 1608.43 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22725. 1608.43 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22726. 1608.43 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22727. 1608.43 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22728. 1608.43 s [algebraic-graphs]
  22729. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22730. 1608.43 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22731. 1608.43 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22732. 1608.43 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22733. 1608.43 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22734. 1608.43 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22735. 1608.43 s [algebraic-graphs]
  22736. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22737. 1608.43 s [algebraic-graphs] OK: replaceVertex x x == id
  22738. 1608.43 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22739. 1608.43 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22740. 1608.43 s [algebraic-graphs]
  22741. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22742. 1608.43 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22743. 1608.43 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22744. 1608.43 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22745. 1608.43 s [algebraic-graphs]
  22746. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22747. 1608.43 s [algebraic-graphs] OK: transpose empty == empty
  22748. 1608.43 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22749. 1608.43 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22750. 1608.43 s [algebraic-graphs] OK: transpose . transpose == id
  22751. 1608.43 s [algebraic-graphs]
  22752. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22753. 1608.43 s [algebraic-graphs] OK: fmap f empty == empty
  22754. 1608.43 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22755. 1608.43 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22756. 1608.43 s [algebraic-graphs] OK: fmap id == id
  22757. 1608.43 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22758. 1608.43 s [algebraic-graphs]
  22759. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22760. 1608.43 s [algebraic-graphs] OK: emap h empty == empty
  22761. 1608.43 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22762. 1608.43 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22763. 1608.43 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22764. 1608.43 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22765. 1608.43 s [algebraic-graphs] OK: emap id == id
  22766. 1608.43 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22767. 1608.43 s [algebraic-graphs]
  22768. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22769. 1608.43 s [algebraic-graphs] OK: induce (const True ) x == x
  22770. 1608.43 s [algebraic-graphs] OK: induce (const False) x == empty
  22771. 1608.43 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22772. 1608.43 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22773. 1608.43 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22774. 1608.43 s [algebraic-graphs]
  22775. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22776. 1608.43 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22777. 1608.43 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22778. 1608.43 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22779. 1608.43 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22780. 1608.43 s [algebraic-graphs]
  22781. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22782. 1608.43 s [algebraic-graphs] OK: closure empty == empty
  22783. 1608.43 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22784. 1608.43 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22785. 1608.43 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22786. 1608.43 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22787. 1608.43 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22788. 1608.43 s [algebraic-graphs] OK: closure . closure == closure
  22789. 1608.43 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22790. 1608.43 s [algebraic-graphs]
  22791. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22792. 1608.43 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22793. 1608.43 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22794. 1608.43 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22795. 1608.43 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22796. 1608.43 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22797. 1608.43 s [algebraic-graphs]
  22798. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22799. 1608.43 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22800. 1608.43 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22801. 1608.43 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22802. 1608.43 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22803. 1608.43 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22804. 1608.43 s [algebraic-graphs]
  22805. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22806. 1608.43 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22807. 1608.43 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22808. 1608.43 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22809. 1608.43 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22810. 1608.43 s [algebraic-graphs]
  22811. 1608.43 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22812. 1608.43 s [algebraic-graphs] OK: context (const False) x == Nothing
  22813. 1608.43 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22814. 1608.43 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22815. 1608.43 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22816. 1608.43 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22817. 1608.43 s [algebraic-graphs]
  22818. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22819. 1608.43 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22820. 1608.43 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22821. 1608.43 s [algebraic-graphs]
  22822. 1608.43 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22823. 1608.43 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22824. 1608.43 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22825. 1608.43 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22826. 1608.43 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22827. 1608.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22828. 1608.43 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22829. 1608.43 s [algebraic-graphs] OK: x <= x + y
  22830. 1608.43 s [algebraic-graphs] OK: x + y <= x * y
  22831. 1608.43 s [algebraic-graphs]
  22832. 1608.43 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22833. 1608.43 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22834. 1608.43 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22835. 1608.43 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22836. 1608.43 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22837. 1608.43 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22838. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22839. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22840. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22841. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22842. 1608.43 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22843. 1608.43 s [algebraic-graphs]
  22844. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22845. 1608.43 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22846. 1608.43 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22847. 1608.43 s [algebraic-graphs]
  22848. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22849. 1608.43 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22850. 1608.43 s [algebraic-graphs]
  22851. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22852. 1608.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22853. 1608.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22854. 1608.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22855. 1608.43 s [algebraic-graphs]
  22856. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22857. 1608.43 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22858. 1608.43 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22859. 1608.43 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22860. 1608.43 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22861. 1608.43 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22862. 1608.43 s [algebraic-graphs]
  22863. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22864. 1608.43 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22865. 1608.43 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22866. 1608.43 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22867. 1608.43 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22868. 1608.43 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22869. 1608.43 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22870. 1608.43 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22871. 1608.43 s [algebraic-graphs]
  22872. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22873. 1608.43 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22874. 1608.43 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22875. 1608.43 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22876. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22877. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22878. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22879. 1608.43 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22880. 1608.43 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22881. 1608.43 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22882. 1608.43 s [algebraic-graphs]
  22883. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22884. 1608.43 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22885. 1608.43 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22886. 1608.43 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22887. 1608.43 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22888. 1608.43 s [algebraic-graphs]
  22889. 1608.43 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22890. 1608.43 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22891. 1608.43 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22892. 1608.43 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22893. 1608.43 s [algebraic-graphs]
  22894. 1608.44 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.Conversion ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Conversion.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.dyn_o )
  22895. 1609.15 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.AlternateNumberFormat ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/AlternateNumberFormat.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.o, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.dyn_o )
  22896. 1610.74 s [haskell-language-server] [1 of 3] Compiling Ide.Plugin.Literals ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Literals.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Literals.p_o )
  22897. 1611.75 s Waiting for lock on bash-language-server
  22898. 1611.86 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22899. 1611.86 s [algebraic-graphs] OK: overlays1 [x] == x
  22900. 1611.89 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22901. 1611.89 s [algebraic-graphs]
  22902. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22903. 1611.89 s [algebraic-graphs] OK: connects1 [x] == x
  22904. 1611.89 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22905. 1611.89 s [algebraic-graphs]
  22906. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22907. 1611.89 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22908. 1611.89 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22909. 1611.89 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22910. 1611.89 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22911. 1611.89 s [algebraic-graphs]
  22912. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22913. 1611.89 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22914. 1611.89 s [algebraic-graphs]
  22915. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22916. 1611.89 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22917. 1611.89 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22918. 1611.89 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22919. 1611.89 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22920. 1611.89 s [algebraic-graphs]
  22921. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22922. 1611.89 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22923. 1611.89 s [algebraic-graphs] OK: vertexCount x >= 1
  22924. 1611.89 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22925. 1611.89 s [algebraic-graphs]
  22926. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22927. 1611.89 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22928. 1611.89 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22929. 1611.89 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22930. 1611.89 s [algebraic-graphs]
  22931. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22932. 1611.89 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22933. 1611.89 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22934. 1611.89 s [algebraic-graphs]
  22935. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22936. 1611.89 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22937. 1611.89 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22938. 1611.89 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22939. 1611.89 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22940. 1611.89 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22941. 1611.89 s [algebraic-graphs]
  22942. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22943. 1611.89 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22944. 1611.89 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22945. 1611.89 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22946. 1611.89 s [algebraic-graphs]
  22947. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22948. 1611.89 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22949. 1611.89 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22950. 1611.89 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22951. 1611.89 s [algebraic-graphs]
  22952. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22953. 1611.89 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22954. 1611.89 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22955. 1611.89 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22956. 1611.89 s [algebraic-graphs]
  22957. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22958. 1611.89 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22959. 1611.89 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22960. 1611.89 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22961. 1611.89 s [algebraic-graphs]
  22962. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22963. 1611.89 s [algebraic-graphs] OK: path1 [x] == vertex x
  22964. 1611.89 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22965. 1611.89 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22966. 1611.89 s [algebraic-graphs]
  22967. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22968. 1611.89 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22969. 1611.89 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22970. 1611.89 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22971. 1611.89 s [algebraic-graphs]
  22972. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22973. 1611.89 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22974. 1611.89 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22975. 1611.89 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22976. 1611.89 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22977. 1611.89 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22978. 1611.89 s [algebraic-graphs]
  22979. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22980. 1611.89 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22981. 1611.89 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22982. 1611.89 s [algebraic-graphs]
  22983. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22984. 1611.89 s [algebraic-graphs] OK: star x [] == vertex x
  22985. 1611.89 s [algebraic-graphs] OK: star x [y] == edge x y
  22986. 1611.89 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22987. 1611.89 s [algebraic-graphs]
  22988. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22989. 1611.89 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22990. 1611.89 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22991. 1611.89 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22992. 1611.89 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22993. 1611.89 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22994. 1611.89 s [algebraic-graphs]
  22995. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22996. 1611.89 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22997. 1611.89 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22998. 1611.89 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22999. 1611.89 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23000. 1611.89 s [algebraic-graphs]
  23001. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  23002. 1611.89 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23003. 1611.89 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23004. 1611.89 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23005. 1611.89 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23006. 1611.89 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23007. 1611.89 s [algebraic-graphs]
  23008. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  23009. 1611.89 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23010. 1611.89 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23011. 1611.89 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23012. 1611.89 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23013. 1611.89 s [algebraic-graphs]
  23014. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  23015. 1611.89 s [algebraic-graphs] OK: replaceVertex x x == id
  23016. 1611.89 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23017. 1611.89 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23018. 1611.89 s [algebraic-graphs]
  23019. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  23020. 1611.89 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23021. 1611.89 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23022. 1611.89 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23023. 1611.89 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23024. 1611.89 s [algebraic-graphs]
  23025. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  23026. 1611.89 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23027. 1611.89 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23028. 1611.89 s [algebraic-graphs] OK: transpose . transpose == id
  23029. 1611.89 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23030. 1611.89 s [algebraic-graphs]
  23031. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  23032. 1611.89 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23033. 1611.89 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23034. 1611.89 s [algebraic-graphs] OK: gmap id == id
  23035. 1611.89 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23036. 1611.89 s [algebraic-graphs]
  23037. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  23038. 1611.89 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23039. 1611.89 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23040. 1611.89 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23041. 1611.89 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23042. 1611.89 s [algebraic-graphs]
  23043. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  23044. 1611.89 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23045. 1611.89 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23046. 1611.89 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  23047. 1611.89 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  23048. 1611.89 s [algebraic-graphs]
  23049. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  23050. 1611.89 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23051. 1611.89 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23052. 1611.89 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23053. 1611.89 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  23054. 1611.89 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23055. 1611.89 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23056. 1611.89 s [algebraic-graphs] OK: closure . closure == closure
  23057. 1611.89 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23058. 1611.89 s [algebraic-graphs]
  23059. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  23060. 1611.89 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23061. 1611.89 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23062. 1611.89 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23063. 1611.89 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23064. 1611.89 s [algebraic-graphs]
  23065. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  23066. 1611.89 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23067. 1611.89 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  23068. 1611.89 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23069. 1611.89 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23070. 1611.89 s [algebraic-graphs]
  23071. 1611.89 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  23072. 1611.89 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23073. 1611.89 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23074. 1611.89 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  23075. 1611.89 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23076. 1611.90 s [algebraic-graphs]
  23077. 1611.90 s [algebraic-graphs] ============ NonEmpty.Graph.============
  23078. 1611.90 s [algebraic-graphs] OK: Axioms of non-empty graphs
  23079. 1611.90 s [algebraic-graphs] OK: Theorems of non-empty graphs
  23080. 1611.90 s [algebraic-graphs]
  23081. 1611.90 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  23082. 1611.90 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23083. 1611.90 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23084. 1611.90 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23085. 1611.90 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23086. 1611.90 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23087. 1611.90 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23088. 1611.90 s [algebraic-graphs] OK: x <= x + y
  23089. 1611.90 s [algebraic-graphs] OK: x + y <= x * y
  23090. 1611.90 s [algebraic-graphs]
  23091. 1611.90 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  23092. 1611.90 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  23093. 1611.90 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  23094. 1611.90 s [algebraic-graphs] OK: fmap id == id
  23095. 1611.90 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  23096. 1611.90 s [algebraic-graphs]
  23097. 1611.90 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  23098. 1611.90 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  23099. 1612.12 s [haskell-language-server] [2 of 3] Compiling Ide.Plugin.Conversion ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/Conversion.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/Conversion.p_o )
  23100. 1612.79 s [haskell-language-server] [3 of 3] Compiling Ide.Plugin.AlternateNumberFormat ( plugins/hls-alternate-number-format-plugin/src/Ide/Plugin/AlternateNumberFormat.hs, dist/build/hls-alternate-number-format-plugin/Ide/Plugin/AlternateNumberFormat.p_o )
  23101. 1613.33 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  23102. 1613.33 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  23103. 1613.33 s [algebraic-graphs] OK: (x >>= vertex) == x
  23104. 1613.33 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  23105. 1613.33 s [algebraic-graphs]
  23106. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  23107. 1613.33 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  23108. 1613.33 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  23109. 1613.33 s [algebraic-graphs]
  23110. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  23111. 1613.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23112. 1613.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23113. 1613.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23114. 1613.33 s [algebraic-graphs] OK: size (vertex x) == 1
  23115. 1613.33 s [algebraic-graphs]
  23116. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  23117. 1613.33 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23118. 1613.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23119. 1613.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23120. 1613.33 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23121. 1613.33 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23122. 1613.33 s [algebraic-graphs]
  23123. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  23124. 1613.33 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23125. 1613.33 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23126. 1613.33 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23127. 1613.33 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23128. 1613.33 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23129. 1613.33 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23130. 1613.33 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23131. 1613.33 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23132. 1613.33 s [algebraic-graphs]
  23133. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  23134. 1613.33 s [algebraic-graphs] OK: overlay1 empty x == x
  23135. 1613.33 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  23136. 1613.33 s [algebraic-graphs]
  23137. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  23138. 1613.33 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23139. 1613.33 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23140. 1613.33 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23141. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23142. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23143. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23144. 1613.33 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23145. 1613.33 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23146. 1613.33 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23147. 1613.33 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23148. 1613.33 s [algebraic-graphs]
  23149. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  23150. 1613.33 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  23151. 1613.33 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  23152. 1613.33 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  23153. 1613.33 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23154. 1613.33 s [algebraic-graphs]
  23155. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  23156. 1613.33 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  23157. 1613.33 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  23158. 1613.33 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  23159. 1613.33 s [algebraic-graphs]
  23160. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  23161. 1613.33 s [algebraic-graphs] OK: overlays1 [x] == x
  23162. 1613.33 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23163. 1613.33 s [algebraic-graphs]
  23164. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  23165. 1613.33 s [algebraic-graphs] OK: connects1 [x] == x
  23166. 1613.33 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23167. 1613.33 s [algebraic-graphs]
  23168. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  23169. 1613.33 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  23170. 1613.33 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  23171. 1613.33 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  23172. 1613.33 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  23173. 1613.33 s [algebraic-graphs]
  23174. 1613.33 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  23175. 1613.33 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23176. 1613.34 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23177. 1613.34 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23178. 1613.34 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23179. 1613.34 s [algebraic-graphs]
  23180. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  23181. 1613.34 s [algebraic-graphs] OK: x === x == True
  23182. 1613.34 s [algebraic-graphs] OK: x + y === x + y == True
  23183. 1613.34 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  23184. 1613.34 s [algebraic-graphs] OK: x + y === x * y == False
  23185. 1613.34 s [algebraic-graphs]
  23186. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  23187. 1613.34 s [algebraic-graphs] OK: size (vertex x) == 1
  23188. 1613.34 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23189. 1613.34 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23190. 1613.34 s [algebraic-graphs] OK: size x >= 1
  23191. 1613.34 s [algebraic-graphs] OK: size x >= vertexCount x
  23192. 1613.34 s [algebraic-graphs]
  23193. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  23194. 1613.34 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23195. 1613.34 s [algebraic-graphs]
  23196. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  23197. 1613.34 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23198. 1613.34 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23199. 1613.34 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23200. 1613.34 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23201. 1613.34 s [algebraic-graphs]
  23202. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  23203. 1613.34 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23204. 1613.34 s [algebraic-graphs] OK: vertexCount x >= 1
  23205. 1613.34 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23206. 1613.34 s [algebraic-graphs]
  23207. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  23208. 1613.34 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23209. 1613.34 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23210. 1613.34 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23211. 1613.34 s [algebraic-graphs]
  23212. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  23213. 1613.34 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23214. 1613.34 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23215. 1613.34 s [algebraic-graphs]
  23216. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  23217. 1613.34 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23218. 1613.34 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23219. 1613.34 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23220. 1613.34 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23221. 1613.34 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23222. 1613.34 s [algebraic-graphs]
  23223. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  23224. 1613.34 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23225. 1613.34 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23226. 1613.34 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23227. 1613.34 s [algebraic-graphs]
  23228. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  23229. 1613.34 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23230. 1613.34 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23231. 1613.34 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23232. 1613.34 s [algebraic-graphs]
  23233. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  23234. 1613.34 s [algebraic-graphs] OK: path1 [x] == vertex x
  23235. 1613.34 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23236. 1613.34 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23237. 1613.34 s [algebraic-graphs]
  23238. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  23239. 1613.34 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23240. 1613.34 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23241. 1613.34 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23242. 1613.34 s [algebraic-graphs]
  23243. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  23244. 1613.34 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23245. 1613.34 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23246. 1613.34 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23247. 1613.34 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23248. 1613.34 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23249. 1613.34 s [algebraic-graphs]
  23250. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  23251. 1613.34 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23252. 1613.34 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23253. 1613.34 s [algebraic-graphs]
  23254. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  23255. 1613.34 s [algebraic-graphs] OK: star x [] == vertex x
  23256. 1613.34 s [algebraic-graphs] OK: star x [y] == edge x y
  23257. 1613.34 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23258. 1613.34 s [algebraic-graphs]
  23259. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  23260. 1613.34 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23261. 1613.34 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23262. 1613.34 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23263. 1613.34 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23264. 1613.34 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23265. 1613.34 s [algebraic-graphs]
  23266. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  23267. 1613.34 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23268. 1613.34 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23269. 1613.34 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23270. 1613.34 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23271. 1613.34 s [algebraic-graphs]
  23272. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  23273. 1613.34 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  23274. 1613.34 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  23275. 1613.34 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  23276. 1613.34 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  23277. 1613.34 s [algebraic-graphs]
  23278. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  23279. 1613.34 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  23280. 1613.34 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  23281. 1613.34 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  23282. 1613.34 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  23283. 1613.34 s [algebraic-graphs]
  23284. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  23285. 1613.34 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23286. 1613.34 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23287. 1613.34 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23288. 1613.34 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23289. 1613.34 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23290. 1613.34 s [algebraic-graphs]
  23291. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  23292. 1613.34 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23293. 1613.34 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23294. 1613.34 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23295. 1613.34 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23296. 1613.34 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  23297. 1613.34 s [algebraic-graphs]
  23298. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  23299. 1613.34 s [algebraic-graphs] OK: replaceVertex x x == id
  23300. 1613.34 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23301. 1613.34 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23302. 1613.34 s [algebraic-graphs]
  23303. 1613.34 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  23304. 1613.34 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23305. 1620.66 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23306. 1620.66 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23307. 1620.67 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23308. 1620.67 s [algebraic-graphs]
  23309. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  23310. 1620.67 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  23311. 1620.67 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  23312. 1620.67 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  23313. 1620.67 s [algebraic-graphs]
  23314. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  23315. 1620.67 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23316. 1620.67 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23317. 1620.67 s [algebraic-graphs] OK: transpose . transpose == id
  23318. 1620.67 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23319. 1620.67 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23320. 1620.67 s [algebraic-graphs]
  23321. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  23322. 1620.67 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23323. 1620.67 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23324. 1620.67 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23325. 1620.67 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23326. 1620.67 s [algebraic-graphs]
  23327. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  23328. 1620.67 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23329. 1620.67 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23330. 1620.67 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  23331. 1620.67 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  23332. 1620.67 s [algebraic-graphs]
  23333. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  23334. 1620.67 s [algebraic-graphs] OK: simplify == id
  23335. 1620.67 s [algebraic-graphs] OK: size (simplify x) <= size x
  23336. 1620.67 s [algebraic-graphs] OK: simplify 1 === 1
  23337. 1620.67 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  23338. 1620.67 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  23339. 1620.67 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  23340. 1620.67 s [algebraic-graphs]
  23341. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  23342. 1620.67 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  23343. 1620.67 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  23344. 1620.67 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  23345. 1620.67 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  23346. 1620.67 s [algebraic-graphs]
  23347. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  23348. 1620.67 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  23349. 1620.67 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  23350. 1620.67 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  23351. 1620.67 s [algebraic-graphs]
  23352. 1620.67 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  23353. 1620.67 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  23354. 1620.67 s [algebraic-graphs] OK: box x y ~~ box y x
  23355. 1620.67 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  23356. 1620.67 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  23357. 1620.67 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  23358. 1620.67 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23359. 1620.67 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  23360. 1620.67 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  23361. 1620.67 s [algebraic-graphs]
  23362. 1620.67 s [algebraic-graphs] ============ Relation ============
  23363. 1620.67 s [algebraic-graphs] OK: Axioms of graphs
  23364. 1620.67 s [algebraic-graphs]
  23365. 1620.67 s [algebraic-graphs] ============ Relation.consistent ============
  23366. 1620.67 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23367. 1620.67 s [algebraic-graphs]
  23368. 1620.67 s [algebraic-graphs] OK: consistent empty == True
  23369. 1620.67 s [algebraic-graphs] OK: consistent (vertex x) == True
  23370. 1620.67 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23371. 1620.67 s [algebraic-graphs] OK: consistent (connect x y) == True
  23372. 1620.67 s [algebraic-graphs] OK: consistent (edge x y) == True
  23373. 1620.67 s [algebraic-graphs] OK: consistent (edges xs) == True
  23374. 1620.67 s [algebraic-graphs] OK: consistent (stars xs) == True
  23375. 1620.67 s [algebraic-graphs]
  23376. 1620.67 s [algebraic-graphs] ============ Relation.Show ============
  23377. 1620.67 s [algebraic-graphs] OK: show (empty ) == "empty"
  23378. 1620.67 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23379. 1620.67 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23380. 1620.67 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23381. 1620.67 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23382. 1620.67 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23383. 1620.67 s [algebraic-graphs]
  23384. 1620.67 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23385. 1620.67 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23386. 1620.67 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23387. 1620.67 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23388. 1620.67 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23389. 1620.67 s [algebraic-graphs]
  23390. 1620.67 s [algebraic-graphs] ============ Relation.Ord ============
  23391. 1620.67 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23392. 1620.67 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23393. 1620.67 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23394. 1620.67 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23395. 1620.67 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23396. 1620.67 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23397. 1620.67 s [algebraic-graphs] OK: x <= x + y
  23398. 1620.67 s [algebraic-graphs] OK: x + y <= x * y
  23399. 1620.67 s [algebraic-graphs]
  23400. 1620.67 s [algebraic-graphs] ============ Relation.empty ============
  23401. 1620.67 s [algebraic-graphs] OK: isEmpty empty == True
  23402. 1620.67 s [algebraic-graphs] OK: hasVertex x empty == False
  23403. 1620.67 s [algebraic-graphs] OK: vertexCount empty == 0
  23404. 1620.67 s [algebraic-graphs] OK: edgeCount empty == 0
  23405. 1620.67 s [algebraic-graphs]
  23406. 1620.67 s [algebraic-graphs] ============ Relation.vertex ============
  23407. 1620.67 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23408. 1620.67 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23409. 1620.67 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23410. 1620.67 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23411. 1620.67 s [algebraic-graphs]
  23412. 1620.67 s [algebraic-graphs] ============ Relation.edge ============
  23413. 1620.67 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23414. 1620.67 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23415. 1620.67 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23416. 1620.67 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23417. 1620.67 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23418. 1620.67 s [algebraic-graphs]
  23419. 1620.67 s [algebraic-graphs] ============ Relation.overlay ============
  23420. 1620.67 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23421. 1620.67 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23422. 1620.67 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23423. 1620.67 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23424. 1620.67 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23425. 1620.67 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23426. 1620.67 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23427. 1620.67 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23428. 1620.67 s [algebraic-graphs]
  23429. 1620.67 s [algebraic-graphs] ============ Relation.connect ============
  23430. 1620.67 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23431. 1620.67 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23432. 1620.67 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23433. 1620.67 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23434. 1620.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23435. 1620.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23436. 1620.67 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23437. 1620.68 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23438. 1620.68 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23439. 1620.68 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23440. 1620.68 s [algebraic-graphs]
  23441. 1620.68 s [algebraic-graphs] ============ Relation.vertices ============
  23442. 1620.68 s [algebraic-graphs] OK: vertices [] == empty
  23443. 1620.68 s [algebraic-graphs] OK: vertices [x] == vertex x
  23444. 1620.68 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23445. 1620.68 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23446. 1620.68 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23447. 1620.68 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23448. 1620.68 s [algebraic-graphs]
  23449. 1620.68 s [algebraic-graphs] ============ Relation.edges ============
  23450. 1620.68 s [algebraic-graphs] OK: edges [] == empty
  23451. 1620.68 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23452. 1620.68 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23453. 1620.68 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23454. 1620.68 s [algebraic-graphs]
  23455. 1620.68 s [algebraic-graphs] ============ Relation.overlays ============
  23456. 1620.68 s [algebraic-graphs] OK: overlays [] == empty
  23457. 1620.68 s [algebraic-graphs] OK: overlays [x] == x
  23458. 1620.68 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23459. 1620.68 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23460. 1620.68 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23461. 1620.68 s [algebraic-graphs]
  23462. 1620.68 s [algebraic-graphs] ============ Relation.connects ============
  23463. 1620.68 s [algebraic-graphs] OK: connects [] == empty
  23464. 1620.68 s [algebraic-graphs] OK: connects [x] == x
  23465. 1620.68 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23466. 1620.68 s [algebraic-graphs] OK: connects == foldr connect empty
  23467. 1620.68 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23468. 1620.68 s [algebraic-graphs]
  23469. 1620.68 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23470. 1620.68 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23471. 1620.68 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23472. 1620.68 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23473. 1620.68 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23474. 1620.68 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23475. 1620.68 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23476. 1620.68 s [algebraic-graphs]
  23477. 1620.68 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23478. 1620.68 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23479. 1620.68 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23480. 1620.68 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23481. 1620.68 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23482. 1620.68 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23483. 1620.68 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23484. 1620.68 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23485. 1620.68 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23486. 1620.68 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23487. 1620.68 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23488. 1620.68 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23489. 1620.68 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23490. 1620.68 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23491. 1620.68 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23492. 1620.68 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23493. 1620.68 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23494. 1620.68 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23495. 1621.09 s [haskell-language-server] Preprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  23496. 1621.09 s [haskell-language-server] Building library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0..
  23497. 1621.23 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.o, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.dyn_o )
  23498. 1623.24 s Waiting for lock on project-manager-path-for-duoids
  23499. 1623.36 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.QualifyImportedNames ( plugins/hls-qualify-imported-names-plugin/src/Ide/Plugin/QualifyImportedNames.hs, dist/build/hls-qualify-imported-names-plugin/Ide/Plugin/QualifyImportedNames.p_o )
  23500. 1624.25 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23501. 1624.25 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23502. 1624.25 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23503. 1624.25 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23504. 1624.25 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23505. 1624.25 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23506. 1624.25 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23507. 1624.25 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23508. 1624.25 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23509. 1624.25 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23510. 1624.25 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23511. 1624.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23512. 1624.25 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23513. 1624.25 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23514. 1624.25 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23515. 1624.25 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23516. 1624.25 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23517. 1624.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23518. 1624.25 s [algebraic-graphs]
  23519. 1624.25 s [algebraic-graphs] ============ Relation.foldg ============
  23520. 1624.25 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23521. 1624.25 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23522. 1624.25 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23523. 1624.25 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23524. 1624.25 s [algebraic-graphs]
  23525. 1624.25 s [algebraic-graphs] ============ Relation.isEmpty ============
  23526. 1624.25 s [algebraic-graphs] OK: isEmpty empty == True
  23527. 1624.25 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23528. 1624.25 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23529. 1624.25 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23530. 1624.25 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23531. 1624.25 s [algebraic-graphs]
  23532. 1624.25 s [algebraic-graphs] ============ Relation.hasVertex ============
  23533. 1624.25 s [algebraic-graphs] OK: hasVertex x empty == False
  23534. 1624.25 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23535. 1624.25 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23536. 1624.25 s [algebraic-graphs]
  23537. 1624.25 s [algebraic-graphs] ============ Relation.hasEdge ============
  23538. 1624.25 s [algebraic-graphs] OK: hasEdge x y empty == False
  23539. 1624.25 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23540. 1624.25 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23541. 1624.25 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23542. 1624.25 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23543. 1624.25 s [algebraic-graphs]
  23544. 1624.25 s [algebraic-graphs] ============ Relation.vertexCount ============
  23545. 1624.25 s [algebraic-graphs] OK: vertexCount empty == 0
  23546. 1624.25 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23547. 1624.25 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23548. 1624.25 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23549. 1624.25 s [algebraic-graphs]
  23550. 1624.25 s [algebraic-graphs] ============ Relation.edgeCount ============
  23551. 1624.25 s [algebraic-graphs] OK: edgeCount empty == 0
  23552. 1624.25 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23553. 1624.25 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23554. 1624.25 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23555. 1624.25 s [algebraic-graphs]
  23556. 1624.25 s [algebraic-graphs] ============ Relation.vertexList ============
  23557. 1624.25 s [algebraic-graphs] OK: vertexList empty == []
  23558. 1624.25 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23559. 1624.25 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23560. 1624.25 s [algebraic-graphs]
  23561. 1624.25 s [algebraic-graphs] ============ Relation.vertexSet ============
  23562. 1624.25 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23563. 1624.25 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23564. 1624.25 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23565. 1624.25 s [algebraic-graphs]
  23566. 1624.25 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23567. 1624.25 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23568. 1624.25 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23569. 1624.25 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23570. 1624.25 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23571. 1624.25 s [algebraic-graphs]
  23572. 1624.25 s [algebraic-graphs] ============ Relation.edgeList ============
  23573. 1624.25 s [algebraic-graphs] OK: edgeList empty == []
  23574. 1624.25 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23575. 1624.25 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23576. 1624.25 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23577. 1624.25 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23578. 1624.25 s [algebraic-graphs]
  23579. 1624.25 s [algebraic-graphs] ============ Relation.edgeSet ============
  23580. 1624.25 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23581. 1624.25 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23582. 1624.25 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23583. 1624.25 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23584. 1624.25 s [algebraic-graphs]
  23585. 1624.25 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23586. 1624.25 s [algebraic-graphs] OK: adjacencyList empty == []
  23587. 1624.25 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23588. 1624.25 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23589. 1624.25 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23590. 1624.25 s [algebraic-graphs]
  23591. 1624.25 s [algebraic-graphs] ============ Relation.preSet ============
  23592. 1624.25 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23593. 1624.25 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23594. 1624.25 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23595. 1624.25 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23596. 1624.25 s [algebraic-graphs]
  23597. 1624.25 s [algebraic-graphs] ============ Relation.preIntSet ============
  23598. 1624.25 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23599. 1624.25 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23600. 1624.25 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23601. 1624.25 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23602. 1624.25 s [algebraic-graphs]
  23603. 1624.25 s [algebraic-graphs] ============ Relation.postSet ============
  23604. 1624.25 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23605. 1624.25 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23606. 1624.25 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23607. 1624.25 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23608. 1624.25 s [algebraic-graphs]
  23609. 1624.25 s [algebraic-graphs] ============ Relation.postIntSet ============
  23610. 1624.25 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23611. 1624.25 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23612. 1624.25 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23613. 1624.25 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23614. 1624.25 s [algebraic-graphs]
  23615. 1624.25 s [algebraic-graphs] ============ Relation.path ============
  23616. 1624.25 s [algebraic-graphs] OK: path [] == empty
  23617. 1624.25 s [algebraic-graphs] OK: path [x] == vertex x
  23618. 1624.25 s [algebraic-graphs] OK: path [x,y] == edge x y
  23619. 1624.25 s [algebraic-graphs]
  23620. 1624.25 s [algebraic-graphs] ============ Relation.circuit ============
  23621. 1624.25 s [algebraic-graphs] OK: circuit [] == empty
  23622. 1624.25 s [algebraic-graphs] OK: circuit [x] == edge x x
  23623. 1624.25 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23624. 1624.25 s [algebraic-graphs]
  23625. 1624.25 s [algebraic-graphs] ============ Relation.clique ============
  23626. 1624.25 s [algebraic-graphs] OK: clique [] == empty
  23627. 1624.25 s [algebraic-graphs] OK: clique [x] == vertex x
  23628. 1624.25 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23629. 1624.25 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23630. 1624.25 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23631. 1624.25 s [algebraic-graphs]
  23632. 1624.25 s [algebraic-graphs] ============ Relation.biclique ============
  23633. 1624.25 s [algebraic-graphs] OK: biclique [] [] == empty
  23634. 1624.25 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23635. 1624.25 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23636. 1624.25 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23637. 1624.25 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23638. 1624.25 s [algebraic-graphs]
  23639. 1624.25 s [algebraic-graphs] ============ Relation.star ============
  23640. 1624.25 s [algebraic-graphs] OK: star x [] == vertex x
  23641. 1624.25 s [algebraic-graphs] OK: star x [y] == edge x y
  23642. 1624.25 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23643. 1624.25 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23644. 1624.25 s [algebraic-graphs]
  23645. 1624.25 s [algebraic-graphs] ============ Relation.stars ============
  23646. 1624.25 s [algebraic-graphs] OK: stars [] == empty
  23647. 1624.25 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23648. 1624.25 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23649. 1624.25 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23650. 1624.25 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23651. 1624.25 s [algebraic-graphs] OK: stars . adjacencyList == id
  23652. 1624.25 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23653. 1624.25 s [algebraic-graphs]
  23654. 1624.25 s [algebraic-graphs] ============ Relation.tree ============
  23655. 1624.25 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23656. 1624.25 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23657. 1624.25 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23658. 1624.25 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23659. 1624.25 s [algebraic-graphs]
  23660. 1624.25 s [algebraic-graphs] ============ Relation.forest ============
  23661. 1624.25 s [algebraic-graphs] OK: forest [] == empty
  23662. 1624.25 s [algebraic-graphs] OK: forest [x] == tree x
  23663. 1624.25 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23664. 1624.25 s [algebraic-graphs] OK: forest == overlays . map tree
  23665. 1624.25 s [algebraic-graphs]
  23666. 1624.25 s [algebraic-graphs] ============ Relation.removeVertex ============
  23667. 1624.25 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23668. 1624.25 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23669. 1624.25 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23670. 1624.25 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23671. 1624.25 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23672. 1624.26 s [algebraic-graphs]
  23673. 1624.26 s [algebraic-graphs] ============ Relation.removeEdge ============
  23674. 1624.26 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23675. 1624.26 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23676. 1624.26 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23677. 1624.26 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23678. 1624.26 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23679. 1624.26 s [algebraic-graphs]
  23680. 1624.26 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23681. 1624.26 s [algebraic-graphs] OK: replaceVertex x x == id
  23682. 1624.26 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23683. 1624.26 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23684. 1624.26 s [algebraic-graphs]
  23685. 1624.26 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23686. 1624.26 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23687. 1631.14 s [haskell-language-server] Preprocessing library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  23688. 1631.14 s [haskell-language-server] Building library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0..
  23689. 1631.25 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalFmt ( plugins/hls-cabal-fmt-plugin/src/Ide/Plugin/CabalFmt.hs, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.o, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.dyn_o )
  23690. 1632.88 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.CabalFmt ( plugins/hls-cabal-fmt-plugin/src/Ide/Plugin/CabalFmt.hs, dist/build/hls-cabal-fmt-plugin/Ide/Plugin/CabalFmt.p_o )
  23691. 1639.85 s [haskell-language-server] Preprocessing library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  23692. 1639.85 s [haskell-language-server] Building library 'hls-eval-plugin' for haskell-language-server-2.12.0.0..
  23693. 1640.14 s [haskell-language-server] [ 1 of 10] Compiling Ide.Plugin.Eval.Config ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Config.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.dyn_o )
  23694. 1640.92 s [haskell-language-server] [ 2 of 10] Compiling Ide.Plugin.Eval.Parse.Option ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Option.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.dyn_o )
  23695. 1640.92 s [haskell-language-server] [ 3 of 10] Compiling Ide.Plugin.Eval.Util ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Util.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.dyn_o )
  23696. 1641.04 s [haskell-language-server] [ 4 of 10] Compiling Ide.Plugin.Eval.GHC ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/GHC.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.dyn_o )
  23697. 1642.02 s [haskell-language-server] [ 5 of 10] Compiling Ide.Plugin.Eval.Types ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Types.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.dyn_o )
  23698. 1647.36 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23699. 1647.36 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23700. 1647.41 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23701. 1647.41 s [algebraic-graphs]
  23702. 1647.41 s [algebraic-graphs] ============ Relation.transpose ============
  23703. 1647.41 s [algebraic-graphs] OK: transpose empty == empty
  23704. 1647.41 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23705. 1647.41 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23706. 1647.41 s [algebraic-graphs] OK: transpose . transpose == id
  23707. 1647.41 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23708. 1647.41 s [algebraic-graphs]
  23709. 1647.41 s [algebraic-graphs] ============ Relation.gmap ============
  23710. 1647.41 s [algebraic-graphs] OK: gmap f empty == empty
  23711. 1647.41 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23712. 1647.41 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23713. 1647.41 s [algebraic-graphs] OK: gmap id == id
  23714. 1647.41 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23715. 1647.41 s [algebraic-graphs]
  23716. 1647.41 s [algebraic-graphs] ============ Relation.induce ============
  23717. 1647.41 s [algebraic-graphs] OK: induce (const True ) x == x
  23718. 1647.41 s [algebraic-graphs] OK: induce (const False) x == empty
  23719. 1647.41 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23720. 1647.41 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23721. 1647.41 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23722. 1647.41 s [algebraic-graphs]
  23723. 1647.41 s [algebraic-graphs] ============ Relation.compose ============
  23724. 1647.41 s [algebraic-graphs] OK: compose empty x == empty
  23725. 1647.41 s [algebraic-graphs] OK: compose x empty == empty
  23726. 1647.41 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23727. 1647.41 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23728. 1647.41 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23729. 1647.41 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23730. 1647.41 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23731. 1647.41 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23732. 1647.41 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23733. 1647.41 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23734. 1647.41 s [algebraic-graphs]
  23735. 1647.41 s [algebraic-graphs] ============ Relation.closure ============
  23736. 1647.41 s [algebraic-graphs] OK: closure empty == empty
  23737. 1647.41 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23738. 1647.41 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23739. 1647.41 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23740. 1647.41 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23741. 1647.41 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23742. 1647.41 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23743. 1647.42 s [algebraic-graphs] OK: closure . closure == closure
  23744. 1647.42 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23745. 1647.42 s [algebraic-graphs]
  23746. 1647.42 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23747. 1647.42 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23748. 1647.42 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23749. 1647.42 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23750. 1647.42 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23751. 1647.42 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23752. 1647.42 s [algebraic-graphs]
  23753. 1647.42 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23754. 1647.42 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23755. 1647.42 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23756. 1647.42 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23757. 1647.42 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23758. 1647.42 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23759. 1647.42 s [algebraic-graphs]
  23760. 1647.42 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23761. 1647.42 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23762. 1647.42 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23763. 1647.42 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23764. 1647.42 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23765. 1647.42 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23766. 1647.42 s [algebraic-graphs]
  23767. 1647.42 s [algebraic-graphs] ============ Relation.induceJust ============
  23768. 1647.42 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23769. 1647.42 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23770. 1647.42 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23771. 1647.42 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23772. 1647.42 s [algebraic-graphs]
  23773. 1647.42 s [algebraic-graphs] ============ ReflexiveRelation ============
  23774. 1647.42 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23775. 1647.42 s [algebraic-graphs]
  23776. 1647.42 s [algebraic-graphs] ============ TransitiveRelation ============
  23777. 1647.42 s [algebraic-graphs] OK: Axioms of transitive graphs
  23778. 1647.42 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23779. 1647.42 s [algebraic-graphs]
  23780. 1647.42 s [algebraic-graphs] ============ PreorderRelation ============
  23781. 1647.42 s [algebraic-graphs] OK: Axioms of preorder graphs
  23782. 1647.42 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23783. 1647.42 s [algebraic-graphs]
  23784. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation ============
  23785. 1647.42 s [algebraic-graphs] OK: Axioms of undirected graphs
  23786. 1647.42 s [algebraic-graphs]
  23787. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23788. 1647.42 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23789. 1647.42 s [algebraic-graphs]
  23790. 1647.42 s [algebraic-graphs] OK: consistent empty == True
  23791. 1647.42 s [algebraic-graphs] OK: consistent (vertex x) == True
  23792. 1647.42 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23793. 1647.42 s [algebraic-graphs] OK: consistent (connect x y) == True
  23794. 1647.42 s [algebraic-graphs] OK: consistent (edge x y) == True
  23795. 1647.42 s [algebraic-graphs] OK: consistent (edges xs) == True
  23796. 1647.42 s [algebraic-graphs] OK: consistent (stars xs) == True
  23797. 1647.42 s [algebraic-graphs]
  23798. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23799. 1647.42 s [algebraic-graphs] OK: show (empty ) == "empty"
  23800. 1647.42 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23801. 1647.42 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23802. 1647.42 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23803. 1647.42 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23804. 1647.42 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23805. 1647.42 s [algebraic-graphs]
  23806. 1647.42 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23807. 1647.42 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23808. 1647.42 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23809. 1647.42 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23810. 1647.42 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23811. 1647.42 s [algebraic-graphs]
  23812. 1647.42 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23813. 1647.42 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23814. 1647.42 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23815. 1647.42 s [algebraic-graphs]
  23816. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23817. 1647.42 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23818. 1647.42 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23819. 1647.42 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23820. 1647.42 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23821. 1647.42 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23822. 1647.42 s [algebraic-graphs]
  23823. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23824. 1647.42 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23825. 1647.42 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23826. 1647.42 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23827. 1647.42 s [algebraic-graphs]
  23828. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23829. 1647.42 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23830. 1647.42 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23831. 1647.42 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23832. 1647.42 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23833. 1647.42 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23834. 1647.42 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23835. 1647.42 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23836. 1647.42 s [algebraic-graphs] OK: x <= x + y
  23837. 1647.42 s [algebraic-graphs] OK: x + y <= x * y
  23838. 1647.42 s [algebraic-graphs]
  23839. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23840. 1647.42 s [algebraic-graphs] OK: isEmpty empty == True
  23841. 1647.42 s [algebraic-graphs] OK: hasVertex x empty == False
  23842. 1647.42 s [algebraic-graphs] OK: vertexCount empty == 0
  23843. 1647.42 s [algebraic-graphs] OK: edgeCount empty == 0
  23844. 1647.42 s [algebraic-graphs]
  23845. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23846. 1647.42 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23847. 1647.42 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23848. 1647.42 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23849. 1647.42 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23850. 1647.42 s [algebraic-graphs]
  23851. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23852. 1647.42 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23853. 1647.42 s [algebraic-graphs] OK: edge x y == edge y x
  23854. 1647.42 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23855. 1647.42 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23856. 1647.42 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23857. 1647.42 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23858. 1647.42 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23859. 1647.42 s [algebraic-graphs]
  23860. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23861. 1647.42 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23862. 1647.42 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23863. 1647.42 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23864. 1647.42 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23865. 1647.42 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23866. 1647.42 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23867. 1647.42 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23868. 1647.42 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23869. 1647.42 s [algebraic-graphs]
  23870. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23871. 1647.42 s [algebraic-graphs] OK: connect x y == connect y x
  23872. 1647.42 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23873. 1647.42 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23874. 1647.42 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23875. 1647.42 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23876. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23877. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23878. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23879. 1647.42 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23880. 1647.42 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23881. 1647.42 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23882. 1647.42 s [algebraic-graphs]
  23883. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23884. 1647.42 s [algebraic-graphs] OK: vertices [] == empty
  23885. 1647.42 s [algebraic-graphs] OK: vertices [x] == vertex x
  23886. 1647.42 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23887. 1647.42 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23888. 1647.42 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23889. 1647.42 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23890. 1647.42 s [algebraic-graphs]
  23891. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23892. 1647.42 s [algebraic-graphs] OK: edges [] == empty
  23893. 1647.42 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23894. 1647.42 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23895. 1647.42 s [algebraic-graphs]
  23896. 1647.42 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23897. 1647.42 s [algebraic-graphs] OK: overlays [] == empty
  23898. 1647.49 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.dyn_o )
  23899. 1647.98 s [haskell-language-server] [ 7 of 10] Compiling Ide.Plugin.Eval.Parse.Comments ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Comments.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.dyn_o )
  23900. 1650.55 s [haskell-language-server] [ 8 of 10] Compiling Ide.Plugin.Eval.Code ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.dyn_o )
  23901. 1650.55 s [haskell-language-server] [ 9 of 10] Compiling Ide.Plugin.Eval.Handlers ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Handlers.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.dyn_o )
  23902. 1652.42 s [haskell-language-server] [10 of 10] Compiling Ide.Plugin.Eval ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval.dyn_o )
  23903. 1653.03 s [haskell-language-server] [ 1 of 10] Compiling Ide.Plugin.Eval.Config ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Config.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Config.p_o )
  23904. 1653.63 s [haskell-language-server] [ 2 of 10] Compiling Ide.Plugin.Eval.Parse.Option ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Option.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Option.p_o )
  23905. 1653.78 s [haskell-language-server] [ 3 of 10] Compiling Ide.Plugin.Eval.Util ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Util.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Util.p_o )
  23906. 1653.86 s [haskell-language-server] [ 4 of 10] Compiling Ide.Plugin.Eval.GHC ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/GHC.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/GHC.p_o )
  23907. 1654.84 s [haskell-language-server] [ 5 of 10] Compiling Ide.Plugin.Eval.Types ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Types.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Types.p_o )
  23908. 1660.17 s [algebraic-graphs] OK: overlays [x] == x
  23909. 1660.17 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23910. 1660.17 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23911. 1660.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23912. 1660.19 s [algebraic-graphs]
  23913. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23914. 1660.19 s [algebraic-graphs] OK: connects [] == empty
  23915. 1660.19 s [algebraic-graphs] OK: connects [x] == x
  23916. 1660.19 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23917. 1660.19 s [algebraic-graphs] OK: connects == foldr connect empty
  23918. 1660.19 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23919. 1660.19 s [algebraic-graphs] OK: connects == connects . reverse
  23920. 1660.19 s [algebraic-graphs]
  23921. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23922. 1660.19 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23923. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23924. 1660.19 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23925. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23926. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23927. 1660.19 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23928. 1660.19 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23929. 1660.19 s [algebraic-graphs]
  23930. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23931. 1660.19 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23932. 1660.19 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23933. 1660.19 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23934. 1660.19 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23935. 1660.19 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23936. 1660.19 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23937. 1660.19 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23938. 1660.19 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23939. 1660.19 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23940. 1660.19 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23941. 1660.19 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23942. 1660.19 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23943. 1660.19 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23944. 1660.19 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23945. 1660.19 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23946. 1660.19 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23947. 1660.19 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23948. 1660.19 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23949. 1660.19 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23950. 1660.19 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23951. 1660.19 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23952. 1660.19 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23953. 1660.19 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23954. 1660.19 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23955. 1660.19 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23956. 1660.19 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23957. 1660.19 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23958. 1660.19 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23959. 1660.19 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23960. 1660.19 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23961. 1660.19 s [algebraic-graphs]
  23962. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23963. 1660.19 s [algebraic-graphs] OK: isEmpty empty == True
  23964. 1660.19 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23965. 1660.19 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23966. 1660.19 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23967. 1660.19 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23968. 1660.19 s [algebraic-graphs]
  23969. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23970. 1660.19 s [algebraic-graphs] OK: hasVertex x empty == False
  23971. 1660.19 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23972. 1660.19 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23973. 1660.19 s [algebraic-graphs]
  23974. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23975. 1660.19 s [algebraic-graphs] OK: hasEdge x y empty == False
  23976. 1660.19 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23977. 1660.19 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23978. 1660.19 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23979. 1660.19 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23980. 1660.19 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23981. 1660.19 s [algebraic-graphs]
  23982. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23983. 1660.19 s [algebraic-graphs] OK: vertexCount empty == 0
  23984. 1660.19 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23985. 1660.19 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23986. 1660.19 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23987. 1660.19 s [algebraic-graphs]
  23988. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23989. 1660.19 s [algebraic-graphs] OK: edgeCount empty == 0
  23990. 1660.19 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23991. 1660.19 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23992. 1660.19 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23993. 1660.19 s [algebraic-graphs]
  23994. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23995. 1660.19 s [algebraic-graphs] OK: vertexList empty == []
  23996. 1660.19 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23997. 1660.19 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23998. 1660.19 s [algebraic-graphs]
  23999. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  24000. 1660.19 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  24001. 1660.19 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  24002. 1660.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24003. 1660.19 s [algebraic-graphs]
  24004. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  24005. 1660.19 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  24006. 1660.19 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  24007. 1660.19 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  24008. 1660.19 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  24009. 1660.19 s [algebraic-graphs]
  24010. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  24011. 1660.19 s [algebraic-graphs] OK: edgeList empty == []
  24012. 1660.19 s [algebraic-graphs] OK: edgeList (vertex x) == []
  24013. 1660.19 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  24014. 1660.19 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  24015. 1660.19 s [algebraic-graphs]
  24016. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  24017. 1660.19 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  24018. 1660.19 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  24019. 1660.19 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  24020. 1660.19 s [algebraic-graphs]
  24021. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  24022. 1660.19 s [algebraic-graphs] OK: adjacencyList empty == []
  24023. 1660.19 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  24024. 1660.19 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  24025. 1660.19 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  24026. 1660.19 s [algebraic-graphs]
  24027. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  24028. 1660.19 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  24029. 1660.19 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  24030. 1660.19 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  24031. 1660.19 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  24032. 1660.19 s [algebraic-graphs]
  24033. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  24034. 1660.19 s [algebraic-graphs] OK: path [] == empty
  24035. 1660.19 s [algebraic-graphs] OK: path [x] == vertex x
  24036. 1660.19 s [algebraic-graphs] OK: path [x,y] == edge x y
  24037. 1660.19 s [algebraic-graphs] OK: path == path . reverse
  24038. 1660.19 s [algebraic-graphs]
  24039. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  24040. 1660.19 s [algebraic-graphs] OK: circuit [] == empty
  24041. 1660.19 s [algebraic-graphs] OK: circuit [x] == edge x x
  24042. 1660.19 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24043. 1660.19 s [algebraic-graphs] OK: circuit == circuit . reverse
  24044. 1660.19 s [algebraic-graphs]
  24045. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  24046. 1660.19 s [algebraic-graphs] OK: clique [] == empty
  24047. 1660.19 s [algebraic-graphs] OK: clique [x] == vertex x
  24048. 1660.19 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24049. 1660.19 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24050. 1660.19 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24051. 1660.19 s [algebraic-graphs] OK: clique == clique . reverse
  24052. 1660.19 s [algebraic-graphs]
  24053. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  24054. 1660.19 s [algebraic-graphs] OK: biclique [] [] == empty
  24055. 1660.19 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24056. 1660.19 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24057. 1660.19 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24058. 1660.19 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24059. 1660.19 s [algebraic-graphs]
  24060. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  24061. 1660.19 s [algebraic-graphs] OK: star x [] == vertex x
  24062. 1660.19 s [algebraic-graphs] OK: star x [y] == edge x y
  24063. 1660.19 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24064. 1660.19 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24065. 1660.19 s [algebraic-graphs]
  24066. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  24067. 1660.19 s [algebraic-graphs] OK: stars [] == empty
  24068. 1660.19 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24069. 1660.19 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24070. 1660.19 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24071. 1660.19 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24072. 1660.19 s [algebraic-graphs] OK: stars . adjacencyList == id
  24073. 1660.19 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24074. 1660.19 s [algebraic-graphs]
  24075. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  24076. 1660.19 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24077. 1660.19 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24078. 1660.19 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24079. 1660.19 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24080. 1660.19 s [algebraic-graphs]
  24081. 1660.19 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  24082. 1660.19 s [algebraic-graphs] OK: forest [] == empty
  24083. 1662.58 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.p_o )
  24084. 1663.21 s [haskell-language-server] [ 7 of 10] Compiling Ide.Plugin.Eval.Parse.Comments ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Parse/Comments.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Parse/Comments.p_o )
  24085. 1665.80 s [haskell-language-server] [ 8 of 10] Compiling Ide.Plugin.Eval.Code ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Code.p_o )
  24086. 1665.83 s [haskell-language-server] [ 9 of 10] Compiling Ide.Plugin.Eval.Handlers ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Handlers.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Handlers.p_o )
  24087. 1667.34 s [algebraic-graphs] OK: forest [x] == tree x
  24088. 1667.34 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24089. 1667.34 s [algebraic-graphs] OK: forest == overlays . map tree
  24090. 1667.34 s [algebraic-graphs]
  24091. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  24092. 1667.34 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24093. 1667.34 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24094. 1667.34 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24095. 1667.34 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24096. 1667.34 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24097. 1667.34 s [algebraic-graphs]
  24098. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  24099. 1667.34 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24100. 1667.34 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24101. 1667.34 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24102. 1667.34 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24103. 1667.34 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24104. 1667.34 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24105. 1667.34 s [algebraic-graphs]
  24106. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  24107. 1667.34 s [algebraic-graphs] OK: replaceVertex x x == id
  24108. 1667.34 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24109. 1667.34 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24110. 1667.34 s [algebraic-graphs]
  24111. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  24112. 1667.34 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24113. 1667.34 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24114. 1667.34 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24115. 1667.34 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24116. 1667.34 s [algebraic-graphs]
  24117. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  24118. 1667.34 s [algebraic-graphs] OK: gmap f empty == empty
  24119. 1667.34 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24120. 1667.34 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24121. 1667.34 s [algebraic-graphs] OK: gmap id == id
  24122. 1667.34 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24123. 1667.34 s [algebraic-graphs]
  24124. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  24125. 1667.34 s [algebraic-graphs] OK: induce (const True ) x == x
  24126. 1667.34 s [algebraic-graphs] OK: induce (const False) x == empty
  24127. 1667.34 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24128. 1667.34 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24129. 1667.34 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24130. 1667.34 s [algebraic-graphs]
  24131. 1667.34 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  24132. 1667.34 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24133. 1667.34 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24134. 1667.34 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24135. 1667.34 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24136. 1667.34 s [algebraic-graphs]
  24137. 1667.34 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  24138. 1667.34 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  24139. 1667.34 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  24140. 1667.34 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  24141. 1667.34 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  24142. 1667.34 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  24143. 1667.34 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  24144. 1667.34 s [algebraic-graphs]
  24145. 1667.34 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  24146. 1667.34 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  24147. 1667.34 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  24148. 1667.34 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  24149. 1667.34 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  24150. 1667.34 s [algebraic-graphs]
  24151. 1667.34 s [algebraic-graphs] ============ Typed ============
  24152. 1667.34 s [algebraic-graphs]
  24153. 1667.34 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  24154. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24155. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24156. 1667.34 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  24157. 1667.34 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24158. 1667.34 s [algebraic-graphs]
  24159. 1667.34 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  24160. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24161. 1667.34 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24162. 1667.34 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  24163. 1667.34 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24164. 1667.34 s [algebraic-graphs]
  24165. 1667.34 s [algebraic-graphs] ============ Typed.dfsForest ============
  24166. 1667.34 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  24167. 1667.34 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  24168. 1667.34 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  24169. 1667.34 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  24170. 1667.34 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  24171. 1667.34 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  24172. 1667.34 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  24173. 1667.34 s [algebraic-graphs]
  24174. 1667.34 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  24175. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  24176. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  24177. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  24178. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  24179. 1667.34 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  24180. 1667.34 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  24181. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  24182. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  24183. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  24184. 1667.34 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  24185. 1667.34 s [algebraic-graphs]
  24186. 1667.34 s [algebraic-graphs] ============ Typed.dfs ============
  24187. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  24188. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  24189. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  24190. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  24191. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  24192. 1667.34 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  24193. 1667.34 s [algebraic-graphs] OK: dfs % x $ [] == []
  24194. 1667.34 s [algebraic-graphs]
  24195. 1667.34 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  24196. 1667.34 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  24197. 1667.34 s [algebraic-graphs]
  24198. 1667.34 s [algebraic-graphs] ============ Typed.topSort ============
  24199. 1667.34 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  24200. 1667.34 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  24201. 1667.34 s [algebraic-graphs]
  24202. 1667.34 s [algebraic-graphs] ============ Graph.Undirected ============
  24203. 1667.34 s [algebraic-graphs] OK: Axioms of undirected graphs
  24204. 1667.34 s [algebraic-graphs]
  24205. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  24206. 1667.34 s [algebraic-graphs] OK: show (empty ) == "empty"
  24207. 1667.34 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  24208. 1667.34 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  24209. 1667.34 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  24210. 1667.34 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  24211. 1667.34 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  24212. 1667.34 s [algebraic-graphs]
  24213. 1667.34 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  24214. 1667.34 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  24215. 1667.34 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  24216. 1667.34 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  24217. 1667.34 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24218. 1667.34 s [algebraic-graphs]
  24219. 1667.34 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24220. 1667.34 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24221. 1667.34 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24222. 1667.34 s [algebraic-graphs]
  24223. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  24224. 1667.34 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  24225. 1667.34 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24226. 1667.34 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  24227. 1667.34 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  24228. 1667.34 s [algebraic-graphs]
  24229. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  24230. 1667.34 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  24231. 1667.34 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24232. 1667.34 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  24233. 1667.34 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  24234. 1667.34 s [algebraic-graphs]
  24235. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  24236. 1667.34 s [algebraic-graphs] OK: complement empty == empty
  24237. 1667.34 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  24238. 1667.34 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  24239. 1667.34 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  24240. 1667.34 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  24241. 1667.34 s [algebraic-graphs] OK: complement . complement == id
  24242. 1667.34 s [algebraic-graphs]
  24243. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  24244. 1667.34 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24245. 1667.34 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24246. 1667.34 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24247. 1667.34 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24248. 1667.34 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24249. 1667.34 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24250. 1667.34 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24251. 1667.34 s [algebraic-graphs] OK: x <= x + y
  24252. 1667.34 s [algebraic-graphs] OK: x + y <= x * y
  24253. 1667.34 s [algebraic-graphs]
  24254. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  24255. 1667.34 s [algebraic-graphs] OK: isEmpty empty == True
  24256. 1667.34 s [algebraic-graphs] OK: hasVertex x empty == False
  24257. 1667.34 s [algebraic-graphs] OK: vertexCount empty == 0
  24258. 1667.34 s [algebraic-graphs] OK: edgeCount empty == 0
  24259. 1667.34 s [algebraic-graphs]
  24260. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  24261. 1667.34 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24262. 1667.34 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24263. 1667.34 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24264. 1667.34 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24265. 1667.34 s [algebraic-graphs]
  24266. 1667.34 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  24267. 1667.34 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24268. 1667.34 s [algebraic-graphs] OK: edge x y == edge y x
  24269. 1667.65 s [haskell-language-server] [10 of 10] Compiling Ide.Plugin.Eval ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval.p_o )
  24270. 1674.03 s [haskell-language-server] Preprocessing library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  24271. 1674.03 s [haskell-language-server] Building library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0..
  24272. 1674.15 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.SignatureHelp ( plugins/hls-signature-help-plugin/src/Ide/Plugin/SignatureHelp.hs, dist/build/hls-signature-help-plugin/Ide/Plugin/SignatureHelp.o, dist/build/hls-signature-help-plugin/Ide/Plugin/SignatureHelp.dyn_o )
  24273. 1676.07 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.SignatureHelp ( plugins/hls-signature-help-plugin/src/Ide/Plugin/SignatureHelp.hs, dist/build/hls-signature-help-plugin/Ide/Plugin/SignatureHelp.p_o )
  24274. 1677.31 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24275. 1677.31 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24276. 1677.31 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24277. 1677.31 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24278. 1677.31 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24279. 1677.31 s [algebraic-graphs]
  24280. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  24281. 1677.31 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24282. 1677.31 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24283. 1677.31 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24284. 1677.31 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24285. 1677.31 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24286. 1677.31 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24287. 1677.31 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24288. 1677.31 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24289. 1677.31 s [algebraic-graphs]
  24290. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  24291. 1677.31 s [algebraic-graphs] OK: connect x y == connect y x
  24292. 1677.31 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24293. 1677.31 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24294. 1677.31 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24295. 1677.31 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24296. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24297. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24298. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24299. 1677.31 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24300. 1677.31 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24301. 1677.31 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24302. 1677.31 s [algebraic-graphs]
  24303. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  24304. 1677.31 s [algebraic-graphs] OK: vertices [] == empty
  24305. 1677.31 s [algebraic-graphs] OK: vertices [x] == vertex x
  24306. 1677.31 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24307. 1677.31 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24308. 1677.31 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24309. 1677.31 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24310. 1677.31 s [algebraic-graphs]
  24311. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  24312. 1677.31 s [algebraic-graphs] OK: edges [] == empty
  24313. 1677.31 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24314. 1677.31 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24315. 1677.31 s [algebraic-graphs]
  24316. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  24317. 1677.31 s [algebraic-graphs] OK: overlays [] == empty
  24318. 1677.31 s [algebraic-graphs] OK: overlays [x] == x
  24319. 1677.31 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24320. 1677.31 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24321. 1677.31 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24322. 1677.31 s [algebraic-graphs]
  24323. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  24324. 1677.31 s [algebraic-graphs] OK: connects [] == empty
  24325. 1677.31 s [algebraic-graphs] OK: connects [x] == x
  24326. 1677.31 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24327. 1677.31 s [algebraic-graphs] OK: connects == foldr connect empty
  24328. 1677.31 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24329. 1677.31 s [algebraic-graphs] OK: connects == connects . reverse
  24330. 1677.31 s [algebraic-graphs]
  24331. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  24332. 1677.31 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24333. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24334. 1677.31 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24335. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24336. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24337. 1677.31 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24338. 1677.31 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24339. 1677.31 s [algebraic-graphs]
  24340. 1677.31 s [algebraic-graphs] ============ Graph.Undirected.path ============
  24341. 1677.31 s [algebraic-graphs] OK: path [] == empty
  24342. 1677.31 s [algebraic-graphs] OK: path [x] == vertex x
  24343. 1677.32 s [algebraic-graphs] OK: path [x,y] == edge x y
  24344. 1677.32 s [algebraic-graphs] OK: path == path . reverse
  24345. 1677.32 s [algebraic-graphs]
  24346. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  24347. 1677.32 s [algebraic-graphs] OK: circuit [] == empty
  24348. 1677.32 s [algebraic-graphs] OK: circuit [x] == edge x x
  24349. 1677.32 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24350. 1677.32 s [algebraic-graphs] OK: circuit == circuit . reverse
  24351. 1677.32 s [algebraic-graphs]
  24352. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  24353. 1677.32 s [algebraic-graphs] OK: clique [] == empty
  24354. 1677.32 s [algebraic-graphs] OK: clique [x] == vertex x
  24355. 1677.32 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24356. 1677.32 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24357. 1677.32 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24358. 1677.32 s [algebraic-graphs] OK: clique == clique . reverse
  24359. 1677.32 s [algebraic-graphs]
  24360. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  24361. 1677.32 s [algebraic-graphs] OK: biclique [] [] == empty
  24362. 1677.32 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24363. 1677.32 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24364. 1677.32 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24365. 1677.32 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24366. 1677.32 s [algebraic-graphs]
  24367. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.star ============
  24368. 1677.32 s [algebraic-graphs] OK: star x [] == vertex x
  24369. 1677.32 s [algebraic-graphs] OK: star x [y] == edge x y
  24370. 1677.32 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24371. 1677.32 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24372. 1677.32 s [algebraic-graphs]
  24373. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  24374. 1677.32 s [algebraic-graphs] OK: stars [] == empty
  24375. 1677.32 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24376. 1677.32 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24377. 1677.32 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24378. 1677.32 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24379. 1677.32 s [algebraic-graphs] OK: stars . adjacencyList == id
  24380. 1677.32 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24381. 1677.32 s [algebraic-graphs]
  24382. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  24383. 1677.32 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24384. 1677.32 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24385. 1677.32 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24386. 1677.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)]
  24387. 1677.32 s [algebraic-graphs]
  24388. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  24389. 1677.32 s [algebraic-graphs] OK: forest [] == empty
  24390. 1677.32 s [algebraic-graphs] OK: forest [x] == tree x
  24391. 1677.32 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24392. 1677.32 s [algebraic-graphs] OK: forest == overlays . map tree
  24393. 1677.32 s [algebraic-graphs]
  24394. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24395. 1677.32 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24396. 1677.32 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24397. 1677.32 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24398. 1677.32 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24399. 1677.32 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24400. 1677.32 s [algebraic-graphs]
  24401. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24402. 1677.32 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24403. 1677.32 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24404. 1677.32 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24405. 1677.32 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24406. 1677.32 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24407. 1677.32 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24408. 1677.32 s [algebraic-graphs]
  24409. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24410. 1677.32 s [algebraic-graphs] OK: replaceVertex x x == id
  24411. 1677.32 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24412. 1677.32 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24413. 1677.32 s [algebraic-graphs]
  24414. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24415. 1677.32 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24416. 1677.32 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24417. 1677.32 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24418. 1677.32 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24419. 1677.32 s [algebraic-graphs]
  24420. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24421. 1677.32 s [algebraic-graphs] OK: gmap f empty == empty
  24422. 1677.32 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24423. 1677.32 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24424. 1677.32 s [algebraic-graphs] OK: gmap id == id
  24425. 1677.32 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24426. 1677.32 s [algebraic-graphs]
  24427. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24428. 1677.32 s [algebraic-graphs] OK: induce (const True ) x == x
  24429. 1677.32 s [algebraic-graphs] OK: induce (const False) x == empty
  24430. 1677.32 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24431. 1677.32 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24432. 1677.32 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24433. 1677.32 s [algebraic-graphs]
  24434. 1677.32 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24435. 1677.32 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24436. 1677.32 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24437. 1677.32 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24438. 1677.32 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24439. 1677.32 s [algebraic-graphs] Test suite main: PASS
  24440. 1677.32 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24441. 1677.32 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24442. 1677.33 s [algebraic-graphs] checkPhase completed in 2 minutes 4 seconds
  24443. 1677.33 s [algebraic-graphs] Phase: haddockPhase
  24444. 1677.46 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  24445. 1677.47 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  24446. 1677.52 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  24447. 1677.84 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24448. 1678.03 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24449. 1678.11 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24450. 1678.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24451. 1678.11 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24452. 1678.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24453. 1678.11 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24454. 1678.11 s [algebraic-graphs] Missing documentation for:
  24455. 1678.11 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24456. 1678.17 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24457. 1678.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24458. 1678.18 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24459. 1678.38 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24460. 1678.49 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24461. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24462. 1678.49 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24463. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24464. 1678.49 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24465. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24466. 1678.49 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24467. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24468. 1678.49 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24469. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24470. 1678.49 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24471. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24472. 1678.49 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24473. 1678.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24474. 1678.50 s [algebraic-graphs] Warning: 'box' is out of scope.
  24475. 1678.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24476. 1678.50 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24477. 1678.50 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24478. 1678.50 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24479. 1678.59 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24480. 1678.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24481. 1678.60 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24482. 1678.78 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24483. 1678.78 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24484. 1678.79 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24485. 1678.91 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24486. 1679.03 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24487. 1679.03 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24488. 1679.07 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24489. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24490. 1679.07 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24491. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24492. 1679.07 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24493. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24494. 1679.07 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24495. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24496. 1679.07 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24497. 1679.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24498. 1679.07 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24499. 1679.21 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24500. 1679.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24501. 1679.21 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24502. 1679.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24503. 1679.22 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24504. 1679.22 s [algebraic-graphs] Missing documentation for:
  24505. 1679.22 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24506. 1679.32 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24507. 1679.39 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24508. 1679.44 s [algebraic-graphs]
  24509. 1679.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24510. 1679.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24511. 1679.44 s [algebraic-graphs] will become an error in a future GHC release.
  24512. 1679.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24513. 1679.44 s [algebraic-graphs] |
  24514. 1679.44 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24515. 1679.44 s [algebraic-graphs] | ^
  24516. 1679.44 s [algebraic-graphs]
  24517. 1679.44 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24518. 1679.44 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24519. 1679.44 s [algebraic-graphs] will become an error in a future GHC release.
  24520. 1679.44 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24521. 1679.45 s [algebraic-graphs] |
  24522. 1679.45 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24523. 1679.45 s [algebraic-graphs] | ^
  24524. 1679.45 s [algebraic-graphs]
  24525. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24526. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24527. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  24528. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24529. 1679.45 s [algebraic-graphs] |
  24530. 1679.45 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24531. 1679.45 s [algebraic-graphs] | ^
  24532. 1679.45 s [algebraic-graphs]
  24533. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24534. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24535. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  24536. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24537. 1679.45 s [algebraic-graphs] |
  24538. 1679.45 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24539. 1679.45 s [algebraic-graphs] | ^
  24540. 1679.45 s [algebraic-graphs]
  24541. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24542. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24543. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  24544. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24545. 1679.45 s [algebraic-graphs] |
  24546. 1679.45 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24547. 1679.45 s [algebraic-graphs] | ^
  24548. 1679.45 s [algebraic-graphs]
  24549. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24550. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24551. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  24552. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24553. 1679.45 s [algebraic-graphs] |
  24554. 1679.45 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24555. 1679.45 s [algebraic-graphs] | ^
  24556. 1679.45 s [algebraic-graphs]
  24557. 1679.45 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24558. 1679.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24559. 1679.45 s [algebraic-graphs] will become an error in a future GHC release.
  24560. 1679.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24561. 1679.45 s [algebraic-graphs] |
  24562. 1679.46 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24563. 1679.46 s [algebraic-graphs] | ^
  24564. 1679.53 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24565. 1679.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24566. 1679.53 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24567. 1679.73 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24568. 1679.82 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24569. 1679.82 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24570. 1679.84 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24571. 1679.96 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24572. 1680.24 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24573. 1680.64 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24574. 1680.67 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24575. 1680.71 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24576. 1680.72 s [algebraic-graphs]
  24577. 1680.72 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24578. 1680.72 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24579. 1680.72 s [algebraic-graphs] will become an error in a future GHC release.
  24580. 1680.72 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24581. 1680.72 s [algebraic-graphs] |
  24582. 1680.72 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24583. 1680.72 s [algebraic-graphs] | ^
  24584. 1680.73 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24585. 1680.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24586. 1680.74 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24587. 1680.74 s [algebraic-graphs]
  24588. 1680.74 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24589. 1680.74 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24590. 1680.74 s [algebraic-graphs] will become an error in a future GHC release.
  24591. 1680.74 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24592. 1680.74 s [algebraic-graphs] |
  24593. 1680.74 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24594. 1680.74 s [algebraic-graphs] | ^
  24595. 1680.74 s [algebraic-graphs]
  24596. 1680.75 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24597. 1680.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24598. 1680.75 s [algebraic-graphs] will become an error in a future GHC release.
  24599. 1680.75 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24600. 1680.75 s [algebraic-graphs] |
  24601. 1680.75 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24602. 1680.75 s [algebraic-graphs] | ^
  24603. 1680.80 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24604. 1680.96 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24605. 1681.02 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24606. 1681.02 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24607. 1681.03 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24608. 1681.04 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24609. 1681.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24610. 1681.04 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24611. 1681.06 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24612. 1681.06 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24613. 1681.06 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24614. 1681.15 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24615. 1681.15 s [algebraic-graphs] Missing documentation for:
  24616. 1681.15 s [algebraic-graphs] Module header
  24617. 1681.15 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24618. 1681.16 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  24619. 1681.16 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  24620. 1681.16 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  24621. 1681.16 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  24622. 1681.16 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  24623. 1681.16 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  24624. 1681.18 s [algebraic-graphs] Warning: 'array' is out of scope.
  24625. 1681.18 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24626. 1681.18 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24627. 1681.18 s [algebraic-graphs] Missing documentation for:
  24628. 1681.18 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  24629. 1683.45 s [haskell-language-server] Preprocessing executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  24630. 1683.45 s [haskell-language-server] Building executable 'plugin-tutorial' for haskell-language-server-2.12.0.0..
  24631. 1683.62 s [haskell-language-server] [1 of 1] Compiling Main ( docs/contributing/plugin-tutorial.lhs, dist/build/plugin-tutorial/plugin-tutorial-tmp/Main.dyn_o )
  24632. 1684.80 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  24633. 1684.80 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24634. 1684.87 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24635. 1684.88 s [algebraic-graphs] Phase: installPhase
  24636. 1684.95 s [algebraic-graphs] Installing library in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24637. 1685.05 s [haskell-language-server] [2 of 2] Linking dist/build/plugin-tutorial/plugin-tutorial
  24638. 1685.56 s [algebraic-graphs] Phase: fixupPhase
  24639. 1685.58 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24640. 1685.60 s [algebraic-graphs] shrinking /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSalgebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE-ghc9.6.7.so
  24641. 1685.61 s [algebraic-graphs] checking for references to /build/ in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7...
  24642. 1685.65 s [algebraic-graphs] patching script interpreter paths in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24643. 1685.65 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib
  24644. 1685.91 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc
  24645. 1685.94 s [algebraic-graphs] checking for references to /build/ in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc...
  24646. 1685.97 s [algebraic-graphs] patching script interpreter paths in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc
  24647. 1686.12 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24648. 1686.55 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  24649. 1686.57 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24650. 1686.61 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24651. 1686.62 s [algebraic-graphs:post-build] copying 2 paths...
  24652. 1686.62 s [algebraic-graphs:post-build] copying path '/nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24653. 1688.05 s [algebraic-graphs:post-build] copying path '/nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24654. 1694.07 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24655. 1694.15 s [algebraic-graphs:post-build] copying 0 paths...
  24656. 1694.17 s Progress: 22 of 27 built (1 building), 341 of 341 downloaded from cache
  24657. 1694.22 s Building /nix/store/3ik1jpbmsnyv5kdcr4w2ajwvybsflc6w-ghc-9.6.7-with-packages.drv
  24658. 1694.22 s [haskell-language-server] Preprocessing library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  24659. 1694.22 s [haskell-language-server] Building library 'hls-stan-plugin' for haskell-language-server-2.12.0.0..
  24660. 1694.22 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Stan ( plugins/hls-stan-plugin/src/Ide/Plugin/Stan.hs, dist/build/hls-stan-plugin/Ide/Plugin/Stan.o, dist/build/hls-stan-plugin/Ide/Plugin/Stan.dyn_o )
  24661. 1694.22 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Stan ( plugins/hls-stan-plugin/src/Ide/Plugin/Stan.hs, dist/build/hls-stan-plugin/Ide/Plugin/Stan.p_o )
  24662. 1694.28 s [ghc-9.6.7-with-packages] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/nix-support:
  24663. 1694.28 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24664. 1694.28 s [ghc-9.6.7-with-packages] /nix/store/ws4bxm02xf3qm4nhj7wqa0pmnyap2ly6-ghc-compat-plugin-0.1.0.1/nix-support:
  24665. 1694.28 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24666. 1694.29 s [ghc-9.6.7-with-packages] /nix/store/dy7plzxvi4bj3cj8g64wf3k5vaj5c70a-hedgehog-1.5/nix-support:
  24667. 1694.29 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24668. 1694.31 s [ghc-9.6.7-with-packages] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/nix-support:
  24669. 1694.31 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24670. 1694.33 s [ghc-9.6.7-with-packages] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/nix-support:
  24671. 1694.33 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24672. 1694.34 s [ghc-9.6.7-with-packages] /nix/store/1cnj5acqwjghacz5lcl0df0g61b7b2g1-temporary-1.3/nix-support:
  24673. 1694.34 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24674. 1694.34 s [ghc-9.6.7-with-packages] /nix/store/1cnj5acqwjghacz5lcl0df0g61b7b2g1-temporary-1.3/nix-support:
  24675. 1694.34 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24676. 1694.34 s [ghc-9.6.7-with-packages] /nix/store/fcbs80997frlprcgnfz1pgqzwx17bdfj-ansi-terminal-1.1.3/nix-support:
  24677. 1694.34 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24678. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/fcbs80997frlprcgnfz1pgqzwx17bdfj-ansi-terminal-1.1.3/nix-support:
  24679. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24680. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/jjabyw5gl9cvdkdwfmgvllmj76cd5xx2-async-2.2.5/nix-support:
  24681. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24682. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/jjabyw5gl9cvdkdwfmgvllmj76cd5xx2-async-2.2.5/nix-support:
  24683. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24684. 1694.35 s [ghc-9.6.7-with-packages] /nix/store/1rnj3abisldb1ysvfg7jx4xq63kvnh9f-barbies-2.1.1.0/nix-support:
  24685. 1694.35 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24686. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/1rnj3abisldb1ysvfg7jx4xq63kvnh9f-barbies-2.1.1.0/nix-support:
  24687. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24688. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/ygwfbz0mwnsj9r4vy9zhqnhn5baqlwz7-concurrent-output-1.10.21/nix-support:
  24689. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24690. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/ygwfbz0mwnsj9r4vy9zhqnhn5baqlwz7-concurrent-output-1.10.21/nix-support:
  24691. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24692. 1694.36 s [ghc-9.6.7-with-packages] /nix/store/76z6kzz2xf8gljhm76swxb542xp0lqkz-lifted-async-0.10.2.7/nix-support:
  24693. 1694.36 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24694. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/76z6kzz2xf8gljhm76swxb542xp0lqkz-lifted-async-0.10.2.7/nix-support:
  24695. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24696. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/iasz4h3zl5q9kgrf288g9fak6g03s54x-mmorph-1.2.1/nix-support:
  24697. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24698. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/iasz4h3zl5q9kgrf288g9fak6g03s54x-mmorph-1.2.1/nix-support:
  24699. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24700. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/9h348vl6yhan64ibbcabyjx2fmxs7d3b-monad-control-1.0.3.1/nix-support:
  24701. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24702. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/9h348vl6yhan64ibbcabyjx2fmxs7d3b-monad-control-1.0.3.1/nix-support:
  24703. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24704. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/wdxmylyqc8p4j414kk3ymndp5i2yqjm3-pretty-show-1.10/nix-support:
  24705. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24706. 1694.37 s [ghc-9.6.7-with-packages] /nix/store/wdxmylyqc8p4j414kk3ymndp5i2yqjm3-pretty-show-1.10/nix-support:
  24707. 1694.37 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24708. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/k1gharvwzs4drk9axklr4dcizqkqnia7-primitive-0.9.1.0/nix-support:
  24709. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24710. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/k1gharvwzs4drk9axklr4dcizqkqnia7-primitive-0.9.1.0/nix-support:
  24711. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24712. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/nnj36snlh7c273pijflsjp18z8z6bv71-random-1.2.1.3/nix-support:
  24713. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24714. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/nnj36snlh7c273pijflsjp18z8z6bv71-random-1.2.1.3/nix-support:
  24715. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24716. 1694.38 s [ghc-9.6.7-with-packages] /nix/store/hgb60y6pgscn0xg3sa2j4llfykqikdcb-resourcet-1.3.0/nix-support:
  24717. 1694.38 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24718. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/hgb60y6pgscn0xg3sa2j4llfykqikdcb-resourcet-1.3.0/nix-support:
  24719. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24720. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/gni425lh8g2a5k2iy04gza6hxwivikyp-safe-exceptions-0.1.7.4/nix-support:
  24721. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24722. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/gni425lh8g2a5k2iy04gza6hxwivikyp-safe-exceptions-0.1.7.4/nix-support:
  24723. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24724. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/iq5g0dfwam9zz3v08lgvcvvvgwhsbv0x-transformers-base-0.4.6/nix-support:
  24725. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24726. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/iq5g0dfwam9zz3v08lgvcvvvgwhsbv0x-transformers-base-0.4.6/nix-support:
  24727. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24728. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/w5r1n1grfq99nsaqjfsi3qspcxikk9hl-wl-pprint-annotated-0.1.0.1/nix-support:
  24729. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24730. 1694.39 s [ghc-9.6.7-with-packages] /nix/store/w5r1n1grfq99nsaqjfsi3qspcxikk9hl-wl-pprint-annotated-0.1.0.1/nix-support:
  24731. 1694.39 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24732. 1694.41 s [ghc-9.6.7-with-packages] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/nix-support:
  24733. 1694.41 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24734. 1694.42 s [ghc-9.6.7-with-packages] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/nix-support:
  24735. 1694.42 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24736. 1694.42 s [ghc-9.6.7-with-packages] /nix/store/i1773scyxkqyblf6vpzp8rwlnivkfggx-ansi-terminal-types-1.1.3/nix-support:
  24737. 1694.42 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24738. 1694.42 s [ghc-9.6.7-with-packages] /nix/store/i1773scyxkqyblf6vpzp8rwlnivkfggx-ansi-terminal-types-1.1.3/nix-support:
  24739. 1694.42 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24740. 1694.43 s [ghc-9.6.7-with-packages] /nix/store/6pimarw92xx2gdc004l52j33pgfnk5q3-hashable-1.5.0.0/nix-support:
  24741. 1694.43 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24742. 1694.43 s [ghc-9.6.7-with-packages] /nix/store/6pimarw92xx2gdc004l52j33pgfnk5q3-hashable-1.5.0.0/nix-support:
  24743. 1694.43 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24744. 1694.43 s [ghc-9.6.7-with-packages] /nix/store/r45rn7pmhwhm2a2arlc59m6q0ayf3x7k-distributive-0.6.2.1/nix-support:
  24745. 1694.43 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24746. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/r45rn7pmhwhm2a2arlc59m6q0ayf3x7k-distributive-0.6.2.1/nix-support:
  24747. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24748. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/g35hdx8r4gl48g5p5a7716hzmiacl823-constraints-0.14.2/nix-support:
  24749. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24750. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/g35hdx8r4gl48g5p5a7716hzmiacl823-constraints-0.14.2/nix-support:
  24751. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24752. 1694.44 s [ghc-9.6.7-with-packages] /nix/store/0yc01qnfkqq6ncifsd27ap4dvplafl0w-lifted-base-0.2.3.12/nix-support:
  24753. 1694.44 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24754. 1694.45 s [ghc-9.6.7-with-packages] /nix/store/0yc01qnfkqq6ncifsd27ap4dvplafl0w-lifted-base-0.2.3.12/nix-support:
  24755. 1694.45 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24756. 1694.45 s [ghc-9.6.7-with-packages] /nix/store/x61ml6alhwgm163idq8ykgn021gn0lf6-transformers-compat-0.7.2/nix-support:
  24757. 1694.45 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24758. 1694.45 s [ghc-9.6.7-with-packages] /nix/store/x61ml6alhwgm163idq8ykgn021gn0lf6-transformers-compat-0.7.2/nix-support:
  24759. 1694.45 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24760. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/zyhsf74vsbisnk8nxg7immascxvrgzrx-splitmix-0.1.3.1/nix-support:
  24761. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24762. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/zyhsf74vsbisnk8nxg7immascxvrgzrx-splitmix-0.1.3.1/nix-support:
  24763. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24764. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/qq625vh42zngn5an1w1fipnj2h9yfxb6-unliftio-core-0.2.1.0/nix-support:
  24765. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24766. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/qq625vh42zngn5an1w1fipnj2h9yfxb6-unliftio-core-0.2.1.0/nix-support:
  24767. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24768. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/hf7mjbw39mc2s31v9s0gvq0irxrj3ljz-base-orphans-0.9.3/nix-support:
  24769. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24770. 1694.46 s [ghc-9.6.7-with-packages] /nix/store/hf7mjbw39mc2s31v9s0gvq0irxrj3ljz-base-orphans-0.9.3/nix-support:
  24771. 1694.46 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24772. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/8qkh2vgcsvil9pkzial83q66cc6csf0h-os-string-2.0.8/nix-support:
  24773. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24774. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/8qkh2vgcsvil9pkzial83q66cc6csf0h-os-string-2.0.8/nix-support:
  24775. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24776. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/74c3l72p3ahsbcdqzxpmicwp8cyhqj1d-tagged-0.8.9/nix-support:
  24777. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24778. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/74c3l72p3ahsbcdqzxpmicwp8cyhqj1d-tagged-0.8.9/nix-support:
  24779. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24780. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/fam1g9nds2cbk2b6xp4jv742dm7kkjkp-boring-0.2.2/nix-support:
  24781. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24782. 1694.47 s [ghc-9.6.7-with-packages] /nix/store/fam1g9nds2cbk2b6xp4jv742dm7kkjkp-boring-0.2.2/nix-support:
  24783. 1694.47 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24784. 1695.16 s [ghc-9.6.7-with-packages] Warning: include-dirs: /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages/lib/ghc-9.6.7/lib/../lib/x86_64-linux-ghc-9.6.7/directory-1.3.8.5/include doesn't exist or isn't a directory
  24785. 1696.36 s [ghc-9.6.7-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages
  24786. 1696.75 s [ghc-9.6.7-with-packages:post-build] Pushing 1 paths (154 are already present) using zstd to cache sellout ⏳
  24787. 1696.75 s [ghc-9.6.7-with-packages:post-build]
  24788. 1697.13 s [ghc-9.6.7-with-packages:post-build] Pushing /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages (4.85 MiB)
  24789. 1698.57 s [ghc-9.6.7-with-packages:post-build]
  24790. 1698.57 s [ghc-9.6.7-with-packages:post-build] All done.
  24791. 1698.59 s [ghc-9.6.7-with-packages:post-build] Uploading to the NixCI cache: /nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages
  24792. 1698.63 s [ghc-9.6.7-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24793. 1698.78 s [ghc-9.6.7-with-packages:post-build] copying 1 paths...
  24794. 1698.78 s [ghc-9.6.7-with-packages:post-build] copying path '/nix/store/10ypxbv07jfvlkjykxidyjjpakbcwdc6-ghc-9.6.7-with-packages' to 'https://cache.nix-ci.com'...
  24795. 1699.80 s [ghc-9.6.7-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24796. 1699.98 s [ghc-9.6.7-with-packages:post-build] copying 1 paths...
  24797. 1699.98 s [ghc-9.6.7-with-packages:post-build] copying path '/nix/store/3ik1jpbmsnyv5kdcr4w2ajwvybsflc6w-ghc-9.6.7-with-packages.drv' to 'https://cache.nix-ci.com'...
  24798. 1700.15 s Progress: 23 of 26 built (1 building), 341 of 341 downloaded from cache
  24799. 1700.15 s [haskell-language-server] Preprocessing library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  24800. 1700.15 s [haskell-language-server] Building library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0..
  24801. 1700.15 s [haskell-language-server]
  24802. 1700.15 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24803. 1700.15 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24804. 1700.15 s [haskell-language-server] but were not needed for compilation:
  24805. 1700.15 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  24806. 1700.15 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitImports ( plugins/hls-explicit-imports-plugin/src/Ide/Plugin/ExplicitImports.hs, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.o, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.dyn_o )
  24807. 1703.10 s [haskell-language-server]
  24808. 1703.10 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24809. 1703.10 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24810. 1703.10 s [haskell-language-server] but were not needed for compilation:
  24811. 1703.10 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  24812. 1703.11 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitImports ( plugins/hls-explicit-imports-plugin/src/Ide/Plugin/ExplicitImports.hs, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.p_o )
  24813. 1713.78 s [haskell-language-server] Preprocessing library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  24814. 1713.78 s [haskell-language-server] Building library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0..
  24815. 1713.88 s [haskell-language-server]
  24816. 1713.88 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24817. 1713.88 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24818. 1713.88 s [haskell-language-server] but were not needed for compilation:
  24819. 1713.88 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  24820. 1713.90 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Fourmolu ( plugins/hls-fourmolu-plugin/src/Ide/Plugin/Fourmolu.hs, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.o, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.dyn_o )
  24821. 1719.11 s [haskell-language-server]
  24822. 1719.11 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24823. 1719.13 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24824. 1719.13 s [haskell-language-server] but were not needed for compilation:
  24825. 1719.13 s [haskell-language-server] - yaml-0.11.11.2 (exposed by flag -package-id yaml-0.11.11.2-Klyw2bZtzsLLiJpYse4XVy)
  24826. 1719.13 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.Fourmolu ( plugins/hls-fourmolu-plugin/src/Ide/Plugin/Fourmolu.hs, dist/build/hls-fourmolu-plugin/Ide/Plugin/Fourmolu.p_o )
  24827. 1728.99 s [haskell-language-server] Preprocessing library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  24828. 1729.00 s [haskell-language-server] Building library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0..
  24829. 1729.12 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFixity ( plugins/hls-explicit-fixity-plugin/src/Ide/Plugin/ExplicitFixity.hs, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.o, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.dyn_o )
  24830. 1731.10 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ExplicitFixity ( plugins/hls-explicit-fixity-plugin/src/Ide/Plugin/ExplicitFixity.hs, dist/build/hls-explicit-fixity-plugin/Ide/Plugin/ExplicitFixity.p_o )
  24831. 1737.53 s [haskell-language-server] Preprocessing executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  24832. 1737.53 s [haskell-language-server] Building executable 'ghcide-bench' for haskell-language-server-2.12.0.0..
  24833. 1737.66 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-bench/exe/Main.hs, dist/build/ghcide-bench/ghcide-bench-tmp/Main.dyn_o )
  24834. 1738.09 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-bench/ghcide-bench
  24835. 1739.74 s [haskell-language-server] Preprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  24836. 1739.74 s [haskell-language-server] Building library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0..
  24837. 1739.83 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.o, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.dyn_o )
  24838. 1741.42 s [haskell-language-server] [1 of 1] Compiling Ide.Plugin.ModuleName ( plugins/hls-module-name-plugin/src/Ide/Plugin/ModuleName.hs, dist/build/hls-module-name-plugin/Ide/Plugin/ModuleName.p_o )
  24839. 1747.64 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0..
  24840. 1747.64 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0..
  24841. 1747.88 s [haskell-language-server]
  24842. 1747.88 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24843. 1747.88 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24844. 1747.88 s [haskell-language-server] but were not needed for compilation:
  24845. 1747.88 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  24846. 1747.89 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  24847. 1749.16 s [haskell-language-server] [2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.o, dist/build/Paths_haskell_language_server.dyn_o )
  24848. 1749.16 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.o, dist/build/Ide/Version.dyn_o )
  24849. 1750.74 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.o, dist/build/Ide/Arguments.dyn_o )
  24850. 1751.23 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.o, dist/build/Ide/Main.dyn_o )
  24851. 1752.12 s [haskell-language-server]
  24852. 1752.12 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24853. 1752.12 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24854. 1752.12 s [haskell-language-server] but were not needed for compilation:
  24855. 1752.12 s [haskell-language-server] - ghc-9.6.7 (exposed by flag -package-id ghc-9.6.7)
  24856. 1752.14 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  24857. 1753.33 s [haskell-language-server] [2 of 5] Compiling Paths_haskell_language_server ( dist/build/autogen/Paths_haskell_language_server.hs, dist/build/Paths_haskell_language_server.p_o )
  24858. 1753.34 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  24859. 1755.12 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  24860. 1755.66 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  24861. 1764.13 s [haskell-language-server] Preprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  24862. 1764.15 s [haskell-language-server] Building executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0..
  24863. 1764.33 s [haskell-language-server] [1 of 2] Compiling Main ( exe/Wrapper.hs, dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper-tmp/Main.dyn_o )
  24864. 1765.38 s [haskell-language-server] [2 of 2] Compiling Paths_haskell_language_server ( dist/build/haskell-language-server-wrapper/autogen/Paths_haskell_language_server.hs, dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper-tmp/Paths_haskell_language_server.dyn_o )
  24865. 1765.77 s [haskell-language-server] [3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
  24866. 1767.97 s [haskell-language-server] Preprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  24867. 1767.97 s [haskell-language-server] Building executable 'haskell-language-server' for haskell-language-server-2.12.0.0..
  24868. 1768.10 s [haskell-language-server] [1 of 1] Compiling Main ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
  24869. 1769.21 s [haskell-language-server] [2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
  24870. 1771.39 s [haskell-language-server] buildPhase completed in 10 minutes 38 seconds
  24871. 1771.41 s [haskell-language-server] Phase: haddockPhase
  24872. 1771.41 s [haskell-language-server] Phase: installPhase
  24873. 1771.57 s [haskell-language-server] Installing internal library hls-overloaded-record-dot-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin
  24874. 1771.67 s [haskell-language-server] Installing internal library hls-change-type-signature-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin
  24875. 1771.69 s [haskell-language-server] Installing internal library hls-class-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin
  24876. 1771.76 s [haskell-language-server] Installing internal library hls-call-hierarchy-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin
  24877. 1771.82 s [haskell-language-server] Installing executable ghcide-test-preprocessor in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24878. 1771.82 s [haskell-language-server] Warning: The directory
  24879. 1771.82 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24880. 1771.82 s [haskell-language-server] is not in the system search path.
  24881. 1771.82 s [haskell-language-server] Installing internal library hls-code-range-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin
  24882. 1771.86 s [haskell-language-server] Installing internal library hls-notes-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin
  24883. 1771.89 s [haskell-language-server] Installing internal library ghcide-bench-lib in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib
  24884. 1771.98 s [haskell-language-server] Installing internal library hls-floskell-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin
  24885. 1771.99 s [haskell-language-server] Installing internal library hls-stylish-haskell-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin
  24886. 1772.01 s [haskell-language-server] Installing internal library hls-pragmas-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin
  24887. 1772.05 s [haskell-language-server] Installing internal library hls-semantic-tokens-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin
  24888. 1772.12 s [haskell-language-server] Installing internal library hls-ormolu-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin
  24889. 1772.14 s [haskell-language-server] Installing internal library hls-explicit-record-fields-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin
  24890. 1772.18 s [haskell-language-server] Installing internal library hls-cabal-gild-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin
  24891. 1772.20 s [haskell-language-server] Installing internal library hls-cabal-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin
  24892. 1772.36 s [haskell-language-server] Installing internal library hls-hlint-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin
  24893. 1772.41 s [haskell-language-server] Installing internal library hls-refactor-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin
  24894. 1772.75 s [haskell-language-server] Installing internal library hls-rename-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin
  24895. 1772.78 s [haskell-language-server] Installing internal library hls-splice-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin
  24896. 1772.83 s [haskell-language-server] Installing internal library hls-retrie-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin
  24897. 1772.93 s [haskell-language-server] Installing internal library hls-gadt-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin
  24898. 1772.96 s [haskell-language-server] Installing internal library hls-alternate-number-format-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin
  24899. 1773.00 s [haskell-language-server] Installing internal library hls-qualify-imported-names-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin
  24900. 1773.03 s [haskell-language-server] Installing internal library hls-cabal-fmt-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin
  24901. 1773.05 s [haskell-language-server] Installing internal library hls-eval-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin
  24902. 1773.22 s [haskell-language-server] Installing internal library hls-signature-help-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin
  24903. 1773.24 s [haskell-language-server] Installing executable plugin-tutorial in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24904. 1773.24 s [haskell-language-server] Warning: The directory
  24905. 1773.24 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24906. 1773.24 s [haskell-language-server] is not in the system search path.
  24907. 1773.25 s [haskell-language-server] Installing internal library hls-stan-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin
  24908. 1773.27 s [haskell-language-server] Installing internal library hls-explicit-imports-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin
  24909. 1773.32 s [haskell-language-server] Installing internal library hls-fourmolu-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin
  24910. 1773.35 s [haskell-language-server] Installing internal library hls-explicit-fixity-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin
  24911. 1773.37 s [haskell-language-server] Installing executable ghcide-bench in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24912. 1773.37 s [haskell-language-server] Warning: The directory
  24913. 1773.37 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24914. 1773.37 s [haskell-language-server] is not in the system search path.
  24915. 1773.37 s [haskell-language-server] Installing internal library hls-module-name-plugin in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin
  24916. 1773.40 s [haskell-language-server] Installing library in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/haskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF
  24917. 1773.45 s [haskell-language-server] Installing executable haskell-language-server-wrapper in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24918. 1773.45 s [haskell-language-server] Warning: The directory
  24919. 1773.45 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24920. 1773.45 s [haskell-language-server] is not in the system search path.
  24921. 1773.45 s [haskell-language-server] Installing executable haskell-language-server in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24922. 1773.45 s [haskell-language-server] Warning: The directory
  24923. 1773.45 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24924. 1773.45 s [haskell-language-server] is not in the system search path.
  24925. 1776.34 s [haskell-language-server] Phase: fixupPhase
  24926. 1776.35 s [haskell-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  24927. 1776.36 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-9NuvF5K83zjKEROrI0FsBg-hls-explicit-record-fields-plugin-ghc9.6.7.so
  24928. 1776.56 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-47HXa15Qd2U2UOYZkxf2fF-ghc9.6.7.so
  24929. 1776.73 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-DfDaMlvI8lE3DtJu9XSrI5-hls-ormolu-plugin-ghc9.6.7.so
  24930. 1776.85 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-8EsIybRW7RJGEX8RNOax2i-hls-hlint-plugin-ghc9.6.7.so
  24931. 1776.98 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-6m52MSfiYbsEI118ApNGYQ-hls-alternate-number-format-plugin-ghc9.6.7.so
  24932. 1777.11 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-29JOMnegjOO3WArLA0PeeE-hls-fourmolu-plugin-ghc9.6.7.so
  24933. 1777.25 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IlQ6ooLqcb4JVvN71Nikdv-hls-code-range-plugin-ghc9.6.7.so
  24934. 1777.37 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-1Dqyh9wtUd3Bj75VBTa1tF-hls-module-name-plugin-ghc9.6.7.so
  24935. 1777.50 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-2o2dcEbcAfpD8MpoQM4cQl-hls-explicit-imports-plugin-ghc9.6.7.so
  24936. 1777.64 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-KJugDuYFyuNCZrpJBAEd2L-hls-class-plugin-ghc9.6.7.so
  24937. 1777.76 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-KCZeCKCF0CR1LxLF1Qyqx-hls-call-hierarchy-plugin-ghc9.6.7.so
  24938. 1777.88 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HM2OaruVxbdllAqBgbVTR-hls-floskell-plugin-ghc9.6.7.so
  24939. 1778.01 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-4tsQqxESdVp65ApN1sKhnG-hls-eval-plugin-ghc9.6.7.so
  24940. 1778.14 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-EtM0vpUVofECj7cWpXAoB6-hls-semantic-tokens-plugin-ghc9.6.7.so
  24941. 1778.26 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-LmS0Oaq8JEiKIjz8eue5JQ-hls-overloaded-record-dot-plugin-ghc9.6.7.so
  24942. 1778.38 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-21byJEHANtiCpGzHaEj9fb-hls-explicit-fixity-plugin-ghc9.6.7.so
  24943. 1778.50 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IueXAjwy7vDCQ9yZlE0eWC-hls-retrie-plugin-ghc9.6.7.so
  24944. 1778.65 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-5LbobgaiD5N8xyn4MWHKvG-hls-cabal-fmt-plugin-ghc9.6.7.so
  24945. 1778.78 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-3lKcuB6bhJZIoci0rRUAjC-hls-stan-plugin-ghc9.6.7.so
  24946. 1778.92 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Jekx7yfTfBvJqE6MXsE6qC-hls-gadt-plugin-ghc9.6.7.so
  24947. 1779.06 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-7oCsBxMOBkzJR743HuvsXg-hls-refactor-plugin-ghc9.6.7.so
  24948. 1779.19 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Gaz5X4ZzCzi8VvaiD2gmYR-hls-pragmas-plugin-ghc9.6.7.so
  24949. 1779.31 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-91A0RtgcyvRB8lnXxJg4SR-hls-cabal-plugin-ghc9.6.7.so
  24950. 1779.44 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HnjBmqziRtsFA50VY8PqMO-hls-notes-plugin-ghc9.6.7.so
  24951. 1779.56 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-HHVpmZRXc4gCeddzhmNfSI-hls-stylish-haskell-plugin-ghc9.6.7.so
  24952. 1779.68 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-H9PT6LMhSpFLT3aRk45KC-hls-rename-plugin-ghc9.6.7.so
  24953. 1779.80 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-6i4cyuaZhiA26LXYUa3UA8-hls-qualify-imported-names-plugin-ghc9.6.7.so
  24954. 1779.93 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-9IYOuKHYLJSCX7b1AraPXk-hls-cabal-gild-plugin-ghc9.6.7.so
  24955. 1780.05 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Hd1xwC4Olq41Qon7oYPkbR-ghcide-bench-lib-ghc9.6.7.so
  24956. 1780.20 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-IjIvGk3YOOdDvnjSgwvDD5-hls-splice-plugin-ghc9.6.7.so
  24957. 1780.32 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-Kj6oNR22I886LfKlaRm9AZ-hls-change-type-signature-plugin-ghc9.6.7.so
  24958. 1780.44 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHShaskell-language-server-2.12.0.0-4t4FMaGlV9pFITLwsWZhSl-hls-signature-help-plugin-ghc9.6.7.so
  24959. 1780.56 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/ghcide-bench
  24960. 1780.72 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.6.7-unwrapped
  24961. 1780.89 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/plugin-tutorial
  24962. 1781.02 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
  24963. 1781.03 s [haskell-language-server] shrinking /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
  24964. 1781.21 s [haskell-language-server] checking for references to /build/ in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0...
  24965. 1781.34 s [haskell-language-server] patching script interpreter paths in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  24966. 1781.36 s [haskell-language-server] /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/haskell-language-server: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  24967. 1781.37 s [haskell-language-server] stripping (with command strip and flags -S -p) in /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/lib /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin
  24968. 1782.22 s [haskell-language-server] rewriting symlink /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0/bin/haskell-language-server-9.6.7 to be relative to /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  24969. 1784.34 s [haskell-language-server:post-build] Uploading to cachix cache "sellout": /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  24970. 1784.85 s [haskell-language-server:post-build] Pushing 1 paths (660 are already present) using zstd to cache sellout ⏳
  24971. 1784.85 s [haskell-language-server:post-build]
  24972. 1785.20 s [haskell-language-server:post-build] Pushing /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0 (123.63 MiB)
  24973. 1787.98 s [haskell-language-server:post-build]
  24974. 1787.98 s [haskell-language-server:post-build] All done.
  24975. 1788.00 s [haskell-language-server:post-build] Uploading to the NixCI cache: /nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0
  24976. 1788.04 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24977. 1788.10 s [haskell-language-server:post-build] copying 1 paths...
  24978. 1788.10 s [haskell-language-server:post-build] copying path '/nix/store/p7zzsjhig1c3rs78325znzdvxip6rzfh-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...
  24979. 1810.67 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24980. 1810.91 s [haskell-language-server:post-build] copying 1 paths...
  24981. 1810.91 s [haskell-language-server:post-build] copying path '/nix/store/3ar7h9qlgjsynrjnc8x5py4d6f9jkh09-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  24982. 1811.08 s Progress: 24 of 26 built, 341 of 341 downloaded from cache
  24983. 1811.18 s Building /nix/store/qcsvgix30xcj8plxn109fy9rs352myv7-ghc-shell-for-packages-0.drv
  24984. 1812.20 s [ghc-shell-for-packages:post-build] Uploading to cachix cache "sellout": /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0
  24985. 1812.68 s [ghc-shell-for-packages:post-build] Pushing 1 paths (878 are already present) using zstd to cache sellout ⏳
  24986. 1812.68 s [ghc-shell-for-packages:post-build]
  24987. 1813.29 s [ghc-shell-for-packages:post-build] Pushing /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0 (336.00 B)
  24988. 1814.13 s [ghc-shell-for-packages:post-build]
  24989. 1814.13 s [ghc-shell-for-packages:post-build] All done.
  24990. 1814.15 s [ghc-shell-for-packages:post-build] Uploading to the NixCI cache: /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0
  24991. 1814.19 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1814.24 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24993. 1814.24 s [ghc-shell-for-packages:post-build] copying path '/nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  24994. 1814.44 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1814.78 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24996. 1814.78 s [ghc-shell-for-packages:post-build] copying path '/nix/store/qcsvgix30xcj8plxn109fy9rs352myv7-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  24997. 1815.09 s Progress: 25 of 26 built, 341 of 341 downloaded from cache
  24998. 1815.10 s Progress: 26 of 26 built, 341 of 341 downloaded from cache
  24999. 1815.10 s /nix/store/0s6512b93ihybzr11v7g4idbwv34myk9-ghc-shell-for-packages-0
  25000. 1815.18 s Build succeeded.
Tail Raw Logs