1. 1252.03 s [hls-test-utils] DocumentOnTypeFormattingRegistrationOptions
  2. 1252.03 s [hls-test-utils] DocumentRangeFormattingClientCapabilities
  3. 1252.03 s [hls-test-utils] DocumentRangeFormattingOptions
  4. 1252.03 s [hls-test-utils] DocumentRangeFormattingParams
  5. 1252.03 s [hls-test-utils] DocumentRangeFormattingRegistrationOptions
  6. 1252.03 s [hls-test-utils] DocumentSelector
  7. 1252.03 s [hls-test-utils] DocumentSymbol
  8. 1252.03 s [hls-test-utils] DocumentSymbolClientCapabilities
  9. 1252.03 s [hls-test-utils] DocumentSymbolOptions
  10. 1252.03 s [hls-test-utils] DocumentSymbolParams
  11. 1252.03 s [hls-test-utils] DocumentSymbolRegistrationOptions
  12. 1252.03 s [hls-test-utils] EditRangeWithInsertReplace
  13. 1252.03 s [hls-test-utils] ErrorCodes
  14. 1252.03 s [hls-test-utils] ExecuteCommandClientCapabilities
  15. 1252.03 s [hls-test-utils] ExecuteCommandOptions
  16. 1252.03 s [hls-test-utils] ExecuteCommandParams
  17. 1252.03 s [hls-test-utils] ExecuteCommandRegistrationOptions
  18. 1252.03 s [hls-test-utils] ExecutionSummary
  19. 1252.03 s [hls-test-utils] FailureHandlingKind
  20. 1252.03 s [hls-test-utils] FileChangeType
  21. 1252.03 s [hls-test-utils] FileCreate
  22. 1252.03 s [hls-test-utils] FileDelete
  23. 1252.03 s [hls-test-utils] FileEvent
  24. 1252.03 s [hls-test-utils] FileOperationClientCapabilities
  25. 1252.03 s [hls-test-utils] FileOperationFilter
  26. 1252.03 s [hls-test-utils] FileOperationOptions
  27. 1252.03 s [hls-test-utils] FileOperationPattern
  28. 1252.03 s [hls-test-utils] FileOperationPatternKind
  29. 1252.03 s [hls-test-utils] FileOperationPatternOptions
  30. 1252.03 s [hls-test-utils] FileOperationRegistrationOptions
  31. 1252.03 s [hls-test-utils] FileRename
  32. 1252.03 s [hls-test-utils] FileSystemWatcher
  33. 1252.03 s [hls-test-utils] FoldingRange
  34. 1252.03 s [hls-test-utils] FoldingRangeClientCapabilities
  35. 1252.03 s [hls-test-utils] FoldingRangeKind
  36. 1252.03 s [hls-test-utils] FoldingRangeOptions
  37. 1252.03 s [hls-test-utils] FoldingRangeParams
  38. 1252.03 s [hls-test-utils] FoldingRangeRegistrationOptions
  39. 1252.03 s [hls-test-utils] FormattingOptions
  40. 1252.03 s [hls-test-utils] FullDocumentDiagnosticReport
  41. 1252.03 s [hls-test-utils] GeneralClientCapabilities
  42. 1252.03 s [hls-test-utils] GlobPattern
  43. 1252.03 s [hls-test-utils] Hover
  44. 1252.03 s [hls-test-utils] HoverClientCapabilities
  45. 1252.03 s [hls-test-utils] HoverOptions
  46. 1252.03 s [hls-test-utils] HoverParams
  47. 1252.03 s [hls-test-utils] HoverRegistrationOptions
  48. 1252.03 s [hls-test-utils] ImplementationClientCapabilities
  49. 1252.03 s [hls-test-utils] ImplementationOptions
  50. 1252.03 s [hls-test-utils] ImplementationParams
  51. 1252.03 s [hls-test-utils] ImplementationRegistrationOptions
  52. 1252.03 s [hls-test-utils] InitializeError
  53. 1252.03 s [hls-test-utils] InitializeParams
  54. 1252.03 s [hls-test-utils] InitializeResult
  55. 1252.03 s [hls-test-utils] InitializedParams
  56. 1252.03 s [hls-test-utils] InlayHint
  57. 1252.03 s [hls-test-utils] InlayHintClientCapabilities
  58. 1252.03 s [hls-test-utils] InlayHintKind
  59. 1252.03 s [hls-test-utils] InlayHintLabelPart
  60. 1252.03 s [hls-test-utils] InlayHintOptions
  61. 1252.03 s [hls-test-utils] InlayHintParams
  62. 1252.03 s [hls-test-utils] InlayHintRegistrationOptions
  63. 1252.03 s [hls-test-utils] InlayHintWorkspaceClientCapabilities
  64. 1252.03 s [hls-test-utils] InlineValue
  65. 1252.03 s [hls-test-utils] InlineValueClientCapabilities
  66. 1252.03 s [hls-test-utils] InlineValueContext
  67. 1252.03 s [hls-test-utils] InlineValueEvaluatableExpression
  68. 1252.03 s [hls-test-utils] InlineValueOptions
  69. 1252.03 s [hls-test-utils] InlineValueParams
  70. 1252.03 s [hls-test-utils] InlineValueRegistrationOptions
  71. 1252.03 s [hls-test-utils] InlineValueText
  72. 1252.03 s [hls-test-utils] InlineValueVariableLookup
  73. 1252.03 s [hls-test-utils] InlineValueWorkspaceClientCapabilities
  74. 1252.03 s [hls-test-utils] InsertReplaceEdit
  75. 1252.03 s [hls-test-utils] InsertTextFormat
  76. 1252.03 s [hls-test-utils] InsertTextMode
  77. 1252.03 s [hls-test-utils] LSPErrorCodes
  78. 1252.03 s [hls-test-utils] LanguageKind
  79. 1252.03 s [hls-test-utils] LinkedEditingRangeClientCapabilities
  80. 1252.03 s [hls-test-utils] LinkedEditingRangeOptions
  81. 1252.03 s [hls-test-utils] LinkedEditingRangeParams
  82. 1252.03 s [hls-test-utils] LinkedEditingRangeRegistrationOptions
  83. 1252.03 s [hls-test-utils] LinkedEditingRanges
  84. 1252.03 s [hls-test-utils] Location
  85. 1252.03 s [hls-test-utils] LocationLink
  86. 1252.03 s [hls-test-utils] LocationUriOnly
  87. 1252.03 s [hls-test-utils] LogMessageParams
  88. 1252.03 s [hls-test-utils] LogTraceParams
  89. 1252.03 s [hls-test-utils] MarkdownClientCapabilities
  90. 1252.03 s [hls-test-utils] MarkedString
  91. 1252.03 s [hls-test-utils] MarkedStringWithLanguage
  92. 1252.03 s [hls-test-utils] MarkupContent
  93. 1252.03 s [hls-test-utils] MarkupKind
  94. 1252.03 s [hls-test-utils] MessageActionItem
  95. 1252.03 s [hls-test-utils] MessageType
  96. 1252.03 s [hls-test-utils] Moniker
  97. 1252.03 s [hls-test-utils] MonikerClientCapabilities
  98. 1252.03 s [hls-test-utils] MonikerKind
  99. 1252.03 s [hls-test-utils] MonikerOptions
  100. 1252.03 s [hls-test-utils] MonikerParams
  101. 1252.03 s [hls-test-utils] MonikerRegistrationOptions
  102. 1252.03 s [hls-test-utils] NotebookCell
  103. 1252.03 s [hls-test-utils] NotebookCellArrayChange
  104. 1252.03 s [hls-test-utils] NotebookCellKind
  105. 1252.03 s [hls-test-utils] NotebookCellLanguage
  106. 1252.03 s [hls-test-utils] NotebookCellTextDocumentFilter
  107. 1252.03 s [hls-test-utils] NotebookDocument
  108. 1252.03 s [hls-test-utils] NotebookDocumentCellChangeStructure
  109. 1252.03 s [hls-test-utils] NotebookDocumentCellChanges
  110. 1252.03 s [hls-test-utils] NotebookDocumentCellContentChanges
  111. 1252.04 s [hls-test-utils] NotebookDocumentChangeEvent
  112. 1252.04 s [hls-test-utils] NotebookDocumentClientCapabilities
  113. 1252.04 s [hls-test-utils] NotebookDocumentFilter
  114. 1252.04 s [hls-test-utils] NotebookDocumentFilterNotebookType
  115. 1252.04 s [hls-test-utils] NotebookDocumentFilterPattern
  116. 1252.04 s [hls-test-utils] NotebookDocumentFilterScheme
  117. 1252.04 s [hls-test-utils] NotebookDocumentFilterWithCells
  118. 1252.04 s [hls-test-utils] NotebookDocumentFilterWithNotebook
  119. 1252.04 s [hls-test-utils] NotebookDocumentIdentifier
  120. 1252.04 s [hls-test-utils] NotebookDocumentSyncClientCapabilities
  121. 1252.04 s [hls-test-utils] NotebookDocumentSyncOptions
  122. 1252.04 s [hls-test-utils] NotebookDocumentSyncRegistrationOptions
  123. 1252.04 s [hls-test-utils] OptionalVersionedTextDocumentIdentifier
  124. 1252.04 s [hls-test-utils] ParameterInformation
  125. 1252.04 s [hls-test-utils] PartialResultParams
  126. 1252.04 s [hls-test-utils] Pattern
  127. 1252.04 s [hls-test-utils] Position
  128. 1252.04 s [hls-test-utils] PositionEncodingKind
  129. 1252.04 s [hls-test-utils] PrepareRenameDefaultBehavior
  130. 1252.04 s [hls-test-utils] PrepareRenameParams
  131. 1252.04 s [hls-test-utils] PrepareRenamePlaceholder
  132. 1252.04 s [hls-test-utils] PrepareRenameResult
  133. 1252.04 s [hls-test-utils] PrepareSupportDefaultBehavior
  134. 1252.04 s [hls-test-utils] PreviousResultId
  135. 1252.04 s [hls-test-utils] ProgressParams
  136. 1252.04 s [hls-test-utils] ProgressToken
  137. 1252.04 s [hls-test-utils] PublishDiagnosticsClientCapabilities
  138. 1252.04 s [hls-test-utils] PublishDiagnosticsParams
  139. 1252.04 s [hls-test-utils] Range
  140. 1252.04 s [hls-test-utils] ReferenceClientCapabilities
  141. 1252.04 s [hls-test-utils] ReferenceContext
  142. 1252.04 s [hls-test-utils] ReferenceOptions
  143. 1252.04 s [hls-test-utils] ReferenceParams
  144. 1252.04 s [hls-test-utils] ReferenceRegistrationOptions
  145. 1252.04 s [hls-test-utils] Registration
  146. 1252.04 s [hls-test-utils] RegistrationParams
  147. 1252.04 s [hls-test-utils] RegularExpressionEngineKind
  148. 1252.04 s [hls-test-utils] RegularExpressionsClientCapabilities
  149. 1252.04 s [hls-test-utils] RelatedFullDocumentDiagnosticReport
  150. 1252.04 s [hls-test-utils] RelatedUnchangedDocumentDiagnosticReport
  151. 1252.04 s [hls-test-utils] RelativePattern
  152. 1252.04 s [hls-test-utils] RenameClientCapabilities
  153. 1252.04 s [hls-test-utils] RenameFile
  154. 1252.04 s [hls-test-utils] RenameFileOptions
  155. 1252.04 s [hls-test-utils] RenameFilesParams
  156. 1252.04 s [hls-test-utils] RenameOptions
  157. 1252.04 s [hls-test-utils] RenameParams
  158. 1252.04 s [hls-test-utils] RenameRegistrationOptions
  159. 1252.04 s [hls-test-utils] ResourceOperation
  160. 1252.04 s [hls-test-utils] ResourceOperationKind
  161. 1252.04 s [hls-test-utils] SaveOptions
  162. 1252.04 s [hls-test-utils] SelectionRange
  163. 1252.04 s [hls-test-utils] SelectionRangeClientCapabilities
  164. 1252.04 s [hls-test-utils] SelectionRangeOptions
  165. 1252.04 s [hls-test-utils] SelectionRangeParams
  166. 1252.04 s [hls-test-utils] SelectionRangeRegistrationOptions
  167. 1252.04 s [hls-test-utils] SemanticTokenModifiers
  168. 1252.04 s [hls-test-utils] SemanticTokenTypes
  169. 1252.04 s [hls-test-utils] SemanticTokens
  170. 1252.04 s [hls-test-utils] SemanticTokensClientCapabilities
  171. 1252.04 s [hls-test-utils] SemanticTokensDelta
  172. 1252.04 s [hls-test-utils] SemanticTokensDeltaParams
  173. 1252.04 s [hls-test-utils] SemanticTokensDeltaPartialResult
  174. 1252.04 s [hls-test-utils] SemanticTokensEdit
  175. 1252.04 s [hls-test-utils] SemanticTokensFullDelta
  176. 1252.04 s [hls-test-utils] SemanticTokensLegend
  177. 1252.04 s [hls-test-utils] SemanticTokensOptions
  178. 1252.04 s [hls-test-utils] SemanticTokensParams
  179. 1252.04 s [hls-test-utils] SemanticTokensPartialResult
  180. 1252.04 s [hls-test-utils] SemanticTokensRangeParams
  181. 1252.04 s [hls-test-utils] SemanticTokensRegistrationOptions
  182. 1252.04 s [hls-test-utils] SemanticTokensWorkspaceClientCapabilities
  183. 1252.04 s [hls-test-utils] ServerCapabilities
  184. 1252.04 s [hls-test-utils] ServerCompletionItemOptions
  185. 1252.04 s [hls-test-utils] ServerInfo
  186. 1252.04 s [hls-test-utils] SetTraceParams
  187. 1252.04 s [hls-test-utils] ShowDocumentClientCapabilities
  188. 1252.04 s [hls-test-utils] ShowDocumentParams
  189. 1252.04 s [hls-test-utils] ShowDocumentResult
  190. 1252.04 s [hls-test-utils] ShowMessageParams
  191. 1252.04 s [hls-test-utils] ShowMessageRequestClientCapabilities
  192. 1252.04 s [hls-test-utils] ShowMessageRequestParams
  193. 1252.04 s [hls-test-utils] SignatureHelp
  194. 1252.04 s [hls-test-utils] SignatureHelpClientCapabilities
  195. 1252.04 s [hls-test-utils] SignatureHelpContext
  196. 1252.04 s [hls-test-utils] SignatureHelpOptions
  197. 1252.04 s [hls-test-utils] SignatureHelpParams
  198. 1252.04 s [hls-test-utils] SignatureHelpRegistrationOptions
  199. 1252.04 s [hls-test-utils] SignatureHelpTriggerKind
  200. 1252.04 s [hls-test-utils] SignatureInformation
  201. 1252.04 s [hls-test-utils] StaleRequestSupportOptions
  202. 1252.04 s [hls-test-utils] StaticRegistrationOptions
  203. 1252.04 s [hls-test-utils] SymbolInformation
  204. 1252.04 s [hls-test-utils] SymbolKind
  205. 1252.04 s [hls-test-utils] SymbolTag
  206. 1252.04 s [hls-test-utils] TextDocumentChangeRegistrationOptions
  207. 1252.04 s [hls-test-utils] TextDocumentClientCapabilities
  208. 1252.04 s [hls-test-utils] TextDocumentContentChangeEvent
  209. 1252.04 s [hls-test-utils] TextDocumentContentChangePartial
  210. 1252.04 s [hls-test-utils] TextDocumentContentChangeWholeDocument
  211. 1252.04 s [hls-test-utils] TextDocumentEdit
  212. 1252.04 s [hls-test-utils] TextDocumentFilter
  213. 1252.04 s [hls-test-utils] TextDocumentFilterLanguage
  214. 1252.04 s [hls-test-utils] TextDocumentFilterPattern
  215. 1252.04 s [hls-test-utils] TextDocumentFilterScheme
  216. 1252.04 s [hls-test-utils] TextDocumentIdentifier
  217. 1252.04 s [hls-test-utils] TextDocumentItem
  218. 1252.04 s [hls-test-utils] TextDocumentPositionParams
  219. 1252.04 s [hls-test-utils] TextDocumentRegistrationOptions
  220. 1252.04 s [hls-test-utils] TextDocumentSaveReason
  221. 1252.04 s [hls-test-utils] TextDocumentSaveRegistrationOptions
  222. 1252.04 s [hls-test-utils] TextDocumentSyncClientCapabilities
  223. 1252.04 s [hls-test-utils] TextDocumentSyncKind
  224. 1252.04 s [hls-test-utils] TextDocumentSyncOptions
  225. 1252.04 s [hls-test-utils] TextEdit
  226. 1252.04 s [hls-test-utils] TokenFormat
  227. 1252.04 s [hls-test-utils] TraceValue
  228. 1252.04 s [hls-test-utils] TypeDefinitionClientCapabilities
  229. 1252.04 s [hls-test-utils] TypeDefinitionOptions
  230. 1252.04 s [hls-test-utils] TypeDefinitionParams
  231. 1252.04 s [hls-test-utils] TypeDefinitionRegistrationOptions
  232. 1252.04 s [hls-test-utils] TypeHierarchyClientCapabilities
  233. 1252.04 s [hls-test-utils] TypeHierarchyItem
  234. 1252.04 s [hls-test-utils] TypeHierarchyOptions
  235. 1252.04 s [hls-test-utils] TypeHierarchyPrepareParams
  236. 1252.04 s [hls-test-utils] TypeHierarchyRegistrationOptions
  237. 1252.04 s [hls-test-utils] TypeHierarchySubtypesParams
  238. 1252.04 s [hls-test-utils] TypeHierarchySupertypesParams
  239. 1252.04 s [hls-test-utils] UInitializeParams
  240. 1252.04 s [hls-test-utils] UnchangedDocumentDiagnosticReport
  241. 1252.04 s [hls-test-utils] UniquenessLevel
  242. 1252.04 s [hls-test-utils] Unregistration
  243. 1252.04 s [hls-test-utils] UnregistrationParams
  244. 1252.04 s [hls-test-utils] VersionedNotebookDocumentIdentifier
  245. 1252.04 s [hls-test-utils] VersionedTextDocumentIdentifier
  246. 1252.05 s [hls-test-utils] WatchKind
  247. 1252.05 s [hls-test-utils] WillSaveTextDocumentParams
  248. 1252.05 s [hls-test-utils] WindowClientCapabilities
  249. 1252.05 s [hls-test-utils] WorkDoneProgressBegin
  250. 1252.05 s [hls-test-utils] WorkDoneProgressCancelParams
  251. 1252.05 s [hls-test-utils] WorkDoneProgressCreateParams
  252. 1252.05 s [hls-test-utils] WorkDoneProgressEnd
  253. 1252.05 s [hls-test-utils] WorkDoneProgressOptions
  254. 1252.05 s [hls-test-utils] WorkDoneProgressParams
  255. 1252.05 s [hls-test-utils] WorkDoneProgressReport
  256. 1252.05 s [hls-test-utils] WorkspaceClientCapabilities
  257. 1252.05 s [hls-test-utils] WorkspaceDiagnosticParams
  258. 1252.05 s [hls-test-utils] WorkspaceDiagnosticReport
  259. 1252.05 s [hls-test-utils] WorkspaceDiagnosticReportPartialResult
  260. 1252.05 s [hls-test-utils] WorkspaceDocumentDiagnosticReport
  261. 1252.05 s [hls-test-utils] WorkspaceEdit
  262. 1252.05 s [hls-test-utils] WorkspaceEditClientCapabilities
  263. 1252.05 s [hls-test-utils] WorkspaceFolder
  264. 1252.05 s [hls-test-utils] WorkspaceFoldersChangeEvent
  265. 1252.05 s [hls-test-utils] WorkspaceFoldersInitializeParams
  266. 1252.05 s [hls-test-utils] WorkspaceFoldersServerCapabilities
  267. 1252.05 s [hls-test-utils] WorkspaceFullDocumentDiagnosticReport
  268. 1252.05 s [hls-test-utils] WorkspaceOptions
  269. 1252.05 s [hls-test-utils] WorkspaceSymbol
  270. 1252.05 s [hls-test-utils] WorkspaceSymbolClientCapabilities
  271. 1252.05 s [hls-test-utils] WorkspaceSymbolOptions
  272. 1252.05 s [hls-test-utils] WorkspaceSymbolParams
  273. 1252.05 s [hls-test-utils] WorkspaceSymbolRegistrationOptions
  274. 1252.05 s [hls-test-utils] WorkspaceUnchangedDocumentDiagnosticReport
  275. 1252.05 s [hls-test-utils] UInt
  276. 1252.05 s [hls-test-utils] |?
  277. 1252.05 s [hls-test-utils] DocumentChange
  278. 1252.05 s [hls-test-utils] AsLspEnum
  279. 1252.05 s [hls-test-utils] EnumBaseType
  280. 1252.05 s [hls-test-utils] LspEnum
  281. 1252.05 s [hls-test-utils] LspOpenEnum
  282. 1252.05 s [hls-test-utils] Edit
  283. 1252.05 s [hls-test-utils] SemanticTokenAbsolute
  284. 1252.05 s [hls-test-utils] SemanticTokenRelative
  285. 1252.05 s [hls-test-utils] AString
  286. 1252.05 s [hls-test-utils] AnInteger
  287. 1252.05 s [hls-test-utils] NormalizedFilePath
  288. 1252.05 s [hls-test-utils] NormalizedUri
  289. 1252.05 s [hls-test-utils] Uri
  290. 1252.05 s [hls-test-utils] EncodingException
  291. 1252.05 s [hls-test-utils] messageDirection
  292. 1252.05 s [hls-test-utils] messageKind
  293. 1252.05 s [hls-test-utils] methodStringToSomeMethod
  294. 1252.05 s [hls-test-utils] someMethodToMethodString
  295. 1252.05 s [hls-test-utils] isOptionalMethod
  296. 1252.05 s [hls-test-utils] someClientMethod
  297. 1252.05 s [hls-test-utils] someServerMethod
  298. 1252.05 s [hls-test-utils] clientMethodJSON
  299. 1252.05 s [hls-test-utils] clientResponseJSON
  300. 1252.05 s [hls-test-utils] fromClientNot
  301. 1252.05 s [hls-test-utils] fromClientReq
  302. 1252.05 s [hls-test-utils] fromServerNot
  303. 1252.05 s [hls-test-utils] fromServerReq
  304. 1252.05 s [hls-test-utils] mEqClient
  305. 1252.05 s [hls-test-utils] mEqServer
  306. 1252.05 s [hls-test-utils] parseClientMessage
  307. 1252.05 s [hls-test-utils] parseServerMessage
  308. 1252.05 s [hls-test-utils] runEq
  309. 1252.05 s [hls-test-utils] serverMethodJSON
  310. 1252.05 s [hls-test-utils] serverResponseJSON
  311. 1252.05 s [hls-test-utils] splitClientMethod
  312. 1252.05 s [hls-test-utils] splitServerMethod
  313. 1252.05 s [hls-test-utils] regHelper
  314. 1252.05 s [hls-test-utils] toSomeRegistration
  315. 1252.05 s [hls-test-utils] toSomeUnregistration
  316. 1252.05 s [hls-test-utils] toUntypedRegistration
  317. 1252.05 s [hls-test-utils] toUntypedUnregistration
  318. 1252.05 s [hls-test-utils] addNullField
  319. 1252.05 s [hls-test-utils] toUntypedResponseError
  320. 1252.05 s [hls-test-utils] ErrorData
  321. 1252.05 s [hls-test-utils] MessageParams
  322. 1252.05 s [hls-test-utils] MessageResult
  323. 1252.05 s [hls-test-utils] Method
  324. 1252.05 s [hls-test-utils] RegistrationOptions
  325. 1252.05 s [hls-test-utils] SMethod
  326. 1252.05 s [hls-test-utils] SomeMethod
  327. 1252.05 s [hls-test-utils] LspId
  328. 1252.05 s [hls-test-utils] SomeLspId
  329. 1252.05 s [hls-test-utils] MessageDirection
  330. 1252.05 s [hls-test-utils] MessageKind
  331. 1252.05 s [hls-test-utils] SMessageDirection
  332. 1252.05 s [hls-test-utils] SMessageKind
  333. 1252.05 s [hls-test-utils] SClientMethod
  334. 1252.05 s [hls-test-utils] SServerMethod
  335. 1252.05 s [hls-test-utils] SomeClientMethod
  336. 1252.05 s [hls-test-utils] SomeServerMethod
  337. 1252.05 s [hls-test-utils] ClientNotOrReq
  338. 1252.05 s [hls-test-utils] CustomEq
  339. 1252.05 s [hls-test-utils] FromClientMessage
  340. 1252.05 s [hls-test-utils] FromClientMessage'
  341. 1252.05 s [hls-test-utils] FromServerMessage
  342. 1252.05 s [hls-test-utils] FromServerMessage'
  343. 1252.05 s [hls-test-utils] HasJSON
  344. 1252.05 s [hls-test-utils] LookupFunc
  345. 1252.05 s [hls-test-utils] ServerNotOrReq
  346. 1252.05 s [hls-test-utils] SomeRegistration
  347. 1252.05 s [hls-test-utils] SomeUnregistration
  348. 1252.05 s [hls-test-utils] TRegistration
  349. 1252.05 s [hls-test-utils] TUnregistration
  350. 1252.05 s [hls-test-utils] NotificationMessage
  351. 1252.05 s [hls-test-utils] RequestMessage
  352. 1252.05 s [hls-test-utils] ResponseError
  353. 1252.05 s [hls-test-utils] ResponseMessage
  354. 1252.05 s [hls-test-utils] TClientMessage
  355. 1252.05 s [hls-test-utils] TCustomMessage
  356. 1252.05 s [hls-test-utils] TMessage
  357. 1252.05 s [hls-test-utils] TNotificationMessage
  358. 1252.05 s [hls-test-utils] TRequestMessage
  359. 1252.05 s [hls-test-utils] TResponseError
  360. 1252.05 s [hls-test-utils] TResponseMessage
  361. 1252.05 s [hls-test-utils] TServerMessage
  362. 1252.05 s [hls-test-utils] goldenGitDiff (src/Test/Hls.hs:190)
  363. 1252.05 s [hls-test-utils] goldenWithHaskellDoc (src/Test/Hls.hs:203)
  364. 1252.05 s [hls-test-utils] goldenWithHaskellDocInTmpDir (src/Test/Hls.hs:216)
  365. 1252.05 s [hls-test-utils] goldenWithHaskellAndCaps (src/Test/Hls.hs:230)
  366. 1252.05 s [hls-test-utils] goldenWithHaskellAndCapsInTmpDir (src/Test/Hls.hs:279)
  367. 1252.05 s [hls-test-utils] goldenWithCabalDoc (src/Test/Hls.hs:306)
  368. 1252.05 s [hls-test-utils] goldenWithHaskellDocFormatter (src/Test/Hls.hs:594)
  369. 1252.05 s [hls-test-utils] goldenWithHaskellDocFormatterInTmpDir (src/Test/Hls.hs:642)
  370. 1252.05 s [hls-test-utils] goldenWithCabalDocFormatter (src/Test/Hls.hs:618)
  371. 1252.05 s [hls-test-utils] goldenWithCabalDocFormatterInTmpDir (src/Test/Hls.hs:666)
  372. 1252.05 s [hls-test-utils] goldenWithTestConfig (src/Test/Hls.hs:257)
  373. 1252.05 s [hls-test-utils] runSessionWithServer (src/Test/Hls.hs:538)
  374. 1252.05 s [hls-test-utils] runSessionWithServerInTmpDir (src/Test/Hls.hs:505)
  375. 1252.05 s [hls-test-utils] PluginDescriptor
  376. 1252.05 s [hls-test-utils] BrokenBehavior (src/Test/Hls.hs:173)
  377. 1252.05 s [hls-test-utils] ExpectBroken (src/Test/Hls.hs:175)
  378. 1252.05 s [hls-test-utils] unCurrent (src/Test/Hls.hs:180)
  379. 1252.05 s [hls-test-utils] waitForTypecheck (src/Test/Hls.hs:870)
  380. 1252.05 s [hls-test-utils] waitForAction (src/Test/Hls.hs:866)
  381. 1252.05 s [hls-test-utils] hlsConfigToClientConfig (src/Test/Hls.hs:876)
  382. 1252.05 s [hls-test-utils] getLastBuildKeys (src/Test/Hls.hs:873)
  383. 1252.05 s [hls-test-utils] waitForKickDone (src/Test/Hls.hs:901)
  384. 1252.05 s [hls-test-utils] waitForKickStart (src/Test/Hls.hs:904)
  385. 1252.05 s [hls-test-utils] WithPriority
  386. 1252.05 s [hls-test-utils] Priority
  387. 1252.06 s [hls-test-utils] captureKickDiagnostics (src/Test/Hls.hs:890)
  388. 1252.06 s [hls-test-utils] kick (src/Test/Hls.hs:914)
  389. 1252.06 s [hls-test-utils] TestConfig (src/Test/Hls.hs:692)
  390. 1252.20 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 )
  391. 1252.20 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  392. 1252.20 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  393. 1252.20 s [vector] • In the newtype declaration for ‘MVector’
  394. 1252.20 s [vector] |
  395. 1252.20 s [vector] 97 | deriving ( Typeable )
  396. 1252.20 s [vector] | ^^^^^^^^
  397. 1252.20 s [vector]
  398. 1252.20 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 )
  399. 1252.20 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  400. 1252.20 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  401. 1252.20 s [vector] • In the newtype declaration for ‘Vector’
  402. 1252.20 s [vector] |
  403. 1252.20 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  404. 1252.20 s [vector] | ^^^^^^^^
  405. 1252.20 s [vector]
  406. 1256.15 s [hls-test-utils] Warning: Test.Hls: could not find link destinations for:
  407. 1256.25 s [hls-test-utils] - Data.Vector.Unboxed.Base.Unbox
  408. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.HasError
  409. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.error
  410. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.HasJsonrpc
  411. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.jsonrpc
  412. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.HasParams
  413. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.params
  414. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.HasResult
  415. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.result
  416. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.HasXdata
  417. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Message.Lens.xdata
  418. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActions
  419. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.actions
  420. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveParameter
  421. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeParameter
  422. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveParameterSupport
  423. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeParameterSupport
  424. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveSignature
  425. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeSignature
  426. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasActiveSignatureHelp
  427. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.activeSignatureHelp
  428. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAdded
  429. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.added
  430. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAdditionalPropertiesSupport
  431. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.additionalPropertiesSupport
  432. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAdditionalTextEdits
  433. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.additionalTextEdits
  434. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAllCommitCharacters
  435. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.allCommitCharacters
  436. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAllowedTags
  437. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.allowedTags
  438. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAlpha
  439. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.alpha
  440. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAnnotationId
  441. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.annotationId
  442. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasApplied
  443. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.applied
  444. 1256.25 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasApplyEdit
  445. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.applyEdit
  446. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasArguments
  447. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.arguments
  448. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasArray
  449. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.array
  450. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasAugmentsSyntaxTokens
  451. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.augmentsSyntaxTokens
  452. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasBaseUri
  453. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.baseUri
  454. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasBlue
  455. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.blue
  456. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCallHierarchy
  457. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.callHierarchy
  458. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCallHierarchyProvider
  459. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.callHierarchyProvider
  460. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCancel
  461. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cancel
  462. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCancellable
  463. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cancellable
  464. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCapabilities
  465. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.capabilities
  466. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCaseSensitiveLookup
  467. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.caseSensitiveLookup
  468. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCellTextDocuments
  469. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cellTextDocuments
  470. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCells
  471. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.cells
  472. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCh
  473. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ch
  474. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChange
  475. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.change
  476. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChangeAnnotationSupport
  477. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changeAnnotationSupport
  478. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChangeAnnotations
  479. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changeAnnotations
  480. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChangeNotifications
  481. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changeNotifications
  482. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChanges
  483. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.changes
  484. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCharacter
  485. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.character
  486. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasChildren
  487. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.children
  488. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasClientInfo
  489. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.clientInfo
  490. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCode
  491. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.code
  492. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeAction
  493. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeAction
  494. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionKind
  495. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionKind
  496. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionKinds
  497. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionKinds
  498. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionLiteralSupport
  499. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionLiteralSupport
  500. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeActionProvider
  501. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeActionProvider
  502. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeDescription
  503. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeDescription
  504. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeDescriptionSupport
  505. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeDescriptionSupport
  506. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeLens
  507. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeLens
  508. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCodeLensProvider
  509. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.codeLensProvider
  510. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCollapsedText
  511. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.collapsedText
  512. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasColor
  513. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.color
  514. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasColorProvider
  515. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.colorProvider
  516. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommand
  517. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.command
  518. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommands
  519. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.commands
  520. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommitCharacters
  521. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.commitCharacters
  522. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCommitCharactersSupport
  523. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.commitCharactersSupport
  524. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletion
  525. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completion
  526. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionItem
  527. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionItem
  528. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionItemKind
  529. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionItemKind
  530. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionList
  531. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionList
  532. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasCompletionProvider
  533. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.completionProvider
  534. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasConfiguration
  535. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.configuration
  536. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContainerName
  537. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.containerName
  538. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContentChanges
  539. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contentChanges
  540. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContentFormat
  541. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contentFormat
  542. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContents
  543. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contents
  544. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContext
  545. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.context
  546. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasContextSupport
  547. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.contextSupport
  548. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDataSupport
  549. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.dataSupport
  550. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasData_
  551. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.data_
  552. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeclaration
  553. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.declaration
  554. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeclarationProvider
  555. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.declarationProvider
  556. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDefaultBehavior
  557. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.defaultBehavior
  558. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDefinition
  559. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.definition
  560. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDefinitionProvider
  561. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.definitionProvider
  562. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeleteCount
  563. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deleteCount
  564. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDelta
  565. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.delta
  566. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeltaLine
  567. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deltaLine
  568. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeltaStartChar
  569. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deltaStartChar
  570. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeprecated
  571. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deprecated
  572. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDeprecatedSupport
  573. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.deprecatedSupport
  574. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDescription
  575. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.description
  576. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDetail
  577. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.detail
  578. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDiagnostic
  579. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.diagnostic
  580. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDiagnosticProvider
  581. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.diagnosticProvider
  582. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDiagnostics
  583. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.diagnostics
  584. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidChangeConfiguration
  585. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didChangeConfiguration
  586. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidChangeWatchedFiles
  587. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didChangeWatchedFiles
  588. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidClose
  589. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didClose
  590. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidCreate
  591. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didCreate
  592. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidDelete
  593. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didDelete
  594. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidOpen
  595. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didOpen
  596. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidRename
  597. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didRename
  598. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDidSave
  599. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.didSave
  600. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDisabled
  601. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.disabled
  602. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDisabledSupport
  603. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.disabledSupport
  604. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocument
  605. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.document
  606. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentChanges
  607. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentChanges
  608. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentFormattingProvider
  609. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentFormattingProvider
  610. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentHighlight
  611. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentHighlight
  612. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentHighlightProvider
  613. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentHighlightProvider
  614. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentLink
  615. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentLink
  616. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentLinkProvider
  617. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentLinkProvider
  618. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentOnTypeFormattingProvider
  619. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentOnTypeFormattingProvider
  620. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentRangeFormattingProvider
  621. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentRangeFormattingProvider
  622. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentSelector
  623. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentSelector
  624. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentSymbol
  625. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentSymbol
  626. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentSymbolProvider
  627. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentSymbolProvider
  628. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentation
  629. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentation
  630. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDocumentationFormat
  631. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.documentationFormat
  632. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasDynamicRegistration
  633. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.dynamicRegistration
  634. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEdit
  635. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.edit
  636. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEditRange
  637. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.editRange
  638. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEdits
  639. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.edits
  640. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEnd
  641. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.end
  642. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEndCharacter
  643. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.endCharacter
  644. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEndLine
  645. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.endLine
  646. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEngine
  647. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.engine
  648. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasEvent
  649. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.event
  650. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecuteCommand
  651. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executeCommand
  652. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecuteCommandProvider
  653. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executeCommandProvider
  654. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecutionOrder
  655. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executionOrder
  656. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecutionSummary
  657. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executionSummary
  658. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExecutionSummarySupport
  659. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.executionSummarySupport
  660. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExperimental
  661. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.experimental
  662. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExpression
  663. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.expression
  664. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasExternal
  665. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.external
  666. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFailedChange
  667. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.failedChange
  668. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFailureHandling
  669. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.failureHandling
  670. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFailureReason
  671. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.failureReason
  672. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFileOperations
  673. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.fileOperations
  674. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFiles
  675. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.files
  676. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFilterText
  677. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.filterText
  678. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFilters
  679. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.filters
  680. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFirstTriggerCharacter
  681. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.firstTriggerCharacter
  682. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFoldingRange
  683. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.foldingRange
  684. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFoldingRangeKind
  685. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.foldingRangeKind
  686. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFoldingRangeProvider
  687. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.foldingRangeProvider
  688. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFormats
  689. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.formats
  690. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFormatting
  691. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.formatting
  692. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFrameId
  693. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.frameId
  694. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFrom
  695. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.from
  696. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFromRanges
  697. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.fromRanges
  698. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasFull
  699. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.full
  700. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGeneral
  701. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.general
  702. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGlob
  703. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.glob
  704. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGlobPattern
  705. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.globPattern
  706. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGreen
  707. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.green
  708. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasGroupsOnLabel
  709. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.groupsOnLabel
  710. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHierarchicalDocumentSymbolSupport
  711. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.hierarchicalDocumentSymbolSupport
  712. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHonorsChangeAnnotations
  713. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.honorsChangeAnnotations
  714. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHover
  715. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.hover
  716. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHoverProvider
  717. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.hoverProvider
  718. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasHref
  719. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.href
  720. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasId
  721. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.id
  722. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIdentifier
  723. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.identifier
  724. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIgnoreCase
  725. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ignoreCase
  726. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIgnoreIfExists
  727. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ignoreIfExists
  728. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIgnoreIfNotExists
  729. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ignoreIfNotExists
  730. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasImplementation
  731. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.implementation
  732. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasImplementationProvider
  733. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.implementationProvider
  734. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIncludeDeclaration
  735. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.includeDeclaration
  736. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIncludeText
  737. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.includeText
  738. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInitializationOptions
  739. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.initializationOptions
  740. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlayHint
  741. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlayHint
  742. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlayHintProvider
  743. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlayHintProvider
  744. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlineValue
  745. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlineValue
  746. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInlineValueProvider
  747. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.inlineValueProvider
  748. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsert
  749. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insert
  750. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertFinalNewline
  751. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertFinalNewline
  752. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertReplaceSupport
  753. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertReplaceSupport
  754. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertSpaces
  755. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertSpaces
  756. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertText
  757. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertText
  758. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertTextFormat
  759. 1256.26 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertTextFormat
  760. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertTextMode
  761. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertTextMode
  762. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInsertTextModeSupport
  763. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.insertTextModeSupport
  764. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasInterFileDependencies
  765. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.interFileDependencies
  766. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsIncomplete
  767. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isIncomplete
  768. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsPreferred
  769. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isPreferred
  770. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsPreferredSupport
  771. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isPreferredSupport
  772. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasIsRetrigger
  773. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.isRetrigger
  774. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasItem
  775. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.item
  776. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasItemDefaults
  777. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.itemDefaults
  778. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasItems
  779. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.items
  780. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasKind
  781. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.kind
  782. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabel
  783. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.label
  784. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelDetails
  785. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelDetails
  786. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelDetailsSupport
  787. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelDetailsSupport
  788. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelOffsetSupport
  789. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelOffsetSupport
  790. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLabelSupport
  791. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.labelSupport
  792. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLanguage
  793. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.language
  794. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLanguageId
  795. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.languageId
  796. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLegend
  797. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.legend
  798. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLength
  799. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.length
  800. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLine
  801. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.line
  802. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLineFoldingOnly
  803. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.lineFoldingOnly
  804. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLinkSupport
  805. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.linkSupport
  806. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLinkedEditingRange
  807. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.linkedEditingRange
  808. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLinkedEditingRangeProvider
  809. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.linkedEditingRangeProvider
  810. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLocale
  811. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.locale
  812. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasLocation
  813. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.location
  814. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMarkdown
  815. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.markdown
  816. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMatches
  817. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.matches
  818. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMessage
  819. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.message
  820. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMessageActionItem
  821. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.messageActionItem
  822. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMetadata
  823. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.metadata
  824. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMethod
  825. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.method
  826. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMoniker
  827. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.moniker
  828. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMonikerProvider
  829. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.monikerProvider
  830. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMoreTriggerCharacter
  831. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.moreTriggerCharacter
  832. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasMultilineTokenSupport
  833. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.multilineTokenSupport
  834. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasName
  835. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.name
  836. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNeedsConfirmation
  837. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.needsConfirmation
  838. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNewName
  839. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.newName
  840. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNewText
  841. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.newText
  842. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNewUri
  843. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.newUri
  844. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNormalizesLineEndings
  845. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.normalizesLineEndings
  846. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebook
  847. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebook
  848. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookDocument
  849. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookDocument
  850. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookDocumentSync
  851. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookDocumentSync
  852. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookSelector
  853. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookSelector
  854. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasNotebookType
  855. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.notebookType
  856. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOldUri
  857. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.oldUri
  858. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOnTypeFormatting
  859. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.onTypeFormatting
  860. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOnly
  861. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.only
  862. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOpenClose
  863. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.openClose
  864. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOptions
  865. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.options
  866. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOriginSelectionRange
  867. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.originSelectionRange
  868. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOverlappingTokenSupport
  869. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.overlappingTokenSupport
  870. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasOverwrite
  871. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.overwrite
  872. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPaddingLeft
  873. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.paddingLeft
  874. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPaddingRight
  875. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.paddingRight
  876. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParameterInformation
  877. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parameterInformation
  878. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParameters
  879. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parameters
  880. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParent
  881. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parent
  882. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasParser
  883. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.parser
  884. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPartialResultToken
  885. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.partialResultToken
  886. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPattern
  887. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.pattern
  888. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPercentage
  889. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.percentage
  890. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPlaceholder
  891. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.placeholder
  892. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPosition
  893. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.position
  894. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPositionEncoding
  895. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.positionEncoding
  896. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPositionEncodings
  897. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.positionEncodings
  898. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPositions
  899. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.positions
  900. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPrepareProvider
  901. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.prepareProvider
  902. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPrepareSupport
  903. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.prepareSupport
  904. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPrepareSupportDefaultBehavior
  905. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.prepareSupportDefaultBehavior
  906. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreselect
  907. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.preselect
  908. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreselectSupport
  909. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.preselectSupport
  910. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreviousResultId
  911. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.previousResultId
  912. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPreviousResultIds
  913. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.previousResultIds
  914. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasProcessId
  915. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.processId
  916. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasProperties
  917. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.properties
  918. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasPublishDiagnostics
  919. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.publishDiagnostics
  920. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasQuery
  921. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.query
  922. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRange
  923. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.range
  924. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRangeFormatting
  925. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rangeFormatting
  926. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRangeLength
  927. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rangeLength
  928. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRangeLimit
  929. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rangeLimit
  930. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRanges
  931. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.ranges
  932. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReason
  933. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.reason
  934. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRecursive
  935. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.recursive
  936. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRed
  937. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.red
  938. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReferences
  939. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.references
  940. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReferencesProvider
  941. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.referencesProvider
  942. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRefreshSupport
  943. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.refreshSupport
  944. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRegisterOptions
  945. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.registerOptions
  946. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRegistrations
  947. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.registrations
  948. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRegularExpressions
  949. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.regularExpressions
  950. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelatedDocumentSupport
  951. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relatedDocumentSupport
  952. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelatedDocuments
  953. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relatedDocuments
  954. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelatedInformation
  955. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relatedInformation
  956. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRelativePatternSupport
  957. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.relativePatternSupport
  958. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRemoved
  959. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.removed
  960. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRename
  961. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rename
  962. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRenameProvider
  963. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.renameProvider
  964. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasReplace
  965. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.replace
  966. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRequests
  967. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.requests
  968. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResolveProvider
  969. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resolveProvider
  970. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResolveSupport
  971. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resolveSupport
  972. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResourceOperations
  973. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resourceOperations
  974. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasResultId
  975. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.resultId
  976. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetriggerCharacters
  977. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retriggerCharacters
  978. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetriggerRequest
  979. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retriggerRequest
  980. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetry
  981. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retry
  982. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRetryOnContentModified
  983. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.retryOnContentModified
  984. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRootPath
  985. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rootPath
  986. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasRootUri
  987. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.rootUri
  988. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSave
  989. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.save
  990. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasScheme
  991. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.scheme
  992. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasScopeUri
  993. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.scopeUri
  994. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSection
  995. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.section
  996. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSelection
  997. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.selection
  998. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSelectionRange
  999. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.selectionRange
  1000. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSelectionRangeProvider
  1001. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.selectionRangeProvider
  1002. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSemanticTokens
  1003. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.semanticTokens
  1004. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSemanticTokensProvider
  1005. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.semanticTokensProvider
  1006. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasServerCancelSupport
  1007. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.serverCancelSupport
  1008. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasServerInfo
  1009. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.serverInfo
  1010. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSettings
  1011. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.settings
  1012. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSeverity
  1013. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.severity
  1014. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasShowDocument
  1015. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.showDocument
  1016. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasShowMessage
  1017. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.showMessage
  1018. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatureHelp
  1019. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatureHelp
  1020. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatureHelpProvider
  1021. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatureHelpProvider
  1022. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatureInformation
  1023. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatureInformation
  1024. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSignatures
  1025. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.signatures
  1026. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSnippetSupport
  1027. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.snippetSupport
  1028. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSortText
  1029. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.sortText
  1030. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSource
  1031. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.source
  1032. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStaleRequestSupport
  1033. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.staleRequestSupport
  1034. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStart
  1035. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.start
  1036. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStartChar
  1037. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.startChar
  1038. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStartCharacter
  1039. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.startCharacter
  1040. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStartLine
  1041. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.startLine
  1042. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStoppedLocation
  1043. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.stoppedLocation
  1044. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasStructure
  1045. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.structure
  1046. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSuccess
  1047. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.success
  1048. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSupport
  1049. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.support
  1050. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSupported
  1051. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.supported
  1052. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSymbol
  1053. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.symbol
  1054. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSymbolKind
  1055. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.symbolKind
  1056. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSyncKind
  1057. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.syncKind
  1058. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasSynchronization
  1059. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.synchronization
  1060. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTabSize
  1061. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tabSize
  1062. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTagSupport
  1063. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tagSupport
  1064. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTags
  1065. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tags
  1066. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTakeFocus
  1067. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.takeFocus
  1068. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTarget
  1069. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.target
  1070. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTargetRange
  1071. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.targetRange
  1072. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTargetSelectionRange
  1073. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.targetSelectionRange
  1074. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTargetUri
  1075. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.targetUri
  1076. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasText
  1077. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.text
  1078. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextContent
  1079. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textContent
  1080. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextDocument
  1081. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textDocument
  1082. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextDocumentSync
  1083. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textDocumentSync
  1084. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextEdit
  1085. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textEdit
  1086. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextEditText
  1087. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textEditText
  1088. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTextEdits
  1089. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.textEdits
  1090. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTitle
  1091. 1256.27 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.title
  1092. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTo
  1093. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.to
  1094. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasToken
  1095. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.token
  1096. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTokenModifiers
  1097. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tokenModifiers
  1098. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTokenType
  1099. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tokenType
  1100. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTokenTypes
  1101. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tokenTypes
  1102. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTooltip
  1103. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tooltip
  1104. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTooltipSupport
  1105. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.tooltipSupport
  1106. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTrace
  1107. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.trace
  1108. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTriggerCharacter
  1109. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.triggerCharacter
  1110. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTriggerCharacters
  1111. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.triggerCharacters
  1112. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTriggerKind
  1113. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.triggerKind
  1114. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTrimFinalNewlines
  1115. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.trimFinalNewlines
  1116. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTrimTrailingWhitespace
  1117. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.trimTrailingWhitespace
  1118. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeDefinition
  1119. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeDefinition
  1120. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeDefinitionProvider
  1121. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeDefinitionProvider
  1122. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeHierarchy
  1123. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeHierarchy
  1124. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasTypeHierarchyProvider
  1125. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.typeHierarchyProvider
  1126. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasType_
  1127. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.type_
  1128. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasUnique
  1129. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.unique
  1130. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasUnregisterations
  1131. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.unregisterations
  1132. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasUri
  1133. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.uri
  1134. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasValue
  1135. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.value
  1136. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasValueSet
  1137. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.valueSet
  1138. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVariableName
  1139. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.variableName
  1140. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVerbose
  1141. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.verbose
  1142. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVersion
  1143. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.version
  1144. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasVersionSupport
  1145. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.versionSupport
  1146. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWatchers
  1147. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.watchers
  1148. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillCreate
  1149. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willCreate
  1150. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillDelete
  1151. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willDelete
  1152. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillRename
  1153. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willRename
  1154. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillSave
  1155. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willSave
  1156. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWillSaveWaitUntil
  1157. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.willSaveWaitUntil
  1158. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWindow
  1159. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.window
  1160. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWordPattern
  1161. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.wordPattern
  1162. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkDoneProgress
  1163. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workDoneProgress
  1164. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkDoneToken
  1165. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workDoneToken
  1166. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspace
  1167. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspace
  1168. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceDiagnostics
  1169. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceDiagnostics
  1170. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceEdit
  1171. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceEdit
  1172. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceFolders
  1173. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceFolders
  1174. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.HasWorkspaceSymbolProvider
  1175. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Lens.workspaceSymbolProvider
  1176. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Common.Null
  1177. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeWrite
  1178. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicSet
  1179. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.MVector
  1180. 1256.28 s [hls-test-utils] - Data.Vector.Unboxed.Base.MV_Int32
  1181. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Base.basicLength
  1182. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeIndexM
  1183. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeNew
  1184. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeFreeze
  1185. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeSlice
  1186. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicLength
  1187. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeGrow
  1188. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeRead
  1189. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Base.elemseq
  1190. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicInitialize
  1191. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeCopy
  1192. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeCopy
  1193. 1256.28 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeSlice
  1194. 1256.28 s [hls-test-utils] - Data.Vector.Primitive.Vector
  1195. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.AnnotatedTextEdit.Rep_AnnotatedTextEdit
  1196. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ChangeAnnotationIdentifier.Rep_ChangeAnnotationIdentifier
  1197. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Range.Rep_Range
  1198. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Position.Rep_Position
  1199. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ApplyWorkspaceEditParams.Rep_ApplyWorkspaceEditParams
  1200. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceEdit.Rep_WorkspaceEdit
  1201. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextEdit.Rep_TextEdit
  1202. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Common.Rep_|?
  1203. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentEdit.Rep_TextDocumentEdit
  1204. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.OptionalVersionedTextDocumentIdentifier.Rep_OptionalVersionedTextDocumentIdentifier
  1205. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CreateFile.Rep_CreateFile
  1206. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CreateFileOptions.Rep_CreateFileOptions
  1207. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RenameFile.Rep_RenameFile
  1208. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RenameFileOptions.Rep_RenameFileOptions
  1209. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeleteFile.Rep_DeleteFile
  1210. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeleteFileOptions.Rep_DeleteFileOptions
  1211. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ChangeAnnotation.Rep_ChangeAnnotation
  1212. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ApplyWorkspaceEditResult.Rep_ApplyWorkspaceEditResult
  1213. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Common.Rep_UInt
  1214. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.BaseSymbolInformation.Rep_BaseSymbolInformation
  1215. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SymbolTag.Rep_SymbolTag
  1216. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SymbolKind.D:R:EnumBaseTypeSymbolKind
  1217. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SymbolKind.Rep_SymbolKind
  1218. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SymbolTag.D:R:EnumBaseTypeSymbolTag
  1219. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyClientCapabilities.Rep_CallHierarchyClientCapabilities
  1220. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyIncomingCall.Rep_CallHierarchyIncomingCall
  1221. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyItem.Rep_CallHierarchyItem
  1222. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyIncomingCallsParams.Rep_CallHierarchyIncomingCallsParams
  1223. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ProgressToken.Rep_ProgressToken
  1224. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Uri.Rep_NormalizedFilePath
  1225. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Uri.Rep_NormalizedUri
  1226. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Uri.Rep_Uri
  1227. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Types.Uri.SystemOS
  1228. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyOptions.Rep_CallHierarchyOptions
  1229. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyOutgoingCall.Rep_CallHierarchyOutgoingCall
  1230. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyOutgoingCallsParams.Rep_CallHierarchyOutgoingCallsParams
  1231. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyPrepareParams.Rep_CallHierarchyPrepareParams
  1232. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentIdentifier.Rep_TextDocumentIdentifier
  1233. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CallHierarchyRegistrationOptions.Rep_CallHierarchyRegistrationOptions
  1234. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentFilter.Rep_DocumentFilter
  1235. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentFilter.Rep_TextDocumentFilter
  1236. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentFilterLanguage.Rep_TextDocumentFilterLanguage
  1237. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentFilterScheme.Rep_TextDocumentFilterScheme
  1238. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentFilterPattern.Rep_TextDocumentFilterPattern
  1239. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookCellTextDocumentFilter.Rep_NotebookCellTextDocumentFilter
  1240. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentFilter.Rep_NotebookDocumentFilter
  1241. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentFilterNotebookType.Rep_NotebookDocumentFilterNotebookType
  1242. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentFilterScheme.Rep_NotebookDocumentFilterScheme
  1243. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentFilterPattern.Rep_NotebookDocumentFilterPattern
  1244. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentSelector.Rep_DocumentSelector
  1245. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CancelParams.Rep_CancelParams
  1246. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ChangeAnnotationsSupportOptions.Rep_ChangeAnnotationsSupportOptions
  1247. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCapabilities.Rep_ClientCapabilities
  1248. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceClientCapabilities.Rep_WorkspaceClientCapabilities
  1249. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceEditClientCapabilities.Rep_WorkspaceEditClientCapabilities
  1250. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ResourceOperationKind.Rep_ResourceOperationKind
  1251. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FailureHandlingKind.Rep_FailureHandlingKind
  1252. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeConfigurationClientCapabilities.Rep_DidChangeConfigurationClientCapabilities
  1253. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeWatchedFilesClientCapabilities.Rep_DidChangeWatchedFilesClientCapabilities
  1254. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceSymbolClientCapabilities.Rep_WorkspaceSymbolClientCapabilities
  1255. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientSymbolKindOptions.Rep_ClientSymbolKindOptions
  1256. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientSymbolTagOptions.Rep_ClientSymbolTagOptions
  1257. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientSymbolResolveOptions.Rep_ClientSymbolResolveOptions
  1258. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ExecuteCommandClientCapabilities.Rep_ExecuteCommandClientCapabilities
  1259. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensWorkspaceClientCapabilities.Rep_SemanticTokensWorkspaceClientCapabilities
  1260. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeLensWorkspaceClientCapabilities.Rep_CodeLensWorkspaceClientCapabilities
  1261. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationClientCapabilities.Rep_FileOperationClientCapabilities
  1262. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueWorkspaceClientCapabilities.Rep_InlineValueWorkspaceClientCapabilities
  1263. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintWorkspaceClientCapabilities.Rep_InlayHintWorkspaceClientCapabilities
  1264. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticWorkspaceClientCapabilities.Rep_DiagnosticWorkspaceClientCapabilities
  1265. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentClientCapabilities.Rep_TextDocumentClientCapabilities
  1266. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentSyncClientCapabilities.Rep_TextDocumentSyncClientCapabilities
  1267. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionClientCapabilities.Rep_CompletionClientCapabilities
  1268. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCompletionItemOptions.Rep_ClientCompletionItemOptions
  1269. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MarkupKind.Rep_MarkupKind
  1270. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItemTag.Rep_CompletionItemTag
  1271. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItemTagOptions.Rep_CompletionItemTagOptions
  1272. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCompletionItemResolveOptions.Rep_ClientCompletionItemResolveOptions
  1273. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InsertTextMode.Rep_InsertTextMode
  1274. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCompletionItemInsertTextModeOptions.Rep_ClientCompletionItemInsertTextModeOptions
  1275. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCompletionItemOptionsKind.Rep_ClientCompletionItemOptionsKind
  1276. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionListCapabilities.Rep_CompletionListCapabilities
  1277. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.HoverClientCapabilities.Rep_HoverClientCapabilities
  1278. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelpClientCapabilities.Rep_SignatureHelpClientCapabilities
  1279. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientSignatureInformationOptions.Rep_ClientSignatureInformationOptions
  1280. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientSignatureParameterInformationOptions.Rep_ClientSignatureParameterInformationOptions
  1281. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeclarationClientCapabilities.Rep_DeclarationClientCapabilities
  1282. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DefinitionClientCapabilities.Rep_DefinitionClientCapabilities
  1283. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeDefinitionClientCapabilities.Rep_TypeDefinitionClientCapabilities
  1284. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ImplementationClientCapabilities.Rep_ImplementationClientCapabilities
  1285. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ReferenceClientCapabilities.Rep_ReferenceClientCapabilities
  1286. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentHighlightClientCapabilities.Rep_DocumentHighlightClientCapabilities
  1287. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentSymbolClientCapabilities.Rep_DocumentSymbolClientCapabilities
  1288. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionClientCapabilities.Rep_CodeActionClientCapabilities
  1289. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionKind.Rep_CodeActionKind
  1290. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCodeActionLiteralOptions.Rep_ClientCodeActionLiteralOptions
  1291. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCodeActionKindOptions.Rep_ClientCodeActionKindOptions
  1292. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientCodeActionResolveOptions.Rep_ClientCodeActionResolveOptions
  1293. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeLensClientCapabilities.Rep_CodeLensClientCapabilities
  1294. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentLinkClientCapabilities.Rep_DocumentLinkClientCapabilities
  1295. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentColorClientCapabilities.Rep_DocumentColorClientCapabilities
  1296. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentFormattingClientCapabilities.Rep_DocumentFormattingClientCapabilities
  1297. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentRangeFormattingClientCapabilities.Rep_DocumentRangeFormattingClientCapabilities
  1298. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentOnTypeFormattingClientCapabilities.Rep_DocumentOnTypeFormattingClientCapabilities
  1299. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RenameClientCapabilities.Rep_RenameClientCapabilities
  1300. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PrepareSupportDefaultBehavior.Rep_PrepareSupportDefaultBehavior
  1301. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FoldingRangeClientCapabilities.Rep_FoldingRangeClientCapabilities
  1302. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientFoldingRangeKindOptions.Rep_ClientFoldingRangeKindOptions
  1303. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FoldingRangeKind.Rep_FoldingRangeKind
  1304. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientFoldingRangeOptions.Rep_ClientFoldingRangeOptions
  1305. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SelectionRangeClientCapabilities.Rep_SelectionRangeClientCapabilities
  1306. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PublishDiagnosticsClientCapabilities.Rep_PublishDiagnosticsClientCapabilities
  1307. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticTag.Rep_DiagnosticTag
  1308. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientDiagnosticsTagOptions.Rep_ClientDiagnosticsTagOptions
  1309. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensClientCapabilities.Rep_SemanticTokensClientCapabilities
  1310. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientSemanticTokensRequestOptions.Rep_ClientSemanticTokensRequestOptions
  1311. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TokenFormat.Rep_TokenFormat
  1312. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientSemanticTokensRequestFullDelta.Rep_ClientSemanticTokensRequestFullDelta
  1313. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LinkedEditingRangeClientCapabilities.Rep_LinkedEditingRangeClientCapabilities
  1314. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MonikerClientCapabilities.Rep_MonikerClientCapabilities
  1315. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeHierarchyClientCapabilities.Rep_TypeHierarchyClientCapabilities
  1316. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueClientCapabilities.Rep_InlineValueClientCapabilities
  1317. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintClientCapabilities.Rep_InlayHintClientCapabilities
  1318. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientInlayHintResolveOptions.Rep_ClientInlayHintResolveOptions
  1319. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticClientCapabilities.Rep_DiagnosticClientCapabilities
  1320. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentClientCapabilities.Rep_NotebookDocumentClientCapabilities
  1321. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentSyncClientCapabilities.Rep_NotebookDocumentSyncClientCapabilities
  1322. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WindowClientCapabilities.Rep_WindowClientCapabilities
  1323. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ShowMessageRequestClientCapabilities.Rep_ShowMessageRequestClientCapabilities
  1324. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientShowMessageActionItemOptions.Rep_ClientShowMessageActionItemOptions
  1325. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ShowDocumentClientCapabilities.Rep_ShowDocumentClientCapabilities
  1326. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.GeneralClientCapabilities.Rep_GeneralClientCapabilities
  1327. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.StaleRequestSupportOptions.Rep_StaleRequestSupportOptions
  1328. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RegularExpressionsClientCapabilities.Rep_RegularExpressionsClientCapabilities
  1329. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RegularExpressionEngineKind.Rep_RegularExpressionEngineKind
  1330. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MarkdownClientCapabilities.Rep_MarkdownClientCapabilities
  1331. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PositionEncodingKind.Rep_PositionEncodingKind
  1332. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionKind.D:R:EnumBaseTypeCodeActionKind
  1333. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InsertTextMode.D:R:EnumBaseTypeInsertTextMode
  1334. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MarkupKind.D:R:EnumBaseTypeMarkupKind
  1335. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItemTag.D:R:EnumBaseTypeCompletionItemTag
  1336. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItemKind.D:R:EnumBaseTypeCompletionItemKind
  1337. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItemKind.Rep_CompletionItemKind
  1338. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticTag.D:R:EnumBaseTypeDiagnosticTag
  1339. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FoldingRangeKind.D:R:EnumBaseTypeFoldingRangeKind
  1340. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ClientInfo.Rep_ClientInfo
  1341. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeAction.Rep_CodeAction
  1342. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Diagnostic.Rep_Diagnostic
  1343. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticSeverity.Rep_DiagnosticSeverity
  1344. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeDescription.Rep_CodeDescription
  1345. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticRelatedInformation.Rep_DiagnosticRelatedInformation
  1346. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Location.Rep_Location
  1347. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionDisabled.Rep_CodeActionDisabled
  1348. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Command.Rep_Command
  1349. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionContext.Rep_CodeActionContext
  1350. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionTriggerKind.Rep_CodeActionTriggerKind
  1351. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionTriggerKind.D:R:EnumBaseTypeCodeActionTriggerKind
  1352. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionOptions.Rep_CodeActionOptions
  1353. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionParams.Rep_CodeActionParams
  1354. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeActionRegistrationOptions.Rep_CodeActionRegistrationOptions
  1355. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeLens.Rep_CodeLens
  1356. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeLensOptions.Rep_CodeLensOptions
  1357. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeLensParams.Rep_CodeLensParams
  1358. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CodeLensRegistrationOptions.Rep_CodeLensRegistrationOptions
  1359. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Color.Rep_Color
  1360. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ColorInformation.Rep_ColorInformation
  1361. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ColorPresentation.Rep_ColorPresentation
  1362. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ColorPresentationParams.Rep_ColorPresentationParams
  1363. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionContext.Rep_CompletionContext
  1364. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionTriggerKind.Rep_CompletionTriggerKind
  1365. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionTriggerKind.D:R:EnumBaseTypeCompletionTriggerKind
  1366. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItem.Rep_CompletionItem
  1367. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItemLabelDetails.Rep_CompletionItemLabelDetails
  1368. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MarkupContent.Rep_MarkupContent
  1369. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InsertTextFormat.Rep_InsertTextFormat
  1370. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InsertReplaceEdit.Rep_InsertReplaceEdit
  1371. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InsertTextFormat.D:R:EnumBaseTypeInsertTextFormat
  1372. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionItemDefaults.Rep_CompletionItemDefaults
  1373. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.EditRangeWithInsertReplace.Rep_EditRangeWithInsertReplace
  1374. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionList.Rep_CompletionList
  1375. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionOptions.Rep_CompletionOptions
  1376. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ServerCompletionItemOptions.Rep_ServerCompletionItemOptions
  1377. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionParams.Rep_CompletionParams
  1378. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CompletionRegistrationOptions.Rep_CompletionRegistrationOptions
  1379. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ConfigurationItem.Rep_ConfigurationItem
  1380. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ConfigurationParams.Rep_ConfigurationParams
  1381. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.CreateFilesParams.Rep_CreateFilesParams
  1382. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileCreate.Rep_FileCreate
  1383. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Declaration.Rep_Declaration
  1384. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeclarationLink.Rep_DeclarationLink
  1385. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LocationLink.Rep_LocationLink
  1386. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeclarationOptions.Rep_DeclarationOptions
  1387. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeclarationParams.Rep_DeclarationParams
  1388. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeclarationRegistrationOptions.Rep_DeclarationRegistrationOptions
  1389. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Definition.Rep_Definition
  1390. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DefinitionLink.Rep_DefinitionLink
  1391. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DefinitionOptions.Rep_DefinitionOptions
  1392. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DefinitionParams.Rep_DefinitionParams
  1393. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DefinitionRegistrationOptions.Rep_DefinitionRegistrationOptions
  1394. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DeleteFilesParams.Rep_DeleteFilesParams
  1395. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileDelete.Rep_FileDelete
  1396. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticSeverity.D:R:EnumBaseTypeDiagnosticSeverity
  1397. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticOptions.Rep_DiagnosticOptions
  1398. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticRegistrationOptions.Rep_DiagnosticRegistrationOptions
  1399. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DiagnosticServerCancellationData.Rep_DiagnosticServerCancellationData
  1400. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeConfigurationParams.Rep_DidChangeConfigurationParams
  1401. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeConfigurationRegistrationOptions.Rep_DidChangeConfigurationRegistrationOptions
  1402. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeNotebookDocumentParams.Rep_DidChangeNotebookDocumentParams
  1403. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.VersionedNotebookDocumentIdentifier.Rep_VersionedNotebookDocumentIdentifier
  1404. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentChangeEvent.Rep_NotebookDocumentChangeEvent
  1405. 1256.28 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentCellChanges.Rep_NotebookDocumentCellChanges
  1406. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentCellChangeStructure.Rep_NotebookDocumentCellChangeStructure
  1407. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookCellArrayChange.Rep_NotebookCellArrayChange
  1408. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookCell.Rep_NotebookCell
  1409. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookCellKind.Rep_NotebookCellKind
  1410. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ExecutionSummary.Rep_ExecutionSummary
  1411. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentItem.Rep_TextDocumentItem
  1412. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentCellContentChanges.Rep_NotebookDocumentCellContentChanges
  1413. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.VersionedTextDocumentIdentifier.Rep_VersionedTextDocumentIdentifier
  1414. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentContentChangeEvent.Rep_TextDocumentContentChangeEvent
  1415. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentContentChangePartial.Rep_TextDocumentContentChangePartial
  1416. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentContentChangeWholeDocument.Rep_TextDocumentContentChangeWholeDocument
  1417. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeTextDocumentParams.Rep_DidChangeTextDocumentParams
  1418. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeWatchedFilesParams.Rep_DidChangeWatchedFilesParams
  1419. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileEvent.Rep_FileEvent
  1420. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileChangeType.Rep_FileChangeType
  1421. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeWatchedFilesRegistrationOptions.Rep_DidChangeWatchedFilesRegistrationOptions
  1422. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileSystemWatcher.Rep_FileSystemWatcher
  1423. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.GlobPattern.Rep_GlobPattern
  1424. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Pattern.Rep_Pattern
  1425. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RelativePattern.Rep_RelativePattern
  1426. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceFolder.Rep_WorkspaceFolder
  1427. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WatchKind.Rep_WatchKind
  1428. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidChangeWorkspaceFoldersParams.Rep_DidChangeWorkspaceFoldersParams
  1429. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceFoldersChangeEvent.Rep_WorkspaceFoldersChangeEvent
  1430. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidCloseNotebookDocumentParams.Rep_DidCloseNotebookDocumentParams
  1431. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentIdentifier.Rep_NotebookDocumentIdentifier
  1432. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidCloseTextDocumentParams.Rep_DidCloseTextDocumentParams
  1433. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidOpenNotebookDocumentParams.Rep_DidOpenNotebookDocumentParams
  1434. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocument.Rep_NotebookDocument
  1435. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LanguageKind.D:R:EnumBaseTypeLanguageKind
  1436. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidOpenTextDocumentParams.Rep_DidOpenTextDocumentParams
  1437. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidSaveNotebookDocumentParams.Rep_DidSaveNotebookDocumentParams
  1438. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DidSaveTextDocumentParams.Rep_DidSaveTextDocumentParams
  1439. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentColorOptions.Rep_DocumentColorOptions
  1440. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentColorParams.Rep_DocumentColorParams
  1441. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentColorRegistrationOptions.Rep_DocumentColorRegistrationOptions
  1442. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentDiagnosticParams.Rep_DocumentDiagnosticParams
  1443. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentDiagnosticReport.Rep_DocumentDiagnosticReport
  1444. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RelatedFullDocumentDiagnosticReport.Rep_RelatedFullDocumentDiagnosticReport
  1445. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FullDocumentDiagnosticReport.Rep_FullDocumentDiagnosticReport
  1446. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.UnchangedDocumentDiagnosticReport.Rep_UnchangedDocumentDiagnosticReport
  1447. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RelatedUnchangedDocumentDiagnosticReport.Rep_RelatedUnchangedDocumentDiagnosticReport
  1448. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentDiagnosticReportKind.D:R:EnumBaseTypeDocumentDiagnosticReportKind
  1449. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentDiagnosticReportKind.Rep_DocumentDiagnosticReportKind
  1450. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentDiagnosticReportPartialResult.Rep_DocumentDiagnosticReportPartialResult
  1451. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentFormattingOptions.Rep_DocumentFormattingOptions
  1452. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentFormattingParams.Rep_DocumentFormattingParams
  1453. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FormattingOptions.Rep_FormattingOptions
  1454. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentFormattingRegistrationOptions.Rep_DocumentFormattingRegistrationOptions
  1455. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentHighlight.Rep_DocumentHighlight
  1456. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentHighlightKind.Rep_DocumentHighlightKind
  1457. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentHighlightKind.D:R:EnumBaseTypeDocumentHighlightKind
  1458. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentHighlightOptions.Rep_DocumentHighlightOptions
  1459. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentHighlightParams.Rep_DocumentHighlightParams
  1460. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentHighlightRegistrationOptions.Rep_DocumentHighlightRegistrationOptions
  1461. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentLink.Rep_DocumentLink
  1462. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentLinkOptions.Rep_DocumentLinkOptions
  1463. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentLinkParams.Rep_DocumentLinkParams
  1464. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentLinkRegistrationOptions.Rep_DocumentLinkRegistrationOptions
  1465. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentOnTypeFormattingOptions.Rep_DocumentOnTypeFormattingOptions
  1466. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentOnTypeFormattingParams.Rep_DocumentOnTypeFormattingParams
  1467. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentOnTypeFormattingRegistrationOptions.Rep_DocumentOnTypeFormattingRegistrationOptions
  1468. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentRangeFormattingOptions.Rep_DocumentRangeFormattingOptions
  1469. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentRangeFormattingParams.Rep_DocumentRangeFormattingParams
  1470. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentRangeFormattingRegistrationOptions.Rep_DocumentRangeFormattingRegistrationOptions
  1471. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentSymbol.Rep_DocumentSymbol
  1472. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentSymbolOptions.Rep_DocumentSymbolOptions
  1473. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentSymbolParams.Rep_DocumentSymbolParams
  1474. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.DocumentSymbolRegistrationOptions.Rep_DocumentSymbolRegistrationOptions
  1475. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ErrorCodes.D:R:EnumBaseTypeErrorCodes
  1476. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ErrorCodes.Rep_ErrorCodes
  1477. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ExecuteCommandOptions.Rep_ExecuteCommandOptions
  1478. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ExecuteCommandParams.Rep_ExecuteCommandParams
  1479. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ExecuteCommandRegistrationOptions.Rep_ExecuteCommandRegistrationOptions
  1480. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FailureHandlingKind.D:R:EnumBaseTypeFailureHandlingKind
  1481. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileChangeType.D:R:EnumBaseTypeFileChangeType
  1482. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationFilter.Rep_FileOperationFilter
  1483. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationPattern.Rep_FileOperationPattern
  1484. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationPatternKind.Rep_FileOperationPatternKind
  1485. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationPatternOptions.Rep_FileOperationPatternOptions
  1486. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationOptions.Rep_FileOperationOptions
  1487. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationRegistrationOptions.Rep_FileOperationRegistrationOptions
  1488. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileOperationPatternKind.D:R:EnumBaseTypeFileOperationPatternKind
  1489. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FileRename.Rep_FileRename
  1490. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WatchKind.D:R:EnumBaseTypeWatchKind
  1491. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FoldingRange.Rep_FoldingRange
  1492. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FoldingRangeOptions.Rep_FoldingRangeOptions
  1493. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FoldingRangeParams.Rep_FoldingRangeParams
  1494. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.FoldingRangeRegistrationOptions.Rep_FoldingRangeRegistrationOptions
  1495. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PositionEncodingKind.D:R:EnumBaseTypePositionEncodingKind
  1496. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Hover.Rep_Hover
  1497. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MarkedString.Rep_MarkedString
  1498. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MarkedStringWithLanguage.Rep_MarkedStringWithLanguage
  1499. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.HoverOptions.Rep_HoverOptions
  1500. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.HoverParams.Rep_HoverParams
  1501. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.HoverRegistrationOptions.Rep_HoverRegistrationOptions
  1502. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ImplementationOptions.Rep_ImplementationOptions
  1503. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ImplementationParams.Rep_ImplementationParams
  1504. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ImplementationRegistrationOptions.Rep_ImplementationRegistrationOptions
  1505. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InitializeError.Rep_InitializeError
  1506. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InitializeParams.Rep_InitializeParams
  1507. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TraceValue.Rep_TraceValue
  1508. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TraceValue.D:R:EnumBaseTypeTraceValue
  1509. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InitializeResult.Rep_InitializeResult
  1510. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ServerCapabilities.Rep_ServerCapabilities
  1511. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentSyncOptions.Rep_TextDocumentSyncOptions
  1512. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentSyncKind.Rep_TextDocumentSyncKind
  1513. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SaveOptions.Rep_SaveOptions
  1514. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentSyncOptions.Rep_NotebookDocumentSyncOptions
  1515. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentFilterWithNotebook.Rep_NotebookDocumentFilterWithNotebook
  1516. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookCellLanguage.Rep_NotebookCellLanguage
  1517. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentFilterWithCells.Rep_NotebookDocumentFilterWithCells
  1518. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookDocumentSyncRegistrationOptions.Rep_NotebookDocumentSyncRegistrationOptions
  1519. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelpOptions.Rep_SignatureHelpOptions
  1520. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeDefinitionOptions.Rep_TypeDefinitionOptions
  1521. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeDefinitionRegistrationOptions.Rep_TypeDefinitionRegistrationOptions
  1522. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ReferenceOptions.Rep_ReferenceOptions
  1523. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceSymbolOptions.Rep_WorkspaceSymbolOptions
  1524. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RenameOptions.Rep_RenameOptions
  1525. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SelectionRangeOptions.Rep_SelectionRangeOptions
  1526. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SelectionRangeRegistrationOptions.Rep_SelectionRangeRegistrationOptions
  1527. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LinkedEditingRangeOptions.Rep_LinkedEditingRangeOptions
  1528. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LinkedEditingRangeRegistrationOptions.Rep_LinkedEditingRangeRegistrationOptions
  1529. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensOptions.Rep_SemanticTokensOptions
  1530. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensLegend.Rep_SemanticTokensLegend
  1531. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensFullDelta.Rep_SemanticTokensFullDelta
  1532. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensRegistrationOptions.Rep_SemanticTokensRegistrationOptions
  1533. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MonikerOptions.Rep_MonikerOptions
  1534. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MonikerRegistrationOptions.Rep_MonikerRegistrationOptions
  1535. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeHierarchyOptions.Rep_TypeHierarchyOptions
  1536. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeHierarchyRegistrationOptions.Rep_TypeHierarchyRegistrationOptions
  1537. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueOptions.Rep_InlineValueOptions
  1538. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueRegistrationOptions.Rep_InlineValueRegistrationOptions
  1539. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintOptions.Rep_InlayHintOptions
  1540. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintRegistrationOptions.Rep_InlayHintRegistrationOptions
  1541. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceOptions.Rep_WorkspaceOptions
  1542. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceFoldersServerCapabilities.Rep_WorkspaceFoldersServerCapabilities
  1543. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ServerInfo.Rep_ServerInfo
  1544. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InitializedParams.Rep_InitializedParams
  1545. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHint.Rep_InlayHint
  1546. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintLabelPart.Rep_InlayHintLabelPart
  1547. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintKind.Rep_InlayHintKind
  1548. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintKind.D:R:EnumBaseTypeInlayHintKind
  1549. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlayHintParams.Rep_InlayHintParams
  1550. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValue.Rep_InlineValue
  1551. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueText.Rep_InlineValueText
  1552. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueVariableLookup.Rep_InlineValueVariableLookup
  1553. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueEvaluatableExpression.Rep_InlineValueEvaluatableExpression
  1554. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueContext.Rep_InlineValueContext
  1555. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.InlineValueParams.Rep_InlineValueParams
  1556. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LSPErrorCodes.D:R:EnumBaseTypeLSPErrorCodes
  1557. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LSPErrorCodes.Rep_LSPErrorCodes
  1558. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LanguageKind.Rep_LanguageKind
  1559. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LinkedEditingRangeParams.Rep_LinkedEditingRangeParams
  1560. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LinkedEditingRanges.Rep_LinkedEditingRanges
  1561. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LocationUriOnly.Rep_LocationUriOnly
  1562. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LogMessageParams.Rep_LogMessageParams
  1563. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MessageType.Rep_MessageType
  1564. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MessageType.D:R:EnumBaseTypeMessageType
  1565. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.LogTraceParams.Rep_LogTraceParams
  1566. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MessageActionItem.Rep_MessageActionItem
  1567. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Moniker.Rep_Moniker
  1568. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.UniquenessLevel.Rep_UniquenessLevel
  1569. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MonikerKind.Rep_MonikerKind
  1570. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.UniquenessLevel.D:R:EnumBaseTypeUniquenessLevel
  1571. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MonikerKind.D:R:EnumBaseTypeMonikerKind
  1572. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.MonikerParams.Rep_MonikerParams
  1573. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.NotebookCellKind.D:R:EnumBaseTypeNotebookCellKind
  1574. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ParameterInformation.Rep_ParameterInformation
  1575. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PartialResultParams.Rep_PartialResultParams
  1576. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PrepareRenameDefaultBehavior.Rep_PrepareRenameDefaultBehavior
  1577. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PrepareRenameParams.Rep_PrepareRenameParams
  1578. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PrepareRenamePlaceholder.Rep_PrepareRenamePlaceholder
  1579. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PrepareRenameResult.Rep_PrepareRenameResult
  1580. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PrepareSupportDefaultBehavior.D:R:EnumBaseTypePrepareSupportDefaultBehavior
  1581. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PreviousResultId.Rep_PreviousResultId
  1582. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ProgressParams.Rep_ProgressParams
  1583. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.PublishDiagnosticsParams.Rep_PublishDiagnosticsParams
  1584. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ReferenceContext.Rep_ReferenceContext
  1585. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ReferenceParams.Rep_ReferenceParams
  1586. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ReferenceRegistrationOptions.Rep_ReferenceRegistrationOptions
  1587. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Registration.Rep_Registration
  1588. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RegistrationParams.Rep_RegistrationParams
  1589. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RenameFilesParams.Rep_RenameFilesParams
  1590. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RenameParams.Rep_RenameParams
  1591. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.RenameRegistrationOptions.Rep_RenameRegistrationOptions
  1592. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ResourceOperation.Rep_ResourceOperation
  1593. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ResourceOperationKind.D:R:EnumBaseTypeResourceOperationKind
  1594. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SelectionRange.Rep_SelectionRange
  1595. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SelectionRangeParams.Rep_SelectionRangeParams
  1596. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokenModifiers.D:R:EnumBaseTypeSemanticTokenModifiers
  1597. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokenModifiers.Rep_SemanticTokenModifiers
  1598. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokenTypes.D:R:EnumBaseTypeSemanticTokenTypes
  1599. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokenTypes.Rep_SemanticTokenTypes
  1600. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokens.Rep_SemanticTokens
  1601. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TokenFormat.D:R:EnumBaseTypeTokenFormat
  1602. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensDelta.Rep_SemanticTokensDelta
  1603. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensEdit.Rep_SemanticTokensEdit
  1604. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensDeltaParams.Rep_SemanticTokensDeltaParams
  1605. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensDeltaPartialResult.Rep_SemanticTokensDeltaPartialResult
  1606. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensParams.Rep_SemanticTokensParams
  1607. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensPartialResult.Rep_SemanticTokensPartialResult
  1608. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SemanticTokensRangeParams.Rep_SemanticTokensRangeParams
  1609. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentSyncKind.D:R:EnumBaseTypeTextDocumentSyncKind
  1610. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SetTraceParams.Rep_SetTraceParams
  1611. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ShowDocumentParams.Rep_ShowDocumentParams
  1612. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ShowDocumentResult.Rep_ShowDocumentResult
  1613. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ShowMessageParams.Rep_ShowMessageParams
  1614. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.ShowMessageRequestParams.Rep_ShowMessageRequestParams
  1615. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelp.Rep_SignatureHelp
  1616. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureInformation.Rep_SignatureInformation
  1617. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelpContext.Rep_SignatureHelpContext
  1618. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelpTriggerKind.Rep_SignatureHelpTriggerKind
  1619. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelpTriggerKind.D:R:EnumBaseTypeSignatureHelpTriggerKind
  1620. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelpParams.Rep_SignatureHelpParams
  1621. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SignatureHelpRegistrationOptions.Rep_SignatureHelpRegistrationOptions
  1622. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.StaticRegistrationOptions.Rep_StaticRegistrationOptions
  1623. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.SymbolInformation.Rep_SymbolInformation
  1624. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentChangeRegistrationOptions.Rep_TextDocumentChangeRegistrationOptions
  1625. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentPositionParams.Rep_TextDocumentPositionParams
  1626. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentRegistrationOptions.Rep_TextDocumentRegistrationOptions
  1627. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentSaveReason.D:R:EnumBaseTypeTextDocumentSaveReason
  1628. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentSaveReason.Rep_TextDocumentSaveReason
  1629. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TextDocumentSaveRegistrationOptions.Rep_TextDocumentSaveRegistrationOptions
  1630. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeDefinitionParams.Rep_TypeDefinitionParams
  1631. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeHierarchyItem.Rep_TypeHierarchyItem
  1632. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeHierarchyPrepareParams.Rep_TypeHierarchyPrepareParams
  1633. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeHierarchySubtypesParams.Rep_TypeHierarchySubtypesParams
  1634. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.TypeHierarchySupertypesParams.Rep_TypeHierarchySupertypesParams
  1635. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.UInitializeParams.Rep_UInitializeParams
  1636. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.Unregistration.Rep_Unregistration
  1637. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.UnregistrationParams.Rep_UnregistrationParams
  1638. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WillSaveTextDocumentParams.Rep_WillSaveTextDocumentParams
  1639. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkDoneProgressBegin.Rep_WorkDoneProgressBegin
  1640. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkDoneProgressCancelParams.Rep_WorkDoneProgressCancelParams
  1641. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkDoneProgressCreateParams.Rep_WorkDoneProgressCreateParams
  1642. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkDoneProgressEnd.Rep_WorkDoneProgressEnd
  1643. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkDoneProgressOptions.Rep_WorkDoneProgressOptions
  1644. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkDoneProgressParams.Rep_WorkDoneProgressParams
  1645. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkDoneProgressReport.Rep_WorkDoneProgressReport
  1646. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceDiagnosticParams.Rep_WorkspaceDiagnosticParams
  1647. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceDiagnosticReport.Rep_WorkspaceDiagnosticReport
  1648. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceDocumentDiagnosticReport.Rep_WorkspaceDocumentDiagnosticReport
  1649. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceFullDocumentDiagnosticReport.Rep_WorkspaceFullDocumentDiagnosticReport
  1650. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceUnchangedDocumentDiagnosticReport.Rep_WorkspaceUnchangedDocumentDiagnosticReport
  1651. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceDiagnosticReportPartialResult.Rep_WorkspaceDiagnosticReportPartialResult
  1652. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceFoldersInitializeParams.Rep_WorkspaceFoldersInitializeParams
  1653. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceSymbol.Rep_WorkspaceSymbol
  1654. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceSymbolParams.Rep_WorkspaceSymbolParams
  1655. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Internal.Types.WorkspaceSymbolRegistrationOptions.Rep_WorkspaceSymbolRegistrationOptions
  1656. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.LspId.Rep_LspId
  1657. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.LspId.D:R:BaseMethodLspId
  1658. 1256.29 s [hls-test-utils] - Data.IxMap.Base
  1659. 1256.29 s [hls-test-utils] - Data.IxMap.IxOrd
  1660. 1256.29 s [hls-test-utils] - Data.IxMap.toBase
  1661. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Registration.Rep_TRegistration
  1662. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Registration.Rep_TUnregistration
  1663. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_NotificationMessage
  1664. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_RequestMessage
  1665. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_ResponseError
  1666. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_ResponseMessage
  1667. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_TNotificationMessage
  1668. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_TRequestMessage
  1669. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_TResponseError
  1670. 1256.29 s [hls-test-utils] - Language.LSP.Protocol.Message.Types.Rep_TResponseMessage
  1671. 1256.29 s [hls-test-utils] - Data.Vector.Primitive.Mutable.MVector
  1672. 1256.29 s [hls-test-utils] - Data.Vector.Generic.Base.basicUnsafeThaw
  1673. 1256.29 s [hls-test-utils] - Data.Vector.Unboxed.Base.V_Int32
  1674. 1256.29 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicClear
  1675. 1256.29 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicOverlaps
  1676. 1256.29 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeMove
  1677. 1256.29 s [hls-test-utils] - Data.Vector.Generic.Mutable.Base.basicUnsafeReplicate
  1678. 1256.29 s [hls-test-utils] - Data.Vector.Unboxed.Base.D:R:MVectorsInt320
  1679. 1256.29 s [hls-test-utils] - Data.Vector.Unboxed.Base.D:R:VectorInt320
  1680. 1256.29 s [hls-test-utils] - Language.LSP.VFS.HasCharacter
  1681. 1256.29 s [hls-test-utils] - Language.LSP.VFS.HasLine
  1682. 1256.29 s [hls-test-utils] - Language.LSP.VFS.HasLsp_version
  1683. 1256.29 s [hls-test-utils] - Language.LSP.VFS.HasVfsMap
  1684. 1260.91 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 )
  1685. 1261.27 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  1686. 1261.38 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1687. 1261.38 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  1688. 1261.38 s [vector] |
  1689. 1261.39 s [vector] 97 | deriving instance Typeable Vector
  1690. 1261.39 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1691. 1261.39 s [vector]
  1692. 1261.39 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  1693. 1261.39 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1694. 1261.39 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  1695. 1261.39 s [vector] |
  1696. 1261.39 s [vector] 98 | deriving instance Typeable MVector
  1697. 1261.39 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1698. 1261.39 s [vector]
  1699. 1270.58 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 )
  1700. 1281.85 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 )
  1701. 1282.92 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 )
  1702. 1283.14 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  1703. 1283.15 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 )
  1704. 1283.96 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 )
  1705. 1283.96 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  1706. 1283.96 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  1707. 1283.96 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 )
  1708. 1291.49 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  1709. 1295.64 s [hls-test-utils] Documentation created: dist/doc/html/hls-test-utils,
  1710. 1295.66 s [hls-test-utils] dist/doc/html/hls-test-utils/hls-test-utils.txt
  1711. 1295.87 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  1712. 1296.04 s [hls-test-utils] haddockPhase completed in 1 minutes 1 seconds
  1713. 1296.04 s [hls-test-utils] Phase: installPhase
  1714. 1296.32 s [hls-test-utils] Installing library in /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/hls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z
  1715. 1296.92 s [hls-test-utils] Phase: fixupPhase
  1716. 1296.96 s [hls-test-utils] shrinking RPATHs of ELF executables and libraries in /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0
  1717. 1296.96 s [hls-test-utils] shrinking /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z-ghc9.12.2.so
  1718. 1297.12 s [hls-test-utils] checking for references to /build/ in /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0...
  1719. 1297.15 s [hls-test-utils] patching script interpreter paths in /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0
  1720. 1297.16 s [hls-test-utils] stripping (with command strip and flags -S -p) in /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0/lib
  1721. 1297.26 s [hls-test-utils] shrinking RPATHs of ELF executables and libraries in /nix/store/wighxg07p8r8wr8n1p8lnv64f1xvh4n7-hls-test-utils-2.12.0.0-doc
  1722. 1297.28 s [hls-test-utils] checking for references to /build/ in /nix/store/wighxg07p8r8wr8n1p8lnv64f1xvh4n7-hls-test-utils-2.12.0.0-doc...
  1723. 1297.30 s [hls-test-utils] patching script interpreter paths in /nix/store/wighxg07p8r8wr8n1p8lnv64f1xvh4n7-hls-test-utils-2.12.0.0-doc
  1724. 1297.59 s [hls-test-utils:post-build] Uploading to cachix cache "sellout": /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0 /nix/store/wighxg07p8r8wr8n1p8lnv64f1xvh4n7-hls-test-utils-2.12.0.0-doc
  1725. 1298.25 s [hls-test-utils:post-build] Pushing 2 paths (442 are already present) using zstd to cache sellout ⏳
  1726. 1298.25 s [hls-test-utils:post-build]
  1727. 1298.62 s [hls-test-utils:post-build] Pushing /nix/store/wighxg07p8r8wr8n1p8lnv64f1xvh4n7-hls-test-utils-2.12.0.0-doc (24.16 MiB)
  1728. 1298.72 s [hls-test-utils:post-build] Pushing /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0 (6.38 MiB)
  1729. 1299.78 s [hls-test-utils:post-build]
  1730. 1299.78 s [hls-test-utils:post-build] All done.
  1731. 1299.85 s [hls-test-utils:post-build] Uploading to the NixCI cache: /nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0 /nix/store/wighxg07p8r8wr8n1p8lnv64f1xvh4n7-hls-test-utils-2.12.0.0-doc
  1732. 1299.94 s [hls-test-utils:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1733. 1300.21 s [hls-test-utils:post-build] copying 2 paths...
  1734. 1300.21 s [hls-test-utils:post-build] copying path '/nix/store/wighxg07p8r8wr8n1p8lnv64f1xvh4n7-hls-test-utils-2.12.0.0-doc' to 'https://cache.nix-ci.com'...
  1735. 1302.93 s [hls-test-utils:post-build] copying path '/nix/store/qmx5vd208qcilyd0ggf0n7fmk7bkavvc-hls-test-utils-2.12.0.0' to 'https://cache.nix-ci.com'...
  1736. 1306.12 s [hls-test-utils:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1737. 1306.46 s [hls-test-utils:post-build] copying 1 paths...
  1738. 1306.46 s [hls-test-utils:post-build] copying path '/nix/store/yc17azlngqw81rqbss15rgvw07h3w93f-hls-test-utils-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  1739. 1306.68 s Progress: 16 of 34 built (1 building), 593 of 593 downloaded from cache
  1740. 1306.89 s Building /nix/store/sns0bncs4hl9s78h8zgch64jfw4lf4i2-haskell-language-server-2.12.0.0.drv
  1741. 1306.89 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  1742. 1306.89 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  1743. 1308.12 s [haskell-language-server] Phase: setupCompilerEnvironmentPhase
  1744. 1308.12 s [haskell-language-server] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  1745. 1309.38 s [haskell-language-server] Phase: unpackPhase
  1746. 1309.39 s [haskell-language-server] unpacking source archive /nix/store/kqr4dg4wyp0h2dbm7y21zlbp3chihj6k-haskell-language-server-2.12.0.0.tar.gz
  1747. 1309.45 s [haskell-language-server] source root is haskell-language-server-2.12.0.0
  1748. 1309.50 s [haskell-language-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "haskell-language-server-2.12.0.0/test/wrapper/Main.hs"
  1749. 1309.51 s [haskell-language-server] Phase: patchPhase
  1750. 1309.57 s [haskell-language-server] Phase: compileBuildDriverPhase
  1751. 1309.58 s [haskell-language-server] setupCompileFlags: -package-db=/build/tmp.F7tfdzvpi6/setup-package.conf.d -threaded
  1752. 1309.67 s [haskell-language-server] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.F7tfdzvpi6/Main.o )
  1753. 1309.76 s [haskell-language-server] [2 of 2] Linking Setup
  1754. 1311.98 s [haskell-language-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  1755. 1312.01 s [haskell-language-server] Phase: configurePhase
  1756. 1312.06 s [haskell-language-server] configureFlags: --verbose --prefix=/nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.F7tfdzvpi6/package.conf.d --ghc-option=-optl=-Wl,-rpath=/nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/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/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  1757. 1312.12 s [haskell-language-server] Using Parsec parser
  1758. 1312.12 s [haskell-language-server] Configuring haskell-language-server-2.12.0.0...
  1759. 1312.18 s [haskell-language-server] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  1760. 1312.18 s [haskell-language-server] 'ghc' version < 9.12):
  1761. 1312.18 s [haskell-language-server] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  1762. 1312.18 s [haskell-language-server] 9.12.2
  1763. 1313.28 s [haskell-language-server] Flags chosen: alternatenumberformat=True, cabal=True, cabalfmt=True,
  1764. 1313.28 s [haskell-language-server] cabalgild=True, callhierarchy=True, changetypesignature=True, class=True,
  1765. 1313.30 s [haskell-language-server] coderange=True, dynamic=True, eval=True, explicitfields=True,
  1766. 1313.30 s [haskell-language-server] explicitfixity=True, floskell=True, fourmolu=True, gadt=True, ghc-lib=True,
  1767. 1313.30 s [haskell-language-server] ghcide-bench=True, hlint=True, ignore-plugins-ghc-bounds=False,
  1768. 1313.30 s [haskell-language-server] importlens=True, isolatecabalfmttests=False, isolatecabalgildtests=False,
  1769. 1313.30 s [haskell-language-server] modulename=True, notes=True, ormolu=True, overloadedrecorddot=True,
  1770. 1313.30 s [haskell-language-server] pedantic=False, pragmas=True, qualifyimportednames=True, refactor=True,
  1771. 1313.30 s [haskell-language-server] rename=True, retrie=True, semantictokens=True, signaturehelp=True,
  1772. 1313.30 s [haskell-language-server] splice=True, stan=True, stylishhaskell=True, test-exe=True
  1773. 1313.98 s [haskell-language-server] Dependency aeson-pretty: using aeson-pretty-0.8.10
  1774. 1313.98 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  1775. 1313.98 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  1776. 1313.98 s [haskell-language-server] Dependency directory: using directory-1.3.9.0
  1777. 1313.98 s [haskell-language-server] Dependency extra: using extra-1.8.1
  1778. 1313.98 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  1779. 1313.98 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  1780. 1313.98 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  1781. 1313.98 s [haskell-language-server] Dependency githash >=0.1.6.1: using githash-0.1.7.0
  1782. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1783. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1784. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1785. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1786. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1787. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1788. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1789. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1790. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1791. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1792. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1793. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1794. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1795. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1796. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1797. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1798. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1799. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1800. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1801. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1802. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1803. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1804. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1805. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1806. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1807. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1808. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1809. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1810. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1811. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1812. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1813. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1814. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1815. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1816. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1817. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1818. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1819. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1820. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1821. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1822. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1823. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1824. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1825. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1826. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1827. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1828. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1829. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1830. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1831. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1832. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1833. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1834. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1835. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1836. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1837. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1838. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1839. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1840. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1841. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1842. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1843. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1844. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1845. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1846. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1847. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1848. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1849. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1850. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1851. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1852. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1853. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1854. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1855. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1856. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1857. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1858. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1859. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1860. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1861. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1862. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1863. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1864. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1865. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1866. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1867. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1868. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1869. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1870. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1871. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1872. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1873. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1874. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1875. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1876. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1877. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1878. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1879. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1880. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1881. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1882. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1883. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1884. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1885. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1886. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1887. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1888. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1889. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1890. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1891. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1892. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1893. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1894. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1895. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1896. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1897. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1898. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1899. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1900. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1901. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1902. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1903. 1313.99 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1904. 1313.99 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1905. 1313.99 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1906. 1313.99 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1907. 1313.99 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1908. 1313.99 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1909. 1313.99 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1910. 1313.99 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1911. 1313.99 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1912. 1313.99 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1913. 1313.99 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1914. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1915. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1916. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1917. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1918. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1919. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1920. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1921. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1922. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1923. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1924. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1925. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1926. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1927. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1928. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1929. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1930. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1931. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1932. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1933. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1934. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1935. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1936. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1937. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1938. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1939. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1940. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1941. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1942. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1943. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1944. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1945. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1946. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1947. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1948. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1949. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1950. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1951. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1952. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1953. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1954. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1955. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1956. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1957. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1958. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1959. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1960. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1961. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1962. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1963. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1964. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1965. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1966. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1967. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1968. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1969. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1970. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1971. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1972. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1973. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1974. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1975. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1976. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1977. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1978. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1979. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1980. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1981. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1982. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1983. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1984. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1985. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1986. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1987. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1988. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  1989. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  1990. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  1991. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  1992. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  1993. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  1994. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  1995. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  1996. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  1997. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  1998. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  1999. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2000. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2001. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  2002. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2003. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2004. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2005. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2006. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2007. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2008. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2009. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2010. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2011. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2012. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  2013. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2014. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2015. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2016. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2017. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2018. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2019. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2020. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2021. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2022. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2023. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  2024. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2025. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2026. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2027. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2028. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2029. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2030. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2031. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2032. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2033. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2034. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  2035. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2036. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2037. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2038. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2039. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2040. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2041. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2042. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2043. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2044. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2045. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  2046. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2047. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2048. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2049. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2050. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2051. 1314.00 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2052. 1314.00 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2053. 1314.00 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2054. 1314.00 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2055. 1314.00 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2056. 1314.00 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  2057. 1314.00 s [haskell-language-server] Dependency haskell-language-server:{hls-alternate-number-format-plugin,
  2058. 1314.00 s [haskell-language-server] hls-cabal-fmt-plugin, hls-cabal-gild-plugin, hls-cabal-plugin,
  2059. 1314.00 s [haskell-language-server] hls-call-hierarchy-plugin, hls-change-type-signature-plugin, hls-class-plugin,
  2060. 1314.00 s [haskell-language-server] hls-code-range-plugin, hls-eval-plugin, hls-explicit-fixity-plugin,
  2061. 1314.00 s [haskell-language-server] hls-explicit-imports-plugin, hls-explicit-record-fields-plugin,
  2062. 1314.01 s [haskell-language-server] hls-fourmolu-plugin, hls-gadt-plugin, hls-hlint-plugin,
  2063. 1314.01 s [haskell-language-server] hls-module-name-plugin, hls-notes-plugin, hls-ormolu-plugin,
  2064. 1314.01 s [haskell-language-server] hls-overloaded-record-dot-plugin, hls-pragmas-plugin,
  2065. 1314.01 s [haskell-language-server] hls-qualify-imported-names-plugin, hls-refactor-plugin, hls-rename-plugin,
  2066. 1314.01 s [haskell-language-server] hls-semantic-tokens-plugin, hls-signature-help-plugin,
  2067. 1314.01 s [haskell-language-server] hls-stylish-haskell-plugin}: using haskell-language-server-2.12.0.0
  2068. 1314.01 s [haskell-language-server] Dependency hie-bios: using hie-bios-0.17.0
  2069. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2070. 1314.01 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  2071. 1314.01 s [haskell-language-server] Dependency optparse-simple: using optparse-simple-0.1.1.4
  2072. 1314.01 s [haskell-language-server] Dependency prettyprinter >=1.7: using prettyprinter-1.7.1
  2073. 1314.01 s [haskell-language-server] Dependency process: using process-1.6.25.0
  2074. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2075. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2076. 1314.01 s [haskell-language-server] Dependency directory: using directory-1.3.9.0
  2077. 1314.01 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2078. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2079. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2080. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2081. 1314.01 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2082. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2083. 1314.01 s [haskell-language-server] Dependency process-extras: using process-extras-0.7.4
  2084. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2085. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2086. 1314.01 s [haskell-language-server] Dependency directory: using directory-1.3.9.0
  2087. 1314.01 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2088. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2089. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2090. 1314.01 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2091. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2092. 1314.01 s [haskell-language-server] Dependency process-extras: using process-extras-0.7.4
  2093. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2094. 1314.01 s [haskell-language-server] Dependency Cabal: using Cabal-3.14.2.0
  2095. 1314.01 s [haskell-language-server] Dependency Cabal-syntax >=3.7: using Cabal-syntax-3.14.2.0
  2096. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2097. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2098. 1314.01 s [haskell-language-server] Dependency bytestring: using bytestring-0.12.2.0
  2099. 1314.01 s [haskell-language-server] Dependency cabal-add >=0.2 && <0.3: using cabal-add-0.2
  2100. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2101. 1314.01 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2102. 1314.01 s [haskell-language-server] Dependency directory: using directory-1.3.9.0
  2103. 1314.01 s [haskell-language-server] Dependency extra >=1.7.4: using extra-1.8.1
  2104. 1314.01 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2105. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2106. 1314.01 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2107. 1314.01 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  2108. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2109. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2110. 1314.01 s [haskell-language-server] Dependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
  2111. 1314.01 s [haskell-language-server] Dependency lsp-types >=2.3 && <2.4: using lsp-types-2.3.0.1
  2112. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2113. 1314.01 s [haskell-language-server] Dependency pretty: using pretty-1.1.3.6
  2114. 1314.01 s [haskell-language-server] Dependency regex-tdfa >=1.3.1 && <1.4: using regex-tdfa-1.3.2.5
  2115. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2116. 1314.01 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2117. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2118. 1314.01 s [haskell-language-server] Dependency unordered-containers >=0.2.10.0: using
  2119. 1314.01 s [haskell-language-server] unordered-containers-0.2.20.1
  2120. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2121. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2122. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2123. 1314.01 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2124. 1314.01 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2125. 1314.01 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2126. 1314.01 s [haskell-language-server] Dependency ghc-exactprint >=1.5 && <1.13.0.0: using ghc-exactprint-1.12.0.0
  2127. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2128. 1314.01 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2129. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2130. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2131. 1314.01 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2132. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2133. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2134. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2135. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2136. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2137. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2138. 1314.01 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2139. 1314.01 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2140. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2141. 1314.01 s [haskell-language-server] Dependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
  2142. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2143. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2144. 1314.01 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  2145. 1314.01 s [haskell-language-server] Dependency sqlite-simple: using sqlite-simple-0.4.19.0
  2146. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2147. 1314.01 s [haskell-language-server] Dependency Diff >=0.5 && <0.6 || >=1.0.0 && <1.1: using Diff-1.0.2
  2148. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2149. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2150. 1314.01 s [haskell-language-server] Dependency bytestring: using bytestring-0.12.2.0
  2151. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2152. 1314.01 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2153. 1314.01 s [haskell-language-server] Dependency dlist: using dlist-1.0
  2154. 1314.01 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2155. 1314.01 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2156. 1314.01 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2157. 1314.01 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.12.2
  2158. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2159. 1314.01 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2160. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2161. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2162. 1314.01 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2163. 1314.01 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2164. 1314.01 s [haskell-language-server] Dependency megaparsec >=9.0: using megaparsec-9.7.0
  2165. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2166. 1314.01 s [haskell-language-server] Dependency parser-combinators >=1.2: using parser-combinators-1.3.0
  2167. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2168. 1314.01 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2169. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2170. 1314.01 s [haskell-language-server] Dependency unliftio: using unliftio-0.2.25.1
  2171. 1314.01 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2172. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2173. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2174. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2175. 1314.01 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2176. 1314.01 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2177. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2178. 1314.01 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2179. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2180. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2181. 1314.01 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2182. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2183. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2184. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2185. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2186. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2187. 1314.01 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2188. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2189. 1314.01 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2190. 1314.01 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  2191. 1314.01 s [haskell-language-server] haskell-language-server-2.12.0.0
  2192. 1314.01 s [haskell-language-server] Dependency hiedb >=0.7.0.0 && <0.8: using hiedb-0.7.0.0
  2193. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2194. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2195. 1314.01 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2196. 1314.01 s [haskell-language-server] Dependency mod: using mod-0.2.1.0
  2197. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2198. 1314.01 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2199. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2200. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2201. 1314.01 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2202. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2203. 1314.01 s [haskell-language-server] Dependency apply-refact: using apply-refact-0.15.0.0
  2204. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2205. 1314.01 s [haskell-language-server] Dependency bytestring: using bytestring-0.12.2.0
  2206. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2207. 1314.01 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2208. 1314.01 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2209. 1314.01 s [haskell-language-server] Dependency ghc-lib-parser: using ghc-lib-parser-9.12.2.20250421
  2210. 1314.01 s [haskell-language-server] Dependency ghc-lib-parser-ex: using ghc-lib-parser-ex-9.12.0.0
  2211. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2212. 1314.01 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2213. 1314.01 s [haskell-language-server] Dependency hlint >=3.5 && <3.11: using hlint-3.10
  2214. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2215. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2216. 1314.01 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2217. 1314.01 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2218. 1314.01 s [haskell-language-server] Dependency refact: using refact-0.3.0.2
  2219. 1314.01 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  2220. 1314.01 s [haskell-language-server] Dependency stm: using stm-2.5.3.1
  2221. 1314.01 s [haskell-language-server] Dependency temporary: using temporary-1.3
  2222. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2223. 1314.01 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2224. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2225. 1314.01 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2226. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2227. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2228. 1314.01 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2229. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2230. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2231. 1314.01 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2232. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2233. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2234. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2235. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2236. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2237. 1314.01 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2238. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2239. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2240. 1314.01 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2241. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2242. 1314.01 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2243. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2244. 1314.01 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2245. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2246. 1314.01 s [haskell-language-server] Dependency containers: using containers-0.7
  2247. 1314.01 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2248. 1314.01 s [haskell-language-server] Dependency fuzzy: using fuzzy-0.1.1.0
  2249. 1314.01 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2250. 1314.01 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2251. 1314.01 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2252. 1314.01 s [haskell-language-server] Dependency lens-aeson: using lens-aeson-1.2.3
  2253. 1314.01 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2254. 1314.01 s [haskell-language-server] Dependency text: using text-2.1.2
  2255. 1314.01 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2256. 1314.01 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2257. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2258. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2259. 1314.02 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.12.2
  2260. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2261. 1314.02 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2262. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2263. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2264. 1314.02 s [haskell-language-server] Dependency lsp >=2.7 && <2.8: using lsp-2.7.0.1
  2265. 1314.02 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2266. 1314.02 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  2267. 1314.02 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2268. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2269. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2270. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2271. 1314.02 s [haskell-language-server] Dependency dlist: using dlist-1.0
  2272. 1314.02 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2273. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2274. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2275. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2276. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2277. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2278. 1314.02 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2279. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2280. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2281. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2282. 1314.02 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2283. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2284. 1314.02 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2285. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2286. 1314.02 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2287. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2288. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2289. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2290. 1314.02 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2291. 1314.02 s [haskell-language-server] Dependency semigroupoids: using semigroupoids-6.0.1
  2292. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2293. 1314.02 s [haskell-language-server] Dependency vector: using vector-0.13.2.0
  2294. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2295. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2296. 1314.02 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2297. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2298. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2299. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2300. 1314.02 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2301. 1314.02 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  2302. 1314.02 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2303. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2304. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2305. 1314.02 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2306. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2307. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2308. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2309. 1314.02 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2310. 1314.02 s [haskell-language-server] Dependency ghc-exactprint: using ghc-exactprint-1.12.0.0
  2311. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2312. 1314.02 s [haskell-language-server] Dependency haskell-language-server:hls-refactor-plugin: using
  2313. 1314.02 s [haskell-language-server] haskell-language-server-2.12.0.0
  2314. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2315. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2316. 1314.02 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  2317. 1314.02 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2318. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2319. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2320. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2321. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2322. 1314.02 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2323. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2324. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2325. 1314.02 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2326. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2327. 1314.02 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  2328. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2329. 1314.02 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2330. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2331. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2332. 1314.02 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2333. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2334. 1314.02 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2335. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2336. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2337. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2338. 1314.02 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2339. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2340. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2341. 1314.02 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2342. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2343. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2344. 1314.02 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2345. 1314.02 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  2346. 1314.02 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2347. 1314.02 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  2348. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2349. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2350. 1314.02 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2351. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2352. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2353. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2354. 1314.02 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2355. 1314.02 s [haskell-language-server] Dependency fourmolu >=0.14 && <0.20: using fourmolu-0.19.0.1
  2356. 1314.02 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.12.2
  2357. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2358. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2359. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2360. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2361. 1314.02 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2362. 1314.02 s [haskell-language-server] Dependency process-extras >=0.7.1: using process-extras-0.7.4
  2363. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2364. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2365. 1314.02 s [haskell-language-server] Dependency yaml: using yaml-0.11.11.2
  2366. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2367. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2368. 1314.02 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2369. 1314.02 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.12.2
  2370. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2371. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2372. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2373. 1314.02 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2374. 1314.02 s [haskell-language-server] Dependency ormolu >=0.5.3 && <0.9: using ormolu-0.8.0.2
  2375. 1314.02 s [haskell-language-server] Dependency process-extras >=0.7.1: using process-extras-0.7.4
  2376. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2377. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2378. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2379. 1314.02 s [haskell-language-server] Dependency directory: using directory-1.3.9.0
  2380. 1314.02 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2381. 1314.02 s [haskell-language-server] Dependency ghc-boot-th: using ghc-boot-th-9.12.2
  2382. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2383. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2384. 1314.02 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2385. 1314.02 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2386. 1314.02 s [haskell-language-server] Dependency stylish-haskell >=0.12 && <0.16: using stylish-haskell-0.15.1.0
  2387. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2388. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2389. 1314.02 s [haskell-language-server] Dependency bytestring: using bytestring-0.12.2.0
  2390. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2391. 1314.02 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2392. 1314.02 s [haskell-language-server] Dependency dlist: using dlist-1.0
  2393. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2394. 1314.02 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2395. 1314.02 s [haskell-language-server] Dependency ghc-boot: using ghc-boot-9.12.2
  2396. 1314.02 s [haskell-language-server] Dependency ghc-exactprint <1 || >=1.4: using ghc-exactprint-1.12.0.0
  2397. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2398. 1314.02 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2399. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2400. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2401. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2402. 1314.02 s [haskell-language-server] Dependency mtl: using mtl-2.3.1
  2403. 1314.02 s [haskell-language-server] Dependency parser-combinators: using parser-combinators-1.3.0
  2404. 1314.02 s [haskell-language-server] Dependency regex-applicative: using regex-applicative-0.3.4
  2405. 1314.02 s [haskell-language-server] Dependency regex-tdfa: using regex-tdfa-1.3.2.5
  2406. 1314.02 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2407. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2408. 1314.02 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2409. 1314.02 s [haskell-language-server] Dependency time: using time-1.14
  2410. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2411. 1314.02 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2412. 1314.02 s [haskell-language-server] Dependency array: using array-0.5.8.0
  2413. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2414. 1314.02 s [haskell-language-server] Dependency bytestring: using bytestring-0.12.2.0
  2415. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2416. 1314.02 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  2417. 1314.02 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2418. 1314.02 s [haskell-language-server] Dependency dlist: using dlist-1.0
  2419. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2420. 1314.02 s [haskell-language-server] Dependency ghc: using ghc-9.12.2
  2421. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2422. 1314.02 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  2423. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2424. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2425. 1314.02 s [haskell-language-server] Dependency lsp >=2.6: using lsp-2.7.0.1
  2426. 1314.02 s [haskell-language-server] Dependency mtl >=2.2: using mtl-2.3.1
  2427. 1314.02 s [haskell-language-server] Dependency stm: using stm-2.5.3.1
  2428. 1314.02 s [haskell-language-server] Dependency stm-containers: using stm-containers-1.2.1.1
  2429. 1314.02 s [haskell-language-server] Dependency syb: using syb-0.7.2.4
  2430. 1314.02 s [haskell-language-server] Dependency template-haskell: using template-haskell-2.23.0.0
  2431. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2432. 1314.02 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2433. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2434. 1314.02 s [haskell-language-server] Dependency array: using array-0.5.8.0
  2435. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2436. 1314.02 s [haskell-language-server] Dependency ghcide ==2.12.0.0: using ghcide-2.12.0.0
  2437. 1314.02 s [haskell-language-server] Dependency hls-graph ==2.12.0.0: using hls-graph-2.12.0.0
  2438. 1314.02 s [haskell-language-server] Dependency hls-plugin-api ==2.12.0.0: using hls-plugin-api-2.12.0.0
  2439. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2440. 1314.02 s [haskell-language-server] Dependency lsp >=2.7: using lsp-2.7.0.1
  2441. 1314.02 s [haskell-language-server] Dependency mtl >=2.2: using mtl-2.3.1
  2442. 1314.02 s [haskell-language-server] Dependency regex-tdfa >=1.3.1: using regex-tdfa-1.3.2.5
  2443. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2444. 1314.02 s [haskell-language-server] Dependency text-rope: using text-rope-0.3
  2445. 1314.02 s [haskell-language-server] Dependency unordered-containers: using unordered-containers-0.2.20.1
  2446. 1314.02 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2447. 1314.02 s [haskell-language-server] Dependency async: using async-2.2.5
  2448. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2449. 1314.02 s [haskell-language-server] Dependency binary: using binary-0.8.9.3
  2450. 1314.02 s [haskell-language-server] Dependency bytestring: using bytestring-0.12.2.0
  2451. 1314.02 s [haskell-language-server] Dependency deepseq: using deepseq-1.5.1.0
  2452. 1314.02 s [haskell-language-server] Dependency directory: using directory-1.3.9.0
  2453. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2454. 1314.02 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2455. 1314.02 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  2456. 1314.02 s [haskell-language-server] Dependency hashable: using hashable-1.5.0.0
  2457. 1314.02 s [haskell-language-server] Dependency hls-test-utils: using hls-test-utils-2.12.0.0
  2458. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2459. 1314.02 s [haskell-language-server] Dependency lsp-test: using lsp-test-0.17.1.1
  2460. 1314.02 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2461. 1314.02 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  2462. 1314.02 s [haskell-language-server] Dependency parser-combinators: using parser-combinators-1.3.0
  2463. 1314.02 s [haskell-language-server] Dependency process: using process-1.6.25.0
  2464. 1314.02 s [haskell-language-server] Dependency row-types: using row-types-1.0.1.2
  2465. 1314.02 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  2466. 1314.02 s [haskell-language-server] Dependency shake: using shake-0.19.8
  2467. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2468. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2469. 1314.02 s [haskell-language-server] Dependency haskell-language-server: using haskell-language-server-2.12.0.0
  2470. 1314.02 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  2471. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2472. 1314.02 s [haskell-language-server] Dependency prettyprinter >=1.7: using prettyprinter-1.7.1
  2473. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2474. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2475. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2476. 1314.02 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  2477. 1314.02 s [haskell-language-server] Dependency directory: using directory-1.3.9.0
  2478. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2479. 1314.02 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2480. 1314.02 s [haskell-language-server] Dependency ghcide: using ghcide-2.12.0.0
  2481. 1314.02 s [haskell-language-server] Dependency haskell-language-server: using haskell-language-server-2.12.0.0
  2482. 1314.02 s [haskell-language-server] Dependency hie-bios: using hie-bios-0.17.0
  2483. 1314.02 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  2484. 1314.02 s [haskell-language-server] Dependency lsp: using lsp-2.7.0.1
  2485. 1314.02 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2486. 1314.02 s [haskell-language-server] Dependency text: using text-2.1.2
  2487. 1314.02 s [haskell-language-server] Dependency transformers: using transformers-0.6.1.2
  2488. 1314.02 s [haskell-language-server] Dependency unix: using unix-2.8.6.0
  2489. 1314.02 s [haskell-language-server] Dependency unliftio-core: using unliftio-core-0.2.1.0
  2490. 1314.02 s [haskell-language-server] Dependency base >=4 && <5: using base-4.21.0.0
  2491. 1314.02 s [haskell-language-server] Dependency aeson: using aeson-2.2.3.0
  2492. 1314.02 s [haskell-language-server] Dependency base >=4.12 && <5: using base-4.21.0.0
  2493. 1314.02 s [haskell-language-server] Dependency bytestring: using bytestring-0.12.2.0
  2494. 1314.02 s [haskell-language-server] Dependency containers: using containers-0.7
  2495. 1314.02 s [haskell-language-server] Dependency data-default: using data-default-0.8.0.1
  2496. 1314.02 s [haskell-language-server] Dependency extra: using extra-1.8.1
  2497. 1314.02 s [haskell-language-server] Dependency filepath: using filepath-1.5.4.0
  2498. 1314.02 s [haskell-language-server] Dependency haskell-language-server:ghcide-bench-lib: using
  2499. 1314.02 s [haskell-language-server] haskell-language-server-2.12.0.0
  2500. 1314.02 s [haskell-language-server] Dependency hls-graph: using hls-graph-2.12.0.0
  2501. 1314.02 s [haskell-language-server] Dependency hls-plugin-api: using hls-plugin-api-2.12.0.0
  2502. 1314.02 s [haskell-language-server] Dependency hls-test-utils: using hls-test-utils-2.12.0.0
  2503. 1314.02 s [haskell-language-server] Dependency lens: using lens-5.3.5
  2504. 1314.02 s [haskell-language-server] Dependency lsp-test: using lsp-test-0.17.1.1
  2505. 1314.03 s [haskell-language-server] Dependency lsp-types: using lsp-types-2.3.0.1
  2506. 1314.03 s [haskell-language-server] Dependency optparse-applicative: using optparse-applicative-0.18.1.0
  2507. 1314.03 s [haskell-language-server] Dependency process: using process-1.6.25.0
  2508. 1314.03 s [haskell-language-server] Dependency safe-exceptions: using safe-exceptions-0.1.7.4
  2509. 1314.03 s [haskell-language-server] Dependency shake: using shake-0.19.8
  2510. 1314.03 s [haskell-language-server] Dependency tasty-hunit >=0.10: using tasty-hunit-0.10.2
  2511. 1314.03 s [haskell-language-server] Dependency text: using text-2.1.2
  2512. 1314.03 s [haskell-language-server] Source component graph:
  2513. 1314.03 s [haskell-language-server] component exe:ghcide-test-preprocessor
  2514. 1314.03 s [haskell-language-server] component lib:hls-stylish-haskell-plugin
  2515. 1314.03 s [haskell-language-server] component lib:hls-signature-help-plugin
  2516. 1314.03 s [haskell-language-server] component lib:hls-semantic-tokens-plugin
  2517. 1314.03 s [haskell-language-server] component lib:hls-refactor-plugin
  2518. 1314.03 s [haskell-language-server] component lib:hls-rename-plugin dependency lib:hls-refactor-plugin
  2519. 1314.03 s [haskell-language-server] component lib:hls-qualify-imported-names-plugin
  2520. 1314.03 s [haskell-language-server] component lib:hls-pragmas-plugin
  2521. 1314.03 s [haskell-language-server] component lib:hls-overloaded-record-dot-plugin
  2522. 1314.03 s [haskell-language-server] component lib:hls-ormolu-plugin
  2523. 1314.03 s [haskell-language-server] component lib:hls-notes-plugin
  2524. 1314.03 s [haskell-language-server] component lib:hls-module-name-plugin
  2525. 1314.03 s [haskell-language-server] component lib:hls-hlint-plugin
  2526. 1314.03 s [haskell-language-server] component lib:hls-gadt-plugin dependency lib:hls-refactor-plugin
  2527. 1314.03 s [haskell-language-server] component lib:hls-fourmolu-plugin
  2528. 1314.03 s [haskell-language-server] component lib:hls-explicit-record-fields-plugin
  2529. 1314.03 s [haskell-language-server] component lib:hls-explicit-imports-plugin
  2530. 1314.03 s [haskell-language-server] component lib:hls-explicit-fixity-plugin
  2531. 1314.03 s [haskell-language-server] component lib:hls-eval-plugin
  2532. 1314.03 s [haskell-language-server] component lib:hls-code-range-plugin
  2533. 1314.03 s [haskell-language-server] component lib:hls-class-plugin
  2534. 1314.03 s [haskell-language-server] component lib:hls-change-type-signature-plugin
  2535. 1314.03 s [haskell-language-server] component lib:hls-call-hierarchy-plugin
  2536. 1314.03 s [haskell-language-server] component lib:hls-cabal-plugin
  2537. 1314.03 s [haskell-language-server] component lib:hls-cabal-gild-plugin
  2538. 1314.03 s [haskell-language-server] component lib:hls-cabal-fmt-plugin
  2539. 1314.03 s [haskell-language-server] component lib:hls-alternate-number-format-plugin
  2540. 1314.03 s [haskell-language-server] component lib:ghcide-bench-lib
  2541. 1314.03 s [haskell-language-server] component exe:ghcide-bench dependency lib:ghcide-bench-lib
  2542. 1314.03 s [haskell-language-server] component lib
  2543. 1314.03 s [haskell-language-server] dependency lib:hls-alternate-number-format-plugin
  2544. 1314.03 s [haskell-language-server] dependency lib:hls-cabal-fmt-plugin
  2545. 1314.03 s [haskell-language-server] dependency lib:hls-cabal-gild-plugin
  2546. 1314.03 s [haskell-language-server] dependency lib:hls-cabal-plugin
  2547. 1314.03 s [haskell-language-server] dependency lib:hls-call-hierarchy-plugin
  2548. 1314.03 s [haskell-language-server] dependency lib:hls-change-type-signature-plugin
  2549. 1314.03 s [haskell-language-server] dependency lib:hls-class-plugin
  2550. 1314.03 s [haskell-language-server] dependency lib:hls-code-range-plugin
  2551. 1314.03 s [haskell-language-server] dependency lib:hls-eval-plugin
  2552. 1314.03 s [haskell-language-server] dependency lib:hls-explicit-fixity-plugin
  2553. 1314.03 s [haskell-language-server] dependency lib:hls-explicit-imports-plugin
  2554. 1314.03 s [haskell-language-server] dependency lib:hls-explicit-record-fields-plugin
  2555. 1314.03 s [haskell-language-server] dependency lib:hls-fourmolu-plugin
  2556. 1314.03 s [haskell-language-server] dependency lib:hls-gadt-plugin
  2557. 1314.03 s [haskell-language-server] dependency lib:hls-hlint-plugin
  2558. 1314.03 s [haskell-language-server] dependency lib:hls-module-name-plugin
  2559. 1314.03 s [haskell-language-server] dependency lib:hls-notes-plugin
  2560. 1314.03 s [haskell-language-server] dependency lib:hls-ormolu-plugin
  2561. 1314.03 s [haskell-language-server] dependency lib:hls-overloaded-record-dot-plugin
  2562. 1314.03 s [haskell-language-server] dependency lib:hls-pragmas-plugin
  2563. 1314.03 s [haskell-language-server] dependency lib:hls-qualify-imported-names-plugin
  2564. 1314.03 s [haskell-language-server] dependency lib:hls-refactor-plugin
  2565. 1314.03 s [haskell-language-server] dependency lib:hls-rename-plugin
  2566. 1314.03 s [haskell-language-server] dependency lib:hls-semantic-tokens-plugin
  2567. 1314.03 s [haskell-language-server] dependency lib:hls-signature-help-plugin
  2568. 1314.03 s [haskell-language-server] dependency lib:hls-stylish-haskell-plugin
  2569. 1314.03 s [haskell-language-server] component exe:haskell-language-server dependency lib
  2570. 1314.03 s [haskell-language-server] component exe:haskell-language-server-wrapper dependency lib
  2571. 1314.03 s [haskell-language-server] Configured component graph:
  2572. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-9IydNLTUE50JFjX49QzBBp-ghcide-test-preprocessor
  2573. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2574. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin
  2575. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2576. 1314.03 s [haskell-language-server] include directory-1.3.9.0-d362
  2577. 1314.03 s [haskell-language-server] include filepath-1.5.4.0-7227
  2578. 1314.03 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  2579. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2580. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2581. 1314.03 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2582. 1314.03 s [haskell-language-server] include mtl-2.3.1-34eb
  2583. 1314.03 s [haskell-language-server] include stylish-haskell-0.15.1.0-5cAcK9XP68m3ahqPV8qpuK
  2584. 1314.03 s [haskell-language-server] include text-2.1.2-e822
  2585. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin
  2586. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2587. 1314.03 s [haskell-language-server] include containers-0.7-d79e
  2588. 1314.03 s [haskell-language-server] include ghc-9.12.2-82d3
  2589. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2590. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2591. 1314.03 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2592. 1314.03 s [haskell-language-server] include text-2.1.2-e822
  2593. 1314.03 s [haskell-language-server] include transformers-0.6.1.2-2558
  2594. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin
  2595. 1314.03 s [haskell-language-server] include array-0.5.8.0-d6d4
  2596. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2597. 1314.03 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  2598. 1314.03 s [haskell-language-server] include containers-0.7-d79e
  2599. 1314.03 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  2600. 1314.03 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2601. 1314.03 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  2602. 1314.03 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2603. 1314.03 s [haskell-language-server] include ghc-9.12.2-82d3
  2604. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2605. 1314.03 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2606. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2607. 1314.03 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2608. 1314.03 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2609. 1314.03 s [haskell-language-server] include mtl-2.3.1-34eb
  2610. 1314.03 s [haskell-language-server] include stm-2.5.3.1-ef8d
  2611. 1314.03 s [haskell-language-server] include stm-containers-1.2.1.1-Ix4DymiEOgrJ3xwWamk6U4
  2612. 1314.03 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  2613. 1314.03 s [haskell-language-server] include template-haskell-2.23.0.0-4ee9
  2614. 1314.03 s [haskell-language-server] include text-2.1.2-e822
  2615. 1314.03 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2616. 1314.03 s [haskell-language-server] include transformers-0.6.1.2-2558
  2617. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  2618. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2619. 1314.03 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  2620. 1314.03 s [haskell-language-server] include containers-0.7-d79e
  2621. 1314.03 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2622. 1314.03 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  2623. 1314.03 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2624. 1314.03 s [haskell-language-server] include ghc-9.12.2-82d3
  2625. 1314.03 s [haskell-language-server] include ghc-boot-9.12.2-d17a
  2626. 1314.03 s [haskell-language-server] include ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  2627. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2628. 1314.03 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2629. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2630. 1314.03 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2631. 1314.03 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2632. 1314.03 s [haskell-language-server] include mtl-2.3.1-34eb
  2633. 1314.03 s [haskell-language-server] include parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  2634. 1314.03 s [haskell-language-server] include regex-applicative-0.3.4-CnW24tC17yJ4pR2cvFEpth
  2635. 1314.03 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  2636. 1314.03 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  2637. 1314.03 s [haskell-language-server] include text-2.1.2-e822
  2638. 1314.03 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2639. 1314.03 s [haskell-language-server] include time-1.14-3dc5
  2640. 1314.03 s [haskell-language-server] include transformers-0.6.1.2-2558
  2641. 1314.03 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  2642. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin
  2643. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2644. 1314.03 s [haskell-language-server] include containers-0.7-d79e
  2645. 1314.03 s [haskell-language-server] include ghc-9.12.2-82d3
  2646. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2647. 1314.03 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  2648. 1314.03 s [haskell-language-server] include haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  2649. 1314.03 s [haskell-language-server] include hiedb-0.7.0.0-BeNR23mZ9Vu112pqx17YPe
  2650. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2651. 1314.03 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2652. 1314.03 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2653. 1314.03 s [haskell-language-server] include mod-0.2.1.0-7uXAIxkOb3ELuaOatpnaWP
  2654. 1314.03 s [haskell-language-server] include mtl-2.3.1-34eb
  2655. 1314.03 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  2656. 1314.03 s [haskell-language-server] include text-2.1.2-e822
  2657. 1314.03 s [haskell-language-server] include transformers-0.6.1.2-2558
  2658. 1314.03 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  2659. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin
  2660. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2661. 1314.03 s [haskell-language-server] include containers-0.7-d79e
  2662. 1314.03 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  2663. 1314.03 s [haskell-language-server] include ghc-9.12.2-82d3
  2664. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2665. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2666. 1314.03 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2667. 1314.03 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2668. 1314.03 s [haskell-language-server] include text-2.1.2-e822
  2669. 1314.03 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2670. 1314.03 s [haskell-language-server] include transformers-0.6.1.2-2558
  2671. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin
  2672. 1314.03 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2673. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2674. 1314.03 s [haskell-language-server] include containers-0.7-d79e
  2675. 1314.03 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2676. 1314.03 s [haskell-language-server] include fuzzy-0.1.1.0-DNFDL5yrkjA6gY3KEuHuop
  2677. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2678. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2679. 1314.03 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2680. 1314.03 s [haskell-language-server] include lens-aeson-1.2.3-D9txcsrhmkMJad9PAbqkUy
  2681. 1314.03 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2682. 1314.03 s [haskell-language-server] include text-2.1.2-e822
  2683. 1314.03 s [haskell-language-server] include transformers-0.6.1.2-2558
  2684. 1314.03 s [haskell-language-server] component haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin
  2685. 1314.03 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2686. 1314.03 s [haskell-language-server] include base-4.21.0.0-b334
  2687. 1314.03 s [haskell-language-server] include containers-0.7-d79e
  2688. 1314.03 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2689. 1314.03 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2690. 1314.03 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2691. 1314.03 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2692. 1314.03 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2693. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2694. 1314.04 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  2695. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2696. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2697. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin
  2698. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2699. 1314.04 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2700. 1314.04 s [haskell-language-server] include filepath-1.5.4.0-7227
  2701. 1314.04 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  2702. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2703. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2704. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2705. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2706. 1314.04 s [haskell-language-server] include ormolu-0.8.0.2-LLnfiREhmrq40cRMQjaElz
  2707. 1314.04 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  2708. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2709. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2710. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin
  2711. 1314.04 s [haskell-language-server] include array-0.5.8.0-d6d4
  2712. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2713. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2714. 1314.04 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2715. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2716. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2717. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2718. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2719. 1314.04 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  2720. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2721. 1314.04 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2722. 1314.04 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  2723. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin
  2724. 1314.04 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2725. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2726. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2727. 1314.04 s [haskell-language-server] include filepath-1.5.4.0-7227
  2728. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2729. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2730. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2731. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2732. 1314.04 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2733. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2734. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin
  2735. 1314.04 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2736. 1314.04 s [haskell-language-server] include apply-refact-0.15.0.0-Jj1PB0lLeIn7ALllR84csn
  2737. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2738. 1314.04 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  2739. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2740. 1314.04 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2741. 1314.04 s [haskell-language-server] include filepath-1.5.4.0-7227
  2742. 1314.04 s [haskell-language-server] include ghc-lib-parser-9.12.2.20250421-JdFAKZEOaaDLfCSCCmyiy
  2743. 1314.04 s [haskell-language-server] include ghc-lib-parser-ex-9.12.0.0-CaGeB6qlx0HBYyQlDkzcv0
  2744. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2745. 1314.04 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  2746. 1314.04 s [haskell-language-server] include hlint-3.10-6jbnfM2awuF1VndKpOi3gp
  2747. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2748. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2749. 1314.04 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2750. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2751. 1314.04 s [haskell-language-server] include refact-0.3.0.2-42YY7SYlH2c7tyNm48xWdH
  2752. 1314.04 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  2753. 1314.04 s [haskell-language-server] include stm-2.5.3.1-ef8d
  2754. 1314.04 s [haskell-language-server] include temporary-1.3-I5meYVLbAKnISmSvrAOHql
  2755. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2756. 1314.04 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2757. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2758. 1314.04 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  2759. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin
  2760. 1314.04 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2761. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2762. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2763. 1314.04 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2764. 1314.04 s [haskell-language-server] include ghc-9.12.2-82d3
  2765. 1314.04 s [haskell-language-server] include ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  2766. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2767. 1314.04 s [haskell-language-server] include haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  2768. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2769. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2770. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2771. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2772. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2773. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2774. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin
  2775. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2776. 1314.04 s [haskell-language-server] include filepath-1.5.4.0-7227
  2777. 1314.04 s [haskell-language-server] include fourmolu-0.19.0.1-E1HGPzt9qzFLEH1UfXk1Md
  2778. 1314.04 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  2779. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2780. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2781. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2782. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2783. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2784. 1314.04 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  2785. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2786. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2787. 1314.04 s [haskell-language-server] include yaml-0.11.11.2-Avz2Evr20WOICFQJEF6pIN
  2788. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin
  2789. 1314.04 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2790. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2791. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2792. 1314.04 s [haskell-language-server] include ghc-9.12.2-82d3
  2793. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2794. 1314.04 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2795. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2796. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2797. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2798. 1314.04 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  2799. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2800. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2801. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin
  2802. 1314.04 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2803. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2804. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2805. 1314.04 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2806. 1314.04 s [haskell-language-server] include ghc-9.12.2-82d3
  2807. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2808. 1314.04 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2809. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2810. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2811. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2812. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2813. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2814. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2815. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin
  2816. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2817. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2818. 1314.04 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2819. 1314.04 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2820. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2821. 1314.04 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  2822. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2823. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2824. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2825. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin
  2826. 1314.04 s [haskell-language-server] include Diff-1.0.2-3phO2I8WyVvJLcWyUtZ91A
  2827. 1314.04 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2828. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2829. 1314.04 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  2830. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2831. 1314.04 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2832. 1314.04 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  2833. 1314.04 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2834. 1314.04 s [haskell-language-server] include filepath-1.5.4.0-7227
  2835. 1314.04 s [haskell-language-server] include ghc-9.12.2-82d3
  2836. 1314.04 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  2837. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2838. 1314.04 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2839. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2840. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2841. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2842. 1314.04 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2843. 1314.04 s [haskell-language-server] include megaparsec-9.7.0-CIN6p7tiEq89SZ2kyHf3f9
  2844. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2845. 1314.04 s [haskell-language-server] include parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  2846. 1314.04 s [haskell-language-server] include text-2.1.2-e822
  2847. 1314.04 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2848. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2849. 1314.04 s [haskell-language-server] include unliftio-0.2.25.1-FtFGlONQcrmFKgodpXp7Pt
  2850. 1314.04 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  2851. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin
  2852. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2853. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2854. 1314.04 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2855. 1314.04 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2856. 1314.04 s [haskell-language-server] include ghc-9.12.2-82d3
  2857. 1314.04 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2858. 1314.04 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  2859. 1314.04 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2860. 1314.04 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2861. 1314.04 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2862. 1314.04 s [haskell-language-server] include mtl-2.3.1-34eb
  2863. 1314.04 s [haskell-language-server] include semigroupoids-6.0.1-9Aovgo6K4sLD8nVtf5DdJj
  2864. 1314.04 s [haskell-language-server] include transformers-0.6.1.2-2558
  2865. 1314.04 s [haskell-language-server] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  2866. 1314.04 s [haskell-language-server] component haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin
  2867. 1314.04 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2868. 1314.04 s [haskell-language-server] include base-4.21.0.0-b334
  2869. 1314.04 s [haskell-language-server] include containers-0.7-d79e
  2870. 1314.05 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2871. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2872. 1314.05 s [haskell-language-server] include ghc-9.12.2-82d3
  2873. 1314.05 s [haskell-language-server] include ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  2874. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2875. 1314.05 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2876. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2877. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2878. 1314.05 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2879. 1314.05 s [haskell-language-server] include mtl-2.3.1-34eb
  2880. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2881. 1314.05 s [haskell-language-server] include transformers-0.6.1.2-2558
  2882. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin
  2883. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2884. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  2885. 1314.05 s [haskell-language-server] include ghc-9.12.2-82d3
  2886. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2887. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2888. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2889. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2890. 1314.05 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  2891. 1314.05 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  2892. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2893. 1314.05 s [haskell-language-server] include transformers-0.6.1.2-2558
  2894. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin
  2895. 1314.05 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2896. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2897. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  2898. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2899. 1314.05 s [haskell-language-server] include ghc-9.12.2-82d3
  2900. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2901. 1314.05 s [haskell-language-server] include hiedb-0.7.0.0-BeNR23mZ9Vu112pqx17YPe
  2902. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2903. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2904. 1314.05 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2905. 1314.05 s [haskell-language-server] include sqlite-simple-0.4.19.0-B9FaAQEUGQTEVTlqzfqc1v
  2906. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2907. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin
  2908. 1314.05 s [haskell-language-server] include Cabal-3.14.2.0-12wmWDuamw72aCWt0RdJaU
  2909. 1314.05 s [haskell-language-server] include Cabal-syntax-3.14.2.0-AOyEamcr8b2H0umx9ZrHLI
  2910. 1314.05 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2911. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2912. 1314.05 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  2913. 1314.05 s [haskell-language-server] include cabal-add-0.2-fOzb4nEYGqKR75X3Xo9Dh
  2914. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  2915. 1314.05 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2916. 1314.05 s [haskell-language-server] include directory-1.3.9.0-d362
  2917. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2918. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  2919. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2920. 1314.05 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  2921. 1314.05 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2922. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2923. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2924. 1314.05 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2925. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2926. 1314.05 s [haskell-language-server] include mtl-2.3.1-34eb
  2927. 1314.05 s [haskell-language-server] include pretty-1.1.3.6-05a1
  2928. 1314.05 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  2929. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2930. 1314.05 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  2931. 1314.05 s [haskell-language-server] include transformers-0.6.1.2-2558
  2932. 1314.05 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  2933. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin
  2934. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2935. 1314.05 s [haskell-language-server] include directory-1.3.9.0-d362
  2936. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  2937. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2938. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2939. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2940. 1314.05 s [haskell-language-server] include mtl-2.3.1-34eb
  2941. 1314.05 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  2942. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2943. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin
  2944. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2945. 1314.05 s [haskell-language-server] include directory-1.3.9.0-d362
  2946. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  2947. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2948. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2949. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2950. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2951. 1314.05 s [haskell-language-server] include mtl-2.3.1-34eb
  2952. 1314.05 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  2953. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2954. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin
  2955. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2956. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  2957. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2958. 1314.05 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  2959. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2960. 1314.05 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  2961. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  2962. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2963. 1314.05 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  2964. 1314.05 s [haskell-language-server] include mtl-2.3.1-34eb
  2965. 1314.05 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  2966. 1314.05 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  2967. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2968. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib
  2969. 1314.05 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2970. 1314.05 s [haskell-language-server] include async-2.2.5-AWWz4gxrFBv1N6ln4ZBS5r
  2971. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2972. 1314.05 s [haskell-language-server] include binary-0.8.9.3-f492
  2973. 1314.05 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  2974. 1314.05 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  2975. 1314.05 s [haskell-language-server] include directory-1.3.9.0-d362
  2976. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2977. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  2978. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  2979. 1314.05 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  2980. 1314.05 s [haskell-language-server] include hls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z
  2981. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  2982. 1314.05 s [haskell-language-server] include lsp-test-0.17.1.1-agQol3PhMICp63Sv6kHt9
  2983. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  2984. 1314.05 s [haskell-language-server] include optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  2985. 1314.05 s [haskell-language-server] include parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  2986. 1314.05 s [haskell-language-server] include process-1.6.25.0-bd82
  2987. 1314.05 s [haskell-language-server] include row-types-1.0.1.2-GZg3ld1Ox7ZBgEJw0sdFce
  2988. 1314.05 s [haskell-language-server] include safe-exceptions-0.1.7.4-7ovuwkV6YUgBVHzXPijSe1
  2989. 1314.05 s [haskell-language-server] include shake-0.19.8-83V2vcL3yghJTj9oLQn0vi
  2990. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  2991. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-3XkIiHOlOkbAFpVJygdKKn-ghcide-bench
  2992. 1314.05 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  2993. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  2994. 1314.05 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  2995. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  2996. 1314.05 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  2997. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  2998. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  2999. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib
  3000. 1314.05 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3001. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3002. 1314.05 s [haskell-language-server] include hls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z
  3003. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3004. 1314.05 s [haskell-language-server] include lsp-test-0.17.1.1-agQol3PhMICp63Sv6kHt9
  3005. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3006. 1314.05 s [haskell-language-server] include optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  3007. 1314.05 s [haskell-language-server] include process-1.6.25.0-bd82
  3008. 1314.05 s [haskell-language-server] include safe-exceptions-0.1.7.4-7ovuwkV6YUgBVHzXPijSe1
  3009. 1314.05 s [haskell-language-server] include shake-0.19.8-83V2vcL3yghJTj9oLQn0vi
  3010. 1314.05 s [haskell-language-server] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  3011. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  3012. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  3013. 1314.05 s [haskell-language-server] include aeson-pretty-0.8.10-IP17KZ5FSlb8TcYYjfwYFg
  3014. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  3015. 1314.05 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  3016. 1314.05 s [haskell-language-server] include directory-1.3.9.0-d362
  3017. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3018. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  3019. 1314.05 s [haskell-language-server] include ghc-9.12.2-82d3
  3020. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3021. 1314.05 s [haskell-language-server] include githash-0.1.7.0-7OiV27WentwIbrNCGMt4vD
  3022. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin
  3023. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin
  3024. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin
  3025. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin
  3026. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin
  3027. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin
  3028. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin
  3029. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin
  3030. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin
  3031. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin
  3032. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin
  3033. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin
  3034. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin
  3035. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin
  3036. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin
  3037. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin
  3038. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin
  3039. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin
  3040. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin
  3041. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin
  3042. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin
  3043. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3044. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin
  3045. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin
  3046. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin
  3047. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin
  3048. 1314.05 s [haskell-language-server] include hie-bios-0.17.0-6pUYY6S9WdzoSMMYkMGYM
  3049. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3050. 1314.05 s [haskell-language-server] include optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  3051. 1314.05 s [haskell-language-server] include optparse-simple-0.1.1.4-KmLpjIlycTP5tolXOsTIZO
  3052. 1314.05 s [haskell-language-server] include prettyprinter-1.7.1-HHD8ICSoCgO2j0q73COKVU
  3053. 1314.05 s [haskell-language-server] include process-1.6.25.0-bd82
  3054. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  3055. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-9aSKaPbsg2HxiB48zXBQq-haskell-language-server
  3056. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  3057. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  3058. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3059. 1314.05 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3060. 1314.05 s [haskell-language-server] include prettyprinter-1.7.1-HHD8ICSoCgO2j0q73COKVU
  3061. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  3062. 1314.05 s [haskell-language-server] component haskell-language-server-2.12.0.0-HxZ2p1OpCiL97BmBIlD6wM-haskell-language-server-wrapper
  3063. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  3064. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  3065. 1314.05 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  3066. 1314.05 s [haskell-language-server] include directory-1.3.9.0-d362
  3067. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3068. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  3069. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3070. 1314.05 s [haskell-language-server] include haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  3071. 1314.05 s [haskell-language-server] include hie-bios-0.17.0-6pUYY6S9WdzoSMMYkMGYM
  3072. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3073. 1314.05 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3074. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3075. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  3076. 1314.05 s [haskell-language-server] include transformers-0.6.1.2-2558
  3077. 1314.05 s [haskell-language-server] include unix-2.8.6.0-935f
  3078. 1314.05 s [haskell-language-server] include unliftio-core-0.2.1.0-2ZDzQCO10Uh1msYqIQQbyS
  3079. 1314.05 s [haskell-language-server] Linked component graph:
  3080. 1314.05 s [haskell-language-server] unit haskell-language-server-2.12.0.0-9IydNLTUE50JFjX49QzBBp-ghcide-test-preprocessor
  3081. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  3082. 1314.05 s [haskell-language-server] unit haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin
  3083. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  3084. 1314.05 s [haskell-language-server] include directory-1.3.9.0-d362
  3085. 1314.05 s [haskell-language-server] include filepath-1.5.4.0-7227
  3086. 1314.05 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  3087. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3088. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3089. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3090. 1314.05 s [haskell-language-server] include mtl-2.3.1-34eb
  3091. 1314.05 s [haskell-language-server] include stylish-haskell-0.15.1.0-5cAcK9XP68m3ahqPV8qpuK
  3092. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  3093. 1314.05 s [haskell-language-server] Ide.Plugin.StylishHaskell=haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin:Ide.Plugin.StylishHaskell
  3094. 1314.05 s [haskell-language-server] unit haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin
  3095. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  3096. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  3097. 1314.05 s [haskell-language-server] include ghc-9.12.2-82d3
  3098. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3099. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3100. 1314.05 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3101. 1314.05 s [haskell-language-server] include text-2.1.2-e822
  3102. 1314.05 s [haskell-language-server] include transformers-0.6.1.2-2558
  3103. 1314.05 s [haskell-language-server] Ide.Plugin.SignatureHelp=haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin:Ide.Plugin.SignatureHelp
  3104. 1314.05 s [haskell-language-server] unit haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin
  3105. 1314.05 s [haskell-language-server] include array-0.5.8.0-d6d4
  3106. 1314.05 s [haskell-language-server] include base-4.21.0.0-b334
  3107. 1314.05 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  3108. 1314.05 s [haskell-language-server] include containers-0.7-d79e
  3109. 1314.05 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  3110. 1314.05 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3111. 1314.05 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3112. 1314.05 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3113. 1314.05 s [haskell-language-server] include ghc-9.12.2-82d3
  3114. 1314.05 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3115. 1314.05 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3116. 1314.05 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3117. 1314.05 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3118. 1314.05 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3119. 1314.05 s [haskell-language-server] include mtl-2.3.1-34eb
  3120. 1314.05 s [haskell-language-server] include stm-2.5.3.1-ef8d
  3121. 1314.06 s [haskell-language-server] include stm-containers-1.2.1.1-Ix4DymiEOgrJ3xwWamk6U4
  3122. 1314.06 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3123. 1314.06 s [haskell-language-server] include template-haskell-2.23.0.0-4ee9
  3124. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3125. 1314.06 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3126. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3127. 1314.06 s [haskell-language-server] Ide.Plugin.SemanticTokens=haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens,Ide.Plugin.SemanticTokens.Mappings=haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens.Mappings,Ide.Plugin.SemanticTokens.Types=haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin:Ide.Plugin.SemanticTokens.Types
  3128. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3129. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3130. 1314.06 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  3131. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3132. 1314.06 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3133. 1314.06 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3134. 1314.06 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3135. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3136. 1314.06 s [haskell-language-server] include ghc-boot-9.12.2-d17a
  3137. 1314.06 s [haskell-language-server] include ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  3138. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3139. 1314.06 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3140. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3141. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3142. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3143. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3144. 1314.06 s [haskell-language-server] include parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  3145. 1314.06 s [haskell-language-server] include regex-applicative-0.3.4-CnW24tC17yJ4pR2cvFEpth
  3146. 1314.06 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3147. 1314.06 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3148. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3149. 1314.06 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3150. 1314.06 s [haskell-language-server] include time-1.14-3dc5
  3151. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3152. 1314.06 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3153. 1314.06 s [haskell-language-server] Development.IDE.GHC.Compat.ExactPrint=haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin:Development.IDE.GHC.Compat.ExactPrint,Development.IDE.GHC.Dump=haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin:Development.IDE.GHC.Dump,Development.IDE.GHC.ExactPrint=haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin:Development.IDE.GHC.ExactPrint,Development.IDE.Plugin.CodeAction=haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin:Development.IDE.Plugin.CodeAction,Development.IDE.Plugin.CodeAction.Util=haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin:Development.IDE.Plugin.CodeAction.Util
  3154. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin
  3155. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3156. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3157. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3158. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3159. 1314.06 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3160. 1314.06 s [haskell-language-server] include haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3161. 1314.06 s [haskell-language-server] include hiedb-0.7.0.0-BeNR23mZ9Vu112pqx17YPe
  3162. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3163. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3164. 1314.06 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3165. 1314.06 s [haskell-language-server] include mod-0.2.1.0-7uXAIxkOb3ELuaOatpnaWP
  3166. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3167. 1314.06 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3168. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3169. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3170. 1314.06 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3171. 1314.06 s [haskell-language-server] Ide.Plugin.Rename=haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin:Ide.Plugin.Rename
  3172. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin
  3173. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3174. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3175. 1314.06 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3176. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3177. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3178. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3179. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3180. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3181. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3182. 1314.06 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3183. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3184. 1314.06 s [haskell-language-server] Ide.Plugin.QualifyImportedNames=haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin:Ide.Plugin.QualifyImportedNames
  3185. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin
  3186. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3187. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3188. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3189. 1314.06 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3190. 1314.06 s [haskell-language-server] include fuzzy-0.1.1.0-DNFDL5yrkjA6gY3KEuHuop
  3191. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3192. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3193. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3194. 1314.06 s [haskell-language-server] include lens-aeson-1.2.3-D9txcsrhmkMJad9PAbqkUy
  3195. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3196. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3197. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3198. 1314.06 s [haskell-language-server] Ide.Plugin.Pragmas=haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin:Ide.Plugin.Pragmas
  3199. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin
  3200. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3201. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3202. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3203. 1314.06 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3204. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3205. 1314.06 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3206. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3207. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3208. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3209. 1314.06 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3210. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3211. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3212. 1314.06 s [haskell-language-server] Ide.Plugin.OverloadedRecordDot=haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin:Ide.Plugin.OverloadedRecordDot
  3213. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin
  3214. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3215. 1314.06 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3216. 1314.06 s [haskell-language-server] include filepath-1.5.4.0-7227
  3217. 1314.06 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  3218. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3219. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3220. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3221. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3222. 1314.06 s [haskell-language-server] include ormolu-0.8.0.2-LLnfiREhmrq40cRMQjaElz
  3223. 1314.06 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  3224. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3225. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3226. 1314.06 s [haskell-language-server] Ide.Plugin.Ormolu=haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin:Ide.Plugin.Ormolu
  3227. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin
  3228. 1314.06 s [haskell-language-server] include array-0.5.8.0-d6d4
  3229. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3230. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3231. 1314.06 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3232. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3233. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3234. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3235. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3236. 1314.06 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3237. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3238. 1314.06 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3239. 1314.06 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3240. 1314.06 s [haskell-language-server] Ide.Plugin.Notes=haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin:Ide.Plugin.Notes
  3241. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin
  3242. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3243. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3244. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3245. 1314.06 s [haskell-language-server] include filepath-1.5.4.0-7227
  3246. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3247. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3248. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3249. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3250. 1314.06 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3251. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3252. 1314.06 s [haskell-language-server] Ide.Plugin.ModuleName=haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin:Ide.Plugin.ModuleName
  3253. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin
  3254. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3255. 1314.06 s [haskell-language-server] include apply-refact-0.15.0.0-Jj1PB0lLeIn7ALllR84csn
  3256. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3257. 1314.06 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  3258. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3259. 1314.06 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3260. 1314.06 s [haskell-language-server] include filepath-1.5.4.0-7227
  3261. 1314.06 s [haskell-language-server] include ghc-lib-parser-9.12.2.20250421-JdFAKZEOaaDLfCSCCmyiy
  3262. 1314.06 s [haskell-language-server] include ghc-lib-parser-ex-9.12.0.0-CaGeB6qlx0HBYyQlDkzcv0
  3263. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3264. 1314.06 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3265. 1314.06 s [haskell-language-server] include hlint-3.10-6jbnfM2awuF1VndKpOi3gp
  3266. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3267. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3268. 1314.06 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3269. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3270. 1314.06 s [haskell-language-server] include refact-0.3.0.2-42YY7SYlH2c7tyNm48xWdH
  3271. 1314.06 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3272. 1314.06 s [haskell-language-server] include stm-2.5.3.1-ef8d
  3273. 1314.06 s [haskell-language-server] include temporary-1.3-I5meYVLbAKnISmSvrAOHql
  3274. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3275. 1314.06 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3276. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3277. 1314.06 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3278. 1314.06 s [haskell-language-server] Ide.Plugin.Hlint=haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin:Ide.Plugin.Hlint
  3279. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin
  3280. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3281. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3282. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3283. 1314.06 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3284. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3285. 1314.06 s [haskell-language-server] include ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  3286. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3287. 1314.06 s [haskell-language-server] include haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3288. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3289. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3290. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3291. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3292. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3293. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3294. 1314.06 s [haskell-language-server] Ide.Plugin.GADT=haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin:Ide.Plugin.GADT
  3295. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin
  3296. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3297. 1314.06 s [haskell-language-server] include filepath-1.5.4.0-7227
  3298. 1314.06 s [haskell-language-server] include fourmolu-0.19.0.1-E1HGPzt9qzFLEH1UfXk1Md
  3299. 1314.06 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  3300. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3301. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3302. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3303. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3304. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3305. 1314.06 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  3306. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3307. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3308. 1314.06 s [haskell-language-server] include yaml-0.11.11.2-Avz2Evr20WOICFQJEF6pIN
  3309. 1314.06 s [haskell-language-server] Ide.Plugin.Fourmolu=haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin:Ide.Plugin.Fourmolu
  3310. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin
  3311. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3312. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3313. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3314. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3315. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3316. 1314.06 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3317. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3318. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3319. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3320. 1314.06 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3321. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3322. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3323. 1314.06 s [haskell-language-server] Ide.Plugin.ExplicitFields=haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin:Ide.Plugin.ExplicitFields
  3324. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin
  3325. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3326. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3327. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3328. 1314.06 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3329. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3330. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3331. 1314.06 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3332. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3333. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3334. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3335. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3336. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3337. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3338. 1314.06 s [haskell-language-server] Ide.Plugin.ExplicitImports=haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin:Ide.Plugin.ExplicitImports
  3339. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin
  3340. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3341. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3342. 1314.06 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3343. 1314.06 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3344. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3345. 1314.06 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3346. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3347. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3348. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3349. 1314.06 s [haskell-language-server] Ide.Plugin.ExplicitFixity=haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin:Ide.Plugin.ExplicitFixity
  3350. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin
  3351. 1314.06 s [haskell-language-server] include Diff-1.0.2-3phO2I8WyVvJLcWyUtZ91A
  3352. 1314.06 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3353. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3354. 1314.06 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  3355. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3356. 1314.06 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3357. 1314.06 s [haskell-language-server] include dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3358. 1314.06 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3359. 1314.06 s [haskell-language-server] include filepath-1.5.4.0-7227
  3360. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3361. 1314.06 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  3362. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3363. 1314.06 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3364. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3365. 1314.06 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3366. 1314.06 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3367. 1314.06 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3368. 1314.06 s [haskell-language-server] include megaparsec-9.7.0-CIN6p7tiEq89SZ2kyHf3f9
  3369. 1314.06 s [haskell-language-server] include mtl-2.3.1-34eb
  3370. 1314.06 s [haskell-language-server] include parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  3371. 1314.06 s [haskell-language-server] include text-2.1.2-e822
  3372. 1314.06 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3373. 1314.06 s [haskell-language-server] include transformers-0.6.1.2-2558
  3374. 1314.06 s [haskell-language-server] include unliftio-0.2.25.1-FtFGlONQcrmFKgodpXp7Pt
  3375. 1314.06 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3376. 1314.06 s [haskell-language-server] Ide.Plugin.Eval=haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin:Ide.Plugin.Eval,Ide.Plugin.Eval.Types=haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin:Ide.Plugin.Eval.Types
  3377. 1314.06 s [haskell-language-server] unit haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin
  3378. 1314.06 s [haskell-language-server] include base-4.21.0.0-b334
  3379. 1314.06 s [haskell-language-server] include containers-0.7-d79e
  3380. 1314.06 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3381. 1314.06 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3382. 1314.06 s [haskell-language-server] include ghc-9.12.2-82d3
  3383. 1314.06 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3384. 1314.06 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3385. 1314.06 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3386. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3387. 1314.07 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3388. 1314.07 s [haskell-language-server] include mtl-2.3.1-34eb
  3389. 1314.07 s [haskell-language-server] include semigroupoids-6.0.1-9Aovgo6K4sLD8nVtf5DdJj
  3390. 1314.07 s [haskell-language-server] include transformers-0.6.1.2-2558
  3391. 1314.07 s [haskell-language-server] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  3392. 1314.07 s [haskell-language-server] Ide.Plugin.CodeRange=haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin:Ide.Plugin.CodeRange,Ide.Plugin.CodeRange.Rules=haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin:Ide.Plugin.CodeRange.Rules
  3393. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin
  3394. 1314.07 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3395. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3396. 1314.07 s [haskell-language-server] include containers-0.7-d79e
  3397. 1314.07 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3398. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3399. 1314.07 s [haskell-language-server] include ghc-9.12.2-82d3
  3400. 1314.07 s [haskell-language-server] include ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  3401. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3402. 1314.07 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3403. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3404. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3405. 1314.07 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3406. 1314.07 s [haskell-language-server] include mtl-2.3.1-34eb
  3407. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3408. 1314.07 s [haskell-language-server] include transformers-0.6.1.2-2558
  3409. 1314.07 s [haskell-language-server] Ide.Plugin.Class=haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin:Ide.Plugin.Class
  3410. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin
  3411. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3412. 1314.07 s [haskell-language-server] include containers-0.7-d79e
  3413. 1314.07 s [haskell-language-server] include ghc-9.12.2-82d3
  3414. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3415. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3416. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3417. 1314.07 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3418. 1314.07 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3419. 1314.07 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3420. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3421. 1314.07 s [haskell-language-server] include transformers-0.6.1.2-2558
  3422. 1314.07 s [haskell-language-server] Ide.Plugin.ChangeTypeSignature=haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin:Ide.Plugin.ChangeTypeSignature
  3423. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin
  3424. 1314.07 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3425. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3426. 1314.07 s [haskell-language-server] include containers-0.7-d79e
  3427. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3428. 1314.07 s [haskell-language-server] include ghc-9.12.2-82d3
  3429. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3430. 1314.07 s [haskell-language-server] include hiedb-0.7.0.0-BeNR23mZ9Vu112pqx17YPe
  3431. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3432. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3433. 1314.07 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3434. 1314.07 s [haskell-language-server] include sqlite-simple-0.4.19.0-B9FaAQEUGQTEVTlqzfqc1v
  3435. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3436. 1314.07 s [haskell-language-server] Ide.Plugin.CallHierarchy=haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin:Ide.Plugin.CallHierarchy
  3437. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin
  3438. 1314.07 s [haskell-language-server] include Cabal-3.14.2.0-12wmWDuamw72aCWt0RdJaU
  3439. 1314.07 s [haskell-language-server] include Cabal-syntax-3.14.2.0-AOyEamcr8b2H0umx9ZrHLI
  3440. 1314.07 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3441. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3442. 1314.07 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  3443. 1314.07 s [haskell-language-server] include cabal-add-0.2-fOzb4nEYGqKR75X3Xo9Dh
  3444. 1314.07 s [haskell-language-server] include containers-0.7-d79e
  3445. 1314.07 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3446. 1314.07 s [haskell-language-server] include directory-1.3.9.0-d362
  3447. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3448. 1314.07 s [haskell-language-server] include filepath-1.5.4.0-7227
  3449. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3450. 1314.07 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3451. 1314.07 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3452. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3453. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3454. 1314.07 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3455. 1314.07 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3456. 1314.07 s [haskell-language-server] include mtl-2.3.1-34eb
  3457. 1314.07 s [haskell-language-server] include pretty-1.1.3.6-05a1
  3458. 1314.07 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3459. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3460. 1314.07 s [haskell-language-server] include text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3461. 1314.07 s [haskell-language-server] include transformers-0.6.1.2-2558
  3462. 1314.07 s [haskell-language-server] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3463. 1314.07 s [haskell-language-server] Ide.Plugin.Cabal=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal,Ide.Plugin.Cabal.CabalAdd.CodeAction=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.CodeAction,Ide.Plugin.Cabal.CabalAdd.Command=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.Command,Ide.Plugin.Cabal.CabalAdd.Types=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.CabalAdd.Types,Ide.Plugin.Cabal.Completion.CabalFields=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.CabalFields,Ide.Plugin.Cabal.Completion.Completer.FilePath=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.FilePath,Ide.Plugin.Cabal.Completion.Completer.Module=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Module,Ide.Plugin.Cabal.Completion.Completer.Paths=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Paths,Ide.Plugin.Cabal.Completion.Completer.Simple=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Simple,Ide.Plugin.Cabal.Completion.Completer.Snippet=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Snippet,Ide.Plugin.Cabal.Completion.Completer.Types=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completer.Types,Ide.Plugin.Cabal.Completion.Completions=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Completions,Ide.Plugin.Cabal.Completion.Data=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Data,Ide.Plugin.Cabal.Completion.Types=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Completion.Types,Ide.Plugin.Cabal.Definition=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Definition,Ide.Plugin.Cabal.Diagnostics=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Diagnostics,Ide.Plugin.Cabal.FieldSuggest=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.FieldSuggest,Ide.Plugin.Cabal.Files=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Files,Ide.Plugin.Cabal.LicenseSuggest=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.LicenseSuggest,Ide.Plugin.Cabal.OfInterest=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.OfInterest,Ide.Plugin.Cabal.Orphans=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Orphans,Ide.Plugin.Cabal.Outline=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Outline,Ide.Plugin.Cabal.Parse=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Parse,Ide.Plugin.Cabal.Rules=haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin:Ide.Plugin.Cabal.Rules
  3464. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin
  3465. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3466. 1314.07 s [haskell-language-server] include directory-1.3.9.0-d362
  3467. 1314.07 s [haskell-language-server] include filepath-1.5.4.0-7227
  3468. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3469. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3470. 1314.07 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3471. 1314.07 s [haskell-language-server] include mtl-2.3.1-34eb
  3472. 1314.07 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  3473. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3474. 1314.07 s [haskell-language-server] Ide.Plugin.CabalGild=haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin:Ide.Plugin.CabalGild
  3475. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin
  3476. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3477. 1314.07 s [haskell-language-server] include directory-1.3.9.0-d362
  3478. 1314.07 s [haskell-language-server] include filepath-1.5.4.0-7227
  3479. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3480. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3481. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3482. 1314.07 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3483. 1314.07 s [haskell-language-server] include mtl-2.3.1-34eb
  3484. 1314.07 s [haskell-language-server] include process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  3485. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3486. 1314.07 s [haskell-language-server] Ide.Plugin.CabalFmt=haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin:Ide.Plugin.CabalFmt
  3487. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin
  3488. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3489. 1314.07 s [haskell-language-server] include containers-0.7-d79e
  3490. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3491. 1314.07 s [haskell-language-server] include ghc-boot-th-9.12.2-32d2
  3492. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3493. 1314.07 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3494. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3495. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3496. 1314.07 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3497. 1314.07 s [haskell-language-server] include mtl-2.3.1-34eb
  3498. 1314.07 s [haskell-language-server] include regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3499. 1314.07 s [haskell-language-server] include syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3500. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3501. 1314.07 s [haskell-language-server] Ide.Plugin.AlternateNumberFormat=haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin:Ide.Plugin.AlternateNumberFormat,Ide.Plugin.Conversion=haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin:Ide.Plugin.Conversion
  3502. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib
  3503. 1314.07 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3504. 1314.07 s [haskell-language-server] include async-2.2.5-AWWz4gxrFBv1N6ln4ZBS5r
  3505. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3506. 1314.07 s [haskell-language-server] include binary-0.8.9.3-f492
  3507. 1314.07 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  3508. 1314.07 s [haskell-language-server] include deepseq-1.5.1.0-3c62
  3509. 1314.07 s [haskell-language-server] include directory-1.3.9.0-d362
  3510. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3511. 1314.07 s [haskell-language-server] include filepath-1.5.4.0-7227
  3512. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3513. 1314.07 s [haskell-language-server] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3514. 1314.07 s [haskell-language-server] include hls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z
  3515. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3516. 1314.07 s [haskell-language-server] include lsp-test-0.17.1.1-agQol3PhMICp63Sv6kHt9
  3517. 1314.07 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3518. 1314.07 s [haskell-language-server] include optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  3519. 1314.07 s [haskell-language-server] include parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  3520. 1314.07 s [haskell-language-server] include process-1.6.25.0-bd82
  3521. 1314.07 s [haskell-language-server] include row-types-1.0.1.2-GZg3ld1Ox7ZBgEJw0sdFce
  3522. 1314.07 s [haskell-language-server] include safe-exceptions-0.1.7.4-7ovuwkV6YUgBVHzXPijSe1
  3523. 1314.07 s [haskell-language-server] include shake-0.19.8-83V2vcL3yghJTj9oLQn0vi
  3524. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3525. 1314.07 s [haskell-language-server] Experiments=haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib:Experiments,Experiments.Types=haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib:Experiments.Types
  3526. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-3XkIiHOlOkbAFpVJygdKKn-ghcide-bench
  3527. 1314.07 s [haskell-language-server] include aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3528. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3529. 1314.07 s [haskell-language-server] include bytestring-0.12.2.0-0cf8
  3530. 1314.07 s [haskell-language-server] include containers-0.7-d79e
  3531. 1314.07 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  3532. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3533. 1314.07 s [haskell-language-server] include filepath-1.5.4.0-7227
  3534. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib
  3535. 1314.07 s [haskell-language-server] include hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3536. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3537. 1314.07 s [haskell-language-server] include hls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z
  3538. 1314.07 s [haskell-language-server] include lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3539. 1314.07 s [haskell-language-server] include lsp-test-0.17.1.1-agQol3PhMICp63Sv6kHt9
  3540. 1314.07 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3541. 1314.07 s [haskell-language-server] include optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  3542. 1314.07 s [haskell-language-server] include process-1.6.25.0-bd82
  3543. 1314.07 s [haskell-language-server] include safe-exceptions-0.1.7.4-7ovuwkV6YUgBVHzXPijSe1
  3544. 1314.07 s [haskell-language-server] include shake-0.19.8-83V2vcL3yghJTj9oLQn0vi
  3545. 1314.07 s [haskell-language-server] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  3546. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3547. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  3548. 1314.07 s [haskell-language-server] include aeson-pretty-0.8.10-IP17KZ5FSlb8TcYYjfwYFg
  3549. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3550. 1314.07 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  3551. 1314.07 s [haskell-language-server] include directory-1.3.9.0-d362
  3552. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3553. 1314.07 s [haskell-language-server] include filepath-1.5.4.0-7227
  3554. 1314.07 s [haskell-language-server] include ghc-9.12.2-82d3
  3555. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3556. 1314.07 s [haskell-language-server] include githash-0.1.7.0-7OiV27WentwIbrNCGMt4vD
  3557. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin
  3558. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin
  3559. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin
  3560. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin
  3561. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin
  3562. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin
  3563. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin
  3564. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin
  3565. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin
  3566. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin
  3567. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin
  3568. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin
  3569. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin
  3570. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin
  3571. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin
  3572. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin
  3573. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin
  3574. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin
  3575. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin
  3576. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin
  3577. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin
  3578. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3579. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin
  3580. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin
  3581. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin
  3582. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin
  3583. 1314.07 s [haskell-language-server] include hie-bios-0.17.0-6pUYY6S9WdzoSMMYkMGYM
  3584. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3585. 1314.07 s [haskell-language-server] include optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  3586. 1314.07 s [haskell-language-server] include optparse-simple-0.1.1.4-KmLpjIlycTP5tolXOsTIZO
  3587. 1314.07 s [haskell-language-server] include prettyprinter-1.7.1-HHD8ICSoCgO2j0q73COKVU
  3588. 1314.07 s [haskell-language-server] include process-1.6.25.0-bd82
  3589. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3590. 1314.07 s [haskell-language-server] HlsPlugins=haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q:HlsPlugins,Ide.Arguments=haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q:Ide.Arguments,Ide.Main=haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q:Ide.Main,Ide.Version=haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q:Ide.Version
  3591. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-9aSKaPbsg2HxiB48zXBQq-haskell-language-server
  3592. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3593. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  3594. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3595. 1314.07 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3596. 1314.07 s [haskell-language-server] include prettyprinter-1.7.1-HHD8ICSoCgO2j0q73COKVU
  3597. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3598. 1314.07 s [haskell-language-server] unit haskell-language-server-2.12.0.0-HxZ2p1OpCiL97BmBIlD6wM-haskell-language-server-wrapper
  3599. 1314.07 s [haskell-language-server] include base-4.21.0.0-b334
  3600. 1314.07 s [haskell-language-server] include containers-0.7-d79e
  3601. 1314.07 s [haskell-language-server] include data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  3602. 1314.07 s [haskell-language-server] include directory-1.3.9.0-d362
  3603. 1314.07 s [haskell-language-server] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3604. 1314.07 s [haskell-language-server] include filepath-1.5.4.0-7227
  3605. 1314.07 s [haskell-language-server] include ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3606. 1314.07 s [haskell-language-server] include haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  3607. 1314.07 s [haskell-language-server] include hie-bios-0.17.0-6pUYY6S9WdzoSMMYkMGYM
  3608. 1314.07 s [haskell-language-server] include hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3609. 1314.07 s [haskell-language-server] include lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3610. 1314.07 s [haskell-language-server] include lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3611. 1314.07 s [haskell-language-server] include text-2.1.2-e822
  3612. 1314.07 s [haskell-language-server] include transformers-0.6.1.2-2558
  3613. 1314.07 s [haskell-language-server] include unix-2.8.6.0-935f
  3614. 1314.07 s [haskell-language-server] include unliftio-core-0.2.1.0-2ZDzQCO10Uh1msYqIQQbyS
  3615. 1314.07 s [haskell-language-server] Ready component graph:
  3616. 1314.07 s [haskell-language-server] definite haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin
  3617. 1314.07 s [haskell-language-server] depends base-4.21.0.0-b334
  3618. 1314.07 s [haskell-language-server] depends directory-1.3.9.0-d362
  3619. 1314.07 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3620. 1314.07 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3621. 1314.07 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3622. 1314.07 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3623. 1314.07 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3624. 1314.07 s [haskell-language-server] depends mtl-2.3.1-34eb
  3625. 1314.07 s [haskell-language-server] depends process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  3626. 1314.07 s [haskell-language-server] depends text-2.1.2-e822
  3627. 1314.07 s [haskell-language-server] definite haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin
  3628. 1314.07 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3629. 1314.07 s [haskell-language-server] depends base-4.21.0.0-b334
  3630. 1314.07 s [haskell-language-server] depends containers-0.7-d79e
  3631. 1314.07 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3632. 1314.07 s [haskell-language-server] depends ghc-9.12.2-82d3
  3633. 1314.07 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3634. 1314.07 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3635. 1314.07 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3636. 1314.07 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3637. 1314.07 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3638. 1314.07 s [haskell-language-server] depends mtl-2.3.1-34eb
  3639. 1314.07 s [haskell-language-server] depends text-2.1.2-e822
  3640. 1314.07 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3641. 1314.07 s [haskell-language-server] definite haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin
  3642. 1314.07 s [haskell-language-server] depends base-4.21.0.0-b334
  3643. 1314.07 s [haskell-language-server] depends containers-0.7-d79e
  3644. 1314.07 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3645. 1314.07 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3646. 1314.07 s [haskell-language-server] depends ghc-9.12.2-82d3
  3647. 1314.07 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3648. 1314.07 s [haskell-language-server] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3649. 1314.07 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3650. 1314.07 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3651. 1314.07 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3652. 1314.07 s [haskell-language-server] depends mtl-2.3.1-34eb
  3653. 1314.07 s [haskell-language-server] depends semigroupoids-6.0.1-9Aovgo6K4sLD8nVtf5DdJj
  3654. 1314.07 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3655. 1314.07 s [haskell-language-server] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  3656. 1314.07 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin
  3657. 1314.07 s [haskell-language-server] depends base-4.21.0.0-b334
  3658. 1314.07 s [haskell-language-server] depends containers-0.7-d79e
  3659. 1314.07 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3660. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3661. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3662. 1314.08 s [haskell-language-server] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3663. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3664. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3665. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3666. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin
  3667. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3668. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3669. 1314.08 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3670. 1314.08 s [haskell-language-server] depends ghc-boot-th-9.12.2-32d2
  3671. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3672. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3673. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3674. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3675. 1314.08 s [haskell-language-server] depends ormolu-0.8.0.2-LLnfiREhmrq40cRMQjaElz
  3676. 1314.08 s [haskell-language-server] depends process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  3677. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3678. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3679. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin
  3680. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3681. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3682. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3683. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3684. 1314.08 s [haskell-language-server] depends fuzzy-0.1.1.0-DNFDL5yrkjA6gY3KEuHuop
  3685. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3686. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3687. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3688. 1314.08 s [haskell-language-server] depends lens-aeson-1.2.3-D9txcsrhmkMJad9PAbqkUy
  3689. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3690. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3691. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3692. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin
  3693. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3694. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3695. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3696. 1314.08 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3697. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3698. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3699. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3700. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3701. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3702. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3703. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin
  3704. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3705. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3706. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3707. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3708. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3709. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3710. 1314.08 s [haskell-language-server] depends hiedb-0.7.0.0-BeNR23mZ9Vu112pqx17YPe
  3711. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3712. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3713. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3714. 1314.08 s [haskell-language-server] depends sqlite-simple-0.4.19.0-B9FaAQEUGQTEVTlqzfqc1v
  3715. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3716. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin
  3717. 1314.08 s [haskell-language-server] depends array-0.5.8.0-d6d4
  3718. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3719. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3720. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3721. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3722. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3723. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3724. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3725. 1314.08 s [haskell-language-server] depends regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3726. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3727. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3728. 1314.08 s [haskell-language-server] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3729. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin
  3730. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3731. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3732. 1314.08 s [haskell-language-server] depends dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3733. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3734. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3735. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3736. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3737. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3738. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3739. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3740. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3741. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin
  3742. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3743. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3744. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3745. 1314.08 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3746. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3747. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3748. 1314.08 s [haskell-language-server] depends ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  3749. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3750. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3751. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3752. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3753. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3754. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3755. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3756. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3757. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin
  3758. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3759. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3760. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3761. 1314.08 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3762. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3763. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3764. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3765. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3766. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3767. 1314.08 s [haskell-language-server] depends syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3768. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3769. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3770. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin
  3771. 1314.08 s [haskell-language-server] depends Diff-1.0.2-3phO2I8WyVvJLcWyUtZ91A
  3772. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3773. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3774. 1314.08 s [haskell-language-server] depends bytestring-0.12.2.0-0cf8
  3775. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3776. 1314.08 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3777. 1314.08 s [haskell-language-server] depends dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3778. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3779. 1314.08 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3780. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3781. 1314.08 s [haskell-language-server] depends ghc-boot-th-9.12.2-32d2
  3782. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3783. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3784. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3785. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3786. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3787. 1314.08 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3788. 1314.08 s [haskell-language-server] depends megaparsec-9.7.0-CIN6p7tiEq89SZ2kyHf3f9
  3789. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3790. 1314.08 s [haskell-language-server] depends parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  3791. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3792. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3793. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3794. 1314.08 s [haskell-language-server] depends unliftio-0.2.25.1-FtFGlONQcrmFKgodpXp7Pt
  3795. 1314.08 s [haskell-language-server] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3796. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin
  3797. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3798. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3799. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3800. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3801. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3802. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3803. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3804. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3805. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3806. 1314.08 s [haskell-language-server] depends syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3807. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3808. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3809. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-9IydNLTUE50JFjX49QzBBp-ghcide-test-preprocessor
  3810. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3811. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin
  3812. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3813. 1314.08 s [haskell-language-server] depends apply-refact-0.15.0.0-Jj1PB0lLeIn7ALllR84csn
  3814. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3815. 1314.08 s [haskell-language-server] depends bytestring-0.12.2.0-0cf8
  3816. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3817. 1314.08 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3818. 1314.08 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3819. 1314.08 s [haskell-language-server] depends ghc-lib-parser-9.12.2.20250421-JdFAKZEOaaDLfCSCCmyiy
  3820. 1314.08 s [haskell-language-server] depends ghc-lib-parser-ex-9.12.0.0-CaGeB6qlx0HBYyQlDkzcv0
  3821. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3822. 1314.08 s [haskell-language-server] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3823. 1314.08 s [haskell-language-server] depends hlint-3.10-6jbnfM2awuF1VndKpOi3gp
  3824. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3825. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3826. 1314.08 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3827. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3828. 1314.08 s [haskell-language-server] depends refact-0.3.0.2-42YY7SYlH2c7tyNm48xWdH
  3829. 1314.08 s [haskell-language-server] depends regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3830. 1314.08 s [haskell-language-server] depends stm-2.5.3.1-ef8d
  3831. 1314.08 s [haskell-language-server] depends temporary-1.3-I5meYVLbAKnISmSvrAOHql
  3832. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3833. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3834. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3835. 1314.08 s [haskell-language-server] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3836. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin
  3837. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3838. 1314.08 s [haskell-language-server] depends directory-1.3.9.0-d362
  3839. 1314.08 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3840. 1314.08 s [haskell-language-server] depends ghc-boot-th-9.12.2-32d2
  3841. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3842. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3843. 1314.08 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3844. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3845. 1314.08 s [haskell-language-server] depends stylish-haskell-0.15.1.0-5cAcK9XP68m3ahqPV8qpuK
  3846. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3847. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin
  3848. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3849. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3850. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3851. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3852. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3853. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3854. 1314.08 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3855. 1314.08 s [haskell-language-server] depends regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3856. 1314.08 s [haskell-language-server] depends syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3857. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3858. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3859. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin
  3860. 1314.08 s [haskell-language-server] depends array-0.5.8.0-d6d4
  3861. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3862. 1314.08 s [haskell-language-server] depends bytestring-0.12.2.0-0cf8
  3863. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3864. 1314.08 s [haskell-language-server] depends data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  3865. 1314.08 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3866. 1314.08 s [haskell-language-server] depends dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3867. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3868. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3869. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3870. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3871. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3872. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3873. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3874. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3875. 1314.08 s [haskell-language-server] depends stm-2.5.3.1-ef8d
  3876. 1314.08 s [haskell-language-server] depends stm-containers-1.2.1.1-Ix4DymiEOgrJ3xwWamk6U4
  3877. 1314.08 s [haskell-language-server] depends syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3878. 1314.08 s [haskell-language-server] depends template-haskell-2.23.0.0-4ee9
  3879. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3880. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3881. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3882. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin
  3883. 1314.08 s [haskell-language-server] depends Cabal-3.14.2.0-12wmWDuamw72aCWt0RdJaU
  3884. 1314.08 s [haskell-language-server] depends Cabal-syntax-3.14.2.0-AOyEamcr8b2H0umx9ZrHLI
  3885. 1314.08 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3886. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3887. 1314.08 s [haskell-language-server] depends bytestring-0.12.2.0-0cf8
  3888. 1314.08 s [haskell-language-server] depends cabal-add-0.2-fOzb4nEYGqKR75X3Xo9Dh
  3889. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3890. 1314.08 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3891. 1314.08 s [haskell-language-server] depends directory-1.3.9.0-d362
  3892. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3893. 1314.08 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3894. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3895. 1314.08 s [haskell-language-server] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3896. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3897. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3898. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3899. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3900. 1314.08 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3901. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3902. 1314.08 s [haskell-language-server] depends pretty-1.1.3.6-05a1
  3903. 1314.08 s [haskell-language-server] depends regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3904. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3905. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3906. 1314.08 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3907. 1314.08 s [haskell-language-server] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3908. 1314.08 s [haskell-language-server] definite haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3909. 1314.08 s [haskell-language-server] depends base-4.21.0.0-b334
  3910. 1314.08 s [haskell-language-server] depends bytestring-0.12.2.0-0cf8
  3911. 1314.08 s [haskell-language-server] depends containers-0.7-d79e
  3912. 1314.08 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  3913. 1314.08 s [haskell-language-server] depends dlist-1.0-KZJvOiZjucI4aLqn6ReUxk
  3914. 1314.08 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3915. 1314.08 s [haskell-language-server] depends ghc-9.12.2-82d3
  3916. 1314.08 s [haskell-language-server] depends ghc-boot-9.12.2-d17a
  3917. 1314.08 s [haskell-language-server] depends ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  3918. 1314.08 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3919. 1314.08 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3920. 1314.08 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3921. 1314.08 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3922. 1314.08 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3923. 1314.08 s [haskell-language-server] depends mtl-2.3.1-34eb
  3924. 1314.08 s [haskell-language-server] depends parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  3925. 1314.08 s [haskell-language-server] depends regex-applicative-0.3.4-CnW24tC17yJ4pR2cvFEpth
  3926. 1314.08 s [haskell-language-server] depends regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3927. 1314.08 s [haskell-language-server] depends syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3928. 1314.08 s [haskell-language-server] depends text-2.1.2-e822
  3929. 1314.08 s [haskell-language-server] depends text-rope-0.3-63omZSNj2BnzIGlumm1Aw
  3930. 1314.08 s [haskell-language-server] depends time-1.14-3dc5
  3931. 1314.09 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3932. 1314.09 s [haskell-language-server] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3933. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin
  3934. 1314.09 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  3935. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  3936. 1314.09 s [haskell-language-server] depends containers-0.7-d79e
  3937. 1314.09 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3938. 1314.09 s [haskell-language-server] depends ghc-9.12.2-82d3
  3939. 1314.09 s [haskell-language-server] depends ghc-exactprint-1.12.0.0-9CaOJcTngdvERyU4xlJyaR
  3940. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3941. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3942. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3943. 1314.09 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3944. 1314.09 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3945. 1314.09 s [haskell-language-server] depends mtl-2.3.1-34eb
  3946. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  3947. 1314.09 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3948. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin
  3949. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  3950. 1314.09 s [haskell-language-server] depends containers-0.7-d79e
  3951. 1314.09 s [haskell-language-server] depends ghc-9.12.2-82d3
  3952. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3953. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3954. 1314.09 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3955. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  3956. 1314.09 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3957. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin
  3958. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  3959. 1314.09 s [haskell-language-server] depends containers-0.7-d79e
  3960. 1314.09 s [haskell-language-server] depends ghc-9.12.2-82d3
  3961. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3962. 1314.09 s [haskell-language-server] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  3963. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  3964. 1314.09 s [haskell-language-server] depends hiedb-0.7.0.0-BeNR23mZ9Vu112pqx17YPe
  3965. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3966. 1314.09 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3967. 1314.09 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3968. 1314.09 s [haskell-language-server] depends mod-0.2.1.0-7uXAIxkOb3ELuaOatpnaWP
  3969. 1314.09 s [haskell-language-server] depends mtl-2.3.1-34eb
  3970. 1314.09 s [haskell-language-server] depends syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3971. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  3972. 1314.09 s [haskell-language-server] depends transformers-0.6.1.2-2558
  3973. 1314.09 s [haskell-language-server] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  3974. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin
  3975. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  3976. 1314.09 s [haskell-language-server] depends containers-0.7-d79e
  3977. 1314.09 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  3978. 1314.09 s [haskell-language-server] depends ghc-boot-th-9.12.2-32d2
  3979. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3980. 1314.09 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  3981. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3982. 1314.09 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  3983. 1314.09 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  3984. 1314.09 s [haskell-language-server] depends mtl-2.3.1-34eb
  3985. 1314.09 s [haskell-language-server] depends regex-tdfa-1.3.2.5-Oh7JhcbZ0sCa8ek00R1cz
  3986. 1314.09 s [haskell-language-server] depends syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk
  3987. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  3988. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin
  3989. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  3990. 1314.09 s [haskell-language-server] depends directory-1.3.9.0-d362
  3991. 1314.09 s [haskell-language-server] depends filepath-1.5.4.0-7227
  3992. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  3993. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  3994. 1314.09 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  3995. 1314.09 s [haskell-language-server] depends mtl-2.3.1-34eb
  3996. 1314.09 s [haskell-language-server] depends process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  3997. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  3998. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin
  3999. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  4000. 1314.09 s [haskell-language-server] depends filepath-1.5.4.0-7227
  4001. 1314.09 s [haskell-language-server] depends fourmolu-0.19.0.1-E1HGPzt9qzFLEH1UfXk1Md
  4002. 1314.09 s [haskell-language-server] depends ghc-boot-th-9.12.2-32d2
  4003. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  4004. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  4005. 1314.09 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  4006. 1314.09 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  4007. 1314.09 s [haskell-language-server] depends mtl-2.3.1-34eb
  4008. 1314.09 s [haskell-language-server] depends process-extras-0.7.4-5LCqbIEOt1fLx5177lXXzO
  4009. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  4010. 1314.09 s [haskell-language-server] depends transformers-0.6.1.2-2558
  4011. 1314.09 s [haskell-language-server] depends yaml-0.11.11.2-Avz2Evr20WOICFQJEF6pIN
  4012. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  4013. 1314.09 s [haskell-language-server] depends aeson-pretty-0.8.10-IP17KZ5FSlb8TcYYjfwYFg
  4014. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  4015. 1314.09 s [haskell-language-server] depends data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  4016. 1314.09 s [haskell-language-server] depends directory-1.3.9.0-d362
  4017. 1314.09 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  4018. 1314.09 s [haskell-language-server] depends filepath-1.5.4.0-7227
  4019. 1314.09 s [haskell-language-server] depends ghc-9.12.2-82d3
  4020. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  4021. 1314.09 s [haskell-language-server] depends githash-0.1.7.0-7OiV27WentwIbrNCGMt4vD
  4022. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin
  4023. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin
  4024. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin
  4025. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin
  4026. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin
  4027. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin
  4028. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin
  4029. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin
  4030. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin
  4031. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin
  4032. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin
  4033. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin
  4034. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin
  4035. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin
  4036. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin
  4037. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin
  4038. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin
  4039. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin
  4040. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin
  4041. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin
  4042. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin
  4043. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  4044. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin
  4045. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin
  4046. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin
  4047. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin
  4048. 1314.09 s [haskell-language-server] depends hie-bios-0.17.0-6pUYY6S9WdzoSMMYkMGYM
  4049. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  4050. 1314.09 s [haskell-language-server] depends optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  4051. 1314.09 s [haskell-language-server] depends optparse-simple-0.1.1.4-KmLpjIlycTP5tolXOsTIZO
  4052. 1314.09 s [haskell-language-server] depends prettyprinter-1.7.1-HHD8ICSoCgO2j0q73COKVU
  4053. 1314.09 s [haskell-language-server] depends process-1.6.25.0-bd82
  4054. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  4055. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-9aSKaPbsg2HxiB48zXBQq-haskell-language-server
  4056. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  4057. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  4058. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  4059. 1314.09 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  4060. 1314.09 s [haskell-language-server] depends prettyprinter-1.7.1-HHD8ICSoCgO2j0q73COKVU
  4061. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  4062. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-HxZ2p1OpCiL97BmBIlD6wM-haskell-language-server-wrapper
  4063. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  4064. 1314.09 s [haskell-language-server] depends containers-0.7-d79e
  4065. 1314.09 s [haskell-language-server] depends data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  4066. 1314.09 s [haskell-language-server] depends directory-1.3.9.0-d362
  4067. 1314.09 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  4068. 1314.09 s [haskell-language-server] depends filepath-1.5.4.0-7227
  4069. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  4070. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  4071. 1314.09 s [haskell-language-server] depends hie-bios-0.17.0-6pUYY6S9WdzoSMMYkMGYM
  4072. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  4073. 1314.09 s [haskell-language-server] depends lsp-2.7.0.1-DFrEXuFJnBXoeIpk6qG4C
  4074. 1314.09 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  4075. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  4076. 1314.09 s [haskell-language-server] depends transformers-0.6.1.2-2558
  4077. 1314.09 s [haskell-language-server] depends unix-2.8.6.0-935f
  4078. 1314.09 s [haskell-language-server] depends unliftio-core-0.2.1.0-2ZDzQCO10Uh1msYqIQQbyS
  4079. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib
  4080. 1314.09 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  4081. 1314.09 s [haskell-language-server] depends async-2.2.5-AWWz4gxrFBv1N6ln4ZBS5r
  4082. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  4083. 1314.09 s [haskell-language-server] depends binary-0.8.9.3-f492
  4084. 1314.09 s [haskell-language-server] depends bytestring-0.12.2.0-0cf8
  4085. 1314.09 s [haskell-language-server] depends deepseq-1.5.1.0-3c62
  4086. 1314.09 s [haskell-language-server] depends directory-1.3.9.0-d362
  4087. 1314.09 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  4088. 1314.09 s [haskell-language-server] depends filepath-1.5.4.0-7227
  4089. 1314.09 s [haskell-language-server] depends ghcide-2.12.0.0-Eio58qFGVFd32FFPdY15fy
  4090. 1314.09 s [haskell-language-server] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  4091. 1314.09 s [haskell-language-server] depends hls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z
  4092. 1314.09 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  4093. 1314.09 s [haskell-language-server] depends lsp-test-0.17.1.1-agQol3PhMICp63Sv6kHt9
  4094. 1314.09 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  4095. 1314.09 s [haskell-language-server] depends optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  4096. 1314.09 s [haskell-language-server] depends parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm
  4097. 1314.09 s [haskell-language-server] depends process-1.6.25.0-bd82
  4098. 1314.09 s [haskell-language-server] depends row-types-1.0.1.2-GZg3ld1Ox7ZBgEJw0sdFce
  4099. 1314.09 s [haskell-language-server] depends safe-exceptions-0.1.7.4-7ovuwkV6YUgBVHzXPijSe1
  4100. 1314.09 s [haskell-language-server] depends shake-0.19.8-83V2vcL3yghJTj9oLQn0vi
  4101. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  4102. 1314.09 s [haskell-language-server] definite haskell-language-server-2.12.0.0-3XkIiHOlOkbAFpVJygdKKn-ghcide-bench
  4103. 1314.09 s [haskell-language-server] depends aeson-2.2.3.0-DD9nmBgoxR67v3ZDLmzDcF
  4104. 1314.09 s [haskell-language-server] depends base-4.21.0.0-b334
  4105. 1314.09 s [haskell-language-server] depends bytestring-0.12.2.0-0cf8
  4106. 1314.09 s [haskell-language-server] depends containers-0.7-d79e
  4107. 1314.09 s [haskell-language-server] depends data-default-0.8.0.1-HVGYGNJQU463kBPeiiLoRo
  4108. 1314.09 s [haskell-language-server] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  4109. 1314.09 s [haskell-language-server] depends filepath-1.5.4.0-7227
  4110. 1314.09 s [haskell-language-server] depends haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib
  4111. 1314.09 s [haskell-language-server] depends hls-graph-2.12.0.0-JFkkbKSt0qaBQIpdeOJOhx
  4112. 1314.09 s [haskell-language-server] depends hls-plugin-api-2.12.0.0-JDKnF5wofq4Lc2Kb8QBJ0D
  4113. 1314.09 s [haskell-language-server] depends hls-test-utils-2.12.0.0-KNVxGTFSJexDO86v3yR94Z
  4114. 1314.09 s [haskell-language-server] depends lens-5.3.5-5MFP3aS1iyk5vIxmqBTQxf
  4115. 1314.09 s [haskell-language-server] depends lsp-test-0.17.1.1-agQol3PhMICp63Sv6kHt9
  4116. 1314.09 s [haskell-language-server] depends lsp-types-2.3.0.1-BsUD3FZPCiTIrhJyxFfyc3
  4117. 1314.09 s [haskell-language-server] depends optparse-applicative-0.18.1.0-BLGFbfS429e6HziW9i5eeF
  4118. 1314.09 s [haskell-language-server] depends process-1.6.25.0-bd82
  4119. 1314.09 s [haskell-language-server] depends safe-exceptions-0.1.7.4-7ovuwkV6YUgBVHzXPijSe1
  4120. 1314.09 s [haskell-language-server] depends shake-0.19.8-83V2vcL3yghJTj9oLQn0vi
  4121. 1314.09 s [haskell-language-server] depends tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  4122. 1314.09 s [haskell-language-server] depends text-2.1.2-e822
  4123. 1314.09 s [haskell-language-server] Using Cabal-3.14.1.0 compiled by ghc-9.12
  4124. 1314.09 s [haskell-language-server] Using compiler: ghc-9.12.2
  4125. 1314.28 s [haskell-language-server] Using install prefix:
  4126. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0
  4127. 1314.28 s [haskell-language-server] Executables installed in:
  4128. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  4129. 1314.28 s [haskell-language-server] Libraries installed in:
  4130. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  4131. 1314.28 s [haskell-language-server] Dynamic Libraries installed in:
  4132. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  4133. 1314.28 s [haskell-language-server] Private executables installed in:
  4134. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/libexec/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0
  4135. 1314.28 s [haskell-language-server] Data files installed in:
  4136. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/share/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0
  4137. 1314.28 s [haskell-language-server] Documentation installed in:
  4138. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/share/doc/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0
  4139. 1314.28 s [haskell-language-server] Configuration files installed in:
  4140. 1314.28 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/etc
  4141. 1314.28 s [haskell-language-server] No alex found
  4142. 1314.28 s [haskell-language-server] Using ar found on system at:
  4143. 1314.28 s [haskell-language-server] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4144. 1314.28 s [haskell-language-server] No c2hs found
  4145. 1314.28 s [haskell-language-server] Using cpphs version 1.20.9 found on system at:
  4146. 1314.28 s [haskell-language-server] /nix/store/y22gmflcss5pnhgw67y5vqwibhrzl8g6-cpphs-1.20.10/bin/cpphs
  4147. 1314.28 s [haskell-language-server] No doctest found
  4148. 1314.28 s [haskell-language-server] Using gcc version 14.3.0 given by user at:
  4149. 1314.28 s [haskell-language-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4150. 1314.28 s [haskell-language-server] Using ghc version 9.12.2 found on system at:
  4151. 1314.28 s [haskell-language-server] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  4152. 1314.28 s [haskell-language-server] Using ghc-pkg version 9.12.2 found on system at:
  4153. 1314.28 s [haskell-language-server] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  4154. 1314.28 s [haskell-language-server] No ghcjs found
  4155. 1314.28 s [haskell-language-server] No ghcjs-pkg found
  4156. 1314.28 s [haskell-language-server] No greencard found
  4157. 1314.28 s [haskell-language-server] Using haddock version 2.30.0 found on system at:
  4158. 1314.28 s [haskell-language-server] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  4159. 1314.28 s [haskell-language-server] No happy found
  4160. 1314.28 s [haskell-language-server] No haskell-suite found
  4161. 1314.28 s [haskell-language-server] No haskell-suite-pkg found
  4162. 1314.28 s [haskell-language-server] No hmake found
  4163. 1314.28 s [haskell-language-server] Using hpc version 0.69 found on system at:
  4164. 1314.28 s [haskell-language-server] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  4165. 1314.28 s [haskell-language-server] Using hsc2hs version 0.68.10 found on system at:
  4166. 1314.28 s [haskell-language-server] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  4167. 1314.28 s [haskell-language-server] Using hscolour version 1.25 found on system at:
  4168. 1314.28 s [haskell-language-server] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  4169. 1314.28 s [haskell-language-server] No jhc found
  4170. 1314.28 s [haskell-language-server] Using ld found on system at:
  4171. 1314.28 s [haskell-language-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  4172. 1314.28 s [haskell-language-server] No pkg-config found
  4173. 1314.28 s [haskell-language-server] Using runghc version 9.12.2 found on system at:
  4174. 1314.28 s [haskell-language-server] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  4175. 1314.28 s [haskell-language-server] Using strip version 2.44 found on system at:
  4176. 1314.28 s [haskell-language-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4177. 1314.28 s [haskell-language-server] Using tar found on system at:
  4178. 1314.28 s [haskell-language-server] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4179. 1314.28 s [haskell-language-server] No uhc found
  4180. 1314.60 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  4181. 1314.60 s [vector] src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
  4182. 1314.60 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4183. 1314.60 s [vector] • In the data declaration for ‘MVector’
  4184. 1314.60 s [vector] |
  4185. 1314.60 s [vector] 99 | deriving ( Typeable )
  4186. 1314.60 s [vector] | ^^^^^^^^
  4187. 1314.60 s [vector]
  4188. 1314.60 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  4189. 1314.88 s [vector] src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
  4190. 1314.88 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4191. 1314.88 s [vector] • In the data declaration for ‘Vector’
  4192. 1314.88 s [vector] |
  4193. 1314.88 s [vector] 222 | deriving ( Typeable )
  4194. 1314.88 s [vector] | ^^^^^^^^
  4195. 1314.88 s [vector]
  4196. 1315.40 s [haskell-language-server] Phase: buildPhase
  4197. 1315.59 s [haskell-language-server] Preprocessing library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0...
  4198. 1315.59 s [haskell-language-server] Building library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0...
  4199. 1315.74 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 )
  4200. 1319.29 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 )
  4201. 1326.91 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  4202. 1326.93 s [vector] src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
  4203. 1326.93 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4204. 1326.93 s [vector] • In the data declaration for ‘MVector’
  4205. 1326.93 s [vector] |
  4206. 1326.93 s [vector] 115 | deriving ( Typeable )
  4207. 1326.93 s [vector] | ^^^^^^^^
  4208. 1326.93 s [vector]
  4209. 1326.93 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  4210. 1326.93 s [vector] src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
  4211. 1326.93 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4212. 1326.93 s [vector] • In the data declaration for ‘Vector’
  4213. 1326.93 s [vector] |
  4214. 1326.93 s [vector] 209 | deriving ( Typeable )
  4215. 1326.93 s [vector] | ^^^^^^^^
  4216. 1326.93 s [vector]
  4217. 1326.93 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  4218. 1326.93 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  4219. 1326.93 s [vector] src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
  4220. 1326.93 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4221. 1326.93 s [vector] • In the data declaration for ‘MVector’
  4222. 1326.93 s [vector] |
  4223. 1326.93 s [vector] 134 | deriving ( Typeable )
  4224. 1326.93 s [vector] | ^^^^^^^^
  4225. 1326.93 s [vector]
  4226. 1326.94 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  4227. 1326.94 s [vector] src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
  4228. 1326.94 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4229. 1326.94 s [vector] • In the data declaration for ‘Vector’
  4230. 1326.94 s [vector] |
  4231. 1326.94 s [vector] 219 | deriving ( Typeable )
  4232. 1326.94 s [vector] | ^^^^^^^^
  4233. 1326.94 s [vector]
  4234. 1329.10 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  4235. 1329.10 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  4236. 1329.10 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4237. 1329.10 s [vector] • In the newtype declaration for ‘MVector’
  4238. 1329.10 s [vector] |
  4239. 1329.10 s [vector] 97 | deriving ( Typeable )
  4240. 1329.10 s [vector] | ^^^^^^^^
  4241. 1329.10 s [vector]
  4242. 1329.10 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  4243. 1329.10 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  4244. 1329.10 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4245. 1329.10 s [vector] • In the newtype declaration for ‘Vector’
  4246. 1329.10 s [vector] |
  4247. 1329.10 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  4248. 1329.10 s [vector] | ^^^^^^^^
  4249. 1329.10 s [vector]
  4250. 1332.94 s [haskell-language-server] Preprocessing library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0...
  4251. 1332.95 s [haskell-language-server] Building library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0...
  4252. 1333.09 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  4253. 1333.09 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  4254. 1333.09 s [haskell-language-server] but were not needed for compilation:
  4255. 1333.09 s [haskell-language-server] - ghc-9.12.2 (exposed by flag -package-id ghc-9.12.2-82d3)
  4256. 1333.09 s [haskell-language-server]
  4257. 1333.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.o, dist/build/hls-explicit-imports-plugin/Ide/Plugin/ExplicitImports.dyn_o )
  4258. 1336.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 )
  4259. 1336.81 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  4260. 1336.81 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4261. 1336.81 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  4262. 1336.81 s [vector] |
  4263. 1336.81 s [vector] 97 | deriving instance Typeable Vector
  4264. 1336.81 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4265. 1336.81 s [vector]
  4266. 1336.81 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  4267. 1336.81 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  4268. 1336.81 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  4269. 1336.81 s [vector] |
  4270. 1336.81 s [vector] 98 | deriving instance Typeable MVector
  4271. 1336.81 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  4272. 1336.81 s [vector]
  4273. 1341.44 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  4274. 1341.46 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  4275. 1341.46 s [haskell-language-server] but were not needed for compilation:
  4276. 1341.46 s [haskell-language-server] - ghc-9.12.2 (exposed by flag -package-id ghc-9.12.2-82d3)
  4277. 1341.46 s [haskell-language-server]
  4278. 1341.46 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 )
  4279. 1343.56 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  4280. 1352.34 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  4281. 1354.38 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  4282. 1354.38 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  4283. 1354.53 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 )
  4284. 1354.70 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 )
  4285. 1356.27 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 )
  4286. 1356.27 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4287. 1356.27 s [vector] In the use of ‘tail’
  4288. 1356.27 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4289. 1356.27 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4290. 1356.27 s [vector] |
  4291. 1356.27 s [vector] 244 | postscanl f z = tail . scanl f z
  4292. 1356.27 s [vector] | ^^^^
  4293. 1356.27 s [vector]
  4294. 1356.27 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4295. 1356.27 s [vector] In the use of ‘tail’
  4296. 1356.27 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4297. 1356.27 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4298. 1356.27 s [vector] |
  4299. 1356.27 s [vector] 245 | prescanr f z = tail . scanr f z
  4300. 1356.27 s [vector] | ^^^^
  4301. 1356.27 s [vector]
  4302. 1356.27 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 )
  4303. 1356.27 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4304. 1356.27 s [vector] In the use of ‘head’
  4305. 1356.27 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4306. 1356.27 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4307. 1356.27 s [vector] |
  4308. 1356.27 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4309. 1356.27 s [vector] | ^^^^
  4310. 1356.27 s [vector]
  4311. 1356.27 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4312. 1356.27 s [vector] In the use of ‘head’
  4313. 1356.27 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4314. 1356.27 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4315. 1356.27 s [vector] |
  4316. 1356.27 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4317. 1356.27 s [vector] | ^^^^
  4318. 1356.27 s [vector]
  4319. 1356.27 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4320. 1356.27 s [vector] In the use of ‘tail’
  4321. 1356.27 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4322. 1356.27 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4323. 1356.27 s [vector] |
  4324. 1356.27 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4325. 1356.27 s [vector] | ^^^^
  4326. 1356.27 s [vector]
  4327. 1356.27 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4328. 1356.27 s [vector] In the use of ‘head’
  4329. 1356.27 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4330. 1356.27 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4331. 1356.27 s [vector] |
  4332. 1356.27 s [vector] 439 | = V.uniq `eq` (map head . group)
  4333. 1356.27 s [vector] | ^^^^
  4334. 1356.27 s [vector]
  4335. 1357.48 s [haskell-language-server] Preprocessing library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0...
  4336. 1357.48 s [haskell-language-server] Building library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0...
  4337. 1357.64 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 )
  4338. 1358.08 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 )
  4339. 1358.26 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 )
  4340. 1358.26 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 )
  4341. 1358.26 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 )
  4342. 1358.26 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 )
  4343. 1358.26 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 )
  4344. 1358.26 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 )
  4345. 1358.26 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  4346. 1358.26 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  4347. 1358.26 s [vector] |
  4348. 1358.26 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  4349. 1358.26 s [vector] | ^^^^^^
  4350. 1358.26 s [vector]
  4351. 1358.26 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4352. 1358.26 s [vector] In the use of ‘head’
  4353. 1358.26 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4354. 1358.26 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4355. 1358.26 s [vector] |
  4356. 1358.26 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4357. 1358.26 s [vector] | ^^^^
  4358. 1358.26 s [vector]
  4359. 1358.26 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4360. 1358.26 s [vector] In the use of ‘tail’
  4361. 1358.26 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4362. 1358.26 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4363. 1358.26 s [vector] |
  4364. 1358.26 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4365. 1358.26 s [vector] | ^^^^
  4366. 1358.26 s [vector]
  4367. 1358.26 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 )
  4368. 1358.98 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  4369. 1359.30 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 )
  4370. 1360.21 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  4371. 1360.21 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  4372. 1360.28 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  4373. 1360.63 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  4374. 1361.25 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 )
  4375. 1362.23 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 )
  4376. 1364.14 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 )
  4377. 1366.20 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 )
  4378. 1366.31 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  4379. 1366.31 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  4380. 1366.66 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 )
  4381. 1366.95 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 )
  4382. 1376.23 s [haskell-language-server] Preprocessing library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0...
  4383. 1376.23 s [haskell-language-server] Building library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0...
  4384. 1376.43 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 )
  4385. 1377.56 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 )
  4386. 1377.56 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4387. 1377.56 s [vector] In the use of ‘tail’
  4388. 1377.56 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4389. 1377.56 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4390. 1377.56 s [vector] |
  4391. 1377.56 s [vector] 244 | postscanl f z = tail . scanl f z
  4392. 1377.56 s [vector] | ^^^^
  4393. 1377.56 s [vector]
  4394. 1377.56 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4395. 1377.57 s [vector] In the use of ‘tail’
  4396. 1377.57 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4397. 1377.57 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4398. 1377.57 s [vector] |
  4399. 1377.57 s [vector] 245 | prescanr f z = tail . scanr f z
  4400. 1377.57 s [vector] | ^^^^
  4401. 1377.57 s [vector]
  4402. 1377.57 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 )
  4403. 1377.57 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4404. 1377.57 s [vector] In the use of ‘head’
  4405. 1377.57 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4406. 1377.57 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4407. 1377.57 s [vector] |
  4408. 1377.57 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4409. 1377.57 s [vector] | ^^^^
  4410. 1377.57 s [vector]
  4411. 1377.57 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4412. 1377.57 s [vector] In the use of ‘head’
  4413. 1377.57 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4414. 1377.57 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4415. 1377.57 s [vector] |
  4416. 1377.57 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4417. 1377.57 s [vector] | ^^^^
  4418. 1377.57 s [vector]
  4419. 1377.57 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4420. 1377.57 s [vector] In the use of ‘tail’
  4421. 1377.57 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4422. 1377.57 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4423. 1377.57 s [vector] |
  4424. 1377.57 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4425. 1377.57 s [vector] | ^^^^
  4426. 1377.57 s [vector]
  4427. 1377.57 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4428. 1377.57 s [vector] In the use of ‘head’
  4429. 1377.57 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4430. 1377.57 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4431. 1377.57 s [vector] |
  4432. 1377.57 s [vector] 439 | = V.uniq `eq` (map head . group)
  4433. 1377.57 s [vector] | ^^^^
  4434. 1377.57 s [vector]
  4435. 1379.79 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 )
  4436. 1387.67 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 )
  4437. 1390.45 s [haskell-language-server] Preprocessing library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0...
  4438. 1390.45 s [haskell-language-server] Building library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0...
  4439. 1390.72 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 )
  4440. 1399.77 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 )
  4441. 1416.55 s [haskell-language-server] Preprocessing library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0...
  4442. 1416.55 s [haskell-language-server] Building library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0...
  4443. 1416.70 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  4444. 1416.70 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  4445. 1416.70 s [haskell-language-server] but were not needed for compilation:
  4446. 1416.70 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-D9txcsrhmkMJad9PAbqkUy)
  4447. 1416.70 s [haskell-language-server] - transformers-0.6.1.2 (exposed by flag -package-id transformers-0.6.1.2-2558)
  4448. 1416.70 s [haskell-language-server]
  4449. 1416.72 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 )
  4450. 1420.41 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 )
  4451. 1420.41 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 )
  4452. 1420.41 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 )
  4453. 1420.41 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 )
  4454. 1420.42 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 )
  4455. 1420.42 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 )
  4456. 1420.42 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  4457. 1420.42 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  4458. 1420.42 s [vector] |
  4459. 1420.42 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  4460. 1420.42 s [vector] | ^^^^^^
  4461. 1420.42 s [vector]
  4462. 1420.42 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4463. 1420.42 s [vector] In the use of ‘head’
  4464. 1420.42 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4465. 1420.42 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4466. 1420.42 s [vector] |
  4467. 1420.42 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4468. 1420.42 s [vector] | ^^^^
  4469. 1420.42 s [vector]
  4470. 1420.42 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4471. 1420.42 s [vector] In the use of ‘tail’
  4472. 1420.42 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4473. 1420.42 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4474. 1420.42 s [vector] |
  4475. 1420.42 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4476. 1420.42 s [vector] | ^^^^
  4477. 1420.42 s [vector]
  4478. 1420.42 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 )
  4479. 1421.30 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  4480. 1421.48 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  4481. 1421.48 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  4482. 1421.48 s [haskell-language-server] but were not needed for compilation:
  4483. 1421.48 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-D9txcsrhmkMJad9PAbqkUy)
  4484. 1421.48 s [haskell-language-server] - transformers-0.6.1.2 (exposed by flag -package-id transformers-0.6.1.2-2558)
  4485. 1421.48 s [haskell-language-server]
  4486. 1421.50 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 )
  4487. 1422.65 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  4488. 1422.65 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  4489. 1422.92 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  4490. 1423.77 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 )
  4491. 1423.77 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  4492. 1425.39 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  4493. 1426.56 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  4494. 1428.05 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  4495. 1428.06 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  4496. 1428.15 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 )
  4497. 1431.13 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 )
  4498. 1431.13 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 )
  4499. 1431.32 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 )
  4500. 1431.32 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 )
  4501. 1431.32 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 )
  4502. 1431.32 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 )
  4503. 1431.32 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 )
  4504. 1431.32 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 )
  4505. 1431.32 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 )
  4506. 1431.32 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 )
  4507. 1431.32 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 )
  4508. 1431.32 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 )
  4509. 1431.32 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 )
  4510. 1431.65 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 )
  4511. 1434.04 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 )
  4512. 1434.05 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 )
  4513. 1434.67 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 )
  4514. 1434.67 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 )
  4515. 1434.67 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 )
  4516. 1434.67 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 )
  4517. 1434.67 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 )
  4518. 1434.67 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 )
  4519. 1434.67 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 )
  4520. 1434.67 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 )
  4521. 1434.67 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  4522. 1434.67 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 )
  4523. 1434.67 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 )
  4524. 1434.93 s [haskell-language-server] Preprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0...
  4525. 1434.93 s [haskell-language-server] Building library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0...
  4526. 1435.04 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 )
  4527. 1439.06 s [vector] buildPhase completed in 3 minutes 59 seconds
  4528. 1439.06 s [vector] Phase: checkPhase
  4529. 1439.43 s [vector] Running 2 test suites...
  4530. 1439.43 s [vector] Test suite vector-tests-O0: RUNNING...
  4531. 1439.54 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 )
  4532. 1439.58 s [vector] toplevel
  4533. 1439.58 s [vector] Data.Vector.Fusion.Bundle
  4534. 1439.58 s [vector] fromList.toList == id: OK
  4535. 1439.58 s [vector] +++ OK, passed 100 tests.
  4536. 1439.58 s [vector] toList.fromList == id: OK
  4537. 1439.58 s [vector] +++ OK, passed 100 tests.
  4538. 1439.58 s [vector] eq: OK
  4539. 1439.58 s [vector] +++ OK, passed 100 tests.
  4540. 1439.58 s [vector] length: OK
  4541. 1439.58 s [vector] +++ OK, passed 100 tests.
  4542. 1439.58 s [vector] null: OK
  4543. 1439.58 s [vector] +++ OK, passed 100 tests.
  4544. 1439.58 s [vector] empty: OK
  4545. 1439.58 s [vector] +++ OK, passed 100 tests.
  4546. 1439.58 s [vector] singleton: OK
  4547. 1439.58 s [vector] +++ OK, passed 100 tests.
  4548. 1439.60 s [vector] replicate: OK
  4549. 1439.61 s [vector] +++ OK, passed 100 tests.
  4550. 1439.61 s [vector] cons: OK
  4551. 1439.61 s [vector] +++ OK, passed 100 tests.
  4552. 1439.61 s [vector] snoc: OK
  4553. 1439.61 s [vector] +++ OK, passed 100 tests.
  4554. 1439.61 s [vector] append: OK
  4555. 1439.61 s [vector] +++ OK, passed 100 tests.
  4556. 1439.61 s [vector] head: OK
  4557. 1439.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4558. 1439.61 s [vector] last: OK
  4559. 1439.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4560. 1439.61 s [vector] index: OK
  4561. 1439.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4562. 1439.61 s [vector] extract: OK
  4563. 1439.61 s [vector] +++ OK, passed 100 tests.
  4564. 1439.61 s [vector] init: OK
  4565. 1439.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4566. 1439.61 s [vector] tail: OK
  4567. 1439.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4568. 1439.61 s [vector] take: OK
  4569. 1439.61 s [vector] +++ OK, passed 100 tests.
  4570. 1439.61 s [vector] drop: OK
  4571. 1439.61 s [vector] +++ OK, passed 100 tests.
  4572. 1439.61 s [vector] map: OK
  4573. 1439.61 s [vector] +++ OK, passed 100 tests.
  4574. 1439.61 s [vector] zipWith: OK
  4575. 1439.61 s [vector] +++ OK, passed 100 tests.
  4576. 1439.61 s [vector] zipWith3: OK
  4577. 1439.61 s [vector] +++ OK, passed 100 tests.
  4578. 1439.61 s [vector] filter: OK
  4579. 1439.61 s [vector] +++ OK, passed 100 tests.
  4580. 1439.61 s [vector] takeWhile: OK
  4581. 1439.61 s [vector] +++ OK, passed 100 tests.
  4582. 1439.61 s [vector] dropWhile: OK
  4583. 1439.61 s [vector] +++ OK, passed 100 tests.
  4584. 1439.61 s [vector] elem: OK
  4585. 1439.61 s [vector] +++ OK, passed 100 tests.
  4586. 1439.61 s [vector] notElem: OK
  4587. 1439.61 s [vector] +++ OK, passed 100 tests.
  4588. 1439.61 s [vector] find: OK
  4589. 1439.61 s [vector] +++ OK, passed 100 tests.
  4590. 1439.61 s [vector] findIndex: OK
  4591. 1439.62 s [vector] +++ OK, passed 100 tests.
  4592. 1439.62 s [vector] foldl: OK (0.01s)
  4593. 1439.62 s [vector] +++ OK, passed 100 tests.
  4594. 1439.62 s [vector] foldl1: OK
  4595. 1439.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4596. 1439.63 s [vector] foldl': OK
  4597. 1439.63 s [vector] +++ OK, passed 100 tests.
  4598. 1439.63 s [vector] foldl1': OK
  4599. 1439.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4600. 1439.63 s [vector] foldr: OK
  4601. 1439.63 s [vector] +++ OK, passed 100 tests.
  4602. 1439.63 s [vector] foldr1: OK
  4603. 1439.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4604. 1439.63 s [vector] prescanl: OK
  4605. 1439.63 s [vector] +++ OK, passed 100 tests.
  4606. 1439.63 s [vector] prescanl': OK
  4607. 1439.63 s [vector] +++ OK, passed 100 tests.
  4608. 1439.63 s [vector] postscanl: OK
  4609. 1439.63 s [vector] +++ OK, passed 100 tests.
  4610. 1439.63 s [vector] postscanl': OK
  4611. 1439.63 s [vector] +++ OK, passed 100 tests.
  4612. 1439.63 s [vector] scanl: OK
  4613. 1439.63 s [vector] +++ OK, passed 100 tests.
  4614. 1439.63 s [vector] scanl': OK
  4615. 1439.63 s [vector] +++ OK, passed 100 tests.
  4616. 1439.63 s [vector] scanl1: OK
  4617. 1439.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4618. 1439.63 s [vector] scanl1': OK
  4619. 1439.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4620. 1439.63 s [vector] concatMap: OK
  4621. 1439.63 s [vector] +++ OK, passed 100 tests.
  4622. 1439.63 s [vector] unfoldr: OK
  4623. 1439.63 s [vector] +++ OK, passed 100 tests.
  4624. 1439.63 s [vector] and: OK
  4625. 1439.63 s [vector] +++ OK, passed 100 tests.
  4626. 1439.63 s [vector] or: OK
  4627. 1439.63 s [vector] +++ OK, passed 100 tests.
  4628. 1439.63 s [vector] Tests.Vector.Boxed
  4629. 1439.63 s [vector] Bool
  4630. 1439.63 s [vector] fromList.toList == id: OK
  4631. 1439.63 s [vector] +++ OK, passed 100 tests.
  4632. 1439.63 s [vector] toList.fromList == id: OK
  4633. 1439.64 s [vector] +++ OK, passed 100 tests.
  4634. 1439.64 s [vector] unstream.stream == id: OK
  4635. 1439.64 s [vector] +++ OK, passed 100 tests.
  4636. 1439.64 s [vector] stream.unstream == id: OK
  4637. 1439.64 s [vector] +++ OK, passed 100 tests.
  4638. 1439.64 s [vector] eq: OK
  4639. 1439.64 s [vector] +++ OK, passed 100 tests.
  4640. 1439.64 s [vector] length: OK
  4641. 1439.64 s [vector] +++ OK, passed 100 tests.
  4642. 1439.64 s [vector] null: OK
  4643. 1439.64 s [vector] +++ OK, passed 100 tests.
  4644. 1439.64 s [vector] index: OK
  4645. 1439.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4646. 1439.64 s [vector] safeIndex: OK
  4647. 1439.64 s [vector] +++ OK, passed 100 tests.
  4648. 1439.64 s [vector] head: OK
  4649. 1439.64 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4650. 1439.64 s [vector] last: OK
  4651. 1439.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4652. 1439.64 s [vector] unsafeIndex: OK
  4653. 1439.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4654. 1439.64 s [vector] unsafeHead: OK
  4655. 1439.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4656. 1439.64 s [vector] unsafeLast: OK
  4657. 1439.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4658. 1439.64 s [vector] slice: OK
  4659. 1439.64 s [vector] +++ OK, passed 100 tests.
  4660. 1439.64 s [vector] init: OK
  4661. 1439.64 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4662. 1439.64 s [vector] tail: OK
  4663. 1439.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4664. 1439.64 s [vector] take: OK
  4665. 1439.64 s [vector] +++ OK, passed 100 tests.
  4666. 1439.64 s [vector] drop: OK
  4667. 1439.64 s [vector] +++ OK, passed 100 tests.
  4668. 1439.64 s [vector] splitAt: OK
  4669. 1439.64 s [vector] +++ OK, passed 100 tests.
  4670. 1439.64 s [vector] empty: OK
  4671. 1439.64 s [vector] +++ OK, passed 100 tests.
  4672. 1439.64 s [vector] singleton: OK
  4673. 1439.64 s [vector] +++ OK, passed 100 tests.
  4674. 1439.64 s [vector] replicate: OK
  4675. 1439.64 s [vector] +++ OK, passed 100 tests.
  4676. 1439.64 s [vector] generate: OK
  4677. 1439.64 s [vector] +++ OK, passed 100 tests.
  4678. 1439.64 s [vector] iterateN: OK
  4679. 1439.64 s [vector] +++ OK, passed 100 tests.
  4680. 1439.64 s [vector] iterateNM: OK (0.05s)
  4681. 1439.64 s [vector] +++ OK, passed 100 tests.
  4682. 1439.64 s [vector] generateM: OK (0.02s)
  4683. 1439.64 s [vector] +++ OK, passed 100 tests.
  4684. 1439.64 s [vector] replicateM: OK
  4685. 1439.64 s [vector] +++ OK, passed 100 tests.
  4686. 1439.64 s [vector] create: OK
  4687. 1439.64 s [vector] +++ OK, passed 100 tests.
  4688. 1439.65 s [vector] createT: OK
  4689. 1439.65 s [vector] +++ OK, passed 100 tests.
  4690. 1439.65 s [vector] unfoldr: OK
  4691. 1439.65 s [vector] +++ OK, passed 100 tests.
  4692. 1439.65 s [vector] unfoldrN: OK
  4693. 1439.65 s [vector] +++ OK, passed 100 tests.
  4694. 1439.65 s [vector] unfoldrExactN: OK
  4695. 1439.65 s [vector] +++ OK, passed 100 tests.
  4696. 1439.65 s [vector] unfoldrM: OK
  4697. 1439.65 s [vector] +++ OK, passed 100 tests.
  4698. 1439.65 s [vector] unfoldrNM: OK
  4699. 1439.65 s [vector] +++ OK, passed 100 tests.
  4700. 1439.67 s [vector] unfoldrExactNM: OK (0.02s)
  4701. 1439.67 s [vector] +++ OK, passed 100 tests.
  4702. 1439.67 s [vector] constructN: OK
  4703. 1439.67 s [vector] +++ OK, passed 100 tests.
  4704. 1439.67 s [vector] constructrN: OK
  4705. 1439.67 s [vector] +++ OK, passed 100 tests.
  4706. 1439.67 s [vector] cons: OK
  4707. 1439.67 s [vector] +++ OK, passed 100 tests.
  4708. 1439.67 s [vector] snoc: OK
  4709. 1439.67 s [vector] +++ OK, passed 100 tests.
  4710. 1439.67 s [vector] append: OK
  4711. 1439.67 s [vector] +++ OK, passed 100 tests.
  4712. 1439.68 s [vector] concat: OK (0.01s)
  4713. 1439.68 s [vector] +++ OK, passed 100 tests.
  4714. 1439.68 s [vector] force: OK
  4715. 1439.68 s [vector] +++ OK, passed 100 tests.
  4716. 1439.68 s [vector] upd: OK
  4717. 1439.68 s [vector] +++ OK, passed 100 tests.
  4718. 1439.69 s [vector] accum: OK
  4719. 1439.69 s [vector] +++ OK, passed 100 tests.
  4720. 1439.69 s [vector] reverse: OK
  4721. 1439.69 s [vector] +++ OK, passed 100 tests.
  4722. 1439.69 s [vector] backpermute: OK
  4723. 1439.69 s [vector] +++ OK, passed 100 tests.
  4724. 1439.70 s [vector] map: OK
  4725. 1439.70 s [vector] +++ OK, passed 100 tests.
  4726. 1439.71 s [vector] imap: OK
  4727. 1439.71 s [vector] +++ OK, passed 100 tests.
  4728. 1439.71 s [vector] concatMap: OK
  4729. 1439.71 s [vector] +++ OK, passed 100 tests.
  4730. 1439.71 s [vector] mapM: OK
  4731. 1439.71 s [vector] +++ OK, passed 100 tests.
  4732. 1439.71 s [vector] mapM_: OK (0.01s)
  4733. 1439.71 s [vector] +++ OK, passed 100 tests.
  4734. 1439.73 s [vector] forM: OK
  4735. 1439.73 s [vector] +++ OK, passed 100 tests.
  4736. 1439.73 s [vector] forM_: OK (0.01s)
  4737. 1439.73 s [vector] +++ OK, passed 100 tests.
  4738. 1439.73 s [vector] imapM: OK
  4739. 1439.73 s [vector] +++ OK, passed 100 tests.
  4740. 1439.74 s [vector] imapM_: OK (0.01s)
  4741. 1439.75 s [vector] +++ OK, passed 100 tests.
  4742. 1439.75 s [vector] zipWith: OK
  4743. 1439.75 s [vector] +++ OK, passed 100 tests.
  4744. 1439.75 s [vector] zipWith3: OK
  4745. 1439.75 s [vector] +++ OK, passed 100 tests.
  4746. 1439.75 s [vector] izipWith: OK
  4747. 1439.75 s [vector] +++ OK, passed 100 tests.
  4748. 1439.76 s [vector] izipWith3: OK
  4749. 1439.76 s [vector] +++ OK, passed 100 tests.
  4750. 1439.76 s [vector] izipWithM: OK
  4751. 1439.77 s [vector] +++ OK, passed 100 tests.
  4752. 1439.77 s [vector] izipWithM_: OK (0.01s)
  4753. 1439.78 s [vector] +++ OK, passed 100 tests.
  4754. 1439.78 s [vector] zipWithM: OK
  4755. 1439.78 s [vector] +++ OK, passed 100 tests.
  4756. 1439.78 s [vector] zipWithM_: OK
  4757. 1439.78 s [vector] +++ OK, passed 100 tests.
  4758. 1439.78 s [vector] filter: OK
  4759. 1439.79 s [vector] +++ OK, passed 100 tests.
  4760. 1439.79 s [vector] ifilter: OK
  4761. 1439.79 s [vector] +++ OK, passed 100 tests.
  4762. 1439.81 s [vector] filterM: OK (0.02s)
  4763. 1439.81 s [vector] +++ OK, passed 100 tests.
  4764. 1439.81 s [vector] uniq: OK
  4765. 1439.81 s [vector] +++ OK, passed 100 tests.
  4766. 1439.81 s [vector] mapMaybe: OK
  4767. 1439.81 s [vector] +++ OK, passed 100 tests.
  4768. 1439.81 s [vector] imapMaybe: OK
  4769. 1439.81 s [vector] +++ OK, passed 100 tests.
  4770. 1439.81 s [vector] takeWhile: OK
  4771. 1439.81 s [vector] +++ OK, passed 100 tests.
  4772. 1439.81 s [vector] dropWhile: OK
  4773. 1439.81 s [vector] +++ OK, passed 100 tests.
  4774. 1439.81 s [vector] partition: OK
  4775. 1439.81 s [vector] +++ OK, passed 100 tests.
  4776. 1439.81 s [vector] partitionWith: OK
  4777. 1439.81 s [vector] +++ OK, passed 100 tests.
  4778. 1439.81 s [vector] span: OK
  4779. 1439.81 s [vector] +++ OK, passed 100 tests.
  4780. 1439.81 s [vector] break: OK
  4781. 1439.81 s [vector] +++ OK, passed 100 tests.
  4782. 1439.81 s [vector] spanR: OK
  4783. 1439.81 s [vector] +++ OK, passed 100 tests.
  4784. 1439.82 s [vector] breakR: OK
  4785. 1439.82 s [vector] +++ OK, passed 100 tests.
  4786. 1439.82 s [vector] groupBy: OK
  4787. 1439.82 s [vector] +++ OK, passed 100 tests.
  4788. 1439.82 s [vector] elem: OK
  4789. 1439.82 s [vector] +++ OK, passed 100 tests.
  4790. 1439.82 s [vector] notElem: OK
  4791. 1439.82 s [vector] +++ OK, passed 100 tests.
  4792. 1439.82 s [vector] find: OK
  4793. 1439.82 s [vector] +++ OK, passed 100 tests.
  4794. 1439.82 s [vector] findIndex: OK
  4795. 1439.82 s [vector] +++ OK, passed 100 tests.
  4796. 1439.82 s [vector] findIndexR: OK
  4797. 1439.82 s [vector] +++ OK, passed 100 tests.
  4798. 1439.82 s [vector] findIndices: OK
  4799. 1439.82 s [vector] +++ OK, passed 100 tests.
  4800. 1439.82 s [vector] elemIndex: OK
  4801. 1439.82 s [vector] +++ OK, passed 100 tests.
  4802. 1439.82 s [vector] elemIndices: OK
  4803. 1439.82 s [vector] +++ OK, passed 100 tests.
  4804. 1439.82 s [vector] foldl: OK
  4805. 1439.83 s [vector] +++ OK, passed 100 tests.
  4806. 1439.83 s [vector] foldl1: OK
  4807. 1439.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4808. 1439.83 s [vector] foldl': OK
  4809. 1439.83 s [vector] +++ OK, passed 100 tests.
  4810. 1439.83 s [vector] foldl1': OK
  4811. 1439.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4812. 1439.83 s [vector] foldr: OK
  4813. 1439.83 s [vector] +++ OK, passed 100 tests.
  4814. 1439.83 s [vector] foldr1: OK
  4815. 1439.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4816. 1439.83 s [vector] foldr': OK
  4817. 1439.83 s [vector] +++ OK, passed 100 tests.
  4818. 1439.83 s [vector] foldr1': OK
  4819. 1439.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4820. 1439.84 s [vector] ifoldl: OK
  4821. 1439.84 s [vector] +++ OK, passed 100 tests.
  4822. 1439.84 s [vector] ifoldl': OK
  4823. 1439.84 s [vector] +++ OK, passed 100 tests.
  4824. 1439.84 s [vector] ifoldr: OK
  4825. 1439.84 s [vector] +++ OK, passed 100 tests.
  4826. 1439.84 s [vector] ifoldr': OK
  4827. 1439.85 s [vector] +++ OK, passed 100 tests.
  4828. 1439.85 s [vector] ifoldM: OK
  4829. 1439.85 s [vector] +++ OK, passed 100 tests.
  4830. 1439.85 s [vector] ifoldM': OK
  4831. 1439.85 s [vector] +++ OK, passed 100 tests.
  4832. 1439.87 s [vector] ifoldM_: OK (0.02s)
  4833. 1439.87 s [vector] +++ OK, passed 100 tests.
  4834. 1439.88 s [vector] ifoldM'_: OK (0.01s)
  4835. 1439.88 s [vector] +++ OK, passed 100 tests.
  4836. 1439.88 s [vector] all: OK
  4837. 1439.88 s [vector] +++ OK, passed 100 tests.
  4838. 1439.88 s [vector] any: OK
  4839. 1439.88 s [vector] +++ OK, passed 100 tests.
  4840. 1439.88 s [vector] prescanl: OK
  4841. 1439.88 s [vector] +++ OK, passed 100 tests.
  4842. 1439.88 s [vector] prescanl': OK
  4843. 1439.88 s [vector] +++ OK, passed 100 tests.
  4844. 1439.88 s [vector] postscanl: OK
  4845. 1439.88 s [vector] +++ OK, passed 100 tests.
  4846. 1439.88 s [vector] postscanl': OK
  4847. 1439.88 s [vector] +++ OK, passed 100 tests.
  4848. 1439.89 s [vector] scanl: OK
  4849. 1439.89 s [vector] +++ OK, passed 100 tests.
  4850. 1439.89 s [vector] scanl': OK
  4851. 1439.89 s [vector] +++ OK, passed 100 tests.
  4852. 1439.89 s [vector] scanl1: OK
  4853. 1439.89 s [vector] +++ OK, passed 100 tests.
  4854. 1439.89 s [vector] scanl1': OK
  4855. 1439.90 s [vector] +++ OK, passed 100 tests.
  4856. 1439.90 s [vector] iscanl: OK
  4857. 1439.90 s [vector] +++ OK, passed 100 tests.
  4858. 1439.90 s [vector] iscanl': OK
  4859. 1439.90 s [vector] +++ OK, passed 100 tests.
  4860. 1439.90 s [vector] prescanr: OK
  4861. 1439.90 s [vector] +++ OK, passed 100 tests.
  4862. 1439.90 s [vector] prescanr': OK
  4863. 1439.90 s [vector] +++ OK, passed 100 tests.
  4864. 1439.90 s [vector] postscanr: OK
  4865. 1439.90 s [vector] +++ OK, passed 100 tests.
  4866. 1439.91 s [vector] postscanr': OK
  4867. 1439.91 s [vector] +++ OK, passed 100 tests.
  4868. 1439.91 s [vector] scanr: OK
  4869. 1439.91 s [vector] +++ OK, passed 100 tests.
  4870. 1439.91 s [vector] scanr': OK
  4871. 1439.91 s [vector] +++ OK, passed 100 tests.
  4872. 1439.91 s [vector] scanr1: OK
  4873. 1439.91 s [vector] +++ OK, passed 100 tests.
  4874. 1439.91 s [vector] scanr1': OK
  4875. 1439.91 s [vector] +++ OK, passed 100 tests.
  4876. 1439.91 s [vector] iscanr: OK
  4877. 1439.91 s [vector] +++ OK, passed 100 tests.
  4878. 1439.92 s [vector] iscanr': OK
  4879. 1439.92 s [vector] +++ OK, passed 100 tests.
  4880. 1439.93 s [vector] mut_read: OK
  4881. 1439.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4882. 1439.93 s [vector] mut_write: OK
  4883. 1439.93 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4884. 1439.93 s [vector] mut_modify: OK
  4885. 1439.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4886. 1439.93 s [vector] mut_generate: OK
  4887. 1439.93 s [vector] +++ OK, passed 100 tests.
  4888. 1439.93 s [vector] mut_generateM: OK
  4889. 1439.93 s [vector] +++ OK, passed 100 tests.
  4890. 1439.95 s [vector] mut_mapM_: OK (0.01s)
  4891. 1439.95 s [vector] +++ OK, passed 100 tests.
  4892. 1439.96 s [vector] mut_imapM_: OK (0.01s)
  4893. 1439.97 s [vector] +++ OK, passed 100 tests.
  4894. 1439.97 s [vector] mut_forM_: OK (0.01s)
  4895. 1439.97 s [vector] +++ OK, passed 100 tests.
  4896. 1439.98 s [vector] mut_iforM_: OK (0.01s)
  4897. 1439.98 s [vector] +++ OK, passed 100 tests.
  4898. 1439.98 s [vector] mut_foldr: OK
  4899. 1439.98 s [vector] +++ OK, passed 100 tests.
  4900. 1439.98 s [vector] mut_foldr': OK
  4901. 1439.98 s [vector] +++ OK, passed 100 tests.
  4902. 1439.98 s [vector] mut_foldl: OK
  4903. 1439.98 s [vector] +++ OK, passed 100 tests.
  4904. 1439.98 s [vector] mut_foldl': OK
  4905. 1439.98 s [vector] +++ OK, passed 100 tests.
  4906. 1439.99 s [vector] mut_ifoldr: OK
  4907. 1439.99 s [vector] +++ OK, passed 100 tests.
  4908. 1439.99 s [vector] mut_ifoldr': OK
  4909. 1439.99 s [vector] +++ OK, passed 100 tests.
  4910. 1439.99 s [vector] mut_ifoldl: OK
  4911. 1439.99 s [vector] +++ OK, passed 100 tests.
  4912. 1439.99 s [vector] mut_ifoldl': OK
  4913. 1439.99 s [vector] +++ OK, passed 100 tests.
  4914. 1439.99 s [vector] mut_foldM: OK
  4915. 1440.00 s [vector] +++ OK, passed 100 tests.
  4916. 1440.00 s [vector] mut_foldM': OK
  4917. 1440.00 s [vector] +++ OK, passed 100 tests.
  4918. 1440.00 s [vector] mut_foldrM: OK
  4919. 1440.00 s [vector] +++ OK, passed 100 tests.
  4920. 1440.00 s [vector] mut_foldrM': OK
  4921. 1440.00 s [vector] +++ OK, passed 100 tests.
  4922. 1440.01 s [vector] mut_ifoldM: OK
  4923. 1440.01 s [vector] +++ OK, passed 100 tests.
  4924. 1440.01 s [vector] mut_ifoldM': OK
  4925. 1440.01 s [vector] +++ OK, passed 100 tests.
  4926. 1440.01 s [vector] mut_ifoldrM: OK
  4927. 1440.01 s [vector] +++ OK, passed 100 tests.
  4928. 1440.01 s [vector] mut_ifoldrM': OK
  4929. 1440.01 s [vector] +++ OK, passed 100 tests.
  4930. 1440.01 s [vector] compare: OK
  4931. 1440.01 s [vector] +++ OK, passed 100 tests.
  4932. 1440.01 s [vector] maximum: OK
  4933. 1440.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4934. 1440.01 s [vector] minimum: OK
  4935. 1440.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4936. 1440.01 s [vector] minIndex: OK
  4937. 1440.01 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4938. 1440.01 s [vector] maxIndex: OK
  4939. 1440.01 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4940. 1440.01 s [vector] maximumBy: OK
  4941. 1440.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4942. 1440.01 s [vector] minimumBy: OK
  4943. 1440.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4944. 1440.02 s [vector] maximumOn: OK
  4945. 1440.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4946. 1440.02 s [vector] minimumOn: OK
  4947. 1440.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4948. 1440.02 s [vector] maxIndexBy: OK
  4949. 1440.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4950. 1440.02 s [vector] minIndexBy: OK
  4951. 1440.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4952. 1440.02 s [vector] ListFirstMaxIndexWins: OK
  4953. 1440.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4954. 1440.02 s [vector] FalseListFirstMaxIndexWins: OK
  4955. 1440.02 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  4956. 1440.02 s [vector] []
  4957. 1440.02 s [vector] zip: OK
  4958. 1440.02 s [vector] +++ OK, passed 100 tests.
  4959. 1440.02 s [vector] zip3: OK
  4960. 1440.02 s [vector] +++ OK, passed 100 tests.
  4961. 1440.02 s [vector] unzip: OK
  4962. 1440.02 s [vector] +++ OK, passed 100 tests.
  4963. 1440.02 s [vector] unzip3: OK
  4964. 1440.02 s [vector] +++ OK, passed 100 tests.
  4965. 1440.02 s [vector] indexed: OK
  4966. 1440.02 s [vector] +++ OK, passed 100 tests.
  4967. 1440.02 s [vector] update: OK
  4968. 1440.03 s [vector] +++ OK, passed 100 tests.
  4969. 1440.03 s [vector] concat: OK
  4970. 1440.03 s [vector] +++ OK, passed 100 tests.
  4971. 1440.03 s [vector] mempty: OK
  4972. 1440.03 s [vector] +++ OK, passed 100 tests.
  4973. 1440.03 s [vector] mappend: OK
  4974. 1440.03 s [vector] +++ OK, passed 100 tests.
  4975. 1440.04 s [vector] mconcat: OK
  4976. 1440.04 s [vector] +++ OK, passed 100 tests.
  4977. 1440.04 s [vector] fmap: OK
  4978. 1440.04 s [vector] +++ OK, passed 100 tests.
  4979. 1440.05 s [vector] return: OK
  4980. 1440.05 s [vector] +++ OK, passed 100 tests.
  4981. 1440.06 s [vector] bind: OK (0.01s)
  4982. 1440.06 s [vector] +++ OK, passed 100 tests.
  4983. 1440.06 s [vector] mzip: OK
  4984. 1440.06 s [vector] +++ OK, passed 100 tests.
  4985. 1440.06 s [vector] munzip: OK
  4986. 1440.06 s [vector] +++ OK, passed 100 tests.
  4987. 1440.07 s [vector] applicative_pure: OK
  4988. 1440.07 s [vector] +++ OK, passed 100 tests.
  4989. 1440.08 s [vector] applicative_appl: OK (0.02s)
  4990. 1440.08 s [vector] +++ OK, passed 100 tests.
  4991. 1440.08 s [vector] alternative_empty: OK
  4992. 1440.08 s [vector] +++ OK, passed 100 tests.
  4993. 1440.09 s [vector] alternative_or: OK
  4994. 1440.09 s [vector] +++ OK, passed 100 tests.
  4995. 1440.11 s [vector] sequence: OK (0.02s)
  4996. 1440.11 s [vector] +++ OK, passed 100 tests.
  4997. 1440.12 s [vector] sequence_: OK (0.02s)
  4998. 1440.12 s [vector] +++ OK, passed 100 tests.
  4999. 1440.12 s [vector] glength: OK
  5000. 1440.12 s [vector] +++ OK, passed 100 tests.
  5001. 1440.12 s [vector] and: OK
  5002. 1440.12 s [vector] +++ OK, passed 100 tests.
  5003. 1440.12 s [vector] or: OK
  5004. 1440.12 s [vector] +++ OK, passed 100 tests.
  5005. 1440.12 s [vector] Int
  5006. 1440.12 s [vector] fromList.toList == id: OK
  5007. 1440.12 s [vector] +++ OK, passed 100 tests.
  5008. 1440.12 s [vector] toList.fromList == id: OK
  5009. 1440.12 s [vector] +++ OK, passed 100 tests.
  5010. 1440.12 s [vector] unstream.stream == id: OK
  5011. 1440.12 s [vector] +++ OK, passed 100 tests.
  5012. 1440.12 s [vector] stream.unstream == id: OK
  5013. 1440.12 s [vector] +++ OK, passed 100 tests.
  5014. 1440.12 s [vector] eq: OK
  5015. 1440.12 s [vector] +++ OK, passed 100 tests.
  5016. 1440.12 s [vector] length: OK
  5017. 1440.12 s [vector] +++ OK, passed 100 tests.
  5018. 1440.12 s [vector] null: OK
  5019. 1440.12 s [vector] +++ OK, passed 100 tests.
  5020. 1440.12 s [vector] index: OK
  5021. 1440.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5022. 1440.13 s [vector] safeIndex: OK
  5023. 1440.13 s [vector] +++ OK, passed 100 tests.
  5024. 1440.13 s [vector] head: OK
  5025. 1440.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5026. 1440.13 s [vector] last: OK
  5027. 1440.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5028. 1440.13 s [vector] unsafeIndex: OK
  5029. 1440.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5030. 1440.13 s [vector] unsafeHead: OK
  5031. 1440.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5032. 1440.13 s [vector] unsafeLast: OK
  5033. 1440.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5034. 1440.13 s [vector] slice: OK
  5035. 1440.13 s [vector] +++ OK, passed 100 tests.
  5036. 1440.13 s [vector] init: OK
  5037. 1440.13 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5038. 1440.13 s [vector] tail: OK
  5039. 1440.13 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5040. 1440.13 s [vector] take: OK
  5041. 1440.13 s [vector] +++ OK, passed 100 tests.
  5042. 1440.13 s [vector] drop: OK
  5043. 1440.13 s [vector] +++ OK, passed 100 tests.
  5044. 1440.13 s [vector] splitAt: OK
  5045. 1440.13 s [vector] +++ OK, passed 100 tests.
  5046. 1440.13 s [vector] empty: OK
  5047. 1440.13 s [vector] +++ OK, passed 100 tests.
  5048. 1440.13 s [vector] singleton: OK
  5049. 1440.13 s [vector] +++ OK, passed 100 tests.
  5050. 1440.13 s [vector] replicate: OK
  5051. 1440.13 s [vector] +++ OK, passed 100 tests.
  5052. 1440.13 s [vector] generate: OK
  5053. 1440.13 s [vector] +++ OK, passed 100 tests.
  5054. 1440.13 s [vector] iterateN: OK
  5055. 1440.15 s [vector] +++ OK, passed 100 tests.
  5056. 1440.19 s [vector] iterateNM: OK (0.04s)
  5057. 1440.19 s [vector] +++ OK, passed 100 tests.
  5058. 1440.20 s [vector] generateM: OK (0.02s)
  5059. 1440.20 s [vector] +++ OK, passed 100 tests.
  5060. 1440.20 s [vector] replicateM: OK
  5061. 1440.20 s [vector] +++ OK, passed 100 tests.
  5062. 1440.20 s [vector] create: OK
  5063. 1440.20 s [vector] +++ OK, passed 100 tests.
  5064. 1440.21 s [vector] createT: OK
  5065. 1440.21 s [vector] +++ OK, passed 100 tests.
  5066. 1440.21 s [vector] unfoldr: OK
  5067. 1440.21 s [vector] +++ OK, passed 100 tests.
  5068. 1440.21 s [vector] unfoldrN: OK
  5069. 1440.21 s [vector] +++ OK, passed 100 tests.
  5070. 1440.21 s [vector] unfoldrExactN: OK
  5071. 1440.21 s [vector] +++ OK, passed 100 tests.
  5072. 1440.21 s [vector] unfoldrM: OK
  5073. 1440.21 s [vector] +++ OK, passed 100 tests.
  5074. 1440.23 s [vector] unfoldrNM: OK
  5075. 1440.23 s [vector] +++ OK, passed 100 tests.
  5076. 1440.25 s [vector] unfoldrExactNM: OK (0.03s)
  5077. 1440.25 s [vector] +++ OK, passed 100 tests.
  5078. 1440.25 s [vector] constructN: OK
  5079. 1440.25 s [vector] +++ OK, passed 100 tests.
  5080. 1440.25 s [vector] constructrN: OK
  5081. 1440.25 s [vector] +++ OK, passed 100 tests.
  5082. 1440.25 s [vector] cons: OK
  5083. 1440.25 s [vector] +++ OK, passed 100 tests.
  5084. 1440.25 s [vector] snoc: OK
  5085. 1440.26 s [vector] +++ OK, passed 100 tests.
  5086. 1440.26 s [vector] append: OK
  5087. 1440.26 s [vector] +++ OK, passed 100 tests.
  5088. 1440.27 s [vector] concat: OK (0.01s)
  5089. 1440.27 s [vector] +++ OK, passed 100 tests.
  5090. 1440.27 s [vector] force: OK
  5091. 1440.27 s [vector] +++ OK, passed 100 tests.
  5092. 1440.27 s [vector] upd: OK
  5093. 1440.27 s [vector] +++ OK, passed 100 tests.
  5094. 1440.27 s [vector] accum: OK
  5095. 1440.27 s [vector] +++ OK, passed 100 tests.
  5096. 1440.27 s [vector] reverse: OK
  5097. 1440.27 s [vector] +++ OK, passed 100 tests.
  5098. 1440.28 s [vector] backpermute: OK
  5099. 1440.28 s [vector] +++ OK, passed 100 tests.
  5100. 1440.28 s [vector] map: OK
  5101. 1440.28 s [vector] +++ OK, passed 100 tests.
  5102. 1440.29 s [vector] imap: OK
  5103. 1440.29 s [vector] +++ OK, passed 100 tests.
  5104. 1440.29 s [vector] concatMap: OK
  5105. 1440.29 s [vector] +++ OK, passed 100 tests.
  5106. 1440.29 s [vector] mapM: OK
  5107. 1440.29 s [vector] +++ OK, passed 100 tests.
  5108. 1440.31 s [vector] mapM_: OK (0.02s)
  5109. 1440.31 s [vector] +++ OK, passed 100 tests.
  5110. 1440.31 s [vector] forM: OK
  5111. 1440.31 s [vector] +++ OK, passed 100 tests.
  5112. 1440.33 s [vector] forM_: OK (0.02s)
  5113. 1440.33 s [vector] +++ OK, passed 100 tests.
  5114. 1440.33 s [vector] imapM: OK
  5115. 1440.33 s [vector] +++ OK, passed 100 tests.
  5116. 1440.35 s [vector] imapM_: OK (0.02s)
  5117. 1440.36 s [vector] +++ OK, passed 100 tests.
  5118. 1440.36 s [vector] zipWith: OK
  5119. 1440.36 s [vector] +++ OK, passed 100 tests.
  5120. 1440.36 s [vector] zipWith3: OK
  5121. 1440.36 s [vector] +++ OK, passed 100 tests.
  5122. 1440.36 s [vector] izipWith: OK
  5123. 1440.36 s [vector] +++ OK, passed 100 tests.
  5124. 1440.36 s [vector] izipWith3: OK
  5125. 1440.36 s [vector] +++ OK, passed 100 tests.
  5126. 1440.37 s [vector] izipWithM: OK
  5127. 1440.37 s [vector] +++ OK, passed 100 tests.
  5128. 1440.38 s [vector] izipWithM_: OK (0.01s)
  5129. 1440.39 s [vector] +++ OK, passed 100 tests.
  5130. 1440.39 s [vector] zipWithM: OK
  5131. 1440.39 s [vector] +++ OK, passed 100 tests.
  5132. 1440.40 s [vector] zipWithM_: OK (0.01s)
  5133. 1440.40 s [vector] +++ OK, passed 100 tests.
  5134. 1440.40 s [vector] filter: OK
  5135. 1440.40 s [vector] +++ OK, passed 100 tests.
  5136. 1440.40 s [vector] ifilter: OK
  5137. 1440.41 s [vector] +++ OK, passed 100 tests.
  5138. 1440.42 s [vector] filterM: OK (0.02s)
  5139. 1440.42 s [vector] +++ OK, passed 100 tests.
  5140. 1440.42 s [vector] uniq: OK
  5141. 1440.42 s [vector] +++ OK, passed 100 tests.
  5142. 1440.42 s [vector] mapMaybe: OK
  5143. 1440.42 s [vector] +++ OK, passed 100 tests.
  5144. 1440.42 s [vector] imapMaybe: OK
  5145. 1440.42 s [vector] +++ OK, passed 100 tests.
  5146. 1440.43 s [vector] takeWhile: OK
  5147. 1440.43 s [vector] +++ OK, passed 100 tests.
  5148. 1440.43 s [vector] dropWhile: OK
  5149. 1440.43 s [vector] +++ OK, passed 100 tests.
  5150. 1440.43 s [vector] partition: OK
  5151. 1440.43 s [vector] +++ OK, passed 100 tests.
  5152. 1440.43 s [vector] partitionWith: OK
  5153. 1440.43 s [vector] +++ OK, passed 100 tests.
  5154. 1440.43 s [vector] span: OK
  5155. 1440.43 s [vector] +++ OK, passed 100 tests.
  5156. 1440.43 s [vector] break: OK
  5157. 1440.43 s [vector] +++ OK, passed 100 tests.
  5158. 1440.43 s [vector] spanR: OK
  5159. 1440.43 s [vector] +++ OK, passed 100 tests.
  5160. 1440.43 s [vector] breakR: OK
  5161. 1440.43 s [vector] +++ OK, passed 100 tests.
  5162. 1440.44 s [vector] groupBy: OK
  5163. 1440.44 s [vector] +++ OK, passed 100 tests.
  5164. 1440.44 s [vector] elem: OK
  5165. 1440.44 s [vector] +++ OK, passed 100 tests.
  5166. 1440.44 s [vector] notElem: OK
  5167. 1440.44 s [vector] +++ OK, passed 100 tests.
  5168. 1440.44 s [vector] find: OK
  5169. 1440.44 s [vector] +++ OK, passed 100 tests.
  5170. 1440.44 s [vector] findIndex: OK
  5171. 1440.44 s [vector] +++ OK, passed 100 tests.
  5172. 1440.44 s [vector] findIndexR: OK
  5173. 1440.44 s [vector] +++ OK, passed 100 tests.
  5174. 1440.44 s [vector] findIndices: OK
  5175. 1440.44 s [vector] +++ OK, passed 100 tests.
  5176. 1440.44 s [vector] elemIndex: OK
  5177. 1440.44 s [vector] +++ OK, passed 100 tests.
  5178. 1440.45 s [vector] elemIndices: OK
  5179. 1440.45 s [vector] +++ OK, passed 100 tests.
  5180. 1440.45 s [vector] foldl: OK
  5181. 1440.45 s [vector] +++ OK, passed 100 tests.
  5182. 1440.45 s [vector] foldl1: OK
  5183. 1440.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5184. 1440.46 s [vector] foldl': OK
  5185. 1440.46 s [vector] +++ OK, passed 100 tests.
  5186. 1440.47 s [vector] foldl1': OK
  5187. 1440.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5188. 1440.47 s [vector] foldr: OK
  5189. 1440.48 s [vector] +++ OK, passed 100 tests.
  5190. 1440.48 s [vector] foldr1: OK
  5191. 1440.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5192. 1440.48 s [vector] foldr': OK
  5193. 1440.49 s [vector] +++ OK, passed 100 tests.
  5194. 1440.49 s [vector] foldr1': OK
  5195. 1440.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5196. 1440.49 s [vector] ifoldl: OK
  5197. 1440.49 s [vector] +++ OK, passed 100 tests.
  5198. 1440.49 s [vector] ifoldl': OK
  5199. 1440.49 s [vector] +++ OK, passed 100 tests.
  5200. 1440.49 s [vector] ifoldr: OK
  5201. 1440.49 s [vector] +++ OK, passed 100 tests.
  5202. 1440.49 s [vector] ifoldr': OK
  5203. 1440.49 s [vector] +++ OK, passed 100 tests.
  5204. 1440.49 s [vector] ifoldM: OK
  5205. 1440.49 s [vector] +++ OK, passed 100 tests.
  5206. 1440.49 s [vector] ifoldM': OK
  5207. 1440.49 s [vector] +++ OK, passed 100 tests.
  5208. 1440.51 s [vector] ifoldM_: OK (0.02s)
  5209. 1440.51 s [vector] +++ OK, passed 100 tests.
  5210. 1440.52 s [vector] ifoldM'_: OK (0.02s)
  5211. 1440.52 s [vector] +++ OK, passed 100 tests.
  5212. 1440.53 s [vector] all: OK
  5213. 1440.53 s [vector] +++ OK, passed 100 tests.
  5214. 1440.53 s [vector] any: OK
  5215. 1440.53 s [vector] +++ OK, passed 100 tests.
  5216. 1440.53 s [vector] prescanl: OK
  5217. 1440.53 s [vector] +++ OK, passed 100 tests.
  5218. 1440.53 s [vector] prescanl': OK
  5219. 1440.53 s [vector] +++ OK, passed 100 tests.
  5220. 1440.54 s [vector] postscanl: OK
  5221. 1440.54 s [vector] +++ OK, passed 100 tests.
  5222. 1440.54 s [vector] postscanl': OK
  5223. 1440.55 s [vector] +++ OK, passed 100 tests.
  5224. 1440.55 s [vector] scanl: OK
  5225. 1440.55 s [vector] +++ OK, passed 100 tests.
  5226. 1440.55 s [vector] scanl': OK
  5227. 1440.55 s [vector] +++ OK, passed 100 tests.
  5228. 1440.55 s [vector] scanl1: OK
  5229. 1440.55 s [vector] +++ OK, passed 100 tests.
  5230. 1440.55 s [vector] scanl1': OK
  5231. 1440.55 s [vector] +++ OK, passed 100 tests.
  5232. 1440.55 s [vector] iscanl: OK
  5233. 1440.55 s [vector] +++ OK, passed 100 tests.
  5234. 1440.55 s [vector] iscanl': OK
  5235. 1440.56 s [vector] +++ OK, passed 100 tests.
  5236. 1440.56 s [vector] prescanr: OK
  5237. 1440.56 s [vector] +++ OK, passed 100 tests.
  5238. 1440.56 s [vector] prescanr': OK
  5239. 1440.56 s [vector] +++ OK, passed 100 tests.
  5240. 1440.57 s [vector] postscanr: OK
  5241. 1440.57 s [vector] +++ OK, passed 100 tests.
  5242. 1440.57 s [vector] postscanr': OK
  5243. 1440.57 s [vector] +++ OK, passed 100 tests.
  5244. 1440.57 s [vector] scanr: OK
  5245. 1440.57 s [vector] +++ OK, passed 100 tests.
  5246. 1440.57 s [vector] scanr': OK
  5247. 1440.57 s [vector] +++ OK, passed 100 tests.
  5248. 1440.57 s [vector] scanr1: OK
  5249. 1440.57 s [vector] +++ OK, passed 100 tests.
  5250. 1440.57 s [vector] scanr1': OK
  5251. 1440.57 s [vector] +++ OK, passed 100 tests.
  5252. 1440.58 s [vector] iscanr: OK
  5253. 1440.58 s [vector] +++ OK, passed 100 tests.
  5254. 1440.58 s [vector] iscanr': OK
  5255. 1440.58 s [vector] +++ OK, passed 100 tests.
  5256. 1440.58 s [vector] mut_read: OK
  5257. 1440.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5258. 1440.58 s [vector] mut_write: OK
  5259. 1440.58 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5260. 1440.59 s [vector] mut_modify: OK
  5261. 1440.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5262. 1440.59 s [vector] mut_generate: OK
  5263. 1440.59 s [vector] +++ OK, passed 100 tests.
  5264. 1440.61 s [vector] mut_generateM: OK (0.02s)
  5265. 1440.61 s [vector] +++ OK, passed 100 tests.
  5266. 1440.65 s [vector] mut_mapM_: OK (0.03s)
  5267. 1440.65 s [vector] +++ OK, passed 100 tests.
  5268. 1440.67 s [vector] mut_imapM_: OK (0.02s)
  5269. 1440.67 s [vector] +++ OK, passed 100 tests.
  5270. 1440.69 s [vector] mut_forM_: OK (0.02s)
  5271. 1440.69 s [vector] +++ OK, passed 100 tests.
  5272. 1440.69 s [vector] mut_iforM_: OK (0.02s)
  5273. 1440.70 s [vector] +++ OK, passed 100 tests.
  5274. 1440.70 s [vector] mut_foldr: OK
  5275. 1440.70 s [vector] +++ OK, passed 100 tests.
  5276. 1440.70 s [vector] mut_foldr': OK
  5277. 1440.71 s [vector] +++ OK, passed 100 tests.
  5278. 1440.71 s [vector] mut_foldl: OK
  5279. 1440.71 s [vector] +++ OK, passed 100 tests.
  5280. 1440.72 s [vector] mut_foldl': OK
  5281. 1440.72 s [vector] +++ OK, passed 100 tests.
  5282. 1440.72 s [vector] mut_ifoldr: OK
  5283. 1440.73 s [vector] +++ OK, passed 100 tests.
  5284. 1440.73 s [vector] mut_ifoldr': OK
  5285. 1440.74 s [vector] +++ OK, passed 100 tests.
  5286. 1440.74 s [vector] mut_ifoldl: OK
  5287. 1440.74 s [vector] +++ OK, passed 100 tests.
  5288. 1440.74 s [vector] mut_ifoldl': OK
  5289. 1440.74 s [vector] +++ OK, passed 100 tests.
  5290. 1440.75 s [vector] mut_foldM: OK
  5291. 1440.75 s [vector] +++ OK, passed 100 tests.
  5292. 1440.75 s [vector] mut_foldM': OK
  5293. 1440.75 s [vector] +++ OK, passed 100 tests.
  5294. 1440.75 s [vector] mut_foldrM: OK
  5295. 1440.75 s [vector] +++ OK, passed 100 tests.
  5296. 1440.75 s [vector] mut_foldrM': OK
  5297. 1440.75 s [vector] +++ OK, passed 100 tests.
  5298. 1440.75 s [vector] mut_ifoldM: OK
  5299. 1440.75 s [vector] +++ OK, passed 100 tests.
  5300. 1440.75 s [vector] mut_ifoldM': OK
  5301. 1440.75 s [vector] +++ OK, passed 100 tests.
  5302. 1440.75 s [vector] mut_ifoldrM: OK
  5303. 1440.75 s [vector] +++ OK, passed 100 tests.
  5304. 1440.75 s [vector] mut_ifoldrM': OK
  5305. 1440.75 s [vector] +++ OK, passed 100 tests.
  5306. 1440.75 s [vector] compare: OK
  5307. 1440.75 s [vector] +++ OK, passed 100 tests.
  5308. 1440.75 s [vector] maximum: OK
  5309. 1440.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5310. 1440.75 s [vector] minimum: OK
  5311. 1440.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5312. 1440.75 s [vector] minIndex: OK
  5313. 1440.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5314. 1440.75 s [vector] maxIndex: OK
  5315. 1440.75 s [vector] +++ OK, passed 100 tests; 29 discarded.
  5316. 1440.75 s [vector] maximumBy: OK
  5317. 1440.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5318. 1440.75 s [vector] minimumBy: OK
  5319. 1440.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5320. 1440.75 s [vector] maximumOn: OK
  5321. 1440.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5322. 1440.75 s [vector] minimumOn: OK
  5323. 1440.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5324. 1440.75 s [vector] maxIndexBy: OK
  5325. 1440.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5326. 1440.75 s [vector] minIndexBy: OK
  5327. 1440.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5328. 1440.75 s [vector] ListFirstMaxIndexWins: OK
  5329. 1440.75 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5330. 1440.76 s [vector] FalseListFirstMaxIndexWins: OK
  5331. 1440.76 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5332. 1440.76 s [vector] []
  5333. 1440.76 s [vector] zip: OK
  5334. 1440.76 s [vector] +++ OK, passed 100 tests.
  5335. 1440.77 s [vector] zip3: OK
  5336. 1440.77 s [vector] +++ OK, passed 100 tests.
  5337. 1440.77 s [vector] unzip: OK
  5338. 1440.77 s [vector] +++ OK, passed 100 tests.
  5339. 1440.77 s [vector] unzip3: OK
  5340. 1440.77 s [vector] +++ OK, passed 100 tests.
  5341. 1440.79 s [vector] indexed: OK
  5342. 1440.79 s [vector] +++ OK, passed 100 tests.
  5343. 1440.79 s [vector] update: OK
  5344. 1440.79 s [vector] +++ OK, passed 100 tests.
  5345. 1440.79 s [vector] concat: OK (0.01s)
  5346. 1440.79 s [vector] +++ OK, passed 100 tests.
  5347. 1440.79 s [vector] mempty: OK
  5348. 1440.79 s [vector] +++ OK, passed 100 tests.
  5349. 1440.80 s [vector] mappend: OK
  5350. 1440.80 s [vector] +++ OK, passed 100 tests.
  5351. 1440.80 s [vector] mconcat: OK (0.01s)
  5352. 1440.80 s [vector] +++ OK, passed 100 tests.
  5353. 1440.80 s [vector] fmap: OK
  5354. 1440.80 s [vector] +++ OK, passed 100 tests.
  5355. 1440.80 s [vector] return: OK
  5356. 1440.80 s [vector] +++ OK, passed 100 tests.
  5357. 1440.81 s [vector] bind: OK (0.02s)
  5358. 1440.81 s [vector] +++ OK, passed 100 tests.
  5359. 1440.81 s [vector] mzip: OK
  5360. 1440.81 s [vector] +++ OK, passed 100 tests.
  5361. 1440.81 s [vector] munzip: OK
  5362. 1440.81 s [vector] +++ OK, passed 100 tests.
  5363. 1440.83 s [vector] applicative_pure: OK
  5364. 1440.83 s [vector] +++ OK, passed 100 tests.
  5365. 1440.86 s [vector] applicative_appl: OK (0.05s)
  5366. 1440.86 s [vector] +++ OK, passed 100 tests.
  5367. 1440.86 s [vector] alternative_empty: OK
  5368. 1440.86 s [vector] +++ OK, passed 100 tests.
  5369. 1440.87 s [vector] alternative_or: OK
  5370. 1440.87 s [vector] +++ OK, passed 100 tests.
  5371. 1440.90 s [vector] sequence: OK (0.04s)
  5372. 1440.90 s [vector] +++ OK, passed 100 tests.
  5373. 1440.91 s [vector] sequence_: OK (0.01s)
  5374. 1440.91 s [vector] +++ OK, passed 100 tests.
  5375. 1440.91 s [vector] glength: OK
  5376. 1440.91 s [vector] +++ OK, passed 100 tests.
  5377. 1440.91 s [vector] sum: OK
  5378. 1440.91 s [vector] +++ OK, passed 100 tests.
  5379. 1440.91 s [vector] product: OK
  5380. 1440.91 s [vector] +++ OK, passed 100 tests.
  5381. 1440.91 s [vector] enumFromN: OK
  5382. 1440.91 s [vector] +++ OK, passed 100 tests.
  5383. 1440.91 s [vector] enumFromThenN: OK
  5384. 1440.91 s [vector] +++ OK, passed 100 tests.
  5385. 1440.91 s [vector] enumFromTo: OK
  5386. 1440.91 s [vector] +++ OK, passed 100 tests.
  5387. 1440.91 s [vector] enumFromThenTo: OK
  5388. 1440.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5389. 1440.91 s [vector] unstream
  5390. 1440.91 s [vector] unstream == vunstream (exact): OK
  5391. 1440.92 s [vector] +++ OK, passed 100 tests.
  5392. 1440.92 s [vector] unstream == vunstream (unknown): OK
  5393. 1440.92 s [vector] +++ OK, passed 100 tests.
  5394. 1440.92 s [vector] unstreamR ~= vunstream (exact): OK
  5395. 1440.92 s [vector] +++ OK, passed 100 tests.
  5396. 1440.92 s [vector] unstreamR ~= vunstream (unknown): OK
  5397. 1440.92 s [vector] +++ OK, passed 100 tests.
  5398. 1440.92 s [vector] Tests.Vector.Primitive
  5399. 1440.92 s [vector] Int
  5400. 1440.92 s [vector] fromList.toList == id: OK
  5401. 1440.92 s [vector] +++ OK, passed 100 tests.
  5402. 1440.92 s [vector] toList.fromList == id: OK
  5403. 1440.92 s [vector] +++ OK, passed 100 tests.
  5404. 1440.92 s [vector] unstream.stream == id: OK
  5405. 1440.92 s [vector] +++ OK, passed 100 tests.
  5406. 1440.92 s [vector] stream.unstream == id: OK
  5407. 1440.92 s [vector] +++ OK, passed 100 tests.
  5408. 1440.92 s [vector] eq: OK
  5409. 1440.92 s [vector] +++ OK, passed 100 tests.
  5410. 1440.92 s [vector] length: OK
  5411. 1440.92 s [vector] +++ OK, passed 100 tests.
  5412. 1440.93 s [vector] null: OK
  5413. 1440.93 s [vector] +++ OK, passed 100 tests.
  5414. 1440.93 s [vector] index: OK
  5415. 1440.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5416. 1440.93 s [vector] safeIndex: OK
  5417. 1440.93 s [vector] +++ OK, passed 100 tests.
  5418. 1440.93 s [vector] head: OK
  5419. 1440.93 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5420. 1440.93 s [vector] last: OK
  5421. 1440.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5422. 1440.93 s [vector] unsafeIndex: OK
  5423. 1440.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5424. 1440.93 s [vector] unsafeHead: OK
  5425. 1440.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5426. 1440.93 s [vector] unsafeLast: OK
  5427. 1440.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5428. 1440.93 s [vector] slice: OK
  5429. 1440.93 s [vector] +++ OK, passed 100 tests.
  5430. 1440.93 s [vector] init: OK
  5431. 1440.93 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5432. 1440.93 s [vector] tail: OK
  5433. 1440.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5434. 1440.93 s [vector] take: OK
  5435. 1440.93 s [vector] +++ OK, passed 100 tests.
  5436. 1440.93 s [vector] drop: OK
  5437. 1440.93 s [vector] +++ OK, passed 100 tests.
  5438. 1440.95 s [vector] splitAt: OK
  5439. 1440.95 s [vector] +++ OK, passed 100 tests.
  5440. 1440.95 s [vector] empty: OK
  5441. 1440.95 s [vector] +++ OK, passed 100 tests.
  5442. 1440.95 s [vector] singleton: OK
  5443. 1440.95 s [vector] +++ OK, passed 100 tests.
  5444. 1440.95 s [vector] replicate: OK
  5445. 1440.95 s [vector] +++ OK, passed 100 tests.
  5446. 1440.95 s [vector] generate: OK
  5447. 1440.97 s [vector] +++ OK, passed 100 tests.
  5448. 1440.97 s [vector] iterateN: OK
  5449. 1440.97 s [vector] +++ OK, passed 100 tests.
  5450. 1440.97 s [vector] iterateNM: OK (0.02s)
  5451. 1440.97 s [vector] +++ OK, passed 100 tests.
  5452. 1440.97 s [vector] generateM: OK (0.02s)
  5453. 1440.97 s [vector] +++ OK, passed 100 tests.
  5454. 1440.98 s [vector] replicateM: OK
  5455. 1440.98 s [vector] +++ OK, passed 100 tests.
  5456. 1440.99 s [vector] create: OK
  5457. 1440.99 s [vector] +++ OK, passed 100 tests.
  5458. 1440.99 s [vector] createT: OK
  5459. 1440.99 s [vector] +++ OK, passed 100 tests.
  5460. 1440.99 s [vector] unfoldr: OK
  5461. 1440.99 s [vector] +++ OK, passed 100 tests.
  5462. 1440.99 s [vector] unfoldrN: OK
  5463. 1440.99 s [vector] +++ OK, passed 100 tests.
  5464. 1440.99 s [vector] unfoldrExactN: OK
  5465. 1440.99 s [vector] +++ OK, passed 100 tests.
  5466. 1440.99 s [vector] unfoldrM: OK
  5467. 1441.01 s [vector] +++ OK, passed 100 tests.
  5468. 1441.01 s [vector] unfoldrNM: OK
  5469. 1441.01 s [vector] +++ OK, passed 100 tests.
  5470. 1441.05 s [vector] unfoldrExactNM: OK (0.06s)
  5471. 1441.06 s [vector] +++ OK, passed 100 tests.
  5472. 1441.06 s [vector] constructN: OK
  5473. 1441.06 s [vector] +++ OK, passed 100 tests.
  5474. 1441.06 s [vector] constructrN: OK
  5475. 1441.06 s [vector] +++ OK, passed 100 tests.
  5476. 1441.06 s [vector] cons: OK
  5477. 1441.06 s [vector] +++ OK, passed 100 tests.
  5478. 1441.06 s [vector] snoc: OK
  5479. 1441.06 s [vector] +++ OK, passed 100 tests.
  5480. 1441.07 s [vector] append: OK
  5481. 1441.07 s [vector] +++ OK, passed 100 tests.
  5482. 1441.08 s [vector] concat: OK (0.02s)
  5483. 1441.08 s [vector] +++ OK, passed 100 tests.
  5484. 1441.08 s [vector] force: OK
  5485. 1441.08 s [vector] +++ OK, passed 100 tests.
  5486. 1441.08 s [vector] upd: OK
  5487. 1441.08 s [vector] +++ OK, passed 100 tests.
  5488. 1441.09 s [vector] accum: OK
  5489. 1441.09 s [vector] +++ OK, passed 100 tests.
  5490. 1441.09 s [vector] reverse: OK
  5491. 1441.09 s [vector] +++ OK, passed 100 tests.
  5492. 1441.09 s [vector] backpermute: OK
  5493. 1441.09 s [vector] +++ OK, passed 100 tests.
  5494. 1441.10 s [vector] map: OK
  5495. 1441.10 s [vector] +++ OK, passed 100 tests.
  5496. 1441.11 s [vector] imap: OK
  5497. 1441.11 s [vector] +++ OK, passed 100 tests.
  5498. 1441.11 s [vector] concatMap: OK
  5499. 1441.11 s [vector] +++ OK, passed 100 tests.
  5500. 1441.11 s [vector] mapM: OK
  5501. 1441.11 s [vector] +++ OK, passed 100 tests.
  5502. 1441.12 s [vector] mapM_: OK (0.02s)
  5503. 1441.13 s [vector] +++ OK, passed 100 tests.
  5504. 1441.13 s [vector] forM: OK
  5505. 1441.13 s [vector] +++ OK, passed 100 tests.
  5506. 1441.15 s [vector] forM_: OK (0.02s)
  5507. 1441.15 s [vector] +++ OK, passed 100 tests.
  5508. 1441.15 s [vector] imapM: OK
  5509. 1441.15 s [vector] +++ OK, passed 100 tests.
  5510. 1441.17 s [vector] imapM_: OK (0.02s)
  5511. 1441.18 s [vector] +++ OK, passed 100 tests.
  5512. 1441.18 s [vector] zipWith: OK
  5513. 1441.18 s [vector] +++ OK, passed 100 tests.
  5514. 1441.18 s [vector] zipWith3: OK
  5515. 1441.18 s [vector] +++ OK, passed 100 tests.
  5516. 1441.18 s [vector] izipWith: OK
  5517. 1441.18 s [vector] +++ OK, passed 100 tests.
  5518. 1441.18 s [vector] izipWith3: OK
  5519. 1441.18 s [vector] +++ OK, passed 100 tests.
  5520. 1441.19 s [vector] izipWithM: OK
  5521. 1441.19 s [vector] +++ OK, passed 100 tests.
  5522. 1441.21 s [vector] izipWithM_: OK (0.02s)
  5523. 1441.21 s [vector] +++ OK, passed 100 tests.
  5524. 1441.21 s [vector] zipWithM: OK
  5525. 1441.21 s [vector] +++ OK, passed 100 tests.
  5526. 1441.22 s [vector] zipWithM_: OK (0.01s)
  5527. 1441.22 s [vector] +++ OK, passed 100 tests.
  5528. 1441.22 s [vector] filter: OK
  5529. 1441.22 s [vector] +++ OK, passed 100 tests.
  5530. 1441.23 s [vector] ifilter: OK
  5531. 1441.23 s [vector] +++ OK, passed 100 tests.
  5532. 1441.26 s [vector] filterM: OK (0.03s)
  5533. 1441.26 s [vector] +++ OK, passed 100 tests.
  5534. 1441.26 s [vector] uniq: OK
  5535. 1441.26 s [vector] +++ OK, passed 100 tests.
  5536. 1441.26 s [vector] mapMaybe: OK
  5537. 1441.26 s [vector] +++ OK, passed 100 tests.
  5538. 1441.27 s [vector] imapMaybe: OK
  5539. 1441.27 s [vector] +++ OK, passed 100 tests.
  5540. 1441.27 s [vector] takeWhile: OK
  5541. 1441.27 s [vector] +++ OK, passed 100 tests.
  5542. 1441.27 s [vector] dropWhile: OK
  5543. 1441.27 s [vector] +++ OK, passed 100 tests.
  5544. 1441.27 s [vector] partition: OK
  5545. 1441.27 s [vector] +++ OK, passed 100 tests.
  5546. 1441.27 s [vector] partitionWith: OK
  5547. 1441.27 s [vector] +++ OK, passed 100 tests.
  5548. 1441.27 s [vector] span: OK
  5549. 1441.27 s [vector] +++ OK, passed 100 tests.
  5550. 1441.27 s [vector] break: OK
  5551. 1441.28 s [vector] +++ OK, passed 100 tests.
  5552. 1441.28 s [vector] spanR: OK
  5553. 1441.28 s [vector] +++ OK, passed 100 tests.
  5554. 1441.29 s [vector] breakR: OK
  5555. 1441.29 s [vector] +++ OK, passed 100 tests.
  5556. 1441.29 s [vector] groupBy: OK
  5557. 1441.29 s [vector] +++ OK, passed 100 tests.
  5558. 1441.29 s [vector] elem: OK
  5559. 1441.29 s [vector] +++ OK, passed 100 tests.
  5560. 1441.29 s [vector] notElem: OK
  5561. 1441.29 s [vector] +++ OK, passed 100 tests.
  5562. 1441.29 s [vector] find: OK
  5563. 1441.29 s [vector] +++ OK, passed 100 tests.
  5564. 1441.29 s [vector] findIndex: OK
  5565. 1441.29 s [vector] +++ OK, passed 100 tests.
  5566. 1441.30 s [vector] findIndexR: OK
  5567. 1441.30 s [vector] +++ OK, passed 100 tests.
  5568. 1441.30 s [vector] findIndices: OK
  5569. 1441.30 s [vector] +++ OK, passed 100 tests.
  5570. 1441.30 s [vector] elemIndex: OK
  5571. 1441.30 s [vector] +++ OK, passed 100 tests.
  5572. 1441.30 s [vector] elemIndices: OK
  5573. 1441.30 s [vector] +++ OK, passed 100 tests.
  5574. 1441.31 s [vector] foldl: OK
  5575. 1441.31 s [vector] +++ OK, passed 100 tests.
  5576. 1441.31 s [vector] foldl1: OK
  5577. 1441.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5578. 1441.31 s [vector] foldl': OK
  5579. 1441.32 s [vector] +++ OK, passed 100 tests.
  5580. 1441.32 s [vector] foldl1': OK
  5581. 1441.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5582. 1441.33 s [vector] foldr: OK
  5583. 1441.33 s [vector] +++ OK, passed 100 tests.
  5584. 1441.33 s [vector] foldr1: OK
  5585. 1441.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5586. 1441.33 s [vector] foldr': OK
  5587. 1441.34 s [vector] +++ OK, passed 100 tests.
  5588. 1441.34 s [vector] foldr1': OK
  5589. 1441.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5590. 1441.35 s [vector] ifoldl: OK
  5591. 1441.35 s [vector] +++ OK, passed 100 tests.
  5592. 1441.35 s [vector] ifoldl': OK
  5593. 1441.35 s [vector] +++ OK, passed 100 tests.
  5594. 1441.35 s [vector] ifoldr: OK
  5595. 1441.35 s [vector] +++ OK, passed 100 tests.
  5596. 1441.36 s [vector] ifoldr': OK
  5597. 1441.36 s [vector] +++ OK, passed 100 tests.
  5598. 1441.36 s [vector] ifoldM: OK
  5599. 1441.36 s [vector] +++ OK, passed 100 tests.
  5600. 1441.36 s [vector] ifoldM': OK
  5601. 1441.37 s [vector] +++ OK, passed 100 tests.
  5602. 1441.41 s [vector] ifoldM_: OK (0.02s)
  5603. 1441.41 s [vector] +++ OK, passed 100 tests.
  5604. 1441.41 s [vector] ifoldM'_: OK (0.02s)
  5605. 1441.41 s [vector] +++ OK, passed 100 tests.
  5606. 1441.41 s [vector] all: OK
  5607. 1441.41 s [vector] +++ OK, passed 100 tests.
  5608. 1441.41 s [vector] any: OK
  5609. 1441.42 s [vector] +++ OK, passed 100 tests.
  5610. 1441.42 s [vector] prescanl: OK
  5611. 1441.43 s [vector] +++ OK, passed 100 tests.
  5612. 1441.43 s [vector] prescanl': OK
  5613. 1441.43 s [vector] +++ OK, passed 100 tests.
  5614. 1441.43 s [vector] postscanl: OK
  5615. 1441.43 s [vector] +++ OK, passed 100 tests.
  5616. 1441.44 s [vector] postscanl': OK
  5617. 1441.44 s [vector] +++ OK, passed 100 tests.
  5618. 1441.44 s [vector] scanl: OK
  5619. 1441.44 s [vector] +++ OK, passed 100 tests.
  5620. 1441.44 s [vector] scanl': OK (0.01s)
  5621. 1441.44 s [vector] +++ OK, passed 100 tests.
  5622. 1441.44 s [vector] scanl1: OK
  5623. 1441.44 s [vector] +++ OK, passed 100 tests.
  5624. 1441.44 s [vector] scanl1': OK
  5625. 1441.45 s [vector] +++ OK, passed 100 tests.
  5626. 1441.46 s [vector] iscanl: OK
  5627. 1441.46 s [vector] +++ OK, passed 100 tests.
  5628. 1441.47 s [vector] iscanl': OK
  5629. 1441.47 s [vector] +++ OK, passed 100 tests.
  5630. 1441.47 s [vector] prescanr: OK
  5631. 1441.47 s [vector] +++ OK, passed 100 tests.
  5632. 1441.47 s [vector] prescanr': OK
  5633. 1441.47 s [vector] +++ OK, passed 100 tests.
  5634. 1441.47 s [vector] postscanr: OK
  5635. 1441.47 s [vector] +++ OK, passed 100 tests.
  5636. 1441.47 s [vector] postscanr': OK
  5637. 1441.47 s [vector] +++ OK, passed 100 tests.
  5638. 1441.48 s [vector] scanr: OK
  5639. 1441.48 s [vector] +++ OK, passed 100 tests.
  5640. 1441.48 s [vector] scanr': OK
  5641. 1441.48 s [vector] +++ OK, passed 100 tests.
  5642. 1441.48 s [vector] scanr1: OK
  5643. 1441.49 s [vector] +++ OK, passed 100 tests.
  5644. 1441.49 s [vector] scanr1': OK
  5645. 1441.49 s [vector] +++ OK, passed 100 tests.
  5646. 1441.49 s [vector] iscanr: OK
  5647. 1441.49 s [vector] +++ OK, passed 100 tests.
  5648. 1441.49 s [vector] iscanr': OK
  5649. 1441.49 s [vector] +++ OK, passed 100 tests.
  5650. 1441.49 s [vector] mut_read: OK
  5651. 1441.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5652. 1441.49 s [vector] mut_write: OK
  5653. 1441.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5654. 1441.49 s [vector] mut_modify: OK
  5655. 1441.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5656. 1441.50 s [vector] mut_generate: OK
  5657. 1441.50 s [vector] +++ OK, passed 100 tests.
  5658. 1441.50 s [vector] mut_generateM: OK
  5659. 1441.50 s [vector] +++ OK, passed 100 tests.
  5660. 1441.53 s [vector] mut_mapM_: OK (0.02s)
  5661. 1441.53 s [vector] +++ OK, passed 100 tests.
  5662. 1441.54 s [vector] mut_imapM_: OK (0.02s)
  5663. 1441.54 s [vector] +++ OK, passed 100 tests.
  5664. 1441.57 s [vector] mut_forM_: OK (0.01s)
  5665. 1441.57 s [vector] +++ OK, passed 100 tests.
  5666. 1441.58 s [vector] mut_iforM_: OK (0.02s)
  5667. 1441.59 s [vector] +++ OK, passed 100 tests.
  5668. 1441.59 s [vector] mut_foldr: OK
  5669. 1441.59 s [vector] +++ OK, passed 100 tests.
  5670. 1441.60 s [vector] mut_foldr': OK
  5671. 1441.60 s [vector] +++ OK, passed 100 tests.
  5672. 1441.60 s [vector] mut_foldl: OK
  5673. 1441.60 s [vector] +++ OK, passed 100 tests.
  5674. 1441.60 s [vector] mut_foldl': OK
  5675. 1441.60 s [vector] +++ OK, passed 100 tests.
  5676. 1441.61 s [vector] mut_ifoldr: OK
  5677. 1441.61 s [vector] +++ OK, passed 100 tests.
  5678. 1441.61 s [vector] mut_ifoldr': OK
  5679. 1441.61 s [vector] +++ OK, passed 100 tests.
  5680. 1441.61 s [vector] mut_ifoldl: OK
  5681. 1441.61 s [vector] +++ OK, passed 100 tests.
  5682. 1441.61 s [vector] mut_ifoldl': OK
  5683. 1441.61 s [vector] +++ OK, passed 100 tests.
  5684. 1441.61 s [vector] mut_foldM: OK
  5685. 1441.61 s [vector] +++ OK, passed 100 tests.
  5686. 1441.62 s [vector] mut_foldM': OK
  5687. 1441.62 s [vector] +++ OK, passed 100 tests.
  5688. 1441.62 s [vector] mut_foldrM: OK
  5689. 1441.62 s [vector] +++ OK, passed 100 tests.
  5690. 1441.62 s [vector] mut_foldrM': OK
  5691. 1441.62 s [vector] +++ OK, passed 100 tests.
  5692. 1441.63 s [vector] mut_ifoldM: OK
  5693. 1441.63 s [vector] +++ OK, passed 100 tests.
  5694. 1441.63 s [vector] mut_ifoldM': OK
  5695. 1441.63 s [vector] +++ OK, passed 100 tests.
  5696. 1441.64 s [vector] mut_ifoldrM: OK
  5697. 1441.64 s [vector] +++ OK, passed 100 tests.
  5698. 1441.64 s [vector] mut_ifoldrM': OK
  5699. 1441.64 s [vector] +++ OK, passed 100 tests.
  5700. 1441.64 s [vector] compare: OK
  5701. 1441.64 s [vector] +++ OK, passed 100 tests.
  5702. 1441.64 s [vector] maximum: OK
  5703. 1441.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5704. 1441.65 s [vector] minimum: OK
  5705. 1441.65 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5706. 1441.65 s [vector] minIndex: OK
  5707. 1441.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5708. 1441.65 s [vector] maxIndex: OK
  5709. 1441.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5710. 1441.65 s [vector] maximumBy: OK
  5711. 1441.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5712. 1441.65 s [vector] minimumBy: OK
  5713. 1441.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5714. 1441.65 s [vector] maximumOn: OK
  5715. 1441.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5716. 1441.65 s [vector] minimumOn: OK
  5717. 1441.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5718. 1441.65 s [vector] maxIndexBy: OK
  5719. 1441.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5720. 1441.65 s [vector] minIndexBy: OK
  5721. 1441.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5722. 1441.65 s [vector] ListFirstMaxIndexWins: OK
  5723. 1441.65 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5724. 1441.65 s [vector] FalseListFirstMaxIndexWins: OK
  5725. 1441.65 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5726. 1441.65 s [vector] []
  5727. 1441.65 s [vector] mempty: OK
  5728. 1441.65 s [vector] +++ OK, passed 100 tests.
  5729. 1441.67 s [vector] mappend: OK
  5730. 1441.67 s [vector] +++ OK, passed 100 tests.
  5731. 1441.67 s [vector] mconcat: OK (0.02s)
  5732. 1441.67 s [vector] +++ OK, passed 100 tests.
  5733. 1441.67 s [vector] glength: OK
  5734. 1441.67 s [vector] +++ OK, passed 100 tests.
  5735. 1441.67 s [vector] sum: OK
  5736. 1441.67 s [vector] +++ OK, passed 100 tests.
  5737. 1441.67 s [vector] product: OK
  5738. 1441.67 s [vector] +++ OK, passed 100 tests.
  5739. 1441.68 s [vector] enumFromN: OK
  5740. 1441.68 s [vector] +++ OK, passed 100 tests.
  5741. 1441.68 s [vector] enumFromThenN: OK
  5742. 1441.68 s [vector] +++ OK, passed 100 tests.
  5743. 1441.68 s [vector] enumFromTo: OK
  5744. 1441.68 s [vector] +++ OK, passed 100 tests.
  5745. 1441.68 s [vector] enumFromThenTo: OK
  5746. 1441.68 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5747. 1441.68 s [vector] Double
  5748. 1441.68 s [vector] fromList.toList == id: OK
  5749. 1441.68 s [vector] +++ OK, passed 100 tests.
  5750. 1441.68 s [vector] toList.fromList == id: OK
  5751. 1441.68 s [vector] +++ OK, passed 100 tests.
  5752. 1441.68 s [vector] unstream.stream == id: OK
  5753. 1441.68 s [vector] +++ OK, passed 100 tests.
  5754. 1441.68 s [vector] stream.unstream == id: OK
  5755. 1441.68 s [vector] +++ OK, passed 100 tests.
  5756. 1441.68 s [vector] eq: OK
  5757. 1441.68 s [vector] +++ OK, passed 100 tests.
  5758. 1441.68 s [vector] length: OK
  5759. 1441.68 s [vector] +++ OK, passed 100 tests.
  5760. 1441.69 s [vector] null: OK
  5761. 1441.69 s [vector] +++ OK, passed 100 tests.
  5762. 1441.69 s [vector] index: OK
  5763. 1441.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5764. 1441.69 s [vector] safeIndex: OK
  5765. 1441.69 s [vector] +++ OK, passed 100 tests.
  5766. 1441.69 s [vector] head: OK
  5767. 1441.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5768. 1441.69 s [vector] last: OK
  5769. 1441.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5770. 1441.69 s [vector] unsafeIndex: OK
  5771. 1441.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5772. 1441.69 s [vector] unsafeHead: OK
  5773. 1441.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5774. 1441.69 s [vector] unsafeLast: OK
  5775. 1441.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5776. 1441.69 s [vector] slice: OK
  5777. 1441.69 s [vector] +++ OK, passed 100 tests.
  5778. 1441.69 s [vector] init: OK
  5779. 1441.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5780. 1441.69 s [vector] tail: OK
  5781. 1441.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5782. 1441.69 s [vector] take: OK
  5783. 1441.70 s [vector] +++ OK, passed 100 tests.
  5784. 1441.70 s [vector] drop: OK
  5785. 1441.70 s [vector] +++ OK, passed 100 tests.
  5786. 1441.70 s [vector] splitAt: OK
  5787. 1441.70 s [vector] +++ OK, passed 100 tests.
  5788. 1441.70 s [vector] empty: OK
  5789. 1441.70 s [vector] +++ OK, passed 100 tests.
  5790. 1441.70 s [vector] singleton: OK
  5791. 1441.70 s [vector] +++ OK, passed 100 tests.
  5792. 1441.70 s [vector] replicate: OK
  5793. 1441.70 s [vector] +++ OK, passed 100 tests.
  5794. 1441.70 s [vector] generate: OK
  5795. 1441.70 s [vector] +++ OK, passed 100 tests.
  5796. 1441.71 s [vector] iterateN: OK
  5797. 1441.71 s [vector] +++ OK, passed 100 tests.
  5798. 1441.75 s [vector] iterateNM: OK (0.04s)
  5799. 1441.75 s [vector] +++ OK, passed 100 tests.
  5800. 1441.76 s [vector] generateM: OK (0.02s)
  5801. 1441.76 s [vector] +++ OK, passed 100 tests.
  5802. 1441.78 s [vector] replicateM: OK (0.01s)
  5803. 1441.78 s [vector] +++ OK, passed 100 tests.
  5804. 1441.78 s [vector] create: OK
  5805. 1441.78 s [vector] +++ OK, passed 100 tests.
  5806. 1441.78 s [vector] createT: OK
  5807. 1441.78 s [vector] +++ OK, passed 100 tests.
  5808. 1441.79 s [vector] unfoldr: OK
  5809. 1441.79 s [vector] +++ OK, passed 100 tests.
  5810. 1441.79 s [vector] unfoldrN: OK
  5811. 1441.79 s [vector] +++ OK, passed 100 tests.
  5812. 1441.79 s [vector] unfoldrExactN: OK
  5813. 1441.80 s [vector] +++ OK, passed 100 tests.
  5814. 1441.81 s [vector] unfoldrM: OK
  5815. 1441.81 s [vector] +++ OK, passed 100 tests.
  5816. 1441.82 s [vector] unfoldrNM: OK
  5817. 1441.82 s [vector] +++ OK, passed 100 tests.
  5818. 1441.87 s [vector] unfoldrExactNM: OK (0.06s)
  5819. 1441.87 s [vector] +++ OK, passed 100 tests.
  5820. 1441.89 s [vector] constructN: OK (0.01s)
  5821. 1441.89 s [vector] +++ OK, passed 100 tests.
  5822. 1441.89 s [vector] constructrN: OK (0.01s)
  5823. 1441.89 s [vector] +++ OK, passed 100 tests.
  5824. 1441.89 s [vector] cons: OK
  5825. 1441.89 s [vector] +++ OK, passed 100 tests.
  5826. 1441.89 s [vector] snoc: OK
  5827. 1441.89 s [vector] +++ OK, passed 100 tests.
  5828. 1441.91 s [vector] append: OK
  5829. 1441.91 s [vector] +++ OK, passed 100 tests.
  5830. 1441.92 s [vector] concat: OK (0.02s)
  5831. 1441.92 s [vector] +++ OK, passed 100 tests.
  5832. 1441.93 s [vector] force: OK
  5833. 1441.93 s [vector] +++ OK, passed 100 tests.
  5834. 1441.94 s [vector] upd: OK
  5835. 1441.94 s [vector] +++ OK, passed 100 tests.
  5836. 1441.95 s [vector] accum: OK (0.02s)
  5837. 1441.95 s [vector] +++ OK, passed 100 tests.
  5838. 1441.95 s [vector] reverse: OK
  5839. 1441.95 s [vector] +++ OK, passed 100 tests.
  5840. 1441.95 s [vector] backpermute: OK
  5841. 1441.95 s [vector] +++ OK, passed 100 tests.
  5842. 1441.95 s [vector] map: OK
  5843. 1441.95 s [vector] +++ OK, passed 100 tests.
  5844. 1441.96 s [vector] imap: OK
  5845. 1441.96 s [vector] +++ OK, passed 100 tests.
  5846. 1441.97 s [vector] concatMap: OK
  5847. 1441.97 s [vector] +++ OK, passed 100 tests.
  5848. 1441.97 s [vector] mapM: OK
  5849. 1441.97 s [vector] +++ OK, passed 100 tests.
  5850. 1442.02 s [vector] mapM_: OK (0.04s)
  5851. 1442.03 s [vector] +++ OK, passed 100 tests.
  5852. 1442.03 s [vector] forM: OK
  5853. 1442.03 s [vector] +++ OK, passed 100 tests.
  5854. 1442.07 s [vector] forM_: OK (0.04s)
  5855. 1442.07 s [vector] +++ OK, passed 100 tests.
  5856. 1442.09 s [vector] imapM: OK
  5857. 1442.09 s [vector] +++ OK, passed 100 tests.
  5858. 1442.13 s [vector] imapM_: OK (0.04s)
  5859. 1442.13 s [vector] +++ OK, passed 100 tests.
  5860. 1442.15 s [vector] zipWith: OK (0.02s)
  5861. 1442.15 s [vector] +++ OK, passed 100 tests.
  5862. 1442.15 s [vector] zipWith3: OK (0.01s)
  5863. 1442.15 s [vector] +++ OK, passed 100 tests.
  5864. 1442.17 s [vector] izipWith: OK (0.01s)
  5865. 1442.17 s [vector] +++ OK, passed 100 tests.
  5866. 1442.17 s [vector] izipWith3: OK
  5867. 1442.17 s [vector] +++ OK, passed 100 tests.
  5868. 1442.18 s [vector] izipWithM: OK (0.01s)
  5869. 1442.18 s [vector] +++ OK, passed 100 tests.
  5870. 1442.22 s [vector] izipWithM_: OK (0.03s)
  5871. 1442.23 s [vector] +++ OK, passed 100 tests.
  5872. 1442.23 s [vector] zipWithM: OK (0.01s)
  5873. 1442.23 s [vector] +++ OK, passed 100 tests.
  5874. 1442.26 s [vector] zipWithM_: OK (0.03s)
  5875. 1442.27 s [vector] +++ OK, passed 100 tests.
  5876. 1442.27 s [vector] filter: OK
  5877. 1442.29 s [vector] +++ OK, passed 100 tests.
  5878. 1442.29 s [vector] ifilter: OK
  5879. 1442.29 s [vector] +++ OK, passed 100 tests.
  5880. 1442.33 s [vector] filterM: OK (0.06s)
  5881. 1442.33 s [vector] +++ OK, passed 100 tests.
  5882. 1442.33 s [vector] uniq: OK
  5883. 1442.33 s [vector] +++ OK, passed 100 tests.
  5884. 1442.33 s [vector] mapMaybe: OK
  5885. 1442.33 s [vector] +++ OK, passed 100 tests.
  5886. 1442.34 s [vector] imapMaybe: OK
  5887. 1442.34 s [vector] +++ OK, passed 100 tests.
  5888. 1442.35 s [vector] takeWhile: OK
  5889. 1442.35 s [vector] +++ OK, passed 100 tests.
  5890. 1442.35 s [vector] dropWhile: OK
  5891. 1442.35 s [vector] +++ OK, passed 100 tests.
  5892. 1442.35 s [vector] partition: OK
  5893. 1442.35 s [vector] +++ OK, passed 100 tests.
  5894. 1442.36 s [vector] partitionWith: OK
  5895. 1442.36 s [vector] +++ OK, passed 100 tests.
  5896. 1442.36 s [vector] span: OK
  5897. 1442.36 s [vector] +++ OK, passed 100 tests.
  5898. 1442.37 s [vector] break: OK
  5899. 1442.37 s [vector] +++ OK, passed 100 tests.
  5900. 1442.37 s [vector] spanR: OK
  5901. 1442.37 s [vector] +++ OK, passed 100 tests.
  5902. 1442.37 s [vector] breakR: OK
  5903. 1442.38 s [vector] +++ OK, passed 100 tests.
  5904. 1442.38 s [vector] groupBy: OK
  5905. 1442.38 s [vector] +++ OK, passed 100 tests.
  5906. 1442.38 s [vector] elem: OK
  5907. 1442.38 s [vector] +++ OK, passed 100 tests.
  5908. 1442.38 s [vector] notElem: OK
  5909. 1442.38 s [vector] +++ OK, passed 100 tests.
  5910. 1442.38 s [vector] find: OK
  5911. 1442.38 s [vector] +++ OK, passed 100 tests.
  5912. 1442.38 s [vector] findIndex: OK
  5913. 1442.39 s [vector] +++ OK, passed 100 tests.
  5914. 1442.39 s [vector] findIndexR: OK
  5915. 1442.39 s [vector] +++ OK, passed 100 tests.
  5916. 1442.39 s [vector] findIndices: OK
  5917. 1442.39 s [vector] +++ OK, passed 100 tests.
  5918. 1442.41 s [vector] elemIndex: OK
  5919. 1442.41 s [vector] +++ OK, passed 100 tests.
  5920. 1442.41 s [vector] elemIndices: OK
  5921. 1442.41 s [vector] +++ OK, passed 100 tests.
  5922. 1442.41 s [vector] foldl: OK (0.01s)
  5923. 1442.41 s [vector] +++ OK, passed 100 tests.
  5924. 1442.43 s [vector] foldl1: OK (0.01s)
  5925. 1442.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5926. 1442.44 s [vector] foldl': OK (0.01s)
  5927. 1442.45 s [vector] +++ OK, passed 100 tests.
  5928. 1442.45 s [vector] foldl1': OK (0.01s)
  5929. 1442.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5930. 1442.46 s [vector] foldr: OK (0.01s)
  5931. 1442.47 s [vector] +++ OK, passed 100 tests.
  5932. 1442.47 s [vector] foldr1: OK (0.01s)
  5933. 1442.47 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5934. 1442.49 s [vector] foldr': OK (0.02s)
  5935. 1442.49 s [vector] +++ OK, passed 100 tests.
  5936. 1442.49 s [vector] foldr1': OK (0.01s)
  5937. 1442.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5938. 1442.50 s [vector] ifoldl: OK
  5939. 1442.50 s [vector] +++ OK, passed 100 tests.
  5940. 1442.53 s [vector] ifoldl': OK (0.01s)
  5941. 1442.53 s [vector] +++ OK, passed 100 tests.
  5942. 1442.54 s [vector] ifoldr: OK (0.01s)
  5943. 1442.55 s [vector] +++ OK, passed 100 tests.
  5944. 1442.55 s [vector] ifoldr': OK (0.01s)
  5945. 1442.55 s [vector] +++ OK, passed 100 tests.
  5946. 1442.57 s [vector] ifoldM: OK (0.01s)
  5947. 1442.57 s [vector] +++ OK, passed 100 tests.
  5948. 1442.59 s [vector] ifoldM': OK (0.02s)
  5949. 1442.59 s [vector] +++ OK, passed 100 tests.
  5950. 1442.63 s [vector] ifoldM_: OK (0.04s)
  5951. 1442.63 s [vector] +++ OK, passed 100 tests.
  5952. 1442.67 s [vector] ifoldM'_: OK (0.06s)
  5953. 1442.67 s [vector] +++ OK, passed 100 tests.
  5954. 1442.68 s [vector] all: OK
  5955. 1442.68 s [vector] +++ OK, passed 100 tests.
  5956. 1442.69 s [vector] any: OK
  5957. 1442.69 s [vector] +++ OK, passed 100 tests.
  5958. 1442.71 s [vector] prescanl: OK (0.02s)
  5959. 1442.71 s [vector] +++ OK, passed 100 tests.
  5960. 1442.71 s [vector] prescanl': OK (0.01s)
  5961. 1442.71 s [vector] +++ OK, passed 100 tests.
  5962. 1442.73 s [vector] postscanl: OK (0.01s)
  5963. 1442.73 s [vector] +++ OK, passed 100 tests.
  5964. 1442.75 s [vector] postscanl': OK (0.01s)
  5965. 1442.75 s [vector] +++ OK, passed 100 tests.
  5966. 1442.76 s [vector] scanl: OK (0.03s)
  5967. 1442.76 s [vector] +++ OK, passed 100 tests.
  5968. 1442.78 s [vector] scanl': OK
  5969. 1442.78 s [vector] +++ OK, passed 100 tests.
  5970. 1442.79 s [vector] scanl1: OK (0.01s)
  5971. 1442.79 s [vector] +++ OK, passed 100 tests.
  5972. 1442.81 s [vector] scanl1': OK (0.01s)
  5973. 1442.81 s [vector] +++ OK, passed 100 tests.
  5974. 1442.83 s [vector] iscanl: OK (0.01s)
  5975. 1442.83 s [vector] +++ OK, passed 100 tests.
  5976. 1442.84 s [vector] iscanl': OK (0.01s)
  5977. 1442.84 s [vector] +++ OK, passed 100 tests.
  5978. 1442.85 s [vector] prescanr: OK (0.01s)
  5979. 1442.85 s [vector] +++ OK, passed 100 tests.
  5980. 1442.89 s [vector] prescanr': OK (0.01s)
  5981. 1442.89 s [vector] +++ OK, passed 100 tests.
  5982. 1442.90 s [vector] postscanr: OK (0.01s)
  5983. 1442.90 s [vector] +++ OK, passed 100 tests.
  5984. 1442.90 s [vector] postscanr': OK (0.03s)
  5985. 1442.90 s [vector] +++ OK, passed 100 tests.
  5986. 1442.92 s [vector] scanr: OK (0.01s)
  5987. 1442.93 s [vector] +++ OK, passed 100 tests.
  5988. 1442.93 s [vector] scanr': OK (0.01s)
  5989. 1442.93 s [vector] +++ OK, passed 100 tests.
  5990. 1442.95 s [vector] scanr1: OK (0.01s)
  5991. 1442.95 s [vector] +++ OK, passed 100 tests.
  5992. 1442.97 s [vector] scanr1': OK (0.01s)
  5993. 1442.97 s [vector] +++ OK, passed 100 tests.
  5994. 1442.99 s [vector] iscanr: OK (0.02s)
  5995. 1442.99 s [vector] +++ OK, passed 100 tests.
  5996. 1442.99 s [vector] iscanr': OK (0.02s)
  5997. 1442.99 s [vector] +++ OK, passed 100 tests.
  5998. 1442.99 s [vector] mut_read: OK
  5999. 1442.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6000. 1442.99 s [vector] mut_write: OK
  6001. 1442.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6002. 1442.99 s [vector] mut_modify: OK
  6003. 1443.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6004. 1443.01 s [vector] mut_generate: OK
  6005. 1443.01 s [vector] +++ OK, passed 100 tests.
  6006. 1443.03 s [vector] mut_generateM: OK (0.02s)
  6007. 1443.03 s [vector] +++ OK, passed 100 tests.
  6008. 1443.07 s [vector] mut_mapM_: OK (0.05s)
  6009. 1443.07 s [vector] +++ OK, passed 100 tests.
  6010. 1443.11 s [vector] mut_imapM_: OK (0.04s)
  6011. 1443.11 s [vector] +++ OK, passed 100 tests.
  6012. 1443.15 s [vector] mut_forM_: OK (0.05s)
  6013. 1443.15 s [vector] +++ OK, passed 100 tests.
  6014. 1443.19 s [vector] mut_iforM_: OK (0.04s)
  6015. 1443.19 s [vector] +++ OK, passed 100 tests.
  6016. 1443.21 s [vector] mut_foldr: OK (0.01s)
  6017. 1443.21 s [vector] +++ OK, passed 100 tests.
  6018. 1443.23 s [vector] mut_foldr': OK (0.01s)
  6019. 1443.23 s [vector] +++ OK, passed 100 tests.
  6020. 1443.24 s [vector] mut_foldl: OK (0.01s)
  6021. 1443.24 s [vector] +++ OK, passed 100 tests.
  6022. 1443.24 s [vector] mut_foldl': OK (0.01s)
  6023. 1443.24 s [vector] +++ OK, passed 100 tests.
  6024. 1443.26 s [vector] mut_ifoldr: OK (0.01s)
  6025. 1443.27 s [vector] +++ OK, passed 100 tests.
  6026. 1443.27 s [vector] mut_ifoldr': OK (0.01s)
  6027. 1443.27 s [vector] +++ OK, passed 100 tests.
  6028. 1443.29 s [vector] mut_ifoldl: OK (0.02s)
  6029. 1443.29 s [vector] +++ OK, passed 100 tests.
  6030. 1443.31 s [vector] mut_ifoldl': OK (0.02s)
  6031. 1443.31 s [vector] +++ OK, passed 100 tests.
  6032. 1443.33 s [vector] mut_foldM: OK (0.02s)
  6033. 1443.33 s [vector] +++ OK, passed 100 tests.
  6034. 1443.33 s [vector] mut_foldM': OK (0.02s)
  6035. 1443.33 s [vector] +++ OK, passed 100 tests.
  6036. 1443.35 s [vector] mut_foldrM: OK
  6037. 1443.35 s [vector] +++ OK, passed 100 tests.
  6038. 1443.37 s [vector] mut_foldrM': OK (0.01s)
  6039. 1443.37 s [vector] +++ OK, passed 100 tests.
  6040. 1443.38 s [vector] mut_ifoldM: OK (0.01s)
  6041. 1443.38 s [vector] +++ OK, passed 100 tests.
  6042. 1443.38 s [vector] mut_ifoldM': OK (0.01s)
  6043. 1443.38 s [vector] +++ OK, passed 100 tests.
  6044. 1443.41 s [vector] mut_ifoldrM: OK (0.01s)
  6045. 1443.41 s [vector] +++ OK, passed 100 tests.
  6046. 1443.41 s [vector] mut_ifoldrM': OK (0.01s)
  6047. 1443.41 s [vector] +++ OK, passed 100 tests.
  6048. 1443.41 s [vector] compare: OK
  6049. 1443.41 s [vector] +++ OK, passed 100 tests.
  6050. 1443.41 s [vector] maximum: OK
  6051. 1443.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6052. 1443.41 s [vector] minimum: OK
  6053. 1443.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6054. 1443.42 s [vector] minIndex: OK
  6055. 1443.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6056. 1443.42 s [vector] maxIndex: OK
  6057. 1443.42 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6058. 1443.42 s [vector] maximumBy: OK
  6059. 1443.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6060. 1443.42 s [vector] minimumBy: OK
  6061. 1443.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6062. 1443.42 s [vector] maximumOn: OK
  6063. 1443.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6064. 1443.42 s [vector] minimumOn: OK
  6065. 1443.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6066. 1443.42 s [vector] maxIndexBy: OK
  6067. 1443.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6068. 1443.42 s [vector] minIndexBy: OK
  6069. 1443.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6070. 1443.42 s [vector] ListFirstMaxIndexWins: OK
  6071. 1443.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6072. 1443.42 s [vector] FalseListFirstMaxIndexWins: OK
  6073. 1443.42 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6074. 1443.42 s [vector] []
  6075. 1443.42 s [vector] mempty: OK
  6076. 1443.43 s [vector] +++ OK, passed 100 tests.
  6077. 1443.43 s [vector] mappend: OK
  6078. 1443.43 s [vector] +++ OK, passed 100 tests.
  6079. 1443.46 s [vector] mconcat: OK (0.03s)
  6080. 1443.46 s [vector] +++ OK, passed 100 tests.
  6081. 1443.46 s [vector] glength: OK
  6082. 1443.46 s [vector] +++ OK, passed 100 tests.
  6083. 1443.46 s [vector] sum: OK
  6084. 1443.46 s [vector] +++ OK, passed 100 tests.
  6085. 1443.46 s [vector] product: OK
  6086. 1443.46 s [vector] +++ OK, passed 100 tests.
  6087. 1443.46 s [vector] enumFromN: OK
  6088. 1443.46 s [vector] +++ OK, passed 100 tests.
  6089. 1443.46 s [vector] enumFromThenN: OK
  6090. 1443.47 s [vector] +++ OK, passed 100 tests.
  6091. 1443.47 s [vector] enumFromTo: OK
  6092. 1443.47 s [vector] +++ OK, passed 100 tests.
  6093. 1443.47 s [vector] enumFromThenTo: OK
  6094. 1443.47 s [vector] +++ OK, passed 100 tests.
  6095. 1443.47 s [vector] unstream
  6096. 1443.47 s [vector] unstream == vunstream (exact): OK
  6097. 1443.47 s [vector] +++ OK, passed 100 tests.
  6098. 1443.47 s [vector] unstream == vunstream (unknown): OK
  6099. 1443.47 s [vector] +++ OK, passed 100 tests.
  6100. 1443.47 s [vector] unstreamR ~= vunstream (exact): OK
  6101. 1443.47 s [vector] +++ OK, passed 100 tests.
  6102. 1443.47 s [vector] unstreamR ~= vunstream (unknown): OK
  6103. 1443.47 s [vector] +++ OK, passed 100 tests.
  6104. 1443.47 s [vector] Tests.Vector.Storable
  6105. 1443.47 s [vector] Data.Vector.Storable.Vector (Int)
  6106. 1443.47 s [vector] fromList.toList == id: OK
  6107. 1443.47 s [vector] +++ OK, passed 100 tests.
  6108. 1443.47 s [vector] toList.fromList == id: OK
  6109. 1443.47 s [vector] +++ OK, passed 100 tests.
  6110. 1443.47 s [vector] unstream.stream == id: OK
  6111. 1443.47 s [vector] +++ OK, passed 100 tests.
  6112. 1443.48 s [vector] stream.unstream == id: OK
  6113. 1443.48 s [vector] +++ OK, passed 100 tests.
  6114. 1443.48 s [vector] eq: OK
  6115. 1443.48 s [vector] +++ OK, passed 100 tests.
  6116. 1443.48 s [vector] length: OK
  6117. 1443.48 s [vector] +++ OK, passed 100 tests.
  6118. 1443.48 s [vector] null: OK
  6119. 1443.48 s [vector] +++ OK, passed 100 tests.
  6120. 1443.48 s [vector] index: OK
  6121. 1443.48 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6122. 1443.48 s [vector] safeIndex: OK
  6123. 1443.48 s [vector] +++ OK, passed 100 tests.
  6124. 1443.48 s [vector] head: OK
  6125. 1443.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6126. 1443.48 s [vector] last: OK
  6127. 1443.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6128. 1443.48 s [vector] unsafeIndex: OK
  6129. 1443.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6130. 1443.48 s [vector] unsafeHead: OK
  6131. 1443.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6132. 1443.48 s [vector] unsafeLast: OK
  6133. 1443.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6134. 1443.48 s [vector] slice: OK
  6135. 1443.48 s [vector] +++ OK, passed 100 tests.
  6136. 1443.48 s [vector] init: OK
  6137. 1443.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6138. 1443.48 s [vector] tail: OK
  6139. 1443.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6140. 1443.48 s [vector] take: OK
  6141. 1443.48 s [vector] +++ OK, passed 100 tests.
  6142. 1443.48 s [vector] drop: OK
  6143. 1443.49 s [vector] +++ OK, passed 100 tests.
  6144. 1443.49 s [vector] splitAt: OK
  6145. 1443.49 s [vector] +++ OK, passed 100 tests.
  6146. 1443.49 s [vector] empty: OK
  6147. 1443.49 s [vector] +++ OK, passed 100 tests.
  6148. 1443.49 s [vector] singleton: OK
  6149. 1443.49 s [vector] +++ OK, passed 100 tests.
  6150. 1443.49 s [vector] replicate: OK
  6151. 1443.49 s [vector] +++ OK, passed 100 tests.
  6152. 1443.49 s [vector] generate: OK
  6153. 1443.49 s [vector] +++ OK, passed 100 tests.
  6154. 1443.51 s [vector] iterateN: OK
  6155. 1443.51 s [vector] +++ OK, passed 100 tests.
  6156. 1443.53 s [vector] iterateNM: OK (0.04s)
  6157. 1443.53 s [vector] +++ OK, passed 100 tests.
  6158. 1443.56 s [vector] generateM: OK (0.03s)
  6159. 1443.56 s [vector] +++ OK, passed 100 tests.
  6160. 1443.56 s [vector] replicateM: OK
  6161. 1443.56 s [vector] +++ OK, passed 100 tests.
  6162. 1443.56 s [vector] create: OK
  6163. 1443.56 s [vector] +++ OK, passed 100 tests.
  6164. 1443.56 s [vector] createT: OK
  6165. 1443.56 s [vector] +++ OK, passed 100 tests.
  6166. 1443.56 s [vector] unfoldr: OK
  6167. 1443.56 s [vector] +++ OK, passed 100 tests.
  6168. 1443.57 s [vector] unfoldrN: OK
  6169. 1443.57 s [vector] +++ OK, passed 100 tests.
  6170. 1443.57 s [vector] unfoldrExactN: OK
  6171. 1443.57 s [vector] +++ OK, passed 100 tests.
  6172. 1443.59 s [vector] unfoldrM: OK (0.01s)
  6173. 1443.59 s [vector] +++ OK, passed 100 tests.
  6174. 1443.59 s [vector] unfoldrNM: OK (0.01s)
  6175. 1443.59 s [vector] +++ OK, passed 100 tests.
  6176. 1443.64 s [vector] unfoldrExactNM: OK (0.05s)
  6177. 1443.64 s [vector] +++ OK, passed 100 tests.
  6178. 1443.64 s [vector] constructN: OK
  6179. 1443.64 s [vector] +++ OK, passed 100 tests.
  6180. 1443.64 s [vector] constructrN: OK
  6181. 1443.64 s [vector] +++ OK, passed 100 tests.
  6182. 1443.64 s [vector] cons: OK
  6183. 1443.64 s [vector] +++ OK, passed 100 tests.
  6184. 1443.64 s [vector] snoc: OK
  6185. 1443.64 s [vector] +++ OK, passed 100 tests.
  6186. 1443.64 s [vector] append: OK
  6187. 1443.64 s [vector] +++ OK, passed 100 tests.
  6188. 1443.66 s [vector] concat: OK (0.02s)
  6189. 1443.66 s [vector] +++ OK, passed 100 tests.
  6190. 1443.66 s [vector] force: OK
  6191. 1443.66 s [vector] +++ OK, passed 100 tests.
  6192. 1443.67 s [vector] upd: OK
  6193. 1443.67 s [vector] +++ OK, passed 100 tests.
  6194. 1443.67 s [vector] accum: OK
  6195. 1443.67 s [vector] +++ OK, passed 100 tests.
  6196. 1443.67 s [vector] reverse: OK
  6197. 1443.67 s [vector] +++ OK, passed 100 tests.
  6198. 1443.67 s [vector] backpermute: OK
  6199. 1443.67 s [vector] +++ OK, passed 100 tests.
  6200. 1443.67 s [vector] map: OK
  6201. 1443.67 s [vector] +++ OK, passed 100 tests.
  6202. 1443.68 s [vector] imap: OK
  6203. 1443.68 s [vector] +++ OK, passed 100 tests.
  6204. 1443.69 s [vector] concatMap: OK
  6205. 1443.69 s [vector] +++ OK, passed 100 tests.
  6206. 1443.69 s [vector] mapM: OK
  6207. 1443.69 s [vector] +++ OK, passed 100 tests.
  6208. 1443.71 s [vector] mapM_: OK (0.02s)
  6209. 1443.71 s [vector] +++ OK, passed 100 tests.
  6210. 1443.71 s [vector] forM: OK
  6211. 1443.71 s [vector] +++ OK, passed 100 tests.
  6212. 1443.74 s [vector] forM_: OK (0.03s)
  6213. 1443.74 s [vector] +++ OK, passed 100 tests.
  6214. 1443.74 s [vector] imapM: OK
  6215. 1443.74 s [vector] +++ OK, passed 100 tests.
  6216. 1443.77 s [vector] imapM_: OK (0.02s)
  6217. 1443.77 s [vector] +++ OK, passed 100 tests.
  6218. 1443.78 s [vector] zipWith: OK (0.01s)
  6219. 1443.78 s [vector] +++ OK, passed 100 tests.
  6220. 1443.79 s [vector] zipWith3: OK
  6221. 1443.79 s [vector] +++ OK, passed 100 tests.
  6222. 1443.79 s [vector] izipWith: OK
  6223. 1443.79 s [vector] +++ OK, passed 100 tests.
  6224. 1443.79 s [vector] izipWith3: OK
  6225. 1443.79 s [vector] +++ OK, passed 100 tests.
  6226. 1443.79 s [vector] izipWithM: OK
  6227. 1443.79 s [vector] +++ OK, passed 100 tests.
  6228. 1443.80 s [vector] izipWithM_: OK (0.02s)
  6229. 1443.80 s [vector] +++ OK, passed 100 tests.
  6230. 1443.81 s [vector] zipWithM: OK
  6231. 1443.81 s [vector] +++ OK, passed 100 tests.
  6232. 1443.83 s [vector] zipWithM_: OK
  6233. 1443.83 s [vector] +++ OK, passed 100 tests.
  6234. 1443.83 s [vector] filter: OK
  6235. 1443.83 s [vector] +++ OK, passed 100 tests.
  6236. 1443.85 s [vector] ifilter: OK
  6237. 1443.85 s [vector] +++ OK, passed 100 tests.
  6238. 1443.86 s [vector] filterM: OK (0.02s)
  6239. 1443.86 s [vector] +++ OK, passed 100 tests.
  6240. 1443.86 s [vector] uniq: OK
  6241. 1443.86 s [vector] +++ OK, passed 100 tests.
  6242. 1443.86 s [vector] mapMaybe: OK
  6243. 1443.86 s [vector] +++ OK, passed 100 tests.
  6244. 1443.86 s [vector] imapMaybe: OK
  6245. 1443.86 s [vector] +++ OK, passed 100 tests.
  6246. 1443.86 s [vector] takeWhile: OK
  6247. 1443.86 s [vector] +++ OK, passed 100 tests.
  6248. 1443.86 s [vector] dropWhile: OK
  6249. 1443.86 s [vector] +++ OK, passed 100 tests.
  6250. 1443.86 s [vector] partition: OK
  6251. 1443.87 s [vector] +++ OK, passed 100 tests.
  6252. 1443.87 s [vector] partitionWith: OK
  6253. 1443.87 s [vector] +++ OK, passed 100 tests.
  6254. 1443.87 s [vector] span: OK
  6255. 1443.87 s [vector] +++ OK, passed 100 tests.
  6256. 1443.87 s [vector] break: OK
  6257. 1443.87 s [vector] +++ OK, passed 100 tests.
  6258. 1443.87 s [vector] spanR: OK
  6259. 1443.87 s [vector] +++ OK, passed 100 tests.
  6260. 1443.87 s [vector] breakR: OK
  6261. 1443.87 s [vector] +++ OK, passed 100 tests.
  6262. 1443.87 s [vector] groupBy: OK
  6263. 1443.87 s [vector] +++ OK, passed 100 tests.
  6264. 1443.87 s [vector] elem: OK
  6265. 1443.87 s [vector] +++ OK, passed 100 tests.
  6266. 1443.88 s [vector] notElem: OK
  6267. 1443.88 s [vector] +++ OK, passed 100 tests.
  6268. 1443.88 s [vector] find: OK
  6269. 1443.88 s [vector] +++ OK, passed 100 tests.
  6270. 1443.88 s [vector] findIndex: OK
  6271. 1443.88 s [vector] +++ OK, passed 100 tests.
  6272. 1443.88 s [vector] findIndexR: OK
  6273. 1443.88 s [vector] +++ OK, passed 100 tests.
  6274. 1443.88 s [vector] findIndices: OK
  6275. 1443.88 s [vector] +++ OK, passed 100 tests.
  6276. 1443.88 s [vector] elemIndex: OK
  6277. 1443.88 s [vector] +++ OK, passed 100 tests.
  6278. 1443.89 s [vector] elemIndices: OK
  6279. 1443.89 s [vector] +++ OK, passed 100 tests.
  6280. 1443.89 s [vector] foldl: OK
  6281. 1443.89 s [vector] +++ OK, passed 100 tests.
  6282. 1443.89 s [vector] foldl1: OK
  6283. 1443.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6284. 1443.90 s [vector] foldl': OK
  6285. 1443.90 s [vector] +++ OK, passed 100 tests.
  6286. 1443.90 s [vector] foldl1': OK
  6287. 1443.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6288. 1443.90 s [vector] foldr: OK
  6289. 1443.90 s [vector] +++ OK, passed 100 tests.
  6290. 1443.90 s [vector] foldr1: OK
  6291. 1443.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6292. 1443.90 s [vector] foldr': OK
  6293. 1443.91 s [vector] +++ OK, passed 100 tests.
  6294. 1443.91 s [vector] foldr1': OK
  6295. 1443.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6296. 1443.91 s [vector] ifoldl: OK
  6297. 1443.91 s [vector] +++ OK, passed 100 tests.
  6298. 1443.92 s [vector] ifoldl': OK
  6299. 1443.92 s [vector] +++ OK, passed 100 tests.
  6300. 1443.93 s [vector] ifoldr: OK
  6301. 1443.93 s [vector] +++ OK, passed 100 tests.
  6302. 1443.93 s [vector] ifoldr': OK
  6303. 1443.95 s [vector] +++ OK, passed 100 tests.
  6304. 1443.95 s [vector] ifoldM: OK
  6305. 1443.95 s [vector] +++ OK, passed 100 tests.
  6306. 1443.95 s [vector] ifoldM': OK
  6307. 1443.95 s [vector] +++ OK, passed 100 tests.
  6308. 1443.97 s [vector] ifoldM_: OK (0.02s)
  6309. 1443.97 s [vector] +++ OK, passed 100 tests.
  6310. 1443.97 s [vector] ifoldM'_: OK (0.02s)
  6311. 1443.97 s [vector] +++ OK, passed 100 tests.
  6312. 1443.97 s [vector] all: OK
  6313. 1443.97 s [vector] +++ OK, passed 100 tests.
  6314. 1443.97 s [vector] any: OK
  6315. 1443.97 s [vector] +++ OK, passed 100 tests.
  6316. 1443.97 s [vector] prescanl: OK
  6317. 1443.97 s [vector] +++ OK, passed 100 tests.
  6318. 1443.98 s [vector] prescanl': OK
  6319. 1443.98 s [vector] +++ OK, passed 100 tests.
  6320. 1443.98 s [vector] postscanl: OK
  6321. 1443.98 s [vector] +++ OK, passed 100 tests.
  6322. 1443.99 s [vector] postscanl': OK
  6323. 1443.99 s [vector] +++ OK, passed 100 tests.
  6324. 1443.99 s [vector] scanl: OK
  6325. 1443.99 s [vector] +++ OK, passed 100 tests.
  6326. 1443.99 s [vector] scanl': OK
  6327. 1444.00 s [vector] +++ OK, passed 100 tests.
  6328. 1444.00 s [vector] scanl1: OK
  6329. 1444.00 s [vector] +++ OK, passed 100 tests.
  6330. 1444.01 s [vector] scanl1': OK
  6331. 1444.01 s [vector] +++ OK, passed 100 tests.
  6332. 1444.01 s [vector] iscanl: OK
  6333. 1444.01 s [vector] +++ OK, passed 100 tests.
  6334. 1444.01 s [vector] iscanl': OK
  6335. 1444.01 s [vector] +++ OK, passed 100 tests.
  6336. 1444.01 s [vector] prescanr: OK
  6337. 1444.01 s [vector] +++ OK, passed 100 tests.
  6338. 1444.01 s [vector] prescanr': OK
  6339. 1444.01 s [vector] +++ OK, passed 100 tests.
  6340. 1444.01 s [vector] postscanr: OK
  6341. 1444.01 s [vector] +++ OK, passed 100 tests.
  6342. 1444.02 s [vector] postscanr': OK
  6343. 1444.02 s [vector] +++ OK, passed 100 tests.
  6344. 1444.02 s [vector] scanr: OK
  6345. 1444.02 s [vector] +++ OK, passed 100 tests.
  6346. 1444.02 s [vector] scanr': OK
  6347. 1444.02 s [vector] +++ OK, passed 100 tests.
  6348. 1444.03 s [vector] scanr1: OK
  6349. 1444.03 s [vector] +++ OK, passed 100 tests.
  6350. 1444.03 s [vector] scanr1': OK
  6351. 1444.03 s [vector] +++ OK, passed 100 tests.
  6352. 1444.03 s [vector] iscanr: OK
  6353. 1444.03 s [vector] +++ OK, passed 100 tests.
  6354. 1444.04 s [vector] iscanr': OK
  6355. 1444.04 s [vector] +++ OK, passed 100 tests.
  6356. 1444.04 s [vector] mut_read: OK
  6357. 1444.04 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6358. 1444.04 s [vector] mut_write: OK
  6359. 1444.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6360. 1444.05 s [vector] mut_modify: OK
  6361. 1444.05 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6362. 1444.07 s [vector] mut_generate: OK
  6363. 1444.07 s [vector] +++ OK, passed 100 tests.
  6364. 1444.07 s [vector] mut_generateM: OK
  6365. 1444.07 s [vector] +++ OK, passed 100 tests.
  6366. 1444.07 s [vector] mut_mapM_: OK (0.02s)
  6367. 1444.07 s [vector] +++ OK, passed 100 tests.
  6368. 1444.09 s [vector] mut_imapM_: OK (0.02s)
  6369. 1444.09 s [vector] +++ OK, passed 100 tests.
  6370. 1444.11 s [vector] mut_forM_: OK (0.02s)
  6371. 1444.11 s [vector] +++ OK, passed 100 tests.
  6372. 1444.12 s [vector] mut_iforM_: OK (0.02s)
  6373. 1444.12 s [vector] +++ OK, passed 100 tests.
  6374. 1444.13 s [vector] mut_foldr: OK
  6375. 1444.13 s [vector] +++ OK, passed 100 tests.
  6376. 1444.13 s [vector] mut_foldr': OK
  6377. 1444.14 s [vector] +++ OK, passed 100 tests.
  6378. 1444.14 s [vector] mut_foldl: OK
  6379. 1444.14 s [vector] +++ OK, passed 100 tests.
  6380. 1444.14 s [vector] mut_foldl': OK
  6381. 1444.14 s [vector] +++ OK, passed 100 tests.
  6382. 1444.14 s [vector] mut_ifoldr: OK
  6383. 1444.14 s [vector] +++ OK, passed 100 tests.
  6384. 1444.14 s [vector] mut_ifoldr': OK
  6385. 1444.15 s [vector] +++ OK, passed 100 tests.
  6386. 1444.15 s [vector] mut_ifoldl: OK
  6387. 1444.15 s [vector] +++ OK, passed 100 tests.
  6388. 1444.15 s [vector] mut_ifoldl': OK
  6389. 1444.16 s [vector] +++ OK, passed 100 tests.
  6390. 1444.16 s [vector] mut_foldM: OK
  6391. 1444.17 s [vector] +++ OK, passed 100 tests.
  6392. 1444.17 s [vector] mut_foldM': OK
  6393. 1444.17 s [vector] +++ OK, passed 100 tests.
  6394. 1444.17 s [vector] mut_foldrM: OK
  6395. 1444.17 s [vector] +++ OK, passed 100 tests.
  6396. 1444.17 s [vector] mut_foldrM': OK
  6397. 1444.17 s [vector] +++ OK, passed 100 tests.
  6398. 1444.17 s [vector] mut_ifoldM: OK
  6399. 1444.17 s [vector] +++ OK, passed 100 tests.
  6400. 1444.18 s [vector] mut_ifoldM': OK
  6401. 1444.18 s [vector] +++ OK, passed 100 tests.
  6402. 1444.18 s [vector] mut_ifoldrM: OK
  6403. 1444.18 s [vector] +++ OK, passed 100 tests.
  6404. 1444.18 s [vector] mut_ifoldrM': OK
  6405. 1444.18 s [vector] +++ OK, passed 100 tests.
  6406. 1444.18 s [vector] compare: OK
  6407. 1444.19 s [vector] +++ OK, passed 100 tests.
  6408. 1444.19 s [vector] maximum: OK
  6409. 1444.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6410. 1444.19 s [vector] minimum: OK
  6411. 1444.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6412. 1444.19 s [vector] minIndex: OK
  6413. 1444.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6414. 1444.19 s [vector] maxIndex: OK
  6415. 1444.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6416. 1444.19 s [vector] maximumBy: OK
  6417. 1444.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6418. 1444.19 s [vector] minimumBy: OK
  6419. 1444.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6420. 1444.19 s [vector] maximumOn: OK
  6421. 1444.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6422. 1444.19 s [vector] minimumOn: OK
  6423. 1444.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6424. 1444.19 s [vector] maxIndexBy: OK
  6425. 1444.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6426. 1444.19 s [vector] minIndexBy: OK
  6427. 1444.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6428. 1444.19 s [vector] ListFirstMaxIndexWins: OK
  6429. 1444.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6430. 1444.19 s [vector] FalseListFirstMaxIndexWins: OK
  6431. 1444.19 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6432. 1444.19 s [vector] []
  6433. 1444.19 s [vector] mempty: OK
  6434. 1444.19 s [vector] +++ OK, passed 100 tests.
  6435. 1444.21 s [vector] mappend: OK
  6436. 1444.21 s [vector] +++ OK, passed 100 tests.
  6437. 1444.22 s [vector] mconcat: OK (0.02s)
  6438. 1444.22 s [vector] +++ OK, passed 100 tests.
  6439. 1444.22 s [vector] glength: OK
  6440. 1444.22 s [vector] +++ OK, passed 100 tests.
  6441. 1444.22 s [vector] sum: OK
  6442. 1444.22 s [vector] +++ OK, passed 100 tests.
  6443. 1444.22 s [vector] product: OK
  6444. 1444.22 s [vector] +++ OK, passed 100 tests.
  6445. 1444.22 s [vector] enumFromN: OK
  6446. 1444.22 s [vector] +++ OK, passed 100 tests.
  6447. 1444.22 s [vector] enumFromThenN: OK
  6448. 1444.22 s [vector] +++ OK, passed 100 tests.
  6449. 1444.22 s [vector] enumFromTo: OK
  6450. 1444.22 s [vector] +++ OK, passed 100 tests.
  6451. 1444.22 s [vector] enumFromThenTo: OK
  6452. 1444.22 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6453. 1444.22 s [vector] Data.Vector.Storable.Vector (Double)
  6454. 1444.22 s [vector] fromList.toList == id: OK
  6455. 1444.22 s [vector] +++ OK, passed 100 tests.
  6456. 1444.22 s [vector] toList.fromList == id: OK
  6457. 1444.22 s [vector] +++ OK, passed 100 tests.
  6458. 1444.23 s [vector] unstream.stream == id: OK
  6459. 1444.23 s [vector] +++ OK, passed 100 tests.
  6460. 1444.23 s [vector] stream.unstream == id: OK
  6461. 1444.23 s [vector] +++ OK, passed 100 tests.
  6462. 1444.23 s [vector] eq: OK
  6463. 1444.23 s [vector] +++ OK, passed 100 tests.
  6464. 1444.23 s [vector] length: OK
  6465. 1444.23 s [vector] +++ OK, passed 100 tests.
  6466. 1444.23 s [vector] null: OK
  6467. 1444.23 s [vector] +++ OK, passed 100 tests.
  6468. 1444.23 s [vector] index: OK
  6469. 1444.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6470. 1444.23 s [vector] safeIndex: OK
  6471. 1444.23 s [vector] +++ OK, passed 100 tests.
  6472. 1444.23 s [vector] head: OK
  6473. 1444.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6474. 1444.23 s [vector] last: OK
  6475. 1444.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6476. 1444.23 s [vector] unsafeIndex: OK
  6477. 1444.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6478. 1444.23 s [vector] unsafeHead: OK
  6479. 1444.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6480. 1444.24 s [vector] unsafeLast: OK
  6481. 1444.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6482. 1444.24 s [vector] slice: OK
  6483. 1444.24 s [vector] +++ OK, passed 100 tests.
  6484. 1444.24 s [vector] init: OK
  6485. 1444.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6486. 1444.24 s [vector] tail: OK
  6487. 1444.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6488. 1444.24 s [vector] take: OK
  6489. 1444.24 s [vector] +++ OK, passed 100 tests.
  6490. 1444.24 s [vector] drop: OK
  6491. 1444.24 s [vector] +++ OK, passed 100 tests.
  6492. 1444.24 s [vector] splitAt: OK
  6493. 1444.24 s [vector] +++ OK, passed 100 tests.
  6494. 1444.24 s [vector] empty: OK
  6495. 1444.24 s [vector] +++ OK, passed 100 tests.
  6496. 1444.24 s [vector] singleton: OK
  6497. 1444.24 s [vector] +++ OK, passed 100 tests.
  6498. 1444.24 s [vector] replicate: OK
  6499. 1444.24 s [vector] +++ OK, passed 100 tests.
  6500. 1444.24 s [vector] generate: OK
  6501. 1444.25 s [vector] +++ OK, passed 100 tests.
  6502. 1444.25 s [vector] iterateN: OK
  6503. 1444.25 s [vector] +++ OK, passed 100 tests.
  6504. 1444.29 s [vector] iterateNM: OK (0.03s)
  6505. 1444.29 s [vector] +++ OK, passed 100 tests.
  6506. 1444.31 s [vector] generateM: OK (0.03s)
  6507. 1444.31 s [vector] +++ OK, passed 100 tests.
  6508. 1444.31 s [vector] replicateM: OK (0.01s)
  6509. 1444.32 s [vector] +++ OK, passed 100 tests.
  6510. 1444.32 s [vector] create: OK
  6511. 1444.32 s [vector] +++ OK, passed 100 tests.
  6512. 1444.32 s [vector] createT: OK
  6513. 1444.32 s [vector] +++ OK, passed 100 tests.
  6514. 1444.32 s [vector] unfoldr: OK
  6515. 1444.32 s [vector] +++ OK, passed 100 tests.
  6516. 1444.32 s [vector] unfoldrN: OK
  6517. 1444.32 s [vector] +++ OK, passed 100 tests.
  6518. 1444.32 s [vector] unfoldrExactN: OK
  6519. 1444.32 s [vector] +++ OK, passed 100 tests.
  6520. 1444.33 s [vector] unfoldrM: OK
  6521. 1444.33 s [vector] +++ OK, passed 100 tests.
  6522. 1444.35 s [vector] unfoldrNM: OK (0.02s)
  6523. 1444.35 s [vector] +++ OK, passed 100 tests.
  6524. 1444.41 s [vector] unfoldrExactNM: OK (0.06s)
  6525. 1444.41 s [vector] +++ OK, passed 100 tests.
  6526. 1444.43 s [vector] constructN: OK (0.02s)
  6527. 1444.43 s [vector] +++ OK, passed 100 tests.
  6528. 1444.43 s [vector] constructrN: OK (0.02s)
  6529. 1444.43 s [vector] +++ OK, passed 100 tests.
  6530. 1444.43 s [vector] cons: OK
  6531. 1444.43 s [vector] +++ OK, passed 100 tests.
  6532. 1444.94 s [vector] snoc: OK
  6533. 1444.94 s [vector] +++ OK, passed 100 tests.
  6534. 1444.94 s [vector] append: OK
  6535. 1444.94 s [vector] +++ OK, passed 100 tests.
  6536. 1444.94 s [vector] concat: OK (0.02s)
  6537. 1444.94 s [vector] +++ OK, passed 100 tests.
  6538. 1444.94 s [vector] force: OK
  6539. 1444.94 s [vector] +++ OK, passed 100 tests.
  6540. 1444.94 s [vector] upd: OK
  6541. 1444.94 s [vector] +++ OK, passed 100 tests.
  6542. 1444.94 s [vector] accum: OK (0.01s)
  6543. 1444.94 s [vector] +++ OK, passed 100 tests.
  6544. 1444.94 s [vector] reverse: OK
  6545. 1444.94 s [vector] +++ OK, passed 100 tests.
  6546. 1444.94 s [vector] backpermute: OK
  6547. 1444.94 s [vector] +++ OK, passed 100 tests.
  6548. 1444.94 s [vector] map: OK
  6549. 1444.94 s [vector] +++ OK, passed 100 tests.
  6550. 1444.94 s [vector] imap: OK (0.02s)
  6551. 1444.94 s [vector] +++ OK, passed 100 tests.
  6552. 1444.94 s [vector] concatMap: OK (0.02s)
  6553. 1444.94 s [vector] +++ OK, passed 100 tests.
  6554. 1444.94 s [vector] mapM: OK (0.02s)
  6555. 1444.94 s [vector] +++ OK, passed 100 tests.
  6556. 1444.94 s [vector] mapM_: OK (0.05s)
  6557. 1444.94 s [vector] +++ OK, passed 100 tests.
  6558. 1444.94 s [vector] forM: OK
  6559. 1444.94 s [vector] +++ OK, passed 100 tests.
  6560. 1444.94 s [vector] forM_: OK (0.04s)
  6561. 1444.94 s [vector] +++ OK, passed 100 tests.
  6562. 1444.95 s [vector] imapM: OK (0.01s)
  6563. 1444.95 s [vector] +++ OK, passed 100 tests.
  6564. 1444.95 s [vector] imapM_: OK (0.05s)
  6565. 1444.95 s [vector] +++ OK, passed 100 tests.
  6566. 1444.95 s [vector] zipWith: OK (0.01s)
  6567. 1444.95 s [vector] +++ OK, passed 100 tests.
  6568. 1444.95 s [vector] zipWith3: OK (0.01s)
  6569. 1444.95 s [vector] +++ OK, passed 100 tests.
  6570. 1444.95 s [vector] izipWith: OK (0.01s)
  6571. 1444.95 s [vector] +++ OK, passed 100 tests.
  6572. 1444.95 s [vector] izipWith3: OK (0.01s)
  6573. 1444.95 s [vector] +++ OK, passed 100 tests.
  6574. 1444.95 s [vector] izipWithM: OK (0.01s)
  6575. 1444.95 s [vector] +++ OK, passed 100 tests.
  6576. 1444.95 s [vector] izipWithM_: OK (0.03s)
  6577. 1444.95 s [vector] +++ OK, passed 100 tests.
  6578. 1444.95 s [vector] zipWithM: OK (0.01s)
  6579. 1444.95 s [vector] +++ OK, passed 100 tests.
  6580. 1444.95 s [vector] zipWithM_: OK (0.03s)
  6581. 1444.95 s [vector] +++ OK, passed 100 tests.
  6582. 1444.95 s [vector] filter: OK
  6583. 1444.95 s [vector] +++ OK, passed 100 tests.
  6584. 1444.95 s [vector] ifilter: OK
  6585. 1444.95 s [vector] +++ OK, passed 100 tests.
  6586. 1444.95 s [vector] filterM: OK (0.05s)
  6587. 1444.95 s [vector] +++ OK, passed 100 tests.
  6588. 1444.95 s [vector] uniq: OK
  6589. 1444.95 s [vector] +++ OK, passed 100 tests.
  6590. 1444.95 s [vector] mapMaybe: OK
  6591. 1444.95 s [vector] +++ OK, passed 100 tests.
  6592. 1444.95 s [vector] imapMaybe: OK (0.02s)
  6593. 1444.95 s [vector] +++ OK, passed 100 tests.
  6594. 1444.95 s [vector] takeWhile: OK
  6595. 1444.95 s [vector] +++ OK, passed 100 tests.
  6596. 1444.95 s [vector] dropWhile: OK
  6597. 1444.95 s [vector] +++ OK, passed 100 tests.
  6598. 1444.95 s [vector] partition: OK
  6599. 1444.95 s [vector] +++ OK, passed 100 tests.
  6600. 1444.95 s [vector] partitionWith: OK (0.01s)
  6601. 1444.95 s [vector] +++ OK, passed 100 tests.
  6602. 1444.95 s [vector] span: OK
  6603. 1444.95 s [vector] +++ OK, passed 100 tests.
  6604. 1444.95 s [vector] break: OK
  6605. 1444.95 s [vector] +++ OK, passed 100 tests.
  6606. 1444.96 s [vector] spanR: OK
  6607. 1444.96 s [vector] +++ OK, passed 100 tests.
  6608. 1444.96 s [vector] breakR: OK
  6609. 1444.96 s [vector] +++ OK, passed 100 tests.
  6610. 1444.97 s [vector] groupBy: OK (0.01s)
  6611. 1444.97 s [vector] +++ OK, passed 100 tests.
  6612. 1444.97 s [vector] elem: OK
  6613. 1444.98 s [vector] +++ OK, passed 100 tests.
  6614. 1444.98 s [vector] notElem: OK
  6615. 1444.99 s [vector] +++ OK, passed 100 tests.
  6616. 1445.00 s [vector] find: OK
  6617. 1445.00 s [vector] +++ OK, passed 100 tests.
  6618. 1445.01 s [vector] findIndex: OK
  6619. 1445.01 s [vector] +++ OK, passed 100 tests.
  6620. 1445.01 s [vector] findIndexR: OK
  6621. 1445.01 s [vector] +++ OK, passed 100 tests.
  6622. 1445.01 s [vector] findIndices: OK
  6623. 1445.01 s [vector] +++ OK, passed 100 tests.
  6624. 1445.02 s [vector] elemIndex: OK
  6625. 1445.02 s [vector] +++ OK, passed 100 tests.
  6626. 1445.02 s [vector] elemIndices: OK
  6627. 1445.02 s [vector] +++ OK, passed 100 tests.
  6628. 1445.02 s [vector] foldl: OK (0.02s)
  6629. 1445.02 s [vector] +++ OK, passed 100 tests.
  6630. 1445.03 s [vector] foldl1: OK (0.02s)
  6631. 1445.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6632. 1445.06 s [vector] foldl': OK (0.01s)
  6633. 1445.07 s [vector] +++ OK, passed 100 tests.
  6634. 1445.07 s [vector] foldl1': OK (0.01s)
  6635. 1445.07 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6636. 1445.07 s [vector] foldr: OK (0.02s)
  6637. 1445.07 s [vector] +++ OK, passed 100 tests.
  6638. 1445.09 s [vector] foldr1: OK (0.01s)
  6639. 1445.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6640. 1445.10 s [vector] foldr': OK (0.01s)
  6641. 1445.10 s [vector] +++ OK, passed 100 tests.
  6642. 1445.11 s [vector] foldr1': OK (0.01s)
  6643. 1445.11 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6644. 1445.13 s [vector] ifoldl: OK (0.01s)
  6645. 1445.13 s [vector] +++ OK, passed 100 tests.
  6646. 1445.15 s [vector] ifoldl': OK (0.01s)
  6647. 1445.15 s [vector] +++ OK, passed 100 tests.
  6648. 1445.16 s [vector] ifoldr: OK (0.02s)
  6649. 1445.16 s [vector] +++ OK, passed 100 tests.
  6650. 1445.17 s [vector] ifoldr': OK (0.01s)
  6651. 1445.17 s [vector] +++ OK, passed 100 tests.
  6652. 1445.19 s [vector] ifoldM: OK (0.01s)
  6653. 1445.19 s [vector] +++ OK, passed 100 tests.
  6654. 1445.21 s [vector] ifoldM': OK (0.01s)
  6655. 1445.21 s [vector] +++ OK, passed 100 tests.
  6656. 1445.25 s [vector] ifoldM_: OK (0.04s)
  6657. 1445.25 s [vector] +++ OK, passed 100 tests.
  6658. 1445.28 s [vector] ifoldM'_: OK (0.05s)
  6659. 1445.28 s [vector] +++ OK, passed 100 tests.
  6660. 1445.28 s [vector] all: OK
  6661. 1445.28 s [vector] +++ OK, passed 100 tests.
  6662. 1445.29 s [vector] any: OK
  6663. 1445.29 s [vector] +++ OK, passed 100 tests.
  6664. 1445.31 s [vector] prescanl: OK (0.01s)
  6665. 1445.31 s [vector] +++ OK, passed 100 tests.
  6666. 1445.33 s [vector] prescanl': OK (0.01s)
  6667. 1445.33 s [vector] +++ OK, passed 100 tests.
  6668. 1445.33 s [vector] postscanl: OK (0.02s)
  6669. 1445.34 s [vector] +++ OK, passed 100 tests.
  6670. 1445.35 s [vector] postscanl': OK (0.01s)
  6671. 1445.35 s [vector] +++ OK, passed 100 tests.
  6672. 1445.37 s [vector] scanl: OK (0.02s)
  6673. 1445.38 s [vector] +++ OK, passed 100 tests.
  6674. 1445.39 s [vector] scanl': OK (0.01s)
  6675. 1445.39 s [vector] +++ OK, passed 100 tests.
  6676. 1445.39 s [vector] scanl1: OK (0.02s)
  6677. 1445.39 s [vector] +++ OK, passed 100 tests.
  6678. 1445.41 s [vector] scanl1': OK (0.01s)
  6679. 1445.41 s [vector] +++ OK, passed 100 tests.
  6680. 1445.41 s [vector] iscanl: OK (0.02s)
  6681. 1445.41 s [vector] +++ OK, passed 100 tests.
  6682. 1445.44 s [vector] iscanl': OK
  6683. 1445.45 s [vector] +++ OK, passed 100 tests.
  6684. 1445.45 s [vector] prescanr: OK (0.01s)
  6685. 1445.45 s [vector] +++ OK, passed 100 tests.
  6686. 1445.47 s [vector] prescanr': OK (0.01s)
  6687. 1445.47 s [vector] +++ OK, passed 100 tests.
  6688. 1445.49 s [vector] postscanr: OK (0.02s)
  6689. 1445.49 s [vector] +++ OK, passed 100 tests.
  6690. 1445.51 s [vector] postscanr': OK (0.02s)
  6691. 1445.51 s [vector] +++ OK, passed 100 tests.
  6692. 1445.53 s [vector] scanr: OK (0.02s)
  6693. 1445.53 s [vector] +++ OK, passed 100 tests.
  6694. 1445.55 s [vector] scanr': OK (0.02s)
  6695. 1445.55 s [vector] +++ OK, passed 100 tests.
  6696. 1445.55 s [vector] scanr1: OK (0.02s)
  6697. 1445.55 s [vector] +++ OK, passed 100 tests.
  6698. 1445.57 s [vector] scanr1': OK (0.02s)
  6699. 1445.57 s [vector] +++ OK, passed 100 tests.
  6700. 1445.59 s [vector] iscanr: OK (0.01s)
  6701. 1445.59 s [vector] +++ OK, passed 100 tests.
  6702. 1445.59 s [vector] iscanr': OK (0.01s)
  6703. 1445.59 s [vector] +++ OK, passed 100 tests.
  6704. 1445.59 s [vector] mut_read: OK
  6705. 1445.60 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6706. 1445.61 s [vector] mut_write: OK
  6707. 1445.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6708. 1445.61 s [vector] mut_modify: OK
  6709. 1445.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6710. 1445.61 s [vector] mut_generate: OK
  6711. 1445.61 s [vector] +++ OK, passed 100 tests.
  6712. 1445.63 s [vector] mut_generateM: OK (0.02s)
  6713. 1445.63 s [vector] +++ OK, passed 100 tests.
  6714. 1445.67 s [vector] mut_mapM_: OK (0.04s)
  6715. 1445.67 s [vector] +++ OK, passed 100 tests.
  6716. 1445.71 s [vector] mut_imapM_: OK (0.04s)
  6717. 1445.71 s [vector] +++ OK, passed 100 tests.
  6718. 1445.74 s [vector] mut_forM_: OK (0.05s)
  6719. 1445.74 s [vector] +++ OK, passed 100 tests.
  6720. 1445.79 s [vector] mut_iforM_: OK (0.03s)
  6721. 1445.79 s [vector] +++ OK, passed 100 tests.
  6722. 1445.81 s [vector] mut_foldr: OK (0.02s)
  6723. 1445.81 s [vector] +++ OK, passed 100 tests.
  6724. 1445.83 s [vector] mut_foldr': OK (0.01s)
  6725. 1445.83 s [vector] +++ OK, passed 100 tests.
  6726. 1445.83 s [vector] mut_foldl: OK (0.01s)
  6727. 1445.83 s [vector] +++ OK, passed 100 tests.
  6728. 1445.85 s [vector] mut_foldl': OK (0.01s)
  6729. 1445.85 s [vector] +++ OK, passed 100 tests.
  6730. 1445.86 s [vector] mut_ifoldr: OK (0.01s)
  6731. 1445.87 s [vector] +++ OK, passed 100 tests.
  6732. 1445.87 s [vector] mut_ifoldr': OK (0.01s)
  6733. 1445.87 s [vector] +++ OK, passed 100 tests.
  6734. 1445.89 s [vector] mut_ifoldl: OK (0.02s)
  6735. 1445.89 s [vector] +++ OK, passed 100 tests.
  6736. 1445.90 s [vector] mut_ifoldl': OK (0.02s)
  6737. 1445.90 s [vector] +++ OK, passed 100 tests.
  6738. 1445.91 s [vector] mut_foldM: OK
  6739. 1445.91 s [vector] +++ OK, passed 100 tests.
  6740. 1445.94 s [vector] mut_foldM': OK (0.02s)
  6741. 1445.94 s [vector] +++ OK, passed 100 tests.
  6742. 1445.95 s [vector] mut_foldrM: OK (0.01s)
  6743. 1445.95 s [vector] +++ OK, passed 100 tests.
  6744. 1445.96 s [vector] mut_foldrM': OK (0.02s)
  6745. 1445.96 s [vector] +++ OK, passed 100 tests.
  6746. 1445.97 s [vector] mut_ifoldM: OK
  6747. 1445.97 s [vector] +++ OK, passed 100 tests.
  6748. 1445.99 s [vector] mut_ifoldM': OK (0.01s)
  6749. 1445.99 s [vector] +++ OK, passed 100 tests.
  6750. 1446.01 s [vector] mut_ifoldrM: OK (0.01s)
  6751. 1446.01 s [vector] +++ OK, passed 100 tests.
  6752. 1446.01 s [vector] mut_ifoldrM': OK (0.01s)
  6753. 1446.01 s [vector] +++ OK, passed 100 tests.
  6754. 1446.01 s [vector] compare: OK
  6755. 1446.01 s [vector] +++ OK, passed 100 tests.
  6756. 1446.01 s [vector] maximum: OK
  6757. 1446.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6758. 1446.02 s [vector] minimum: OK
  6759. 1446.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6760. 1446.02 s [vector] minIndex: OK
  6761. 1446.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6762. 1446.02 s [vector] maxIndex: OK
  6763. 1446.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6764. 1446.02 s [vector] maximumBy: OK
  6765. 1446.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6766. 1446.02 s [vector] minimumBy: OK
  6767. 1446.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6768. 1446.02 s [vector] maximumOn: OK
  6769. 1446.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6770. 1446.02 s [vector] minimumOn: OK
  6771. 1446.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6772. 1446.02 s [vector] maxIndexBy: OK
  6773. 1446.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6774. 1446.02 s [vector] minIndexBy: OK
  6775. 1446.02 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6776. 1446.02 s [vector] ListFirstMaxIndexWins: OK
  6777. 1446.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6778. 1446.02 s [vector] FalseListFirstMaxIndexWins: OK
  6779. 1446.02 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6780. 1446.02 s [vector] []
  6781. 1446.02 s [vector] mempty: OK
  6782. 1446.03 s [vector] +++ OK, passed 100 tests.
  6783. 1446.03 s [vector] mappend: OK
  6784. 1446.03 s [vector] +++ OK, passed 100 tests.
  6785. 1446.05 s [vector] mconcat: OK (0.02s)
  6786. 1446.05 s [vector] +++ OK, passed 100 tests.
  6787. 1446.05 s [vector] glength: OK
  6788. 1446.05 s [vector] +++ OK, passed 100 tests.
  6789. 1446.06 s [vector] sum: OK
  6790. 1446.06 s [vector] +++ OK, passed 100 tests.
  6791. 1446.06 s [vector] product: OK
  6792. 1446.06 s [vector] +++ OK, passed 100 tests.
  6793. 1446.06 s [vector] enumFromN: OK
  6794. 1446.06 s [vector] +++ OK, passed 100 tests.
  6795. 1446.06 s [vector] enumFromThenN: OK
  6796. 1446.06 s [vector] +++ OK, passed 100 tests.
  6797. 1446.06 s [vector] enumFromTo: OK
  6798. 1446.06 s [vector] +++ OK, passed 100 tests.
  6799. 1446.06 s [vector] enumFromThenTo: OK
  6800. 1446.06 s [vector] +++ OK, passed 100 tests; 5 discarded.
  6801. 1446.06 s [vector] unstream
  6802. 1446.06 s [vector] unstream == vunstream (exact): OK
  6803. 1446.07 s [vector] +++ OK, passed 100 tests.
  6804. 1446.07 s [vector] unstream == vunstream (unknown): OK
  6805. 1446.07 s [vector] +++ OK, passed 100 tests.
  6806. 1446.07 s [vector] unstreamR ~= vunstream (exact): OK
  6807. 1446.07 s [vector] +++ OK, passed 100 tests.
  6808. 1446.07 s [vector] unstreamR ~= vunstream (unknown): OK
  6809. 1446.07 s [vector] +++ OK, passed 100 tests.
  6810. 1446.07 s [vector] Tests.Vector.Strict
  6811. 1446.07 s [vector] Bool
  6812. 1446.07 s [vector] fromList.toList == id: OK
  6813. 1446.07 s [vector] +++ OK, passed 100 tests.
  6814. 1446.07 s [vector] toList.fromList == id: OK
  6815. 1446.07 s [vector] +++ OK, passed 100 tests.
  6816. 1446.07 s [vector] unstream.stream == id: OK
  6817. 1446.07 s [vector] +++ OK, passed 100 tests.
  6818. 1446.07 s [vector] stream.unstream == id: OK
  6819. 1446.07 s [vector] +++ OK, passed 100 tests.
  6820. 1446.07 s [vector] eq: OK
  6821. 1446.07 s [vector] +++ OK, passed 100 tests.
  6822. 1446.07 s [vector] length: OK
  6823. 1446.07 s [vector] +++ OK, passed 100 tests.
  6824. 1446.07 s [vector] null: OK
  6825. 1446.07 s [vector] +++ OK, passed 100 tests.
  6826. 1446.07 s [vector] index: OK
  6827. 1446.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6828. 1446.07 s [vector] safeIndex: OK
  6829. 1446.07 s [vector] +++ OK, passed 100 tests.
  6830. 1446.07 s [vector] head: OK
  6831. 1446.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6832. 1446.07 s [vector] last: OK
  6833. 1446.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6834. 1446.07 s [vector] unsafeIndex: OK
  6835. 1446.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6836. 1446.07 s [vector] unsafeHead: OK
  6837. 1446.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6838. 1446.07 s [vector] unsafeLast: OK
  6839. 1446.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6840. 1446.07 s [vector] slice: OK
  6841. 1446.07 s [vector] +++ OK, passed 100 tests.
  6842. 1446.07 s [vector] init: OK
  6843. 1446.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6844. 1446.07 s [vector] tail: OK
  6845. 1446.07 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6846. 1446.07 s [vector] take: OK
  6847. 1446.07 s [vector] +++ OK, passed 100 tests.
  6848. 1446.07 s [vector] drop: OK
  6849. 1446.07 s [vector] +++ OK, passed 100 tests.
  6850. 1446.08 s [vector] splitAt: OK
  6851. 1446.08 s [vector] +++ OK, passed 100 tests.
  6852. 1446.08 s [vector] empty: OK
  6853. 1446.08 s [vector] +++ OK, passed 100 tests.
  6854. 1446.08 s [vector] singleton: OK
  6855. 1446.08 s [vector] +++ OK, passed 100 tests.
  6856. 1446.09 s [vector] replicate: OK
  6857. 1446.09 s [vector] +++ OK, passed 100 tests.
  6858. 1446.09 s [vector] generate: OK
  6859. 1446.09 s [vector] +++ OK, passed 100 tests.
  6860. 1446.09 s [vector] iterateN: OK
  6861. 1446.09 s [vector] +++ OK, passed 100 tests.
  6862. 1446.13 s [vector] iterateNM: OK (0.04s)
  6863. 1446.13 s [vector] +++ OK, passed 100 tests.
  6864. 1446.14 s [vector] generateM: OK (0.02s)
  6865. 1446.14 s [vector] +++ OK, passed 100 tests.
  6866. 1446.14 s [vector] replicateM: OK
  6867. 1446.14 s [vector] +++ OK, passed 100 tests.
  6868. 1446.14 s [vector] create: OK
  6869. 1446.14 s [vector] +++ OK, passed 100 tests.
  6870. 1446.15 s [vector] createT: OK
  6871. 1446.15 s [vector] +++ OK, passed 100 tests.
  6872. 1446.15 s [vector] unfoldr: OK
  6873. 1446.15 s [vector] +++ OK, passed 100 tests.
  6874. 1446.15 s [vector] unfoldrN: OK
  6875. 1446.15 s [vector] +++ OK, passed 100 tests.
  6876. 1446.15 s [vector] unfoldrExactN: OK
  6877. 1446.15 s [vector] +++ OK, passed 100 tests.
  6878. 1446.15 s [vector] unfoldrM: OK
  6879. 1446.15 s [vector] +++ OK, passed 100 tests.
  6880. 1446.17 s [vector] unfoldrNM: OK
  6881. 1446.17 s [vector] +++ OK, passed 100 tests.
  6882. 1446.19 s [vector] unfoldrExactNM: OK (0.04s)
  6883. 1446.20 s [vector] +++ OK, passed 100 tests.
  6884. 1446.20 s [vector] constructN: OK
  6885. 1446.20 s [vector] +++ OK, passed 100 tests.
  6886. 1446.20 s [vector] constructrN: OK
  6887. 1446.20 s [vector] +++ OK, passed 100 tests.
  6888. 1446.20 s [vector] cons: OK
  6889. 1446.20 s [vector] +++ OK, passed 100 tests.
  6890. 1446.20 s [vector] snoc: OK
  6891. 1446.20 s [vector] +++ OK, passed 100 tests.
  6892. 1446.20 s [vector] append: OK
  6893. 1446.21 s [vector] +++ OK, passed 100 tests.
  6894. 1446.21 s [vector] concat: OK (0.01s)
  6895. 1446.21 s [vector] +++ OK, passed 100 tests.
  6896. 1446.21 s [vector] force: OK
  6897. 1446.21 s [vector] +++ OK, passed 100 tests.
  6898. 1446.21 s [vector] upd: OK
  6899. 1446.22 s [vector] +++ OK, passed 100 tests.
  6900. 1446.22 s [vector] accum: OK
  6901. 1446.22 s [vector] +++ OK, passed 100 tests.
  6902. 1446.22 s [vector] reverse: OK
  6903. 1446.22 s [vector] +++ OK, passed 100 tests.
  6904. 1446.22 s [vector] backpermute: OK
  6905. 1446.22 s [vector] +++ OK, passed 100 tests.
  6906. 1446.22 s [vector] map: OK
  6907. 1446.22 s [vector] +++ OK, passed 100 tests.
  6908. 1446.23 s [vector] imap: OK
  6909. 1446.23 s [vector] +++ OK, passed 100 tests.
  6910. 1446.23 s [vector] concatMap: OK
  6911. 1446.23 s [vector] +++ OK, passed 100 tests.
  6912. 1446.25 s [vector] mapM: OK
  6913. 1446.25 s [vector] +++ OK, passed 100 tests.
  6914. 1446.26 s [vector] mapM_: OK (0.03s)
  6915. 1446.27 s [vector] +++ OK, passed 100 tests.
  6916. 1446.27 s [vector] forM: OK
  6917. 1446.27 s [vector] +++ OK, passed 100 tests.
  6918. 1446.28 s [vector] forM_: OK (0.02s)
  6919. 1446.29 s [vector] +++ OK, passed 100 tests.
  6920. 1446.29 s [vector] imapM: OK
  6921. 1446.29 s [vector] +++ OK, passed 100 tests.
  6922. 1446.30 s [vector] imapM_: OK (0.01s)
  6923. 1446.30 s [vector] +++ OK, passed 100 tests.
  6924. 1446.30 s [vector] zipWith: OK
  6925. 1446.30 s [vector] +++ OK, passed 100 tests.
  6926. 1446.30 s [vector] zipWith3: OK
  6927. 1446.30 s [vector] +++ OK, passed 100 tests.
  6928. 1446.30 s [vector] izipWith: OK
  6929. 1446.30 s [vector] +++ OK, passed 100 tests.
  6930. 1446.31 s [vector] izipWith3: OK
  6931. 1446.31 s [vector] +++ OK, passed 100 tests.
  6932. 1446.31 s [vector] izipWithM: OK
  6933. 1446.31 s [vector] +++ OK, passed 100 tests.
  6934. 1446.32 s [vector] izipWithM_: OK (0.01s)
  6935. 1446.32 s [vector] +++ OK, passed 100 tests.
  6936. 1446.32 s [vector] zipWithM: OK
  6937. 1446.32 s [vector] +++ OK, passed 100 tests.
  6938. 1446.34 s [vector] zipWithM_: OK
  6939. 1446.34 s [vector] +++ OK, passed 100 tests.
  6940. 1446.35 s [vector] filter: OK
  6941. 1446.35 s [vector] +++ OK, passed 100 tests.
  6942. 1446.35 s [vector] ifilter: OK
  6943. 1446.35 s [vector] +++ OK, passed 100 tests.
  6944. 1446.37 s [vector] filterM: OK (0.03s)
  6945. 1446.37 s [vector] +++ OK, passed 100 tests.
  6946. 1446.37 s [vector] uniq: OK
  6947. 1446.37 s [vector] +++ OK, passed 100 tests.
  6948. 1446.37 s [vector] mapMaybe: OK
  6949. 1446.37 s [vector] +++ OK, passed 100 tests.
  6950. 1446.37 s [vector] imapMaybe: OK
  6951. 1446.37 s [vector] +++ OK, passed 100 tests.
  6952. 1446.38 s [vector] takeWhile: OK
  6953. 1446.38 s [vector] +++ OK, passed 100 tests.
  6954. 1446.38 s [vector] dropWhile: OK
  6955. 1446.38 s [vector] +++ OK, passed 100 tests.
  6956. 1446.38 s [vector] partition: OK
  6957. 1446.39 s [vector] +++ OK, passed 100 tests.
  6958. 1446.39 s [vector] partitionWith: OK
  6959. 1446.39 s [vector] +++ OK, passed 100 tests.
  6960. 1446.39 s [vector] span: OK
  6961. 1446.39 s [vector] +++ OK, passed 100 tests.
  6962. 1446.39 s [vector] break: OK
  6963. 1446.39 s [vector] +++ OK, passed 100 tests.
  6964. 1446.39 s [vector] spanR: OK
  6965. 1446.39 s [vector] +++ OK, passed 100 tests.
  6966. 1446.40 s [vector] breakR: OK
  6967. 1446.40 s [vector] +++ OK, passed 100 tests.
  6968. 1446.40 s [vector] groupBy: OK
  6969. 1446.40 s [vector] +++ OK, passed 100 tests.
  6970. 1446.40 s [vector] elem: OK
  6971. 1446.40 s [vector] +++ OK, passed 100 tests.
  6972. 1446.40 s [vector] notElem: OK
  6973. 1446.40 s [vector] +++ OK, passed 100 tests.
  6974. 1446.40 s [vector] find: OK
  6975. 1446.40 s [vector] +++ OK, passed 100 tests.
  6976. 1446.40 s [vector] findIndex: OK
  6977. 1446.40 s [vector] +++ OK, passed 100 tests.
  6978. 1446.40 s [vector] findIndexR: OK
  6979. 1446.40 s [vector] +++ OK, passed 100 tests.
  6980. 1446.40 s [vector] findIndices: OK
  6981. 1446.40 s [vector] +++ OK, passed 100 tests.
  6982. 1446.41 s [vector] elemIndex: OK
  6983. 1446.41 s [vector] +++ OK, passed 100 tests.
  6984. 1446.41 s [vector] elemIndices: OK
  6985. 1446.41 s [vector] +++ OK, passed 100 tests.
  6986. 1446.41 s [vector] foldl: OK
  6987. 1446.41 s [vector] +++ OK, passed 100 tests.
  6988. 1446.41 s [vector] foldl1: OK
  6989. 1446.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6990. 1446.41 s [vector] foldl': OK
  6991. 1446.41 s [vector] +++ OK, passed 100 tests.
  6992. 1446.42 s [vector] foldl1': OK
  6993. 1446.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6994. 1446.42 s [vector] foldr: OK
  6995. 1446.42 s [vector] +++ OK, passed 100 tests.
  6996. 1446.42 s [vector] foldr1: OK
  6997. 1446.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6998. 1446.42 s [vector] foldr': OK
  6999. 1446.42 s [vector] +++ OK, passed 100 tests.
  7000. 1446.43 s [vector] foldr1': OK
  7001. 1446.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7002. 1446.43 s [vector] ifoldl: OK
  7003. 1446.43 s [vector] +++ OK, passed 100 tests.
  7004. 1446.43 s [vector] ifoldl': OK
  7005. 1446.43 s [vector] +++ OK, passed 100 tests.
  7006. 1446.44 s [vector] ifoldr: OK
  7007. 1446.44 s [vector] +++ OK, passed 100 tests.
  7008. 1446.45 s [vector] ifoldr': OK
  7009. 1446.45 s [vector] +++ OK, passed 100 tests.
  7010. 1446.45 s [vector] ifoldM: OK
  7011. 1446.45 s [vector] +++ OK, passed 100 tests.
  7012. 1446.47 s [vector] ifoldM': OK
  7013. 1446.47 s [vector] +++ OK, passed 100 tests.
  7014. 1446.49 s [vector] ifoldM_: OK (0.02s)
  7015. 1446.49 s [vector] +++ OK, passed 100 tests.
  7016. 1446.49 s [vector] ifoldM'_: OK (0.01s)
  7017. 1446.49 s [vector] +++ OK, passed 100 tests.
  7018. 1446.49 s [vector] all: OK
  7019. 1446.49 s [vector] +++ OK, passed 100 tests.
  7020. 1446.49 s [vector] any: OK
  7021. 1446.49 s [vector] +++ OK, passed 100 tests.
  7022. 1446.50 s [vector] prescanl: OK
  7023. 1446.50 s [vector] +++ OK, passed 100 tests.
  7024. 1446.51 s [vector] prescanl': OK
  7025. 1446.51 s [vector] +++ OK, passed 100 tests.
  7026. 1446.51 s [vector] postscanl: OK
  7027. 1446.51 s [vector] +++ OK, passed 100 tests.
  7028. 1446.52 s [vector] postscanl': OK
  7029. 1446.52 s [vector] +++ OK, passed 100 tests.
  7030. 1446.52 s [vector] scanl: OK
  7031. 1446.52 s [vector] +++ OK, passed 100 tests.
  7032. 1446.52 s [vector] scanl': OK
  7033. 1446.52 s [vector] +++ OK, passed 100 tests.
  7034. 1446.52 s [vector] scanl1: OK
  7035. 1446.52 s [vector] +++ OK, passed 100 tests.
  7036. 1446.52 s [vector] scanl1': OK
  7037. 1446.52 s [vector] +++ OK, passed 100 tests.
  7038. 1446.52 s [vector] iscanl: OK
  7039. 1446.52 s [vector] +++ OK, passed 100 tests.
  7040. 1446.53 s [vector] iscanl': OK
  7041. 1446.53 s [vector] +++ OK, passed 100 tests.
  7042. 1446.53 s [vector] prescanr: OK
  7043. 1446.53 s [vector] +++ OK, passed 100 tests.
  7044. 1446.53 s [vector] prescanr': OK
  7045. 1446.53 s [vector] +++ OK, passed 100 tests.
  7046. 1446.53 s [vector] postscanr: OK
  7047. 1446.53 s [vector] +++ OK, passed 100 tests.
  7048. 1446.53 s [vector] postscanr': OK
  7049. 1446.54 s [vector] +++ OK, passed 100 tests.
  7050. 1446.54 s [vector] scanr: OK
  7051. 1446.54 s [vector] +++ OK, passed 100 tests.
  7052. 1446.54 s [vector] scanr': OK
  7053. 1446.54 s [vector] +++ OK, passed 100 tests.
  7054. 1446.54 s [vector] scanr1: OK
  7055. 1446.54 s [vector] +++ OK, passed 100 tests.
  7056. 1446.54 s [vector] scanr1': OK
  7057. 1446.55 s [vector] +++ OK, passed 100 tests.
  7058. 1446.55 s [vector] iscanr: OK
  7059. 1446.55 s [vector] +++ OK, passed 100 tests.
  7060. 1446.55 s [vector] iscanr': OK
  7061. 1446.57 s [vector] +++ OK, passed 100 tests.
  7062. 1446.57 s [vector] mut_read: OK (0.02s)
  7063. 1446.57 s [vector] +++ OK, passed 100 tests; 29 discarded.
  7064. 1446.57 s [vector] mut_write: OK
  7065. 1446.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7066. 1446.58 s [vector] mut_modify: OK
  7067. 1446.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7068. 1446.58 s [vector] mut_generate: OK
  7069. 1446.58 s [vector] +++ OK, passed 100 tests.
  7070. 1446.61 s [vector] mut_generateM: OK (0.01s)
  7071. 1446.61 s [vector] +++ OK, passed 100 tests.
  7072. 1446.62 s [vector] mut_mapM_: OK (0.02s)
  7073. 1446.62 s [vector] +++ OK, passed 100 tests.
  7074. 1446.63 s [vector] mut_imapM_: OK (0.01s)
  7075. 1446.63 s [vector] +++ OK, passed 100 tests.
  7076. 1446.65 s [vector] mut_forM_: OK (0.01s)
  7077. 1446.65 s [vector] +++ OK, passed 100 tests.
  7078. 1446.65 s [vector] mut_iforM_: OK (0.02s)
  7079. 1446.65 s [vector] +++ OK, passed 100 tests.
  7080. 1446.66 s [vector] mut_foldr: OK
  7081. 1446.66 s [vector] +++ OK, passed 100 tests.
  7082. 1446.66 s [vector] mut_foldr': OK
  7083. 1446.66 s [vector] +++ OK, passed 100 tests.
  7084. 1446.66 s [vector] mut_foldl: OK
  7085. 1446.66 s [vector] +++ OK, passed 100 tests.
  7086. 1446.67 s [vector] mut_foldl': OK
  7087. 1446.67 s [vector] +++ OK, passed 100 tests.
  7088. 1446.67 s [vector] mut_ifoldr: OK
  7089. 1446.67 s [vector] +++ OK, passed 100 tests.
  7090. 1446.68 s [vector] mut_ifoldr': OK
  7091. 1446.68 s [vector] +++ OK, passed 100 tests.
  7092. 1446.68 s [vector] mut_ifoldl: OK
  7093. 1446.68 s [vector] +++ OK, passed 100 tests.
  7094. 1446.68 s [vector] mut_ifoldl': OK
  7095. 1446.69 s [vector] +++ OK, passed 100 tests.
  7096. 1446.69 s [vector] mut_foldM: OK
  7097. 1446.69 s [vector] +++ OK, passed 100 tests.
  7098. 1446.70 s [vector] mut_foldM': OK
  7099. 1446.70 s [vector] +++ OK, passed 100 tests.
  7100. 1446.70 s [vector] mut_foldrM: OK
  7101. 1446.70 s [vector] +++ OK, passed 100 tests.
  7102. 1446.71 s [vector] mut_foldrM': OK
  7103. 1446.71 s [vector] +++ OK, passed 100 tests.
  7104. 1446.71 s [vector] mut_ifoldM: OK
  7105. 1446.71 s [vector] +++ OK, passed 100 tests.
  7106. 1446.72 s [vector] mut_ifoldM': OK
  7107. 1446.72 s [vector] +++ OK, passed 100 tests.
  7108. 1446.73 s [vector] mut_ifoldrM: OK
  7109. 1446.73 s [vector] +++ OK, passed 100 tests.
  7110. 1446.73 s [vector] mut_ifoldrM': OK
  7111. 1446.73 s [vector] +++ OK, passed 100 tests.
  7112. 1446.73 s [vector] compare: OK
  7113. 1446.73 s [vector] +++ OK, passed 100 tests.
  7114. 1446.73 s [vector] maximum: OK
  7115. 1446.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7116. 1446.73 s [vector] minimum: OK
  7117. 1446.73 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7118. 1446.73 s [vector] minIndex: OK
  7119. 1446.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7120. 1446.74 s [vector] maxIndex: OK
  7121. 1446.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7122. 1446.74 s [vector] maximumBy: OK
  7123. 1446.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7124. 1446.74 s [vector] minimumBy: OK
  7125. 1446.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7126. 1446.74 s [vector] maximumOn: OK
  7127. 1446.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7128. 1446.74 s [vector] minimumOn: OK
  7129. 1446.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7130. 1446.74 s [vector] maxIndexBy: OK
  7131. 1446.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7132. 1446.74 s [vector] minIndexBy: OK
  7133. 1446.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7134. 1446.74 s [vector] ListFirstMaxIndexWins: OK
  7135. 1446.74 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7136. 1446.74 s [vector] FalseListFirstMaxIndexWins: OK
  7137. 1446.74 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7138. 1446.74 s [vector] []
  7139. 1446.75 s [vector] zip: OK
  7140. 1446.75 s [vector] +++ OK, passed 100 tests.
  7141. 1446.75 s [vector] zip3: OK
  7142. 1446.75 s [vector] +++ OK, passed 100 tests.
  7143. 1446.75 s [vector] unzip: OK
  7144. 1446.75 s [vector] +++ OK, passed 100 tests.
  7145. 1446.75 s [vector] unzip3: OK
  7146. 1446.75 s [vector] +++ OK, passed 100 tests.
  7147. 1446.75 s [vector] indexed: OK
  7148. 1446.75 s [vector] +++ OK, passed 100 tests.
  7149. 1446.75 s [vector] update: OK
  7150. 1446.75 s [vector] +++ OK, passed 100 tests.
  7151. 1446.77 s [vector] concat: OK (0.01s)
  7152. 1446.77 s [vector] +++ OK, passed 100 tests.
  7153. 1446.77 s [vector] mempty: OK
  7154. 1446.77 s [vector] +++ OK, passed 100 tests.
  7155. 1446.77 s [vector] mappend: OK
  7156. 1446.78 s [vector] +++ OK, passed 100 tests.
  7157. 1446.78 s [vector] mconcat: OK (0.01s)
  7158. 1446.78 s [vector] +++ OK, passed 100 tests.
  7159. 1446.78 s [vector] fmap: OK
  7160. 1446.78 s [vector] +++ OK, passed 100 tests.
  7161. 1446.79 s [vector] return: OK
  7162. 1446.79 s [vector] +++ OK, passed 100 tests.
  7163. 1446.79 s [vector] bind: OK (0.01s)
  7164. 1446.79 s [vector] +++ OK, passed 100 tests.
  7165. 1446.79 s [vector] mzip: OK
  7166. 1446.79 s [vector] +++ OK, passed 100 tests.
  7167. 1446.79 s [vector] munzip: OK
  7168. 1446.79 s [vector] +++ OK, passed 100 tests.
  7169. 1446.79 s [vector] applicative_pure: OK
  7170. 1446.79 s [vector] +++ OK, passed 100 tests.
  7171. 1446.81 s [vector] applicative_appl: OK
  7172. 1446.81 s [vector] +++ OK, passed 100 tests.
  7173. 1446.81 s [vector] alternative_empty: OK
  7174. 1446.81 s [vector] +++ OK, passed 100 tests.
  7175. 1446.83 s [vector] alternative_or: OK
  7176. 1446.83 s [vector] +++ OK, passed 100 tests.
  7177. 1446.85 s [vector] sequence: OK (0.03s)
  7178. 1446.85 s [vector] +++ OK, passed 100 tests.
  7179. 1446.85 s [vector] sequence_: OK
  7180. 1446.85 s [vector] +++ OK, passed 100 tests.
  7181. 1446.85 s [vector] glength: OK
  7182. 1446.85 s [vector] +++ OK, passed 100 tests.
  7183. 1446.85 s [vector] and: OK
  7184. 1446.86 s [vector] +++ OK, passed 100 tests.
  7185. 1446.86 s [vector] or: OK
  7186. 1446.86 s [vector] +++ OK, passed 100 tests.
  7187. 1446.86 s [vector] Int
  7188. 1446.86 s [vector] fromList.toList == id: OK
  7189. 1446.86 s [vector] +++ OK, passed 100 tests.
  7190. 1446.86 s [vector] toList.fromList == id: OK
  7191. 1446.86 s [vector] +++ OK, passed 100 tests.
  7192. 1446.86 s [vector] unstream.stream == id: OK
  7193. 1446.86 s [vector] +++ OK, passed 100 tests.
  7194. 1446.86 s [vector] stream.unstream == id: OK
  7195. 1446.86 s [vector] +++ OK, passed 100 tests.
  7196. 1446.86 s [vector] eq: OK
  7197. 1446.86 s [vector] +++ OK, passed 100 tests.
  7198. 1446.86 s [vector] length: OK
  7199. 1446.86 s [vector] +++ OK, passed 100 tests.
  7200. 1446.86 s [vector] null: OK
  7201. 1446.86 s [vector] +++ OK, passed 100 tests.
  7202. 1446.86 s [vector] index: OK
  7203. 1446.86 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7204. 1446.86 s [vector] safeIndex: OK
  7205. 1446.86 s [vector] +++ OK, passed 100 tests.
  7206. 1446.86 s [vector] head: OK
  7207. 1446.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7208. 1446.86 s [vector] last: OK
  7209. 1446.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7210. 1446.86 s [vector] unsafeIndex: OK
  7211. 1446.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7212. 1446.86 s [vector] unsafeHead: OK
  7213. 1446.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7214. 1446.86 s [vector] unsafeLast: OK
  7215. 1446.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7216. 1446.87 s [vector] slice: OK
  7217. 1446.87 s [vector] +++ OK, passed 100 tests.
  7218. 1446.87 s [vector] init: OK
  7219. 1446.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7220. 1446.87 s [vector] tail: OK
  7221. 1446.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7222. 1446.87 s [vector] take: OK
  7223. 1446.87 s [vector] +++ OK, passed 100 tests.
  7224. 1446.87 s [vector] drop: OK
  7225. 1446.87 s [vector] +++ OK, passed 100 tests.
  7226. 1446.87 s [vector] splitAt: OK
  7227. 1446.87 s [vector] +++ OK, passed 100 tests.
  7228. 1446.87 s [vector] empty: OK
  7229. 1446.87 s [vector] +++ OK, passed 100 tests.
  7230. 1446.87 s [vector] singleton: OK
  7231. 1446.87 s [vector] +++ OK, passed 100 tests.
  7232. 1446.87 s [vector] replicate: OK
  7233. 1446.87 s [vector] +++ OK, passed 100 tests.
  7234. 1446.87 s [vector] generate: OK
  7235. 1446.87 s [vector] +++ OK, passed 100 tests.
  7236. 1446.87 s [vector] iterateN: OK
  7237. 1446.87 s [vector] +++ OK, passed 100 tests.
  7238. 1446.93 s [vector] iterateNM: OK (0.03s)
  7239. 1446.93 s [vector] +++ OK, passed 100 tests.
  7240. 1446.95 s [vector] generateM: OK (0.02s)
  7241. 1446.95 s [vector] +++ OK, passed 100 tests.
  7242. 1446.95 s [vector] replicateM: OK (0.01s)
  7243. 1446.95 s [vector] +++ OK, passed 100 tests.
  7244. 1446.95 s [vector] create: OK
  7245. 1446.95 s [vector] +++ OK, passed 100 tests.
  7246. 1446.95 s [vector] createT: OK
  7247. 1446.95 s [vector] +++ OK, passed 100 tests.
  7248. 1446.95 s [vector] unfoldr: OK
  7249. 1446.95 s [vector] +++ OK, passed 100 tests.
  7250. 1446.95 s [vector] unfoldrN: OK
  7251. 1446.95 s [vector] +++ OK, passed 100 tests.
  7252. 1446.95 s [vector] unfoldrExactN: OK
  7253. 1446.95 s [vector] +++ OK, passed 100 tests.
  7254. 1446.96 s [vector] unfoldrM: OK
  7255. 1446.96 s [vector] +++ OK, passed 100 tests.
  7256. 1446.96 s [vector] unfoldrNM: OK
  7257. 1446.96 s [vector] +++ OK, passed 100 tests.
  7258. 1447.04 s [vector] unfoldrExactNM: OK (0.07s)
  7259. 1447.04 s [vector] +++ OK, passed 100 tests.
  7260. 1447.04 s [vector] constructN: OK
  7261. 1447.05 s [vector] +++ OK, passed 100 tests.
  7262. 1447.05 s [vector] constructrN: OK
  7263. 1447.05 s [vector] +++ OK, passed 100 tests.
  7264. 1447.05 s [vector] cons: OK
  7265. 1447.05 s [vector] +++ OK, passed 100 tests.
  7266. 1447.05 s [vector] snoc: OK
  7267. 1447.05 s [vector] +++ OK, passed 100 tests.
  7268. 1447.06 s [vector] append: OK
  7269. 1447.06 s [vector] +++ OK, passed 100 tests.
  7270. 1447.06 s [vector] concat: OK (0.01s)
  7271. 1447.06 s [vector] +++ OK, passed 100 tests.
  7272. 1447.07 s [vector] force: OK
  7273. 1447.07 s [vector] +++ OK, passed 100 tests.
  7274. 1447.07 s [vector] upd: OK
  7275. 1447.07 s [vector] +++ OK, passed 100 tests.
  7276. 1447.08 s [vector] accum: OK
  7277. 1447.08 s [vector] +++ OK, passed 100 tests.
  7278. 1447.08 s [vector] reverse: OK
  7279. 1447.08 s [vector] +++ OK, passed 100 tests.
  7280. 1447.09 s [vector] backpermute: OK
  7281. 1447.09 s [vector] +++ OK, passed 100 tests.
  7282. 1447.09 s [vector] map: OK
  7283. 1447.09 s [vector] +++ OK, passed 100 tests.
  7284. 1447.09 s [vector] imap: OK
  7285. 1447.09 s [vector] +++ OK, passed 100 tests.
  7286. 1447.09 s [vector] concatMap: OK
  7287. 1447.09 s [vector] +++ OK, passed 100 tests.
  7288. 1447.11 s [vector] mapM: OK
  7289. 1447.11 s [vector] +++ OK, passed 100 tests.
  7290. 1447.12 s [vector] mapM_: OK (0.02s)
  7291. 1447.12 s [vector] +++ OK, passed 100 tests.
  7292. 1447.12 s [vector] forM: OK
  7293. 1447.13 s [vector] +++ OK, passed 100 tests.
  7294. 1447.14 s [vector] forM_: OK (0.02s)
  7295. 1447.14 s [vector] +++ OK, passed 100 tests.
  7296. 1447.14 s [vector] imapM: OK
  7297. 1447.15 s [vector] +++ OK, passed 100 tests.
  7298. 1447.16 s [vector] imapM_: OK (0.02s)
  7299. 1447.17 s [vector] +++ OK, passed 100 tests.
  7300. 1447.17 s [vector] zipWith: OK
  7301. 1447.17 s [vector] +++ OK, passed 100 tests.
  7302. 1447.17 s [vector] zipWith3: OK
  7303. 1447.17 s [vector] +++ OK, passed 100 tests.
  7304. 1447.17 s [vector] izipWith: OK
  7305. 1447.17 s [vector] +++ OK, passed 100 tests.
  7306. 1447.17 s [vector] izipWith3: OK
  7307. 1447.17 s [vector] +++ OK, passed 100 tests.
  7308. 1447.19 s [vector] izipWithM: OK
  7309. 1447.19 s [vector] +++ OK, passed 100 tests.
  7310. 1447.19 s [vector] izipWithM_: OK (0.01s)
  7311. 1447.19 s [vector] +++ OK, passed 100 tests.
  7312. 1447.21 s [vector] zipWithM: OK
  7313. 1447.21 s [vector] +++ OK, passed 100 tests.
  7314. 1447.21 s [vector] zipWithM_: OK (0.02s)
  7315. 1447.21 s [vector] +++ OK, passed 100 tests.
  7316. 1447.21 s [vector] filter: OK
  7317. 1447.23 s [vector] +++ OK, passed 100 tests.
  7318. 1447.23 s [vector] ifilter: OK
  7319. 1447.23 s [vector] +++ OK, passed 100 tests.
  7320. 1447.24 s [vector] filterM: OK (0.03s)
  7321. 1447.24 s [vector] +++ OK, passed 100 tests.
  7322. 1447.25 s [vector] uniq: OK
  7323. 1447.25 s [vector] +++ OK, passed 100 tests.
  7324. 1447.25 s [vector] mapMaybe: OK
  7325. 1447.25 s [vector] +++ OK, passed 100 tests.
  7326. 1447.25 s [vector] imapMaybe: OK
  7327. 1447.25 s [vector] +++ OK, passed 100 tests.
  7328. 1447.25 s [vector] takeWhile: OK
  7329. 1447.25 s [vector] +++ OK, passed 100 tests.
  7330. 1447.25 s [vector] dropWhile: OK
  7331. 1447.25 s [vector] +++ OK, passed 100 tests.
  7332. 1447.25 s [vector] partition: OK
  7333. 1447.25 s [vector] +++ OK, passed 100 tests.
  7334. 1447.25 s [vector] partitionWith: OK
  7335. 1447.26 s [vector] +++ OK, passed 100 tests.
  7336. 1447.26 s [vector] span: OK
  7337. 1447.26 s [vector] +++ OK, passed 100 tests.
  7338. 1447.26 s [vector] break: OK
  7339. 1447.26 s [vector] +++ OK, passed 100 tests.
  7340. 1447.26 s [vector] spanR: OK
  7341. 1447.26 s [vector] +++ OK, passed 100 tests.
  7342. 1447.26 s [vector] breakR: OK
  7343. 1447.26 s [vector] +++ OK, passed 100 tests.
  7344. 1447.26 s [vector] groupBy: OK
  7345. 1447.26 s [vector] +++ OK, passed 100 tests.
  7346. 1447.26 s [vector] elem: OK
  7347. 1447.26 s [vector] +++ OK, passed 100 tests.
  7348. 1447.26 s [vector] notElem: OK
  7349. 1447.26 s [vector] +++ OK, passed 100 tests.
  7350. 1447.26 s [vector] find: OK
  7351. 1447.26 s [vector] +++ OK, passed 100 tests.
  7352. 1447.26 s [vector] findIndex: OK
  7353. 1447.27 s [vector] +++ OK, passed 100 tests.
  7354. 1447.27 s [vector] findIndexR: OK
  7355. 1447.27 s [vector] +++ OK, passed 100 tests.
  7356. 1447.27 s [vector] findIndices: OK
  7357. 1447.27 s [vector] +++ OK, passed 100 tests.
  7358. 1447.27 s [vector] elemIndex: OK
  7359. 1447.27 s [vector] +++ OK, passed 100 tests.
  7360. 1447.27 s [vector] elemIndices: OK
  7361. 1447.27 s [vector] +++ OK, passed 100 tests.
  7362. 1447.28 s [vector] foldl: OK
  7363. 1447.28 s [vector] +++ OK, passed 100 tests.
  7364. 1447.29 s [vector] foldl1: OK
  7365. 1447.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7366. 1447.29 s [vector] foldl': OK
  7367. 1447.29 s [vector] +++ OK, passed 100 tests.
  7368. 1447.29 s [vector] foldl1': OK
  7369. 1447.29 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7370. 1447.29 s [vector] foldr: OK
  7371. 1447.29 s [vector] +++ OK, passed 100 tests.
  7372. 1447.30 s [vector] foldr1: OK
  7373. 1447.30 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7374. 1447.31 s [vector] foldr': OK
  7375. 1447.31 s [vector] +++ OK, passed 100 tests.
  7376. 1447.31 s [vector] foldr1': OK
  7377. 1447.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7378. 1447.32 s [vector] ifoldl: OK
  7379. 1447.32 s [vector] +++ OK, passed 100 tests.
  7380. 1447.32 s [vector] ifoldl': OK
  7381. 1447.33 s [vector] +++ OK, passed 100 tests.
  7382. 1447.33 s [vector] ifoldr: OK
  7383. 1447.35 s [vector] +++ OK, passed 100 tests.
  7384. 1447.35 s [vector] ifoldr': OK
  7385. 1447.35 s [vector] +++ OK, passed 100 tests.
  7386. 1447.35 s [vector] ifoldM: OK
  7387. 1447.35 s [vector] +++ OK, passed 100 tests.
  7388. 1447.35 s [vector] ifoldM': OK
  7389. 1447.35 s [vector] +++ OK, passed 100 tests.
  7390. 1447.37 s [vector] ifoldM_: OK (0.02s)
  7391. 1447.37 s [vector] +++ OK, passed 100 tests.
  7392. 1447.38 s [vector] ifoldM'_: OK (0.03s)
  7393. 1447.38 s [vector] +++ OK, passed 100 tests.
  7394. 1447.38 s [vector] all: OK
  7395. 1447.38 s [vector] +++ OK, passed 100 tests.
  7396. 1447.38 s [vector] any: OK
  7397. 1447.38 s [vector] +++ OK, passed 100 tests.
  7398. 1447.38 s [vector] prescanl: OK
  7399. 1447.38 s [vector] +++ OK, passed 100 tests.
  7400. 1447.38 s [vector] prescanl': OK
  7401. 1447.39 s [vector] +++ OK, passed 100 tests.
  7402. 1447.39 s [vector] postscanl: OK
  7403. 1447.39 s [vector] +++ OK, passed 100 tests.
  7404. 1447.39 s [vector] postscanl': OK
  7405. 1447.39 s [vector] +++ OK, passed 100 tests.
  7406. 1447.40 s [vector] scanl: OK
  7407. 1447.40 s [vector] +++ OK, passed 100 tests.
  7408. 1447.40 s [vector] scanl': OK
  7409. 1447.40 s [vector] +++ OK, passed 100 tests.
  7410. 1447.41 s [vector] scanl1: OK
  7411. 1447.41 s [vector] +++ OK, passed 100 tests.
  7412. 1447.41 s [vector] scanl1': OK
  7413. 1447.41 s [vector] +++ OK, passed 100 tests.
  7414. 1447.41 s [vector] iscanl: OK
  7415. 1447.41 s [vector] +++ OK, passed 100 tests.
  7416. 1447.41 s [vector] iscanl': OK
  7417. 1447.41 s [vector] +++ OK, passed 100 tests.
  7418. 1447.42 s [vector] prescanr: OK
  7419. 1447.42 s [vector] +++ OK, passed 100 tests.
  7420. 1447.43 s [vector] prescanr': OK
  7421. 1447.43 s [vector] +++ OK, passed 100 tests.
  7422. 1447.43 s [vector] postscanr: OK
  7423. 1447.43 s [vector] +++ OK, passed 100 tests.
  7424. 1447.43 s [vector] postscanr': OK
  7425. 1447.43 s [vector] +++ OK, passed 100 tests.
  7426. 1447.43 s [vector] scanr: OK
  7427. 1447.44 s [vector] +++ OK, passed 100 tests.
  7428. 1447.44 s [vector] scanr': OK
  7429. 1447.45 s [vector] +++ OK, passed 100 tests.
  7430. 1447.45 s [vector] scanr1: OK
  7431. 1447.45 s [vector] +++ OK, passed 100 tests.
  7432. 1447.45 s [vector] scanr1': OK
  7433. 1447.45 s [vector] +++ OK, passed 100 tests.
  7434. 1447.45 s [vector] iscanr: OK
  7435. 1447.45 s [vector] +++ OK, passed 100 tests.
  7436. 1447.45 s [vector] iscanr': OK
  7437. 1447.45 s [vector] +++ OK, passed 100 tests.
  7438. 1447.45 s [vector] mut_read: OK
  7439. 1447.45 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7440. 1447.45 s [vector] mut_write: OK
  7441. 1447.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7442. 1447.45 s [vector] mut_modify: OK
  7443. 1447.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7444. 1447.46 s [vector] mut_generate: OK
  7445. 1447.47 s [vector] +++ OK, passed 100 tests.
  7446. 1447.47 s [vector] mut_generateM: OK
  7447. 1447.47 s [vector] +++ OK, passed 100 tests.
  7448. 1447.49 s [vector] mut_mapM_: OK (0.02s)
  7449. 1447.49 s [vector] +++ OK, passed 100 tests.
  7450. 1447.51 s [vector] mut_imapM_: OK (0.02s)
  7451. 1447.51 s [vector] +++ OK, passed 100 tests.
  7452. 1447.55 s [vector] mut_forM_: OK (0.03s)
  7453. 1447.55 s [vector] +++ OK, passed 100 tests.
  7454. 1447.55 s [vector] mut_iforM_: OK (0.02s)
  7455. 1447.56 s [vector] +++ OK, passed 100 tests.
  7456. 1447.56 s [vector] mut_foldr: OK
  7457. 1447.56 s [vector] +++ OK, passed 100 tests.
  7458. 1447.56 s [vector] mut_foldr': OK
  7459. 1447.56 s [vector] +++ OK, passed 100 tests.
  7460. 1447.57 s [vector] mut_foldl: OK
  7461. 1447.57 s [vector] +++ OK, passed 100 tests.
  7462. 1447.57 s [vector] mut_foldl': OK
  7463. 1447.57 s [vector] +++ OK, passed 100 tests.
  7464. 1447.57 s [vector] mut_ifoldr: OK
  7465. 1447.57 s [vector] +++ OK, passed 100 tests.
  7466. 1447.57 s [vector] mut_ifoldr': OK
  7467. 1447.57 s [vector] +++ OK, passed 100 tests.
  7468. 1447.58 s [vector] mut_ifoldl: OK
  7469. 1447.58 s [vector] +++ OK, passed 100 tests.
  7470. 1447.58 s [vector] mut_ifoldl': OK
  7471. 1447.59 s [vector] +++ OK, passed 100 tests.
  7472. 1447.59 s [vector] mut_foldM: OK
  7473. 1447.59 s [vector] +++ OK, passed 100 tests.
  7474. 1447.59 s [vector] mut_foldM': OK
  7475. 1447.60 s [vector] +++ OK, passed 100 tests.
  7476. 1447.60 s [vector] mut_foldrM: OK
  7477. 1447.60 s [vector] +++ OK, passed 100 tests.
  7478. 1447.60 s [vector] mut_foldrM': OK
  7479. 1447.61 s [vector] +++ OK, passed 100 tests.
  7480. 1447.61 s [vector] mut_ifoldM: OK
  7481. 1447.61 s [vector] +++ OK, passed 100 tests.
  7482. 1447.61 s [vector] mut_ifoldM': OK
  7483. 1447.62 s [vector] +++ OK, passed 100 tests.
  7484. 1447.62 s [vector] mut_ifoldrM: OK
  7485. 1447.62 s [vector] +++ OK, passed 100 tests.
  7486. 1447.62 s [vector] mut_ifoldrM': OK
  7487. 1447.62 s [vector] +++ OK, passed 100 tests.
  7488. 1447.62 s [vector] compare: OK
  7489. 1447.62 s [vector] +++ OK, passed 100 tests.
  7490. 1447.62 s [vector] maximum: OK
  7491. 1447.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7492. 1447.62 s [vector] minimum: OK
  7493. 1447.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7494. 1447.62 s [vector] minIndex: OK
  7495. 1447.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7496. 1447.62 s [vector] maxIndex: OK
  7497. 1447.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7498. 1447.62 s [vector] maximumBy: OK
  7499. 1447.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7500. 1447.62 s [vector] minimumBy: OK
  7501. 1447.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7502. 1447.62 s [vector] maximumOn: OK
  7503. 1447.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7504. 1447.62 s [vector] minimumOn: OK
  7505. 1447.62 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7506. 1447.62 s [vector] maxIndexBy: OK
  7507. 1447.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7508. 1447.62 s [vector] minIndexBy: OK
  7509. 1447.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7510. 1447.63 s [vector] ListFirstMaxIndexWins: OK
  7511. 1447.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7512. 1447.63 s [vector] FalseListFirstMaxIndexWins: OK
  7513. 1447.63 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7514. 1447.63 s [vector] []
  7515. 1447.63 s [vector] zip: OK
  7516. 1447.63 s [vector] +++ OK, passed 100 tests.
  7517. 1447.63 s [vector] zip3: OK
  7518. 1447.63 s [vector] +++ OK, passed 100 tests.
  7519. 1447.63 s [vector] unzip: OK
  7520. 1447.63 s [vector] +++ OK, passed 100 tests.
  7521. 1447.64 s [vector] unzip3: OK
  7522. 1447.64 s [vector] +++ OK, passed 100 tests.
  7523. 1447.64 s [vector] indexed: OK
  7524. 1447.64 s [vector] +++ OK, passed 100 tests.
  7525. 1447.64 s [vector] update: OK
  7526. 1447.65 s [vector] +++ OK, passed 100 tests.
  7527. 1447.66 s [vector] concat: OK (0.02s)
  7528. 1447.66 s [vector] +++ OK, passed 100 tests.
  7529. 1447.66 s [vector] mempty: OK
  7530. 1447.66 s [vector] +++ OK, passed 100 tests.
  7531. 1447.66 s [vector] mappend: OK
  7532. 1447.66 s [vector] +++ OK, passed 100 tests.
  7533. 1447.67 s [vector] mconcat: OK (0.01s)
  7534. 1447.67 s [vector] +++ OK, passed 100 tests.
  7535. 1447.67 s [vector] fmap: OK
  7536. 1447.67 s [vector] +++ OK, passed 100 tests.
  7537. 1447.69 s [vector] return: OK
  7538. 1447.69 s [vector] +++ OK, passed 100 tests.
  7539. 1447.69 s [vector] bind: OK (0.02s)
  7540. 1447.69 s [vector] +++ OK, passed 100 tests.
  7541. 1447.69 s [vector] mzip: OK
  7542. 1447.69 s [vector] +++ OK, passed 100 tests.
  7543. 1447.69 s [vector] munzip: OK
  7544. 1447.69 s [vector] +++ OK, passed 100 tests.
  7545. 1447.69 s [vector] applicative_pure: OK
  7546. 1447.69 s [vector] +++ OK, passed 100 tests.
  7547. 1447.74 s [vector] applicative_appl: OK (0.04s)
  7548. 1447.74 s [vector] +++ OK, passed 100 tests.
  7549. 1447.74 s [vector] alternative_empty: OK
  7550. 1447.74 s [vector] +++ OK, passed 100 tests.
  7551. 1447.75 s [vector] alternative_or: OK
  7552. 1447.75 s [vector] +++ OK, passed 100 tests.
  7553. 1447.79 s [vector] sequence: OK (0.03s)
  7554. 1447.79 s [vector] +++ OK, passed 100 tests.
  7555. 1447.79 s [vector] sequence_: OK (0.02s)
  7556. 1447.79 s [vector] +++ OK, passed 100 tests.
  7557. 1447.79 s [vector] glength: OK
  7558. 1447.79 s [vector] +++ OK, passed 100 tests.
  7559. 1447.79 s [vector] sum: OK
  7560. 1447.79 s [vector] +++ OK, passed 100 tests.
  7561. 1447.79 s [vector] product: OK
  7562. 1447.79 s [vector] +++ OK, passed 100 tests.
  7563. 1447.80 s [vector] enumFromN: OK
  7564. 1447.80 s [vector] +++ OK, passed 100 tests.
  7565. 1447.80 s [vector] enumFromThenN: OK
  7566. 1447.80 s [vector] +++ OK, passed 100 tests.
  7567. 1447.80 s [vector] enumFromTo: OK
  7568. 1447.80 s [vector] +++ OK, passed 100 tests.
  7569. 1447.80 s [vector] enumFromThenTo: OK
  7570. 1447.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7571. 1447.80 s [vector] unstream
  7572. 1447.81 s [vector] unstream == vunstream (exact): OK
  7573. 1447.81 s [vector] +++ OK, passed 100 tests.
  7574. 1447.81 s [vector] unstream == vunstream (unknown): OK
  7575. 1447.81 s [vector] +++ OK, passed 100 tests.
  7576. 1447.81 s [vector] unstreamR ~= vunstream (exact): OK
  7577. 1447.81 s [vector] +++ OK, passed 100 tests.
  7578. 1447.81 s [vector] unstreamR ~= vunstream (unknown): OK
  7579. 1447.81 s [vector] +++ OK, passed 100 tests.
  7580. 1447.81 s [vector] Tests.Vector.Unboxed
  7581. 1447.81 s [vector] ()
  7582. 1447.81 s [vector] fromList.toList == id: OK
  7583. 1447.81 s [vector] +++ OK, passed 100 tests.
  7584. 1447.81 s [vector] toList.fromList == id: OK
  7585. 1447.81 s [vector] +++ OK, passed 100 tests.
  7586. 1447.81 s [vector] unstream.stream == id: OK
  7587. 1447.81 s [vector] +++ OK, passed 100 tests.
  7588. 1447.81 s [vector] stream.unstream == id: OK
  7589. 1447.81 s [vector] +++ OK, passed 100 tests.
  7590. 1447.81 s [vector] eq: OK
  7591. 1447.81 s [vector] +++ OK, passed 100 tests.
  7592. 1447.81 s [vector] length: OK
  7593. 1447.81 s [vector] +++ OK, passed 100 tests.
  7594. 1447.83 s [vector] null: OK
  7595. 1447.83 s [vector] +++ OK, passed 100 tests.
  7596. 1447.83 s [vector] index: OK
  7597. 1447.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7598. 1447.83 s [vector] safeIndex: OK
  7599. 1447.85 s [vector] +++ OK, passed 100 tests.
  7600. 1447.85 s [vector] head: OK
  7601. 1447.85 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7602. 1447.85 s [vector] last: OK
  7603. 1447.87 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7604. 1447.87 s [vector] unsafeIndex: OK
  7605. 1447.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7606. 1447.87 s [vector] unsafeHead: OK
  7607. 1447.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7608. 1447.87 s [vector] unsafeLast: OK
  7609. 1447.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7610. 1447.87 s [vector] slice: OK
  7611. 1447.87 s [vector] +++ OK, passed 100 tests.
  7612. 1447.87 s [vector] init: OK
  7613. 1447.87 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7614. 1447.87 s [vector] tail: OK
  7615. 1447.88 s [vector] +++ OK, passed 100 tests; 26 discarded.
  7616. 1447.88 s [vector] take: OK
  7617. 1447.88 s [vector] +++ OK, passed 100 tests.
  7618. 1447.88 s [vector] drop: OK
  7619. 1447.88 s [vector] +++ OK, passed 100 tests.
  7620. 1447.88 s [vector] splitAt: OK
  7621. 1447.88 s [vector] +++ OK, passed 100 tests.
  7622. 1447.88 s [vector] empty: OK
  7623. 1447.88 s [vector] +++ OK, passed 100 tests.
  7624. 1447.88 s [vector] singleton: OK
  7625. 1447.88 s [vector] +++ OK, passed 100 tests.
  7626. 1447.88 s [vector] replicate: OK
  7627. 1447.88 s [vector] +++ OK, passed 100 tests.
  7628. 1447.88 s [vector] generate: OK
  7629. 1447.88 s [vector] +++ OK, passed 100 tests.
  7630. 1447.88 s [vector] iterateN: OK
  7631. 1447.88 s [vector] +++ OK, passed 100 tests.
  7632. 1447.88 s [vector] iterateNM: OK (0.02s)
  7633. 1447.88 s [vector] +++ OK, passed 100 tests.
  7634. 1447.88 s [vector] generateM: OK (0.02s)
  7635. 1447.88 s [vector] +++ OK, passed 100 tests.
  7636. 1447.88 s [vector] replicateM: OK (0.01s)
  7637. 1447.88 s [vector] +++ OK, passed 100 tests.
  7638. 1447.88 s [vector] create: OK
  7639. 1447.88 s [vector] +++ OK, passed 100 tests.
  7640. 1447.88 s [vector] createT: OK
  7641. 1447.88 s [vector] +++ OK, passed 100 tests.
  7642. 1447.88 s [vector] unfoldr: OK
  7643. 1447.88 s [vector] +++ OK, passed 100 tests.
  7644. 1447.88 s [vector] unfoldrN: OK
  7645. 1447.88 s [vector] +++ OK, passed 100 tests.
  7646. 1447.89 s [vector] unfoldrExactN: OK
  7647. 1447.89 s [vector] +++ OK, passed 100 tests.
  7648. 1447.89 s [vector] unfoldrM: OK
  7649. 1447.89 s [vector] +++ OK, passed 100 tests.
  7650. 1447.89 s [vector] unfoldrNM: OK
  7651. 1447.89 s [vector] +++ OK, passed 100 tests.
  7652. 1447.90 s [vector] unfoldrExactNM: OK (0.02s)
  7653. 1447.91 s [vector] +++ OK, passed 100 tests.
  7654. 1447.91 s [vector] constructN: OK
  7655. 1447.91 s [vector] +++ OK, passed 100 tests.
  7656. 1447.91 s [vector] constructrN: OK
  7657. 1447.91 s [vector] +++ OK, passed 100 tests.
  7658. 1447.91 s [vector] cons: OK
  7659. 1447.91 s [vector] +++ OK, passed 100 tests.
  7660. 1447.91 s [vector] snoc: OK
  7661. 1447.91 s [vector] +++ OK, passed 100 tests.
  7662. 1447.91 s [vector] append: OK
  7663. 1447.91 s [vector] +++ OK, passed 100 tests.
  7664. 1447.92 s [vector] concat: OK
  7665. 1447.92 s [vector] +++ OK, passed 100 tests.
  7666. 1447.92 s [vector] force: OK
  7667. 1447.92 s [vector] +++ OK, passed 100 tests.
  7668. 1447.92 s [vector] upd: OK
  7669. 1447.92 s [vector] +++ OK, passed 100 tests.
  7670. 1447.92 s [vector] accum: OK
  7671. 1447.92 s [vector] +++ OK, passed 100 tests.
  7672. 1447.92 s [vector] reverse: OK
  7673. 1447.92 s [vector] +++ OK, passed 100 tests.
  7674. 1447.92 s [vector] backpermute: OK
  7675. 1447.92 s [vector] +++ OK, passed 100 tests.
  7676. 1447.93 s [vector] map: OK
  7677. 1447.93 s [vector] +++ OK, passed 100 tests.
  7678. 1447.93 s [vector] imap: OK
  7679. 1447.93 s [vector] +++ OK, passed 100 tests.
  7680. 1447.93 s [vector] concatMap: OK
  7681. 1447.93 s [vector] +++ OK, passed 100 tests.
  7682. 1447.94 s [vector] mapM: OK
  7683. 1447.94 s [vector] +++ OK, passed 100 tests.
  7684. 1447.95 s [vector] mapM_: OK (0.01s)
  7685. 1447.95 s [vector] +++ OK, passed 100 tests.
  7686. 1447.95 s [vector] forM: OK
  7687. 1447.95 s [vector] +++ OK, passed 100 tests.
  7688. 1447.95 s [vector] forM_: OK
  7689. 1447.95 s [vector] +++ OK, passed 100 tests.
  7690. 1447.95 s [vector] imapM: OK
  7691. 1447.95 s [vector] +++ OK, passed 100 tests.
  7692. 1447.98 s [vector] imapM_: OK (0.03s)
  7693. 1447.98 s [vector] +++ OK, passed 100 tests.
  7694. 1447.98 s [vector] zipWith: OK
  7695. 1447.98 s [vector] +++ OK, passed 100 tests.
  7696. 1447.98 s [vector] zipWith3: OK
  7697. 1447.98 s [vector] +++ OK, passed 100 tests.
  7698. 1447.99 s [vector] izipWith: OK
  7699. 1447.99 s [vector] +++ OK, passed 100 tests.
  7700. 1447.99 s [vector] izipWith3: OK
  7701. 1447.99 s [vector] +++ OK, passed 100 tests.
  7702. 1447.99 s [vector] izipWithM: OK
  7703. 1447.99 s [vector] +++ OK, passed 100 tests.
  7704. 1448.00 s [vector] izipWithM_: OK
  7705. 1448.00 s [vector] +++ OK, passed 100 tests.
  7706. 1448.00 s [vector] zipWithM: OK
  7707. 1448.00 s [vector] +++ OK, passed 100 tests.
  7708. 1448.01 s [vector] zipWithM_: OK
  7709. 1448.01 s [vector] +++ OK, passed 100 tests.
  7710. 1448.01 s [vector] filter: OK
  7711. 1448.01 s [vector] +++ OK, passed 100 tests.
  7712. 1448.01 s [vector] ifilter: OK
  7713. 1448.03 s [vector] +++ OK, passed 100 tests.
  7714. 1448.03 s [vector] filterM: OK (0.02s)
  7715. 1448.04 s [vector] +++ OK, passed 100 tests.
  7716. 1448.04 s [vector] uniq: OK
  7717. 1448.04 s [vector] +++ OK, passed 100 tests.
  7718. 1448.05 s [vector] mapMaybe: OK (0.01s)
  7719. 1448.05 s [vector] +++ OK, passed 100 tests.
  7720. 1448.05 s [vector] imapMaybe: OK
  7721. 1448.05 s [vector] +++ OK, passed 100 tests.
  7722. 1448.05 s [vector] takeWhile: OK
  7723. 1448.05 s [vector] +++ OK, passed 100 tests.
  7724. 1448.05 s [vector] dropWhile: OK
  7725. 1448.05 s [vector] +++ OK, passed 100 tests.
  7726. 1448.05 s [vector] partition: OK
  7727. 1448.05 s [vector] +++ OK, passed 100 tests.
  7728. 1448.05 s [vector] partitionWith: OK
  7729. 1448.05 s [vector] +++ OK, passed 100 tests.
  7730. 1448.05 s [vector] span: OK
  7731. 1448.05 s [vector] +++ OK, passed 100 tests.
  7732. 1448.05 s [vector] break: OK
  7733. 1448.05 s [vector] +++ OK, passed 100 tests.
  7734. 1448.06 s [vector] spanR: OK
  7735. 1448.06 s [vector] +++ OK, passed 100 tests.
  7736. 1448.06 s [vector] breakR: OK
  7737. 1448.06 s [vector] +++ OK, passed 100 tests.
  7738. 1448.06 s [vector] groupBy: OK
  7739. 1448.06 s [vector] +++ OK, passed 100 tests.
  7740. 1448.06 s [vector] elem: OK
  7741. 1448.06 s [vector] +++ OK, passed 100 tests.
  7742. 1448.06 s [vector] notElem: OK
  7743. 1448.06 s [vector] +++ OK, passed 100 tests.
  7744. 1448.06 s [vector] find: OK
  7745. 1448.06 s [vector] +++ OK, passed 100 tests.
  7746. 1448.06 s [vector] findIndex: OK
  7747. 1448.06 s [vector] +++ OK, passed 100 tests.
  7748. 1448.07 s [vector] findIndexR: OK
  7749. 1448.07 s [vector] +++ OK, passed 100 tests.
  7750. 1448.07 s [vector] findIndices: OK
  7751. 1448.07 s [vector] +++ OK, passed 100 tests.
  7752. 1448.07 s [vector] elemIndex: OK
  7753. 1448.07 s [vector] +++ OK, passed 100 tests.
  7754. 1448.07 s [vector] elemIndices: OK
  7755. 1448.07 s [vector] +++ OK, passed 100 tests.
  7756. 1448.07 s [vector] foldl: OK
  7757. 1448.07 s [vector] +++ OK, passed 100 tests.
  7758. 1448.07 s [vector] foldl1: OK
  7759. 1448.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7760. 1448.07 s [vector] foldl': OK
  7761. 1448.07 s [vector] +++ OK, passed 100 tests.
  7762. 1448.07 s [vector] foldl1': OK
  7763. 1448.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7764. 1448.07 s [vector] foldr: OK
  7765. 1448.07 s [vector] +++ OK, passed 100 tests.
  7766. 1448.07 s [vector] foldr1: OK
  7767. 1448.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7768. 1448.08 s [vector] foldr': OK
  7769. 1448.08 s [vector] +++ OK, passed 100 tests.
  7770. 1448.08 s [vector] foldr1': OK
  7771. 1448.08 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7772. 1448.08 s [vector] ifoldl: OK
  7773. 1448.08 s [vector] +++ OK, passed 100 tests.
  7774. 1448.08 s [vector] ifoldl': OK
  7775. 1448.08 s [vector] +++ OK, passed 100 tests.
  7776. 1448.08 s [vector] ifoldr: OK
  7777. 1448.08 s [vector] +++ OK, passed 100 tests.
  7778. 1448.08 s [vector] ifoldr': OK
  7779. 1448.08 s [vector] +++ OK, passed 100 tests.
  7780. 1448.08 s [vector] ifoldM: OK
  7781. 1448.08 s [vector] +++ OK, passed 100 tests.
  7782. 1448.09 s [vector] ifoldM': OK
  7783. 1448.09 s [vector] +++ OK, passed 100 tests.
  7784. 1448.11 s [vector] ifoldM_: OK (0.02s)
  7785. 1448.11 s [vector] +++ OK, passed 100 tests.
  7786. 1448.12 s [vector] ifoldM'_: OK (0.01s)
  7787. 1448.12 s [vector] +++ OK, passed 100 tests.
  7788. 1448.12 s [vector] all: OK
  7789. 1448.12 s [vector] +++ OK, passed 100 tests.
  7790. 1448.12 s [vector] any: OK
  7791. 1448.12 s [vector] +++ OK, passed 100 tests.
  7792. 1448.12 s [vector] prescanl: OK
  7793. 1448.12 s [vector] +++ OK, passed 100 tests.
  7794. 1448.12 s [vector] prescanl': OK
  7795. 1448.12 s [vector] +++ OK, passed 100 tests.
  7796. 1448.12 s [vector] postscanl: OK
  7797. 1448.12 s [vector] +++ OK, passed 100 tests.
  7798. 1448.12 s [vector] postscanl': OK
  7799. 1448.12 s [vector] +++ OK, passed 100 tests.
  7800. 1448.13 s [vector] scanl: OK
  7801. 1448.13 s [vector] +++ OK, passed 100 tests.
  7802. 1448.13 s [vector] scanl': OK
  7803. 1448.13 s [vector] +++ OK, passed 100 tests.
  7804. 1448.13 s [vector] scanl1: OK
  7805. 1448.13 s [vector] +++ OK, passed 100 tests.
  7806. 1448.13 s [vector] scanl1': OK
  7807. 1448.13 s [vector] +++ OK, passed 100 tests.
  7808. 1448.13 s [vector] iscanl: OK
  7809. 1448.13 s [vector] +++ OK, passed 100 tests.
  7810. 1448.13 s [vector] iscanl': OK
  7811. 1448.13 s [vector] +++ OK, passed 100 tests.
  7812. 1448.13 s [vector] prescanr: OK
  7813. 1448.13 s [vector] +++ OK, passed 100 tests.
  7814. 1448.14 s [vector] prescanr': OK
  7815. 1448.14 s [vector] +++ OK, passed 100 tests.
  7816. 1448.14 s [vector] postscanr: OK
  7817. 1448.14 s [vector] +++ OK, passed 100 tests.
  7818. 1448.14 s [vector] postscanr': OK
  7819. 1448.14 s [vector] +++ OK, passed 100 tests.
  7820. 1448.14 s [vector] scanr: OK
  7821. 1448.14 s [vector] +++ OK, passed 100 tests.
  7822. 1448.14 s [vector] scanr': OK
  7823. 1448.15 s [vector] +++ OK, passed 100 tests.
  7824. 1448.15 s [vector] scanr1: OK
  7825. 1448.15 s [vector] +++ OK, passed 100 tests.
  7826. 1448.15 s [vector] scanr1': OK
  7827. 1448.15 s [vector] +++ OK, passed 100 tests.
  7828. 1448.15 s [vector] iscanr: OK
  7829. 1448.15 s [vector] +++ OK, passed 100 tests.
  7830. 1448.15 s [vector] iscanr': OK
  7831. 1448.15 s [vector] +++ OK, passed 100 tests.
  7832. 1448.15 s [vector] mut_read: OK
  7833. 1448.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7834. 1448.15 s [vector] mut_write: OK
  7835. 1448.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7836. 1448.15 s [vector] mut_modify: OK
  7837. 1448.16 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7838. 1448.16 s [vector] mut_generate: OK
  7839. 1448.16 s [vector] +++ OK, passed 100 tests.
  7840. 1448.16 s [vector] mut_generateM: OK
  7841. 1448.17 s [vector] +++ OK, passed 100 tests.
  7842. 1448.19 s [vector] mut_mapM_: OK (0.01s)
  7843. 1448.19 s [vector] +++ OK, passed 100 tests.
  7844. 1448.19 s [vector] mut_imapM_: OK (0.01s)
  7845. 1448.19 s [vector] +++ OK, passed 100 tests.
  7846. 1448.21 s [vector] mut_forM_: OK (0.02s)
  7847. 1448.21 s [vector] +++ OK, passed 100 tests.
  7848. 1448.21 s [vector] mut_iforM_: OK (0.01s)
  7849. 1448.21 s [vector] +++ OK, passed 100 tests.
  7850. 1448.22 s [vector] mut_foldr: OK
  7851. 1448.22 s [vector] +++ OK, passed 100 tests.
  7852. 1448.22 s [vector] mut_foldr': OK
  7853. 1448.22 s [vector] +++ OK, passed 100 tests.
  7854. 1448.22 s [vector] mut_foldl: OK
  7855. 1448.22 s [vector] +++ OK, passed 100 tests.
  7856. 1448.22 s [vector] mut_foldl': OK
  7857. 1448.22 s [vector] +++ OK, passed 100 tests.
  7858. 1448.22 s [vector] mut_ifoldr: OK
  7859. 1448.22 s [vector] +++ OK, passed 100 tests.
  7860. 1448.22 s [vector] mut_ifoldr': OK
  7861. 1448.22 s [vector] +++ OK, passed 100 tests.
  7862. 1448.22 s [vector] mut_ifoldl: OK
  7863. 1448.22 s [vector] +++ OK, passed 100 tests.
  7864. 1448.22 s [vector] mut_ifoldl': OK
  7865. 1448.22 s [vector] +++ OK, passed 100 tests.
  7866. 1448.22 s [vector] mut_foldM: OK
  7867. 1448.22 s [vector] +++ OK, passed 100 tests.
  7868. 1448.22 s [vector] mut_foldM': OK
  7869. 1448.22 s [vector] +++ OK, passed 100 tests.
  7870. 1448.23 s [vector] mut_foldrM: OK
  7871. 1448.23 s [vector] +++ OK, passed 100 tests.
  7872. 1448.23 s [vector] mut_foldrM': OK
  7873. 1448.23 s [vector] +++ OK, passed 100 tests.
  7874. 1448.23 s [vector] mut_ifoldM: OK
  7875. 1448.23 s [vector] +++ OK, passed 100 tests.
  7876. 1448.23 s [vector] mut_ifoldM': OK
  7877. 1448.24 s [vector] +++ OK, passed 100 tests.
  7878. 1448.24 s [vector] mut_ifoldrM: OK
  7879. 1448.24 s [vector] +++ OK, passed 100 tests.
  7880. 1448.24 s [vector] mut_ifoldrM': OK
  7881. 1448.24 s [vector] +++ OK, passed 100 tests.
  7882. 1448.24 s [vector] compare: OK
  7883. 1448.24 s [vector] +++ OK, passed 100 tests.
  7884. 1448.24 s [vector] maximum: OK
  7885. 1448.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7886. 1448.24 s [vector] minimum: OK
  7887. 1448.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7888. 1448.24 s [vector] minIndex: OK
  7889. 1448.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7890. 1448.25 s [vector] maxIndex: OK
  7891. 1448.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7892. 1448.25 s [vector] maximumBy: OK
  7893. 1448.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7894. 1448.25 s [vector] minimumBy: OK
  7895. 1448.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7896. 1448.25 s [vector] maximumOn: OK
  7897. 1448.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7898. 1448.25 s [vector] minimumOn: OK
  7899. 1448.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7900. 1448.25 s [vector] maxIndexBy: OK
  7901. 1448.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7902. 1448.25 s [vector] minIndexBy: OK
  7903. 1448.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7904. 1448.25 s [vector] ListFirstMaxIndexWins: OK
  7905. 1448.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7906. 1448.26 s [vector] FalseListFirstMaxIndexWins: OK
  7907. 1448.26 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7908. 1448.26 s [vector] []
  7909. 1448.26 s [vector] zip: OK
  7910. 1448.26 s [vector] +++ OK, passed 100 tests.
  7911. 1448.26 s [vector] zip3: OK
  7912. 1448.26 s [vector] +++ OK, passed 100 tests.
  7913. 1448.26 s [vector] unzip: OK
  7914. 1448.26 s [vector] +++ OK, passed 100 tests.
  7915. 1448.26 s [vector] unzip3: OK
  7916. 1448.26 s [vector] +++ OK, passed 100 tests.
  7917. 1448.26 s [vector] indexed: OK
  7918. 1448.27 s [vector] +++ OK, passed 100 tests.
  7919. 1448.27 s [vector] update: OK
  7920. 1448.27 s [vector] +++ OK, passed 100 tests.
  7921. 1448.27 s [vector] mempty: OK
  7922. 1448.27 s [vector] +++ OK, passed 100 tests.
  7923. 1448.27 s [vector] mappend: OK
  7924. 1448.28 s [vector] +++ OK, passed 100 tests.
  7925. 1448.28 s [vector] mconcat: OK
  7926. 1448.29 s [vector] +++ OK, passed 100 tests.
  7927. 1448.29 s [vector] glength: OK
  7928. 1448.29 s [vector] +++ OK, passed 100 tests.
  7929. 1448.29 s [vector] (Bool)
  7930. 1448.29 s [vector] fromList.toList == id: OK
  7931. 1448.29 s [vector] +++ OK, passed 100 tests.
  7932. 1448.29 s [vector] toList.fromList == id: OK
  7933. 1448.29 s [vector] +++ OK, passed 100 tests.
  7934. 1448.29 s [vector] unstream.stream == id: OK
  7935. 1448.29 s [vector] +++ OK, passed 100 tests.
  7936. 1448.29 s [vector] stream.unstream == id: OK
  7937. 1448.29 s [vector] +++ OK, passed 100 tests.
  7938. 1448.29 s [vector] eq: OK
  7939. 1448.29 s [vector] +++ OK, passed 100 tests.
  7940. 1448.29 s [vector] length: OK
  7941. 1448.29 s [vector] +++ OK, passed 100 tests.
  7942. 1448.29 s [vector] null: OK
  7943. 1448.29 s [vector] +++ OK, passed 100 tests.
  7944. 1448.29 s [vector] index: OK
  7945. 1448.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7946. 1448.29 s [vector] safeIndex: OK
  7947. 1448.29 s [vector] +++ OK, passed 100 tests.
  7948. 1448.29 s [vector] head: OK
  7949. 1448.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7950. 1448.29 s [vector] last: OK
  7951. 1448.29 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7952. 1448.29 s [vector] unsafeIndex: OK
  7953. 1448.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7954. 1448.29 s [vector] unsafeHead: OK
  7955. 1448.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7956. 1448.29 s [vector] unsafeLast: OK
  7957. 1448.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7958. 1448.29 s [vector] slice: OK
  7959. 1448.30 s [vector] +++ OK, passed 100 tests.
  7960. 1448.30 s [vector] init: OK
  7961. 1448.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7962. 1448.30 s [vector] tail: OK
  7963. 1448.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7964. 1448.30 s [vector] take: OK
  7965. 1448.30 s [vector] +++ OK, passed 100 tests.
  7966. 1448.30 s [vector] drop: OK
  7967. 1448.30 s [vector] +++ OK, passed 100 tests.
  7968. 1448.31 s [vector] splitAt: OK
  7969. 1448.31 s [vector] +++ OK, passed 100 tests.
  7970. 1448.31 s [vector] empty: OK
  7971. 1448.31 s [vector] +++ OK, passed 100 tests.
  7972. 1448.31 s [vector] singleton: OK
  7973. 1448.31 s [vector] +++ OK, passed 100 tests.
  7974. 1448.31 s [vector] replicate: OK
  7975. 1448.31 s [vector] +++ OK, passed 100 tests.
  7976. 1448.31 s [vector] generate: OK
  7977. 1448.31 s [vector] +++ OK, passed 100 tests.
  7978. 1448.31 s [vector] iterateN: OK
  7979. 1448.31 s [vector] +++ OK, passed 100 tests.
  7980. 1448.37 s [vector] iterateNM: OK (0.05s)
  7981. 1448.37 s [vector] +++ OK, passed 100 tests.
  7982. 1448.41 s [vector] generateM: OK (0.05s)
  7983. 1448.41 s [vector] +++ OK, passed 100 tests.
  7984. 1448.42 s [vector] replicateM: OK (0.01s)
  7985. 1448.42 s [vector] +++ OK, passed 100 tests.
  7986. 1448.42 s [vector] create: OK
  7987. 1448.42 s [vector] +++ OK, passed 100 tests.
  7988. 1448.42 s [vector] createT: OK
  7989. 1448.42 s [vector] +++ OK, passed 100 tests.
  7990. 1448.42 s [vector] unfoldr: OK
  7991. 1448.42 s [vector] +++ OK, passed 100 tests.
  7992. 1448.42 s [vector] unfoldrN: OK
  7993. 1448.42 s [vector] +++ OK, passed 100 tests.
  7994. 1448.42 s [vector] unfoldrExactN: OK
  7995. 1448.42 s [vector] +++ OK, passed 100 tests.
  7996. 1448.42 s [vector] unfoldrM: OK
  7997. 1448.43 s [vector] +++ OK, passed 100 tests.
  7998. 1448.43 s [vector] unfoldrNM: OK
  7999. 1448.43 s [vector] +++ OK, passed 100 tests.
  8000. 1448.46 s [vector] unfoldrExactNM: OK (0.03s)
  8001. 1448.46 s [vector] +++ OK, passed 100 tests.
  8002. 1448.46 s [vector] constructN: OK
  8003. 1448.46 s [vector] +++ OK, passed 100 tests.
  8004. 1448.46 s [vector] constructrN: OK
  8005. 1448.46 s [vector] +++ OK, passed 100 tests.
  8006. 1448.46 s [vector] cons: OK
  8007. 1448.47 s [vector] +++ OK, passed 100 tests.
  8008. 1448.47 s [vector] snoc: OK
  8009. 1448.47 s [vector] +++ OK, passed 100 tests.
  8010. 1448.47 s [vector] append: OK
  8011. 1448.47 s [vector] +++ OK, passed 100 tests.
  8012. 1448.49 s [vector] concat: OK (0.02s)
  8013. 1448.49 s [vector] +++ OK, passed 100 tests.
  8014. 1448.49 s [vector] force: OK
  8015. 1448.49 s [vector] +++ OK, passed 100 tests.
  8016. 1448.49 s [vector] upd: OK
  8017. 1448.49 s [vector] +++ OK, passed 100 tests.
  8018. 1448.50 s [vector] accum: OK
  8019. 1448.50 s [vector] +++ OK, passed 100 tests.
  8020. 1448.50 s [vector] reverse: OK
  8021. 1448.50 s [vector] +++ OK, passed 100 tests.
  8022. 1448.50 s [vector] backpermute: OK
  8023. 1448.50 s [vector] +++ OK, passed 100 tests.
  8024. 1448.50 s [vector] map: OK
  8025. 1448.50 s [vector] +++ OK, passed 100 tests.
  8026. 1448.51 s [vector] imap: OK
  8027. 1448.51 s [vector] +++ OK, passed 100 tests.
  8028. 1448.51 s [vector] concatMap: OK
  8029. 1448.51 s [vector] +++ OK, passed 100 tests.
  8030. 1448.51 s [vector] mapM: OK
  8031. 1448.53 s [vector] +++ OK, passed 100 tests.
  8032. 1448.54 s [vector] mapM_: OK (0.02s)
  8033. 1448.54 s [vector] +++ OK, passed 100 tests.
  8034. 1448.54 s [vector] forM: OK
  8035. 1448.54 s [vector] +++ OK, passed 100 tests.
  8036. 1448.56 s [vector] forM_: OK (0.02s)
  8037. 1448.56 s [vector] +++ OK, passed 100 tests.
  8038. 1448.56 s [vector] imapM: OK
  8039. 1448.57 s [vector] +++ OK, passed 100 tests.
  8040. 1448.59 s [vector] imapM_: OK (0.02s)
  8041. 1448.59 s [vector] +++ OK, passed 100 tests.
  8042. 1448.59 s [vector] zipWith: OK
  8043. 1448.59 s [vector] +++ OK, passed 100 tests.
  8044. 1448.59 s [vector] zipWith3: OK
  8045. 1448.59 s [vector] +++ OK, passed 100 tests.
  8046. 1448.59 s [vector] izipWith: OK
  8047. 1448.59 s [vector] +++ OK, passed 100 tests.
  8048. 1448.60 s [vector] izipWith3: OK
  8049. 1448.60 s [vector] +++ OK, passed 100 tests.
  8050. 1448.60 s [vector] izipWithM: OK
  8051. 1448.60 s [vector] +++ OK, passed 100 tests.
  8052. 1448.62 s [vector] izipWithM_: OK (0.02s)
  8053. 1448.62 s [vector] +++ OK, passed 100 tests.
  8054. 1448.62 s [vector] zipWithM: OK
  8055. 1448.62 s [vector] +++ OK, passed 100 tests.
  8056. 1448.63 s [vector] zipWithM_: OK (0.01s)
  8057. 1448.63 s [vector] +++ OK, passed 100 tests.
  8058. 1448.63 s [vector] filter: OK
  8059. 1448.63 s [vector] +++ OK, passed 100 tests.
  8060. 1448.65 s [vector] ifilter: OK
  8061. 1448.65 s [vector] +++ OK, passed 100 tests.
  8062. 1448.67 s [vector] filterM: OK (0.02s)
  8063. 1448.67 s [vector] +++ OK, passed 100 tests.
  8064. 1448.68 s [vector] uniq: OK (0.01s)
  8065. 1448.68 s [vector] +++ OK, passed 100 tests.
  8066. 1448.68 s [vector] mapMaybe: OK
  8067. 1448.68 s [vector] +++ OK, passed 100 tests.
  8068. 1448.68 s [vector] imapMaybe: OK
  8069. 1448.68 s [vector] +++ OK, passed 100 tests.
  8070. 1448.68 s [vector] takeWhile: OK
  8071. 1448.68 s [vector] +++ OK, passed 100 tests.
  8072. 1448.68 s [vector] dropWhile: OK
  8073. 1448.68 s [vector] +++ OK, passed 100 tests.
  8074. 1448.68 s [vector] partition: OK
  8075. 1448.68 s [vector] +++ OK, passed 100 tests.
  8076. 1448.68 s [vector] partitionWith: OK
  8077. 1448.68 s [vector] +++ OK, passed 100 tests.
  8078. 1448.68 s [vector] span: OK
  8079. 1448.68 s [vector] +++ OK, passed 100 tests.
  8080. 1448.68 s [vector] break: OK
  8081. 1448.68 s [vector] +++ OK, passed 100 tests.
  8082. 1448.68 s [vector] spanR: OK
  8083. 1448.69 s [vector] +++ OK, passed 100 tests.
  8084. 1448.69 s [vector] breakR: OK
  8085. 1448.69 s [vector] +++ OK, passed 100 tests.
  8086. 1448.69 s [vector] groupBy: OK
  8087. 1448.69 s [vector] +++ OK, passed 100 tests.
  8088. 1448.69 s [vector] elem: OK
  8089. 1448.69 s [vector] +++ OK, passed 100 tests.
  8090. 1448.69 s [vector] notElem: OK
  8091. 1448.69 s [vector] +++ OK, passed 100 tests.
  8092. 1448.69 s [vector] find: OK
  8093. 1448.69 s [vector] +++ OK, passed 100 tests.
  8094. 1448.69 s [vector] findIndex: OK
  8095. 1448.69 s [vector] +++ OK, passed 100 tests.
  8096. 1448.69 s [vector] findIndexR: OK
  8097. 1448.69 s [vector] +++ OK, passed 100 tests.
  8098. 1448.69 s [vector] findIndices: OK
  8099. 1448.69 s [vector] +++ OK, passed 100 tests.
  8100. 1448.69 s [vector] elemIndex: OK
  8101. 1448.69 s [vector] +++ OK, passed 100 tests.
  8102. 1448.70 s [vector] elemIndices: OK
  8103. 1448.70 s [vector] +++ OK, passed 100 tests.
  8104. 1448.70 s [vector] foldl: OK
  8105. 1448.70 s [vector] +++ OK, passed 100 tests.
  8106. 1448.70 s [vector] foldl1: OK
  8107. 1448.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8108. 1448.70 s [vector] foldl': OK
  8109. 1448.70 s [vector] +++ OK, passed 100 tests.
  8110. 1448.70 s [vector] foldl1': OK
  8111. 1448.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8112. 1448.70 s [vector] foldr: OK
  8113. 1448.70 s [vector] +++ OK, passed 100 tests.
  8114. 1448.70 s [vector] foldr1: OK
  8115. 1448.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8116. 1448.71 s [vector] foldr': OK
  8117. 1448.71 s [vector] +++ OK, passed 100 tests.
  8118. 1448.71 s [vector] foldr1': OK
  8119. 1448.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8120. 1448.71 s [vector] ifoldl: OK
  8121. 1448.71 s [vector] +++ OK, passed 100 tests.
  8122. 1448.71 s [vector] ifoldl': OK
  8123. 1448.72 s [vector] +++ OK, passed 100 tests.
  8124. 1448.72 s [vector] ifoldr: OK
  8125. 1448.72 s [vector] +++ OK, passed 100 tests.
  8126. 1448.72 s [vector] ifoldr': OK
  8127. 1448.72 s [vector] +++ OK, passed 100 tests.
  8128. 1448.72 s [vector] ifoldM: OK
  8129. 1448.72 s [vector] +++ OK, passed 100 tests.
  8130. 1448.72 s [vector] ifoldM': OK
  8131. 1448.73 s [vector] +++ OK, passed 100 tests.
  8132. 1448.75 s [vector] ifoldM_: OK (0.02s)
  8133. 1448.75 s [vector] +++ OK, passed 100 tests.
  8134. 1448.76 s [vector] ifoldM'_: OK (0.02s)
  8135. 1448.76 s [vector] +++ OK, passed 100 tests.
  8136. 1448.76 s [vector] all: OK
  8137. 1448.76 s [vector] +++ OK, passed 100 tests.
  8138. 1448.76 s [vector] any: OK
  8139. 1448.76 s [vector] +++ OK, passed 100 tests.
  8140. 1448.76 s [vector] prescanl: OK
  8141. 1448.77 s [vector] +++ OK, passed 100 tests.
  8142. 1448.77 s [vector] prescanl': OK
  8143. 1448.77 s [vector] +++ OK, passed 100 tests.
  8144. 1448.77 s [vector] postscanl: OK
  8145. 1448.77 s [vector] +++ OK, passed 100 tests.
  8146. 1448.78 s [vector] postscanl': OK
  8147. 1448.78 s [vector] +++ OK, passed 100 tests.
  8148. 1448.78 s [vector] scanl: OK
  8149. 1448.78 s [vector] +++ OK, passed 100 tests.
  8150. 1448.78 s [vector] scanl': OK
  8151. 1448.79 s [vector] +++ OK, passed 100 tests.
  8152. 1448.79 s [vector] scanl1: OK
  8153. 1448.79 s [vector] +++ OK, passed 100 tests.
  8154. 1448.79 s [vector] scanl1': OK
  8155. 1448.80 s [vector] +++ OK, passed 100 tests.
  8156. 1448.80 s [vector] iscanl: OK
  8157. 1448.80 s [vector] +++ OK, passed 100 tests.
  8158. 1448.80 s [vector] iscanl': OK
  8159. 1448.80 s [vector] +++ OK, passed 100 tests.
  8160. 1448.80 s [vector] prescanr: OK
  8161. 1448.80 s [vector] +++ OK, passed 100 tests.
  8162. 1448.81 s [vector] prescanr': OK
  8163. 1448.81 s [vector] +++ OK, passed 100 tests.
  8164. 1448.81 s [vector] postscanr: OK
  8165. 1448.81 s [vector] +++ OK, passed 100 tests.
  8166. 1448.82 s [vector] postscanr': OK
  8167. 1448.82 s [vector] +++ OK, passed 100 tests.
  8168. 1448.82 s [vector] scanr: OK
  8169. 1448.82 s [vector] +++ OK, passed 100 tests.
  8170. 1448.83 s [vector] scanr': OK
  8171. 1448.83 s [vector] +++ OK, passed 100 tests.
  8172. 1448.83 s [vector] scanr1: OK
  8173. 1448.83 s [vector] +++ OK, passed 100 tests.
  8174. 1448.84 s [vector] scanr1': OK
  8175. 1448.84 s [vector] +++ OK, passed 100 tests.
  8176. 1448.84 s [vector] iscanr: OK
  8177. 1448.84 s [vector] +++ OK, passed 100 tests.
  8178. 1448.84 s [vector] iscanr': OK
  8179. 1448.84 s [vector] +++ OK, passed 100 tests.
  8180. 1448.84 s [vector] mut_read: OK
  8181. 1448.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8182. 1448.84 s [vector] mut_write: OK
  8183. 1448.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8184. 1448.85 s [vector] mut_modify: OK
  8185. 1448.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8186. 1448.85 s [vector] mut_generate: OK
  8187. 1448.85 s [vector] +++ OK, passed 100 tests.
  8188. 1448.86 s [vector] mut_generateM: OK
  8189. 1448.86 s [vector] +++ OK, passed 100 tests.
  8190. 1448.88 s [vector] mut_mapM_: OK (0.01s)
  8191. 1448.88 s [vector] +++ OK, passed 100 tests.
  8192. 1448.89 s [vector] mut_imapM_: OK (0.01s)
  8193. 1448.89 s [vector] +++ OK, passed 100 tests.
  8194. 1448.91 s [vector] mut_forM_: OK (0.02s)
  8195. 1448.91 s [vector] +++ OK, passed 100 tests.
  8196. 1448.93 s [vector] mut_iforM_: OK (0.02s)
  8197. 1448.93 s [vector] +++ OK, passed 100 tests.
  8198. 1448.93 s [vector] mut_foldr: OK
  8199. 1448.93 s [vector] +++ OK, passed 100 tests.
  8200. 1448.93 s [vector] mut_foldr': OK
  8201. 1448.93 s [vector] +++ OK, passed 100 tests.
  8202. 1448.93 s [vector] mut_foldl: OK
  8203. 1448.93 s [vector] +++ OK, passed 100 tests.
  8204. 1448.94 s [vector] mut_foldl': OK
  8205. 1448.94 s [vector] +++ OK, passed 100 tests.
  8206. 1448.94 s [vector] mut_ifoldr: OK
  8207. 1448.94 s [vector] +++ OK, passed 100 tests.
  8208. 1448.95 s [vector] mut_ifoldr': OK
  8209. 1448.95 s [vector] +++ OK, passed 100 tests.
  8210. 1448.95 s [vector] mut_ifoldl: OK
  8211. 1448.95 s [vector] +++ OK, passed 100 tests.
  8212. 1448.95 s [vector] mut_ifoldl': OK
  8213. 1448.95 s [vector] +++ OK, passed 100 tests.
  8214. 1448.95 s [vector] mut_foldM: OK
  8215. 1448.95 s [vector] +++ OK, passed 100 tests.
  8216. 1448.95 s [vector] mut_foldM': OK
  8217. 1448.96 s [vector] +++ OK, passed 100 tests.
  8218. 1448.96 s [vector] mut_foldrM: OK
  8219. 1448.96 s [vector] +++ OK, passed 100 tests.
  8220. 1448.96 s [vector] mut_foldrM': OK
  8221. 1448.96 s [vector] +++ OK, passed 100 tests.
  8222. 1448.96 s [vector] mut_ifoldM: OK
  8223. 1448.96 s [vector] +++ OK, passed 100 tests.
  8224. 1448.97 s [vector] mut_ifoldM': OK
  8225. 1448.97 s [vector] +++ OK, passed 100 tests.
  8226. 1448.97 s [vector] mut_ifoldrM: OK
  8227. 1448.97 s [vector] +++ OK, passed 100 tests.
  8228. 1448.97 s [vector] mut_ifoldrM': OK
  8229. 1448.97 s [vector] +++ OK, passed 100 tests.
  8230. 1448.98 s [vector] compare: OK
  8231. 1448.98 s [vector] +++ OK, passed 100 tests.
  8232. 1448.98 s [vector] maximum: OK
  8233. 1448.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8234. 1448.98 s [vector] minimum: OK
  8235. 1448.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8236. 1448.98 s [vector] minIndex: OK
  8237. 1448.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8238. 1448.98 s [vector] maxIndex: OK
  8239. 1448.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8240. 1448.98 s [vector] maximumBy: OK
  8241. 1448.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8242. 1448.98 s [vector] minimumBy: OK
  8243. 1448.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8244. 1448.98 s [vector] maximumOn: OK
  8245. 1448.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8246. 1448.98 s [vector] minimumOn: OK
  8247. 1448.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8248. 1448.99 s [vector] maxIndexBy: OK
  8249. 1448.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8250. 1448.99 s [vector] minIndexBy: OK
  8251. 1448.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8252. 1448.99 s [vector] ListFirstMaxIndexWins: OK
  8253. 1448.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8254. 1448.99 s [vector] FalseListFirstMaxIndexWins: OK
  8255. 1448.99 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8256. 1448.99 s [vector] []
  8257. 1448.99 s [vector] zip: OK
  8258. 1448.99 s [vector] +++ OK, passed 100 tests.
  8259. 1449.00 s [vector] zip3: OK
  8260. 1449.00 s [vector] +++ OK, passed 100 tests.
  8261. 1449.00 s [vector] unzip: OK
  8262. 1449.00 s [vector] +++ OK, passed 100 tests.
  8263. 1449.00 s [vector] unzip3: OK
  8264. 1449.00 s [vector] +++ OK, passed 100 tests.
  8265. 1449.00 s [vector] indexed: OK
  8266. 1449.00 s [vector] +++ OK, passed 100 tests.
  8267. 1449.00 s [vector] update: OK
  8268. 1449.00 s [vector] +++ OK, passed 100 tests.
  8269. 1449.00 s [vector] mempty: OK
  8270. 1449.00 s [vector] +++ OK, passed 100 tests.
  8271. 1449.01 s [vector] mappend: OK
  8272. 1449.01 s [vector] +++ OK, passed 100 tests.
  8273. 1449.03 s [vector] mconcat: OK (0.02s)
  8274. 1449.03 s [vector] +++ OK, passed 100 tests.
  8275. 1449.03 s [vector] glength: OK
  8276. 1449.03 s [vector] +++ OK, passed 100 tests.
  8277. 1449.03 s [vector] and: OK
  8278. 1449.03 s [vector] +++ OK, passed 100 tests.
  8279. 1449.03 s [vector] or: OK
  8280. 1449.03 s [vector] +++ OK, passed 100 tests.
  8281. 1449.03 s [vector] (Int)
  8282. 1449.03 s [vector] fromList.toList == id: OK
  8283. 1449.03 s [vector] +++ OK, passed 100 tests.
  8284. 1449.03 s [vector] toList.fromList == id: OK
  8285. 1449.03 s [vector] +++ OK, passed 100 tests.
  8286. 1449.03 s [vector] unstream.stream == id: OK
  8287. 1449.03 s [vector] +++ OK, passed 100 tests.
  8288. 1449.04 s [vector] stream.unstream == id: OK
  8289. 1449.04 s [vector] +++ OK, passed 100 tests.
  8290. 1449.04 s [vector] eq: OK
  8291. 1449.04 s [vector] +++ OK, passed 100 tests.
  8292. 1449.04 s [vector] length: OK
  8293. 1449.04 s [vector] +++ OK, passed 100 tests.
  8294. 1449.04 s [vector] null: OK
  8295. 1449.04 s [vector] +++ OK, passed 100 tests.
  8296. 1449.04 s [vector] index: OK
  8297. 1449.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8298. 1449.04 s [vector] safeIndex: OK
  8299. 1449.04 s [vector] +++ OK, passed 100 tests.
  8300. 1449.04 s [vector] head: OK
  8301. 1449.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8302. 1449.04 s [vector] last: OK
  8303. 1449.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8304. 1449.04 s [vector] unsafeIndex: OK
  8305. 1449.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8306. 1449.04 s [vector] unsafeHead: OK
  8307. 1449.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8308. 1449.05 s [vector] unsafeLast: OK
  8309. 1449.05 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8310. 1449.05 s [vector] slice: OK
  8311. 1449.05 s [vector] +++ OK, passed 100 tests.
  8312. 1449.05 s [vector] init: OK
  8313. 1449.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8314. 1449.05 s [vector] tail: OK
  8315. 1449.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8316. 1449.05 s [vector] take: OK
  8317. 1449.05 s [vector] +++ OK, passed 100 tests.
  8318. 1449.05 s [vector] drop: OK
  8319. 1449.05 s [vector] +++ OK, passed 100 tests.
  8320. 1449.05 s [vector] splitAt: OK
  8321. 1449.05 s [vector] +++ OK, passed 100 tests.
  8322. 1449.05 s [vector] empty: OK
  8323. 1449.05 s [vector] +++ OK, passed 100 tests.
  8324. 1449.05 s [vector] singleton: OK
  8325. 1449.05 s [vector] +++ OK, passed 100 tests.
  8326. 1449.05 s [vector] replicate: OK
  8327. 1449.05 s [vector] +++ OK, passed 100 tests.
  8328. 1449.05 s [vector] generate: OK
  8329. 1449.05 s [vector] +++ OK, passed 100 tests.
  8330. 1449.05 s [vector] iterateN: OK
  8331. 1449.07 s [vector] +++ OK, passed 100 tests.
  8332. 1449.11 s [vector] iterateNM: OK (0.05s)
  8333. 1449.11 s [vector] +++ OK, passed 100 tests.
  8334. 1449.13 s [vector] generateM: OK (0.02s)
  8335. 1449.13 s [vector] +++ OK, passed 100 tests.
  8336. 1449.14 s [vector] replicateM: OK (0.01s)
  8337. 1449.14 s [vector] +++ OK, passed 100 tests.
  8338. 1449.14 s [vector] create: OK
  8339. 1449.14 s [vector] +++ OK, passed 100 tests.
  8340. 1449.14 s [vector] createT: OK
  8341. 1449.14 s [vector] +++ OK, passed 100 tests.
  8342. 1449.14 s [vector] unfoldr: OK
  8343. 1449.14 s [vector] +++ OK, passed 100 tests.
  8344. 1449.14 s [vector] unfoldrN: OK
  8345. 1449.14 s [vector] +++ OK, passed 100 tests.
  8346. 1449.14 s [vector] unfoldrExactN: OK
  8347. 1449.14 s [vector] +++ OK, passed 100 tests.
  8348. 1449.15 s [vector] unfoldrM: OK
  8349. 1449.15 s [vector] +++ OK, passed 100 tests.
  8350. 1449.18 s [vector] unfoldrNM: OK
  8351. 1449.18 s [vector] +++ OK, passed 100 tests.
  8352. 1449.20 s [vector] unfoldrExactNM: OK (0.04s)
  8353. 1449.20 s [vector] +++ OK, passed 100 tests.
  8354. 1449.20 s [vector] constructN: OK
  8355. 1449.20 s [vector] +++ OK, passed 100 tests.
  8356. 1449.20 s [vector] constructrN: OK
  8357. 1449.20 s [vector] +++ OK, passed 100 tests.
  8358. 1449.20 s [vector] cons: OK
  8359. 1449.20 s [vector] +++ OK, passed 100 tests.
  8360. 1449.20 s [vector] snoc: OK
  8361. 1449.20 s [vector] +++ OK, passed 100 tests.
  8362. 1449.21 s [vector] append: OK
  8363. 1449.21 s [vector] +++ OK, passed 100 tests.
  8364. 1449.22 s [vector] concat: OK (0.02s)
  8365. 1449.22 s [vector] +++ OK, passed 100 tests.
  8366. 1449.22 s [vector] force: OK
  8367. 1449.22 s [vector] +++ OK, passed 100 tests.
  8368. 1449.23 s [vector] upd: OK
  8369. 1449.23 s [vector] +++ OK, passed 100 tests.
  8370. 1449.24 s [vector] accum: OK
  8371. 1449.24 s [vector] +++ OK, passed 100 tests.
  8372. 1449.24 s [vector] reverse: OK
  8373. 1449.24 s [vector] +++ OK, passed 100 tests.
  8374. 1449.24 s [vector] backpermute: OK
  8375. 1449.24 s [vector] +++ OK, passed 100 tests.
  8376. 1449.24 s [vector] map: OK
  8377. 1449.25 s [vector] +++ OK, passed 100 tests.
  8378. 1449.25 s [vector] imap: OK
  8379. 1449.25 s [vector] +++ OK, passed 100 tests.
  8380. 1449.25 s [vector] concatMap: OK
  8381. 1449.25 s [vector] +++ OK, passed 100 tests.
  8382. 1449.27 s [vector] mapM: OK
  8383. 1449.27 s [vector] +++ OK, passed 100 tests.
  8384. 1449.29 s [vector] mapM_: OK (0.03s)
  8385. 1449.29 s [vector] +++ OK, passed 100 tests.
  8386. 1449.29 s [vector] forM: OK
  8387. 1449.29 s [vector] +++ OK, passed 100 tests.
  8388. 1449.32 s [vector] forM_: OK (0.02s)
  8389. 1449.32 s [vector] +++ OK, passed 100 tests.
  8390. 1449.33 s [vector] imapM: OK
  8391. 1449.33 s [vector] +++ OK, passed 100 tests.
  8392. 1449.34 s [vector] imapM_: OK (0.02s)
  8393. 1449.34 s [vector] +++ OK, passed 100 tests.
  8394. 1449.34 s [vector] zipWith: OK
  8395. 1449.34 s [vector] +++ OK, passed 100 tests.
  8396. 1449.34 s [vector] zipWith3: OK
  8397. 1449.34 s [vector] +++ OK, passed 100 tests.
  8398. 1449.35 s [vector] izipWith: OK
  8399. 1449.35 s [vector] +++ OK, passed 100 tests.
  8400. 1449.36 s [vector] izipWith3: OK
  8401. 1449.37 s [vector] +++ OK, passed 100 tests.
  8402. 1449.37 s [vector] izipWithM: OK
  8403. 1449.37 s [vector] +++ OK, passed 100 tests.
  8404. 1449.37 s [vector] izipWithM_: OK (0.02s)
  8405. 1449.37 s [vector] +++ OK, passed 100 tests.
  8406. 1449.38 s [haskell-language-server] Preprocessing library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0...
  8407. 1449.38 s [haskell-language-server] Building library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0...
  8408. 1449.39 s [vector] zipWithM: OK
  8409. 1449.39 s [vector] +++ OK, passed 100 tests.
  8410. 1449.41 s [vector] zipWithM_: OK (0.02s)
  8411. 1449.41 s [vector] +++ OK, passed 100 tests.
  8412. 1449.41 s [vector] filter: OK
  8413. 1449.41 s [vector] +++ OK, passed 100 tests.
  8414. 1449.43 s [vector] ifilter: OK
  8415. 1449.43 s [vector] +++ OK, passed 100 tests.
  8416. 1449.44 s [vector] filterM: OK (0.03s)
  8417. 1449.65 s [vector] +++ OK, passed 100 tests.
  8418. 1449.65 s [vector] uniq: OK
  8419. 1449.65 s [vector] +++ OK, passed 100 tests.
  8420. 1449.65 s [vector] mapMaybe: OK
  8421. 1449.65 s [vector] +++ OK, passed 100 tests.
  8422. 1449.65 s [vector] imapMaybe: OK
  8423. 1449.65 s [vector] +++ OK, passed 100 tests.
  8424. 1449.66 s [vector] takeWhile: OK
  8425. 1449.66 s [vector] +++ OK, passed 100 tests.
  8426. 1449.66 s [vector] dropWhile: OK
  8427. 1449.66 s [vector] +++ OK, passed 100 tests.
  8428. 1449.66 s [vector] partition: OK
  8429. 1449.66 s [vector] +++ OK, passed 100 tests.
  8430. 1449.66 s [vector] partitionWith: OK
  8431. 1449.66 s [vector] +++ OK, passed 100 tests.
  8432. 1449.66 s [vector] span: OK
  8433. 1449.66 s [vector] +++ OK, passed 100 tests.
  8434. 1449.66 s [vector] break: OK
  8435. 1449.66 s [vector] +++ OK, passed 100 tests.
  8436. 1449.66 s [vector] spanR: OK
  8437. 1449.66 s [vector] +++ OK, passed 100 tests.
  8438. 1449.66 s [vector] breakR: OK
  8439. 1449.66 s [vector] +++ OK, passed 100 tests.
  8440. 1449.66 s [vector] groupBy: OK
  8441. 1449.66 s [vector] +++ OK, passed 100 tests.
  8442. 1449.66 s [vector] elem: OK
  8443. 1449.66 s [vector] +++ OK, passed 100 tests.
  8444. 1449.66 s [vector] notElem: OK
  8445. 1449.66 s [vector] +++ OK, passed 100 tests.
  8446. 1449.66 s [vector] find: OK
  8447. 1449.66 s [vector] +++ OK, passed 100 tests.
  8448. 1449.66 s [vector] findIndex: OK
  8449. 1449.66 s [vector] +++ OK, passed 100 tests.
  8450. 1449.66 s [vector] findIndexR: OK
  8451. 1449.66 s [vector] +++ OK, passed 100 tests.
  8452. 1449.66 s [vector] findIndices: OK
  8453. 1449.66 s [vector] +++ OK, passed 100 tests.
  8454. 1449.66 s [vector] elemIndex: OK
  8455. 1449.66 s [vector] +++ OK, passed 100 tests.
  8456. 1449.66 s [vector] elemIndices: OK
  8457. 1449.66 s [vector] +++ OK, passed 100 tests.
  8458. 1449.66 s [vector] foldl: OK
  8459. 1449.66 s [vector] +++ OK, passed 100 tests.
  8460. 1449.66 s [vector] foldl1: OK
  8461. 1449.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8462. 1449.66 s [vector] foldl': OK
  8463. 1449.66 s [vector] +++ OK, passed 100 tests.
  8464. 1449.66 s [vector] foldl1': OK
  8465. 1449.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8466. 1449.66 s [vector] foldr: OK
  8467. 1449.66 s [vector] +++ OK, passed 100 tests.
  8468. 1449.66 s [vector] foldr1: OK
  8469. 1449.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8470. 1449.66 s [vector] foldr': OK
  8471. 1449.66 s [vector] +++ OK, passed 100 tests.
  8472. 1449.66 s [vector] foldr1': OK
  8473. 1449.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8474. 1449.66 s [vector] ifoldl: OK
  8475. 1449.66 s [vector] +++ OK, passed 100 tests.
  8476. 1449.66 s [vector] ifoldl': OK
  8477. 1449.66 s [vector] +++ OK, passed 100 tests.
  8478. 1449.66 s [vector] ifoldr: OK
  8479. 1449.66 s [vector] +++ OK, passed 100 tests.
  8480. 1449.66 s [vector] ifoldr': OK
  8481. 1449.66 s [vector] +++ OK, passed 100 tests.
  8482. 1449.66 s [vector] ifoldM: OK
  8483. 1449.66 s [vector] +++ OK, passed 100 tests.
  8484. 1449.66 s [vector] ifoldM': OK
  8485. 1449.66 s [vector] +++ OK, passed 100 tests.
  8486. 1449.66 s [vector] ifoldM_: OK (0.02s)
  8487. 1449.66 s [vector] +++ OK, passed 100 tests.
  8488. 1449.66 s [vector] ifoldM'_: OK (0.02s)
  8489. 1449.66 s [vector] +++ OK, passed 100 tests.
  8490. 1449.66 s [vector] all: OK
  8491. 1449.66 s [vector] +++ OK, passed 100 tests.
  8492. 1449.66 s [vector] any: OK
  8493. 1449.66 s [vector] +++ OK, passed 100 tests.
  8494. 1449.66 s [vector] prescanl: OK
  8495. 1449.66 s [vector] +++ OK, passed 100 tests.
  8496. 1449.66 s [vector] prescanl': OK
  8497. 1449.66 s [vector] +++ OK, passed 100 tests.
  8498. 1449.66 s [vector] postscanl: OK
  8499. 1449.66 s [vector] +++ OK, passed 100 tests.
  8500. 1449.66 s [vector] postscanl': OK
  8501. 1449.66 s [vector] +++ OK, passed 100 tests.
  8502. 1449.66 s [vector] scanl: OK
  8503. 1449.66 s [vector] +++ OK, passed 100 tests.
  8504. 1449.66 s [vector] scanl': OK
  8505. 1449.66 s [vector] +++ OK, passed 100 tests.
  8506. 1449.66 s [vector] scanl1: OK
  8507. 1449.66 s [vector] +++ OK, passed 100 tests.
  8508. 1449.66 s [vector] scanl1': OK
  8509. 1449.66 s [vector] +++ OK, passed 100 tests.
  8510. 1449.66 s [vector] iscanl: OK
  8511. 1449.66 s [vector] +++ OK, passed 100 tests.
  8512. 1449.66 s [vector] iscanl': OK
  8513. 1449.66 s [vector] +++ OK, passed 100 tests.
  8514. 1449.66 s [vector] prescanr: OK
  8515. 1449.66 s [vector] +++ OK, passed 100 tests.
  8516. 1449.66 s [vector] prescanr': OK
  8517. 1449.66 s [vector] +++ OK, passed 100 tests.
  8518. 1449.66 s [vector] postscanr: OK
  8519. 1449.66 s [vector] +++ OK, passed 100 tests.
  8520. 1449.66 s [vector] postscanr': OK
  8521. 1449.66 s [vector] +++ OK, passed 100 tests.
  8522. 1449.66 s [vector] scanr: OK
  8523. 1449.66 s [vector] +++ OK, passed 100 tests.
  8524. 1449.66 s [vector] scanr': OK
  8525. 1449.66 s [vector] +++ OK, passed 100 tests.
  8526. 1449.66 s [vector] scanr1: OK
  8527. 1449.66 s [vector] +++ OK, passed 100 tests.
  8528. 1449.66 s [vector] scanr1': OK
  8529. 1449.66 s [vector] +++ OK, passed 100 tests.
  8530. 1449.66 s [vector] iscanr: OK
  8531. 1449.66 s [vector] +++ OK, passed 100 tests.
  8532. 1449.66 s [vector] iscanr': OK
  8533. 1449.66 s [vector] +++ OK, passed 100 tests.
  8534. 1449.66 s [vector] mut_read: OK
  8535. 1449.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8536. 1449.66 s [vector] mut_write: OK
  8537. 1449.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8538. 1449.66 s [vector] mut_modify: OK
  8539. 1449.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8540. 1449.66 s [vector] mut_generate: OK
  8541. 1449.66 s [vector] +++ OK, passed 100 tests.
  8542. 1449.66 s [vector] mut_generateM: OK (0.01s)
  8543. 1449.66 s [vector] +++ OK, passed 100 tests.
  8544. 1449.67 s [vector] mut_mapM_: OK (0.02s)
  8545. 1449.67 s [vector] +++ OK, passed 100 tests.
  8546. 1449.71 s [vector] mut_imapM_: OK (0.02s)
  8547. 1449.71 s [vector] +++ OK, passed 100 tests.
  8548. 1449.71 s [vector] mut_forM_: OK (0.02s)
  8549. 1449.71 s [vector] +++ OK, passed 100 tests.
  8550. 1449.73 s [vector] mut_iforM_: OK (0.02s)
  8551. 1449.73 s [vector] +++ OK, passed 100 tests.
  8552. 1449.73 s [vector] mut_foldr: OK
  8553. 1449.73 s [vector] +++ OK, passed 100 tests.
  8554. 1449.74 s [vector] mut_foldr': OK
  8555. 1449.74 s [vector] +++ OK, passed 100 tests.
  8556. 1449.74 s [vector] mut_foldl: OK
  8557. 1449.74 s [vector] +++ OK, passed 100 tests.
  8558. 1449.74 s [vector] mut_foldl': OK
  8559. 1449.75 s [vector] +++ OK, passed 100 tests.
  8560. 1449.75 s [vector] mut_ifoldr: OK
  8561. 1449.75 s [vector] +++ OK, passed 100 tests.
  8562. 1449.75 s [vector] mut_ifoldr': OK
  8563. 1449.75 s [vector] +++ OK, passed 100 tests.
  8564. 1449.76 s [vector] mut_ifoldl: OK
  8565. 1449.76 s [vector] +++ OK, passed 100 tests.
  8566. 1449.76 s [vector] mut_ifoldl': OK
  8567. 1449.76 s [vector] +++ OK, passed 100 tests.
  8568. 1449.76 s [vector] mut_foldM: OK
  8569. 1449.77 s [vector] +++ OK, passed 100 tests.
  8570. 1449.77 s [vector] mut_foldM': OK
  8571. 1449.77 s [vector] +++ OK, passed 100 tests.
  8572. 1449.77 s [vector] mut_foldrM: OK
  8573. 1449.77 s [vector] +++ OK, passed 100 tests.
  8574. 1449.79 s [vector] mut_foldrM': OK (0.01s)
  8575. 1449.79 s [vector] +++ OK, passed 100 tests.
  8576. 1449.79 s [vector] mut_ifoldM: OK
  8577. 1449.79 s [vector] +++ OK, passed 100 tests.
  8578. 1449.80 s [vector] mut_ifoldM': OK
  8579. 1449.80 s [vector] +++ OK, passed 100 tests.
  8580. 1449.80 s [vector] mut_ifoldrM: OK
  8581. 1449.80 s [vector] +++ OK, passed 100 tests.
  8582. 1449.80 s [vector] mut_ifoldrM': OK
  8583. 1449.80 s [vector] +++ OK, passed 100 tests.
  8584. 1449.80 s [vector] compare: OK
  8585. 1449.80 s [vector] +++ OK, passed 100 tests.
  8586. 1449.80 s [vector] maximum: OK
  8587. 1449.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8588. 1449.80 s [vector] minimum: OK
  8589. 1449.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8590. 1449.81 s [vector] minIndex: OK
  8591. 1449.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8592. 1449.81 s [vector] maxIndex: OK
  8593. 1449.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8594. 1449.81 s [vector] maximumBy: OK
  8595. 1449.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8596. 1449.81 s [vector] minimumBy: OK
  8597. 1449.81 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8598. 1449.81 s [vector] maximumOn: OK
  8599. 1449.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8600. 1449.81 s [vector] minimumOn: OK
  8601. 1449.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8602. 1449.81 s [vector] maxIndexBy: OK
  8603. 1449.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8604. 1449.81 s [vector] minIndexBy: OK
  8605. 1449.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8606. 1449.81 s [vector] ListFirstMaxIndexWins: OK
  8607. 1449.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8608. 1449.82 s [vector] FalseListFirstMaxIndexWins: OK
  8609. 1449.82 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8610. 1449.82 s [vector] []
  8611. 1449.82 s [vector] zip: OK
  8612. 1449.82 s [vector] +++ OK, passed 100 tests.
  8613. 1449.82 s [vector] zip3: OK
  8614. 1449.82 s [vector] +++ OK, passed 100 tests.
  8615. 1449.83 s [vector] unzip: OK
  8616. 1449.83 s [vector] +++ OK, passed 100 tests.
  8617. 1449.83 s [vector] unzip3: OK
  8618. 1449.83 s [vector] +++ OK, passed 100 tests.
  8619. 1449.83 s [vector] indexed: OK
  8620. 1449.83 s [vector] +++ OK, passed 100 tests.
  8621. 1449.83 s [vector] update: OK
  8622. 1449.83 s [vector] +++ OK, passed 100 tests.
  8623. 1449.83 s [vector] mempty: OK
  8624. 1449.83 s [vector] +++ OK, passed 100 tests.
  8625. 1449.83 s [vector] mappend: OK
  8626. 1449.83 s [vector] +++ OK, passed 100 tests.
  8627. 1449.85 s [vector] mconcat: OK
  8628. 1449.85 s [vector] +++ OK, passed 100 tests.
  8629. 1449.85 s [vector] glength: OK
  8630. 1449.85 s [vector] +++ OK, passed 100 tests.
  8631. 1449.85 s [vector] sum: OK
  8632. 1449.85 s [vector] +++ OK, passed 100 tests.
  8633. 1449.86 s [vector] product: OK
  8634. 1449.86 s [vector] +++ OK, passed 100 tests.
  8635. 1449.86 s [vector] enumFromN: OK
  8636. 1449.86 s [vector] +++ OK, passed 100 tests.
  8637. 1449.86 s [vector] enumFromThenN: OK
  8638. 1449.86 s [vector] +++ OK, passed 100 tests.
  8639. 1449.86 s [vector] enumFromTo: OK
  8640. 1449.86 s [vector] +++ OK, passed 100 tests.
  8641. 1449.86 s [vector] enumFromThenTo: OK
  8642. 1449.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8643. 1449.86 s [vector] (Float)
  8644. 1449.86 s [vector] fromList.toList == id: OK
  8645. 1449.86 s [vector] +++ OK, passed 100 tests.
  8646. 1449.86 s [vector] toList.fromList == id: OK
  8647. 1449.86 s [vector] +++ OK, passed 100 tests.
  8648. 1449.86 s [vector] unstream.stream == id: OK
  8649. 1449.86 s [vector] +++ OK, passed 100 tests.
  8650. 1449.86 s [vector] stream.unstream == id: OK
  8651. 1449.86 s [vector] +++ OK, passed 100 tests.
  8652. 1449.86 s [vector] eq: OK
  8653. 1449.86 s [vector] +++ OK, passed 100 tests.
  8654. 1449.86 s [vector] length: OK
  8655. 1449.86 s [vector] +++ OK, passed 100 tests.
  8656. 1449.87 s [vector] null: OK
  8657. 1449.87 s [vector] +++ OK, passed 100 tests.
  8658. 1449.87 s [vector] index: OK
  8659. 1449.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8660. 1449.87 s [vector] safeIndex: OK
  8661. 1449.87 s [vector] +++ OK, passed 100 tests.
  8662. 1449.87 s [vector] head: OK
  8663. 1449.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8664. 1449.87 s [vector] last: OK
  8665. 1449.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8666. 1449.87 s [vector] unsafeIndex: OK
  8667. 1449.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8668. 1449.87 s [vector] unsafeHead: OK
  8669. 1449.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8670. 1449.87 s [vector] unsafeLast: OK
  8671. 1449.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8672. 1449.87 s [vector] slice: OK
  8673. 1449.87 s [vector] +++ OK, passed 100 tests.
  8674. 1449.87 s [vector] init: OK
  8675. 1449.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8676. 1449.88 s [vector] tail: OK
  8677. 1449.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8678. 1449.88 s [vector] take: OK
  8679. 1449.88 s [vector] +++ OK, passed 100 tests.
  8680. 1449.88 s [vector] drop: OK
  8681. 1449.88 s [vector] +++ OK, passed 100 tests.
  8682. 1449.88 s [vector] splitAt: OK
  8683. 1449.88 s [vector] +++ OK, passed 100 tests.
  8684. 1449.88 s [vector] empty: OK
  8685. 1449.88 s [vector] +++ OK, passed 100 tests.
  8686. 1449.88 s [vector] singleton: OK
  8687. 1449.88 s [vector] +++ OK, passed 100 tests.
  8688. 1449.88 s [vector] replicate: OK
  8689. 1449.88 s [vector] +++ OK, passed 100 tests.
  8690. 1449.88 s [vector] generate: OK
  8691. 1449.88 s [vector] +++ OK, passed 100 tests.
  8692. 1449.88 s [vector] iterateN: OK
  8693. 1449.89 s [vector] +++ OK, passed 100 tests.
  8694. 1449.90 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 )
  8695. 1449.93 s [vector] iterateNM: OK (0.04s)
  8696. 1449.93 s [vector] +++ OK, passed 100 tests.
  8697. 1449.99 s [vector] generateM: OK (0.06s)
  8698. 1449.99 s [vector] +++ OK, passed 100 tests.
  8699. 1450.00 s [vector] replicateM: OK (0.02s)
  8700. 1450.00 s [vector] +++ OK, passed 100 tests.
  8701. 1450.01 s [vector] create: OK
  8702. 1450.01 s [vector] +++ OK, passed 100 tests.
  8703. 1450.01 s [vector] createT: OK
  8704. 1450.01 s [vector] +++ OK, passed 100 tests.
  8705. 1450.01 s [vector] unfoldr: OK
  8706. 1450.01 s [vector] +++ OK, passed 100 tests.
  8707. 1450.01 s [vector] unfoldrN: OK
  8708. 1450.01 s [vector] +++ OK, passed 100 tests.
  8709. 1450.02 s [vector] unfoldrExactN: OK
  8710. 1450.02 s [vector] +++ OK, passed 100 tests.
  8711. 1450.03 s [vector] unfoldrM: OK (0.01s)
  8712. 1450.03 s [vector] +++ OK, passed 100 tests.
  8713. 1450.03 s [vector] unfoldrNM: OK
  8714. 1450.03 s [vector] +++ OK, passed 100 tests.
  8715. 1450.09 s [vector] unfoldrExactNM: OK (0.07s)
  8716. 1450.09 s [vector] +++ OK, passed 100 tests.
  8717. 1450.11 s [vector] constructN: OK
  8718. 1450.11 s [vector] +++ OK, passed 100 tests.
  8719. 1450.11 s [vector] constructrN: OK (0.01s)
  8720. 1450.11 s [vector] +++ OK, passed 100 tests.
  8721. 1450.13 s [vector] cons: OK
  8722. 1450.13 s [vector] +++ OK, passed 100 tests.
  8723. 1450.13 s [vector] snoc: OK
  8724. 1450.13 s [vector] +++ OK, passed 100 tests.
  8725. 1450.13 s [vector] append: OK
  8726. 1450.13 s [vector] +++ OK, passed 100 tests.
  8727. 1450.15 s [vector] concat: OK (0.03s)
  8728. 1450.15 s [vector] +++ OK, passed 100 tests.
  8729. 1450.15 s [vector] force: OK
  8730. 1450.16 s [vector] +++ OK, passed 100 tests.
  8731. 1450.17 s [vector] upd: OK
  8732. 1450.17 s [vector] +++ OK, passed 100 tests.
  8733. 1450.17 s [vector] accum: OK (0.01s)
  8734. 1450.17 s [vector] +++ OK, passed 100 tests.
  8735. 1450.17 s [vector] reverse: OK
  8736. 1450.17 s [vector] +++ OK, passed 100 tests.
  8737. 1450.18 s [vector] backpermute: OK
  8738. 1450.18 s [vector] +++ OK, passed 100 tests.
  8739. 1450.18 s [vector] map: OK
  8740. 1450.18 s [vector] +++ OK, passed 100 tests.
  8741. 1450.19 s [vector] imap: OK
  8742. 1450.19 s [vector] +++ OK, passed 100 tests.
  8743. 1450.20 s [vector] concatMap: OK
  8744. 1450.21 s [vector] +++ OK, passed 100 tests.
  8745. 1450.21 s [vector] mapM: OK
  8746. 1450.21 s [vector] +++ OK, passed 100 tests.
  8747. 1450.24 s [vector] mapM_: OK (0.04s)
  8748. 1450.25 s [vector] +++ OK, passed 100 tests.
  8749. 1450.25 s [vector] forM: OK
  8750. 1450.25 s [vector] +++ OK, passed 100 tests.
  8751. 1450.28 s [vector] forM_: OK (0.04s)
  8752. 1450.28 s [vector] +++ OK, passed 100 tests.
  8753. 1450.28 s [vector] imapM: OK
  8754. 1450.28 s [vector] +++ OK, passed 100 tests.
  8755. 1450.32 s [vector] imapM_: OK (0.02s)
  8756. 1450.33 s [vector] +++ OK, passed 100 tests.
  8757. 1450.33 s [vector] zipWith: OK
  8758. 1450.33 s [vector] +++ OK, passed 100 tests.
  8759. 1450.33 s [vector] zipWith3: OK
  8760. 1450.33 s [vector] +++ OK, passed 100 tests.
  8761. 1450.34 s [vector] izipWith: OK
  8762. 1450.35 s [vector] +++ OK, passed 100 tests.
  8763. 1450.35 s [vector] izipWith3: OK
  8764. 1450.35 s [vector] +++ OK, passed 100 tests.
  8765. 1450.37 s [vector] izipWithM: OK
  8766. 1450.37 s [vector] +++ OK, passed 100 tests.
  8767. 1450.39 s [vector] izipWithM_: OK (0.03s)
  8768. 1450.39 s [vector] +++ OK, passed 100 tests.
  8769. 1450.39 s [vector] zipWithM: OK
  8770. 1450.41 s [vector] +++ OK, passed 100 tests.
  8771. 1450.41 s [vector] zipWithM_: OK (0.03s)
  8772. 1450.41 s [vector] +++ OK, passed 100 tests.
  8773. 1450.42 s [vector] filter: OK
  8774. 1450.42 s [vector] +++ OK, passed 100 tests.
  8775. 1450.42 s [vector] ifilter: OK
  8776. 1450.42 s [vector] +++ OK, passed 100 tests.
  8777. 1450.47 s [vector] filterM: OK (0.04s)
  8778. 1450.47 s [vector] +++ OK, passed 100 tests.
  8779. 1450.47 s [vector] uniq: OK
  8780. 1450.47 s [vector] +++ OK, passed 100 tests.
  8781. 1450.48 s [vector] mapMaybe: OK
  8782. 1450.48 s [vector] +++ OK, passed 100 tests.
  8783. 1450.48 s [vector] imapMaybe: OK
  8784. 1450.48 s [vector] +++ OK, passed 100 tests.
  8785. 1450.48 s [vector] takeWhile: OK
  8786. 1450.48 s [vector] +++ OK, passed 100 tests.
  8787. 1450.48 s [vector] dropWhile: OK
  8788. 1450.49 s [vector] +++ OK, passed 100 tests.
  8789. 1450.49 s [vector] partition: OK
  8790. 1450.49 s [vector] +++ OK, passed 100 tests.
  8791. 1450.49 s [vector] partitionWith: OK
  8792. 1450.49 s [vector] +++ OK, passed 100 tests.
  8793. 1450.49 s [vector] span: OK
  8794. 1450.49 s [vector] +++ OK, passed 100 tests.
  8795. 1450.50 s [vector] break: OK
  8796. 1450.50 s [vector] +++ OK, passed 100 tests.
  8797. 1450.50 s [vector] spanR: OK
  8798. 1450.50 s [vector] +++ OK, passed 100 tests.
  8799. 1450.50 s [vector] breakR: OK
  8800. 1450.50 s [vector] +++ OK, passed 100 tests.
  8801. 1450.50 s [vector] groupBy: OK
  8802. 1450.50 s [vector] +++ OK, passed 100 tests.
  8803. 1450.51 s [vector] elem: OK
  8804. 1450.51 s [vector] +++ OK, passed 100 tests.
  8805. 1450.51 s [vector] notElem: OK
  8806. 1450.51 s [vector] +++ OK, passed 100 tests.
  8807. 1450.51 s [vector] find: OK
  8808. 1450.51 s [vector] +++ OK, passed 100 tests.
  8809. 1450.51 s [vector] findIndex: OK
  8810. 1450.51 s [vector] +++ OK, passed 100 tests.
  8811. 1450.51 s [vector] findIndexR: OK
  8812. 1450.51 s [vector] +++ OK, passed 100 tests.
  8813. 1450.51 s [vector] findIndices: OK
  8814. 1450.51 s [vector] +++ OK, passed 100 tests.
  8815. 1450.51 s [vector] elemIndex: OK
  8816. 1450.53 s [vector] +++ OK, passed 100 tests.
  8817. 1450.53 s [vector] elemIndices: OK
  8818. 1450.53 s [vector] +++ OK, passed 100 tests.
  8819. 1450.53 s [vector] foldl: OK
  8820. 1450.53 s [vector] +++ OK, passed 100 tests.
  8821. 1450.54 s [vector] foldl1: OK (0.01s)
  8822. 1450.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8823. 1450.54 s [vector] foldl': OK
  8824. 1450.55 s [vector] +++ OK, passed 100 tests.
  8825. 1450.55 s [vector] foldl1': OK
  8826. 1450.55 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8827. 1450.56 s [vector] foldr: OK
  8828. 1450.57 s [vector] +++ OK, passed 100 tests.
  8829. 1450.57 s [vector] foldr1: OK
  8830. 1450.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8831. 1450.58 s [vector] foldr': OK
  8832. 1450.58 s [vector] +++ OK, passed 100 tests.
  8833. 1450.59 s [vector] foldr1': OK
  8834. 1450.59 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8835. 1450.60 s [vector] ifoldl: OK
  8836. 1450.60 s [vector] +++ OK, passed 100 tests.
  8837. 1450.60 s [vector] ifoldl': OK
  8838. 1450.61 s [vector] +++ OK, passed 100 tests.
  8839. 1450.62 s [vector] ifoldr: OK
  8840. 1450.62 s [vector] +++ OK, passed 100 tests.
  8841. 1450.63 s [vector] ifoldr': OK
  8842. 1450.63 s [vector] +++ OK, passed 100 tests.
  8843. 1450.63 s [vector] ifoldM: OK
  8844. 1450.63 s [vector] +++ OK, passed 100 tests.
  8845. 1450.64 s [vector] ifoldM': OK
  8846. 1450.64 s [vector] +++ OK, passed 100 tests.
  8847. 1450.69 s [vector] ifoldM_: OK (0.03s)
  8848. 1450.69 s [vector] +++ OK, passed 100 tests.
  8849. 1450.71 s [vector] ifoldM'_: OK (0.04s)
  8850. 1450.71 s [vector] +++ OK, passed 100 tests.
  8851. 1450.71 s [vector] all: OK
  8852. 1450.71 s [vector] +++ OK, passed 100 tests.
  8853. 1450.71 s [vector] any: OK
  8854. 1450.73 s [vector] +++ OK, passed 100 tests.
  8855. 1450.74 s [vector] prescanl: OK (0.02s)
  8856. 1450.74 s [vector] +++ OK, passed 100 tests.
  8857. 1450.74 s [vector] prescanl': OK
  8858. 1450.75 s [vector] +++ OK, passed 100 tests.
  8859. 1450.75 s [vector] postscanl: OK
  8860. 1450.75 s [vector] +++ OK, passed 100 tests.
  8861. 1450.75 s [vector] postscanl': OK
  8862. 1450.75 s [vector] +++ OK, passed 100 tests.
  8863. 1450.76 s [vector] scanl: OK
  8864. 1450.77 s [vector] +++ OK, passed 100 tests.
  8865. 1450.77 s [vector] scanl': OK
  8866. 1450.77 s [vector] +++ OK, passed 100 tests.
  8867. 1450.78 s [vector] scanl1: OK
  8868. 1450.79 s [vector] +++ OK, passed 100 tests.
  8869. 1450.79 s [vector] scanl1': OK
  8870. 1450.79 s [vector] +++ OK, passed 100 tests.
  8871. 1450.80 s [vector] iscanl: OK
  8872. 1450.80 s [vector] +++ OK, passed 100 tests.
  8873. 1450.81 s [vector] iscanl': OK
  8874. 1450.81 s [vector] +++ OK, passed 100 tests.
  8875. 1450.82 s [vector] prescanr: OK
  8876. 1450.82 s [vector] +++ OK, passed 100 tests.
  8877. 1450.82 s [vector] prescanr': OK
  8878. 1450.82 s [vector] +++ OK, passed 100 tests.
  8879. 1450.83 s [vector] postscanr: OK
  8880. 1450.83 s [vector] +++ OK, passed 100 tests.
  8881. 1450.84 s [vector] postscanr': OK
  8882. 1450.84 s [vector] +++ OK, passed 100 tests.
  8883. 1450.85 s [vector] scanr: OK
  8884. 1450.85 s [vector] +++ OK, passed 100 tests.
  8885. 1450.86 s [vector] scanr': OK
  8886. 1450.86 s [vector] +++ OK, passed 100 tests.
  8887. 1450.87 s [vector] scanr1: OK
  8888. 1450.87 s [vector] +++ OK, passed 100 tests.
  8889. 1450.87 s [vector] scanr1': OK
  8890. 1450.87 s [vector] +++ OK, passed 100 tests.
  8891. 1450.89 s [vector] iscanr: OK
  8892. 1450.89 s [vector] +++ OK, passed 100 tests.
  8893. 1450.89 s [vector] iscanr': OK
  8894. 1450.89 s [vector] +++ OK, passed 100 tests.
  8895. 1450.89 s [vector] mut_read: OK
  8896. 1450.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8897. 1450.89 s [vector] mut_write: OK
  8898. 1450.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8899. 1450.89 s [vector] mut_modify: OK
  8900. 1450.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8901. 1450.89 s [vector] mut_generate: OK
  8902. 1450.89 s [vector] +++ OK, passed 100 tests.
  8903. 1450.93 s [vector] mut_generateM: OK (0.02s)
  8904. 1450.93 s [vector] +++ OK, passed 100 tests.
  8905. 1450.94 s [vector] mut_mapM_: OK (0.03s)
  8906. 1450.94 s [vector] +++ OK, passed 100 tests.
  8907. 1450.99 s [vector] mut_imapM_: OK (0.03s)
  8908. 1450.99 s [vector] +++ OK, passed 100 tests.
  8909. 1451.03 s [vector] mut_forM_: OK (0.04s)
  8910. 1451.03 s [vector] +++ OK, passed 100 tests.
  8911. 1451.06 s [vector] mut_iforM_: OK (0.04s)
  8912. 1451.06 s [vector] +++ OK, passed 100 tests.
  8913. 1451.07 s [vector] mut_foldr: OK
  8914. 1451.07 s [vector] +++ OK, passed 100 tests.
  8915. 1451.07 s [vector] mut_foldr': OK
  8916. 1451.07 s [vector] +++ OK, passed 100 tests.
  8917. 1451.08 s [vector] mut_foldl: OK
  8918. 1451.08 s [vector] +++ OK, passed 100 tests.
  8919. 1451.09 s [vector] mut_foldl': OK
  8920. 1451.09 s [vector] +++ OK, passed 100 tests.
  8921. 1451.09 s [vector] mut_ifoldr: OK (0.01s)
  8922. 1451.09 s [vector] +++ OK, passed 100 tests.
  8923. 1451.11 s [vector] mut_ifoldr': OK
  8924. 1451.11 s [vector] +++ OK, passed 100 tests.
  8925. 1451.11 s [vector] mut_ifoldl: OK
  8926. 1451.12 s [vector] +++ OK, passed 100 tests.
  8927. 1451.12 s [vector] mut_ifoldl': OK
  8928. 1451.13 s [vector] +++ OK, passed 100 tests.
  8929. 1451.13 s [vector] mut_foldM: OK
  8930. 1451.13 s [vector] +++ OK, passed 100 tests.
  8931. 1451.13 s [vector] mut_foldM': OK
  8932. 1451.14 s [vector] +++ OK, passed 100 tests.
  8933. 1451.14 s [vector] mut_foldrM: OK
  8934. 1451.14 s [vector] +++ OK, passed 100 tests.
  8935. 1451.15 s [vector] mut_foldrM': OK
  8936. 1451.15 s [vector] +++ OK, passed 100 tests.
  8937. 1451.17 s [vector] mut_ifoldM: OK (0.01s)
  8938. 1451.17 s [vector] +++ OK, passed 100 tests.
  8939. 1451.18 s [vector] mut_ifoldM': OK (0.01s)
  8940. 1451.19 s [vector] +++ OK, passed 100 tests.
  8941. 1451.19 s [vector] mut_ifoldrM: OK
  8942. 1451.19 s [vector] +++ OK, passed 100 tests.
  8943. 1451.19 s [vector] mut_ifoldrM': OK
  8944. 1451.19 s [vector] +++ OK, passed 100 tests.
  8945. 1451.20 s [vector] compare: OK
  8946. 1451.20 s [vector] +++ OK, passed 100 tests.
  8947. 1451.20 s [vector] maximum: OK
  8948. 1451.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8949. 1451.20 s [vector] minimum: OK
  8950. 1451.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8951. 1451.20 s [vector] minIndex: OK
  8952. 1451.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8953. 1451.20 s [vector] maxIndex: OK
  8954. 1451.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8955. 1451.20 s [vector] maximumBy: OK
  8956. 1451.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8957. 1451.20 s [vector] minimumBy: OK
  8958. 1451.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8959. 1451.20 s [vector] maximumOn: OK
  8960. 1451.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8961. 1451.20 s [vector] minimumOn: OK
  8962. 1451.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8963. 1451.21 s [vector] maxIndexBy: OK
  8964. 1451.21 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8965. 1451.21 s [vector] minIndexBy: OK
  8966. 1451.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8967. 1451.21 s [vector] ListFirstMaxIndexWins: OK
  8968. 1451.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8969. 1451.21 s [vector] FalseListFirstMaxIndexWins: OK
  8970. 1451.21 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8971. 1451.21 s [vector] []
  8972. 1451.21 s [vector] zip: OK
  8973. 1451.21 s [vector] +++ OK, passed 100 tests.
  8974. 1451.21 s [vector] zip3: OK
  8975. 1451.22 s [vector] +++ OK, passed 100 tests.
  8976. 1451.22 s [vector] unzip: OK
  8977. 1451.22 s [vector] +++ OK, passed 100 tests.
  8978. 1451.22 s [vector] unzip3: OK
  8979. 1451.22 s [vector] +++ OK, passed 100 tests.
  8980. 1451.22 s [vector] indexed: OK
  8981. 1451.22 s [vector] +++ OK, passed 100 tests.
  8982. 1451.22 s [vector] update: OK
  8983. 1451.22 s [vector] +++ OK, passed 100 tests.
  8984. 1451.22 s [vector] mempty: OK
  8985. 1451.22 s [vector] +++ OK, passed 100 tests.
  8986. 1451.23 s [vector] mappend: OK
  8987. 1451.23 s [vector] +++ OK, passed 100 tests.
  8988. 1451.26 s [vector] mconcat: OK (0.03s)
  8989. 1451.26 s [vector] +++ OK, passed 100 tests.
  8990. 1451.26 s [vector] glength: OK
  8991. 1451.27 s [vector] +++ OK, passed 100 tests.
  8992. 1451.27 s [vector] sum: OK
  8993. 1451.27 s [vector] +++ OK, passed 100 tests.
  8994. 1451.27 s [vector] product: OK
  8995. 1451.27 s [vector] +++ OK, passed 100 tests.
  8996. 1451.27 s [vector] enumFromN: OK
  8997. 1451.27 s [vector] +++ OK, passed 100 tests.
  8998. 1451.27 s [vector] enumFromThenN: OK
  8999. 1451.27 s [vector] +++ OK, passed 100 tests.
  9000. 1451.27 s [vector] enumFromTo: OK
  9001. 1451.27 s [vector] +++ OK, passed 100 tests.
  9002. 1451.27 s [vector] enumFromThenTo: OK
  9003. 1451.27 s [vector] +++ OK, passed 100 tests.
  9004. 1451.27 s [vector] (Double)
  9005. 1451.27 s [vector] fromList.toList == id: OK
  9006. 1451.27 s [vector] +++ OK, passed 100 tests.
  9007. 1451.27 s [vector] toList.fromList == id: OK
  9008. 1451.27 s [vector] +++ OK, passed 100 tests.
  9009. 1451.27 s [vector] unstream.stream == id: OK
  9010. 1451.27 s [vector] +++ OK, passed 100 tests.
  9011. 1451.27 s [vector] stream.unstream == id: OK
  9012. 1451.27 s [vector] +++ OK, passed 100 tests.
  9013. 1451.27 s [vector] eq: OK
  9014. 1451.28 s [vector] +++ OK, passed 100 tests.
  9015. 1451.28 s [vector] length: OK
  9016. 1451.28 s [vector] +++ OK, passed 100 tests.
  9017. 1451.28 s [vector] null: OK
  9018. 1451.28 s [vector] +++ OK, passed 100 tests.
  9019. 1451.28 s [vector] index: OK
  9020. 1451.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9021. 1451.28 s [vector] safeIndex: OK
  9022. 1451.28 s [vector] +++ OK, passed 100 tests.
  9023. 1451.28 s [vector] head: OK
  9024. 1451.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9025. 1451.28 s [vector] last: OK
  9026. 1451.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9027. 1451.28 s [vector] unsafeIndex: OK
  9028. 1451.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9029. 1451.28 s [vector] unsafeHead: OK
  9030. 1451.28 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9031. 1451.28 s [vector] unsafeLast: OK
  9032. 1451.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9033. 1451.29 s [vector] slice: OK
  9034. 1451.29 s [vector] +++ OK, passed 100 tests.
  9035. 1451.29 s [vector] init: OK
  9036. 1451.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9037. 1451.29 s [vector] tail: OK
  9038. 1451.29 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9039. 1451.29 s [vector] take: OK
  9040. 1451.29 s [vector] +++ OK, passed 100 tests.
  9041. 1451.29 s [vector] drop: OK
  9042. 1451.29 s [vector] +++ OK, passed 100 tests.
  9043. 1451.29 s [vector] splitAt: OK
  9044. 1451.29 s [vector] +++ OK, passed 100 tests.
  9045. 1451.29 s [vector] empty: OK
  9046. 1451.29 s [vector] +++ OK, passed 100 tests.
  9047. 1451.29 s [vector] singleton: OK
  9048. 1451.29 s [vector] +++ OK, passed 100 tests.
  9049. 1451.29 s [vector] replicate: OK
  9050. 1451.29 s [vector] +++ OK, passed 100 tests.
  9051. 1451.30 s [vector] generate: OK
  9052. 1451.30 s [vector] +++ OK, passed 100 tests.
  9053. 1451.31 s [vector] iterateN: OK
  9054. 1451.31 s [vector] +++ OK, passed 100 tests.
  9055. 1451.33 s [vector] iterateNM: OK (0.03s)
  9056. 1451.33 s [vector] +++ OK, passed 100 tests.
  9057. 1451.37 s [vector] generateM: OK (0.03s)
  9058. 1451.37 s [vector] +++ OK, passed 100 tests.
  9059. 1451.39 s [vector] replicateM: OK (0.01s)
  9060. 1451.39 s [vector] +++ OK, passed 100 tests.
  9061. 1451.39 s [vector] create: OK (0.01s)
  9062. 1451.39 s [vector] +++ OK, passed 100 tests.
  9063. 1451.39 s [vector] createT: OK
  9064. 1451.39 s [vector] +++ OK, passed 100 tests.
  9065. 1451.39 s [vector] unfoldr: OK
  9066. 1451.39 s [vector] +++ OK, passed 100 tests.
  9067. 1451.39 s [vector] unfoldrN: OK
  9068. 1451.39 s [vector] +++ OK, passed 100 tests.
  9069. 1451.39 s [vector] unfoldrExactN: OK
  9070. 1451.39 s [vector] +++ OK, passed 100 tests.
  9071. 1451.40 s [vector] unfoldrM: OK
  9072. 1451.40 s [vector] +++ OK, passed 100 tests.
  9073. 1451.41 s [vector] unfoldrNM: OK
  9074. 1451.41 s [vector] +++ OK, passed 100 tests.
  9075. 1451.45 s [vector] unfoldrExactNM: OK (0.04s)
  9076. 1451.45 s [vector] +++ OK, passed 100 tests.
  9077. 1451.47 s [vector] constructN: OK (0.02s)
  9078. 1451.47 s [vector] +++ OK, passed 100 tests.
  9079. 1451.48 s [vector] constructrN: OK (0.02s)
  9080. 1451.48 s [vector] +++ OK, passed 100 tests.
  9081. 1451.48 s [vector] cons: OK
  9082. 1451.48 s [vector] +++ OK, passed 100 tests.
  9083. 1451.48 s [vector] snoc: OK
  9084. 1451.48 s [vector] +++ OK, passed 100 tests.
  9085. 1451.49 s [vector] append: OK
  9086. 1451.49 s [vector] +++ OK, passed 100 tests.
  9087. 1451.51 s [vector] concat: OK (0.03s)
  9088. 1451.51 s [vector] +++ OK, passed 100 tests.
  9089. 1451.51 s [vector] force: OK
  9090. 1451.51 s [vector] +++ OK, passed 100 tests.
  9091. 1451.52 s [vector] upd: OK
  9092. 1451.52 s [vector] +++ OK, passed 100 tests.
  9093. 1451.53 s [vector] accum: OK
  9094. 1451.53 s [vector] +++ OK, passed 100 tests.
  9095. 1451.53 s [vector] reverse: OK
  9096. 1451.53 s [vector] +++ OK, passed 100 tests.
  9097. 1451.54 s [vector] backpermute: OK
  9098. 1451.55 s [vector] +++ OK, passed 100 tests.
  9099. 1451.55 s [vector] map: OK
  9100. 1451.56 s [vector] +++ OK, passed 100 tests.
  9101. 1451.56 s [vector] imap: OK
  9102. 1451.56 s [vector] +++ OK, passed 100 tests.
  9103. 1451.56 s [vector] concatMap: OK
  9104. 1451.56 s [vector] +++ OK, passed 100 tests.
  9105. 1451.57 s [vector] mapM: OK
  9106. 1451.57 s [vector] +++ OK, passed 100 tests.
  9107. 1451.61 s [vector] mapM_: OK (0.04s)
  9108. 1451.61 s [vector] +++ OK, passed 100 tests.
  9109. 1451.61 s [vector] forM: OK
  9110. 1451.63 s [vector] +++ OK, passed 100 tests.
  9111. 1451.67 s [vector] forM_: OK (0.04s)
  9112. 1451.67 s [vector] +++ OK, passed 100 tests.
  9113. 1451.67 s [vector] imapM: OK
  9114. 1451.67 s [vector] +++ OK, passed 100 tests.
  9115. 1451.71 s [vector] imapM_: OK (0.04s)
  9116. 1451.71 s [vector] +++ OK, passed 100 tests.
  9117. 1451.72 s [vector] zipWith: OK
  9118. 1451.72 s [vector] +++ OK, passed 100 tests.
  9119. 1451.74 s [vector] zipWith3: OK (0.01s)
  9120. 1451.75 s [vector] +++ OK, passed 100 tests.
  9121. 1451.75 s [vector] izipWith: OK (0.01s)
  9122. 1451.75 s [vector] +++ OK, passed 100 tests.
  9123. 1451.77 s [vector] izipWith3: OK (0.01s)
  9124. 1451.77 s [vector] +++ OK, passed 100 tests.
  9125. 1451.77 s [vector] izipWithM: OK (0.01s)
  9126. 1451.77 s [vector] +++ OK, passed 100 tests.
  9127. 1451.79 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 )
  9128. 1451.81 s [vector] izipWithM_: OK (0.04s)
  9129. 1451.81 s [vector] +++ OK, passed 100 tests.
  9130. 1451.83 s [vector] zipWithM: OK (0.01s)
  9131. 1451.83 s [vector] +++ OK, passed 100 tests.
  9132. 1451.85 s [vector] zipWithM_: OK (0.03s)
  9133. 1451.85 s [vector] +++ OK, passed 100 tests.
  9134. 1451.86 s [vector] filter: OK
  9135. 1451.86 s [vector] +++ OK, passed 100 tests.
  9136. 1451.87 s [vector] ifilter: OK
  9137. 1451.87 s [vector] +++ OK, passed 100 tests.
  9138. 1451.91 s [vector] filterM: OK (0.05s)
  9139. 1451.91 s [vector] +++ OK, passed 100 tests.
  9140. 1451.91 s [vector] uniq: OK
  9141. 1451.92 s [vector] +++ OK, passed 100 tests.
  9142. 1451.93 s [vector] mapMaybe: OK
  9143. 1451.94 s [vector] +++ OK, passed 100 tests.
  9144. 1451.94 s [vector] imapMaybe: OK (0.01s)
  9145. 1451.94 s [vector] +++ OK, passed 100 tests.
  9146. 1451.94 s [vector] takeWhile: OK
  9147. 1451.94 s [vector] +++ OK, passed 100 tests.
  9148. 1451.95 s [vector] dropWhile: OK
  9149. 1451.95 s [vector] +++ OK, passed 100 tests.
  9150. 1451.96 s [vector] partition: OK
  9151. 1451.96 s [vector] +++ OK, passed 100 tests.
  9152. 1451.96 s [vector] partitionWith: OK
  9153. 1451.96 s [vector] +++ OK, passed 100 tests.
  9154. 1451.96 s [vector] span: OK
  9155. 1451.96 s [vector] +++ OK, passed 100 tests.
  9156. 1451.96 s [vector] break: OK
  9157. 1451.96 s [vector] +++ OK, passed 100 tests.
  9158. 1451.97 s [vector] spanR: OK
  9159. 1451.97 s [vector] +++ OK, passed 100 tests.
  9160. 1451.97 s [vector] breakR: OK
  9161. 1451.97 s [vector] +++ OK, passed 100 tests.
  9162. 1451.98 s [vector] groupBy: OK (0.01s)
  9163. 1451.98 s [vector] +++ OK, passed 100 tests.
  9164. 1451.98 s [vector] elem: OK
  9165. 1451.98 s [vector] +++ OK, passed 100 tests.
  9166. 1451.98 s [vector] notElem: OK
  9167. 1451.98 s [vector] +++ OK, passed 100 tests.
  9168. 1451.98 s [vector] find: OK
  9169. 1451.98 s [vector] +++ OK, passed 100 tests.
  9170. 1451.98 s [vector] findIndex: OK
  9171. 1451.98 s [vector] +++ OK, passed 100 tests.
  9172. 1451.99 s [vector] findIndexR: OK
  9173. 1451.99 s [vector] +++ OK, passed 100 tests.
  9174. 1452.00 s [vector] findIndices: OK
  9175. 1452.00 s [vector] +++ OK, passed 100 tests.
  9176. 1452.01 s [vector] elemIndex: OK
  9177. 1452.01 s [vector] +++ OK, passed 100 tests.
  9178. 1452.01 s [vector] elemIndices: OK
  9179. 1452.01 s [vector] +++ OK, passed 100 tests.
  9180. 1452.03 s [vector] foldl: OK (0.01s)
  9181. 1452.03 s [vector] +++ OK, passed 100 tests.
  9182. 1452.04 s [vector] foldl1: OK (0.02s)
  9183. 1452.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9184. 1452.05 s [vector] foldl': OK (0.01s)
  9185. 1452.05 s [vector] +++ OK, passed 100 tests.
  9186. 1452.07 s [vector] foldl1': OK (0.01s)
  9187. 1452.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9188. 1452.07 s [vector] foldr: OK (0.01s)
  9189. 1452.07 s [vector] +++ OK, passed 100 tests.
  9190. 1452.09 s [vector] foldr1: OK (0.01s)
  9191. 1452.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9192. 1452.10 s [vector] foldr': OK (0.01s)
  9193. 1452.11 s [vector] +++ OK, passed 100 tests.
  9194. 1452.11 s [vector] foldr1': OK (0.01s)
  9195. 1452.11 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9196. 1452.13 s [vector] ifoldl: OK (0.01s)
  9197. 1452.13 s [vector] +++ OK, passed 100 tests.
  9198. 1452.15 s [vector] ifoldl': OK (0.01s)
  9199. 1452.15 s [vector] +++ OK, passed 100 tests.
  9200. 1452.16 s [vector] ifoldr: OK (0.02s)
  9201. 1452.17 s [vector] +++ OK, passed 100 tests.
  9202. 1452.17 s [vector] ifoldr': OK (0.02s)
  9203. 1452.17 s [vector] +++ OK, passed 100 tests.
  9204. 1452.19 s [vector] ifoldM: OK (0.02s)
  9205. 1452.19 s [vector] +++ OK, passed 100 tests.
  9206. 1452.21 s [vector] ifoldM': OK (0.02s)
  9207. 1452.21 s [vector] +++ OK, passed 100 tests.
  9208. 1452.24 s [vector] ifoldM_: OK (0.04s)
  9209. 1452.24 s [vector] +++ OK, passed 100 tests.
  9210. 1452.28 s [vector] ifoldM'_: OK (0.03s)
  9211. 1452.28 s [vector] +++ OK, passed 100 tests.
  9212. 1452.28 s [vector] all: OK
  9213. 1452.28 s [vector] +++ OK, passed 100 tests.
  9214. 1452.29 s [vector] any: OK
  9215. 1452.29 s [vector] +++ OK, passed 100 tests.
  9216. 1452.31 s [vector] prescanl: OK (0.01s)
  9217. 1452.31 s [vector] +++ OK, passed 100 tests.
  9218. 1452.33 s [vector] prescanl': OK (0.01s)
  9219. 1452.33 s [vector] +++ OK, passed 100 tests.
  9220. 1452.35 s [vector] postscanl: OK (0.02s)
  9221. 1452.35 s [vector] +++ OK, passed 100 tests.
  9222. 1452.37 s [vector] postscanl': OK (0.02s)
  9223. 1452.37 s [vector] +++ OK, passed 100 tests.
  9224. 1452.37 s [vector] scanl: OK (0.02s)
  9225. 1452.37 s [vector] +++ OK, passed 100 tests.
  9226. 1452.39 s [vector] scanl': OK (0.01s)
  9227. 1452.39 s [vector] +++ OK, passed 100 tests.
  9228. 1452.41 s [vector] scanl1: OK (0.01s)
  9229. 1452.41 s [vector] +++ OK, passed 100 tests.
  9230. 1452.41 s [vector] scanl1': OK (0.01s)
  9231. 1452.41 s [vector] +++ OK, passed 100 tests.
  9232. 1452.43 s [vector] iscanl: OK (0.01s)
  9233. 1452.43 s [vector] +++ OK, passed 100 tests.
  9234. 1452.45 s [vector] iscanl': OK (0.02s)
  9235. 1452.45 s [vector] +++ OK, passed 100 tests.
  9236. 1452.46 s [vector] prescanr: OK (0.01s)
  9237. 1452.46 s [vector] +++ OK, passed 100 tests.
  9238. 1452.47 s [vector] prescanr': OK (0.01s)
  9239. 1452.47 s [vector] +++ OK, passed 100 tests.
  9240. 1452.48 s [vector] postscanr: OK (0.01s)
  9241. 1452.48 s [vector] +++ OK, passed 100 tests.
  9242. 1452.50 s [vector] postscanr': OK
  9243. 1452.50 s [vector] +++ OK, passed 100 tests.
  9244. 1452.51 s [vector] scanr: OK (0.01s)
  9245. 1452.51 s [vector] +++ OK, passed 100 tests.
  9246. 1452.52 s [vector] scanr': OK (0.01s)
  9247. 1452.52 s [vector] +++ OK, passed 100 tests.
  9248. 1452.54 s [vector] scanr1: OK
  9249. 1452.54 s [vector] +++ OK, passed 100 tests.
  9250. 1452.55 s [vector] scanr1': OK (0.01s)
  9251. 1452.55 s [vector] +++ OK, passed 100 tests.
  9252. 1452.57 s [vector] iscanr: OK (0.02s)
  9253. 1452.57 s [vector] +++ OK, passed 100 tests.
  9254. 1452.57 s [vector] iscanr': OK (0.01s)
  9255. 1452.57 s [vector] +++ OK, passed 100 tests.
  9256. 1452.57 s [vector] mut_read: OK
  9257. 1452.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9258. 1452.58 s [vector] mut_write: OK
  9259. 1452.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9260. 1452.58 s [vector] mut_modify: OK
  9261. 1452.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9262. 1452.58 s [vector] mut_generate: OK
  9263. 1452.59 s [vector] +++ OK, passed 100 tests.
  9264. 1452.60 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 )
  9265. 1452.61 s [vector] mut_generateM: OK (0.02s)
  9266. 1452.61 s [vector] +++ OK, passed 100 tests.
  9267. 1452.65 s [vector] mut_mapM_: OK (0.04s)
  9268. 1452.65 s [vector] +++ OK, passed 100 tests.
  9269. 1452.69 s [vector] mut_imapM_: OK (0.05s)
  9270. 1452.69 s [vector] +++ OK, passed 100 tests.
  9271. 1452.73 s [vector] mut_forM_: OK (0.04s)
  9272. 1452.73 s [vector] +++ OK, passed 100 tests.
  9273. 1452.77 s [vector] mut_iforM_: OK (0.04s)
  9274. 1452.77 s [vector] +++ OK, passed 100 tests.
  9275. 1452.79 s [vector] mut_foldr: OK (0.01s)
  9276. 1452.79 s [vector] +++ OK, passed 100 tests.
  9277. 1452.81 s [vector] mut_foldr': OK (0.01s)
  9278. 1452.81 s [vector] +++ OK, passed 100 tests.
  9279. 1452.83 s [vector] mut_foldl: OK (0.02s)
  9280. 1452.83 s [vector] +++ OK, passed 100 tests.
  9281. 1452.83 s [vector] mut_foldl': OK (0.02s)
  9282. 1452.83 s [vector] +++ OK, passed 100 tests.
  9283. 1452.86 s [vector] mut_ifoldr: OK (0.02s)
  9284. 1452.86 s [vector] +++ OK, passed 100 tests.
  9285. 1452.87 s [vector] mut_ifoldr': OK (0.01s)
  9286. 1452.87 s [vector] +++ OK, passed 100 tests.
  9287. 1452.89 s [vector] mut_ifoldl: OK (0.01s)
  9288. 1452.89 s [vector] +++ OK, passed 100 tests.
  9289. 1452.91 s [vector] mut_ifoldl': OK (0.02s)
  9290. 1452.91 s [vector] +++ OK, passed 100 tests.
  9291. 1452.91 s [vector] mut_foldM: OK (0.01s)
  9292. 1452.91 s [vector] +++ OK, passed 100 tests.
  9293. 1452.93 s [vector] mut_foldM': OK (0.02s)
  9294. 1452.93 s [vector] +++ OK, passed 100 tests.
  9295. 1452.95 s [vector] mut_foldrM: OK (0.01s)
  9296. 1452.95 s [vector] +++ OK, passed 100 tests.
  9297. 1452.97 s [vector] mut_foldrM': OK (0.01s)
  9298. 1452.97 s [vector] +++ OK, passed 100 tests.
  9299. 1452.97 s [vector] mut_ifoldM: OK (0.02s)
  9300. 1452.97 s [vector] +++ OK, passed 100 tests.
  9301. 1452.99 s [vector] mut_ifoldM': OK (0.02s)
  9302. 1452.99 s [vector] +++ OK, passed 100 tests.
  9303. 1453.01 s [vector] mut_ifoldrM: OK (0.02s)
  9304. 1453.01 s [vector] +++ OK, passed 100 tests.
  9305. 1453.03 s [vector] mut_ifoldrM': OK (0.02s)
  9306. 1453.03 s [vector] +++ OK, passed 100 tests.
  9307. 1453.03 s [vector] compare: OK
  9308. 1453.03 s [vector] +++ OK, passed 100 tests.
  9309. 1453.03 s [vector] maximum: OK
  9310. 1453.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9311. 1453.03 s [vector] minimum: OK
  9312. 1453.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9313. 1453.03 s [vector] minIndex: OK
  9314. 1453.04 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9315. 1453.04 s [vector] maxIndex: OK
  9316. 1453.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9317. 1453.04 s [vector] maximumBy: OK
  9318. 1453.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9319. 1453.04 s [vector] minimumBy: OK
  9320. 1453.04 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9321. 1453.04 s [vector] maximumOn: OK
  9322. 1453.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9323. 1453.05 s [vector] minimumOn: OK
  9324. 1453.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9325. 1453.05 s [vector] maxIndexBy: OK
  9326. 1453.05 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9327. 1453.05 s [vector] minIndexBy: OK
  9328. 1453.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9329. 1453.05 s [vector] ListFirstMaxIndexWins: OK
  9330. 1453.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9331. 1453.05 s [vector] FalseListFirstMaxIndexWins: OK
  9332. 1453.05 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9333. 1453.05 s [vector] []
  9334. 1453.06 s [vector] zip: OK
  9335. 1453.06 s [vector] +++ OK, passed 100 tests.
  9336. 1453.06 s [vector] zip3: OK
  9337. 1453.06 s [vector] +++ OK, passed 100 tests.
  9338. 1453.06 s [vector] unzip: OK
  9339. 1453.06 s [vector] +++ OK, passed 100 tests.
  9340. 1453.07 s [vector] unzip3: OK
  9341. 1453.07 s [vector] +++ OK, passed 100 tests.
  9342. 1453.07 s [vector] indexed: OK
  9343. 1453.07 s [vector] +++ OK, passed 100 tests.
  9344. 1453.07 s [vector] update: OK
  9345. 1453.07 s [vector] +++ OK, passed 100 tests.
  9346. 1453.07 s [vector] mempty: OK
  9347. 1453.07 s [vector] +++ OK, passed 100 tests.
  9348. 1453.09 s [vector] mappend: OK
  9349. 1453.09 s [vector] +++ OK, passed 100 tests.
  9350. 1453.10 s [vector] mconcat: OK (0.03s)
  9351. 1453.10 s [vector] +++ OK, passed 100 tests.
  9352. 1453.10 s [vector] glength: OK
  9353. 1453.10 s [vector] +++ OK, passed 100 tests.
  9354. 1453.10 s [vector] sum: OK
  9355. 1453.10 s [vector] +++ OK, passed 100 tests.
  9356. 1453.11 s [vector] product: OK
  9357. 1453.11 s [vector] +++ OK, passed 100 tests.
  9358. 1453.11 s [vector] enumFromN: OK
  9359. 1453.11 s [vector] +++ OK, passed 100 tests.
  9360. 1453.11 s [vector] enumFromThenN: OK
  9361. 1453.11 s [vector] +++ OK, passed 100 tests.
  9362. 1453.11 s [vector] enumFromTo: OK
  9363. 1453.11 s [vector] +++ OK, passed 100 tests.
  9364. 1453.12 s [vector] enumFromThenTo: OK
  9365. 1453.12 s [vector] +++ OK, passed 100 tests; 2 discarded.
  9366. 1453.12 s [vector] (Int,Bool)
  9367. 1453.12 s [vector] fromList.toList == id: OK
  9368. 1453.12 s [vector] +++ OK, passed 100 tests.
  9369. 1453.12 s [vector] toList.fromList == id: OK
  9370. 1453.12 s [vector] +++ OK, passed 100 tests.
  9371. 1453.12 s [vector] unstream.stream == id: OK
  9372. 1453.12 s [vector] +++ OK, passed 100 tests.
  9373. 1453.12 s [vector] stream.unstream == id: OK
  9374. 1453.12 s [vector] +++ OK, passed 100 tests.
  9375. 1453.12 s [vector] eq: OK
  9376. 1453.12 s [vector] +++ OK, passed 100 tests.
  9377. 1453.13 s [vector] length: OK
  9378. 1453.13 s [vector] +++ OK, passed 100 tests.
  9379. 1453.13 s [vector] null: OK
  9380. 1453.13 s [vector] +++ OK, passed 100 tests.
  9381. 1453.13 s [vector] index: OK
  9382. 1453.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9383. 1453.13 s [vector] safeIndex: OK
  9384. 1453.13 s [vector] +++ OK, passed 100 tests.
  9385. 1453.13 s [vector] head: OK
  9386. 1453.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9387. 1453.13 s [vector] last: OK
  9388. 1453.13 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9389. 1453.13 s [vector] unsafeIndex: OK
  9390. 1453.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9391. 1453.13 s [vector] unsafeHead: OK
  9392. 1453.13 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9393. 1453.13 s [vector] unsafeLast: OK
  9394. 1453.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9395. 1453.13 s [vector] slice: OK
  9396. 1453.13 s [vector] +++ OK, passed 100 tests.
  9397. 1453.13 s [vector] init: OK
  9398. 1453.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9399. 1453.13 s [vector] tail: OK
  9400. 1453.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9401. 1453.13 s [vector] take: OK
  9402. 1453.13 s [vector] +++ OK, passed 100 tests.
  9403. 1453.13 s [vector] drop: OK
  9404. 1453.13 s [vector] +++ OK, passed 100 tests.
  9405. 1453.13 s [vector] splitAt: OK
  9406. 1453.13 s [vector] +++ OK, passed 100 tests.
  9407. 1453.13 s [vector] empty: OK
  9408. 1453.14 s [vector] +++ OK, passed 100 tests.
  9409. 1453.14 s [vector] singleton: OK
  9410. 1453.14 s [vector] +++ OK, passed 100 tests.
  9411. 1453.14 s [vector] replicate: OK
  9412. 1453.14 s [vector] +++ OK, passed 100 tests.
  9413. 1453.14 s [vector] generate: OK
  9414. 1453.14 s [vector] +++ OK, passed 100 tests.
  9415. 1453.15 s [vector] iterateN: OK
  9416. 1453.15 s [vector] +++ OK, passed 100 tests.
  9417. 1453.19 s [vector] iterateNM: OK (0.04s)
  9418. 1453.19 s [vector] +++ OK, passed 100 tests.
  9419. 1453.23 s [vector] generateM: OK (0.04s)
  9420. 1453.23 s [vector] +++ OK, passed 100 tests.
  9421. 1453.24 s [vector] replicateM: OK (0.02s)
  9422. 1453.25 s [vector] +++ OK, passed 100 tests.
  9423. 1453.25 s [vector] create: OK
  9424. 1453.25 s [vector] +++ OK, passed 100 tests.
  9425. 1453.25 s [vector] createT: OK
  9426. 1453.25 s [vector] +++ OK, passed 100 tests.
  9427. 1453.25 s [vector] unfoldr: OK
  9428. 1453.25 s [vector] +++ OK, passed 100 tests.
  9429. 1453.25 s [vector] unfoldrN: OK
  9430. 1453.25 s [vector] +++ OK, passed 100 tests.
  9431. 1453.27 s [vector] unfoldrExactN: OK
  9432. 1453.27 s [vector] +++ OK, passed 100 tests.
  9433. 1453.27 s [vector] unfoldrM: OK
  9434. 1453.27 s [vector] +++ OK, passed 100 tests.
  9435. 1453.27 s [vector] unfoldrNM: OK
  9436. 1453.27 s [vector] +++ OK, passed 100 tests.
  9437. 1453.31 s [vector] unfoldrExactNM: OK (0.04s)
  9438. 1453.31 s [vector] +++ OK, passed 100 tests.
  9439. 1453.31 s [vector] constructN: OK
  9440. 1453.31 s [vector] +++ OK, passed 100 tests.
  9441. 1453.31 s [vector] constructrN: OK
  9442. 1453.31 s [vector] +++ OK, passed 100 tests.
  9443. 1453.32 s [vector] cons: OK
  9444. 1453.32 s [vector] +++ OK, passed 100 tests.
  9445. 1453.32 s [vector] snoc: OK
  9446. 1453.32 s [vector] +++ OK, passed 100 tests.
  9447. 1453.32 s [vector] append: OK
  9448. 1453.32 s [vector] +++ OK, passed 100 tests.
  9449. 1453.36 s [vector] concat: OK (0.04s)
  9450. 1453.36 s [vector] +++ OK, passed 100 tests.
  9451. 1453.36 s [vector] force: OK
  9452. 1453.37 s [vector] +++ OK, passed 100 tests.
  9453. 1453.37 s [vector] upd: OK
  9454. 1453.37 s [vector] +++ OK, passed 100 tests.
  9455. 1453.38 s [vector] accum: OK
  9456. 1453.38 s [vector] +++ OK, passed 100 tests.
  9457. 1453.38 s [vector] reverse: OK
  9458. 1453.38 s [vector] +++ OK, passed 100 tests.
  9459. 1453.38 s [vector] backpermute: OK
  9460. 1453.38 s [vector] +++ OK, passed 100 tests.
  9461. 1453.39 s [vector] map: OK
  9462. 1453.39 s [vector] +++ OK, passed 100 tests.
  9463. 1453.39 s [vector] imap: OK
  9464. 1453.40 s [vector] +++ OK, passed 100 tests.
  9465. 1453.40 s [vector] concatMap: OK
  9466. 1453.40 s [vector] +++ OK, passed 100 tests.
  9467. 1453.40 s [vector] mapM: OK
  9468. 1453.41 s [vector] +++ OK, passed 100 tests.
  9469. 1453.44 s [vector] mapM_: OK (0.03s)
  9470. 1453.44 s [vector] +++ OK, passed 100 tests.
  9471. 1453.44 s [vector] forM: OK
  9472. 1453.45 s [vector] +++ OK, passed 100 tests.
  9473. 1453.49 s [vector] forM_: OK (0.04s)
  9474. 1453.49 s [vector] +++ OK, passed 100 tests.
  9475. 1453.49 s [vector] imapM: OK
  9476. 1453.49 s [vector] +++ OK, passed 100 tests.
  9477. 1453.54 s [vector] imapM_: OK (0.04s)
  9478. 1453.54 s [vector] +++ OK, passed 100 tests.
  9479. 1453.55 s [vector] zipWith: OK
  9480. 1453.55 s [vector] +++ OK, passed 100 tests.
  9481. 1453.57 s [vector] zipWith3: OK (0.01s)
  9482. 1453.57 s [vector] +++ OK, passed 100 tests.
  9483. 1453.58 s [vector] izipWith: OK (0.02s)
  9484. 1453.58 s [vector] +++ OK, passed 100 tests.
  9485. 1453.58 s [vector] izipWith3: OK
  9486. 1453.58 s [vector] +++ OK, passed 100 tests.
  9487. 1453.59 s [vector] izipWithM: OK
  9488. 1453.59 s [vector] +++ OK, passed 100 tests.
  9489. 1453.62 s [vector] izipWithM_: OK (0.03s)
  9490. 1453.62 s [vector] +++ OK, passed 100 tests.
  9491. 1453.63 s [vector] zipWithM: OK
  9492. 1453.63 s [vector] +++ OK, passed 100 tests.
  9493. 1453.66 s [vector] zipWithM_: OK (0.03s)
  9494. 1453.66 s [vector] +++ OK, passed 100 tests.
  9495. 1453.66 s [vector] filter: OK
  9496. 1453.66 s [vector] +++ OK, passed 100 tests.
  9497. 1453.67 s [vector] ifilter: OK
  9498. 1453.67 s [vector] +++ OK, passed 100 tests.
  9499. 1453.71 s [vector] filterM: OK (0.04s)
  9500. 1453.71 s [vector] +++ OK, passed 100 tests.
  9501. 1453.71 s [vector] uniq: OK
  9502. 1453.71 s [vector] +++ OK, passed 100 tests.
  9503. 1453.72 s [vector] mapMaybe: OK
  9504. 1453.72 s [vector] +++ OK, passed 100 tests.
  9505. 1453.72 s [vector] imapMaybe: OK
  9506. 1453.72 s [vector] +++ OK, passed 100 tests.
  9507. 1453.72 s [vector] takeWhile: OK
  9508. 1453.72 s [vector] +++ OK, passed 100 tests.
  9509. 1453.73 s [vector] dropWhile: OK
  9510. 1453.73 s [vector] +++ OK, passed 100 tests.
  9511. 1453.73 s [vector] partition: OK
  9512. 1453.73 s [vector] +++ OK, passed 100 tests.
  9513. 1453.74 s [vector] partitionWith: OK
  9514. 1453.74 s [vector] +++ OK, passed 100 tests.
  9515. 1453.74 s [vector] span: OK
  9516. 1453.74 s [vector] +++ OK, passed 100 tests.
  9517. 1453.74 s [vector] break: OK
  9518. 1453.74 s [vector] +++ OK, passed 100 tests.
  9519. 1453.74 s [vector] spanR: OK
  9520. 1453.75 s [vector] +++ OK, passed 100 tests.
  9521. 1453.75 s [vector] breakR: OK
  9522. 1453.75 s [vector] +++ OK, passed 100 tests.
  9523. 1453.75 s [vector] groupBy: OK
  9524. 1453.75 s [vector] +++ OK, passed 100 tests.
  9525. 1453.75 s [vector] elem: OK
  9526. 1453.75 s [vector] +++ OK, passed 100 tests.
  9527. 1453.75 s [vector] notElem: OK
  9528. 1453.76 s [vector] +++ OK, passed 100 tests.
  9529. 1453.76 s [vector] find: OK
  9530. 1453.76 s [vector] +++ OK, passed 100 tests.
  9531. 1453.76 s [vector] findIndex: OK
  9532. 1453.76 s [vector] +++ OK, passed 100 tests.
  9533. 1453.76 s [vector] findIndexR: OK
  9534. 1453.76 s [vector] +++ OK, passed 100 tests.
  9535. 1453.76 s [vector] findIndices: OK
  9536. 1453.76 s [vector] +++ OK, passed 100 tests.
  9537. 1453.76 s [vector] elemIndex: OK
  9538. 1453.76 s [vector] +++ OK, passed 100 tests.
  9539. 1453.76 s [vector] elemIndices: OK
  9540. 1453.76 s [vector] +++ OK, passed 100 tests.
  9541. 1453.76 s [vector] foldl: OK
  9542. 1453.77 s [vector] +++ OK, passed 100 tests.
  9543. 1453.77 s [vector] foldl1: OK
  9544. 1453.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9545. 1453.78 s [vector] foldl': OK
  9546. 1453.78 s [vector] +++ OK, passed 100 tests.
  9547. 1453.79 s [vector] foldl1': OK
  9548. 1453.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9549. 1453.79 s [vector] foldr: OK
  9550. 1453.79 s [vector] +++ OK, passed 100 tests.
  9551. 1453.80 s [vector] foldr1: OK
  9552. 1453.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9553. 1453.80 s [vector] foldr': OK
  9554. 1453.80 s [vector] +++ OK, passed 100 tests.
  9555. 1453.81 s [vector] foldr1': OK
  9556. 1453.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9557. 1453.81 s [vector] ifoldl: OK
  9558. 1453.81 s [vector] +++ OK, passed 100 tests.
  9559. 1453.82 s [vector] ifoldl': OK
  9560. 1453.82 s [vector] +++ OK, passed 100 tests.
  9561. 1453.83 s [vector] ifoldr: OK
  9562. 1453.83 s [vector] +++ OK, passed 100 tests.
  9563. 1453.83 s [vector] ifoldr': OK
  9564. 1453.83 s [vector] +++ OK, passed 100 tests.
  9565. 1453.83 s [vector] ifoldM: OK
  9566. 1453.83 s [vector] +++ OK, passed 100 tests.
  9567. 1453.84 s [vector] ifoldM': OK
  9568. 1453.84 s [vector] +++ OK, passed 100 tests.
  9569. 1453.89 s [vector] ifoldM_: OK (0.04s)
  9570. 1453.89 s [vector] +++ OK, passed 100 tests.
  9571. 1453.92 s [vector] ifoldM'_: OK (0.04s)
  9572. 1453.92 s [vector] +++ OK, passed 100 tests.
  9573. 1453.93 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 )
  9574. 1453.93 s [vector] all: OK
  9575. 1453.93 s [vector] +++ OK, passed 100 tests.
  9576. 1453.93 s [vector] any: OK
  9577. 1453.93 s [vector] +++ OK, passed 100 tests.
  9578. 1453.93 s [vector] prescanl: OK
  9579. 1453.93 s [vector] +++ OK, passed 100 tests.
  9580. 1453.93 s [vector] prescanl': OK
  9581. 1453.93 s [vector] +++ OK, passed 100 tests.
  9582. 1453.94 s [vector] postscanl: OK
  9583. 1453.94 s [vector] +++ OK, passed 100 tests.
  9584. 1453.95 s [vector] postscanl': OK
  9585. 1453.95 s [vector] +++ OK, passed 100 tests.
  9586. 1453.95 s [vector] scanl: OK
  9587. 1453.95 s [vector] +++ OK, passed 100 tests.
  9588. 1453.96 s [vector] scanl': OK
  9589. 1453.97 s [vector] +++ OK, passed 100 tests.
  9590. 1453.97 s [vector] scanl1: OK
  9591. 1453.97 s [vector] +++ OK, passed 100 tests.
  9592. 1453.98 s [vector] scanl1': OK
  9593. 1453.99 s [vector] +++ OK, passed 100 tests.
  9594. 1453.99 s [vector] iscanl: OK
  9595. 1453.99 s [vector] +++ OK, passed 100 tests.
  9596. 1453.99 s [vector] iscanl': OK
  9597. 1453.99 s [vector] +++ OK, passed 100 tests.
  9598. 1454.00 s [vector] prescanr: OK
  9599. 1454.01 s [vector] +++ OK, passed 100 tests.
  9600. 1454.01 s [vector] prescanr': OK
  9601. 1454.01 s [vector] +++ OK, passed 100 tests.
  9602. 1454.01 s [vector] postscanr: OK
  9603. 1454.01 s [vector] +++ OK, passed 100 tests.
  9604. 1454.02 s [vector] postscanr': OK
  9605. 1454.03 s [vector] +++ OK, passed 100 tests.
  9606. 1454.03 s [vector] scanr: OK
  9607. 1454.03 s [vector] +++ OK, passed 100 tests.
  9608. 1454.03 s [vector] scanr': OK
  9609. 1454.03 s [vector] +++ OK, passed 100 tests.
  9610. 1454.03 s [vector] scanr1: OK
  9611. 1454.03 s [vector] +++ OK, passed 100 tests.
  9612. 1454.04 s [vector] scanr1': OK
  9613. 1454.05 s [vector] +++ OK, passed 100 tests.
  9614. 1454.05 s [vector] iscanr: OK
  9615. 1454.05 s [vector] +++ OK, passed 100 tests.
  9616. 1454.06 s [vector] iscanr': OK
  9617. 1454.06 s [vector] +++ OK, passed 100 tests.
  9618. 1454.06 s [vector] mut_read: OK
  9619. 1454.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9620. 1454.06 s [vector] mut_write: OK
  9621. 1454.06 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9622. 1454.06 s [vector] mut_modify: OK
  9623. 1454.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9624. 1454.07 s [vector] mut_generate: OK
  9625. 1454.07 s [vector] +++ OK, passed 100 tests.
  9626. 1454.11 s [vector] mut_generateM: OK (0.03s)
  9627. 1454.11 s [vector] +++ OK, passed 100 tests.
  9628. 1454.15 s [vector] mut_mapM_: OK (0.04s)
  9629. 1454.15 s [vector] +++ OK, passed 100 tests.
  9630. 1454.19 s [vector] mut_imapM_: OK (0.04s)
  9631. 1454.19 s [vector] +++ OK, passed 100 tests.
  9632. 1454.21 s [vector] mut_forM_: OK (0.03s)
  9633. 1454.21 s [vector] +++ OK, passed 100 tests.
  9634. 1454.25 s [vector] mut_iforM_: OK (0.04s)
  9635. 1454.25 s [vector] +++ OK, passed 100 tests.
  9636. 1454.25 s [vector] mut_foldr: OK
  9637. 1454.25 s [vector] +++ OK, passed 100 tests.
  9638. 1454.25 s [vector] mut_foldr': OK
  9639. 1454.25 s [vector] +++ OK, passed 100 tests.
  9640. 1454.26 s [vector] mut_foldl: OK
  9641. 1454.26 s [vector] +++ OK, passed 100 tests.
  9642. 1454.27 s [vector] mut_foldl': OK
  9643. 1454.27 s [vector] +++ OK, passed 100 tests.
  9644. 1454.27 s [vector] mut_ifoldr: OK
  9645. 1454.28 s [vector] +++ OK, passed 100 tests.
  9646. 1454.29 s [vector] mut_ifoldr': OK
  9647. 1454.29 s [vector] +++ OK, passed 100 tests.
  9648. 1454.29 s [vector] mut_ifoldl: OK
  9649. 1454.29 s [vector] +++ OK, passed 100 tests.
  9650. 1454.29 s [vector] mut_ifoldl': OK
  9651. 1454.29 s [vector] +++ OK, passed 100 tests.
  9652. 1454.29 s [vector] mut_foldM: OK
  9653. 1454.29 s [vector] +++ OK, passed 100 tests.
  9654. 1454.30 s [vector] mut_foldM': OK
  9655. 1454.30 s [vector] +++ OK, passed 100 tests.
  9656. 1454.31 s [vector] mut_foldrM: OK
  9657. 1454.31 s [vector] +++ OK, passed 100 tests.
  9658. 1454.31 s [vector] mut_foldrM': OK
  9659. 1454.31 s [vector] +++ OK, passed 100 tests.
  9660. 1454.32 s [vector] mut_ifoldM: OK
  9661. 1454.32 s [vector] +++ OK, passed 100 tests.
  9662. 1454.33 s [vector] mut_ifoldM': OK
  9663. 1454.33 s [vector] +++ OK, passed 100 tests.
  9664. 1454.34 s [vector] mut_ifoldrM: OK
  9665. 1454.34 s [vector] +++ OK, passed 100 tests.
  9666. 1454.34 s [vector] mut_ifoldrM': OK
  9667. 1454.34 s [vector] +++ OK, passed 100 tests.
  9668. 1454.34 s [vector] compare: OK
  9669. 1454.34 s [vector] +++ OK, passed 100 tests.
  9670. 1454.34 s [vector] maximum: OK
  9671. 1454.34 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9672. 1454.34 s [vector] minimum: OK
  9673. 1454.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9674. 1454.34 s [vector] minIndex: OK
  9675. 1454.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9676. 1454.35 s [vector] maxIndex: OK
  9677. 1454.35 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9678. 1454.35 s [vector] maximumBy: OK
  9679. 1454.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9680. 1454.35 s [vector] minimumBy: OK
  9681. 1454.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9682. 1454.35 s [vector] maximumOn: OK
  9683. 1454.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9684. 1454.36 s [vector] minimumOn: OK
  9685. 1454.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9686. 1454.36 s [vector] maxIndexBy: OK
  9687. 1454.37 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9688. 1454.37 s [vector] minIndexBy: OK
  9689. 1454.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9690. 1454.37 s [vector] ListFirstMaxIndexWins: OK
  9691. 1454.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9692. 1454.37 s [vector] FalseListFirstMaxIndexWins: OK
  9693. 1454.37 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9694. 1454.37 s [vector] []
  9695. 1454.37 s [vector] zip: OK
  9696. 1454.37 s [vector] +++ OK, passed 100 tests.
  9697. 1454.37 s [vector] zip3: OK
  9698. 1454.37 s [vector] +++ OK, passed 100 tests.
  9699. 1454.38 s [vector] unzip: OK
  9700. 1454.38 s [vector] +++ OK, passed 100 tests.
  9701. 1454.38 s [vector] unzip3: OK
  9702. 1454.38 s [vector] +++ OK, passed 100 tests.
  9703. 1454.38 s [vector] indexed: OK
  9704. 1454.38 s [vector] +++ OK, passed 100 tests.
  9705. 1454.38 s [vector] update: OK
  9706. 1454.38 s [vector] +++ OK, passed 100 tests.
  9707. 1454.39 s [vector] mempty: OK
  9708. 1454.39 s [vector] +++ OK, passed 100 tests.
  9709. 1454.39 s [vector] mappend: OK
  9710. 1454.39 s [vector] +++ OK, passed 100 tests.
  9711. 1454.41 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 )
  9712. 1454.44 s [vector] mconcat: OK (0.05s)
  9713. 1454.44 s [vector] +++ OK, passed 100 tests.
  9714. 1454.44 s [vector] glength: OK
  9715. 1454.44 s [vector] +++ OK, passed 100 tests.
  9716. 1454.44 s [vector] (Int,Bool,Int)
  9717. 1454.44 s [vector] fromList.toList == id: OK
  9718. 1454.44 s [vector] +++ OK, passed 100 tests.
  9719. 1454.45 s [vector] toList.fromList == id: OK
  9720. 1454.58 s [vector] +++ OK, passed 100 tests.
  9721. 1454.58 s [vector] unstream.stream == id: OK
  9722. 1454.58 s [vector] +++ OK, passed 100 tests.
  9723. 1454.58 s [vector] stream.unstream == id: OK
  9724. 1454.58 s [vector] +++ OK, passed 100 tests.
  9725. 1454.58 s [vector] eq: OK
  9726. 1454.58 s [vector] +++ OK, passed 100 tests.
  9727. 1454.58 s [vector] length: OK
  9728. 1454.58 s [vector] +++ OK, passed 100 tests.
  9729. 1454.58 s [vector] null: OK
  9730. 1454.58 s [vector] +++ OK, passed 100 tests.
  9731. 1454.58 s [vector] index: OK
  9732. 1454.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9733. 1454.58 s [vector] safeIndex: OK
  9734. 1454.58 s [vector] +++ OK, passed 100 tests.
  9735. 1454.58 s [vector] head: OK
  9736. 1454.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9737. 1454.58 s [vector] last: OK
  9738. 1454.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9739. 1454.58 s [vector] unsafeIndex: OK
  9740. 1454.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9741. 1454.58 s [vector] unsafeHead: OK
  9742. 1454.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9743. 1454.58 s [vector] unsafeLast: OK
  9744. 1454.58 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9745. 1454.58 s [vector] slice: OK
  9746. 1454.58 s [vector] +++ OK, passed 100 tests.
  9747. 1454.58 s [vector] init: OK
  9748. 1454.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9749. 1454.58 s [vector] tail: OK
  9750. 1454.58 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9751. 1454.58 s [vector] take: OK
  9752. 1454.58 s [vector] +++ OK, passed 100 tests.
  9753. 1454.58 s [vector] drop: OK
  9754. 1454.58 s [vector] +++ OK, passed 100 tests.
  9755. 1454.58 s [vector] splitAt: OK
  9756. 1454.58 s [vector] +++ OK, passed 100 tests.
  9757. 1454.58 s [vector] empty: OK
  9758. 1454.58 s [vector] +++ OK, passed 100 tests.
  9759. 1454.58 s [vector] singleton: OK
  9760. 1454.58 s [vector] +++ OK, passed 100 tests.
  9761. 1454.58 s [vector] replicate: OK
  9762. 1454.58 s [vector] +++ OK, passed 100 tests.
  9763. 1454.58 s [vector] generate: OK
  9764. 1454.58 s [vector] +++ OK, passed 100 tests.
  9765. 1454.58 s [vector] iterateN: OK
  9766. 1454.58 s [vector] +++ OK, passed 100 tests.
  9767. 1454.58 s [vector] iterateNM: OK (0.04s)
  9768. 1454.58 s [vector] +++ OK, passed 100 tests.
  9769. 1454.58 s [vector] generateM: OK (0.04s)
  9770. 1454.58 s [vector] +++ OK, passed 100 tests.
  9771. 1454.58 s [vector] replicateM: OK (0.01s)
  9772. 1454.58 s [vector] +++ OK, passed 100 tests.
  9773. 1454.58 s [vector] create: OK
  9774. 1454.58 s [vector] +++ OK, passed 100 tests.
  9775. 1454.58 s [vector] createT: OK
  9776. 1454.58 s [vector] +++ OK, passed 100 tests.
  9777. 1454.58 s [vector] unfoldr: OK
  9778. 1454.58 s [vector] +++ OK, passed 100 tests.
  9779. 1454.58 s [vector] unfoldrN: OK
  9780. 1454.58 s [vector] +++ OK, passed 100 tests.
  9781. 1454.58 s [vector] unfoldrExactN: OK
  9782. 1454.58 s [vector] +++ OK, passed 100 tests.
  9783. 1454.59 s [vector] unfoldrM: OK
  9784. 1454.59 s [vector] +++ OK, passed 100 tests.
  9785. 1454.59 s [vector] unfoldrNM: OK
  9786. 1454.59 s [vector] +++ OK, passed 100 tests.
  9787. 1454.64 s [vector] unfoldrExactNM: OK (0.04s)
  9788. 1454.65 s [vector] +++ OK, passed 100 tests.
  9789. 1454.65 s [vector] constructN: OK (0.01s)
  9790. 1454.65 s [vector] +++ OK, passed 100 tests.
  9791. 1454.65 s [vector] constructrN: OK
  9792. 1454.65 s [vector] +++ OK, passed 100 tests.
  9793. 1454.65 s [vector] cons: OK
  9794. 1454.65 s [vector] +++ OK, passed 100 tests.
  9795. 1454.65 s [vector] snoc: OK
  9796. 1454.65 s [vector] +++ OK, passed 100 tests.
  9797. 1454.66 s [vector] append: OK
  9798. 1454.66 s [vector] +++ OK, passed 100 tests.
  9799. 1454.73 s [vector] concat: OK (0.06s)
  9800. 1454.73 s [vector] +++ OK, passed 100 tests.
  9801. 1454.73 s [vector] force: OK
  9802. 1454.73 s [vector] +++ OK, passed 100 tests.
  9803. 1454.74 s [vector] upd: OK
  9804. 1454.74 s [vector] +++ OK, passed 100 tests.
  9805. 1454.75 s [vector] accum: OK (0.01s)
  9806. 1454.75 s [vector] +++ OK, passed 100 tests.
  9807. 1454.76 s [vector] reverse: OK
  9808. 1454.76 s [vector] +++ OK, passed 100 tests.
  9809. 1454.77 s [vector] backpermute: OK
  9810. 1454.77 s [vector] +++ OK, passed 100 tests.
  9811. 1454.77 s [vector] map: OK
  9812. 1454.77 s [vector] +++ OK, passed 100 tests.
  9813. 1454.79 s [vector] imap: OK (0.01s)
  9814. 1454.79 s [vector] +++ OK, passed 100 tests.
  9815. 1454.80 s [vector] concatMap: OK (0.01s)
  9816. 1454.81 s [vector] +++ OK, passed 100 tests.
  9817. 1454.81 s [vector] mapM: OK
  9818. 1454.81 s [vector] +++ OK, passed 100 tests.
  9819. 1454.85 s [vector] mapM_: OK (0.05s)
  9820. 1454.85 s [vector] +++ OK, passed 100 tests.
  9821. 1454.87 s [vector] forM: OK
  9822. 1454.87 s [vector] +++ OK, passed 100 tests.
  9823. 1454.91 s [vector] forM_: OK (0.05s)
  9824. 1454.91 s [vector] +++ OK, passed 100 tests.
  9825. 1454.93 s [vector] imapM: OK (0.01s)
  9826. 1454.93 s [vector] +++ OK, passed 100 tests.
  9827. 1455.00 s [vector] imapM_: OK (0.07s)
  9828. 1455.01 s [vector] +++ OK, passed 100 tests.
  9829. 1455.01 s [vector] zipWith: OK
  9830. 1455.01 s [vector] +++ OK, passed 100 tests.
  9831. 1455.01 s [vector] zipWith3: OK
  9832. 1455.01 s [vector] +++ OK, passed 100 tests.
  9833. 1455.02 s [vector] izipWith: OK
  9834. 1455.03 s [vector] +++ OK, passed 100 tests.
  9835. 1455.03 s [vector] izipWith3: OK
  9836. 1455.03 s [vector] +++ OK, passed 100 tests.
  9837. 1455.05 s [vector] izipWithM: OK (0.01s)
  9838. 1455.05 s [vector] +++ OK, passed 100 tests.
  9839. 1455.08 s [vector] izipWithM_: OK (0.04s)
  9840. 1455.09 s [vector] +++ OK, passed 100 tests.
  9841. 1455.09 s [vector] zipWithM: OK
  9842. 1455.09 s [vector] +++ OK, passed 100 tests.
  9843. 1455.13 s [vector] zipWithM_: OK (0.04s)
  9844. 1455.13 s [vector] +++ OK, passed 100 tests.
  9845. 1455.13 s [vector] filter: OK
  9846. 1455.13 s [vector] +++ OK, passed 100 tests.
  9847. 1455.15 s [vector] ifilter: OK
  9848. 1455.15 s [vector] +++ OK, passed 100 tests.
  9849. 1455.22 s [vector] filterM: OK (0.08s)
  9850. 1455.22 s [vector] +++ OK, passed 100 tests.
  9851. 1455.23 s [vector] uniq: OK
  9852. 1455.23 s [vector] +++ OK, passed 100 tests.
  9853. 1455.23 s [vector] mapMaybe: OK
  9854. 1455.23 s [vector] +++ OK, passed 100 tests.
  9855. 1455.23 s [vector] imapMaybe: OK
  9856. 1455.23 s [vector] +++ OK, passed 100 tests.
  9857. 1455.24 s [vector] takeWhile: OK
  9858. 1455.25 s [vector] +++ OK, passed 100 tests.
  9859. 1455.25 s [vector] dropWhile: OK
  9860. 1455.25 s [vector] +++ OK, passed 100 tests.
  9861. 1455.25 s [vector] partition: OK
  9862. 1455.25 s [vector] +++ OK, passed 100 tests.
  9863. 1455.26 s [vector] partitionWith: OK
  9864. 1455.26 s [vector] +++ OK, passed 100 tests.
  9865. 1455.27 s [vector] span: OK
  9866. 1455.27 s [vector] +++ OK, passed 100 tests.
  9867. 1455.27 s [vector] break: OK
  9868. 1455.27 s [vector] +++ OK, passed 100 tests.
  9869. 1455.28 s [vector] spanR: OK
  9870. 1455.28 s [vector] +++ OK, passed 100 tests.
  9871. 1455.28 s [vector] breakR: OK
  9872. 1455.29 s [vector] +++ OK, passed 100 tests.
  9873. 1455.29 s [vector] groupBy: OK
  9874. 1455.29 s [vector] +++ OK, passed 100 tests.
  9875. 1455.30 s [vector] elem: OK
  9876. 1455.30 s [vector] +++ OK, passed 100 tests.
  9877. 1455.30 s [vector] notElem: OK
  9878. 1455.30 s [vector] +++ OK, passed 100 tests.
  9879. 1455.30 s [vector] find: OK
  9880. 1455.30 s [vector] +++ OK, passed 100 tests.
  9881. 1455.30 s [vector] findIndex: OK
  9882. 1455.30 s [vector] +++ OK, passed 100 tests.
  9883. 1455.30 s [vector] findIndexR: OK
  9884. 1455.30 s [vector] +++ OK, passed 100 tests.
  9885. 1455.30 s [vector] findIndices: OK
  9886. 1455.31 s [vector] +++ OK, passed 100 tests.
  9887. 1455.31 s [vector] elemIndex: OK
  9888. 1455.31 s [vector] +++ OK, passed 100 tests.
  9889. 1455.31 s [vector] elemIndices: OK
  9890. 1455.31 s [vector] +++ OK, passed 100 tests.
  9891. 1455.31 s [vector] foldl: OK
  9892. 1455.31 s [vector] +++ OK, passed 100 tests.
  9893. 1455.33 s [vector] foldl1: OK
  9894. 1455.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9895. 1455.33 s [vector] foldl': OK
  9896. 1455.33 s [vector] +++ OK, passed 100 tests.
  9897. 1455.33 s [vector] foldl1': OK
  9898. 1455.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9899. 1455.34 s [vector] foldr: OK
  9900. 1455.34 s [vector] +++ OK, passed 100 tests.
  9901. 1455.35 s [vector] foldr1: OK
  9902. 1455.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9903. 1455.35 s [vector] foldr': OK
  9904. 1455.35 s [vector] +++ OK, passed 100 tests.
  9905. 1455.37 s [vector] foldr1': OK
  9906. 1455.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9907. 1455.37 s [vector] ifoldl: OK (0.01s)
  9908. 1455.37 s [vector] +++ OK, passed 100 tests.
  9909. 1455.39 s [vector] ifoldl': OK (0.01s)
  9910. 1455.39 s [vector] +++ OK, passed 100 tests.
  9911. 1455.41 s [vector] ifoldr: OK (0.02s)
  9912. 1455.41 s [vector] +++ OK, passed 100 tests.
  9913. 1455.43 s [vector] ifoldr': OK (0.02s)
  9914. 1455.43 s [vector] +++ OK, passed 100 tests.
  9915. 1455.44 s [vector] ifoldM: OK (0.02s)
  9916. 1455.44 s [vector] +++ OK, passed 100 tests.
  9917. 1455.45 s [vector] ifoldM': OK (0.01s)
  9918. 1455.45 s [vector] +++ OK, passed 100 tests.
  9919. 1455.51 s [vector] ifoldM_: OK (0.06s)
  9920. 1455.51 s [vector] +++ OK, passed 100 tests.
  9921. 1455.56 s [vector] ifoldM'_: OK (0.06s)
  9922. 1455.56 s [vector] +++ OK, passed 100 tests.
  9923. 1455.56 s [vector] all: OK
  9924. 1455.56 s [vector] +++ OK, passed 100 tests.
  9925. 1455.56 s [vector] any: OK
  9926. 1455.57 s [vector] +++ OK, passed 100 tests.
  9927. 1455.59 s [vector] prescanl: OK (0.01s)
  9928. 1455.59 s [vector] +++ OK, passed 100 tests.
  9929. 1455.59 s [vector] prescanl': OK
  9930. 1455.59 s [vector] +++ OK, passed 100 tests.
  9931. 1455.61 s [vector] postscanl: OK (0.01s)
  9932. 1455.61 s [vector] +++ OK, passed 100 tests.
  9933. 1455.63 s [vector] postscanl': OK (0.02s)
  9934. 1455.63 s [vector] +++ OK, passed 100 tests.
  9935. 1455.64 s [vector] scanl: OK (0.02s)
  9936. 1455.64 s [vector] +++ OK, passed 100 tests.
  9937. 1455.65 s [vector] scanl': OK (0.01s)
  9938. 1455.65 s [vector] +++ OK, passed 100 tests.
  9939. 1455.67 s [vector] scanl1: OK (0.01s)
  9940. 1455.67 s [vector] +++ OK, passed 100 tests.
  9941. 1455.67 s [vector] scanl1': OK
  9942. 1455.67 s [vector] +++ OK, passed 100 tests.
  9943. 1455.69 s [vector] iscanl: OK (0.02s)
  9944. 1455.69 s [vector] +++ OK, passed 100 tests.
  9945. 1455.71 s [vector] iscanl': OK (0.01s)
  9946. 1455.71 s [vector] +++ OK, passed 100 tests.
  9947. 1455.71 s [vector] prescanr: OK
  9948. 1455.71 s [vector] +++ OK, passed 100 tests.
  9949. 1455.71 s [vector] prescanr': OK
  9950. 1455.71 s [vector] +++ OK, passed 100 tests.
  9951. 1455.73 s [vector] postscanr: OK
  9952. 1455.73 s [vector] +++ OK, passed 100 tests.
  9953. 1455.73 s [vector] postscanr': OK
  9954. 1455.73 s [vector] +++ OK, passed 100 tests.
  9955. 1455.75 s [vector] scanr: OK
  9956. 1455.75 s [vector] +++ OK, passed 100 tests.
  9957. 1455.75 s [vector] scanr': OK
  9958. 1455.75 s [vector] +++ OK, passed 100 tests.
  9959. 1455.77 s [vector] scanr1: OK
  9960. 1455.77 s [vector] +++ OK, passed 100 tests.
  9961. 1455.77 s [vector] scanr1': OK
  9962. 1455.77 s [vector] +++ OK, passed 100 tests.
  9963. 1455.79 s [vector] iscanr: OK (0.01s)
  9964. 1455.79 s [vector] +++ OK, passed 100 tests.
  9965. 1455.79 s [vector] iscanr': OK (0.01s)
  9966. 1455.79 s [vector] +++ OK, passed 100 tests.
  9967. 1455.79 s [vector] mut_read: OK
  9968. 1455.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9969. 1455.81 s [vector] mut_write: OK
  9970. 1455.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9971. 1455.81 s [vector] mut_modify: OK
  9972. 1455.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9973. 1455.81 s [vector] mut_generate: OK
  9974. 1455.81 s [vector] +++ OK, passed 100 tests.
  9975. 1455.85 s [vector] mut_generateM: OK (0.03s)
  9976. 1455.85 s [vector] +++ OK, passed 100 tests.
  9977. 1455.93 s [vector] mut_mapM_: OK (0.08s)
  9978. 1455.93 s [vector] +++ OK, passed 100 tests.
  9979. 1456.01 s [vector] mut_imapM_: OK (0.08s)
  9980. 1456.01 s [vector] +++ OK, passed 100 tests.
  9981. 1456.05 s [vector] mut_forM_: OK (0.05s)
  9982. 1456.05 s [vector] +++ OK, passed 100 tests.
  9983. 1456.13 s [vector] mut_iforM_: OK (0.08s)
  9984. 1456.13 s [vector] +++ OK, passed 100 tests.
  9985. 1456.13 s [vector] mut_foldr: OK
  9986. 1456.13 s [vector] +++ OK, passed 100 tests.
  9987. 1456.14 s [vector] mut_foldr': OK
  9988. 1456.14 s [vector] +++ OK, passed 100 tests.
  9989. 1456.15 s [vector] mut_foldl: OK
  9990. 1456.15 s [vector] +++ OK, passed 100 tests.
  9991. 1456.17 s [vector] mut_foldl': OK (0.01s)
  9992. 1456.17 s [vector] +++ OK, passed 100 tests.
  9993. 1456.18 s [vector] mut_ifoldr: OK (0.01s)
  9994. 1456.18 s [vector] +++ OK, passed 100 tests.
  9995. 1456.19 s [vector] mut_ifoldr': OK (0.01s)
  9996. 1456.19 s [vector] +++ OK, passed 100 tests.
  9997. 1456.19 s [vector] mut_ifoldl: OK
  9998. 1456.19 s [vector] +++ OK, passed 100 tests.
  9999. 1456.20 s [vector] mut_ifoldl': OK
  10000. 1456.20 s [vector] +++ OK, passed 100 tests.
  10001. 1456.22 s [vector] mut_foldM: OK
  10002. 1456.23 s [vector] +++ OK, passed 100 tests.
  10003. 1456.23 s [vector] mut_foldM': OK
  10004. 1456.24 s [vector] +++ OK, passed 100 tests.
  10005. 1456.25 s [vector] mut_foldrM: OK
  10006. 1456.25 s [vector] +++ OK, passed 100 tests.
  10007. 1456.25 s [vector] mut_foldrM': OK
  10008. 1456.25 s [vector] +++ OK, passed 100 tests.
  10009. 1456.25 s [vector] mut_ifoldM: OK
  10010. 1456.25 s [vector] +++ OK, passed 100 tests.
  10011. 1456.26 s [vector] mut_ifoldM': OK
  10012. 1456.27 s [vector] +++ OK, passed 100 tests.
  10013. 1456.27 s [vector] mut_ifoldrM: OK (0.01s)
  10014. 1456.27 s [vector] +++ OK, passed 100 tests.
  10015. 1456.27 s [vector] mut_ifoldrM': OK
  10016. 1456.27 s [vector] +++ OK, passed 100 tests.
  10017. 1456.28 s [vector] compare: OK
  10018. 1456.28 s [vector] +++ OK, passed 100 tests.
  10019. 1456.28 s [vector] maximum: OK
  10020. 1456.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10021. 1456.29 s [vector] minimum: OK
  10022. 1456.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10023. 1456.29 s [vector] minIndex: OK
  10024. 1456.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10025. 1456.29 s [vector] maxIndex: OK
  10026. 1456.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10027. 1456.29 s [vector] maximumBy: OK
  10028. 1456.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10029. 1456.29 s [vector] minimumBy: OK
  10030. 1456.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10031. 1456.29 s [vector] maximumOn: OK
  10032. 1456.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10033. 1456.29 s [vector] minimumOn: OK
  10034. 1456.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10035. 1456.30 s [vector] maxIndexBy: OK
  10036. 1456.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10037. 1456.30 s [vector] minIndexBy: OK
  10038. 1456.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10039. 1456.31 s [vector] ListFirstMaxIndexWins: OK
  10040. 1456.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10041. 1456.31 s [vector] FalseListFirstMaxIndexWins: OK
  10042. 1456.31 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10043. 1456.31 s [vector] []
  10044. 1456.31 s [vector] zip: OK
  10045. 1456.31 s [vector] +++ OK, passed 100 tests.
  10046. 1456.31 s [vector] zip3: OK
  10047. 1456.31 s [vector] +++ OK, passed 100 tests.
  10048. 1456.33 s [vector] unzip: OK (0.02s)
  10049. 1456.33 s [vector] +++ OK, passed 100 tests.
  10050. 1456.34 s [vector] unzip3: OK (0.01s)
  10051. 1456.34 s [vector] +++ OK, passed 100 tests.
  10052. 1456.34 s [vector] indexed: OK
  10053. 1456.34 s [vector] +++ OK, passed 100 tests.
  10054. 1456.34 s [vector] update: OK
  10055. 1456.34 s [vector] +++ OK, passed 100 tests.
  10056. 1456.35 s [vector] mempty: OK
  10057. 1456.37 s [vector] +++ OK, passed 100 tests.
  10058. 1456.37 s [vector] mappend: OK
  10059. 1456.37 s [vector] +++ OK, passed 100 tests.
  10060. 1456.43 s [vector] mconcat: OK (0.07s)
  10061. 1456.43 s [vector] +++ OK, passed 100 tests.
  10062. 1456.43 s [vector] glength: OK
  10063. 1456.43 s [vector] +++ OK, passed 100 tests.
  10064. 1456.43 s [vector] unstream
  10065. 1456.43 s [vector] unstream == vunstream (exact): OK
  10066. 1456.43 s [vector] +++ OK, passed 100 tests.
  10067. 1456.44 s [vector] unstream == vunstream (unknown): OK
  10068. 1456.44 s [vector] +++ OK, passed 100 tests.
  10069. 1456.44 s [vector] unstreamR ~= vunstream (exact): OK
  10070. 1456.44 s [vector] +++ OK, passed 100 tests.
  10071. 1456.44 s [vector] unstreamR ~= vunstream (unknown): OK
  10072. 1456.44 s [vector] +++ OK, passed 100 tests.
  10073. 1456.44 s [vector] Data.Vector.Storable.Vector Alignment
  10074. 1456.44 s [vector] Aligned Double: OK
  10075. 1456.44 s [vector] Aligned Int: OK
  10076. 1456.44 s [vector] Regression tests
  10077. 1456.44 s [vector] enumFromTo crash #188
  10078. 1456.44 s [vector] Word8: OK
  10079. 1456.44 s [vector] Word16: OK
  10080. 1456.44 s [vector] Word32: OK
  10081. 1456.44 s [vector] Word64: OK
  10082. 1456.44 s [vector] Word: OK
  10083. 1456.44 s [vector] Int8: OK
  10084. 1456.44 s [vector] Int16: OK
  10085. 1456.44 s [vector] Int32: OK
  10086. 1456.44 s [vector] Int64: OK
  10087. 1456.44 s [vector] Int: OK
  10088. 1456.44 s [vector] Char: OK
  10089. 1456.44 s [vector] Negative tests
  10090. 1456.44 s [vector] slice out of bounds #257
  10091. 1456.44 s [vector] Boxed
  10092. 1456.44 s [vector] Negative ix: OK
  10093. 1456.44 s [vector] Negative size: OK
  10094. 1456.44 s [vector] Negative ix and size: OK
  10095. 1456.44 s [vector] Too large ix: OK
  10096. 1456.44 s [vector] Too large size: OK
  10097. 1456.44 s [vector] Too large ix and size: OK
  10098. 1456.44 s [vector] Overflow: OK
  10099. 1456.44 s [vector] OutOfMemory: OK
  10100. 1456.44 s [vector] Primitive
  10101. 1456.44 s [vector] Negative ix: OK
  10102. 1456.44 s [vector] Negative size: OK
  10103. 1456.44 s [vector] Negative ix and size: OK
  10104. 1456.44 s [vector] Too large ix: OK
  10105. 1456.44 s [vector] Too large size: OK
  10106. 1456.44 s [vector] Too large ix and size: OK
  10107. 1456.44 s [vector] Overflow: OK
  10108. 1456.44 s [vector] OutOfMemory: OK
  10109. 1456.44 s [vector] Storable
  10110. 1456.44 s [vector] Negative ix: OK
  10111. 1456.44 s [vector] Negative size: OK
  10112. 1456.44 s [vector] Negative ix and size: OK
  10113. 1456.44 s [vector] Too large ix: OK
  10114. 1456.44 s [vector] Too large size: OK
  10115. 1456.44 s [vector] Too large ix and size: OK
  10116. 1456.44 s [vector] Overflow: OK
  10117. 1456.44 s [vector] OutOfMemory: OK
  10118. 1456.44 s [vector] Unboxed
  10119. 1456.44 s [vector] Negative ix: OK
  10120. 1456.44 s [vector] Negative size: OK
  10121. 1456.44 s [vector] Negative ix and size: OK
  10122. 1456.44 s [vector] Too large ix: OK
  10123. 1456.44 s [vector] Too large size: OK
  10124. 1456.44 s [vector] Too large ix and size: OK
  10125. 1456.44 s [vector] Overflow: OK
  10126. 1456.44 s [vector] OutOfMemory: OK
  10127. 1456.44 s [vector] take #282
  10128. 1456.44 s [vector] Boxed: OK
  10129. 1456.44 s [vector] Primitive: OK
  10130. 1456.44 s [vector] Storable: OK
  10131. 1456.44 s [vector] Unboxed: OK
  10132. 1456.44 s [vector] Data.Vector
  10133. 1456.44 s [vector] MonadFix: OK
  10134. 1456.44 s [vector] toFromArray: OK
  10135. 1456.44 s [vector] toFromArraySlice: OK
  10136. 1456.45 s [vector] toFromArraySliceUnsafe: OK
  10137. 1456.45 s [vector] toFromMutableArray: OK
  10138. 1456.45 s [vector] Data.Vector.Mutable (Move): OK
  10139. 1456.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10140. 1456.45 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  10141. 1456.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10142. 1456.45 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  10143. 1456.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10144. 1456.45 s [vector] Data.Vector.Storable.Mutable (Move): OK
  10145. 1456.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10146. 1456.47 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  10147. 1456.47 s [vector] +++ OK, passed 100 tests.
  10148. 1456.47 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  10149. 1456.47 s [vector] +++ OK, passed 100 tests.
  10150. 1456.47 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  10151. 1456.47 s [vector] +++ OK, passed 100 tests.
  10152. 1456.47 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  10153. 1456.47 s [vector] +++ OK, passed 100 tests.
  10154. 1456.48 s [vector]
  10155. 1456.48 s [vector] All 2808 tests passed (17.02s)
  10156. 1456.48 s [vector] Test suite vector-tests-O0: PASS
  10157. 1456.48 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  10158. 1456.48 s [vector] Test suite vector-tests-O2: RUNNING...
  10159. 1456.66 s [vector] toplevel
  10160. 1456.66 s [vector] Data.Vector.Fusion.Bundle
  10161. 1456.66 s [vector] fromList.toList == id: OK
  10162. 1456.66 s [vector] +++ OK, passed 100 tests.
  10163. 1456.66 s [vector] toList.fromList == id: OK
  10164. 1456.66 s [vector] +++ OK, passed 100 tests.
  10165. 1456.66 s [vector] eq: OK
  10166. 1456.66 s [vector] +++ OK, passed 100 tests.
  10167. 1456.66 s [vector] length: OK
  10168. 1456.66 s [vector] +++ OK, passed 100 tests.
  10169. 1456.66 s [vector] null: OK
  10170. 1456.66 s [vector] +++ OK, passed 100 tests.
  10171. 1456.66 s [vector] empty: OK
  10172. 1456.66 s [vector] +++ OK, passed 100 tests.
  10173. 1456.66 s [vector] singleton: OK
  10174. 1456.66 s [vector] +++ OK, passed 100 tests.
  10175. 1456.66 s [vector] replicate: OK
  10176. 1456.66 s [vector] +++ OK, passed 100 tests.
  10177. 1456.66 s [vector] cons: OK
  10178. 1456.66 s [vector] +++ OK, passed 100 tests.
  10179. 1456.66 s [vector] snoc: OK
  10180. 1456.66 s [vector] +++ OK, passed 100 tests.
  10181. 1456.66 s [vector] append: OK
  10182. 1456.66 s [vector] +++ OK, passed 100 tests.
  10183. 1456.66 s [vector] head: OK
  10184. 1456.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10185. 1456.66 s [vector] last: OK
  10186. 1456.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10187. 1456.66 s [vector] index: OK
  10188. 1456.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10189. 1456.66 s [vector] extract: OK
  10190. 1456.66 s [vector] +++ OK, passed 100 tests.
  10191. 1456.66 s [vector] init: OK
  10192. 1456.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10193. 1456.66 s [vector] tail: OK
  10194. 1456.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10195. 1456.66 s [vector] take: OK
  10196. 1456.66 s [vector] +++ OK, passed 100 tests.
  10197. 1456.66 s [vector] drop: OK
  10198. 1456.66 s [vector] +++ OK, passed 100 tests.
  10199. 1456.66 s [vector] map: OK
  10200. 1456.66 s [vector] +++ OK, passed 100 tests.
  10201. 1456.66 s [vector] zipWith: OK
  10202. 1456.66 s [vector] +++ OK, passed 100 tests.
  10203. 1456.66 s [vector] zipWith3: OK
  10204. 1456.66 s [vector] +++ OK, passed 100 tests.
  10205. 1456.66 s [vector] filter: OK
  10206. 1456.66 s [vector] +++ OK, passed 100 tests.
  10207. 1456.66 s [vector] takeWhile: OK
  10208. 1456.66 s [vector] +++ OK, passed 100 tests.
  10209. 1456.66 s [vector] dropWhile: OK
  10210. 1456.66 s [vector] +++ OK, passed 100 tests.
  10211. 1456.66 s [vector] elem: OK
  10212. 1456.66 s [vector] +++ OK, passed 100 tests.
  10213. 1456.66 s [vector] notElem: OK
  10214. 1456.66 s [vector] +++ OK, passed 100 tests.
  10215. 1456.66 s [vector] find: OK
  10216. 1456.66 s [vector] +++ OK, passed 100 tests.
  10217. 1456.66 s [vector] findIndex: OK
  10218. 1456.66 s [vector] +++ OK, passed 100 tests.
  10219. 1456.66 s [vector] foldl: OK
  10220. 1456.66 s [vector] +++ OK, passed 100 tests.
  10221. 1456.66 s [vector] foldl1: OK
  10222. 1456.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10223. 1456.66 s [vector] foldl': OK
  10224. 1456.66 s [vector] +++ OK, passed 100 tests.
  10225. 1456.66 s [vector] foldl1': OK
  10226. 1456.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10227. 1456.66 s [vector] foldr: OK
  10228. 1456.66 s [vector] +++ OK, passed 100 tests.
  10229. 1456.66 s [vector] foldr1: OK
  10230. 1456.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10231. 1456.66 s [vector] prescanl: OK
  10232. 1456.66 s [vector] +++ OK, passed 100 tests.
  10233. 1456.66 s [vector] prescanl': OK
  10234. 1456.66 s [vector] +++ OK, passed 100 tests.
  10235. 1456.66 s [vector] postscanl: OK
  10236. 1456.66 s [vector] +++ OK, passed 100 tests.
  10237. 1456.66 s [vector] postscanl': OK
  10238. 1456.66 s [vector] +++ OK, passed 100 tests.
  10239. 1456.66 s [vector] scanl: OK
  10240. 1456.66 s [vector] +++ OK, passed 100 tests.
  10241. 1456.66 s [vector] scanl': OK
  10242. 1456.66 s [vector] +++ OK, passed 100 tests.
  10243. 1456.66 s [vector] scanl1: OK
  10244. 1456.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10245. 1456.66 s [vector] scanl1': OK
  10246. 1456.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10247. 1456.66 s [vector] concatMap: OK
  10248. 1456.66 s [vector] +++ OK, passed 100 tests.
  10249. 1456.66 s [vector] unfoldr: OK
  10250. 1456.66 s [vector] +++ OK, passed 100 tests.
  10251. 1456.66 s [vector] and: OK
  10252. 1456.66 s [vector] +++ OK, passed 100 tests.
  10253. 1456.66 s [vector] or: OK
  10254. 1456.66 s [vector] +++ OK, passed 100 tests.
  10255. 1456.66 s [vector] Tests.Vector.Boxed
  10256. 1456.66 s [vector] Bool
  10257. 1456.66 s [vector] fromList.toList == id: OK
  10258. 1456.66 s [vector] +++ OK, passed 100 tests.
  10259. 1456.66 s [vector] toList.fromList == id: OK
  10260. 1456.66 s [vector] +++ OK, passed 100 tests.
  10261. 1456.66 s [vector] unstream.stream == id: OK
  10262. 1456.66 s [vector] +++ OK, passed 100 tests.
  10263. 1456.66 s [vector] stream.unstream == id: OK
  10264. 1456.66 s [vector] +++ OK, passed 100 tests.
  10265. 1456.66 s [vector] eq: OK
  10266. 1456.66 s [vector] +++ OK, passed 100 tests.
  10267. 1456.66 s [vector] length: OK
  10268. 1456.66 s [vector] +++ OK, passed 100 tests.
  10269. 1456.66 s [vector] null: OK
  10270. 1456.66 s [vector] +++ OK, passed 100 tests.
  10271. 1456.66 s [vector] index: OK
  10272. 1456.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10273. 1456.66 s [vector] safeIndex: OK
  10274. 1456.66 s [vector] +++ OK, passed 100 tests.
  10275. 1456.66 s [vector] head: OK
  10276. 1456.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10277. 1456.66 s [vector] last: OK
  10278. 1456.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10279. 1456.66 s [vector] unsafeIndex: OK
  10280. 1456.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10281. 1456.67 s [vector] unsafeHead: OK
  10282. 1456.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10283. 1456.67 s [vector] unsafeLast: OK
  10284. 1456.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10285. 1456.67 s [vector] slice: OK
  10286. 1456.67 s [vector] +++ OK, passed 100 tests.
  10287. 1456.67 s [vector] init: OK
  10288. 1456.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10289. 1456.67 s [vector] tail: OK
  10290. 1456.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10291. 1456.67 s [vector] take: OK
  10292. 1456.67 s [vector] +++ OK, passed 100 tests.
  10293. 1456.67 s [vector] drop: OK
  10294. 1456.67 s [vector] +++ OK, passed 100 tests.
  10295. 1456.67 s [vector] splitAt: OK
  10296. 1456.67 s [vector] +++ OK, passed 100 tests.
  10297. 1456.67 s [vector] empty: OK
  10298. 1456.67 s [vector] +++ OK, passed 100 tests.
  10299. 1456.67 s [vector] singleton: OK
  10300. 1456.67 s [vector] +++ OK, passed 100 tests.
  10301. 1456.67 s [vector] replicate: OK
  10302. 1456.67 s [vector] +++ OK, passed 100 tests.
  10303. 1456.67 s [vector] generate: OK
  10304. 1456.67 s [vector] +++ OK, passed 100 tests.
  10305. 1456.67 s [vector] iterateN: OK
  10306. 1456.67 s [vector] +++ OK, passed 100 tests.
  10307. 1456.67 s [vector] iterateNM: OK (0.02s)
  10308. 1456.68 s [vector] +++ OK, passed 100 tests.
  10309. 1456.68 s [vector] generateM: OK (0.02s)
  10310. 1456.68 s [vector] +++ OK, passed 100 tests.
  10311. 1456.68 s [vector] replicateM: OK
  10312. 1456.68 s [vector] +++ OK, passed 100 tests.
  10313. 1456.68 s [vector] create: OK
  10314. 1456.68 s [vector] +++ OK, passed 100 tests.
  10315. 1456.68 s [vector] createT: OK
  10316. 1456.68 s [vector] +++ OK, passed 100 tests.
  10317. 1456.68 s [vector] unfoldr: OK
  10318. 1456.68 s [vector] +++ OK, passed 100 tests.
  10319. 1456.68 s [vector] unfoldrN: OK
  10320. 1456.68 s [vector] +++ OK, passed 100 tests.
  10321. 1456.68 s [vector] unfoldrExactN: OK
  10322. 1456.68 s [vector] +++ OK, passed 100 tests.
  10323. 1456.68 s [vector] unfoldrM: OK
  10324. 1456.68 s [vector] +++ OK, passed 100 tests.
  10325. 1456.68 s [vector] unfoldrNM: OK
  10326. 1456.68 s [vector] +++ OK, passed 100 tests.
  10327. 1456.68 s [vector] unfoldrExactNM: OK (0.01s)
  10328. 1456.68 s [vector] +++ OK, passed 100 tests.
  10329. 1456.68 s [vector] constructN: OK
  10330. 1456.68 s [vector] +++ OK, passed 100 tests.
  10331. 1456.68 s [vector] constructrN: OK
  10332. 1456.68 s [vector] +++ OK, passed 100 tests.
  10333. 1456.68 s [vector] cons: OK
  10334. 1456.68 s [vector] +++ OK, passed 100 tests.
  10335. 1456.68 s [vector] snoc: OK
  10336. 1456.68 s [vector] +++ OK, passed 100 tests.
  10337. 1456.68 s [vector] append: OK (0.01s)
  10338. 1456.68 s [vector] +++ OK, passed 100 tests.
  10339. 1456.68 s [vector] concat: OK (0.01s)
  10340. 1456.68 s [vector] +++ OK, passed 100 tests.
  10341. 1456.68 s [vector] force: OK
  10342. 1456.68 s [vector] +++ OK, passed 100 tests.
  10343. 1456.68 s [vector] upd: OK
  10344. 1456.68 s [vector] +++ OK, passed 100 tests.
  10345. 1456.68 s [vector] accum: OK
  10346. 1456.68 s [vector] +++ OK, passed 100 tests.
  10347. 1456.68 s [vector] reverse: OK
  10348. 1456.68 s [vector] +++ OK, passed 100 tests.
  10349. 1456.68 s [vector] backpermute: OK
  10350. 1456.68 s [vector] +++ OK, passed 100 tests.
  10351. 1456.68 s [vector] map: OK
  10352. 1456.68 s [vector] +++ OK, passed 100 tests.
  10353. 1456.68 s [vector] imap: OK
  10354. 1456.68 s [vector] +++ OK, passed 100 tests.
  10355. 1456.68 s [vector] concatMap: OK
  10356. 1456.68 s [vector] +++ OK, passed 100 tests.
  10357. 1456.68 s [vector] mapM: OK
  10358. 1456.70 s [vector] +++ OK, passed 100 tests.
  10359. 1456.70 s [vector] mapM_: OK (0.01s)
  10360. 1456.70 s [vector] +++ OK, passed 100 tests.
  10361. 1456.70 s [vector] forM: OK
  10362. 1456.70 s [vector] +++ OK, passed 100 tests.
  10363. 1456.71 s [vector] forM_: OK (0.01s)
  10364. 1456.71 s [vector] +++ OK, passed 100 tests.
  10365. 1456.72 s [vector] imapM: OK
  10366. 1456.72 s [vector] +++ OK, passed 100 tests.
  10367. 1456.74 s [vector] imapM_: OK (0.02s)
  10368. 1456.74 s [vector] +++ OK, passed 100 tests.
  10369. 1456.74 s [vector] zipWith: OK
  10370. 1456.74 s [vector] +++ OK, passed 100 tests.
  10371. 1456.74 s [vector] zipWith3: OK
  10372. 1456.74 s [vector] +++ OK, passed 100 tests.
  10373. 1456.75 s [vector] izipWith: OK
  10374. 1456.75 s [vector] +++ OK, passed 100 tests.
  10375. 1456.75 s [vector] izipWith3: OK
  10376. 1456.75 s [vector] +++ OK, passed 100 tests.
  10377. 1456.76 s [vector] izipWithM: OK
  10378. 1456.76 s [vector] +++ OK, passed 100 tests.
  10379. 1456.77 s [vector] izipWithM_: OK (0.02s)
  10380. 1456.77 s [vector] +++ OK, passed 100 tests.
  10381. 1456.78 s [vector] zipWithM: OK
  10382. 1456.78 s [vector] +++ OK, passed 100 tests.
  10383. 1456.78 s [vector] zipWithM_: OK (0.01s)
  10384. 1456.78 s [vector] +++ OK, passed 100 tests.
  10385. 1456.79 s [vector] filter: OK
  10386. 1456.80 s [vector] +++ OK, passed 100 tests.
  10387. 1456.81 s [vector] ifilter: OK
  10388. 1456.81 s [vector] +++ OK, passed 100 tests.
  10389. 1456.81 s [vector] filterM: OK (0.02s)
  10390. 1456.81 s [vector] +++ OK, passed 100 tests.
  10391. 1456.81 s [vector] uniq: OK
  10392. 1456.81 s [vector] +++ OK, passed 100 tests.
  10393. 1456.81 s [vector] mapMaybe: OK
  10394. 1456.81 s [vector] +++ OK, passed 100 tests.
  10395. 1456.81 s [vector] imapMaybe: OK
  10396. 1456.81 s [vector] +++ OK, passed 100 tests.
  10397. 1456.81 s [vector] takeWhile: OK
  10398. 1456.81 s [vector] +++ OK, passed 100 tests.
  10399. 1456.82 s [vector] dropWhile: OK
  10400. 1456.82 s [vector] +++ OK, passed 100 tests.
  10401. 1456.82 s [vector] partition: OK
  10402. 1456.82 s [vector] +++ OK, passed 100 tests.
  10403. 1456.82 s [vector] partitionWith: OK
  10404. 1456.82 s [vector] +++ OK, passed 100 tests.
  10405. 1456.82 s [vector] span: OK
  10406. 1456.82 s [vector] +++ OK, passed 100 tests.
  10407. 1456.82 s [vector] break: OK
  10408. 1456.82 s [vector] +++ OK, passed 100 tests.
  10409. 1456.82 s [vector] spanR: OK
  10410. 1456.82 s [vector] +++ OK, passed 100 tests.
  10411. 1456.82 s [vector] breakR: OK
  10412. 1456.82 s [vector] +++ OK, passed 100 tests.
  10413. 1456.82 s [vector] groupBy: OK
  10414. 1456.82 s [vector] +++ OK, passed 100 tests.
  10415. 1456.82 s [vector] elem: OK
  10416. 1456.82 s [vector] +++ OK, passed 100 tests.
  10417. 1456.82 s [vector] notElem: OK
  10418. 1456.82 s [vector] +++ OK, passed 100 tests.
  10419. 1456.82 s [vector] find: OK
  10420. 1456.82 s [vector] +++ OK, passed 100 tests.
  10421. 1456.82 s [vector] findIndex: OK
  10422. 1456.82 s [vector] +++ OK, passed 100 tests.
  10423. 1456.82 s [vector] findIndexR: OK
  10424. 1456.83 s [vector] +++ OK, passed 100 tests.
  10425. 1456.83 s [vector] findIndices: OK
  10426. 1456.83 s [vector] +++ OK, passed 100 tests.
  10427. 1456.83 s [vector] elemIndex: OK
  10428. 1456.83 s [vector] +++ OK, passed 100 tests.
  10429. 1456.83 s [vector] elemIndices: OK
  10430. 1456.83 s [vector] +++ OK, passed 100 tests.
  10431. 1456.83 s [vector] foldl: OK
  10432. 1456.83 s [vector] +++ OK, passed 100 tests.
  10433. 1456.83 s [vector] foldl1: OK
  10434. 1456.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10435. 1456.83 s [vector] foldl': OK
  10436. 1456.83 s [vector] +++ OK, passed 100 tests.
  10437. 1456.83 s [vector] foldl1': OK
  10438. 1456.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10439. 1456.83 s [vector] foldr: OK
  10440. 1456.84 s [vector] +++ OK, passed 100 tests.
  10441. 1456.84 s [vector] foldr1: OK
  10442. 1456.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10443. 1456.84 s [vector] foldr': OK
  10444. 1456.84 s [vector] +++ OK, passed 100 tests.
  10445. 1456.84 s [vector] foldr1': OK
  10446. 1456.85 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10447. 1456.85 s [vector] ifoldl: OK
  10448. 1456.85 s [vector] +++ OK, passed 100 tests.
  10449. 1456.86 s [vector] ifoldl': OK
  10450. 1456.86 s [vector] +++ OK, passed 100 tests.
  10451. 1456.86 s [vector] ifoldr: OK
  10452. 1456.86 s [vector] +++ OK, passed 100 tests.
  10453. 1456.86 s [vector] ifoldr': OK
  10454. 1456.86 s [vector] +++ OK, passed 100 tests.
  10455. 1456.87 s [vector] ifoldM: OK
  10456. 1456.87 s [vector] +++ OK, passed 100 tests.
  10457. 1456.87 s [vector] ifoldM': OK
  10458. 1456.87 s [vector] +++ OK, passed 100 tests.
  10459. 1456.90 s [vector] ifoldM_: OK (0.02s)
  10460. 1456.90 s [vector] +++ OK, passed 100 tests.
  10461. 1456.91 s [vector] ifoldM'_: OK (0.02s)
  10462. 1456.91 s [vector] +++ OK, passed 100 tests.
  10463. 1456.91 s [vector] all: OK
  10464. 1456.91 s [vector] +++ OK, passed 100 tests.
  10465. 1456.91 s [vector] any: OK
  10466. 1456.91 s [vector] +++ OK, passed 100 tests.
  10467. 1456.92 s [vector] prescanl: OK
  10468. 1456.92 s [vector] +++ OK, passed 100 tests.
  10469. 1456.92 s [vector] prescanl': OK
  10470. 1456.92 s [vector] +++ OK, passed 100 tests.
  10471. 1456.92 s [vector] postscanl: OK
  10472. 1456.92 s [vector] +++ OK, passed 100 tests.
  10473. 1456.92 s [vector] postscanl': OK
  10474. 1456.96 s [vector] +++ OK, passed 100 tests.
  10475. 1456.96 s [vector] scanl: OK (0.02s)
  10476. 1456.96 s [vector] +++ OK, passed 100 tests.
  10477. 1456.96 s [vector] scanl': OK
  10478. 1456.96 s [vector] +++ OK, passed 100 tests.
  10479. 1456.96 s [vector] scanl1: OK
  10480. 1456.96 s [vector] +++ OK, passed 100 tests.
  10481. 1456.96 s [vector] scanl1': OK
  10482. 1456.96 s [vector] +++ OK, passed 100 tests.
  10483. 1456.96 s [vector] iscanl: OK
  10484. 1456.96 s [vector] +++ OK, passed 100 tests.
  10485. 1456.96 s [vector] iscanl': OK
  10486. 1456.96 s [vector] +++ OK, passed 100 tests.
  10487. 1456.97 s [vector] prescanr: OK
  10488. 1456.97 s [vector] +++ OK, passed 100 tests.
  10489. 1456.97 s [vector] prescanr': OK
  10490. 1456.97 s [vector] +++ OK, passed 100 tests.
  10491. 1456.97 s [vector] postscanr: OK
  10492. 1456.97 s [vector] +++ OK, passed 100 tests.
  10493. 1456.98 s [vector] postscanr': OK
  10494. 1456.98 s [vector] +++ OK, passed 100 tests.
  10495. 1456.98 s [vector] scanr: OK
  10496. 1456.98 s [vector] +++ OK, passed 100 tests.
  10497. 1456.98 s [vector] scanr': OK
  10498. 1456.98 s [vector] +++ OK, passed 100 tests.
  10499. 1456.98 s [vector] scanr1: OK
  10500. 1456.98 s [vector] +++ OK, passed 100 tests.
  10501. 1456.98 s [vector] scanr1': OK
  10502. 1456.98 s [vector] +++ OK, passed 100 tests.
  10503. 1456.98 s [vector] iscanr: OK
  10504. 1456.99 s [vector] +++ OK, passed 100 tests.
  10505. 1456.99 s [vector] iscanr': OK
  10506. 1456.99 s [vector] +++ OK, passed 100 tests.
  10507. 1456.99 s [vector] mut_read: OK
  10508. 1456.99 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10509. 1456.99 s [vector] mut_write: OK
  10510. 1456.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10511. 1456.99 s [vector] mut_modify: OK
  10512. 1456.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10513. 1456.99 s [vector] mut_generate: OK
  10514. 1456.99 s [vector] +++ OK, passed 100 tests.
  10515. 1457.00 s [vector] mut_generateM: OK
  10516. 1457.00 s [vector] +++ OK, passed 100 tests.
  10517. 1457.00 s [vector] mut_mapM_: OK
  10518. 1457.01 s [vector] +++ OK, passed 100 tests.
  10519. 1457.02 s [vector] mut_imapM_: OK (0.01s)
  10520. 1457.02 s [vector] +++ OK, passed 100 tests.
  10521. 1457.04 s [vector] mut_forM_: OK (0.01s)
  10522. 1457.04 s [vector] +++ OK, passed 100 tests.
  10523. 1457.04 s [vector] mut_iforM_: OK (0.01s)
  10524. 1457.04 s [vector] +++ OK, passed 100 tests.
  10525. 1457.04 s [vector] mut_foldr: OK
  10526. 1457.04 s [vector] +++ OK, passed 100 tests.
  10527. 1457.04 s [vector] mut_foldr': OK
  10528. 1457.04 s [vector] +++ OK, passed 100 tests.
  10529. 1457.04 s [vector] mut_foldl: OK
  10530. 1457.04 s [vector] +++ OK, passed 100 tests.
  10531. 1457.04 s [vector] mut_foldl': OK
  10532. 1457.04 s [vector] +++ OK, passed 100 tests.
  10533. 1457.04 s [vector] mut_ifoldr: OK
  10534. 1457.04 s [vector] +++ OK, passed 100 tests.
  10535. 1457.05 s [vector] mut_ifoldr': OK
  10536. 1457.05 s [vector] +++ OK, passed 100 tests.
  10537. 1457.05 s [vector] mut_ifoldl: OK
  10538. 1457.05 s [vector] +++ OK, passed 100 tests.
  10539. 1457.05 s [vector] mut_ifoldl': OK
  10540. 1457.05 s [vector] +++ OK, passed 100 tests.
  10541. 1457.05 s [vector] mut_foldM: OK
  10542. 1457.05 s [vector] +++ OK, passed 100 tests.
  10543. 1457.05 s [vector] mut_foldM': OK
  10544. 1457.05 s [vector] +++ OK, passed 100 tests.
  10545. 1457.05 s [vector] mut_foldrM: OK
  10546. 1457.05 s [vector] +++ OK, passed 100 tests.
  10547. 1457.05 s [vector] mut_foldrM': OK
  10548. 1457.05 s [vector] +++ OK, passed 100 tests.
  10549. 1457.06 s [vector] mut_ifoldM: OK
  10550. 1457.06 s [vector] +++ OK, passed 100 tests.
  10551. 1457.06 s [vector] mut_ifoldM': OK
  10552. 1457.06 s [vector] +++ OK, passed 100 tests.
  10553. 1457.06 s [vector] mut_ifoldrM: OK
  10554. 1457.06 s [vector] +++ OK, passed 100 tests.
  10555. 1457.06 s [vector] mut_ifoldrM': OK
  10556. 1457.06 s [vector] +++ OK, passed 100 tests.
  10557. 1457.06 s [vector] compare: OK
  10558. 1457.06 s [vector] +++ OK, passed 100 tests.
  10559. 1457.06 s [vector] maximum: OK
  10560. 1457.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10561. 1457.06 s [vector] minimum: OK
  10562. 1457.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10563. 1457.06 s [vector] minIndex: OK
  10564. 1457.06 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10565. 1457.06 s [vector] maxIndex: OK
  10566. 1457.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10567. 1457.07 s [vector] maximumBy: OK
  10568. 1457.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10569. 1457.07 s [vector] minimumBy: OK
  10570. 1457.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10571. 1457.07 s [vector] maximumOn: OK
  10572. 1457.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10573. 1457.07 s [vector] minimumOn: OK
  10574. 1457.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10575. 1457.07 s [vector] maxIndexBy: OK
  10576. 1457.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10577. 1457.07 s [vector] minIndexBy: OK
  10578. 1457.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10579. 1457.07 s [vector] ListFirstMaxIndexWins: OK
  10580. 1457.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10581. 1457.07 s [vector] FalseListFirstMaxIndexWins: OK
  10582. 1457.07 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10583. 1457.07 s [vector] []
  10584. 1457.07 s [vector] zip: OK
  10585. 1457.07 s [vector] +++ OK, passed 100 tests.
  10586. 1457.07 s [vector] zip3: OK
  10587. 1457.07 s [vector] +++ OK, passed 100 tests.
  10588. 1457.07 s [vector] unzip: OK
  10589. 1457.07 s [vector] +++ OK, passed 100 tests.
  10590. 1457.08 s [vector] unzip3: OK
  10591. 1457.08 s [vector] +++ OK, passed 100 tests.
  10592. 1457.08 s [vector] indexed: OK
  10593. 1457.08 s [vector] +++ OK, passed 100 tests.
  10594. 1457.08 s [vector] update: OK
  10595. 1457.09 s [vector] +++ OK, passed 100 tests.
  10596. 1457.09 s [vector] concat: OK
  10597. 1457.09 s [vector] +++ OK, passed 100 tests.
  10598. 1457.09 s [vector] mempty: OK
  10599. 1457.09 s [vector] +++ OK, passed 100 tests.
  10600. 1457.09 s [vector] mappend: OK
  10601. 1457.09 s [vector] +++ OK, passed 100 tests.
  10602. 1457.09 s [vector] mconcat: OK
  10603. 1457.09 s [vector] +++ OK, passed 100 tests.
  10604. 1457.09 s [vector] fmap: OK
  10605. 1457.09 s [vector] +++ OK, passed 100 tests.
  10606. 1457.10 s [vector] return: OK
  10607. 1457.10 s [vector] +++ OK, passed 100 tests.
  10608. 1457.10 s [vector] bind: OK (0.01s)
  10609. 1457.10 s [vector] +++ OK, passed 100 tests.
  10610. 1457.10 s [vector] mzip: OK
  10611. 1457.10 s [vector] +++ OK, passed 100 tests.
  10612. 1457.11 s [vector] munzip: OK
  10613. 1457.11 s [vector] +++ OK, passed 100 tests.
  10614. 1457.11 s [vector] applicative_pure: OK
  10615. 1457.11 s [vector] +++ OK, passed 100 tests.
  10616. 1457.12 s [vector] applicative_appl: OK
  10617. 1457.12 s [vector] +++ OK, passed 100 tests.
  10618. 1457.12 s [vector] alternative_empty: OK
  10619. 1457.12 s [vector] +++ OK, passed 100 tests.
  10620. 1457.13 s [vector] alternative_or: OK
  10621. 1457.13 s [vector] +++ OK, passed 100 tests.
  10622. 1457.18 s [vector] sequence: OK (0.05s)
  10623. 1457.18 s [vector] +++ OK, passed 100 tests.
  10624. 1457.18 s [vector] sequence_: OK
  10625. 1457.18 s [vector] +++ OK, passed 100 tests.
  10626. 1457.18 s [vector] glength: OK
  10627. 1457.18 s [vector] +++ OK, passed 100 tests.
  10628. 1457.18 s [vector] and: OK
  10629. 1457.18 s [vector] +++ OK, passed 100 tests.
  10630. 1457.18 s [vector] or: OK
  10631. 1457.18 s [vector] +++ OK, passed 100 tests.
  10632. 1457.18 s [vector] Int
  10633. 1457.18 s [vector] fromList.toList == id: OK
  10634. 1457.18 s [vector] +++ OK, passed 100 tests.
  10635. 1457.18 s [vector] toList.fromList == id: OK
  10636. 1457.18 s [vector] +++ OK, passed 100 tests.
  10637. 1457.18 s [vector] unstream.stream == id: OK
  10638. 1457.18 s [vector] +++ OK, passed 100 tests.
  10639. 1457.18 s [vector] stream.unstream == id: OK
  10640. 1457.18 s [vector] +++ OK, passed 100 tests.
  10641. 1457.18 s [vector] eq: OK
  10642. 1457.18 s [vector] +++ OK, passed 100 tests.
  10643. 1457.18 s [vector] length: OK
  10644. 1457.18 s [vector] +++ OK, passed 100 tests.
  10645. 1457.18 s [vector] null: OK
  10646. 1457.18 s [vector] +++ OK, passed 100 tests.
  10647. 1457.18 s [vector] index: OK
  10648. 1457.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10649. 1457.18 s [vector] safeIndex: OK
  10650. 1457.18 s [vector] +++ OK, passed 100 tests.
  10651. 1457.18 s [vector] head: OK
  10652. 1457.18 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10653. 1457.19 s [vector] last: OK
  10654. 1457.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10655. 1457.19 s [vector] unsafeIndex: OK
  10656. 1457.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10657. 1457.19 s [vector] unsafeHead: OK
  10658. 1457.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10659. 1457.19 s [vector] unsafeLast: OK
  10660. 1457.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10661. 1457.19 s [vector] slice: OK
  10662. 1457.20 s [vector] +++ OK, passed 100 tests.
  10663. 1457.20 s [vector] init: OK
  10664. 1457.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10665. 1457.20 s [vector] tail: OK
  10666. 1457.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10667. 1457.20 s [vector] take: OK
  10668. 1457.20 s [vector] +++ OK, passed 100 tests.
  10669. 1457.20 s [vector] drop: OK
  10670. 1457.20 s [vector] +++ OK, passed 100 tests.
  10671. 1457.20 s [vector] splitAt: OK
  10672. 1457.20 s [vector] +++ OK, passed 100 tests.
  10673. 1457.20 s [vector] empty: OK
  10674. 1457.20 s [vector] +++ OK, passed 100 tests.
  10675. 1457.20 s [vector] singleton: OK
  10676. 1457.20 s [vector] +++ OK, passed 100 tests.
  10677. 1457.20 s [vector] replicate: OK
  10678. 1457.20 s [vector] +++ OK, passed 100 tests.
  10679. 1457.20 s [vector] generate: OK
  10680. 1457.20 s [vector] +++ OK, passed 100 tests.
  10681. 1457.20 s [vector] iterateN: OK
  10682. 1457.20 s [vector] +++ OK, passed 100 tests.
  10683. 1457.20 s [vector] iterateNM: OK (0.01s)
  10684. 1457.20 s [vector] +++ OK, passed 100 tests.
  10685. 1457.22 s [vector] generateM: OK (0.02s)
  10686. 1457.22 s [vector] +++ OK, passed 100 tests.
  10687. 1457.23 s [vector] replicateM: OK
  10688. 1457.23 s [vector] +++ OK, passed 100 tests.
  10689. 1457.23 s [vector] create: OK
  10690. 1457.23 s [vector] +++ OK, passed 100 tests.
  10691. 1457.23 s [vector] createT: OK
  10692. 1457.23 s [vector] +++ OK, passed 100 tests.
  10693. 1457.23 s [vector] unfoldr: OK
  10694. 1457.23 s [vector] +++ OK, passed 100 tests.
  10695. 1457.24 s [vector] unfoldrN: OK
  10696. 1457.24 s [vector] +++ OK, passed 100 tests.
  10697. 1457.24 s [vector] unfoldrExactN: OK
  10698. 1457.24 s [vector] +++ OK, passed 100 tests.
  10699. 1457.24 s [vector] unfoldrM: OK
  10700. 1457.24 s [vector] +++ OK, passed 100 tests.
  10701. 1457.24 s [vector] unfoldrNM: OK
  10702. 1457.24 s [vector] +++ OK, passed 100 tests.
  10703. 1457.27 s [vector] unfoldrExactNM: OK (0.02s)
  10704. 1457.27 s [vector] +++ OK, passed 100 tests.
  10705. 1457.27 s [vector] constructN: OK
  10706. 1457.27 s [vector] +++ OK, passed 100 tests.
  10707. 1457.27 s [vector] constructrN: OK
  10708. 1457.27 s [vector] +++ OK, passed 100 tests.
  10709. 1457.27 s [vector] cons: OK
  10710. 1457.27 s [vector] +++ OK, passed 100 tests.
  10711. 1457.27 s [vector] snoc: OK
  10712. 1457.27 s [vector] +++ OK, passed 100 tests.
  10713. 1457.28 s [vector] append: OK
  10714. 1457.28 s [vector] +++ OK, passed 100 tests.
  10715. 1457.28 s [vector] concat: OK (0.01s)
  10716. 1457.28 s [vector] +++ OK, passed 100 tests.
  10717. 1457.29 s [vector] force: OK
  10718. 1457.29 s [vector] +++ OK, passed 100 tests.
  10719. 1457.29 s [vector] upd: OK
  10720. 1457.29 s [vector] +++ OK, passed 100 tests.
  10721. 1457.29 s [vector] accum: OK
  10722. 1457.29 s [vector] +++ OK, passed 100 tests.
  10723. 1457.29 s [vector] reverse: OK
  10724. 1457.29 s [vector] +++ OK, passed 100 tests.
  10725. 1457.29 s [vector] backpermute: OK
  10726. 1457.29 s [vector] +++ OK, passed 100 tests.
  10727. 1457.29 s [vector] map: OK
  10728. 1457.30 s [vector] +++ OK, passed 100 tests.
  10729. 1457.30 s [vector] imap: OK
  10730. 1457.30 s [vector] +++ OK, passed 100 tests.
  10731. 1457.30 s [vector] concatMap: OK
  10732. 1457.30 s [vector] +++ OK, passed 100 tests.
  10733. 1457.30 s [vector] mapM: OK
  10734. 1457.30 s [vector] +++ OK, passed 100 tests.
  10735. 1457.31 s [vector] mapM_: OK (0.02s)
  10736. 1457.31 s [vector] +++ OK, passed 100 tests.
  10737. 1457.32 s [vector] forM: OK
  10738. 1457.33 s [vector] +++ OK, passed 100 tests.
  10739. 1457.34 s [vector] forM_: OK (0.02s)
  10740. 1457.34 s [vector] +++ OK, passed 100 tests.
  10741. 1457.34 s [vector] imapM: OK
  10742. 1457.34 s [vector] +++ OK, passed 100 tests.
  10743. 1457.36 s [vector] imapM_: OK (0.02s)
  10744. 1457.36 s [vector] +++ OK, passed 100 tests.
  10745. 1457.36 s [vector] zipWith: OK
  10746. 1457.36 s [vector] +++ OK, passed 100 tests.
  10747. 1457.37 s [vector] zipWith3: OK
  10748. 1457.37 s [vector] +++ OK, passed 100 tests.
  10749. 1457.37 s [vector] izipWith: OK
  10750. 1457.37 s [vector] +++ OK, passed 100 tests.
  10751. 1457.37 s [vector] izipWith3: OK
  10752. 1457.37 s [vector] +++ OK, passed 100 tests.
  10753. 1457.37 s [vector] izipWithM: OK
  10754. 1457.38 s [vector] +++ OK, passed 100 tests.
  10755. 1457.39 s [vector] izipWithM_: OK (0.01s)
  10756. 1457.39 s [vector] +++ OK, passed 100 tests.
  10757. 1457.39 s [vector] zipWithM: OK
  10758. 1457.39 s [vector] +++ OK, passed 100 tests.
  10759. 1457.40 s [vector] zipWithM_: OK (0.01s)
  10760. 1457.40 s [vector] +++ OK, passed 100 tests.
  10761. 1457.40 s [vector] filter: OK
  10762. 1457.40 s [vector] +++ OK, passed 100 tests.
  10763. 1457.40 s [vector] ifilter: OK
  10764. 1457.40 s [vector] +++ OK, passed 100 tests.
  10765. 1457.43 s [vector] filterM: OK (0.03s)
  10766. 1457.44 s [vector] +++ OK, passed 100 tests.
  10767. 1457.44 s [vector] uniq: OK
  10768. 1457.44 s [vector] +++ OK, passed 100 tests.
  10769. 1457.44 s [vector] mapMaybe: OK
  10770. 1457.44 s [vector] +++ OK, passed 100 tests.
  10771. 1457.44 s [vector] imapMaybe: OK
  10772. 1457.44 s [vector] +++ OK, passed 100 tests.
  10773. 1457.44 s [vector] takeWhile: OK
  10774. 1457.44 s [vector] +++ OK, passed 100 tests.
  10775. 1457.45 s [vector] dropWhile: OK
  10776. 1457.45 s [vector] +++ OK, passed 100 tests.
  10777. 1457.45 s [vector] partition: OK
  10778. 1457.45 s [vector] +++ OK, passed 100 tests.
  10779. 1457.45 s [vector] partitionWith: OK
  10780. 1457.45 s [vector] +++ OK, passed 100 tests.
  10781. 1457.45 s [vector] span: OK
  10782. 1457.45 s [vector] +++ OK, passed 100 tests.
  10783. 1457.45 s [vector] break: OK
  10784. 1457.45 s [vector] +++ OK, passed 100 tests.
  10785. 1457.45 s [vector] spanR: OK
  10786. 1457.45 s [vector] +++ OK, passed 100 tests.
  10787. 1457.45 s [vector] breakR: OK
  10788. 1457.45 s [vector] +++ OK, passed 100 tests.
  10789. 1457.45 s [vector] groupBy: OK
  10790. 1457.45 s [vector] +++ OK, passed 100 tests.
  10791. 1457.46 s [vector] elem: OK
  10792. 1457.46 s [vector] +++ OK, passed 100 tests.
  10793. 1457.46 s [vector] notElem: OK
  10794. 1457.46 s [vector] +++ OK, passed 100 tests.
  10795. 1457.46 s [vector] find: OK
  10796. 1457.46 s [vector] +++ OK, passed 100 tests.
  10797. 1457.46 s [vector] findIndex: OK
  10798. 1457.46 s [vector] +++ OK, passed 100 tests.
  10799. 1457.46 s [vector] findIndexR: OK
  10800. 1457.46 s [vector] +++ OK, passed 100 tests.
  10801. 1457.46 s [vector] findIndices: OK
  10802. 1457.46 s [vector] +++ OK, passed 100 tests.
  10803. 1457.46 s [vector] elemIndex: OK
  10804. 1457.46 s [vector] +++ OK, passed 100 tests.
  10805. 1457.46 s [vector] elemIndices: OK
  10806. 1457.46 s [vector] +++ OK, passed 100 tests.
  10807. 1457.47 s [vector] foldl: OK
  10808. 1457.47 s [vector] +++ OK, passed 100 tests.
  10809. 1457.47 s [vector] foldl1: OK
  10810. 1457.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10811. 1457.47 s [vector] foldl': OK
  10812. 1457.47 s [vector] +++ OK, passed 100 tests.
  10813. 1457.47 s [vector] foldl1': OK
  10814. 1457.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10815. 1457.47 s [vector] foldr: OK
  10816. 1457.47 s [vector] +++ OK, passed 100 tests.
  10817. 1457.48 s [vector] foldr1: OK
  10818. 1457.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10819. 1457.48 s [vector] foldr': OK
  10820. 1457.48 s [vector] +++ OK, passed 100 tests.
  10821. 1457.48 s [vector] foldr1': OK
  10822. 1457.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10823. 1457.48 s [vector] ifoldl: OK
  10824. 1457.48 s [vector] +++ OK, passed 100 tests.
  10825. 1457.49 s [vector] ifoldl': OK
  10826. 1457.49 s [vector] +++ OK, passed 100 tests.
  10827. 1457.50 s [vector] ifoldr: OK
  10828. 1457.50 s [vector] +++ OK, passed 100 tests.
  10829. 1457.50 s [vector] ifoldr': OK
  10830. 1457.50 s [vector] +++ OK, passed 100 tests.
  10831. 1457.50 s [vector] ifoldM: OK
  10832. 1457.50 s [vector] +++ OK, passed 100 tests.
  10833. 1457.50 s [vector] ifoldM': OK
  10834. 1457.50 s [vector] +++ OK, passed 100 tests.
  10835. 1457.52 s [vector] ifoldM_: OK (0.02s)
  10836. 1457.52 s [vector] +++ OK, passed 100 tests.
  10837. 1457.54 s [vector] ifoldM'_: OK (0.02s)
  10838. 1457.54 s [vector] +++ OK, passed 100 tests.
  10839. 1457.54 s [vector] all: OK
  10840. 1457.54 s [vector] +++ OK, passed 100 tests.
  10841. 1457.54 s [vector] any: OK
  10842. 1457.54 s [vector] +++ OK, passed 100 tests.
  10843. 1457.54 s [vector] prescanl: OK
  10844. 1457.54 s [vector] +++ OK, passed 100 tests.
  10845. 1457.55 s [vector] prescanl': OK
  10846. 1457.55 s [vector] +++ OK, passed 100 tests.
  10847. 1457.55 s [vector] postscanl: OK
  10848. 1457.55 s [vector] +++ OK, passed 100 tests.
  10849. 1457.55 s [vector] postscanl': OK
  10850. 1457.55 s [vector] +++ OK, passed 100 tests.
  10851. 1457.56 s [vector] scanl: OK
  10852. 1457.56 s [vector] +++ OK, passed 100 tests.
  10853. 1457.56 s [vector] scanl': OK
  10854. 1457.56 s [vector] +++ OK, passed 100 tests.
  10855. 1457.56 s [vector] scanl1: OK
  10856. 1457.56 s [vector] +++ OK, passed 100 tests.
  10857. 1457.56 s [vector] scanl1': OK
  10858. 1457.56 s [vector] +++ OK, passed 100 tests.
  10859. 1457.56 s [vector] iscanl: OK
  10860. 1457.56 s [vector] +++ OK, passed 100 tests.
  10861. 1457.56 s [vector] iscanl': OK
  10862. 1457.56 s [vector] +++ OK, passed 100 tests.
  10863. 1457.57 s [vector] prescanr: OK
  10864. 1457.57 s [vector] +++ OK, passed 100 tests.
  10865. 1457.57 s [vector] prescanr': OK
  10866. 1457.57 s [vector] +++ OK, passed 100 tests.
  10867. 1457.57 s [vector] postscanr: OK
  10868. 1457.58 s [vector] +++ OK, passed 100 tests.
  10869. 1457.58 s [vector] postscanr': OK
  10870. 1457.58 s [vector] +++ OK, passed 100 tests.
  10871. 1457.58 s [vector] scanr: OK
  10872. 1457.58 s [vector] +++ OK, passed 100 tests.
  10873. 1457.58 s [vector] scanr': OK
  10874. 1457.58 s [vector] +++ OK, passed 100 tests.
  10875. 1457.58 s [vector] scanr1: OK
  10876. 1457.58 s [vector] +++ OK, passed 100 tests.
  10877. 1457.58 s [vector] scanr1': OK
  10878. 1457.59 s [vector] +++ OK, passed 100 tests.
  10879. 1457.59 s [vector] iscanr: OK
  10880. 1457.59 s [vector] +++ OK, passed 100 tests.
  10881. 1457.59 s [vector] iscanr': OK
  10882. 1457.59 s [vector] +++ OK, passed 100 tests.
  10883. 1457.59 s [vector] mut_read: OK
  10884. 1457.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10885. 1457.59 s [vector] mut_write: OK
  10886. 1457.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10887. 1457.60 s [vector] mut_modify: OK
  10888. 1457.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10889. 1457.60 s [vector] mut_generate: OK
  10890. 1457.61 s [vector] +++ OK, passed 100 tests.
  10891. 1457.61 s [vector] mut_generateM: OK
  10892. 1457.61 s [vector] +++ OK, passed 100 tests.
  10893. 1457.62 s [vector] mut_mapM_: OK (0.02s)
  10894. 1457.62 s [vector] +++ OK, passed 100 tests.
  10895. 1457.64 s [vector] mut_imapM_: OK (0.02s)
  10896. 1457.64 s [vector] +++ OK, passed 100 tests.
  10897. 1457.66 s [vector] mut_forM_: OK (0.02s)
  10898. 1457.66 s [vector] +++ OK, passed 100 tests.
  10899. 1457.67 s [vector] mut_iforM_: OK (0.02s)
  10900. 1457.67 s [vector] +++ OK, passed 100 tests.
  10901. 1457.67 s [vector] mut_foldr: OK
  10902. 1457.67 s [vector] +++ OK, passed 100 tests.
  10903. 1457.67 s [vector] mut_foldr': OK
  10904. 1457.67 s [vector] +++ OK, passed 100 tests.
  10905. 1457.67 s [vector] mut_foldl: OK
  10906. 1457.67 s [vector] +++ OK, passed 100 tests.
  10907. 1457.68 s [vector] mut_foldl': OK
  10908. 1457.68 s [vector] +++ OK, passed 100 tests.
  10909. 1457.68 s [vector] mut_ifoldr: OK
  10910. 1457.68 s [vector] +++ OK, passed 100 tests.
  10911. 1457.68 s [vector] mut_ifoldr': OK
  10912. 1457.68 s [vector] +++ OK, passed 100 tests.
  10913. 1457.68 s [vector] mut_ifoldl: OK
  10914. 1457.68 s [vector] +++ OK, passed 100 tests.
  10915. 1457.69 s [vector] mut_ifoldl': OK
  10916. 1457.69 s [vector] +++ OK, passed 100 tests.
  10917. 1457.69 s [vector] mut_foldM: OK
  10918. 1457.69 s [vector] +++ OK, passed 100 tests.
  10919. 1457.70 s [vector] mut_foldM': OK
  10920. 1457.70 s [vector] +++ OK, passed 100 tests.
  10921. 1457.70 s [vector] mut_foldrM: OK
  10922. 1457.70 s [vector] +++ OK, passed 100 tests.
  10923. 1457.70 s [vector] mut_foldrM': OK
  10924. 1457.70 s [vector] +++ OK, passed 100 tests.
  10925. 1457.70 s [vector] mut_ifoldM: OK
  10926. 1457.70 s [vector] +++ OK, passed 100 tests.
  10927. 1457.70 s [vector] mut_ifoldM': OK
  10928. 1457.70 s [vector] +++ OK, passed 100 tests.
  10929. 1457.71 s [vector] mut_ifoldrM: OK
  10930. 1457.71 s [vector] +++ OK, passed 100 tests.
  10931. 1457.71 s [vector] mut_ifoldrM': OK
  10932. 1457.71 s [vector] +++ OK, passed 100 tests.
  10933. 1457.71 s [vector] compare: OK
  10934. 1457.71 s [vector] +++ OK, passed 100 tests.
  10935. 1457.71 s [vector] maximum: OK
  10936. 1457.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10937. 1457.71 s [vector] minimum: OK
  10938. 1457.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10939. 1457.71 s [vector] minIndex: OK
  10940. 1457.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10941. 1457.71 s [vector] maxIndex: OK
  10942. 1457.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10943. 1457.71 s [vector] maximumBy: OK
  10944. 1457.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10945. 1457.71 s [vector] minimumBy: OK
  10946. 1457.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10947. 1457.71 s [vector] maximumOn: OK
  10948. 1457.71 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10949. 1457.71 s [vector] minimumOn: OK
  10950. 1457.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10951. 1457.71 s [vector] maxIndexBy: OK
  10952. 1457.71 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10953. 1457.71 s [vector] minIndexBy: OK
  10954. 1457.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10955. 1457.72 s [vector] ListFirstMaxIndexWins: OK
  10956. 1457.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10957. 1457.72 s [vector] FalseListFirstMaxIndexWins: OK
  10958. 1457.72 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10959. 1457.72 s [vector] []
  10960. 1457.72 s [vector] zip: OK
  10961. 1457.72 s [vector] +++ OK, passed 100 tests.
  10962. 1457.72 s [vector] zip3: OK
  10963. 1457.72 s [vector] +++ OK, passed 100 tests.
  10964. 1457.73 s [vector] unzip: OK
  10965. 1457.73 s [vector] +++ OK, passed 100 tests.
  10966. 1457.73 s [vector] unzip3: OK
  10967. 1457.73 s [vector] +++ OK, passed 100 tests.
  10968. 1457.73 s [vector] indexed: OK
  10969. 1457.73 s [vector] +++ OK, passed 100 tests.
  10970. 1457.73 s [vector] update: OK
  10971. 1457.73 s [vector] +++ OK, passed 100 tests.
  10972. 1457.73 s [vector] concat: OK (0.01s)
  10973. 1457.73 s [vector] +++ OK, passed 100 tests.
  10974. 1457.73 s [vector] mempty: OK
  10975. 1457.73 s [vector] +++ OK, passed 100 tests.
  10976. 1457.73 s [vector] mappend: OK
  10977. 1457.74 s [vector] +++ OK, passed 100 tests.
  10978. 1457.74 s [vector] mconcat: OK
  10979. 1457.74 s [vector] +++ OK, passed 100 tests.
  10980. 1457.74 s [vector] fmap: OK
  10981. 1457.74 s [vector] +++ OK, passed 100 tests.
  10982. 1457.74 s [vector] return: OK
  10983. 1457.74 s [vector] +++ OK, passed 100 tests.
  10984. 1457.76 s [vector] bind: OK (0.01s)
  10985. 1457.76 s [vector] +++ OK, passed 100 tests.
  10986. 1457.76 s [vector] mzip: OK
  10987. 1457.76 s [vector] +++ OK, passed 100 tests.
  10988. 1457.76 s [vector] munzip: OK
  10989. 1457.76 s [vector] +++ OK, passed 100 tests.
  10990. 1457.76 s [vector] applicative_pure: OK
  10991. 1457.76 s [vector] +++ OK, passed 100 tests.
  10992. 1457.80 s [vector] applicative_appl: OK (0.04s)
  10993. 1457.80 s [vector] +++ OK, passed 100 tests.
  10994. 1457.80 s [vector] alternative_empty: OK
  10995. 1457.80 s [vector] +++ OK, passed 100 tests.
  10996. 1457.82 s [vector] alternative_or: OK
  10997. 1457.82 s [vector] +++ OK, passed 100 tests.
  10998. 1457.84 s [vector] sequence: OK (0.03s)
  10999. 1457.84 s [vector] +++ OK, passed 100 tests.
  11000. 1457.85 s [vector] sequence_: OK (0.01s)
  11001. 1457.85 s [vector] +++ OK, passed 100 tests.
  11002. 1457.85 s [vector] glength: OK
  11003. 1457.85 s [vector] +++ OK, passed 100 tests.
  11004. 1457.85 s [vector] sum: OK
  11005. 1457.85 s [vector] +++ OK, passed 100 tests.
  11006. 1457.85 s [vector] product: OK
  11007. 1457.85 s [vector] +++ OK, passed 100 tests.
  11008. 1457.85 s [vector] enumFromN: OK
  11009. 1457.85 s [vector] +++ OK, passed 100 tests.
  11010. 1457.85 s [vector] enumFromThenN: OK
  11011. 1457.85 s [vector] +++ OK, passed 100 tests.
  11012. 1457.85 s [vector] enumFromTo: OK
  11013. 1457.85 s [vector] +++ OK, passed 100 tests.
  11014. 1457.85 s [vector] enumFromThenTo: OK
  11015. 1457.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11016. 1457.85 s [vector] unstream
  11017. 1457.85 s [vector] unstream == vunstream (exact): OK
  11018. 1457.86 s [vector] +++ OK, passed 100 tests.
  11019. 1457.86 s [vector] unstream == vunstream (unknown): OK
  11020. 1457.86 s [vector] +++ OK, passed 100 tests.
  11021. 1457.86 s [vector] unstreamR ~= vunstream (exact): OK
  11022. 1457.86 s [vector] +++ OK, passed 100 tests.
  11023. 1457.86 s [vector] unstreamR ~= vunstream (unknown): OK
  11024. 1457.86 s [vector] +++ OK, passed 100 tests.
  11025. 1457.86 s [vector] Tests.Vector.Primitive
  11026. 1457.86 s [vector] Int
  11027. 1457.86 s [vector] fromList.toList == id: OK
  11028. 1457.86 s [vector] +++ OK, passed 100 tests.
  11029. 1457.86 s [vector] toList.fromList == id: OK
  11030. 1457.86 s [vector] +++ OK, passed 100 tests.
  11031. 1457.86 s [vector] unstream.stream == id: OK
  11032. 1457.86 s [vector] +++ OK, passed 100 tests.
  11033. 1457.86 s [vector] stream.unstream == id: OK
  11034. 1457.86 s [vector] +++ OK, passed 100 tests.
  11035. 1457.86 s [vector] eq: OK
  11036. 1457.86 s [vector] +++ OK, passed 100 tests.
  11037. 1457.86 s [vector] length: OK
  11038. 1457.86 s [vector] +++ OK, passed 100 tests.
  11039. 1457.86 s [vector] null: OK
  11040. 1457.86 s [vector] +++ OK, passed 100 tests.
  11041. 1457.86 s [vector] index: OK
  11042. 1457.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11043. 1457.86 s [vector] safeIndex: OK
  11044. 1457.86 s [vector] +++ OK, passed 100 tests.
  11045. 1457.86 s [vector] head: OK
  11046. 1457.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11047. 1457.86 s [vector] last: OK
  11048. 1457.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11049. 1457.86 s [vector] unsafeIndex: OK
  11050. 1457.86 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11051. 1457.86 s [vector] unsafeHead: OK
  11052. 1457.86 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11053. 1457.86 s [vector] unsafeLast: OK
  11054. 1457.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11055. 1457.86 s [vector] slice: OK
  11056. 1457.86 s [vector] +++ OK, passed 100 tests.
  11057. 1457.86 s [vector] init: OK
  11058. 1457.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11059. 1457.86 s [vector] tail: OK
  11060. 1457.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11061. 1457.87 s [vector] take: OK
  11062. 1457.87 s [vector] +++ OK, passed 100 tests.
  11063. 1457.87 s [vector] drop: OK
  11064. 1457.87 s [vector] +++ OK, passed 100 tests.
  11065. 1457.87 s [vector] splitAt: OK
  11066. 1457.87 s [vector] +++ OK, passed 100 tests.
  11067. 1457.87 s [vector] empty: OK
  11068. 1457.87 s [vector] +++ OK, passed 100 tests.
  11069. 1457.87 s [vector] singleton: OK
  11070. 1457.87 s [vector] +++ OK, passed 100 tests.
  11071. 1457.87 s [vector] replicate: OK
  11072. 1457.87 s [vector] +++ OK, passed 100 tests.
  11073. 1457.87 s [vector] generate: OK
  11074. 1457.87 s [vector] +++ OK, passed 100 tests.
  11075. 1457.88 s [vector] iterateN: OK
  11076. 1457.88 s [vector] +++ OK, passed 100 tests.
  11077. 1457.88 s [vector] iterateNM: OK (0.01s)
  11078. 1457.88 s [vector] +++ OK, passed 100 tests.
  11079. 1457.91 s [vector] generateM: OK (0.02s)
  11080. 1457.91 s [vector] +++ OK, passed 100 tests.
  11081. 1457.92 s [vector] replicateM: OK (0.02s)
  11082. 1457.92 s [vector] +++ OK, passed 100 tests.
  11083. 1457.92 s [vector] create: OK
  11084. 1457.92 s [vector] +++ OK, passed 100 tests.
  11085. 1457.92 s [vector] createT: OK
  11086. 1457.92 s [vector] +++ OK, passed 100 tests.
  11087. 1457.92 s [vector] unfoldr: OK
  11088. 1457.92 s [vector] +++ OK, passed 100 tests.
  11089. 1457.92 s [vector] unfoldrN: OK
  11090. 1457.92 s [vector] +++ OK, passed 100 tests.
  11091. 1457.92 s [vector] unfoldrExactN: OK
  11092. 1457.92 s [vector] +++ OK, passed 100 tests.
  11093. 1457.93 s [vector] unfoldrM: OK
  11094. 1457.93 s [vector] +++ OK, passed 100 tests.
  11095. 1457.93 s [vector] unfoldrNM: OK
  11096. 1457.93 s [vector] +++ OK, passed 100 tests.
  11097. 1457.95 s [vector] unfoldrExactNM: OK (0.02s)
  11098. 1457.95 s [vector] +++ OK, passed 100 tests.
  11099. 1457.96 s [vector] constructN: OK
  11100. 1457.96 s [vector] +++ OK, passed 100 tests.
  11101. 1457.97 s [vector] constructrN: OK
  11102. 1457.97 s [vector] +++ OK, passed 100 tests.
  11103. 1457.97 s [vector] cons: OK
  11104. 1457.97 s [vector] +++ OK, passed 100 tests.
  11105. 1457.97 s [vector] snoc: OK
  11106. 1457.97 s [vector] +++ OK, passed 100 tests.
  11107. 1457.97 s [vector] append: OK
  11108. 1457.97 s [vector] +++ OK, passed 100 tests.
  11109. 1457.99 s [vector] concat: OK (0.02s)
  11110. 1457.99 s [vector] +++ OK, passed 100 tests.
  11111. 1457.99 s [vector] force: OK
  11112. 1457.99 s [vector] +++ OK, passed 100 tests.
  11113. 1458.00 s [vector] upd: OK
  11114. 1458.00 s [vector] +++ OK, passed 100 tests.
  11115. 1458.00 s [vector] accum: OK
  11116. 1458.00 s [vector] +++ OK, passed 100 tests.
  11117. 1458.00 s [vector] reverse: OK
  11118. 1458.00 s [vector] +++ OK, passed 100 tests.
  11119. 1458.00 s [vector] backpermute: OK
  11120. 1458.00 s [vector] +++ OK, passed 100 tests.
  11121. 1458.00 s [vector] map: OK
  11122. 1458.00 s [vector] +++ OK, passed 100 tests.
  11123. 1458.00 s [vector] imap: OK
  11124. 1458.00 s [vector] +++ OK, passed 100 tests.
  11125. 1458.00 s [vector] concatMap: OK
  11126. 1458.01 s [vector] +++ OK, passed 100 tests.
  11127. 1458.01 s [vector] mapM: OK
  11128. 1458.02 s [vector] +++ OK, passed 100 tests.
  11129. 1458.03 s [vector] mapM_: OK (0.02s)
  11130. 1458.03 s [vector] +++ OK, passed 100 tests.
  11131. 1458.03 s [vector] forM: OK
  11132. 1458.04 s [vector] +++ OK, passed 100 tests.
  11133. 1458.05 s [vector] forM_: OK (0.02s)
  11134. 1458.06 s [vector] +++ OK, passed 100 tests.
  11135. 1458.06 s [vector] imapM: OK
  11136. 1458.07 s [vector] +++ OK, passed 100 tests.
  11137. 1458.07 s [vector] imapM_: OK (0.02s)
  11138. 1458.07 s [vector] +++ OK, passed 100 tests.
  11139. 1458.07 s [vector] zipWith: OK
  11140. 1458.07 s [vector] +++ OK, passed 100 tests.
  11141. 1458.08 s [vector] zipWith3: OK
  11142. 1458.08 s [vector] +++ OK, passed 100 tests.
  11143. 1458.08 s [vector] izipWith: OK
  11144. 1458.08 s [vector] +++ OK, passed 100 tests.
  11145. 1458.08 s [vector] izipWith3: OK
  11146. 1458.08 s [vector] +++ OK, passed 100 tests.
  11147. 1458.09 s [vector] izipWithM: OK
  11148. 1458.09 s [vector] +++ OK, passed 100 tests.
  11149. 1458.10 s [vector] izipWithM_: OK (0.02s)
  11150. 1458.10 s [vector] +++ OK, passed 100 tests.
  11151. 1458.10 s [vector] zipWithM: OK
  11152. 1458.10 s [vector] +++ OK, passed 100 tests.
  11153. 1458.11 s [vector] zipWithM_: OK (0.01s)
  11154. 1458.12 s [vector] +++ OK, passed 100 tests.
  11155. 1458.12 s [vector] filter: OK
  11156. 1458.12 s [vector] +++ OK, passed 100 tests.
  11157. 1458.12 s [vector] ifilter: OK
  11158. 1458.12 s [vector] +++ OK, passed 100 tests.
  11159. 1458.15 s [vector] filterM: OK (0.03s)
  11160. 1458.15 s [vector] +++ OK, passed 100 tests.
  11161. 1458.15 s [vector] uniq: OK
  11162. 1458.15 s [vector] +++ OK, passed 100 tests.
  11163. 1458.15 s [vector] mapMaybe: OK
  11164. 1458.15 s [vector] +++ OK, passed 100 tests.
  11165. 1458.15 s [vector] imapMaybe: OK
  11166. 1458.15 s [vector] +++ OK, passed 100 tests.
  11167. 1458.15 s [vector] takeWhile: OK
  11168. 1458.15 s [vector] +++ OK, passed 100 tests.
  11169. 1458.16 s [vector] dropWhile: OK
  11170. 1458.16 s [vector] +++ OK, passed 100 tests.
  11171. 1458.16 s [vector] partition: OK
  11172. 1458.16 s [vector] +++ OK, passed 100 tests.
  11173. 1458.16 s [vector] partitionWith: OK
  11174. 1458.16 s [vector] +++ OK, passed 100 tests.
  11175. 1458.16 s [vector] span: OK
  11176. 1458.16 s [vector] +++ OK, passed 100 tests.
  11177. 1458.16 s [vector] break: OK
  11178. 1458.16 s [vector] +++ OK, passed 100 tests.
  11179. 1458.16 s [vector] spanR: OK
  11180. 1458.16 s [vector] +++ OK, passed 100 tests.
  11181. 1458.16 s [vector] breakR: OK
  11182. 1458.16 s [vector] +++ OK, passed 100 tests.
  11183. 1458.16 s [vector] groupBy: OK
  11184. 1458.16 s [vector] +++ OK, passed 100 tests.
  11185. 1458.16 s [vector] elem: OK
  11186. 1458.16 s [vector] +++ OK, passed 100 tests.
  11187. 1458.16 s [vector] notElem: OK
  11188. 1458.16 s [vector] +++ OK, passed 100 tests.
  11189. 1458.16 s [vector] find: OK
  11190. 1458.16 s [vector] +++ OK, passed 100 tests.
  11191. 1458.17 s [vector] findIndex: OK
  11192. 1458.17 s [vector] +++ OK, passed 100 tests.
  11193. 1458.17 s [vector] findIndexR: OK
  11194. 1458.17 s [vector] +++ OK, passed 100 tests.
  11195. 1458.17 s [vector] findIndices: OK
  11196. 1458.17 s [vector] +++ OK, passed 100 tests.
  11197. 1458.17 s [vector] elemIndex: OK
  11198. 1458.17 s [vector] +++ OK, passed 100 tests.
  11199. 1458.17 s [vector] elemIndices: OK
  11200. 1458.17 s [vector] +++ OK, passed 100 tests.
  11201. 1458.17 s [vector] foldl: OK
  11202. 1458.17 s [vector] +++ OK, passed 100 tests.
  11203. 1458.17 s [vector] foldl1: OK
  11204. 1458.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11205. 1458.18 s [vector] foldl': OK
  11206. 1458.18 s [vector] +++ OK, passed 100 tests.
  11207. 1458.18 s [vector] foldl1': OK
  11208. 1458.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11209. 1458.18 s [vector] foldr: OK
  11210. 1458.18 s [vector] +++ OK, passed 100 tests.
  11211. 1458.19 s [vector] foldr1: OK
  11212. 1458.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11213. 1458.19 s [vector] foldr': OK
  11214. 1458.20 s [vector] +++ OK, passed 100 tests.
  11215. 1458.20 s [vector] foldr1': OK
  11216. 1458.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11217. 1458.21 s [vector] ifoldl: OK
  11218. 1458.21 s [vector] +++ OK, passed 100 tests.
  11219. 1458.21 s [vector] ifoldl': OK
  11220. 1458.21 s [vector] +++ OK, passed 100 tests.
  11221. 1458.21 s [vector] ifoldr: OK
  11222. 1458.21 s [vector] +++ OK, passed 100 tests.
  11223. 1458.21 s [vector] ifoldr': OK
  11224. 1458.21 s [vector] +++ OK, passed 100 tests.
  11225. 1458.22 s [vector] ifoldM: OK
  11226. 1458.22 s [vector] +++ OK, passed 100 tests.
  11227. 1458.23 s [vector] ifoldM': OK
  11228. 1458.23 s [vector] +++ OK, passed 100 tests.
  11229. 1458.24 s [vector] ifoldM_: OK (0.02s)
  11230. 1458.24 s [vector] +++ OK, passed 100 tests.
  11231. 1458.25 s [vector] ifoldM'_: OK (0.02s)
  11232. 1458.25 s [vector] +++ OK, passed 100 tests.
  11233. 1458.25 s [vector] all: OK
  11234. 1458.25 s [vector] +++ OK, passed 100 tests.
  11235. 1458.26 s [vector] any: OK
  11236. 1458.26 s [vector] +++ OK, passed 100 tests.
  11237. 1458.26 s [vector] prescanl: OK
  11238. 1458.26 s [vector] +++ OK, passed 100 tests.
  11239. 1458.27 s [vector] prescanl': OK
  11240. 1458.27 s [vector] +++ OK, passed 100 tests.
  11241. 1458.27 s [vector] postscanl: OK
  11242. 1458.28 s [vector] +++ OK, passed 100 tests.
  11243. 1458.28 s [vector] postscanl': OK
  11244. 1458.28 s [vector] +++ OK, passed 100 tests.
  11245. 1458.28 s [vector] scanl: OK
  11246. 1458.28 s [vector] +++ OK, passed 100 tests.
  11247. 1458.28 s [vector] scanl': OK
  11248. 1458.28 s [vector] +++ OK, passed 100 tests.
  11249. 1458.28 s [vector] scanl1: OK
  11250. 1458.29 s [vector] +++ OK, passed 100 tests.
  11251. 1458.29 s [vector] scanl1': OK
  11252. 1458.29 s [vector] +++ OK, passed 100 tests.
  11253. 1458.29 s [vector] iscanl: OK
  11254. 1458.29 s [vector] +++ OK, passed 100 tests.
  11255. 1458.29 s [vector] iscanl': OK
  11256. 1458.29 s [vector] +++ OK, passed 100 tests.
  11257. 1458.29 s [vector] prescanr: OK
  11258. 1458.29 s [vector] +++ OK, passed 100 tests.
  11259. 1458.29 s [vector] prescanr': OK
  11260. 1458.30 s [vector] +++ OK, passed 100 tests.
  11261. 1458.30 s [vector] postscanr: OK
  11262. 1458.30 s [vector] +++ OK, passed 100 tests.
  11263. 1458.30 s [vector] postscanr': OK
  11264. 1458.30 s [vector] +++ OK, passed 100 tests.
  11265. 1458.31 s [vector] scanr: OK
  11266. 1458.31 s [vector] +++ OK, passed 100 tests.
  11267. 1458.31 s [vector] scanr': OK
  11268. 1458.31 s [vector] +++ OK, passed 100 tests.
  11269. 1458.31 s [vector] scanr1: OK
  11270. 1458.31 s [vector] +++ OK, passed 100 tests.
  11271. 1458.31 s [vector] scanr1': OK
  11272. 1458.31 s [vector] +++ OK, passed 100 tests.
  11273. 1458.31 s [vector] iscanr: OK
  11274. 1458.31 s [vector] +++ OK, passed 100 tests.
  11275. 1458.31 s [vector] iscanr': OK
  11276. 1458.32 s [vector] +++ OK, passed 100 tests.
  11277. 1458.32 s [vector] mut_read: OK
  11278. 1458.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11279. 1458.32 s [vector] mut_write: OK
  11280. 1458.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11281. 1458.32 s [vector] mut_modify: OK
  11282. 1458.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11283. 1458.32 s [vector] mut_generate: OK
  11284. 1458.32 s [vector] +++ OK, passed 100 tests.
  11285. 1458.33 s [vector] mut_generateM: OK
  11286. 1458.33 s [vector] +++ OK, passed 100 tests.
  11287. 1458.34 s [vector] mut_mapM_: OK (0.02s)
  11288. 1458.34 s [vector] +++ OK, passed 100 tests.
  11289. 1458.36 s [vector] mut_imapM_: OK (0.02s)
  11290. 1458.36 s [vector] +++ OK, passed 100 tests.
  11291. 1458.38 s [vector] mut_forM_: OK (0.01s)
  11292. 1458.38 s [vector] +++ OK, passed 100 tests.
  11293. 1458.39 s [vector] mut_iforM_: OK (0.02s)
  11294. 1458.39 s [vector] +++ OK, passed 100 tests.
  11295. 1458.39 s [vector] mut_foldr: OK
  11296. 1458.39 s [vector] +++ OK, passed 100 tests.
  11297. 1458.40 s [vector] mut_foldr': OK
  11298. 1458.40 s [vector] +++ OK, passed 100 tests.
  11299. 1458.40 s [vector] mut_foldl: OK
  11300. 1458.40 s [vector] +++ OK, passed 100 tests.
  11301. 1458.40 s [vector] mut_foldl': OK
  11302. 1458.40 s [vector] +++ OK, passed 100 tests.
  11303. 1458.40 s [vector] mut_ifoldr: OK
  11304. 1458.40 s [vector] +++ OK, passed 100 tests.
  11305. 1458.41 s [vector] mut_ifoldr': OK
  11306. 1458.41 s [vector] +++ OK, passed 100 tests.
  11307. 1458.41 s [vector] mut_ifoldl: OK
  11308. 1458.42 s [vector] +++ OK, passed 100 tests.
  11309. 1458.42 s [vector] mut_ifoldl': OK
  11310. 1458.42 s [vector] +++ OK, passed 100 tests.
  11311. 1458.42 s [vector] mut_foldM: OK
  11312. 1458.42 s [vector] +++ OK, passed 100 tests.
  11313. 1458.42 s [vector] mut_foldM': OK
  11314. 1458.42 s [vector] +++ OK, passed 100 tests.
  11315. 1458.42 s [vector] mut_foldrM: OK
  11316. 1458.42 s [vector] +++ OK, passed 100 tests.
  11317. 1458.43 s [vector] mut_foldrM': OK
  11318. 1458.43 s [vector] +++ OK, passed 100 tests.
  11319. 1458.43 s [vector] mut_ifoldM: OK
  11320. 1458.43 s [vector] +++ OK, passed 100 tests.
  11321. 1458.43 s [vector] mut_ifoldM': OK
  11322. 1458.43 s [vector] +++ OK, passed 100 tests.
  11323. 1458.43 s [vector] mut_ifoldrM: OK
  11324. 1458.44 s [vector] +++ OK, passed 100 tests.
  11325. 1458.44 s [vector] mut_ifoldrM': OK
  11326. 1458.44 s [vector] +++ OK, passed 100 tests.
  11327. 1458.44 s [vector] compare: OK
  11328. 1458.44 s [vector] +++ OK, passed 100 tests.
  11329. 1458.44 s [vector] maximum: OK
  11330. 1458.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11331. 1458.44 s [vector] minimum: OK
  11332. 1458.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11333. 1458.44 s [vector] minIndex: OK
  11334. 1458.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11335. 1458.44 s [vector] maxIndex: OK
  11336. 1458.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11337. 1458.44 s [vector] maximumBy: OK
  11338. 1458.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11339. 1458.44 s [vector] minimumBy: OK
  11340. 1458.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11341. 1458.44 s [vector] maximumOn: OK
  11342. 1458.44 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11343. 1458.44 s [vector] minimumOn: OK
  11344. 1458.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11345. 1458.44 s [vector] maxIndexBy: OK
  11346. 1458.44 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11347. 1458.44 s [vector] minIndexBy: OK
  11348. 1458.44 s [vector] +++ OK, passed 100 tests; 25 discarded.
  11349. 1458.44 s [vector] ListFirstMaxIndexWins: OK
  11350. 1458.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11351. 1458.44 s [vector] FalseListFirstMaxIndexWins: OK
  11352. 1458.44 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11353. 1458.44 s [vector] []
  11354. 1458.44 s [vector] mempty: OK
  11355. 1458.44 s [vector] +++ OK, passed 100 tests.
  11356. 1458.46 s [vector] mappend: OK
  11357. 1458.46 s [vector] +++ OK, passed 100 tests.
  11358. 1458.46 s [vector] mconcat: OK (0.02s)
  11359. 1458.46 s [vector] +++ OK, passed 100 tests.
  11360. 1458.46 s [vector] glength: OK
  11361. 1458.46 s [vector] +++ OK, passed 100 tests.
  11362. 1458.46 s [vector] sum: OK
  11363. 1458.46 s [vector] +++ OK, passed 100 tests.
  11364. 1458.46 s [vector] product: OK
  11365. 1458.46 s [vector] +++ OK, passed 100 tests.
  11366. 1458.47 s [vector] enumFromN: OK
  11367. 1458.47 s [vector] +++ OK, passed 100 tests.
  11368. 1458.47 s [vector] enumFromThenN: OK
  11369. 1458.47 s [vector] +++ OK, passed 100 tests.
  11370. 1458.47 s [vector] enumFromTo: OK
  11371. 1458.47 s [vector] +++ OK, passed 100 tests.
  11372. 1458.47 s [vector] enumFromThenTo: OK
  11373. 1458.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11374. 1458.47 s [vector] Double
  11375. 1458.47 s [vector] fromList.toList == id: OK
  11376. 1458.47 s [vector] +++ OK, passed 100 tests.
  11377. 1458.47 s [vector] toList.fromList == id: OK
  11378. 1458.47 s [vector] +++ OK, passed 100 tests.
  11379. 1458.48 s [vector] unstream.stream == id: OK
  11380. 1458.48 s [vector] +++ OK, passed 100 tests.
  11381. 1458.48 s [vector] stream.unstream == id: OK
  11382. 1458.48 s [vector] +++ OK, passed 100 tests.
  11383. 1458.48 s [vector] eq: OK
  11384. 1458.48 s [vector] +++ OK, passed 100 tests.
  11385. 1458.48 s [vector] length: OK
  11386. 1458.48 s [vector] +++ OK, passed 100 tests.
  11387. 1458.48 s [vector] null: OK
  11388. 1458.48 s [vector] +++ OK, passed 100 tests.
  11389. 1458.48 s [vector] index: OK
  11390. 1458.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11391. 1458.48 s [vector] safeIndex: OK
  11392. 1458.48 s [vector] +++ OK, passed 100 tests.
  11393. 1458.48 s [vector] head: OK
  11394. 1458.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11395. 1458.48 s [vector] last: OK
  11396. 1458.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11397. 1458.48 s [vector] unsafeIndex: OK
  11398. 1458.48 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11399. 1458.48 s [vector] unsafeHead: OK
  11400. 1458.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11401. 1458.48 s [vector] unsafeLast: OK
  11402. 1458.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11403. 1458.48 s [vector] slice: OK
  11404. 1458.48 s [vector] +++ OK, passed 100 tests.
  11405. 1458.48 s [vector] init: OK
  11406. 1458.48 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11407. 1458.48 s [vector] tail: OK
  11408. 1458.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11409. 1458.48 s [vector] take: OK
  11410. 1458.48 s [vector] +++ OK, passed 100 tests.
  11411. 1458.48 s [vector] drop: OK
  11412. 1458.48 s [vector] +++ OK, passed 100 tests.
  11413. 1458.48 s [vector] splitAt: OK
  11414. 1458.48 s [vector] +++ OK, passed 100 tests.
  11415. 1458.48 s [vector] empty: OK
  11416. 1458.48 s [vector] +++ OK, passed 100 tests.
  11417. 1458.49 s [vector] singleton: OK
  11418. 1458.49 s [vector] +++ OK, passed 100 tests.
  11419. 1458.50 s [vector] replicate: OK
  11420. 1458.50 s [vector] +++ OK, passed 100 tests.
  11421. 1458.51 s [vector] generate: OK
  11422. 1458.51 s [vector] +++ OK, passed 100 tests.
  11423. 1458.51 s [vector] iterateN: OK
  11424. 1458.51 s [vector] +++ OK, passed 100 tests.
  11425. 1458.54 s [vector] iterateNM: OK (0.04s)
  11426. 1458.54 s [vector] +++ OK, passed 100 tests.
  11427. 1458.55 s [vector] generateM: OK (0.02s)
  11428. 1458.55 s [vector] +++ OK, passed 100 tests.
  11429. 1458.56 s [vector] replicateM: OK
  11430. 1458.56 s [vector] +++ OK, passed 100 tests.
  11431. 1458.56 s [vector] create: OK
  11432. 1458.56 s [vector] +++ OK, passed 100 tests.
  11433. 1458.57 s [vector] createT: OK
  11434. 1458.57 s [vector] +++ OK, passed 100 tests.
  11435. 1458.57 s [vector] unfoldr: OK
  11436. 1458.57 s [vector] +++ OK, passed 100 tests.
  11437. 1458.57 s [vector] unfoldrN: OK
  11438. 1458.57 s [vector] +++ OK, passed 100 tests.
  11439. 1458.58 s [vector] unfoldrExactN: OK
  11440. 1458.58 s [vector] +++ OK, passed 100 tests.
  11441. 1458.59 s [vector] unfoldrM: OK
  11442. 1458.59 s [vector] +++ OK, passed 100 tests.
  11443. 1458.59 s [vector] unfoldrNM: OK
  11444. 1458.59 s [vector] +++ OK, passed 100 tests.
  11445. 1458.60 s [vector] unfoldrExactNM: OK (0.02s)
  11446. 1458.60 s [vector] +++ OK, passed 100 tests.
  11447. 1458.62 s [vector] constructN: OK (0.02s)
  11448. 1458.63 s [vector] +++ OK, passed 100 tests.
  11449. 1458.64 s [vector] constructrN: OK (0.03s)
  11450. 1458.64 s [vector] +++ OK, passed 100 tests.
  11451. 1458.64 s [vector] cons: OK
  11452. 1458.64 s [vector] +++ OK, passed 100 tests.
  11453. 1458.64 s [vector] snoc: OK
  11454. 1458.64 s [vector] +++ OK, passed 100 tests.
  11455. 1458.65 s [vector] append: OK
  11456. 1458.66 s [vector] +++ OK, passed 100 tests.
  11457. 1458.67 s [vector] concat: OK (0.03s)
  11458. 1458.67 s [vector] +++ OK, passed 100 tests.
  11459. 1458.67 s [vector] force: OK
  11460. 1458.68 s [vector] +++ OK, passed 100 tests.
  11461. 1458.68 s [vector] upd: OK
  11462. 1458.68 s [vector] +++ OK, passed 100 tests.
  11463. 1458.69 s [vector] accum: OK (0.02s)
  11464. 1458.69 s [vector] +++ OK, passed 100 tests.
  11465. 1458.69 s [vector] reverse: OK
  11466. 1458.69 s [vector] +++ OK, passed 100 tests.
  11467. 1458.70 s [vector] backpermute: OK
  11468. 1458.70 s [vector] +++ OK, passed 100 tests.
  11469. 1458.70 s [vector] map: OK
  11470. 1458.70 s [vector] +++ OK, passed 100 tests.
  11471. 1458.72 s [vector] imap: OK
  11472. 1458.72 s [vector] +++ OK, passed 100 tests.
  11473. 1458.72 s [vector] concatMap: OK
  11474. 1458.72 s [vector] +++ OK, passed 100 tests.
  11475. 1458.75 s [vector] mapM: OK
  11476. 1458.75 s [vector] +++ OK, passed 100 tests.
  11477. 1458.78 s [vector] mapM_: OK (0.04s)
  11478. 1458.78 s [vector] +++ OK, passed 100 tests.
  11479. 1458.78 s [vector] forM: OK
  11480. 1458.78 s [vector] +++ OK, passed 100 tests.
  11481. 1458.82 s [vector] forM_: OK (0.03s)
  11482. 1458.82 s [vector] +++ OK, passed 100 tests.
  11483. 1458.82 s [vector] imapM: OK
  11484. 1458.82 s [vector] +++ OK, passed 100 tests.
  11485. 1458.86 s [vector] imapM_: OK (0.03s)
  11486. 1458.86 s [vector] +++ OK, passed 100 tests.
  11487. 1458.86 s [vector] zipWith: OK
  11488. 1458.86 s [vector] +++ OK, passed 100 tests.
  11489. 1458.87 s [vector] zipWith3: OK (0.01s)
  11490. 1458.87 s [vector] +++ OK, passed 100 tests.
  11491. 1458.88 s [vector] izipWith: OK
  11492. 1458.88 s [vector] +++ OK, passed 100 tests.
  11493. 1458.89 s [vector] izipWith3: OK (0.01s)
  11494. 1458.89 s [vector] +++ OK, passed 100 tests.
  11495. 1458.90 s [vector] izipWithM: OK
  11496. 1458.90 s [vector] +++ OK, passed 100 tests.
  11497. 1458.94 s [vector] izipWithM_: OK (0.02s)
  11498. 1458.94 s [vector] +++ OK, passed 100 tests.
  11499. 1458.94 s [vector] zipWithM: OK
  11500. 1458.94 s [vector] +++ OK, passed 100 tests.
  11501. 1458.97 s [vector] zipWithM_: OK (0.03s)
  11502. 1458.97 s [vector] +++ OK, passed 100 tests.
  11503. 1458.98 s [vector] filter: OK
  11504. 1458.98 s [vector] +++ OK, passed 100 tests.
  11505. 1458.98 s [vector] ifilter: OK
  11506. 1458.98 s [vector] +++ OK, passed 100 tests.
  11507. 1459.02 s [vector] filterM: OK (0.04s)
  11508. 1459.02 s [vector] +++ OK, passed 100 tests.
  11509. 1459.03 s [vector] uniq: OK
  11510. 1459.03 s [vector] +++ OK, passed 100 tests.
  11511. 1459.03 s [vector] mapMaybe: OK
  11512. 1459.05 s [vector] +++ OK, passed 100 tests.
  11513. 1459.05 s [vector] imapMaybe: OK
  11514. 1459.05 s [vector] +++ OK, passed 100 tests.
  11515. 1459.06 s [vector] takeWhile: OK
  11516. 1459.06 s [vector] +++ OK, passed 100 tests.
  11517. 1459.06 s [vector] dropWhile: OK
  11518. 1459.06 s [vector] +++ OK, passed 100 tests.
  11519. 1459.06 s [vector] partition: OK
  11520. 1459.07 s [vector] +++ OK, passed 100 tests.
  11521. 1459.07 s [vector] partitionWith: OK
  11522. 1459.07 s [vector] +++ OK, passed 100 tests.
  11523. 1459.07 s [vector] span: OK
  11524. 1459.07 s [vector] +++ OK, passed 100 tests.
  11525. 1459.08 s [vector] break: OK
  11526. 1459.08 s [vector] +++ OK, passed 100 tests.
  11527. 1459.08 s [vector] spanR: OK
  11528. 1459.08 s [vector] +++ OK, passed 100 tests.
  11529. 1459.08 s [vector] breakR: OK
  11530. 1459.08 s [vector] +++ OK, passed 100 tests.
  11531. 1459.09 s [vector] groupBy: OK (0.01s)
  11532. 1459.09 s [vector] +++ OK, passed 100 tests.
  11533. 1459.09 s [vector] elem: OK
  11534. 1459.09 s [vector] +++ OK, passed 100 tests.
  11535. 1459.09 s [vector] notElem: OK
  11536. 1459.09 s [vector] +++ OK, passed 100 tests.
  11537. 1459.09 s [vector] find: OK
  11538. 1459.09 s [vector] +++ OK, passed 100 tests.
  11539. 1459.09 s [vector] findIndex: OK
  11540. 1459.09 s [vector] +++ OK, passed 100 tests.
  11541. 1459.10 s [vector] findIndexR: OK
  11542. 1459.10 s [vector] +++ OK, passed 100 tests.
  11543. 1459.10 s [vector] findIndices: OK
  11544. 1459.10 s [vector] +++ OK, passed 100 tests.
  11545. 1459.12 s [vector] elemIndex: OK
  11546. 1459.12 s [vector] +++ OK, passed 100 tests.
  11547. 1459.12 s [vector] elemIndices: OK
  11548. 1459.12 s [vector] +++ OK, passed 100 tests.
  11549. 1459.12 s [vector] foldl: OK (0.01s)
  11550. 1459.12 s [vector] +++ OK, passed 100 tests.
  11551. 1459.13 s [vector] foldl1: OK
  11552. 1459.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11553. 1459.14 s [vector] foldl': OK (0.01s)
  11554. 1459.15 s [vector] +++ OK, passed 100 tests.
  11555. 1459.17 s [vector] foldl1': OK (0.01s)
  11556. 1459.17 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11557. 1459.18 s [vector] foldr: OK (0.02s)
  11558. 1459.19 s [vector] +++ OK, passed 100 tests.
  11559. 1459.20 s [vector] foldr1: OK (0.01s)
  11560. 1459.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11561. 1459.21 s [vector] foldr': OK (0.01s)
  11562. 1459.21 s [vector] +++ OK, passed 100 tests.
  11563. 1459.22 s [vector] foldr1': OK (0.02s)
  11564. 1459.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11565. 1459.24 s [vector] ifoldl: OK (0.02s)
  11566. 1459.24 s [vector] +++ OK, passed 100 tests.
  11567. 1459.26 s [vector] ifoldl': OK (0.02s)
  11568. 1459.27 s [vector] +++ OK, passed 100 tests.
  11569. 1459.27 s [vector] ifoldr: OK (0.01s)
  11570. 1459.27 s [vector] +++ OK, passed 100 tests.
  11571. 1459.28 s [vector] ifoldr': OK
  11572. 1459.29 s [vector] +++ OK, passed 100 tests.
  11573. 1459.30 s [vector] ifoldM: OK (0.01s)
  11574. 1459.30 s [vector] +++ OK, passed 100 tests.
  11575. 1459.32 s [vector] ifoldM': OK (0.02s)
  11576. 1459.32 s [vector] +++ OK, passed 100 tests.
  11577. 1459.36 s [vector] ifoldM_: OK (0.04s)
  11578. 1459.36 s [vector] +++ OK, passed 100 tests.
  11579. 1459.39 s [vector] ifoldM'_: OK (0.04s)
  11580. 1459.39 s [vector] +++ OK, passed 100 tests.
  11581. 1459.39 s [vector] all: OK
  11582. 1459.39 s [vector] +++ OK, passed 100 tests.
  11583. 1459.40 s [vector] any: OK
  11584. 1459.40 s [vector] +++ OK, passed 100 tests.
  11585. 1459.40 s [vector] prescanl: OK (0.01s)
  11586. 1459.40 s [vector] +++ OK, passed 100 tests.
  11587. 1459.42 s [vector] prescanl': OK (0.01s)
  11588. 1459.42 s [vector] +++ OK, passed 100 tests.
  11589. 1459.44 s [vector] postscanl: OK (0.01s)
  11590. 1459.44 s [vector] +++ OK, passed 100 tests.
  11591. 1459.44 s [vector] postscanl': OK (0.01s)
  11592. 1459.44 s [vector] +++ OK, passed 100 tests.
  11593. 1459.46 s [vector] scanl: OK (0.01s)
  11594. 1459.65 s [vector] +++ OK, passed 100 tests.
  11595. 1459.65 s [vector] scanl': OK (0.02s)
  11596. 1459.65 s [vector] +++ OK, passed 100 tests.
  11597. 1459.65 s [vector] scanl1: OK (0.01s)
  11598. 1459.65 s [vector] +++ OK, passed 100 tests.
  11599. 1459.65 s [vector] scanl1': OK (0.01s)
  11600. 1459.65 s [vector] +++ OK, passed 100 tests.
  11601. 1459.65 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 )
  11602. 1459.65 s [vector] iscanl: OK (0.01s)
  11603. 1459.65 s [vector] +++ OK, passed 100 tests.
  11604. 1459.65 s [vector] iscanl': OK (0.02s)
  11605. 1459.65 s [vector] +++ OK, passed 100 tests.
  11606. 1459.65 s [vector] prescanr: OK (0.02s)
  11607. 1459.65 s [vector] +++ OK, passed 100 tests.
  11608. 1459.65 s [vector] prescanr': OK
  11609. 1459.65 s [vector] +++ OK, passed 100 tests.
  11610. 1459.65 s [vector] postscanr: OK (0.01s)
  11611. 1459.65 s [vector] +++ OK, passed 100 tests.
  11612. 1459.65 s [vector] postscanr': OK (0.01s)
  11613. 1459.65 s [vector] +++ OK, passed 100 tests.
  11614. 1459.65 s [vector] scanr: OK (0.01s)
  11615. 1459.65 s [vector] +++ OK, passed 100 tests.
  11616. 1459.65 s [vector] scanr': OK (0.01s)
  11617. 1459.65 s [vector] +++ OK, passed 100 tests.
  11618. 1459.65 s [vector] scanr1: OK (0.01s)
  11619. 1459.65 s [vector] +++ OK, passed 100 tests.
  11620. 1459.65 s [vector] scanr1': OK (0.01s)
  11621. 1459.65 s [vector] +++ OK, passed 100 tests.
  11622. 1459.66 s [vector] iscanr: OK (0.02s)
  11623. 1459.66 s [vector] +++ OK, passed 100 tests.
  11624. 1459.68 s [vector] iscanr': OK (0.02s)
  11625. 1459.68 s [vector] +++ OK, passed 100 tests.
  11626. 1459.69 s [vector] mut_read: OK
  11627. 1459.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11628. 1459.69 s [vector] mut_write: OK
  11629. 1459.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11630. 1459.69 s [vector] mut_modify: OK
  11631. 1459.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11632. 1459.69 s [vector] mut_generate: OK
  11633. 1459.70 s [vector] +++ OK, passed 100 tests.
  11634. 1459.72 s [vector] mut_generateM: OK (0.02s)
  11635. 1459.72 s [vector] +++ OK, passed 100 tests.
  11636. 1459.75 s [vector] mut_mapM_: OK (0.03s)
  11637. 1459.75 s [vector] +++ OK, passed 100 tests.
  11638. 1459.78 s [vector] mut_imapM_: OK (0.02s)
  11639. 1459.78 s [vector] +++ OK, passed 100 tests.
  11640. 1459.82 s [vector] mut_forM_: OK (0.03s)
  11641. 1459.82 s [vector] +++ OK, passed 100 tests.
  11642. 1459.86 s [vector] mut_iforM_: OK (0.04s)
  11643. 1459.86 s [vector] +++ OK, passed 100 tests.
  11644. 1459.86 s [vector] mut_foldr: OK (0.01s)
  11645. 1459.86 s [vector] +++ OK, passed 100 tests.
  11646. 1459.88 s [vector] mut_foldr': OK (0.01s)
  11647. 1459.88 s [vector] +++ OK, passed 100 tests.
  11648. 1459.90 s [vector] mut_foldl: OK (0.01s)
  11649. 1459.90 s [vector] +++ OK, passed 100 tests.
  11650. 1459.90 s [vector] mut_foldl': OK (0.01s)
  11651. 1459.90 s [vector] +++ OK, passed 100 tests.
  11652. 1459.91 s [vector] mut_ifoldr: OK
  11653. 1459.91 s [vector] +++ OK, passed 100 tests.
  11654. 1459.94 s [vector] mut_ifoldr': OK (0.01s)
  11655. 1459.94 s [vector] +++ OK, passed 100 tests.
  11656. 1459.94 s [vector] mut_ifoldl: OK (0.01s)
  11657. 1459.94 s [vector] +++ OK, passed 100 tests.
  11658. 1459.96 s [vector] mut_ifoldl': OK (0.01s)
  11659. 1459.96 s [vector] +++ OK, passed 100 tests.
  11660. 1459.98 s [vector] mut_foldM: OK (0.01s)
  11661. 1459.98 s [vector] +++ OK, passed 100 tests.
  11662. 1459.98 s [vector] mut_foldM': OK (0.01s)
  11663. 1459.98 s [vector] +++ OK, passed 100 tests.
  11664. 1459.99 s [vector] mut_foldrM: OK
  11665. 1459.99 s [vector] +++ OK, passed 100 tests.
  11666. 1460.03 s [vector] mut_foldrM': OK (0.02s)
  11667. 1460.03 s [vector] +++ OK, passed 100 tests.
  11668. 1460.04 s [vector] mut_ifoldM: OK (0.03s)
  11669. 1460.04 s [vector] +++ OK, passed 100 tests.
  11670. 1460.05 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 )
  11671. 1460.06 s [vector] mut_ifoldM': OK (0.02s)
  11672. 1460.06 s [vector] +++ OK, passed 100 tests.
  11673. 1460.08 s [vector] mut_ifoldrM: OK (0.02s)
  11674. 1460.09 s [vector] +++ OK, passed 100 tests.
  11675. 1460.11 s [vector] mut_ifoldrM': OK (0.03s)
  11676. 1460.11 s [vector] +++ OK, passed 100 tests.
  11677. 1460.11 s [vector] compare: OK
  11678. 1460.11 s [vector] +++ OK, passed 100 tests.
  11679. 1460.11 s [vector] maximum: OK
  11680. 1460.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11681. 1460.11 s [vector] minimum: OK
  11682. 1460.11 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11683. 1460.11 s [vector] minIndex: OK
  11684. 1460.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11685. 1460.11 s [vector] maxIndex: OK
  11686. 1460.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11687. 1460.11 s [vector] maximumBy: OK
  11688. 1460.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11689. 1460.11 s [vector] minimumBy: OK
  11690. 1460.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11691. 1460.11 s [vector] maximumOn: OK
  11692. 1460.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11693. 1460.12 s [vector] minimumOn: OK
  11694. 1460.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11695. 1460.12 s [vector] maxIndexBy: OK
  11696. 1460.12 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11697. 1460.12 s [vector] minIndexBy: OK
  11698. 1460.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11699. 1460.12 s [vector] ListFirstMaxIndexWins: OK
  11700. 1460.12 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11701. 1460.12 s [vector] FalseListFirstMaxIndexWins: OK
  11702. 1460.12 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11703. 1460.12 s [vector] []
  11704. 1460.13 s [vector] mempty: OK
  11705. 1460.14 s [vector] +++ OK, passed 100 tests.
  11706. 1460.14 s [vector] mappend: OK
  11707. 1460.14 s [vector] +++ OK, passed 100 tests.
  11708. 1460.16 s [vector] mconcat: OK (0.03s)
  11709. 1460.16 s [vector] +++ OK, passed 100 tests.
  11710. 1460.16 s [vector] glength: OK
  11711. 1460.16 s [vector] +++ OK, passed 100 tests.
  11712. 1460.16 s [vector] sum: OK
  11713. 1460.16 s [vector] +++ OK, passed 100 tests.
  11714. 1460.16 s [vector] product: OK
  11715. 1460.16 s [vector] +++ OK, passed 100 tests.
  11716. 1460.16 s [vector] enumFromN: OK
  11717. 1460.16 s [vector] +++ OK, passed 100 tests.
  11718. 1460.16 s [vector] enumFromThenN: OK
  11719. 1460.16 s [vector] +++ OK, passed 100 tests.
  11720. 1460.16 s [vector] enumFromTo: OK
  11721. 1460.16 s [vector] +++ OK, passed 100 tests.
  11722. 1460.16 s [vector] enumFromThenTo: OK
  11723. 1460.16 s [vector] +++ OK, passed 100 tests.
  11724. 1460.16 s [vector] unstream
  11725. 1460.16 s [vector] unstream == vunstream (exact): OK
  11726. 1460.16 s [vector] +++ OK, passed 100 tests.
  11727. 1460.16 s [vector] unstream == vunstream (unknown): OK
  11728. 1460.16 s [vector] +++ OK, passed 100 tests.
  11729. 1460.16 s [vector] unstreamR ~= vunstream (exact): OK
  11730. 1460.16 s [vector] +++ OK, passed 100 tests.
  11731. 1460.17 s [vector] unstreamR ~= vunstream (unknown): OK
  11732. 1460.17 s [vector] +++ OK, passed 100 tests.
  11733. 1460.17 s [vector] Tests.Vector.Storable
  11734. 1460.17 s [vector] Data.Vector.Storable.Vector (Int)
  11735. 1460.17 s [vector] fromList.toList == id: OK
  11736. 1460.17 s [vector] +++ OK, passed 100 tests.
  11737. 1460.17 s [vector] toList.fromList == id: OK
  11738. 1460.17 s [vector] +++ OK, passed 100 tests.
  11739. 1460.17 s [vector] unstream.stream == id: OK
  11740. 1460.17 s [vector] +++ OK, passed 100 tests.
  11741. 1460.17 s [vector] stream.unstream == id: OK
  11742. 1460.17 s [vector] +++ OK, passed 100 tests.
  11743. 1460.17 s [vector] eq: OK
  11744. 1460.17 s [vector] +++ OK, passed 100 tests.
  11745. 1460.17 s [vector] length: OK
  11746. 1460.17 s [vector] +++ OK, passed 100 tests.
  11747. 1460.17 s [vector] null: OK
  11748. 1460.17 s [vector] +++ OK, passed 100 tests.
  11749. 1460.17 s [vector] index: OK
  11750. 1460.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11751. 1460.17 s [vector] safeIndex: OK
  11752. 1460.17 s [vector] +++ OK, passed 100 tests.
  11753. 1460.17 s [vector] head: OK
  11754. 1460.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11755. 1460.17 s [vector] last: OK
  11756. 1460.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11757. 1460.17 s [vector] unsafeIndex: OK
  11758. 1460.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11759. 1460.17 s [vector] unsafeHead: OK
  11760. 1460.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11761. 1460.17 s [vector] unsafeLast: OK
  11762. 1460.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11763. 1460.17 s [vector] slice: OK
  11764. 1460.18 s [vector] +++ OK, passed 100 tests.
  11765. 1460.18 s [vector] init: OK
  11766. 1460.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11767. 1460.18 s [vector] tail: OK
  11768. 1460.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11769. 1460.18 s [vector] take: OK
  11770. 1460.18 s [vector] +++ OK, passed 100 tests.
  11771. 1460.18 s [vector] drop: OK
  11772. 1460.18 s [vector] +++ OK, passed 100 tests.
  11773. 1460.18 s [vector] splitAt: OK
  11774. 1460.18 s [vector] +++ OK, passed 100 tests.
  11775. 1460.18 s [vector] empty: OK
  11776. 1460.18 s [vector] +++ OK, passed 100 tests.
  11777. 1460.18 s [vector] singleton: OK
  11778. 1460.18 s [vector] +++ OK, passed 100 tests.
  11779. 1460.18 s [vector] replicate: OK
  11780. 1460.18 s [vector] +++ OK, passed 100 tests.
  11781. 1460.18 s [vector] generate: OK
  11782. 1460.18 s [vector] +++ OK, passed 100 tests.
  11783. 1460.18 s [vector] iterateN: OK
  11784. 1460.18 s [vector] +++ OK, passed 100 tests.
  11785. 1460.19 s [vector] iterateNM: OK (0.01s)
  11786. 1460.19 s [vector] +++ OK, passed 100 tests.
  11787. 1460.22 s [vector] generateM: OK (0.01s)
  11788. 1460.22 s [vector] +++ OK, passed 100 tests.
  11789. 1460.23 s [vector] replicateM: OK (0.01s)
  11790. 1460.23 s [vector] +++ OK, passed 100 tests.
  11791. 1460.23 s [vector] create: OK
  11792. 1460.23 s [vector] +++ OK, passed 100 tests.
  11793. 1460.23 s [vector] createT: OK
  11794. 1460.23 s [vector] +++ OK, passed 100 tests.
  11795. 1460.23 s [vector] unfoldr: OK
  11796. 1460.23 s [vector] +++ OK, passed 100 tests.
  11797. 1460.23 s [vector] unfoldrN: OK
  11798. 1460.23 s [vector] +++ OK, passed 100 tests.
  11799. 1460.24 s [vector] unfoldrExactN: OK
  11800. 1460.24 s [vector] +++ OK, passed 100 tests.
  11801. 1460.24 s [vector] unfoldrM: OK
  11802. 1460.24 s [vector] +++ OK, passed 100 tests.
  11803. 1460.24 s [vector] unfoldrNM: OK
  11804. 1460.24 s [vector] +++ OK, passed 100 tests.
  11805. 1460.26 s [vector] unfoldrExactNM: OK (0.02s)
  11806. 1460.26 s [vector] +++ OK, passed 100 tests.
  11807. 1460.26 s [vector] constructN: OK
  11808. 1460.26 s [vector] +++ OK, passed 100 tests.
  11809. 1460.26 s [vector] constructrN: OK
  11810. 1460.26 s [vector] +++ OK, passed 100 tests.
  11811. 1460.26 s [vector] cons: OK
  11812. 1460.26 s [vector] +++ OK, passed 100 tests.
  11813. 1460.26 s [vector] snoc: OK
  11814. 1460.26 s [vector] +++ OK, passed 100 tests.
  11815. 1460.28 s [vector] append: OK
  11816. 1460.28 s [vector] +++ OK, passed 100 tests.
  11817. 1460.28 s [vector] concat: OK (0.01s)
  11818. 1460.28 s [vector] +++ OK, passed 100 tests.
  11819. 1460.28 s [vector] force: OK
  11820. 1460.28 s [vector] +++ OK, passed 100 tests.
  11821. 1460.28 s [vector] upd: OK
  11822. 1460.28 s [vector] +++ OK, passed 100 tests.
  11823. 1460.29 s [vector] accum: OK
  11824. 1460.29 s [vector] +++ OK, passed 100 tests.
  11825. 1460.29 s [vector] reverse: OK
  11826. 1460.29 s [vector] +++ OK, passed 100 tests.
  11827. 1460.29 s [vector] backpermute: OK
  11828. 1460.29 s [vector] +++ OK, passed 100 tests.
  11829. 1460.29 s [vector] map: OK
  11830. 1460.29 s [vector] +++ OK, passed 100 tests.
  11831. 1460.29 s [vector] imap: OK
  11832. 1460.29 s [vector] +++ OK, passed 100 tests.
  11833. 1460.29 s [vector] concatMap: OK
  11834. 1460.30 s [vector] +++ OK, passed 100 tests.
  11835. 1460.30 s [vector] mapM: OK
  11836. 1460.30 s [vector] +++ OK, passed 100 tests.
  11837. 1460.31 s [vector] mapM_: OK (0.01s)
  11838. 1460.31 s [vector] +++ OK, passed 100 tests.
  11839. 1460.32 s [vector] forM: OK
  11840. 1460.32 s [vector] +++ OK, passed 100 tests.
  11841. 1460.34 s [vector] forM_: OK (0.02s)
  11842. 1460.34 s [vector] +++ OK, passed 100 tests.
  11843. 1460.34 s [vector] imapM: OK
  11844. 1460.34 s [vector] +++ OK, passed 100 tests.
  11845. 1460.35 s [vector] imapM_: OK (0.02s)
  11846. 1460.35 s [vector] +++ OK, passed 100 tests.
  11847. 1460.36 s [vector] zipWith: OK
  11848. 1460.36 s [vector] +++ OK, passed 100 tests.
  11849. 1460.36 s [vector] zipWith3: OK
  11850. 1460.36 s [vector] +++ OK, passed 100 tests.
  11851. 1460.36 s [vector] izipWith: OK
  11852. 1460.36 s [vector] +++ OK, passed 100 tests.
  11853. 1460.37 s [vector] izipWith3: OK
  11854. 1460.37 s [vector] +++ OK, passed 100 tests.
  11855. 1460.37 s [vector] izipWithM: OK
  11856. 1460.37 s [vector] +++ OK, passed 100 tests.
  11857. 1460.38 s [vector] izipWithM_: OK (0.01s)
  11858. 1460.38 s [vector] +++ OK, passed 100 tests.
  11859. 1460.40 s [vector] zipWithM: OK
  11860. 1460.40 s [vector] +++ OK, passed 100 tests.
  11861. 1460.40 s [vector] zipWithM_: OK (0.01s)
  11862. 1460.40 s [vector] +++ OK, passed 100 tests.
  11863. 1460.40 s [vector] filter: OK
  11864. 1460.40 s [vector] +++ OK, passed 100 tests.
  11865. 1460.40 s [vector] ifilter: OK
  11866. 1460.41 s [vector] +++ OK, passed 100 tests.
  11867. 1460.44 s [vector] filterM: OK (0.03s)
  11868. 1460.44 s [vector] +++ OK, passed 100 tests.
  11869. 1460.44 s [vector] uniq: OK
  11870. 1460.44 s [vector] +++ OK, passed 100 tests.
  11871. 1460.44 s [vector] mapMaybe: OK
  11872. 1460.44 s [vector] +++ OK, passed 100 tests.
  11873. 1460.45 s [vector] imapMaybe: OK
  11874. 1460.45 s [vector] +++ OK, passed 100 tests.
  11875. 1460.45 s [vector] takeWhile: OK
  11876. 1460.45 s [vector] +++ OK, passed 100 tests.
  11877. 1460.46 s [vector] dropWhile: OK
  11878. 1460.46 s [vector] +++ OK, passed 100 tests.
  11879. 1460.46 s [vector] partition: OK
  11880. 1460.46 s [vector] +++ OK, passed 100 tests.
  11881. 1460.46 s [vector] partitionWith: OK
  11882. 1460.46 s [vector] +++ OK, passed 100 tests.
  11883. 1460.46 s [vector] span: OK
  11884. 1460.46 s [vector] +++ OK, passed 100 tests.
  11885. 1460.46 s [vector] break: OK
  11886. 1460.47 s [vector] +++ OK, passed 100 tests.
  11887. 1460.47 s [vector] spanR: OK
  11888. 1460.47 s [vector] +++ OK, passed 100 tests.
  11889. 1460.47 s [vector] breakR: OK
  11890. 1460.47 s [vector] +++ OK, passed 100 tests.
  11891. 1460.47 s [vector] groupBy: OK
  11892. 1460.47 s [vector] +++ OK, passed 100 tests.
  11893. 1460.47 s [vector] elem: OK
  11894. 1460.47 s [vector] +++ OK, passed 100 tests.
  11895. 1460.47 s [vector] notElem: OK
  11896. 1460.48 s [vector] +++ OK, passed 100 tests.
  11897. 1460.48 s [vector] find: OK
  11898. 1460.48 s [vector] +++ OK, passed 100 tests.
  11899. 1460.48 s [vector] findIndex: OK
  11900. 1460.48 s [vector] +++ OK, passed 100 tests.
  11901. 1460.48 s [vector] findIndexR: OK
  11902. 1460.48 s [vector] +++ OK, passed 100 tests.
  11903. 1460.48 s [vector] findIndices: OK
  11904. 1460.48 s [vector] +++ OK, passed 100 tests.
  11905. 1460.48 s [vector] elemIndex: OK
  11906. 1460.48 s [vector] +++ OK, passed 100 tests.
  11907. 1460.48 s [vector] elemIndices: OK
  11908. 1460.48 s [vector] +++ OK, passed 100 tests.
  11909. 1460.48 s [vector] foldl: OK
  11910. 1460.48 s [vector] +++ OK, passed 100 tests.
  11911. 1460.49 s [vector] foldl1: OK
  11912. 1460.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11913. 1460.49 s [vector] foldl': OK
  11914. 1460.49 s [vector] +++ OK, passed 100 tests.
  11915. 1460.50 s [vector] foldl1': OK
  11916. 1460.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11917. 1460.50 s [vector] foldr: OK
  11918. 1460.50 s [vector] +++ OK, passed 100 tests.
  11919. 1460.50 s [vector] foldr1: OK
  11920. 1460.50 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11921. 1460.50 s [vector] foldr': OK
  11922. 1460.50 s [vector] +++ OK, passed 100 tests.
  11923. 1460.50 s [vector] foldr1': OK
  11924. 1460.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11925. 1460.51 s [vector] ifoldl: OK
  11926. 1460.51 s [vector] +++ OK, passed 100 tests.
  11927. 1460.51 s [vector] ifoldl': OK
  11928. 1460.51 s [vector] +++ OK, passed 100 tests.
  11929. 1460.51 s [vector] ifoldr: OK
  11930. 1460.51 s [vector] +++ OK, passed 100 tests.
  11931. 1460.51 s [vector] ifoldr': OK
  11932. 1460.51 s [vector] +++ OK, passed 100 tests.
  11933. 1460.52 s [vector] ifoldM: OK
  11934. 1460.52 s [vector] +++ OK, passed 100 tests.
  11935. 1460.52 s [vector] ifoldM': OK
  11936. 1460.52 s [vector] +++ OK, passed 100 tests.
  11937. 1460.54 s [vector] ifoldM_: OK (0.02s)
  11938. 1460.54 s [vector] +++ OK, passed 100 tests.
  11939. 1460.55 s [vector] ifoldM'_: OK (0.02s)
  11940. 1460.55 s [vector] +++ OK, passed 100 tests.
  11941. 1460.55 s [vector] all: OK
  11942. 1460.55 s [vector] +++ OK, passed 100 tests.
  11943. 1460.55 s [vector] any: OK
  11944. 1460.56 s [vector] +++ OK, passed 100 tests.
  11945. 1460.56 s [vector] prescanl: OK
  11946. 1460.56 s [vector] +++ OK, passed 100 tests.
  11947. 1460.56 s [vector] prescanl': OK
  11948. 1460.56 s [vector] +++ OK, passed 100 tests.
  11949. 1460.56 s [vector] postscanl: OK
  11950. 1460.56 s [vector] +++ OK, passed 100 tests.
  11951. 1460.57 s [vector] postscanl': OK
  11952. 1460.57 s [vector] +++ OK, passed 100 tests.
  11953. 1460.57 s [vector] scanl: OK
  11954. 1460.57 s [vector] +++ OK, passed 100 tests.
  11955. 1460.57 s [vector] scanl': OK
  11956. 1460.57 s [vector] +++ OK, passed 100 tests.
  11957. 1460.57 s [vector] scanl1: OK
  11958. 1460.58 s [vector] +++ OK, passed 100 tests.
  11959. 1460.58 s [vector] scanl1': OK
  11960. 1460.58 s [vector] +++ OK, passed 100 tests.
  11961. 1460.58 s [vector] iscanl: OK
  11962. 1460.58 s [vector] +++ OK, passed 100 tests.
  11963. 1460.58 s [vector] iscanl': OK
  11964. 1460.58 s [vector] +++ OK, passed 100 tests.
  11965. 1460.58 s [vector] prescanr: OK
  11966. 1460.58 s [vector] +++ OK, passed 100 tests.
  11967. 1460.59 s [vector] prescanr': OK
  11968. 1460.59 s [vector] +++ OK, passed 100 tests.
  11969. 1460.59 s [vector] postscanr: OK
  11970. 1460.59 s [vector] +++ OK, passed 100 tests.
  11971. 1460.59 s [vector] postscanr': OK
  11972. 1460.59 s [vector] +++ OK, passed 100 tests.
  11973. 1460.59 s [vector] scanr: OK
  11974. 1460.59 s [vector] +++ OK, passed 100 tests.
  11975. 1460.60 s [vector] scanr': OK
  11976. 1460.60 s [vector] +++ OK, passed 100 tests.
  11977. 1460.60 s [vector] scanr1: OK
  11978. 1460.60 s [vector] +++ OK, passed 100 tests.
  11979. 1460.60 s [vector] scanr1': OK
  11980. 1460.60 s [vector] +++ OK, passed 100 tests.
  11981. 1460.60 s [vector] iscanr: OK
  11982. 1460.61 s [vector] +++ OK, passed 100 tests.
  11983. 1460.61 s [vector] iscanr': OK
  11984. 1460.61 s [vector] +++ OK, passed 100 tests.
  11985. 1460.61 s [vector] mut_read: OK
  11986. 1460.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11987. 1460.61 s [vector] mut_write: OK
  11988. 1460.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11989. 1460.61 s [vector] mut_modify: OK
  11990. 1460.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11991. 1460.62 s [vector] mut_generate: OK
  11992. 1460.62 s [vector] +++ OK, passed 100 tests.
  11993. 1460.62 s [vector] mut_generateM: OK
  11994. 1460.62 s [vector] +++ OK, passed 100 tests.
  11995. 1460.64 s [vector] mut_mapM_: OK
  11996. 1460.64 s [vector] +++ OK, passed 100 tests.
  11997. 1460.66 s [vector] mut_imapM_: OK (0.02s)
  11998. 1460.66 s [vector] +++ OK, passed 100 tests.
  11999. 1460.68 s [vector] mut_forM_: OK (0.02s)
  12000. 1460.68 s [vector] +++ OK, passed 100 tests.
  12001. 1460.68 s [vector] mut_iforM_: OK (0.02s)
  12002. 1460.68 s [vector] +++ OK, passed 100 tests.
  12003. 1460.68 s [vector] mut_foldr: OK
  12004. 1460.68 s [vector] +++ OK, passed 100 tests.
  12005. 1460.69 s [vector] mut_foldr': OK
  12006. 1460.69 s [vector] +++ OK, passed 100 tests.
  12007. 1460.69 s [vector] mut_foldl: OK
  12008. 1460.69 s [vector] +++ OK, passed 100 tests.
  12009. 1460.69 s [vector] mut_foldl': OK
  12010. 1460.69 s [vector] +++ OK, passed 100 tests.
  12011. 1460.70 s [vector] mut_ifoldr: OK
  12012. 1460.70 s [vector] +++ OK, passed 100 tests.
  12013. 1460.70 s [vector] mut_ifoldr': OK
  12014. 1460.70 s [vector] +++ OK, passed 100 tests.
  12015. 1460.71 s [vector] mut_ifoldl: OK
  12016. 1460.71 s [vector] +++ OK, passed 100 tests.
  12017. 1460.72 s [vector] mut_ifoldl': OK
  12018. 1460.72 s [vector] +++ OK, passed 100 tests.
  12019. 1460.72 s [vector] mut_foldM: OK
  12020. 1460.72 s [vector] +++ OK, passed 100 tests.
  12021. 1460.72 s [vector] mut_foldM': OK
  12022. 1460.72 s [vector] +++ OK, passed 100 tests.
  12023. 1460.72 s [vector] mut_foldrM: OK
  12024. 1460.72 s [vector] +++ OK, passed 100 tests.
  12025. 1460.72 s [vector] mut_foldrM': OK
  12026. 1460.72 s [vector] +++ OK, passed 100 tests.
  12027. 1460.72 s [vector] mut_ifoldM: OK
  12028. 1460.72 s [vector] +++ OK, passed 100 tests.
  12029. 1460.72 s [vector] mut_ifoldM': OK
  12030. 1460.72 s [vector] +++ OK, passed 100 tests.
  12031. 1460.73 s [vector] mut_ifoldrM: OK
  12032. 1460.73 s [vector] +++ OK, passed 100 tests.
  12033. 1460.73 s [vector] mut_ifoldrM': OK
  12034. 1460.73 s [vector] +++ OK, passed 100 tests.
  12035. 1460.73 s [vector] compare: OK
  12036. 1460.73 s [vector] +++ OK, passed 100 tests.
  12037. 1460.73 s [vector] maximum: OK
  12038. 1460.73 s [vector] +++ OK, passed 100 tests; 31 discarded.
  12039. 1460.73 s [vector] minimum: OK
  12040. 1460.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12041. 1460.73 s [vector] minIndex: OK
  12042. 1460.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12043. 1460.73 s [vector] maxIndex: OK
  12044. 1460.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12045. 1460.73 s [vector] maximumBy: OK
  12046. 1460.73 s [vector] +++ OK, passed 100 tests; 27 discarded.
  12047. 1460.73 s [vector] minimumBy: OK
  12048. 1460.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12049. 1460.73 s [vector] maximumOn: OK
  12050. 1460.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12051. 1460.74 s [vector] minimumOn: OK
  12052. 1460.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12053. 1460.74 s [vector] maxIndexBy: OK
  12054. 1460.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12055. 1460.74 s [vector] minIndexBy: OK
  12056. 1460.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12057. 1460.74 s [vector] ListFirstMaxIndexWins: OK
  12058. 1460.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12059. 1460.74 s [vector] FalseListFirstMaxIndexWins: OK
  12060. 1460.74 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12061. 1460.74 s [vector] []
  12062. 1460.74 s [vector] mempty: OK
  12063. 1460.74 s [vector] +++ OK, passed 100 tests.
  12064. 1460.74 s [vector] mappend: OK
  12065. 1460.74 s [vector] +++ OK, passed 100 tests.
  12066. 1460.75 s [vector] mconcat: OK (0.01s)
  12067. 1460.75 s [vector] +++ OK, passed 100 tests.
  12068. 1460.75 s [vector] glength: OK
  12069. 1460.75 s [vector] +++ OK, passed 100 tests.
  12070. 1460.76 s [vector] sum: OK
  12071. 1460.76 s [vector] +++ OK, passed 100 tests.
  12072. 1460.76 s [vector] product: OK
  12073. 1460.76 s [vector] +++ OK, passed 100 tests.
  12074. 1460.76 s [vector] enumFromN: OK
  12075. 1460.76 s [vector] +++ OK, passed 100 tests.
  12076. 1460.76 s [vector] enumFromThenN: OK
  12077. 1460.76 s [vector] +++ OK, passed 100 tests.
  12078. 1460.76 s [vector] enumFromTo: OK
  12079. 1460.76 s [vector] +++ OK, passed 100 tests.
  12080. 1460.76 s [vector] enumFromThenTo: OK
  12081. 1460.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12082. 1460.76 s [vector] Data.Vector.Storable.Vector (Double)
  12083. 1460.76 s [vector] fromList.toList == id: OK
  12084. 1460.76 s [vector] +++ OK, passed 100 tests.
  12085. 1460.76 s [vector] toList.fromList == id: OK
  12086. 1460.76 s [vector] +++ OK, passed 100 tests.
  12087. 1460.76 s [vector] unstream.stream == id: OK
  12088. 1460.76 s [vector] +++ OK, passed 100 tests.
  12089. 1460.76 s [vector] stream.unstream == id: OK
  12090. 1460.76 s [vector] +++ OK, passed 100 tests.
  12091. 1460.76 s [vector] eq: OK
  12092. 1460.76 s [vector] +++ OK, passed 100 tests.
  12093. 1460.76 s [vector] length: OK
  12094. 1460.76 s [vector] +++ OK, passed 100 tests.
  12095. 1460.76 s [vector] null: OK
  12096. 1460.76 s [vector] +++ OK, passed 100 tests.
  12097. 1460.76 s [vector] index: OK
  12098. 1460.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12099. 1460.76 s [vector] safeIndex: OK
  12100. 1460.76 s [vector] +++ OK, passed 100 tests.
  12101. 1460.76 s [vector] head: OK
  12102. 1460.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12103. 1460.77 s [vector] last: OK
  12104. 1460.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12105. 1460.77 s [vector] unsafeIndex: OK
  12106. 1460.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12107. 1460.77 s [vector] unsafeHead: OK
  12108. 1460.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12109. 1460.77 s [vector] unsafeLast: OK
  12110. 1460.77 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12111. 1460.77 s [vector] slice: OK
  12112. 1460.77 s [vector] +++ OK, passed 100 tests.
  12113. 1460.77 s [vector] init: OK
  12114. 1460.77 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12115. 1460.77 s [vector] tail: OK
  12116. 1460.77 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12117. 1460.77 s [vector] take: OK
  12118. 1460.77 s [vector] +++ OK, passed 100 tests.
  12119. 1460.77 s [vector] drop: OK
  12120. 1460.77 s [vector] +++ OK, passed 100 tests.
  12121. 1460.77 s [vector] splitAt: OK
  12122. 1460.77 s [vector] +++ OK, passed 100 tests.
  12123. 1460.77 s [vector] empty: OK
  12124. 1460.77 s [vector] +++ OK, passed 100 tests.
  12125. 1460.77 s [vector] singleton: OK
  12126. 1460.77 s [vector] +++ OK, passed 100 tests.
  12127. 1460.77 s [vector] replicate: OK
  12128. 1460.77 s [vector] +++ OK, passed 100 tests.
  12129. 1460.77 s [vector] generate: OK
  12130. 1460.78 s [vector] +++ OK, passed 100 tests.
  12131. 1460.78 s [vector] iterateN: OK
  12132. 1460.78 s [vector] +++ OK, passed 100 tests.
  12133. 1460.80 s [vector] iterateNM: OK (0.01s)
  12134. 1460.80 s [vector] +++ OK, passed 100 tests.
  12135. 1460.82 s [vector] generateM: OK (0.03s)
  12136. 1460.82 s [vector] +++ OK, passed 100 tests.
  12137. 1460.84 s [vector] replicateM: OK (0.02s)
  12138. 1460.84 s [vector] +++ OK, passed 100 tests.
  12139. 1460.84 s [vector] create: OK
  12140. 1460.84 s [vector] +++ OK, passed 100 tests.
  12141. 1460.84 s [vector] createT: OK
  12142. 1460.84 s [vector] +++ OK, passed 100 tests.
  12143. 1460.84 s [vector] unfoldr: OK
  12144. 1460.84 s [vector] +++ OK, passed 100 tests.
  12145. 1460.84 s [vector] unfoldrN: OK
  12146. 1460.84 s [vector] +++ OK, passed 100 tests.
  12147. 1460.84 s [vector] unfoldrExactN: OK
  12148. 1460.84 s [vector] +++ OK, passed 100 tests.
  12149. 1460.84 s [vector] unfoldrM: OK
  12150. 1460.84 s [vector] +++ OK, passed 100 tests.
  12151. 1460.87 s [vector] unfoldrNM: OK
  12152. 1460.87 s [vector] +++ OK, passed 100 tests.
  12153. 1460.87 s [vector] unfoldrExactNM: OK (0.01s)
  12154. 1460.87 s [vector] +++ OK, passed 100 tests.
  12155. 1460.90 s [vector] constructN: OK (0.02s)
  12156. 1460.90 s [vector] +++ OK, passed 100 tests.
  12157. 1460.90 s [vector] constructrN: OK (0.02s)
  12158. 1460.90 s [vector] +++ OK, passed 100 tests.
  12159. 1460.90 s [vector] cons: OK
  12160. 1460.90 s [vector] +++ OK, passed 100 tests.
  12161. 1460.90 s [vector] snoc: OK
  12162. 1460.90 s [vector] +++ OK, passed 100 tests.
  12163. 1460.92 s [vector] append: OK
  12164. 1460.92 s [vector] +++ OK, passed 100 tests.
  12165. 1460.93 s [vector] concat: OK (0.02s)
  12166. 1460.93 s [vector] +++ OK, passed 100 tests.
  12167. 1460.93 s [vector] force: OK
  12168. 1460.93 s [vector] +++ OK, passed 100 tests.
  12169. 1460.94 s [vector] upd: OK
  12170. 1460.94 s [vector] +++ OK, passed 100 tests.
  12171. 1460.94 s [vector] accum: OK (0.01s)
  12172. 1460.94 s [vector] +++ OK, passed 100 tests.
  12173. 1460.94 s [vector] reverse: OK
  12174. 1460.95 s [vector] +++ OK, passed 100 tests.
  12175. 1460.96 s [vector] backpermute: OK
  12176. 1460.96 s [vector] +++ OK, passed 100 tests.
  12177. 1460.97 s [vector] map: OK
  12178. 1460.97 s [vector] +++ OK, passed 100 tests.
  12179. 1460.97 s [vector] imap: OK
  12180. 1460.97 s [vector] +++ OK, passed 100 tests.
  12181. 1460.97 s [vector] concatMap: OK
  12182. 1460.98 s [vector] +++ OK, passed 100 tests.
  12183. 1460.99 s [vector] mapM: OK
  12184. 1460.99 s [vector] +++ OK, passed 100 tests.
  12185. 1461.02 s [vector] mapM_: OK (0.04s)
  12186. 1461.02 s [vector] +++ OK, passed 100 tests.
  12187. 1461.02 s [vector] forM: OK
  12188. 1461.02 s [vector] +++ OK, passed 100 tests.
  12189. 1461.06 s [vector] forM_: OK (0.04s)
  12190. 1461.06 s [vector] +++ OK, passed 100 tests.
  12191. 1461.07 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 )
  12192. 1461.08 s [vector] imapM: OK
  12193. 1461.08 s [vector] +++ OK, passed 100 tests.
  12194. 1461.12 s [vector] imapM_: OK (0.05s)
  12195. 1461.12 s [vector] +++ OK, passed 100 tests.
  12196. 1461.12 s [vector] zipWith: OK
  12197. 1461.12 s [vector] +++ OK, passed 100 tests.
  12198. 1461.14 s [vector] zipWith3: OK (0.01s)
  12199. 1461.14 s [vector] +++ OK, passed 100 tests.
  12200. 1461.14 s [vector] izipWith: OK (0.01s)
  12201. 1461.14 s [vector] +++ OK, passed 100 tests.
  12202. 1461.16 s [vector] izipWith3: OK (0.01s)
  12203. 1461.16 s [vector] +++ OK, passed 100 tests.
  12204. 1461.17 s [vector] izipWithM: OK
  12205. 1461.17 s [vector] +++ OK, passed 100 tests.
  12206. 1461.20 s [vector] izipWithM_: OK (0.03s)
  12207. 1461.20 s [vector] +++ OK, passed 100 tests.
  12208. 1461.21 s [vector] zipWithM: OK
  12209. 1461.21 s [vector] +++ OK, passed 100 tests.
  12210. 1461.23 s [vector] zipWithM_: OK (0.03s)
  12211. 1461.24 s [vector] +++ OK, passed 100 tests.
  12212. 1461.24 s [vector] filter: OK
  12213. 1461.24 s [vector] +++ OK, passed 100 tests.
  12214. 1461.24 s [vector] ifilter: OK
  12215. 1461.24 s [vector] +++ OK, passed 100 tests.
  12216. 1461.28 s [vector] filterM: OK (0.04s)
  12217. 1461.28 s [vector] +++ OK, passed 100 tests.
  12218. 1461.28 s [vector] uniq: OK
  12219. 1461.28 s [vector] +++ OK, passed 100 tests.
  12220. 1461.30 s [vector] mapMaybe: OK
  12221. 1461.30 s [vector] +++ OK, passed 100 tests.
  12222. 1461.30 s [vector] imapMaybe: OK
  12223. 1461.30 s [vector] +++ OK, passed 100 tests.
  12224. 1461.30 s [vector] takeWhile: OK
  12225. 1461.30 s [vector] +++ OK, passed 100 tests.
  12226. 1461.31 s [vector] dropWhile: OK
  12227. 1461.31 s [vector] +++ OK, passed 100 tests.
  12228. 1461.31 s [vector] partition: OK
  12229. 1461.32 s [vector] +++ OK, passed 100 tests.
  12230. 1461.32 s [vector] partitionWith: OK (0.01s)
  12231. 1461.32 s [vector] +++ OK, passed 100 tests.
  12232. 1461.32 s [vector] span: OK
  12233. 1461.32 s [vector] +++ OK, passed 100 tests.
  12234. 1461.32 s [vector] break: OK
  12235. 1461.32 s [vector] +++ OK, passed 100 tests.
  12236. 1461.33 s [vector] spanR: OK
  12237. 1461.33 s [vector] +++ OK, passed 100 tests.
  12238. 1461.33 s [vector] breakR: OK
  12239. 1461.34 s [vector] +++ OK, passed 100 tests.
  12240. 1461.34 s [vector] groupBy: OK
  12241. 1461.34 s [vector] +++ OK, passed 100 tests.
  12242. 1461.34 s [vector] elem: OK
  12243. 1461.34 s [vector] +++ OK, passed 100 tests.
  12244. 1461.34 s [vector] notElem: OK
  12245. 1461.34 s [vector] +++ OK, passed 100 tests.
  12246. 1461.34 s [vector] find: OK
  12247. 1461.34 s [vector] +++ OK, passed 100 tests.
  12248. 1461.35 s [vector] findIndex: OK
  12249. 1461.35 s [vector] +++ OK, passed 100 tests.
  12250. 1461.35 s [vector] findIndexR: OK
  12251. 1461.35 s [vector] +++ OK, passed 100 tests.
  12252. 1461.35 s [vector] findIndices: OK
  12253. 1461.35 s [vector] +++ OK, passed 100 tests.
  12254. 1461.35 s [vector] elemIndex: OK
  12255. 1461.35 s [vector] +++ OK, passed 100 tests.
  12256. 1461.36 s [vector] elemIndices: OK
  12257. 1461.36 s [vector] +++ OK, passed 100 tests.
  12258. 1461.37 s [vector] foldl: OK (0.01s)
  12259. 1461.37 s [vector] +++ OK, passed 100 tests.
  12260. 1461.38 s [vector] foldl1: OK (0.01s)
  12261. 1461.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12262. 1461.38 s [vector] foldl': OK (0.01s)
  12263. 1461.38 s [vector] +++ OK, passed 100 tests.
  12264. 1461.40 s [vector] foldl1': OK (0.02s)
  12265. 1461.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12266. 1461.42 s [vector] foldr: OK (0.01s)
  12267. 1461.42 s [vector] +++ OK, passed 100 tests.
  12268. 1461.42 s [vector] foldr1: OK (0.01s)
  12269. 1461.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12270. 1461.44 s [vector] foldr': OK (0.01s)
  12271. 1461.44 s [vector] +++ OK, passed 100 tests.
  12272. 1461.45 s [vector] foldr1': OK (0.01s)
  12273. 1461.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12274. 1461.46 s [vector] ifoldl: OK (0.01s)
  12275. 1461.46 s [vector] +++ OK, passed 100 tests.
  12276. 1461.48 s [vector] ifoldl': OK
  12277. 1461.48 s [vector] +++ OK, passed 100 tests.
  12278. 1461.49 s [vector] ifoldr: OK (0.01s)
  12279. 1461.49 s [vector] +++ OK, passed 100 tests.
  12280. 1461.50 s [vector] ifoldr': OK (0.01s)
  12281. 1461.50 s [vector] +++ OK, passed 100 tests.
  12282. 1461.52 s [vector] ifoldM: OK (0.01s)
  12283. 1461.52 s [vector] +++ OK, passed 100 tests.
  12284. 1461.52 s [vector] ifoldM': OK (0.01s)
  12285. 1461.52 s [vector] +++ OK, passed 100 tests.
  12286. 1461.56 s [vector] ifoldM_: OK (0.03s)
  12287. 1461.56 s [vector] +++ OK, passed 100 tests.
  12288. 1461.58 s [vector] ifoldM'_: OK (0.03s)
  12289. 1461.58 s [vector] +++ OK, passed 100 tests.
  12290. 1461.58 s [vector] all: OK
  12291. 1461.58 s [vector] +++ OK, passed 100 tests.
  12292. 1461.58 s [vector] any: OK
  12293. 1461.58 s [vector] +++ OK, passed 100 tests.
  12294. 1461.60 s [vector] prescanl: OK (0.01s)
  12295. 1461.60 s [vector] +++ OK, passed 100 tests.
  12296. 1461.62 s [vector] prescanl': OK (0.01s)
  12297. 1461.62 s [vector] +++ OK, passed 100 tests.
  12298. 1461.62 s [vector] postscanl: OK (0.01s)
  12299. 1461.62 s [vector] +++ OK, passed 100 tests.
  12300. 1461.64 s [vector] postscanl': OK (0.01s)
  12301. 1461.64 s [vector] +++ OK, passed 100 tests.
  12302. 1461.64 s [vector] scanl: OK (0.01s)
  12303. 1461.64 s [vector] +++ OK, passed 100 tests.
  12304. 1461.66 s [vector] scanl': OK (0.01s)
  12305. 1461.66 s [vector] +++ OK, passed 100 tests.
  12306. 1461.68 s [vector] scanl1: OK (0.02s)
  12307. 1461.68 s [vector] +++ OK, passed 100 tests.
  12308. 1461.71 s [vector] scanl1': OK (0.01s)
  12309. 1461.71 s [vector] +++ OK, passed 100 tests.
  12310. 1461.71 s [vector] iscanl: OK (0.01s)
  12311. 1461.71 s [vector] +++ OK, passed 100 tests.
  12312. 1461.73 s [vector] iscanl': OK (0.02s)
  12313. 1461.73 s [vector] +++ OK, passed 100 tests.
  12314. 1461.74 s [vector] prescanr: OK (0.02s)
  12315. 1461.75 s [vector] +++ OK, passed 100 tests.
  12316. 1461.76 s [vector] prescanr': OK (0.02s)
  12317. 1461.76 s [vector] +++ OK, passed 100 tests.
  12318. 1461.78 s [vector] postscanr: OK (0.02s)
  12319. 1461.78 s [vector] +++ OK, passed 100 tests.
  12320. 1461.80 s [vector] postscanr': OK (0.01s)
  12321. 1461.80 s [vector] +++ OK, passed 100 tests.
  12322. 1461.82 s [vector] scanr: OK (0.01s)
  12323. 1461.82 s [vector] +++ OK, passed 100 tests.
  12324. 1461.83 s [vector] scanr': OK (0.01s)
  12325. 1461.83 s [vector] +++ OK, passed 100 tests.
  12326. 1461.84 s [vector] scanr1: OK (0.01s)
  12327. 1461.84 s [vector] +++ OK, passed 100 tests.
  12328. 1461.84 s [vector] scanr1': OK (0.01s)
  12329. 1461.84 s [vector] +++ OK, passed 100 tests.
  12330. 1461.86 s [vector] iscanr: OK (0.01s)
  12331. 1461.86 s [vector] +++ OK, passed 100 tests.
  12332. 1461.87 s [vector] iscanr': OK (0.01s)
  12333. 1461.87 s [vector] +++ OK, passed 100 tests.
  12334. 1461.87 s [vector] mut_read: OK
  12335. 1461.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12336. 1461.87 s [vector] mut_write: OK
  12337. 1461.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12338. 1461.87 s [vector] mut_modify: OK
  12339. 1461.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12340. 1461.88 s [vector] mut_generate: OK
  12341. 1461.88 s [vector] +++ OK, passed 100 tests.
  12342. 1461.91 s [vector] mut_generateM: OK (0.02s)
  12343. 1461.91 s [vector] +++ OK, passed 100 tests.
  12344. 1461.94 s [vector] mut_mapM_: OK (0.05s)
  12345. 1461.94 s [vector] +++ OK, passed 100 tests.
  12346. 1461.98 s [vector] mut_imapM_: OK (0.04s)
  12347. 1461.98 s [vector] +++ OK, passed 100 tests.
  12348. 1462.02 s [vector] mut_forM_: OK (0.03s)
  12349. 1462.02 s [vector] +++ OK, passed 100 tests.
  12350. 1462.04 s [vector] mut_iforM_: OK (0.03s)
  12351. 1462.04 s [vector] +++ OK, passed 100 tests.
  12352. 1462.07 s [vector] mut_foldr: OK (0.01s)
  12353. 1462.07 s [vector] +++ OK, passed 100 tests.
  12354. 1462.09 s [vector] mut_foldr': OK (0.02s)
  12355. 1462.09 s [vector] +++ OK, passed 100 tests.
  12356. 1462.10 s [vector] mut_foldl: OK (0.01s)
  12357. 1462.10 s [vector] +++ OK, passed 100 tests.
  12358. 1462.12 s [vector] mut_foldl': OK (0.01s)
  12359. 1462.12 s [vector] +++ OK, passed 100 tests.
  12360. 1462.12 s [vector] mut_ifoldr: OK (0.01s)
  12361. 1462.12 s [vector] +++ OK, passed 100 tests.
  12362. 1462.14 s [vector] mut_ifoldr': OK (0.01s)
  12363. 1462.14 s [vector] +++ OK, passed 100 tests.
  12364. 1462.15 s [vector] mut_ifoldl: OK (0.01s)
  12365. 1462.15 s [vector] +++ OK, passed 100 tests.
  12366. 1462.16 s [vector] mut_ifoldl': OK (0.01s)
  12367. 1462.16 s [vector] +++ OK, passed 100 tests.
  12368. 1462.18 s [vector] mut_foldM: OK (0.01s)
  12369. 1462.18 s [vector] +++ OK, passed 100 tests.
  12370. 1462.18 s [vector] mut_foldM': OK (0.01s)
  12371. 1462.18 s [vector] +++ OK, passed 100 tests.
  12372. 1462.20 s [vector] mut_foldrM: OK (0.01s)
  12373. 1462.20 s [vector] +++ OK, passed 100 tests.
  12374. 1462.22 s [vector] mut_foldrM': OK (0.01s)
  12375. 1462.22 s [vector] +++ OK, passed 100 tests.
  12376. 1462.22 s [vector] mut_ifoldM: OK (0.01s)
  12377. 1462.22 s [vector] +++ OK, passed 100 tests.
  12378. 1462.24 s [vector] mut_ifoldM': OK (0.01s)
  12379. 1462.24 s [vector] +++ OK, passed 100 tests.
  12380. 1462.26 s [vector] mut_ifoldrM: OK (0.01s)
  12381. 1462.26 s [vector] +++ OK, passed 100 tests.
  12382. 1462.26 s [vector] mut_ifoldrM': OK (0.01s)
  12383. 1462.26 s [vector] +++ OK, passed 100 tests.
  12384. 1462.26 s [vector] compare: OK
  12385. 1462.26 s [vector] +++ OK, passed 100 tests.
  12386. 1462.26 s [vector] maximum: OK
  12387. 1462.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12388. 1462.26 s [vector] minimum: OK
  12389. 1462.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12390. 1462.26 s [vector] minIndex: OK
  12391. 1462.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12392. 1462.26 s [vector] maxIndex: OK
  12393. 1462.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12394. 1462.26 s [vector] maximumBy: OK
  12395. 1462.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12396. 1462.26 s [vector] minimumBy: OK
  12397. 1462.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12398. 1462.27 s [vector] maximumOn: OK
  12399. 1462.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12400. 1462.27 s [vector] minimumOn: OK
  12401. 1462.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12402. 1462.27 s [vector] maxIndexBy: OK
  12403. 1462.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12404. 1462.27 s [vector] minIndexBy: OK
  12405. 1462.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12406. 1462.27 s [vector] ListFirstMaxIndexWins: OK
  12407. 1462.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12408. 1462.27 s [vector] FalseListFirstMaxIndexWins: OK
  12409. 1462.27 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12410. 1462.27 s [vector] []
  12411. 1462.27 s [vector] mempty: OK
  12412. 1462.27 s [vector] +++ OK, passed 100 tests.
  12413. 1462.27 s [vector] mappend: OK
  12414. 1462.28 s [vector] +++ OK, passed 100 tests.
  12415. 1462.31 s [vector] mconcat: OK (0.04s)
  12416. 1462.31 s [vector] +++ OK, passed 100 tests.
  12417. 1462.31 s [vector] glength: OK
  12418. 1462.31 s [vector] +++ OK, passed 100 tests.
  12419. 1462.31 s [vector] sum: OK
  12420. 1462.31 s [vector] +++ OK, passed 100 tests.
  12421. 1462.32 s [vector] product: OK
  12422. 1462.32 s [vector] +++ OK, passed 100 tests.
  12423. 1462.32 s [vector] enumFromN: OK
  12424. 1462.32 s [vector] +++ OK, passed 100 tests.
  12425. 1462.32 s [vector] enumFromThenN: OK
  12426. 1462.32 s [vector] +++ OK, passed 100 tests.
  12427. 1462.32 s [vector] enumFromTo: OK
  12428. 1462.32 s [vector] +++ OK, passed 100 tests.
  12429. 1462.32 s [vector] enumFromThenTo: OK
  12430. 1462.32 s [vector] +++ OK, passed 100 tests; 5 discarded.
  12431. 1462.32 s [vector] unstream
  12432. 1462.32 s [vector] unstream == vunstream (exact): OK
  12433. 1462.32 s [vector] +++ OK, passed 100 tests.
  12434. 1462.32 s [vector] unstream == vunstream (unknown): OK
  12435. 1462.32 s [vector] +++ OK, passed 100 tests.
  12436. 1462.32 s [vector] unstreamR ~= vunstream (exact): OK
  12437. 1462.32 s [vector] +++ OK, passed 100 tests.
  12438. 1462.32 s [vector] unstreamR ~= vunstream (unknown): OK
  12439. 1462.32 s [vector] +++ OK, passed 100 tests.
  12440. 1462.32 s [vector] Tests.Vector.Strict
  12441. 1462.32 s [vector] Bool
  12442. 1462.32 s [vector] fromList.toList == id: OK
  12443. 1462.32 s [vector] +++ OK, passed 100 tests.
  12444. 1462.32 s [vector] toList.fromList == id: OK
  12445. 1462.32 s [vector] +++ OK, passed 100 tests.
  12446. 1462.32 s [vector] unstream.stream == id: OK
  12447. 1462.32 s [vector] +++ OK, passed 100 tests.
  12448. 1462.32 s [vector] stream.unstream == id: OK
  12449. 1462.32 s [vector] +++ OK, passed 100 tests.
  12450. 1462.32 s [vector] eq: OK
  12451. 1462.32 s [vector] +++ OK, passed 100 tests.
  12452. 1462.32 s [vector] length: OK
  12453. 1462.33 s [vector] +++ OK, passed 100 tests.
  12454. 1462.33 s [vector] null: OK
  12455. 1462.33 s [vector] +++ OK, passed 100 tests.
  12456. 1462.33 s [vector] index: OK
  12457. 1462.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12458. 1462.33 s [vector] safeIndex: OK
  12459. 1462.33 s [vector] +++ OK, passed 100 tests.
  12460. 1462.33 s [vector] head: OK
  12461. 1462.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12462. 1462.33 s [vector] last: OK
  12463. 1462.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12464. 1462.33 s [vector] unsafeIndex: OK
  12465. 1462.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12466. 1462.33 s [vector] unsafeHead: OK
  12467. 1462.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12468. 1462.33 s [vector] unsafeLast: OK
  12469. 1462.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12470. 1462.33 s [vector] slice: OK
  12471. 1462.33 s [vector] +++ OK, passed 100 tests.
  12472. 1462.33 s [vector] init: OK
  12473. 1462.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12474. 1462.33 s [vector] tail: OK
  12475. 1462.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12476. 1462.33 s [vector] take: OK
  12477. 1462.33 s [vector] +++ OK, passed 100 tests.
  12478. 1462.33 s [vector] drop: OK
  12479. 1462.33 s [vector] +++ OK, passed 100 tests.
  12480. 1462.33 s [vector] splitAt: OK
  12481. 1462.33 s [vector] +++ OK, passed 100 tests.
  12482. 1462.34 s [vector] empty: OK
  12483. 1462.34 s [vector] +++ OK, passed 100 tests.
  12484. 1462.34 s [vector] singleton: OK
  12485. 1462.34 s [vector] +++ OK, passed 100 tests.
  12486. 1462.34 s [vector] replicate: OK
  12487. 1462.34 s [vector] +++ OK, passed 100 tests.
  12488. 1462.34 s [vector] generate: OK
  12489. 1462.34 s [vector] +++ OK, passed 100 tests.
  12490. 1462.34 s [vector] iterateN: OK
  12491. 1462.34 s [vector] +++ OK, passed 100 tests.
  12492. 1462.37 s [vector] iterateNM: OK (0.01s)
  12493. 1462.37 s [vector] +++ OK, passed 100 tests.
  12494. 1462.38 s [vector] generateM: OK (0.03s)
  12495. 1462.38 s [vector] +++ OK, passed 100 tests.
  12496. 1462.38 s [vector] replicateM: OK
  12497. 1462.38 s [vector] +++ OK, passed 100 tests.
  12498. 1462.38 s [vector] create: OK
  12499. 1462.38 s [vector] +++ OK, passed 100 tests.
  12500. 1462.38 s [vector] createT: OK
  12501. 1462.38 s [vector] +++ OK, passed 100 tests.
  12502. 1462.38 s [vector] unfoldr: OK
  12503. 1462.38 s [vector] +++ OK, passed 100 tests.
  12504. 1462.39 s [vector] unfoldrN: OK
  12505. 1462.39 s [vector] +++ OK, passed 100 tests.
  12506. 1462.39 s [vector] unfoldrExactN: OK
  12507. 1462.39 s [vector] +++ OK, passed 100 tests.
  12508. 1462.39 s [vector] unfoldrM: OK
  12509. 1462.39 s [vector] +++ OK, passed 100 tests.
  12510. 1462.39 s [vector] unfoldrNM: OK
  12511. 1462.39 s [vector] +++ OK, passed 100 tests.
  12512. 1462.40 s [vector] unfoldrExactNM: OK (0.01s)
  12513. 1462.40 s [vector] +++ OK, passed 100 tests.
  12514. 1462.40 s [vector] constructN: OK
  12515. 1462.40 s [vector] +++ OK, passed 100 tests.
  12516. 1462.41 s [vector] constructrN: OK
  12517. 1462.41 s [vector] +++ OK, passed 100 tests.
  12518. 1462.41 s [vector] cons: OK
  12519. 1462.41 s [vector] +++ OK, passed 100 tests.
  12520. 1462.41 s [vector] snoc: OK
  12521. 1462.41 s [vector] +++ OK, passed 100 tests.
  12522. 1462.42 s [vector] append: OK
  12523. 1462.42 s [vector] +++ OK, passed 100 tests.
  12524. 1462.42 s [vector] concat: OK (0.01s)
  12525. 1462.42 s [vector] +++ OK, passed 100 tests.
  12526. 1462.42 s [vector] force: OK
  12527. 1462.42 s [vector] +++ OK, passed 100 tests.
  12528. 1462.42 s [vector] upd: OK
  12529. 1462.42 s [vector] +++ OK, passed 100 tests.
  12530. 1462.42 s [vector] accum: OK
  12531. 1462.42 s [vector] +++ OK, passed 100 tests.
  12532. 1462.42 s [vector] reverse: OK
  12533. 1462.42 s [vector] +++ OK, passed 100 tests.
  12534. 1462.43 s [vector] backpermute: OK
  12535. 1462.43 s [vector] +++ OK, passed 100 tests.
  12536. 1462.43 s [vector] map: OK
  12537. 1462.43 s [vector] +++ OK, passed 100 tests.
  12538. 1462.43 s [vector] imap: OK
  12539. 1462.43 s [vector] +++ OK, passed 100 tests.
  12540. 1462.43 s [vector] concatMap: OK
  12541. 1462.43 s [vector] +++ OK, passed 100 tests.
  12542. 1462.43 s [vector] mapM: OK
  12543. 1462.44 s [vector] +++ OK, passed 100 tests.
  12544. 1462.44 s [vector] mapM_: OK (0.01s)
  12545. 1462.44 s [vector] +++ OK, passed 100 tests.
  12546. 1462.45 s [vector] forM: OK
  12547. 1462.45 s [vector] +++ OK, passed 100 tests.
  12548. 1462.45 s [vector] forM_: OK (0.01s)
  12549. 1462.45 s [vector] +++ OK, passed 100 tests.
  12550. 1462.46 s [vector] imapM: OK
  12551. 1462.46 s [vector] +++ OK, passed 100 tests.
  12552. 1462.47 s [vector] imapM_: OK (0.01s)
  12553. 1462.47 s [vector] +++ OK, passed 100 tests.
  12554. 1462.47 s [vector] zipWith: OK
  12555. 1462.47 s [vector] +++ OK, passed 100 tests.
  12556. 1462.47 s [vector] zipWith3: OK
  12557. 1462.47 s [vector] +++ OK, passed 100 tests.
  12558. 1462.47 s [vector] izipWith: OK
  12559. 1462.47 s [vector] +++ OK, passed 100 tests.
  12560. 1462.48 s [vector] izipWith3: OK
  12561. 1462.48 s [vector] +++ OK, passed 100 tests.
  12562. 1462.48 s [vector] izipWithM: OK
  12563. 1462.48 s [vector] +++ OK, passed 100 tests.
  12564. 1462.49 s [vector] izipWithM_: OK (0.01s)
  12565. 1462.49 s [vector] +++ OK, passed 100 tests.
  12566. 1462.50 s [vector] zipWithM: OK
  12567. 1462.50 s [vector] +++ OK, passed 100 tests.
  12568. 1462.50 s [vector] zipWithM_: OK
  12569. 1462.50 s [vector] +++ OK, passed 100 tests.
  12570. 1462.50 s [vector] filter: OK
  12571. 1462.50 s [vector] +++ OK, passed 100 tests.
  12572. 1462.50 s [vector] ifilter: OK
  12573. 1462.50 s [vector] +++ OK, passed 100 tests.
  12574. 1462.52 s [vector] filterM: OK (0.02s)
  12575. 1462.52 s [vector] +++ OK, passed 100 tests.
  12576. 1462.52 s [vector] uniq: OK
  12577. 1462.53 s [vector] +++ OK, passed 100 tests.
  12578. 1462.53 s [vector] mapMaybe: OK
  12579. 1462.53 s [vector] +++ OK, passed 100 tests.
  12580. 1462.53 s [vector] imapMaybe: OK
  12581. 1462.53 s [vector] +++ OK, passed 100 tests.
  12582. 1462.53 s [vector] takeWhile: OK
  12583. 1462.53 s [vector] +++ OK, passed 100 tests.
  12584. 1462.53 s [vector] dropWhile: OK
  12585. 1462.53 s [vector] +++ OK, passed 100 tests.
  12586. 1462.53 s [vector] partition: OK
  12587. 1462.53 s [vector] +++ OK, passed 100 tests.
  12588. 1462.53 s [vector] partitionWith: OK
  12589. 1462.53 s [vector] +++ OK, passed 100 tests.
  12590. 1462.53 s [vector] span: OK
  12591. 1462.53 s [vector] +++ OK, passed 100 tests.
  12592. 1462.53 s [vector] break: OK
  12593. 1462.53 s [vector] +++ OK, passed 100 tests.
  12594. 1462.53 s [vector] spanR: OK
  12595. 1462.53 s [vector] +++ OK, passed 100 tests.
  12596. 1462.53 s [vector] breakR: OK
  12597. 1462.53 s [vector] +++ OK, passed 100 tests.
  12598. 1462.53 s [vector] groupBy: OK
  12599. 1462.53 s [vector] +++ OK, passed 100 tests.
  12600. 1462.53 s [vector] elem: OK
  12601. 1462.53 s [vector] +++ OK, passed 100 tests.
  12602. 1462.53 s [vector] notElem: OK
  12603. 1462.54 s [vector] +++ OK, passed 100 tests.
  12604. 1462.54 s [vector] find: OK
  12605. 1462.54 s [vector] +++ OK, passed 100 tests.
  12606. 1462.54 s [vector] findIndex: OK
  12607. 1462.54 s [vector] +++ OK, passed 100 tests.
  12608. 1462.54 s [vector] findIndexR: OK
  12609. 1462.54 s [vector] +++ OK, passed 100 tests.
  12610. 1462.54 s [vector] findIndices: OK
  12611. 1462.54 s [vector] +++ OK, passed 100 tests.
  12612. 1462.54 s [vector] elemIndex: OK
  12613. 1462.54 s [vector] +++ OK, passed 100 tests.
  12614. 1462.54 s [vector] elemIndices: OK
  12615. 1462.54 s [vector] +++ OK, passed 100 tests.
  12616. 1462.54 s [vector] foldl: OK
  12617. 1462.54 s [vector] +++ OK, passed 100 tests.
  12618. 1462.54 s [vector] foldl1: OK
  12619. 1462.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12620. 1462.54 s [vector] foldl': OK
  12621. 1462.54 s [vector] +++ OK, passed 100 tests.
  12622. 1462.54 s [vector] foldl1': OK
  12623. 1462.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12624. 1462.54 s [vector] foldr: OK
  12625. 1462.54 s [vector] +++ OK, passed 100 tests.
  12626. 1462.54 s [vector] foldr1: OK
  12627. 1462.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12628. 1462.55 s [vector] foldr': OK
  12629. 1462.55 s [vector] +++ OK, passed 100 tests.
  12630. 1462.55 s [vector] foldr1': OK
  12631. 1462.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12632. 1462.55 s [vector] ifoldl: OK
  12633. 1462.55 s [vector] +++ OK, passed 100 tests.
  12634. 1462.55 s [vector] ifoldl': OK
  12635. 1462.55 s [vector] +++ OK, passed 100 tests.
  12636. 1462.55 s [vector] ifoldr: OK
  12637. 1462.55 s [vector] +++ OK, passed 100 tests.
  12638. 1462.55 s [vector] ifoldr': OK
  12639. 1462.55 s [vector] +++ OK, passed 100 tests.
  12640. 1462.56 s [vector] ifoldM: OK
  12641. 1462.56 s [vector] +++ OK, passed 100 tests.
  12642. 1462.56 s [vector] ifoldM': OK
  12643. 1462.56 s [vector] +++ OK, passed 100 tests.
  12644. 1462.58 s [vector] ifoldM_: OK (0.01s)
  12645. 1462.58 s [vector] +++ OK, passed 100 tests.
  12646. 1462.58 s [vector] ifoldM'_: OK (0.01s)
  12647. 1462.58 s [vector] +++ OK, passed 100 tests.
  12648. 1462.58 s [vector] all: OK
  12649. 1462.58 s [vector] +++ OK, passed 100 tests.
  12650. 1462.58 s [vector] any: OK
  12651. 1462.58 s [vector] +++ OK, passed 100 tests.
  12652. 1462.59 s [vector] prescanl: OK
  12653. 1462.59 s [vector] +++ OK, passed 100 tests.
  12654. 1462.59 s [vector] prescanl': OK
  12655. 1462.59 s [vector] +++ OK, passed 100 tests.
  12656. 1462.59 s [vector] postscanl: OK
  12657. 1462.59 s [vector] +++ OK, passed 100 tests.
  12658. 1462.59 s [vector] postscanl': OK
  12659. 1462.59 s [vector] +++ OK, passed 100 tests.
  12660. 1462.59 s [vector] scanl: OK
  12661. 1462.59 s [vector] +++ OK, passed 100 tests.
  12662. 1462.59 s [vector] scanl': OK
  12663. 1462.59 s [vector] +++ OK, passed 100 tests.
  12664. 1462.59 s [vector] scanl1: OK
  12665. 1462.59 s [vector] +++ OK, passed 100 tests.
  12666. 1462.59 s [vector] scanl1': OK
  12667. 1462.59 s [vector] +++ OK, passed 100 tests.
  12668. 1462.60 s [vector] iscanl: OK
  12669. 1462.60 s [vector] +++ OK, passed 100 tests.
  12670. 1462.60 s [vector] iscanl': OK
  12671. 1462.60 s [vector] +++ OK, passed 100 tests.
  12672. 1462.60 s [vector] prescanr: OK
  12673. 1462.60 s [vector] +++ OK, passed 100 tests.
  12674. 1462.60 s [vector] prescanr': OK
  12675. 1462.60 s [vector] +++ OK, passed 100 tests.
  12676. 1462.60 s [vector] postscanr: OK
  12677. 1462.60 s [vector] +++ OK, passed 100 tests.
  12678. 1462.60 s [vector] postscanr': OK
  12679. 1462.60 s [vector] +++ OK, passed 100 tests.
  12680. 1462.61 s [vector] scanr: OK
  12681. 1462.61 s [vector] +++ OK, passed 100 tests.
  12682. 1462.61 s [vector] scanr': OK
  12683. 1462.61 s [vector] +++ OK, passed 100 tests.
  12684. 1462.61 s [vector] scanr1: OK
  12685. 1462.61 s [vector] +++ OK, passed 100 tests.
  12686. 1462.61 s [vector] scanr1': OK
  12687. 1462.61 s [vector] +++ OK, passed 100 tests.
  12688. 1462.61 s [vector] iscanr: OK
  12689. 1462.61 s [vector] +++ OK, passed 100 tests.
  12690. 1462.61 s [vector] iscanr': OK
  12691. 1462.61 s [vector] +++ OK, passed 100 tests.
  12692. 1462.61 s [vector] mut_read: OK
  12693. 1462.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12694. 1462.61 s [vector] mut_write: OK
  12695. 1462.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12696. 1462.62 s [vector] mut_modify: OK
  12697. 1462.62 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12698. 1462.62 s [vector] mut_generate: OK
  12699. 1462.62 s [vector] +++ OK, passed 100 tests.
  12700. 1462.62 s [vector] mut_generateM: OK
  12701. 1462.62 s [vector] +++ OK, passed 100 tests.
  12702. 1462.64 s [vector] mut_mapM_: OK (0.01s)
  12703. 1462.64 s [vector] +++ OK, passed 100 tests.
  12704. 1462.65 s [vector] mut_imapM_: OK
  12705. 1462.65 s [vector] +++ OK, passed 100 tests.
  12706. 1462.68 s [vector] mut_forM_: OK (0.02s)
  12707. 1462.68 s [vector] +++ OK, passed 100 tests.
  12708. 1462.68 s [vector] mut_iforM_: OK (0.01s)
  12709. 1462.68 s [vector] +++ OK, passed 100 tests.
  12710. 1462.68 s [vector] mut_foldr: OK
  12711. 1462.68 s [vector] +++ OK, passed 100 tests.
  12712. 1462.68 s [vector] mut_foldr': OK
  12713. 1462.68 s [vector] +++ OK, passed 100 tests.
  12714. 1462.68 s [vector] mut_foldl: OK
  12715. 1462.68 s [vector] +++ OK, passed 100 tests.
  12716. 1462.68 s [vector] mut_foldl': OK
  12717. 1462.68 s [vector] +++ OK, passed 100 tests.
  12718. 1462.68 s [vector] mut_ifoldr: OK
  12719. 1462.68 s [vector] +++ OK, passed 100 tests.
  12720. 1462.69 s [vector] mut_ifoldr': OK
  12721. 1462.69 s [vector] +++ OK, passed 100 tests.
  12722. 1462.69 s [vector] mut_ifoldl: OK
  12723. 1462.69 s [vector] +++ OK, passed 100 tests.
  12724. 1462.69 s [vector] mut_ifoldl': OK
  12725. 1462.69 s [vector] +++ OK, passed 100 tests.
  12726. 1462.69 s [vector] mut_foldM: OK
  12727. 1462.69 s [vector] +++ OK, passed 100 tests.
  12728. 1462.69 s [vector] mut_foldM': OK
  12729. 1462.69 s [vector] +++ OK, passed 100 tests.
  12730. 1462.69 s [vector] mut_foldrM: OK
  12731. 1462.69 s [vector] +++ OK, passed 100 tests.
  12732. 1462.69 s [vector] mut_foldrM': OK
  12733. 1462.70 s [vector] +++ OK, passed 100 tests.
  12734. 1462.70 s [vector] mut_ifoldM: OK
  12735. 1462.70 s [vector] +++ OK, passed 100 tests.
  12736. 1462.70 s [vector] mut_ifoldM': OK
  12737. 1462.70 s [vector] +++ OK, passed 100 tests.
  12738. 1462.70 s [vector] mut_ifoldrM: OK
  12739. 1462.70 s [vector] +++ OK, passed 100 tests.
  12740. 1462.70 s [vector] mut_ifoldrM': OK
  12741. 1462.70 s [vector] +++ OK, passed 100 tests.
  12742. 1462.70 s [vector] compare: OK
  12743. 1462.70 s [vector] +++ OK, passed 100 tests.
  12744. 1462.70 s [vector] maximum: OK
  12745. 1462.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12746. 1462.70 s [vector] minimum: OK
  12747. 1462.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12748. 1462.70 s [vector] minIndex: OK
  12749. 1462.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12750. 1462.70 s [vector] maxIndex: OK
  12751. 1462.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12752. 1462.70 s [vector] maximumBy: OK
  12753. 1462.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12754. 1462.70 s [vector] minimumBy: OK
  12755. 1462.70 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12756. 1462.70 s [vector] maximumOn: OK
  12757. 1462.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12758. 1462.70 s [vector] minimumOn: OK
  12759. 1462.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12760. 1462.70 s [vector] maxIndexBy: OK
  12761. 1462.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12762. 1462.71 s [vector] minIndexBy: OK
  12763. 1462.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12764. 1462.71 s [vector] ListFirstMaxIndexWins: OK
  12765. 1462.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12766. 1462.71 s [vector] FalseListFirstMaxIndexWins: OK
  12767. 1462.71 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12768. 1462.71 s [vector] []
  12769. 1462.71 s [vector] zip: OK
  12770. 1462.71 s [vector] +++ OK, passed 100 tests.
  12771. 1462.71 s [vector] zip3: OK
  12772. 1462.71 s [vector] +++ OK, passed 100 tests.
  12773. 1462.71 s [vector] unzip: OK
  12774. 1462.71 s [vector] +++ OK, passed 100 tests.
  12775. 1462.71 s [vector] unzip3: OK
  12776. 1462.71 s [vector] +++ OK, passed 100 tests.
  12777. 1462.71 s [vector] indexed: OK
  12778. 1462.71 s [vector] +++ OK, passed 100 tests.
  12779. 1462.71 s [vector] update: OK
  12780. 1462.72 s [vector] +++ OK, passed 100 tests.
  12781. 1462.72 s [vector] concat: OK
  12782. 1462.72 s [vector] +++ OK, passed 100 tests.
  12783. 1462.72 s [vector] mempty: OK
  12784. 1462.72 s [vector] +++ OK, passed 100 tests.
  12785. 1462.72 s [vector] mappend: OK
  12786. 1462.72 s [vector] +++ OK, passed 100 tests.
  12787. 1462.73 s [vector] mconcat: OK
  12788. 1462.73 s [vector] +++ OK, passed 100 tests.
  12789. 1462.73 s [vector] fmap: OK
  12790. 1462.73 s [vector] +++ OK, passed 100 tests.
  12791. 1462.73 s [vector] return: OK
  12792. 1462.74 s [vector] +++ OK, passed 100 tests.
  12793. 1462.74 s [vector] bind: OK (0.01s)
  12794. 1462.74 s [vector] +++ OK, passed 100 tests.
  12795. 1462.74 s [vector] mzip: OK
  12796. 1462.74 s [vector] +++ OK, passed 100 tests.
  12797. 1462.74 s [vector] munzip: OK
  12798. 1462.74 s [vector] +++ OK, passed 100 tests.
  12799. 1462.74 s [vector] applicative_pure: OK
  12800. 1462.74 s [vector] +++ OK, passed 100 tests.
  12801. 1462.75 s [vector] applicative_appl: OK (0.01s)
  12802. 1462.75 s [vector] +++ OK, passed 100 tests.
  12803. 1462.75 s [vector] alternative_empty: OK
  12804. 1462.75 s [vector] +++ OK, passed 100 tests.
  12805. 1462.75 s [vector] alternative_or: OK
  12806. 1462.76 s [vector] +++ OK, passed 100 tests.
  12807. 1462.80 s [vector] sequence: OK (0.03s)
  12808. 1462.80 s [vector] +++ OK, passed 100 tests.
  12809. 1462.80 s [vector] sequence_: OK
  12810. 1462.80 s [vector] +++ OK, passed 100 tests.
  12811. 1462.80 s [vector] glength: OK
  12812. 1462.80 s [vector] +++ OK, passed 100 tests.
  12813. 1462.80 s [vector] and: OK
  12814. 1462.80 s [vector] +++ OK, passed 100 tests.
  12815. 1462.80 s [vector] or: OK
  12816. 1462.80 s [vector] +++ OK, passed 100 tests.
  12817. 1462.80 s [vector] Int
  12818. 1462.80 s [vector] fromList.toList == id: OK
  12819. 1462.80 s [vector] +++ OK, passed 100 tests.
  12820. 1462.80 s [vector] toList.fromList == id: OK
  12821. 1462.80 s [vector] +++ OK, passed 100 tests.
  12822. 1462.80 s [vector] unstream.stream == id: OK
  12823. 1462.80 s [vector] +++ OK, passed 100 tests.
  12824. 1462.80 s [vector] stream.unstream == id: OK
  12825. 1462.80 s [vector] +++ OK, passed 100 tests.
  12826. 1462.80 s [vector] eq: OK
  12827. 1462.80 s [vector] +++ OK, passed 100 tests.
  12828. 1462.80 s [vector] length: OK
  12829. 1462.80 s [vector] +++ OK, passed 100 tests.
  12830. 1462.80 s [vector] null: OK
  12831. 1462.80 s [vector] +++ OK, passed 100 tests.
  12832. 1462.80 s [vector] index: OK
  12833. 1462.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12834. 1462.80 s [vector] safeIndex: OK
  12835. 1462.80 s [vector] +++ OK, passed 100 tests.
  12836. 1462.80 s [vector] head: OK
  12837. 1462.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12838. 1462.80 s [vector] last: OK
  12839. 1462.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12840. 1462.80 s [vector] unsafeIndex: OK
  12841. 1462.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12842. 1462.80 s [vector] unsafeHead: OK
  12843. 1462.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12844. 1462.80 s [vector] unsafeLast: OK
  12845. 1462.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12846. 1462.80 s [vector] slice: OK
  12847. 1462.81 s [vector] +++ OK, passed 100 tests.
  12848. 1462.81 s [vector] init: OK
  12849. 1462.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12850. 1462.81 s [vector] tail: OK
  12851. 1462.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12852. 1462.81 s [vector] take: OK
  12853. 1462.81 s [vector] +++ OK, passed 100 tests.
  12854. 1462.81 s [vector] drop: OK
  12855. 1462.81 s [vector] +++ OK, passed 100 tests.
  12856. 1462.81 s [vector] splitAt: OK
  12857. 1462.81 s [vector] +++ OK, passed 100 tests.
  12858. 1462.81 s [vector] empty: OK
  12859. 1462.81 s [vector] +++ OK, passed 100 tests.
  12860. 1462.81 s [vector] singleton: OK
  12861. 1462.81 s [vector] +++ OK, passed 100 tests.
  12862. 1462.81 s [vector] replicate: OK
  12863. 1462.81 s [vector] +++ OK, passed 100 tests.
  12864. 1462.81 s [vector] generate: OK
  12865. 1462.81 s [vector] +++ OK, passed 100 tests.
  12866. 1462.81 s [vector] iterateN: OK
  12867. 1462.81 s [vector] +++ OK, passed 100 tests.
  12868. 1462.82 s [vector] iterateNM: OK (0.01s)
  12869. 1462.82 s [vector] +++ OK, passed 100 tests.
  12870. 1462.84 s [vector] generateM: OK (0.01s)
  12871. 1462.84 s [vector] +++ OK, passed 100 tests.
  12872. 1462.85 s [vector] replicateM: OK
  12873. 1462.85 s [vector] +++ OK, passed 100 tests.
  12874. 1462.85 s [vector] create: OK
  12875. 1462.85 s [vector] +++ OK, passed 100 tests.
  12876. 1462.85 s [vector] createT: OK
  12877. 1462.85 s [vector] +++ OK, passed 100 tests.
  12878. 1462.85 s [vector] unfoldr: OK
  12879. 1462.85 s [vector] +++ OK, passed 100 tests.
  12880. 1462.85 s [vector] unfoldrN: OK
  12881. 1462.85 s [vector] +++ OK, passed 100 tests.
  12882. 1462.86 s [vector] unfoldrExactN: OK
  12883. 1462.86 s [vector] +++ OK, passed 100 tests.
  12884. 1462.86 s [vector] unfoldrM: OK
  12885. 1462.86 s [vector] +++ OK, passed 100 tests.
  12886. 1462.86 s [vector] unfoldrNM: OK
  12887. 1462.86 s [vector] +++ OK, passed 100 tests.
  12888. 1462.88 s [vector] unfoldrExactNM: OK (0.02s)
  12889. 1462.88 s [vector] +++ OK, passed 100 tests.
  12890. 1462.88 s [vector] constructN: OK
  12891. 1462.88 s [vector] +++ OK, passed 100 tests.
  12892. 1462.88 s [vector] constructrN: OK
  12893. 1462.88 s [vector] +++ OK, passed 100 tests.
  12894. 1462.88 s [vector] cons: OK
  12895. 1462.88 s [vector] +++ OK, passed 100 tests.
  12896. 1462.88 s [vector] snoc: OK
  12897. 1462.88 s [vector] +++ OK, passed 100 tests.
  12898. 1462.88 s [vector] append: OK
  12899. 1462.88 s [vector] +++ OK, passed 100 tests.
  12900. 1462.89 s [vector] concat: OK (0.01s)
  12901. 1462.89 s [vector] +++ OK, passed 100 tests.
  12902. 1462.89 s [vector] force: OK
  12903. 1462.90 s [vector] +++ OK, passed 100 tests.
  12904. 1462.90 s [vector] upd: OK
  12905. 1462.90 s [vector] +++ OK, passed 100 tests.
  12906. 1462.90 s [vector] accum: OK
  12907. 1462.90 s [vector] +++ OK, passed 100 tests.
  12908. 1462.90 s [vector] reverse: OK
  12909. 1462.90 s [vector] +++ OK, passed 100 tests.
  12910. 1462.90 s [vector] backpermute: OK
  12911. 1462.90 s [vector] +++ OK, passed 100 tests.
  12912. 1462.90 s [vector] map: OK
  12913. 1462.90 s [vector] +++ OK, passed 100 tests.
  12914. 1462.91 s [vector] imap: OK
  12915. 1462.91 s [vector] +++ OK, passed 100 tests.
  12916. 1462.91 s [vector] concatMap: OK
  12917. 1462.91 s [vector] +++ OK, passed 100 tests.
  12918. 1462.92 s [vector] mapM: OK
  12919. 1462.92 s [vector] +++ OK, passed 100 tests.
  12920. 1462.93 s [vector] mapM_: OK (0.02s)
  12921. 1462.94 s [vector] +++ OK, passed 100 tests.
  12922. 1462.95 s [vector] forM: OK
  12923. 1462.95 s [vector] +++ OK, passed 100 tests.
  12924. 1462.95 s [vector] forM_: OK (0.02s)
  12925. 1462.96 s [vector] +++ OK, passed 100 tests.
  12926. 1462.96 s [vector] imapM: OK
  12927. 1462.96 s [vector] +++ OK, passed 100 tests.
  12928. 1462.97 s [vector] imapM_: OK (0.02s)
  12929. 1462.98 s [vector] +++ OK, passed 100 tests.
  12930. 1462.98 s [vector] zipWith: OK
  12931. 1462.98 s [vector] +++ OK, passed 100 tests.
  12932. 1462.98 s [vector] zipWith3: OK
  12933. 1462.98 s [vector] +++ OK, passed 100 tests.
  12934. 1462.98 s [vector] izipWith: OK
  12935. 1462.98 s [vector] +++ OK, passed 100 tests.
  12936. 1462.98 s [vector] izipWith3: OK
  12937. 1462.98 s [vector] +++ OK, passed 100 tests.
  12938. 1462.98 s [vector] izipWithM: OK
  12939. 1463.00 s [vector] +++ OK, passed 100 tests.
  12940. 1463.02 s [vector] izipWithM_: OK (0.02s)
  12941. 1463.02 s [vector] +++ OK, passed 100 tests.
  12942. 1463.02 s [vector] zipWithM: OK
  12943. 1463.02 s [vector] +++ OK, passed 100 tests.
  12944. 1463.02 s [vector] zipWithM_: OK (0.01s)
  12945. 1463.02 s [vector] +++ OK, passed 100 tests.
  12946. 1463.02 s [vector] filter: OK
  12947. 1463.02 s [vector] +++ OK, passed 100 tests.
  12948. 1463.02 s [vector] ifilter: OK
  12949. 1463.02 s [vector] +++ OK, passed 100 tests.
  12950. 1463.05 s [vector] filterM: OK (0.03s)
  12951. 1463.05 s [vector] +++ OK, passed 100 tests.
  12952. 1463.05 s [vector] uniq: OK
  12953. 1463.05 s [vector] +++ OK, passed 100 tests.
  12954. 1463.06 s [vector] mapMaybe: OK
  12955. 1463.06 s [vector] +++ OK, passed 100 tests.
  12956. 1463.06 s [vector] imapMaybe: OK
  12957. 1463.06 s [vector] +++ OK, passed 100 tests.
  12958. 1463.06 s [vector] takeWhile: OK
  12959. 1463.06 s [vector] +++ OK, passed 100 tests.
  12960. 1463.06 s [vector] dropWhile: OK
  12961. 1463.06 s [vector] +++ OK, passed 100 tests.
  12962. 1463.06 s [vector] partition: OK
  12963. 1463.06 s [vector] +++ OK, passed 100 tests.
  12964. 1463.06 s [vector] partitionWith: OK
  12965. 1463.06 s [vector] +++ OK, passed 100 tests.
  12966. 1463.06 s [vector] span: OK
  12967. 1463.06 s [vector] +++ OK, passed 100 tests.
  12968. 1463.06 s [vector] break: OK
  12969. 1463.06 s [vector] +++ OK, passed 100 tests.
  12970. 1463.06 s [vector] spanR: OK
  12971. 1463.06 s [vector] +++ OK, passed 100 tests.
  12972. 1463.06 s [vector] breakR: OK
  12973. 1463.07 s [vector] +++ OK, passed 100 tests.
  12974. 1463.07 s [vector] groupBy: OK
  12975. 1463.07 s [vector] +++ OK, passed 100 tests.
  12976. 1463.07 s [vector] elem: OK
  12977. 1463.07 s [vector] +++ OK, passed 100 tests.
  12978. 1463.07 s [vector] notElem: OK
  12979. 1463.07 s [vector] +++ OK, passed 100 tests.
  12980. 1463.07 s [vector] find: OK
  12981. 1463.07 s [vector] +++ OK, passed 100 tests.
  12982. 1463.07 s [vector] findIndex: OK
  12983. 1463.07 s [vector] +++ OK, passed 100 tests.
  12984. 1463.07 s [vector] findIndexR: OK
  12985. 1463.07 s [vector] +++ OK, passed 100 tests.
  12986. 1463.07 s [vector] findIndices: OK
  12987. 1463.07 s [vector] +++ OK, passed 100 tests.
  12988. 1463.07 s [vector] elemIndex: OK
  12989. 1463.07 s [vector] +++ OK, passed 100 tests.
  12990. 1463.07 s [vector] elemIndices: OK
  12991. 1463.08 s [vector] +++ OK, passed 100 tests.
  12992. 1463.08 s [vector] foldl: OK
  12993. 1463.08 s [vector] +++ OK, passed 100 tests.
  12994. 1463.08 s [vector] foldl1: OK
  12995. 1463.08 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12996. 1463.08 s [vector] foldl': OK
  12997. 1463.08 s [vector] +++ OK, passed 100 tests.
  12998. 1463.08 s [vector] foldl1': OK
  12999. 1463.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13000. 1463.08 s [vector] foldr: OK
  13001. 1463.08 s [vector] +++ OK, passed 100 tests.
  13002. 1463.08 s [vector] foldr1: OK
  13003. 1463.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13004. 1463.09 s [vector] foldr': OK
  13005. 1463.09 s [vector] +++ OK, passed 100 tests.
  13006. 1463.10 s [vector] foldr1': OK
  13007. 1463.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13008. 1463.10 s [vector] ifoldl: OK
  13009. 1463.10 s [vector] +++ OK, passed 100 tests.
  13010. 1463.10 s [vector] ifoldl': OK
  13011. 1463.10 s [vector] +++ OK, passed 100 tests.
  13012. 1463.10 s [vector] ifoldr: OK
  13013. 1463.10 s [vector] +++ OK, passed 100 tests.
  13014. 1463.10 s [vector] ifoldr': OK
  13015. 1463.10 s [vector] +++ OK, passed 100 tests.
  13016. 1463.10 s [vector] ifoldM: OK
  13017. 1463.10 s [vector] +++ OK, passed 100 tests.
  13018. 1463.12 s [vector] ifoldM': OK
  13019. 1463.12 s [vector] +++ OK, passed 100 tests.
  13020. 1463.14 s [vector] ifoldM_: OK (0.02s)
  13021. 1463.14 s [vector] +++ OK, passed 100 tests.
  13022. 1463.14 s [vector] ifoldM'_: OK (0.01s)
  13023. 1463.14 s [vector] +++ OK, passed 100 tests.
  13024. 1463.14 s [vector] all: OK
  13025. 1463.14 s [vector] +++ OK, passed 100 tests.
  13026. 1463.14 s [vector] any: OK
  13027. 1463.14 s [vector] +++ OK, passed 100 tests.
  13028. 1463.15 s [vector] prescanl: OK
  13029. 1463.15 s [vector] +++ OK, passed 100 tests.
  13030. 1463.15 s [vector] prescanl': OK
  13031. 1463.15 s [vector] +++ OK, passed 100 tests.
  13032. 1463.15 s [vector] postscanl: OK
  13033. 1463.16 s [vector] +++ OK, passed 100 tests.
  13034. 1463.16 s [vector] postscanl': OK
  13035. 1463.16 s [vector] +++ OK, passed 100 tests.
  13036. 1463.16 s [vector] scanl: OK
  13037. 1463.16 s [vector] +++ OK, passed 100 tests.
  13038. 1463.16 s [vector] scanl': OK
  13039. 1463.16 s [vector] +++ OK, passed 100 tests.
  13040. 1463.17 s [vector] scanl1: OK
  13041. 1463.17 s [vector] +++ OK, passed 100 tests.
  13042. 1463.17 s [vector] scanl1': OK
  13043. 1463.17 s [vector] +++ OK, passed 100 tests.
  13044. 1463.18 s [vector] iscanl: OK
  13045. 1463.18 s [vector] +++ OK, passed 100 tests.
  13046. 1463.18 s [vector] iscanl': OK
  13047. 1463.18 s [vector] +++ OK, passed 100 tests.
  13048. 1463.18 s [vector] prescanr: OK
  13049. 1463.18 s [vector] +++ OK, passed 100 tests.
  13050. 1463.18 s [vector] prescanr': OK
  13051. 1463.18 s [vector] +++ OK, passed 100 tests.
  13052. 1463.18 s [vector] postscanr: OK
  13053. 1463.18 s [vector] +++ OK, passed 100 tests.
  13054. 1463.18 s [vector] postscanr': OK
  13055. 1463.18 s [vector] +++ OK, passed 100 tests.
  13056. 1463.19 s [vector] scanr: OK
  13057. 1463.19 s [vector] +++ OK, passed 100 tests.
  13058. 1463.20 s [vector] scanr': OK
  13059. 1463.20 s [vector] +++ OK, passed 100 tests.
  13060. 1463.20 s [vector] scanr1: OK
  13061. 1463.20 s [vector] +++ OK, passed 100 tests.
  13062. 1463.20 s [vector] scanr1': OK
  13063. 1463.20 s [vector] +++ OK, passed 100 tests.
  13064. 1463.20 s [vector] iscanr: OK
  13065. 1463.20 s [vector] +++ OK, passed 100 tests.
  13066. 1463.20 s [vector] iscanr': OK
  13067. 1463.20 s [vector] +++ OK, passed 100 tests.
  13068. 1463.20 s [vector] mut_read: OK
  13069. 1463.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13070. 1463.20 s [vector] mut_write: OK
  13071. 1463.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13072. 1463.20 s [vector] mut_modify: OK
  13073. 1463.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13074. 1463.20 s [vector] mut_generate: OK
  13075. 1463.21 s [vector] +++ OK, passed 100 tests.
  13076. 1463.22 s [vector] mut_generateM: OK (0.01s)
  13077. 1463.22 s [vector] +++ OK, passed 100 tests.
  13078. 1463.24 s [vector] mut_mapM_: OK (0.02s)
  13079. 1463.24 s [vector] +++ OK, passed 100 tests.
  13080. 1463.26 s [vector] mut_imapM_: OK (0.02s)
  13081. 1463.26 s [vector] +++ OK, passed 100 tests.
  13082. 1463.26 s [vector] mut_forM_: OK (0.02s)
  13083. 1463.26 s [vector] +++ OK, passed 100 tests.
  13084. 1463.28 s [vector] mut_iforM_: OK
  13085. 1463.28 s [vector] +++ OK, passed 100 tests.
  13086. 1463.28 s [vector] mut_foldr: OK
  13087. 1463.28 s [vector] +++ OK, passed 100 tests.
  13088. 1463.29 s [vector] mut_foldr': OK
  13089. 1463.29 s [vector] +++ OK, passed 100 tests.
  13090. 1463.29 s [vector] mut_foldl: OK
  13091. 1463.29 s [vector] +++ OK, passed 100 tests.
  13092. 1463.29 s [vector] mut_foldl': OK
  13093. 1463.30 s [vector] +++ OK, passed 100 tests.
  13094. 1463.30 s [vector] mut_ifoldr: OK
  13095. 1463.30 s [vector] +++ OK, passed 100 tests.
  13096. 1463.30 s [vector] mut_ifoldr': OK
  13097. 1463.30 s [vector] +++ OK, passed 100 tests.
  13098. 1463.30 s [vector] mut_ifoldl: OK
  13099. 1463.30 s [vector] +++ OK, passed 100 tests.
  13100. 1463.30 s [vector] mut_ifoldl': OK
  13101. 1463.30 s [vector] +++ OK, passed 100 tests.
  13102. 1463.30 s [vector] mut_foldM: OK
  13103. 1463.30 s [vector] +++ OK, passed 100 tests.
  13104. 1463.31 s [vector] mut_foldM': OK
  13105. 1463.31 s [vector] +++ OK, passed 100 tests.
  13106. 1463.31 s [vector] mut_foldrM: OK
  13107. 1463.31 s [vector] +++ OK, passed 100 tests.
  13108. 1463.31 s [vector] mut_foldrM': OK
  13109. 1463.31 s [vector] +++ OK, passed 100 tests.
  13110. 1463.32 s [vector] mut_ifoldM: OK
  13111. 1463.32 s [vector] +++ OK, passed 100 tests.
  13112. 1463.32 s [vector] mut_ifoldM': OK
  13113. 1463.32 s [vector] +++ OK, passed 100 tests.
  13114. 1463.32 s [vector] mut_ifoldrM: OK
  13115. 1463.32 s [vector] +++ OK, passed 100 tests.
  13116. 1463.32 s [vector] mut_ifoldrM': OK
  13117. 1463.32 s [vector] +++ OK, passed 100 tests.
  13118. 1463.32 s [vector] compare: OK
  13119. 1463.32 s [vector] +++ OK, passed 100 tests.
  13120. 1463.32 s [vector] maximum: OK
  13121. 1463.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13122. 1463.32 s [vector] minimum: OK
  13123. 1463.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13124. 1463.32 s [vector] minIndex: OK
  13125. 1463.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13126. 1463.32 s [vector] maxIndex: OK
  13127. 1463.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13128. 1463.32 s [vector] maximumBy: OK
  13129. 1463.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13130. 1463.32 s [vector] minimumBy: OK
  13131. 1463.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13132. 1463.32 s [vector] maximumOn: OK
  13133. 1463.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13134. 1463.32 s [vector] minimumOn: OK
  13135. 1463.32 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13136. 1463.32 s [vector] maxIndexBy: OK
  13137. 1463.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13138. 1463.32 s [vector] minIndexBy: OK
  13139. 1463.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13140. 1463.32 s [vector] ListFirstMaxIndexWins: OK
  13141. 1463.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13142. 1463.33 s [vector] FalseListFirstMaxIndexWins: OK
  13143. 1463.33 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  13144. 1463.33 s [vector] []
  13145. 1463.33 s [vector] zip: OK
  13146. 1463.33 s [vector] +++ OK, passed 100 tests.
  13147. 1463.33 s [vector] zip3: OK
  13148. 1463.33 s [vector] +++ OK, passed 100 tests.
  13149. 1463.33 s [vector] unzip: OK
  13150. 1463.33 s [vector] +++ OK, passed 100 tests.
  13151. 1463.33 s [vector] unzip3: OK
  13152. 1463.33 s [vector] +++ OK, passed 100 tests.
  13153. 1463.33 s [vector] indexed: OK
  13154. 1463.33 s [vector] +++ OK, passed 100 tests.
  13155. 1463.33 s [vector] update: OK
  13156. 1463.34 s [vector] +++ OK, passed 100 tests.
  13157. 1463.34 s [vector] concat: OK (0.01s)
  13158. 1463.34 s [vector] +++ OK, passed 100 tests.
  13159. 1463.34 s [vector] mempty: OK
  13160. 1463.34 s [vector] +++ OK, passed 100 tests.
  13161. 1463.34 s [vector] mappend: OK
  13162. 1463.34 s [vector] +++ OK, passed 100 tests.
  13163. 1463.35 s [vector] mconcat: OK
  13164. 1463.35 s [vector] +++ OK, passed 100 tests.
  13165. 1463.35 s [vector] fmap: OK
  13166. 1463.36 s [vector] +++ OK, passed 100 tests.
  13167. 1463.36 s [vector] return: OK
  13168. 1463.37 s [vector] +++ OK, passed 100 tests.
  13169. 1463.37 s [vector] bind: OK (0.02s)
  13170. 1463.37 s [vector] +++ OK, passed 100 tests.
  13171. 1463.37 s [vector] mzip: OK
  13172. 1463.37 s [vector] +++ OK, passed 100 tests.
  13173. 1463.37 s [vector] munzip: OK
  13174. 1463.37 s [vector] +++ OK, passed 100 tests.
  13175. 1463.37 s [vector] applicative_pure: OK
  13176. 1463.37 s [vector] +++ OK, passed 100 tests.
  13177. 1463.41 s [vector] applicative_appl: OK (0.04s)
  13178. 1463.41 s [vector] +++ OK, passed 100 tests.
  13179. 1463.42 s [vector] alternative_empty: OK
  13180. 1463.42 s [vector] +++ OK, passed 100 tests.
  13181. 1463.42 s [vector] alternative_or: OK
  13182. 1463.42 s [vector] +++ OK, passed 100 tests.
  13183. 1463.44 s [vector] sequence: OK (0.03s)
  13184. 1463.44 s [vector] +++ OK, passed 100 tests.
  13185. 1463.45 s [vector] sequence_: OK (0.01s)
  13186. 1463.45 s [vector] +++ OK, passed 100 tests.
  13187. 1463.45 s [vector] glength: OK
  13188. 1463.45 s [vector] +++ OK, passed 100 tests.
  13189. 1463.45 s [vector] sum: OK
  13190. 1463.45 s [vector] +++ OK, passed 100 tests.
  13191. 1463.45 s [vector] product: OK
  13192. 1463.45 s [vector] +++ OK, passed 100 tests.
  13193. 1463.45 s [vector] enumFromN: OK
  13194. 1463.45 s [vector] +++ OK, passed 100 tests.
  13195. 1463.45 s [vector] enumFromThenN: OK
  13196. 1463.45 s [vector] +++ OK, passed 100 tests.
  13197. 1463.45 s [vector] enumFromTo: OK
  13198. 1463.45 s [vector] +++ OK, passed 100 tests.
  13199. 1463.45 s [vector] enumFromThenTo: OK
  13200. 1463.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13201. 1463.45 s [vector] unstream
  13202. 1463.45 s [vector] unstream == vunstream (exact): OK
  13203. 1463.45 s [vector] +++ OK, passed 100 tests.
  13204. 1463.45 s [vector] unstream == vunstream (unknown): OK
  13205. 1463.45 s [vector] +++ OK, passed 100 tests.
  13206. 1463.45 s [vector] unstreamR ~= vunstream (exact): OK
  13207. 1463.45 s [vector] +++ OK, passed 100 tests.
  13208. 1463.45 s [vector] unstreamR ~= vunstream (unknown): OK
  13209. 1463.45 s [vector] +++ OK, passed 100 tests.
  13210. 1463.45 s [vector] Tests.Vector.Unboxed
  13211. 1463.45 s [vector] ()
  13212. 1463.45 s [vector] fromList.toList == id: OK
  13213. 1463.45 s [vector] +++ OK, passed 100 tests.
  13214. 1463.45 s [vector] toList.fromList == id: OK
  13215. 1463.45 s [vector] +++ OK, passed 100 tests.
  13216. 1463.45 s [vector] unstream.stream == id: OK
  13217. 1463.45 s [vector] +++ OK, passed 100 tests.
  13218. 1463.46 s [vector] stream.unstream == id: OK
  13219. 1463.46 s [vector] +++ OK, passed 100 tests.
  13220. 1463.46 s [vector] eq: OK
  13221. 1463.46 s [vector] +++ OK, passed 100 tests.
  13222. 1463.46 s [vector] length: OK
  13223. 1463.46 s [vector] +++ OK, passed 100 tests.
  13224. 1463.46 s [vector] null: OK
  13225. 1463.46 s [vector] +++ OK, passed 100 tests.
  13226. 1463.46 s [vector] index: OK
  13227. 1463.46 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13228. 1463.46 s [vector] safeIndex: OK
  13229. 1463.46 s [vector] +++ OK, passed 100 tests.
  13230. 1463.46 s [vector] head: OK
  13231. 1463.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13232. 1463.46 s [vector] last: OK
  13233. 1463.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13234. 1463.46 s [vector] unsafeIndex: OK
  13235. 1463.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13236. 1463.46 s [vector] unsafeHead: OK
  13237. 1463.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13238. 1463.46 s [vector] unsafeLast: OK
  13239. 1463.46 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13240. 1463.46 s [vector] slice: OK
  13241. 1463.46 s [vector] +++ OK, passed 100 tests.
  13242. 1463.46 s [vector] init: OK
  13243. 1463.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13244. 1463.46 s [vector] tail: OK
  13245. 1463.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13246. 1463.46 s [vector] take: OK
  13247. 1463.46 s [vector] +++ OK, passed 100 tests.
  13248. 1463.46 s [vector] drop: OK
  13249. 1463.46 s [vector] +++ OK, passed 100 tests.
  13250. 1463.46 s [vector] splitAt: OK
  13251. 1463.46 s [vector] +++ OK, passed 100 tests.
  13252. 1463.46 s [vector] empty: OK
  13253. 1463.46 s [vector] +++ OK, passed 100 tests.
  13254. 1463.46 s [vector] singleton: OK
  13255. 1463.46 s [vector] +++ OK, passed 100 tests.
  13256. 1463.46 s [vector] replicate: OK
  13257. 1463.46 s [vector] +++ OK, passed 100 tests.
  13258. 1463.46 s [vector] generate: OK
  13259. 1463.46 s [vector] +++ OK, passed 100 tests.
  13260. 1463.46 s [vector] iterateN: OK
  13261. 1463.46 s [vector] +++ OK, passed 100 tests.
  13262. 1463.50 s [vector] iterateNM: OK (0.02s)
  13263. 1463.50 s [vector] +++ OK, passed 100 tests.
  13264. 1463.50 s [vector] generateM: OK (0.01s)
  13265. 1463.50 s [vector] +++ OK, passed 100 tests.
  13266. 1463.50 s [vector] replicateM: OK
  13267. 1463.50 s [vector] +++ OK, passed 100 tests.
  13268. 1463.50 s [vector] create: OK
  13269. 1463.50 s [vector] +++ OK, passed 100 tests.
  13270. 1463.51 s [vector] createT: OK
  13271. 1463.51 s [vector] +++ OK, passed 100 tests.
  13272. 1463.51 s [vector] unfoldr: OK
  13273. 1463.51 s [vector] +++ OK, passed 100 tests.
  13274. 1463.51 s [vector] unfoldrN: OK
  13275. 1463.51 s [vector] +++ OK, passed 100 tests.
  13276. 1463.51 s [vector] unfoldrExactN: OK
  13277. 1463.52 s [vector] +++ OK, passed 100 tests.
  13278. 1463.52 s [vector] unfoldrM: OK
  13279. 1463.53 s [vector] +++ OK, passed 100 tests.
  13280. 1463.53 s [vector] unfoldrNM: OK
  13281. 1463.53 s [vector] +++ OK, passed 100 tests.
  13282. 1463.54 s [vector] unfoldrExactNM: OK (0.03s)
  13283. 1463.54 s [vector] +++ OK, passed 100 tests.
  13284. 1463.55 s [vector] constructN: OK
  13285. 1463.55 s [vector] +++ OK, passed 100 tests.
  13286. 1463.55 s [vector] constructrN: OK
  13287. 1463.55 s [vector] +++ OK, passed 100 tests.
  13288. 1463.55 s [vector] cons: OK
  13289. 1463.55 s [vector] +++ OK, passed 100 tests.
  13290. 1463.56 s [vector] snoc: OK
  13291. 1463.56 s [vector] +++ OK, passed 100 tests.
  13292. 1463.56 s [vector] append: OK
  13293. 1463.56 s [vector] +++ OK, passed 100 tests.
  13294. 1463.56 s [vector] concat: OK (0.01s)
  13295. 1463.56 s [vector] +++ OK, passed 100 tests.
  13296. 1463.56 s [vector] force: OK
  13297. 1463.56 s [vector] +++ OK, passed 100 tests.
  13298. 1463.56 s [vector] upd: OK
  13299. 1463.56 s [vector] +++ OK, passed 100 tests.
  13300. 1463.56 s [vector] accum: OK
  13301. 1463.56 s [vector] +++ OK, passed 100 tests.
  13302. 1463.56 s [vector] reverse: OK
  13303. 1463.56 s [vector] +++ OK, passed 100 tests.
  13304. 1463.56 s [vector] backpermute: OK
  13305. 1463.56 s [vector] +++ OK, passed 100 tests.
  13306. 1463.56 s [vector] map: OK
  13307. 1463.56 s [vector] +++ OK, passed 100 tests.
  13308. 1463.56 s [vector] imap: OK
  13309. 1463.57 s [vector] +++ OK, passed 100 tests.
  13310. 1463.57 s [vector] concatMap: OK
  13311. 1463.57 s [vector] +++ OK, passed 100 tests.
  13312. 1463.57 s [vector] mapM: OK
  13313. 1463.57 s [vector] +++ OK, passed 100 tests.
  13314. 1463.57 s [vector] mapM_: OK
  13315. 1463.58 s [vector] +++ OK, passed 100 tests.
  13316. 1463.58 s [vector] forM: OK
  13317. 1463.58 s [vector] +++ OK, passed 100 tests.
  13318. 1463.59 s [vector] forM_: OK
  13319. 1463.59 s [vector] +++ OK, passed 100 tests.
  13320. 1463.59 s [vector] imapM: OK
  13321. 1463.59 s [vector] +++ OK, passed 100 tests.
  13322. 1463.59 s [vector] imapM_: OK
  13323. 1463.59 s [vector] +++ OK, passed 100 tests.
  13324. 1463.59 s [vector] zipWith: OK
  13325. 1463.59 s [vector] +++ OK, passed 100 tests.
  13326. 1463.59 s [vector] zipWith3: OK
  13327. 1463.59 s [vector] +++ OK, passed 100 tests.
  13328. 1463.60 s [vector] izipWith: OK
  13329. 1463.60 s [vector] +++ OK, passed 100 tests.
  13330. 1463.60 s [vector] izipWith3: OK
  13331. 1463.60 s [vector] +++ OK, passed 100 tests.
  13332. 1463.60 s [vector] izipWithM: OK
  13333. 1463.60 s [vector] +++ OK, passed 100 tests.
  13334. 1463.60 s [vector] izipWithM_: OK
  13335. 1463.60 s [vector] +++ OK, passed 100 tests.
  13336. 1463.60 s [vector] zipWithM: OK
  13337. 1463.60 s [vector] +++ OK, passed 100 tests.
  13338. 1463.61 s [vector] zipWithM_: OK
  13339. 1463.61 s [vector] +++ OK, passed 100 tests.
  13340. 1463.61 s [vector] filter: OK
  13341. 1463.62 s [vector] +++ OK, passed 100 tests.
  13342. 1463.62 s [vector] ifilter: OK
  13343. 1463.62 s [vector] +++ OK, passed 100 tests.
  13344. 1463.64 s [vector] filterM: OK (0.02s)
  13345. 1463.64 s [vector] +++ OK, passed 100 tests.
  13346. 1463.64 s [vector] uniq: OK
  13347. 1463.64 s [vector] +++ OK, passed 100 tests.
  13348. 1463.64 s [vector] mapMaybe: OK
  13349. 1463.64 s [vector] +++ OK, passed 100 tests.
  13350. 1463.64 s [vector] imapMaybe: OK
  13351. 1463.64 s [vector] +++ OK, passed 100 tests.
  13352. 1463.64 s [vector] takeWhile: OK
  13353. 1463.64 s [vector] +++ OK, passed 100 tests.
  13354. 1463.64 s [vector] dropWhile: OK
  13355. 1463.64 s [vector] +++ OK, passed 100 tests.
  13356. 1463.64 s [vector] partition: OK
  13357. 1463.64 s [vector] +++ OK, passed 100 tests.
  13358. 1463.64 s [vector] partitionWith: OK
  13359. 1463.64 s [vector] +++ OK, passed 100 tests.
  13360. 1463.64 s [vector] span: OK
  13361. 1463.64 s [vector] +++ OK, passed 100 tests.
  13362. 1463.64 s [vector] break: OK
  13363. 1463.64 s [vector] +++ OK, passed 100 tests.
  13364. 1463.64 s [vector] spanR: OK
  13365. 1463.64 s [vector] +++ OK, passed 100 tests.
  13366. 1463.64 s [vector] breakR: OK
  13367. 1463.64 s [vector] +++ OK, passed 100 tests.
  13368. 1463.64 s [vector] groupBy: OK
  13369. 1463.64 s [vector] +++ OK, passed 100 tests.
  13370. 1463.64 s [vector] elem: OK
  13371. 1463.64 s [vector] +++ OK, passed 100 tests.
  13372. 1463.65 s [vector] notElem: OK
  13373. 1463.65 s [vector] +++ OK, passed 100 tests.
  13374. 1463.65 s [vector] find: OK
  13375. 1463.65 s [vector] +++ OK, passed 100 tests.
  13376. 1463.65 s [vector] findIndex: OK
  13377. 1463.65 s [vector] +++ OK, passed 100 tests.
  13378. 1463.65 s [vector] findIndexR: OK
  13379. 1463.65 s [vector] +++ OK, passed 100 tests.
  13380. 1463.65 s [vector] findIndices: OK
  13381. 1463.65 s [vector] +++ OK, passed 100 tests.
  13382. 1463.65 s [vector] elemIndex: OK
  13383. 1463.65 s [vector] +++ OK, passed 100 tests.
  13384. 1463.65 s [vector] elemIndices: OK
  13385. 1463.65 s [vector] +++ OK, passed 100 tests.
  13386. 1463.65 s [vector] foldl: OK
  13387. 1463.65 s [vector] +++ OK, passed 100 tests.
  13388. 1463.65 s [vector] foldl1: OK
  13389. 1463.65 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13390. 1463.65 s [vector] foldl': OK
  13391. 1463.65 s [vector] +++ OK, passed 100 tests.
  13392. 1463.65 s [vector] foldl1': OK
  13393. 1463.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13394. 1463.65 s [vector] foldr: OK
  13395. 1463.65 s [vector] +++ OK, passed 100 tests.
  13396. 1463.65 s [vector] foldr1: OK
  13397. 1463.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13398. 1463.65 s [vector] foldr': OK
  13399. 1463.65 s [vector] +++ OK, passed 100 tests.
  13400. 1463.65 s [vector] foldr1': OK
  13401. 1463.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13402. 1463.65 s [vector] ifoldl: OK
  13403. 1463.65 s [vector] +++ OK, passed 100 tests.
  13404. 1463.65 s [vector] ifoldl': OK
  13405. 1463.65 s [vector] +++ OK, passed 100 tests.
  13406. 1463.66 s [vector] ifoldr: OK
  13407. 1463.66 s [vector] +++ OK, passed 100 tests.
  13408. 1463.66 s [vector] ifoldr': OK
  13409. 1463.67 s [vector] +++ OK, passed 100 tests.
  13410. 1463.67 s [vector] ifoldM: OK
  13411. 1463.67 s [vector] +++ OK, passed 100 tests.
  13412. 1463.67 s [vector] ifoldM': OK
  13413. 1463.67 s [vector] +++ OK, passed 100 tests.
  13414. 1463.67 s [vector] ifoldM_: OK
  13415. 1463.67 s [vector] +++ OK, passed 100 tests.
  13416. 1463.67 s [vector] ifoldM'_: OK
  13417. 1463.67 s [vector] +++ OK, passed 100 tests.
  13418. 1463.67 s [vector] all: OK
  13419. 1463.67 s [vector] +++ OK, passed 100 tests.
  13420. 1463.67 s [vector] any: OK
  13421. 1463.67 s [vector] +++ OK, passed 100 tests.
  13422. 1463.67 s [vector] prescanl: OK
  13423. 1463.67 s [vector] +++ OK, passed 100 tests.
  13424. 1463.67 s [vector] prescanl': OK
  13425. 1463.67 s [vector] +++ OK, passed 100 tests.
  13426. 1463.67 s [vector] postscanl: OK
  13427. 1463.67 s [vector] +++ OK, passed 100 tests.
  13428. 1463.67 s [vector] postscanl': OK
  13429. 1463.67 s [vector] +++ OK, passed 100 tests.
  13430. 1463.67 s [vector] scanl: OK
  13431. 1463.67 s [vector] +++ OK, passed 100 tests.
  13432. 1463.67 s [vector] scanl': OK
  13433. 1463.67 s [vector] +++ OK, passed 100 tests.
  13434. 1463.67 s [vector] scanl1: OK
  13435. 1463.68 s [vector] +++ OK, passed 100 tests.
  13436. 1463.68 s [vector] scanl1': OK
  13437. 1463.68 s [vector] +++ OK, passed 100 tests.
  13438. 1463.68 s [vector] iscanl: OK
  13439. 1463.68 s [vector] +++ OK, passed 100 tests.
  13440. 1463.68 s [vector] iscanl': OK
  13441. 1463.68 s [vector] +++ OK, passed 100 tests.
  13442. 1463.68 s [vector] prescanr: OK
  13443. 1463.68 s [vector] +++ OK, passed 100 tests.
  13444. 1463.68 s [vector] prescanr': OK
  13445. 1463.68 s [vector] +++ OK, passed 100 tests.
  13446. 1463.68 s [vector] postscanr: OK
  13447. 1463.68 s [vector] +++ OK, passed 100 tests.
  13448. 1463.68 s [vector] postscanr': OK
  13449. 1463.68 s [vector] +++ OK, passed 100 tests.
  13450. 1463.68 s [vector] scanr: OK
  13451. 1463.68 s [vector] +++ OK, passed 100 tests.
  13452. 1463.68 s [vector] scanr': OK
  13453. 1463.68 s [vector] +++ OK, passed 100 tests.
  13454. 1463.68 s [vector] scanr1: OK
  13455. 1463.68 s [vector] +++ OK, passed 100 tests.
  13456. 1463.68 s [vector] scanr1': OK
  13457. 1463.68 s [vector] +++ OK, passed 100 tests.
  13458. 1463.69 s [vector] iscanr: OK
  13459. 1463.69 s [vector] +++ OK, passed 100 tests.
  13460. 1463.69 s [vector] iscanr': OK
  13461. 1463.69 s [vector] +++ OK, passed 100 tests.
  13462. 1463.69 s [vector] mut_read: OK
  13463. 1463.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13464. 1463.69 s [vector] mut_write: OK
  13465. 1463.69 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13466. 1463.69 s [vector] mut_modify: OK
  13467. 1463.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13468. 1463.69 s [vector] mut_generate: OK
  13469. 1463.70 s [vector] +++ OK, passed 100 tests.
  13470. 1463.70 s [vector] mut_generateM: OK
  13471. 1463.70 s [vector] +++ OK, passed 100 tests.
  13472. 1463.70 s [vector] mut_mapM_: OK
  13473. 1463.70 s [vector] +++ OK, passed 100 tests.
  13474. 1463.71 s [vector] mut_imapM_: OK
  13475. 1463.71 s [vector] +++ OK, passed 100 tests.
  13476. 1463.71 s [vector] mut_forM_: OK
  13477. 1463.71 s [vector] +++ OK, passed 100 tests.
  13478. 1463.72 s [vector] mut_iforM_: OK
  13479. 1463.72 s [vector] +++ OK, passed 100 tests.
  13480. 1463.72 s [vector] mut_foldr: OK
  13481. 1463.72 s [vector] +++ OK, passed 100 tests.
  13482. 1463.72 s [vector] mut_foldr': OK
  13483. 1463.72 s [vector] +++ OK, passed 100 tests.
  13484. 1463.72 s [vector] mut_foldl: OK
  13485. 1463.72 s [vector] +++ OK, passed 100 tests.
  13486. 1463.72 s [vector] mut_foldl': OK
  13487. 1463.72 s [vector] +++ OK, passed 100 tests.
  13488. 1463.72 s [vector] mut_ifoldr: OK
  13489. 1463.72 s [vector] +++ OK, passed 100 tests.
  13490. 1463.72 s [vector] mut_ifoldr': OK
  13491. 1463.72 s [vector] +++ OK, passed 100 tests.
  13492. 1463.73 s [vector] mut_ifoldl: OK
  13493. 1463.73 s [vector] +++ OK, passed 100 tests.
  13494. 1463.73 s [vector] mut_ifoldl': OK
  13495. 1463.73 s [vector] +++ OK, passed 100 tests.
  13496. 1463.73 s [vector] mut_foldM: OK
  13497. 1463.73 s [vector] +++ OK, passed 100 tests.
  13498. 1463.73 s [vector] mut_foldM': OK
  13499. 1463.73 s [vector] +++ OK, passed 100 tests.
  13500. 1463.73 s [vector] mut_foldrM: OK
  13501. 1463.73 s [vector] +++ OK, passed 100 tests.
  13502. 1463.73 s [vector] mut_foldrM': OK
  13503. 1463.73 s [vector] +++ OK, passed 100 tests.
  13504. 1463.73 s [vector] mut_ifoldM: OK
  13505. 1463.73 s [vector] +++ OK, passed 100 tests.
  13506. 1463.73 s [vector] mut_ifoldM': OK
  13507. 1463.73 s [vector] +++ OK, passed 100 tests.
  13508. 1463.73 s [vector] mut_ifoldrM: OK
  13509. 1463.73 s [vector] +++ OK, passed 100 tests.
  13510. 1463.73 s [vector] mut_ifoldrM': OK
  13511. 1463.73 s [vector] +++ OK, passed 100 tests.
  13512. 1463.73 s [vector] compare: OK
  13513. 1463.73 s [vector] +++ OK, passed 100 tests.
  13514. 1463.73 s [vector] maximum: OK
  13515. 1463.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13516. 1463.73 s [vector] minimum: OK
  13517. 1463.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13518. 1463.73 s [vector] minIndex: OK
  13519. 1463.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13520. 1463.73 s [vector] maxIndex: OK
  13521. 1463.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13522. 1463.73 s [vector] maximumBy: OK
  13523. 1463.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13524. 1463.73 s [vector] minimumBy: OK
  13525. 1463.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13526. 1463.73 s [vector] maximumOn: OK
  13527. 1463.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13528. 1463.73 s [vector] minimumOn: OK
  13529. 1463.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13530. 1463.74 s [vector] maxIndexBy: OK
  13531. 1463.74 s [vector] +++ OK, passed 100 tests; 28 discarded.
  13532. 1463.74 s [vector] minIndexBy: OK
  13533. 1463.74 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13534. 1463.74 s [vector] ListFirstMaxIndexWins: OK
  13535. 1463.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13536. 1463.74 s [vector] FalseListFirstMaxIndexWins: OK
  13537. 1463.74 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  13538. 1463.74 s [vector] []
  13539. 1463.74 s [vector] zip: OK
  13540. 1463.74 s [vector] +++ OK, passed 100 tests.
  13541. 1463.74 s [vector] zip3: OK
  13542. 1463.74 s [vector] +++ OK, passed 100 tests.
  13543. 1463.74 s [vector] unzip: OK
  13544. 1463.74 s [vector] +++ OK, passed 100 tests.
  13545. 1463.74 s [vector] unzip3: OK
  13546. 1463.74 s [vector] +++ OK, passed 100 tests.
  13547. 1463.74 s [vector] indexed: OK
  13548. 1463.75 s [vector] +++ OK, passed 100 tests.
  13549. 1463.75 s [vector] update: OK
  13550. 1463.75 s [vector] +++ OK, passed 100 tests.
  13551. 1463.75 s [vector] mempty: OK
  13552. 1463.75 s [vector] +++ OK, passed 100 tests.
  13553. 1463.75 s [vector] mappend: OK
  13554. 1463.76 s [vector] +++ OK, passed 100 tests.
  13555. 1463.76 s [vector] mconcat: OK (0.01s)
  13556. 1463.76 s [vector] +++ OK, passed 100 tests.
  13557. 1463.76 s [vector] glength: OK
  13558. 1463.76 s [vector] +++ OK, passed 100 tests.
  13559. 1463.76 s [vector] (Bool)
  13560. 1463.77 s [vector] fromList.toList == id: OK
  13561. 1463.77 s [vector] +++ OK, passed 100 tests.
  13562. 1463.77 s [vector] toList.fromList == id: OK
  13563. 1463.77 s [vector] +++ OK, passed 100 tests.
  13564. 1463.77 s [vector] unstream.stream == id: OK
  13565. 1463.77 s [vector] +++ OK, passed 100 tests.
  13566. 1463.77 s [vector] stream.unstream == id: OK
  13567. 1463.77 s [vector] +++ OK, passed 100 tests.
  13568. 1463.77 s [vector] eq: OK
  13569. 1463.77 s [vector] +++ OK, passed 100 tests.
  13570. 1463.77 s [vector] length: OK
  13571. 1463.77 s [vector] +++ OK, passed 100 tests.
  13572. 1463.77 s [vector] null: OK
  13573. 1463.77 s [vector] +++ OK, passed 100 tests.
  13574. 1463.77 s [vector] index: OK
  13575. 1463.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13576. 1463.77 s [vector] safeIndex: OK
  13577. 1463.77 s [vector] +++ OK, passed 100 tests.
  13578. 1463.77 s [vector] head: OK
  13579. 1463.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13580. 1463.77 s [vector] last: OK
  13581. 1463.77 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13582. 1463.77 s [vector] unsafeIndex: OK
  13583. 1463.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13584. 1463.77 s [vector] unsafeHead: OK
  13585. 1463.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13586. 1463.77 s [vector] unsafeLast: OK
  13587. 1463.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13588. 1463.77 s [vector] slice: OK
  13589. 1463.77 s [vector] +++ OK, passed 100 tests.
  13590. 1463.77 s [vector] init: OK
  13591. 1463.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13592. 1463.77 s [vector] tail: OK
  13593. 1463.77 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13594. 1463.77 s [vector] take: OK
  13595. 1463.77 s [vector] +++ OK, passed 100 tests.
  13596. 1463.77 s [vector] drop: OK
  13597. 1463.77 s [vector] +++ OK, passed 100 tests.
  13598. 1463.77 s [vector] splitAt: OK
  13599. 1463.77 s [vector] +++ OK, passed 100 tests.
  13600. 1463.77 s [vector] empty: OK
  13601. 1463.77 s [vector] +++ OK, passed 100 tests.
  13602. 1463.77 s [vector] singleton: OK
  13603. 1463.78 s [vector] +++ OK, passed 100 tests.
  13604. 1463.78 s [vector] replicate: OK
  13605. 1463.78 s [vector] +++ OK, passed 100 tests.
  13606. 1463.78 s [vector] generate: OK
  13607. 1463.78 s [vector] +++ OK, passed 100 tests.
  13608. 1463.79 s [vector] iterateN: OK
  13609. 1463.79 s [vector] +++ OK, passed 100 tests.
  13610. 1463.80 s [vector] iterateNM: OK (0.02s)
  13611. 1463.80 s [vector] +++ OK, passed 100 tests.
  13612. 1463.82 s [vector] generateM: OK (0.02s)
  13613. 1463.82 s [vector] +++ OK, passed 100 tests.
  13614. 1463.83 s [vector] replicateM: OK (0.01s)
  13615. 1463.83 s [vector] +++ OK, passed 100 tests.
  13616. 1463.83 s [vector] create: OK
  13617. 1463.83 s [vector] +++ OK, passed 100 tests.
  13618. 1463.83 s [vector] createT: OK
  13619. 1463.83 s [vector] +++ OK, passed 100 tests.
  13620. 1463.83 s [vector] unfoldr: OK
  13621. 1463.83 s [vector] +++ OK, passed 100 tests.
  13622. 1463.83 s [vector] unfoldrN: OK
  13623. 1463.83 s [vector] +++ OK, passed 100 tests.
  13624. 1463.83 s [vector] unfoldrExactN: OK
  13625. 1463.83 s [vector] +++ OK, passed 100 tests.
  13626. 1463.83 s [vector] unfoldrM: OK
  13627. 1463.84 s [vector] +++ OK, passed 100 tests.
  13628. 1463.85 s [vector] unfoldrNM: OK
  13629. 1463.85 s [vector] +++ OK, passed 100 tests.
  13630. 1463.86 s [vector] unfoldrExactNM: OK (0.02s)
  13631. 1463.86 s [vector] +++ OK, passed 100 tests.
  13632. 1463.87 s [vector] constructN: OK
  13633. 1463.87 s [vector] +++ OK, passed 100 tests.
  13634. 1463.87 s [vector] constructrN: OK
  13635. 1463.88 s [vector] +++ OK, passed 100 tests.
  13636. 1463.88 s [vector] cons: OK
  13637. 1463.89 s [vector] +++ OK, passed 100 tests.
  13638. 1463.89 s [vector] snoc: OK
  13639. 1463.89 s [vector] +++ OK, passed 100 tests.
  13640. 1463.89 s [vector] append: OK
  13641. 1463.89 s [vector] +++ OK, passed 100 tests.
  13642. 1463.89 s [vector] concat: OK (0.01s)
  13643. 1463.89 s [vector] +++ OK, passed 100 tests.
  13644. 1463.89 s [vector] force: OK
  13645. 1463.89 s [vector] +++ OK, passed 100 tests.
  13646. 1463.89 s [vector] upd: OK
  13647. 1463.89 s [vector] +++ OK, passed 100 tests.
  13648. 1463.89 s [vector] accum: OK
  13649. 1463.90 s [vector] +++ OK, passed 100 tests.
  13650. 1463.90 s [vector] reverse: OK
  13651. 1463.90 s [vector] +++ OK, passed 100 tests.
  13652. 1463.90 s [vector] backpermute: OK
  13653. 1463.90 s [vector] +++ OK, passed 100 tests.
  13654. 1463.90 s [vector] map: OK
  13655. 1463.90 s [vector] +++ OK, passed 100 tests.
  13656. 1463.90 s [vector] imap: OK
  13657. 1463.90 s [vector] +++ OK, passed 100 tests.
  13658. 1463.90 s [vector] concatMap: OK
  13659. 1463.90 s [vector] +++ OK, passed 100 tests.
  13660. 1463.90 s [vector] mapM: OK
  13661. 1463.90 s [vector] +++ OK, passed 100 tests.
  13662. 1463.91 s [vector] mapM_: OK (0.01s)
  13663. 1463.91 s [vector] +++ OK, passed 100 tests.
  13664. 1463.91 s [vector] forM: OK
  13665. 1463.92 s [vector] +++ OK, passed 100 tests.
  13666. 1463.92 s [vector] forM_: OK
  13667. 1463.92 s [vector] +++ OK, passed 100 tests.
  13668. 1463.92 s [vector] imapM: OK
  13669. 1463.93 s [vector] +++ OK, passed 100 tests.
  13670. 1463.94 s [vector] imapM_: OK (0.01s)
  13671. 1463.94 s [vector] +++ OK, passed 100 tests.
  13672. 1463.94 s [vector] zipWith: OK
  13673. 1463.94 s [vector] +++ OK, passed 100 tests.
  13674. 1463.94 s [vector] zipWith3: OK
  13675. 1463.94 s [vector] +++ OK, passed 100 tests.
  13676. 1463.94 s [vector] izipWith: OK
  13677. 1463.95 s [vector] +++ OK, passed 100 tests.
  13678. 1463.95 s [vector] izipWith3: OK
  13679. 1463.95 s [vector] +++ OK, passed 100 tests.
  13680. 1463.95 s [vector] izipWithM: OK
  13681. 1463.95 s [vector] +++ OK, passed 100 tests.
  13682. 1463.95 s [vector] izipWithM_: OK
  13683. 1463.95 s [vector] +++ OK, passed 100 tests.
  13684. 1463.96 s [vector] zipWithM: OK
  13685. 1463.96 s [vector] +++ OK, passed 100 tests.
  13686. 1463.96 s [vector] zipWithM_: OK
  13687. 1463.96 s [vector] +++ OK, passed 100 tests.
  13688. 1463.96 s [vector] filter: OK
  13689. 1463.97 s [vector] +++ OK, passed 100 tests.
  13690. 1463.98 s [vector] ifilter: OK
  13691. 1463.98 s [vector] +++ OK, passed 100 tests.
  13692. 1463.99 s [vector] filterM: OK (0.02s)
  13693. 1463.99 s [vector] +++ OK, passed 100 tests.
  13694. 1463.99 s [vector] uniq: OK
  13695. 1463.99 s [vector] +++ OK, passed 100 tests.
  13696. 1463.99 s [vector] mapMaybe: OK
  13697. 1463.99 s [vector] +++ OK, passed 100 tests.
  13698. 1463.99 s [vector] imapMaybe: OK
  13699. 1463.99 s [vector] +++ OK, passed 100 tests.
  13700. 1464.00 s [vector] takeWhile: OK
  13701. 1464.00 s [vector] +++ OK, passed 100 tests.
  13702. 1464.00 s [vector] dropWhile: OK
  13703. 1464.00 s [vector] +++ OK, passed 100 tests.
  13704. 1464.00 s [vector] partition: OK
  13705. 1464.00 s [vector] +++ OK, passed 100 tests.
  13706. 1464.00 s [vector] partitionWith: OK
  13707. 1464.00 s [vector] +++ OK, passed 100 tests.
  13708. 1464.00 s [vector] span: OK
  13709. 1464.00 s [vector] +++ OK, passed 100 tests.
  13710. 1464.00 s [vector] break: OK
  13711. 1464.00 s [vector] +++ OK, passed 100 tests.
  13712. 1464.00 s [vector] spanR: OK
  13713. 1464.00 s [vector] +++ OK, passed 100 tests.
  13714. 1464.00 s [vector] breakR: OK
  13715. 1464.00 s [vector] +++ OK, passed 100 tests.
  13716. 1464.00 s [vector] groupBy: OK
  13717. 1464.00 s [vector] +++ OK, passed 100 tests.
  13718. 1464.00 s [vector] elem: OK
  13719. 1464.00 s [vector] +++ OK, passed 100 tests.
  13720. 1464.00 s [vector] notElem: OK
  13721. 1464.00 s [vector] +++ OK, passed 100 tests.
  13722. 1464.00 s [vector] find: OK
  13723. 1464.00 s [vector] +++ OK, passed 100 tests.
  13724. 1464.00 s [vector] findIndex: OK
  13725. 1464.00 s [vector] +++ OK, passed 100 tests.
  13726. 1464.01 s [vector] findIndexR: OK
  13727. 1464.01 s [vector] +++ OK, passed 100 tests.
  13728. 1464.01 s [vector] findIndices: OK
  13729. 1464.01 s [vector] +++ OK, passed 100 tests.
  13730. 1464.01 s [vector] elemIndex: OK
  13731. 1464.01 s [vector] +++ OK, passed 100 tests.
  13732. 1464.01 s [vector] elemIndices: OK
  13733. 1464.01 s [vector] +++ OK, passed 100 tests.
  13734. 1464.01 s [vector] foldl: OK
  13735. 1464.01 s [vector] +++ OK, passed 100 tests.
  13736. 1464.01 s [vector] foldl1: OK
  13737. 1464.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13738. 1464.01 s [vector] foldl': OK
  13739. 1464.01 s [vector] +++ OK, passed 100 tests.
  13740. 1464.01 s [vector] foldl1': OK
  13741. 1464.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13742. 1464.01 s [vector] foldr: OK
  13743. 1464.01 s [vector] +++ OK, passed 100 tests.
  13744. 1464.02 s [vector] foldr1: OK
  13745. 1464.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13746. 1464.02 s [vector] foldr': OK
  13747. 1464.02 s [vector] +++ OK, passed 100 tests.
  13748. 1464.02 s [vector] foldr1': OK
  13749. 1464.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13750. 1464.02 s [vector] ifoldl: OK
  13751. 1464.02 s [vector] +++ OK, passed 100 tests.
  13752. 1464.02 s [vector] ifoldl': OK
  13753. 1464.02 s [vector] +++ OK, passed 100 tests.
  13754. 1464.03 s [vector] ifoldr: OK
  13755. 1464.03 s [vector] +++ OK, passed 100 tests.
  13756. 1464.03 s [vector] ifoldr': OK
  13757. 1464.03 s [vector] +++ OK, passed 100 tests.
  13758. 1464.03 s [vector] ifoldM: OK
  13759. 1464.04 s [vector] +++ OK, passed 100 tests.
  13760. 1464.04 s [vector] ifoldM': OK
  13761. 1464.04 s [vector] +++ OK, passed 100 tests.
  13762. 1464.06 s [vector] ifoldM_: OK (0.01s)
  13763. 1464.06 s [vector] +++ OK, passed 100 tests.
  13764. 1464.06 s [vector] ifoldM'_: OK (0.01s)
  13765. 1464.06 s [vector] +++ OK, passed 100 tests.
  13766. 1464.06 s [vector] all: OK
  13767. 1464.06 s [vector] +++ OK, passed 100 tests.
  13768. 1464.06 s [vector] any: OK
  13769. 1464.06 s [vector] +++ OK, passed 100 tests.
  13770. 1464.06 s [vector] prescanl: OK
  13771. 1464.06 s [vector] +++ OK, passed 100 tests.
  13772. 1464.06 s [vector] prescanl': OK
  13773. 1464.07 s [vector] +++ OK, passed 100 tests.
  13774. 1464.07 s [vector] postscanl: OK
  13775. 1464.07 s [vector] +++ OK, passed 100 tests.
  13776. 1464.07 s [vector] postscanl': OK
  13777. 1464.07 s [vector] +++ OK, passed 100 tests.
  13778. 1464.07 s [vector] scanl: OK
  13779. 1464.07 s [vector] +++ OK, passed 100 tests.
  13780. 1464.07 s [vector] scanl': OK
  13781. 1464.07 s [vector] +++ OK, passed 100 tests.
  13782. 1464.07 s [vector] scanl1: OK
  13783. 1464.07 s [vector] +++ OK, passed 100 tests.
  13784. 1464.07 s [vector] scanl1': OK
  13785. 1464.07 s [vector] +++ OK, passed 100 tests.
  13786. 1464.07 s [vector] iscanl: OK
  13787. 1464.07 s [vector] +++ OK, passed 100 tests.
  13788. 1464.08 s [vector] iscanl': OK
  13789. 1464.08 s [vector] +++ OK, passed 100 tests.
  13790. 1464.08 s [vector] prescanr: OK
  13791. 1464.08 s [vector] +++ OK, passed 100 tests.
  13792. 1464.08 s [vector] prescanr': OK
  13793. 1464.08 s [vector] +++ OK, passed 100 tests.
  13794. 1464.08 s [vector] postscanr: OK
  13795. 1464.08 s [vector] +++ OK, passed 100 tests.
  13796. 1464.08 s [vector] postscanr': OK
  13797. 1464.09 s [vector] +++ OK, passed 100 tests.
  13798. 1464.09 s [vector] scanr: OK
  13799. 1464.09 s [vector] +++ OK, passed 100 tests.
  13800. 1464.09 s [vector] scanr': OK
  13801. 1464.09 s [vector] +++ OK, passed 100 tests.
  13802. 1464.09 s [vector] scanr1: OK
  13803. 1464.09 s [vector] +++ OK, passed 100 tests.
  13804. 1464.09 s [vector] scanr1': OK
  13805. 1464.09 s [vector] +++ OK, passed 100 tests.
  13806. 1464.10 s [vector] iscanr: OK
  13807. 1464.10 s [vector] +++ OK, passed 100 tests.
  13808. 1464.10 s [vector] iscanr': OK
  13809. 1464.10 s [vector] +++ OK, passed 100 tests.
  13810. 1464.10 s [vector] mut_read: OK
  13811. 1464.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13812. 1464.10 s [vector] mut_write: OK
  13813. 1464.10 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13814. 1464.10 s [vector] mut_modify: OK
  13815. 1464.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13816. 1464.10 s [vector] mut_generate: OK
  13817. 1464.10 s [vector] +++ OK, passed 100 tests.
  13818. 1464.12 s [vector] mut_generateM: OK (0.01s)
  13819. 1464.12 s [vector] +++ OK, passed 100 tests.
  13820. 1464.12 s [vector] mut_mapM_: OK (0.01s)
  13821. 1464.12 s [vector] +++ OK, passed 100 tests.
  13822. 1464.14 s [vector] mut_imapM_: OK
  13823. 1464.14 s [vector] +++ OK, passed 100 tests.
  13824. 1464.16 s [vector] mut_forM_: OK
  13825. 1464.16 s [vector] +++ OK, passed 100 tests.
  13826. 1464.16 s [vector] mut_iforM_: OK (0.02s)
  13827. 1464.16 s [vector] +++ OK, passed 100 tests.
  13828. 1464.16 s [vector] mut_foldr: OK
  13829. 1464.16 s [vector] +++ OK, passed 100 tests.
  13830. 1464.16 s [vector] mut_foldr': OK
  13831. 1464.16 s [vector] +++ OK, passed 100 tests.
  13832. 1464.16 s [vector] mut_foldl: OK
  13833. 1464.16 s [vector] +++ OK, passed 100 tests.
  13834. 1464.17 s [vector] mut_foldl': OK
  13835. 1464.17 s [vector] +++ OK, passed 100 tests.
  13836. 1464.17 s [vector] mut_ifoldr: OK
  13837. 1464.17 s [vector] +++ OK, passed 100 tests.
  13838. 1464.17 s [vector] mut_ifoldr': OK
  13839. 1464.17 s [vector] +++ OK, passed 100 tests.
  13840. 1464.17 s [vector] mut_ifoldl: OK
  13841. 1464.17 s [vector] +++ OK, passed 100 tests.
  13842. 1464.17 s [vector] mut_ifoldl': OK
  13843. 1464.18 s [vector] +++ OK, passed 100 tests.
  13844. 1464.18 s [vector] mut_foldM: OK
  13845. 1464.18 s [vector] +++ OK, passed 100 tests.
  13846. 1464.18 s [vector] mut_foldM': OK
  13847. 1464.18 s [vector] +++ OK, passed 100 tests.
  13848. 1464.18 s [vector] mut_foldrM: OK
  13849. 1464.18 s [vector] +++ OK, passed 100 tests.
  13850. 1464.18 s [vector] mut_foldrM': OK
  13851. 1464.18 s [vector] +++ OK, passed 100 tests.
  13852. 1464.18 s [vector] mut_ifoldM: OK
  13853. 1464.18 s [vector] +++ OK, passed 100 tests.
  13854. 1464.18 s [vector] mut_ifoldM': OK
  13855. 1464.18 s [vector] +++ OK, passed 100 tests.
  13856. 1464.18 s [vector] mut_ifoldrM: OK
  13857. 1464.18 s [vector] +++ OK, passed 100 tests.
  13858. 1464.18 s [vector] mut_ifoldrM': OK
  13859. 1464.18 s [vector] +++ OK, passed 100 tests.
  13860. 1464.19 s [vector] compare: OK
  13861. 1464.19 s [vector] +++ OK, passed 100 tests.
  13862. 1464.19 s [vector] maximum: OK
  13863. 1464.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13864. 1464.19 s [vector] minimum: OK
  13865. 1464.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13866. 1464.19 s [vector] minIndex: OK
  13867. 1464.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13868. 1464.19 s [vector] maxIndex: OK
  13869. 1464.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13870. 1464.19 s [vector] maximumBy: OK
  13871. 1464.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13872. 1464.19 s [vector] minimumBy: OK
  13873. 1464.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13874. 1464.19 s [vector] maximumOn: OK
  13875. 1464.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13876. 1464.19 s [vector] minimumOn: OK
  13877. 1464.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13878. 1464.19 s [vector] maxIndexBy: OK
  13879. 1464.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13880. 1464.19 s [vector] minIndexBy: OK
  13881. 1464.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13882. 1464.19 s [vector] ListFirstMaxIndexWins: OK
  13883. 1464.19 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13884. 1464.19 s [vector] FalseListFirstMaxIndexWins: OK
  13885. 1464.19 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  13886. 1464.19 s [vector] []
  13887. 1464.19 s [vector] zip: OK
  13888. 1464.19 s [vector] +++ OK, passed 100 tests.
  13889. 1464.20 s [vector] zip3: OK
  13890. 1464.20 s [vector] +++ OK, passed 100 tests.
  13891. 1464.20 s [vector] unzip: OK
  13892. 1464.20 s [vector] +++ OK, passed 100 tests.
  13893. 1464.20 s [vector] unzip3: OK
  13894. 1464.20 s [vector] +++ OK, passed 100 tests.
  13895. 1464.20 s [vector] indexed: OK
  13896. 1464.20 s [vector] +++ OK, passed 100 tests.
  13897. 1464.20 s [vector] update: OK
  13898. 1464.20 s [vector] +++ OK, passed 100 tests.
  13899. 1464.20 s [vector] mempty: OK
  13900. 1464.20 s [vector] +++ OK, passed 100 tests.
  13901. 1464.20 s [vector] mappend: OK
  13902. 1464.20 s [vector] +++ OK, passed 100 tests.
  13903. 1464.22 s [vector] mconcat: OK (0.02s)
  13904. 1464.22 s [vector] +++ OK, passed 100 tests.
  13905. 1464.22 s [vector] glength: OK
  13906. 1464.22 s [vector] +++ OK, passed 100 tests.
  13907. 1464.22 s [vector] and: OK
  13908. 1464.22 s [vector] +++ OK, passed 100 tests.
  13909. 1464.22 s [vector] or: OK
  13910. 1464.22 s [vector] +++ OK, passed 100 tests.
  13911. 1464.22 s [vector] (Int)
  13912. 1464.22 s [vector] fromList.toList == id: OK
  13913. 1464.22 s [vector] +++ OK, passed 100 tests.
  13914. 1464.22 s [vector] toList.fromList == id: OK
  13915. 1464.22 s [vector] +++ OK, passed 100 tests.
  13916. 1464.22 s [vector] unstream.stream == id: OK
  13917. 1464.22 s [vector] +++ OK, passed 100 tests.
  13918. 1464.22 s [vector] stream.unstream == id: OK
  13919. 1464.22 s [vector] +++ OK, passed 100 tests.
  13920. 1464.22 s [vector] eq: OK
  13921. 1464.22 s [vector] +++ OK, passed 100 tests.
  13922. 1464.22 s [vector] length: OK
  13923. 1464.22 s [vector] +++ OK, passed 100 tests.
  13924. 1464.22 s [vector] null: OK
  13925. 1464.22 s [vector] +++ OK, passed 100 tests.
  13926. 1464.22 s [vector] index: OK
  13927. 1464.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13928. 1464.22 s [vector] safeIndex: OK
  13929. 1464.22 s [vector] +++ OK, passed 100 tests.
  13930. 1464.23 s [vector] head: OK
  13931. 1464.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13932. 1464.23 s [vector] last: OK
  13933. 1464.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13934. 1464.23 s [vector] unsafeIndex: OK
  13935. 1464.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13936. 1464.23 s [vector] unsafeHead: OK
  13937. 1464.23 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13938. 1464.23 s [vector] unsafeLast: OK
  13939. 1464.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13940. 1464.23 s [vector] slice: OK
  13941. 1464.23 s [vector] +++ OK, passed 100 tests.
  13942. 1464.23 s [vector] init: OK
  13943. 1464.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13944. 1464.23 s [vector] tail: OK
  13945. 1464.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13946. 1464.23 s [vector] take: OK
  13947. 1464.23 s [vector] +++ OK, passed 100 tests.
  13948. 1464.23 s [vector] drop: OK
  13949. 1464.23 s [vector] +++ OK, passed 100 tests.
  13950. 1464.23 s [vector] splitAt: OK
  13951. 1464.23 s [vector] +++ OK, passed 100 tests.
  13952. 1464.23 s [vector] empty: OK
  13953. 1464.23 s [vector] +++ OK, passed 100 tests.
  13954. 1464.23 s [vector] singleton: OK
  13955. 1464.23 s [vector] +++ OK, passed 100 tests.
  13956. 1464.23 s [vector] replicate: OK
  13957. 1464.23 s [vector] +++ OK, passed 100 tests.
  13958. 1464.23 s [vector] generate: OK
  13959. 1464.23 s [vector] +++ OK, passed 100 tests.
  13960. 1464.24 s [vector] iterateN: OK
  13961. 1464.24 s [vector] +++ OK, passed 100 tests.
  13962. 1464.26 s [vector] iterateNM: OK (0.01s)
  13963. 1464.26 s [vector] +++ OK, passed 100 tests.
  13964. 1464.29 s [vector] generateM: OK (0.03s)
  13965. 1464.29 s [vector] +++ OK, passed 100 tests.
  13966. 1464.29 s [vector] replicateM: OK
  13967. 1464.30 s [vector] +++ OK, passed 100 tests.
  13968. 1464.30 s [vector] create: OK
  13969. 1464.30 s [vector] +++ OK, passed 100 tests.
  13970. 1464.30 s [vector] createT: OK
  13971. 1464.30 s [vector] +++ OK, passed 100 tests.
  13972. 1464.30 s [vector] unfoldr: OK
  13973. 1464.30 s [vector] +++ OK, passed 100 tests.
  13974. 1464.30 s [vector] unfoldrN: OK
  13975. 1464.30 s [vector] +++ OK, passed 100 tests.
  13976. 1464.30 s [vector] unfoldrExactN: OK
  13977. 1464.30 s [vector] +++ OK, passed 100 tests.
  13978. 1464.30 s [vector] unfoldrM: OK
  13979. 1464.30 s [vector] +++ OK, passed 100 tests.
  13980. 1464.31 s [vector] unfoldrNM: OK
  13981. 1464.31 s [vector] +++ OK, passed 100 tests.
  13982. 1464.33 s [vector] unfoldrExactNM: OK (0.01s)
  13983. 1464.33 s [vector] +++ OK, passed 100 tests.
  13984. 1464.33 s [vector] constructN: OK
  13985. 1464.33 s [vector] +++ OK, passed 100 tests.
  13986. 1464.34 s [vector] constructrN: OK
  13987. 1464.34 s [vector] +++ OK, passed 100 tests.
  13988. 1464.35 s [vector] cons: OK
  13989. 1464.35 s [vector] +++ OK, passed 100 tests.
  13990. 1464.35 s [vector] snoc: OK
  13991. 1464.35 s [vector] +++ OK, passed 100 tests.
  13992. 1464.35 s [vector] append: OK
  13993. 1464.35 s [vector] +++ OK, passed 100 tests.
  13994. 1464.35 s [vector] concat: OK (0.02s)
  13995. 1464.35 s [vector] +++ OK, passed 100 tests.
  13996. 1464.35 s [vector] force: OK
  13997. 1464.36 s [vector] +++ OK, passed 100 tests.
  13998. 1464.36 s [vector] upd: OK
  13999. 1464.36 s [vector] +++ OK, passed 100 tests.
  14000. 1464.36 s [vector] accum: OK
  14001. 1464.36 s [vector] +++ OK, passed 100 tests.
  14002. 1464.36 s [vector] reverse: OK
  14003. 1464.36 s [vector] +++ OK, passed 100 tests.
  14004. 1464.36 s [vector] backpermute: OK
  14005. 1464.36 s [vector] +++ OK, passed 100 tests.
  14006. 1464.36 s [vector] map: OK
  14007. 1464.36 s [vector] +++ OK, passed 100 tests.
  14008. 1464.36 s [vector] imap: OK
  14009. 1464.36 s [vector] +++ OK, passed 100 tests.
  14010. 1464.36 s [vector] concatMap: OK
  14011. 1464.37 s [vector] +++ OK, passed 100 tests.
  14012. 1464.38 s [vector] mapM: OK
  14013. 1464.38 s [vector] +++ OK, passed 100 tests.
  14014. 1464.39 s [vector] mapM_: OK (0.02s)
  14015. 1464.39 s [vector] +++ OK, passed 100 tests.
  14016. 1464.40 s [vector] forM: OK
  14017. 1464.40 s [vector] +++ OK, passed 100 tests.
  14018. 1464.41 s [vector] forM_: OK (0.02s)
  14019. 1464.41 s [vector] +++ OK, passed 100 tests.
  14020. 1464.41 s [vector] imapM: OK
  14021. 1464.42 s [vector] +++ OK, passed 100 tests.
  14022. 1464.43 s [vector] imapM_: OK (0.02s)
  14023. 1464.44 s [vector] +++ OK, passed 100 tests.
  14024. 1464.44 s [vector] zipWith: OK
  14025. 1464.44 s [vector] +++ OK, passed 100 tests.
  14026. 1464.44 s [vector] zipWith3: OK
  14027. 1464.44 s [vector] +++ OK, passed 100 tests.
  14028. 1464.44 s [vector] izipWith: OK
  14029. 1464.44 s [vector] +++ OK, passed 100 tests.
  14030. 1464.44 s [vector] izipWith3: OK
  14031. 1464.44 s [vector] +++ OK, passed 100 tests.
  14032. 1464.46 s [vector] izipWithM: OK
  14033. 1464.46 s [vector] +++ OK, passed 100 tests.
  14034. 1464.46 s [vector] izipWithM_: OK (0.01s)
  14035. 1464.46 s [vector] +++ OK, passed 100 tests.
  14036. 1464.46 s [vector] zipWithM: OK
  14037. 1464.46 s [vector] +++ OK, passed 100 tests.
  14038. 1464.67 s [vector] zipWithM_: OK (0.01s)
  14039. 1464.67 s [vector] +++ OK, passed 100 tests.
  14040. 1464.67 s [vector] filter: OK
  14041. 1464.67 s [vector] +++ OK, passed 100 tests.
  14042. 1464.67 s [vector] ifilter: OK
  14043. 1464.67 s [vector] +++ OK, passed 100 tests.
  14044. 1464.67 s [vector] filterM: OK (0.03s)
  14045. 1464.67 s [vector] +++ OK, passed 100 tests.
  14046. 1464.67 s [vector] uniq: OK
  14047. 1464.67 s [vector] +++ OK, passed 100 tests.
  14048. 1464.67 s [vector] mapMaybe: OK
  14049. 1464.67 s [vector] +++ OK, passed 100 tests.
  14050. 1464.67 s [vector] imapMaybe: OK
  14051. 1464.67 s [vector] +++ OK, passed 100 tests.
  14052. 1464.67 s [vector] takeWhile: OK
  14053. 1464.68 s [vector] +++ OK, passed 100 tests.
  14054. 1464.68 s [vector] dropWhile: OK
  14055. 1464.68 s [vector] +++ OK, passed 100 tests.
  14056. 1464.68 s [vector] partition: OK
  14057. 1464.68 s [vector] +++ OK, passed 100 tests.
  14058. 1464.68 s [vector] partitionWith: OK
  14059. 1464.68 s [vector] +++ OK, passed 100 tests.
  14060. 1464.68 s [vector] span: OK
  14061. 1464.68 s [vector] +++ OK, passed 100 tests.
  14062. 1464.68 s [vector] break: OK
  14063. 1464.68 s [vector] +++ OK, passed 100 tests.
  14064. 1464.68 s [vector] spanR: OK
  14065. 1464.68 s [vector] +++ OK, passed 100 tests.
  14066. 1464.68 s [vector] breakR: OK
  14067. 1464.68 s [vector] +++ OK, passed 100 tests.
  14068. 1464.68 s [vector] groupBy: OK
  14069. 1464.68 s [vector] +++ OK, passed 100 tests.
  14070. 1464.68 s [vector] elem: OK
  14071. 1464.68 s [vector] +++ OK, passed 100 tests.
  14072. 1464.68 s [vector] notElem: OK
  14073. 1464.68 s [vector] +++ OK, passed 100 tests.
  14074. 1464.68 s [vector] find: OK
  14075. 1464.68 s [vector] +++ OK, passed 100 tests.
  14076. 1464.68 s [vector] findIndex: OK
  14077. 1464.68 s [vector] +++ OK, passed 100 tests.
  14078. 1464.68 s [vector] findIndexR: OK
  14079. 1464.68 s [vector] +++ OK, passed 100 tests.
  14080. 1464.68 s [vector] findIndices: OK
  14081. 1464.68 s [vector] +++ OK, passed 100 tests.
  14082. 1464.68 s [vector] elemIndex: OK
  14083. 1464.68 s [vector] +++ OK, passed 100 tests.
  14084. 1464.68 s [vector] elemIndices: OK
  14085. 1464.68 s [vector] +++ OK, passed 100 tests.
  14086. 1464.68 s [vector] foldl: OK
  14087. 1464.68 s [vector] +++ OK, passed 100 tests.
  14088. 1464.68 s [vector] foldl1: OK
  14089. 1464.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14090. 1464.68 s [vector] foldl': OK
  14091. 1464.68 s [vector] +++ OK, passed 100 tests.
  14092. 1464.68 s [vector] foldl1': OK
  14093. 1464.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14094. 1464.68 s [vector] foldr: OK
  14095. 1464.68 s [vector] +++ OK, passed 100 tests.
  14096. 1464.68 s [vector] foldr1: OK
  14097. 1464.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14098. 1464.68 s [vector] foldr': OK
  14099. 1464.68 s [vector] +++ OK, passed 100 tests.
  14100. 1464.68 s [vector] foldr1': OK
  14101. 1464.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14102. 1464.68 s [vector] ifoldl: OK
  14103. 1464.68 s [vector] +++ OK, passed 100 tests.
  14104. 1464.68 s [vector] ifoldl': OK
  14105. 1464.68 s [vector] +++ OK, passed 100 tests.
  14106. 1464.68 s [vector] ifoldr: OK
  14107. 1464.68 s [vector] +++ OK, passed 100 tests.
  14108. 1464.68 s [vector] ifoldr': OK
  14109. 1464.68 s [vector] +++ OK, passed 100 tests.
  14110. 1464.68 s [vector] ifoldM: OK
  14111. 1464.68 s [vector] +++ OK, passed 100 tests.
  14112. 1464.68 s [vector] ifoldM': OK
  14113. 1464.68 s [vector] +++ OK, passed 100 tests.
  14114. 1464.68 s [vector] ifoldM_: OK (0.01s)
  14115. 1464.68 s [vector] +++ OK, passed 100 tests.
  14116. 1464.68 s [vector] ifoldM'_: OK (0.02s)
  14117. 1464.68 s [vector] +++ OK, passed 100 tests.
  14118. 1464.68 s [vector] all: OK
  14119. 1464.68 s [vector] +++ OK, passed 100 tests.
  14120. 1464.68 s [vector] any: OK
  14121. 1464.68 s [vector] +++ OK, passed 100 tests.
  14122. 1464.68 s [vector] prescanl: OK
  14123. 1464.68 s [vector] +++ OK, passed 100 tests.
  14124. 1464.68 s [vector] prescanl': OK
  14125. 1464.68 s [vector] +++ OK, passed 100 tests.
  14126. 1464.68 s [vector] postscanl: OK
  14127. 1464.68 s [vector] +++ OK, passed 100 tests.
  14128. 1464.68 s [vector] postscanl': OK
  14129. 1464.68 s [vector] +++ OK, passed 100 tests.
  14130. 1464.68 s [vector] scanl: OK
  14131. 1464.68 s [vector] +++ OK, passed 100 tests.
  14132. 1464.68 s [vector] scanl': OK
  14133. 1464.68 s [vector] +++ OK, passed 100 tests.
  14134. 1464.68 s [vector] scanl1: OK
  14135. 1464.68 s [vector] +++ OK, passed 100 tests.
  14136. 1464.68 s [vector] scanl1': OK
  14137. 1464.68 s [vector] +++ OK, passed 100 tests.
  14138. 1464.68 s [vector] iscanl: OK
  14139. 1464.68 s [vector] +++ OK, passed 100 tests.
  14140. 1464.68 s [vector] iscanl': OK
  14141. 1464.68 s [vector] +++ OK, passed 100 tests.
  14142. 1464.68 s [vector] prescanr: OK
  14143. 1464.68 s [vector] +++ OK, passed 100 tests.
  14144. 1464.68 s [vector] prescanr': OK
  14145. 1464.68 s [vector] +++ OK, passed 100 tests.
  14146. 1464.68 s [vector] postscanr: OK
  14147. 1464.68 s [vector] +++ OK, passed 100 tests.
  14148. 1464.68 s [vector] postscanr': OK
  14149. 1464.68 s [vector] +++ OK, passed 100 tests.
  14150. 1464.68 s [vector] scanr: OK
  14151. 1464.68 s [vector] +++ OK, passed 100 tests.
  14152. 1464.68 s [vector] scanr': OK
  14153. 1464.68 s [vector] +++ OK, passed 100 tests.
  14154. 1464.68 s [vector] scanr1: OK
  14155. 1464.68 s [vector] +++ OK, passed 100 tests.
  14156. 1464.68 s [vector] scanr1': OK
  14157. 1464.68 s [vector] +++ OK, passed 100 tests.
  14158. 1464.68 s [vector] iscanr: OK
  14159. 1464.68 s [vector] +++ OK, passed 100 tests.
  14160. 1464.68 s [vector] iscanr': OK
  14161. 1464.68 s [vector] +++ OK, passed 100 tests.
  14162. 1464.68 s [vector] mut_read: OK
  14163. 1464.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14164. 1464.68 s [vector] mut_write: OK
  14165. 1464.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14166. 1464.68 s [vector] mut_modify: OK
  14167. 1464.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14168. 1464.68 s [vector] mut_generate: OK
  14169. 1464.68 s [vector] +++ OK, passed 100 tests.
  14170. 1464.68 s [vector] mut_generateM: OK
  14171. 1464.68 s [vector] +++ OK, passed 100 tests.
  14172. 1464.70 s [vector] mut_mapM_: OK (0.02s)
  14173. 1464.70 s [vector] +++ OK, passed 100 tests.
  14174. 1464.72 s [vector] mut_imapM_: OK (0.02s)
  14175. 1464.72 s [vector] +++ OK, passed 100 tests.
  14176. 1464.74 s [vector] mut_forM_: OK (0.02s)
  14177. 1464.74 s [vector] +++ OK, passed 100 tests.
  14178. 1464.74 s [vector] mut_iforM_: OK (0.01s)
  14179. 1464.74 s [vector] +++ OK, passed 100 tests.
  14180. 1464.75 s [vector] mut_foldr: OK
  14181. 1464.75 s [vector] +++ OK, passed 100 tests.
  14182. 1464.75 s [vector] mut_foldr': OK
  14183. 1464.75 s [vector] +++ OK, passed 100 tests.
  14184. 1464.75 s [vector] mut_foldl: OK
  14185. 1464.75 s [vector] +++ OK, passed 100 tests.
  14186. 1464.75 s [vector] mut_foldl': OK
  14187. 1464.76 s [vector] +++ OK, passed 100 tests.
  14188. 1464.76 s [vector] mut_ifoldr: OK
  14189. 1464.76 s [vector] +++ OK, passed 100 tests.
  14190. 1464.76 s [vector] mut_ifoldr': OK
  14191. 1464.76 s [vector] +++ OK, passed 100 tests.
  14192. 1464.76 s [vector] mut_ifoldl: OK
  14193. 1464.76 s [vector] +++ OK, passed 100 tests.
  14194. 1464.77 s [vector] mut_ifoldl': OK
  14195. 1464.77 s [vector] +++ OK, passed 100 tests.
  14196. 1464.77 s [vector] mut_foldM: OK
  14197. 1464.77 s [vector] +++ OK, passed 100 tests.
  14198. 1464.78 s [vector] mut_foldM': OK
  14199. 1464.78 s [vector] +++ OK, passed 100 tests.
  14200. 1464.78 s [vector] mut_foldrM: OK
  14201. 1464.78 s [vector] +++ OK, passed 100 tests.
  14202. 1464.78 s [vector] mut_foldrM': OK
  14203. 1464.78 s [vector] +++ OK, passed 100 tests.
  14204. 1464.78 s [vector] mut_ifoldM: OK
  14205. 1464.78 s [vector] +++ OK, passed 100 tests.
  14206. 1464.78 s [vector] mut_ifoldM': OK
  14207. 1464.78 s [vector] +++ OK, passed 100 tests.
  14208. 1464.78 s [vector] mut_ifoldrM: OK
  14209. 1464.78 s [vector] +++ OK, passed 100 tests.
  14210. 1464.78 s [vector] mut_ifoldrM': OK
  14211. 1464.78 s [vector] +++ OK, passed 100 tests.
  14212. 1464.78 s [vector] compare: OK
  14213. 1464.78 s [vector] +++ OK, passed 100 tests.
  14214. 1464.78 s [vector] maximum: OK
  14215. 1464.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14216. 1464.78 s [vector] minimum: OK
  14217. 1464.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14218. 1464.78 s [vector] minIndex: OK
  14219. 1464.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14220. 1464.78 s [vector] maxIndex: OK
  14221. 1464.78 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14222. 1464.78 s [vector] maximumBy: OK
  14223. 1464.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14224. 1464.78 s [vector] minimumBy: OK
  14225. 1464.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14226. 1464.78 s [vector] maximumOn: OK
  14227. 1464.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14228. 1464.79 s [vector] minimumOn: OK
  14229. 1464.79 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14230. 1464.79 s [vector] maxIndexBy: OK
  14231. 1464.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14232. 1464.79 s [vector] minIndexBy: OK
  14233. 1464.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14234. 1464.79 s [vector] ListFirstMaxIndexWins: OK
  14235. 1464.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14236. 1464.79 s [vector] FalseListFirstMaxIndexWins: OK
  14237. 1464.79 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  14238. 1464.79 s [vector] []
  14239. 1464.79 s [vector] zip: OK
  14240. 1464.79 s [vector] +++ OK, passed 100 tests.
  14241. 1464.79 s [vector] zip3: OK
  14242. 1464.79 s [vector] +++ OK, passed 100 tests.
  14243. 1464.79 s [vector] unzip: OK
  14244. 1464.79 s [vector] +++ OK, passed 100 tests.
  14245. 1464.79 s [vector] unzip3: OK
  14246. 1464.79 s [vector] +++ OK, passed 100 tests.
  14247. 1464.79 s [vector] indexed: OK
  14248. 1464.80 s [vector] +++ OK, passed 100 tests.
  14249. 1464.80 s [vector] update: OK
  14250. 1464.80 s [vector] +++ OK, passed 100 tests.
  14251. 1464.80 s [vector] mempty: OK
  14252. 1464.80 s [vector] +++ OK, passed 100 tests.
  14253. 1464.80 s [vector] mappend: OK
  14254. 1464.80 s [vector] +++ OK, passed 100 tests.
  14255. 1464.82 s [vector] mconcat: OK (0.02s)
  14256. 1464.82 s [vector] +++ OK, passed 100 tests.
  14257. 1464.82 s [vector] glength: OK
  14258. 1464.82 s [vector] +++ OK, passed 100 tests.
  14259. 1464.82 s [vector] sum: OK
  14260. 1464.82 s [vector] +++ OK, passed 100 tests.
  14261. 1464.82 s [vector] product: OK
  14262. 1464.82 s [vector] +++ OK, passed 100 tests.
  14263. 1464.82 s [vector] enumFromN: OK
  14264. 1464.82 s [vector] +++ OK, passed 100 tests.
  14265. 1464.82 s [vector] enumFromThenN: OK
  14266. 1464.82 s [vector] +++ OK, passed 100 tests.
  14267. 1464.82 s [vector] enumFromTo: OK
  14268. 1464.82 s [vector] +++ OK, passed 100 tests.
  14269. 1464.82 s [vector] enumFromThenTo: OK
  14270. 1464.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14271. 1464.82 s [vector] (Float)
  14272. 1464.82 s [vector] fromList.toList == id: OK
  14273. 1464.82 s [vector] +++ OK, passed 100 tests.
  14274. 1464.82 s [vector] toList.fromList == id: OK
  14275. 1464.82 s [vector] +++ OK, passed 100 tests.
  14276. 1464.82 s [vector] unstream.stream == id: OK
  14277. 1464.82 s [vector] +++ OK, passed 100 tests.
  14278. 1464.82 s [vector] stream.unstream == id: OK
  14279. 1464.82 s [vector] +++ OK, passed 100 tests.
  14280. 1464.83 s [vector] eq: OK
  14281. 1464.83 s [vector] +++ OK, passed 100 tests.
  14282. 1464.83 s [vector] length: OK
  14283. 1464.83 s [vector] +++ OK, passed 100 tests.
  14284. 1464.83 s [vector] null: OK
  14285. 1464.83 s [vector] +++ OK, passed 100 tests.
  14286. 1464.83 s [vector] index: OK
  14287. 1464.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14288. 1464.83 s [vector] safeIndex: OK
  14289. 1464.83 s [vector] +++ OK, passed 100 tests.
  14290. 1464.83 s [vector] head: OK
  14291. 1464.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14292. 1464.83 s [vector] last: OK
  14293. 1464.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14294. 1464.83 s [vector] unsafeIndex: OK
  14295. 1464.83 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14296. 1464.83 s [vector] unsafeHead: OK
  14297. 1464.83 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14298. 1464.83 s [vector] unsafeLast: OK
  14299. 1464.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14300. 1464.83 s [vector] slice: OK
  14301. 1464.84 s [vector] +++ OK, passed 100 tests.
  14302. 1464.84 s [vector] init: OK
  14303. 1464.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14304. 1464.84 s [vector] tail: OK
  14305. 1464.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14306. 1464.84 s [vector] take: OK
  14307. 1464.84 s [vector] +++ OK, passed 100 tests.
  14308. 1464.84 s [vector] drop: OK
  14309. 1464.84 s [vector] +++ OK, passed 100 tests.
  14310. 1464.84 s [vector] splitAt: OK
  14311. 1464.84 s [vector] +++ OK, passed 100 tests.
  14312. 1464.84 s [vector] empty: OK
  14313. 1464.84 s [vector] +++ OK, passed 100 tests.
  14314. 1464.84 s [vector] singleton: OK
  14315. 1464.84 s [vector] +++ OK, passed 100 tests.
  14316. 1464.84 s [vector] replicate: OK
  14317. 1464.84 s [vector] +++ OK, passed 100 tests.
  14318. 1464.84 s [vector] generate: OK
  14319. 1464.84 s [vector] +++ OK, passed 100 tests.
  14320. 1464.86 s [vector] iterateN: OK
  14321. 1464.86 s [vector] +++ OK, passed 100 tests.
  14322. 1464.88 s [vector] iterateNM: OK (0.02s)
  14323. 1464.88 s [vector] +++ OK, passed 100 tests.
  14324. 1464.90 s [vector] generateM: OK (0.03s)
  14325. 1464.90 s [vector] +++ OK, passed 100 tests.
  14326. 1464.90 s [vector] replicateM: OK
  14327. 1464.90 s [vector] +++ OK, passed 100 tests.
  14328. 1464.90 s [vector] create: OK
  14329. 1464.90 s [vector] +++ OK, passed 100 tests.
  14330. 1464.90 s [vector] createT: OK
  14331. 1464.90 s [vector] +++ OK, passed 100 tests.
  14332. 1464.90 s [vector] unfoldr: OK
  14333. 1464.90 s [vector] +++ OK, passed 100 tests.
  14334. 1464.90 s [vector] unfoldrN: OK
  14335. 1464.90 s [vector] +++ OK, passed 100 tests.
  14336. 1464.91 s [vector] unfoldrExactN: OK
  14337. 1464.91 s [vector] +++ OK, passed 100 tests.
  14338. 1464.92 s [vector] unfoldrM: OK
  14339. 1464.92 s [vector] +++ OK, passed 100 tests.
  14340. 1464.93 s [vector] unfoldrNM: OK
  14341. 1464.93 s [vector] +++ OK, passed 100 tests.
  14342. 1464.94 s [vector] unfoldrExactNM: OK (0.02s)
  14343. 1464.94 s [vector] +++ OK, passed 100 tests.
  14344. 1464.95 s [vector] constructN: OK
  14345. 1464.95 s [vector] +++ OK, passed 100 tests.
  14346. 1464.95 s [vector] constructrN: OK
  14347. 1464.95 s [vector] +++ OK, passed 100 tests.
  14348. 1464.95 s [vector] cons: OK
  14349. 1464.95 s [vector] +++ OK, passed 100 tests.
  14350. 1464.96 s [vector] snoc: OK
  14351. 1464.96 s [vector] +++ OK, passed 100 tests.
  14352. 1464.96 s [vector] append: OK
  14353. 1464.96 s [vector] +++ OK, passed 100 tests.
  14354. 1464.98 s [vector] concat: OK (0.03s)
  14355. 1464.98 s [vector] +++ OK, passed 100 tests.
  14356. 1464.99 s [vector] force: OK
  14357. 1464.99 s [vector] +++ OK, passed 100 tests.
  14358. 1464.99 s [vector] upd: OK
  14359. 1464.99 s [vector] +++ OK, passed 100 tests.
  14360. 1464.99 s [vector] accum: OK
  14361. 1464.99 s [vector] +++ OK, passed 100 tests.
  14362. 1464.99 s [vector] reverse: OK
  14363. 1464.99 s [vector] +++ OK, passed 100 tests.
  14364. 1464.99 s [vector] backpermute: OK
  14365. 1465.00 s [vector] +++ OK, passed 100 tests.
  14366. 1465.00 s [vector] map: OK
  14367. 1465.00 s [vector] +++ OK, passed 100 tests.
  14368. 1465.00 s [vector] imap: OK
  14369. 1465.00 s [vector] +++ OK, passed 100 tests.
  14370. 1465.01 s [vector] concatMap: OK
  14371. 1465.02 s [vector] +++ OK, passed 100 tests.
  14372. 1465.02 s [vector] mapM: OK
  14373. 1465.02 s [vector] +++ OK, passed 100 tests.
  14374. 1465.05 s [vector] mapM_: OK (0.04s)
  14375. 1465.06 s [vector] +++ OK, passed 100 tests.
  14376. 1465.06 s [vector] forM: OK
  14377. 1465.06 s [vector] +++ OK, passed 100 tests.
  14378. 1465.09 s [vector] forM_: OK (0.03s)
  14379. 1465.09 s [vector] +++ OK, passed 100 tests.
  14380. 1465.10 s [vector] imapM: OK
  14381. 1465.10 s [vector] +++ OK, passed 100 tests.
  14382. 1465.13 s [vector] imapM_: OK (0.04s)
  14383. 1465.14 s [vector] +++ OK, passed 100 tests.
  14384. 1465.15 s [vector] zipWith: OK
  14385. 1465.15 s [vector] +++ OK, passed 100 tests.
  14386. 1465.15 s [vector] zipWith3: OK
  14387. 1465.15 s [vector] +++ OK, passed 100 tests.
  14388. 1465.15 s [vector] izipWith: OK
  14389. 1465.15 s [vector] +++ OK, passed 100 tests.
  14390. 1465.15 s [vector] izipWith3: OK
  14391. 1465.15 s [vector] +++ OK, passed 100 tests.
  14392. 1465.16 s [vector] izipWithM: OK
  14393. 1465.16 s [vector] +++ OK, passed 100 tests.
  14394. 1465.20 s [vector] izipWithM_: OK (0.03s)
  14395. 1465.20 s [vector] +++ OK, passed 100 tests.
  14396. 1465.20 s [vector] zipWithM: OK
  14397. 1465.20 s [vector] +++ OK, passed 100 tests.
  14398. 1465.22 s [vector] zipWithM_: OK (0.02s)
  14399. 1465.22 s [vector] +++ OK, passed 100 tests.
  14400. 1465.22 s [vector] filter: OK
  14401. 1465.22 s [vector] +++ OK, passed 100 tests.
  14402. 1465.24 s [vector] ifilter: OK
  14403. 1465.24 s [vector] +++ OK, passed 100 tests.
  14404. 1465.27 s [vector] filterM: OK (0.04s)
  14405. 1465.27 s [vector] +++ OK, passed 100 tests.
  14406. 1465.27 s [vector] uniq: OK
  14407. 1465.28 s [vector] +++ OK, passed 100 tests.
  14408. 1465.28 s [vector] mapMaybe: OK
  14409. 1465.28 s [vector] +++ OK, passed 100 tests.
  14410. 1465.28 s [vector] imapMaybe: OK
  14411. 1465.28 s [vector] +++ OK, passed 100 tests.
  14412. 1465.28 s [vector] takeWhile: OK
  14413. 1465.28 s [vector] +++ OK, passed 100 tests.
  14414. 1465.29 s [vector] dropWhile: OK
  14415. 1465.29 s [vector] +++ OK, passed 100 tests.
  14416. 1465.29 s [vector] partition: OK
  14417. 1465.29 s [vector] +++ OK, passed 100 tests.
  14418. 1465.30 s [vector] partitionWith: OK
  14419. 1465.30 s [vector] +++ OK, passed 100 tests.
  14420. 1465.30 s [vector] span: OK
  14421. 1465.30 s [vector] +++ OK, passed 100 tests.
  14422. 1465.30 s [vector] break: OK
  14423. 1465.30 s [vector] +++ OK, passed 100 tests.
  14424. 1465.30 s [vector] spanR: OK
  14425. 1465.30 s [vector] +++ OK, passed 100 tests.
  14426. 1465.31 s [vector] breakR: OK
  14427. 1465.31 s [vector] +++ OK, passed 100 tests.
  14428. 1465.31 s [vector] groupBy: OK
  14429. 1465.31 s [vector] +++ OK, passed 100 tests.
  14430. 1465.31 s [vector] elem: OK
  14431. 1465.31 s [vector] +++ OK, passed 100 tests.
  14432. 1465.31 s [vector] notElem: OK
  14433. 1465.31 s [vector] +++ OK, passed 100 tests.
  14434. 1465.31 s [vector] find: OK
  14435. 1465.31 s [vector] +++ OK, passed 100 tests.
  14436. 1465.31 s [vector] findIndex: OK
  14437. 1465.31 s [vector] +++ OK, passed 100 tests.
  14438. 1465.31 s [vector] findIndexR: OK
  14439. 1465.31 s [vector] +++ OK, passed 100 tests.
  14440. 1465.31 s [vector] findIndices: OK
  14441. 1465.31 s [vector] +++ OK, passed 100 tests.
  14442. 1465.31 s [vector] elemIndex: OK
  14443. 1465.32 s [vector] +++ OK, passed 100 tests.
  14444. 1465.32 s [vector] elemIndices: OK
  14445. 1465.32 s [vector] +++ OK, passed 100 tests.
  14446. 1465.32 s [vector] foldl: OK
  14447. 1465.32 s [vector] +++ OK, passed 100 tests.
  14448. 1465.33 s [vector] foldl1: OK
  14449. 1465.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14450. 1465.34 s [vector] foldl': OK
  14451. 1465.34 s [vector] +++ OK, passed 100 tests.
  14452. 1465.34 s [vector] foldl1': OK
  14453. 1465.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14454. 1465.35 s [vector] foldr: OK
  14455. 1465.35 s [vector] +++ OK, passed 100 tests.
  14456. 1465.36 s [vector] foldr1: OK
  14457. 1465.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14458. 1465.38 s [vector] foldr': OK
  14459. 1465.38 s [vector] +++ OK, passed 100 tests.
  14460. 1465.38 s [vector] foldr1': OK
  14461. 1465.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14462. 1465.40 s [vector] ifoldl: OK
  14463. 1465.40 s [vector] +++ OK, passed 100 tests.
  14464. 1465.41 s [vector] ifoldl': OK
  14465. 1465.41 s [vector] +++ OK, passed 100 tests.
  14466. 1465.41 s [vector] ifoldr: OK
  14467. 1465.41 s [vector] +++ OK, passed 100 tests.
  14468. 1465.42 s [vector] ifoldr': OK
  14469. 1465.42 s [vector] +++ OK, passed 100 tests.
  14470. 1465.42 s [vector] ifoldM: OK
  14471. 1465.42 s [vector] +++ OK, passed 100 tests.
  14472. 1465.43 s [vector] ifoldM': OK
  14473. 1465.44 s [vector] +++ OK, passed 100 tests.
  14474. 1465.49 s [vector] ifoldM_: OK (0.05s)
  14475. 1465.49 s [vector] +++ OK, passed 100 tests.
  14476. 1465.52 s [vector] ifoldM'_: OK (0.05s)
  14477. 1465.52 s [vector] +++ OK, passed 100 tests.
  14478. 1465.53 s [vector] all: OK
  14479. 1465.54 s [vector] +++ OK, passed 100 tests.
  14480. 1465.54 s [vector] any: OK
  14481. 1465.54 s [vector] +++ OK, passed 100 tests.
  14482. 1465.54 s [vector] prescanl: OK (0.01s)
  14483. 1465.54 s [vector] +++ OK, passed 100 tests.
  14484. 1465.57 s [vector] prescanl': OK (0.02s)
  14485. 1465.57 s [vector] +++ OK, passed 100 tests.
  14486. 1465.58 s [vector] postscanl: OK (0.01s)
  14487. 1465.59 s [vector] +++ OK, passed 100 tests.
  14488. 1465.59 s [vector] postscanl': OK (0.01s)
  14489. 1465.59 s [vector] +++ OK, passed 100 tests.
  14490. 1465.60 s [vector] scanl: OK (0.01s)
  14491. 1465.61 s [vector] +++ OK, passed 100 tests.
  14492. 1465.62 s [vector] scanl': OK (0.01s)
  14493. 1465.62 s [vector] +++ OK, passed 100 tests.
  14494. 1465.62 s [vector] scanl1: OK (0.02s)
  14495. 1465.63 s [vector] +++ OK, passed 100 tests.
  14496. 1465.64 s [vector] scanl1': OK (0.02s)
  14497. 1465.64 s [vector] +++ OK, passed 100 tests.
  14498. 1465.66 s [vector] iscanl: OK (0.01s)
  14499. 1465.66 s [vector] +++ OK, passed 100 tests.
  14500. 1465.68 s [vector] iscanl': OK (0.01s)
  14501. 1465.68 s [vector] +++ OK, passed 100 tests.
  14502. 1465.68 s [vector] prescanr: OK (0.01s)
  14503. 1465.68 s [vector] +++ OK, passed 100 tests.
  14504. 1465.70 s [vector] prescanr': OK (0.01s)
  14505. 1465.70 s [vector] +++ OK, passed 100 tests.
  14506. 1465.70 s [vector] postscanr: OK
  14507. 1465.71 s [vector] +++ OK, passed 100 tests.
  14508. 1465.72 s [vector] postscanr': OK (0.01s)
  14509. 1465.72 s [vector] +++ OK, passed 100 tests.
  14510. 1465.72 s [vector] scanr: OK (0.01s)
  14511. 1465.72 s [vector] +++ OK, passed 100 tests.
  14512. 1465.74 s [vector] scanr': OK (0.01s)
  14513. 1465.76 s [vector] +++ OK, passed 100 tests.
  14514. 1465.76 s [vector] scanr1: OK (0.02s)
  14515. 1465.76 s [vector] +++ OK, passed 100 tests.
  14516. 1465.78 s [vector] scanr1': OK (0.01s)
  14517. 1465.78 s [vector] +++ OK, passed 100 tests.
  14518. 1465.80 s [vector] iscanr: OK (0.01s)
  14519. 1465.80 s [vector] +++ OK, passed 100 tests.
  14520. 1465.80 s [vector] iscanr': OK (0.01s)
  14521. 1465.80 s [vector] +++ OK, passed 100 tests.
  14522. 1465.80 s [vector] mut_read: OK
  14523. 1465.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14524. 1465.80 s [vector] mut_write: OK
  14525. 1465.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14526. 1465.81 s [vector] mut_modify: OK
  14527. 1465.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14528. 1465.82 s [vector] mut_generate: OK
  14529. 1465.82 s [vector] +++ OK, passed 100 tests.
  14530. 1465.84 s [vector] mut_generateM: OK (0.03s)
  14531. 1465.84 s [vector] +++ OK, passed 100 tests.
  14532. 1465.88 s [vector] mut_mapM_: OK (0.04s)
  14533. 1465.88 s [vector] +++ OK, passed 100 tests.
  14534. 1465.92 s [vector] mut_imapM_: OK (0.03s)
  14535. 1465.92 s [vector] +++ OK, passed 100 tests.
  14536. 1465.96 s [vector] mut_forM_: OK (0.03s)
  14537. 1465.96 s [vector] +++ OK, passed 100 tests.
  14538. 1466.00 s [vector] mut_iforM_: OK (0.04s)
  14539. 1466.00 s [vector] +++ OK, passed 100 tests.
  14540. 1466.01 s [vector] mut_foldr: OK (0.01s)
  14541. 1466.01 s [vector] +++ OK, passed 100 tests.
  14542. 1466.02 s [vector] mut_foldr': OK (0.01s)
  14543. 1466.02 s [vector] +++ OK, passed 100 tests.
  14544. 1466.03 s [vector] mut_foldl: OK (0.01s)
  14545. 1466.03 s [vector] +++ OK, passed 100 tests.
  14546. 1466.05 s [vector] mut_foldl': OK (0.01s)
  14547. 1466.05 s [vector] +++ OK, passed 100 tests.
  14548. 1466.06 s [vector] mut_ifoldr: OK (0.01s)
  14549. 1466.06 s [vector] +++ OK, passed 100 tests.
  14550. 1466.06 s [vector] mut_ifoldr': OK (0.01s)
  14551. 1466.06 s [vector] +++ OK, passed 100 tests.
  14552. 1466.08 s [vector] mut_ifoldl: OK (0.01s)
  14553. 1466.08 s [vector] +++ OK, passed 100 tests.
  14554. 1466.10 s [vector] mut_ifoldl': OK
  14555. 1466.10 s [vector] +++ OK, passed 100 tests.
  14556. 1466.10 s [vector] mut_foldM: OK (0.01s)
  14557. 1466.10 s [vector] +++ OK, passed 100 tests.
  14558. 1466.11 s [vector] mut_foldM': OK
  14559. 1466.12 s [vector] +++ OK, passed 100 tests.
  14560. 1466.12 s [vector] mut_foldrM: OK (0.01s)
  14561. 1466.12 s [vector] +++ OK, passed 100 tests.
  14562. 1466.14 s [vector] mut_foldrM': OK (0.01s)
  14563. 1466.14 s [vector] +++ OK, passed 100 tests.
  14564. 1466.16 s [vector] mut_ifoldM: OK (0.02s)
  14565. 1466.16 s [vector] +++ OK, passed 100 tests.
  14566. 1466.18 s [vector] mut_ifoldM': OK (0.01s)
  14567. 1466.18 s [vector] +++ OK, passed 100 tests.
  14568. 1466.18 s [vector] mut_ifoldrM: OK (0.01s)
  14569. 1466.18 s [vector] +++ OK, passed 100 tests.
  14570. 1466.19 s [vector] mut_ifoldrM': OK (0.01s)
  14571. 1466.19 s [vector] +++ OK, passed 100 tests.
  14572. 1466.19 s [vector] compare: OK
  14573. 1466.19 s [vector] +++ OK, passed 100 tests.
  14574. 1466.20 s [vector] maximum: OK
  14575. 1466.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14576. 1466.20 s [vector] minimum: OK
  14577. 1466.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14578. 1466.20 s [vector] minIndex: OK
  14579. 1466.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14580. 1466.20 s [vector] maxIndex: OK
  14581. 1466.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14582. 1466.20 s [vector] maximumBy: OK
  14583. 1466.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14584. 1466.20 s [vector] minimumBy: OK
  14585. 1466.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14586. 1466.20 s [vector] maximumOn: OK
  14587. 1466.21 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14588. 1466.21 s [vector] minimumOn: OK
  14589. 1466.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14590. 1466.21 s [vector] maxIndexBy: OK
  14591. 1466.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14592. 1466.21 s [vector] minIndexBy: OK
  14593. 1466.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14594. 1466.21 s [vector] ListFirstMaxIndexWins: OK
  14595. 1466.21 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14596. 1466.22 s [vector] FalseListFirstMaxIndexWins: OK
  14597. 1466.22 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  14598. 1466.22 s [vector] []
  14599. 1466.22 s [vector] zip: OK
  14600. 1466.22 s [vector] +++ OK, passed 100 tests.
  14601. 1466.22 s [vector] zip3: OK
  14602. 1466.22 s [vector] +++ OK, passed 100 tests.
  14603. 1466.22 s [vector] unzip: OK
  14604. 1466.22 s [vector] +++ OK, passed 100 tests.
  14605. 1466.23 s [vector] unzip3: OK
  14606. 1466.23 s [vector] +++ OK, passed 100 tests.
  14607. 1466.23 s [vector] indexed: OK
  14608. 1466.23 s [vector] +++ OK, passed 100 tests.
  14609. 1466.23 s [vector] update: OK
  14610. 1466.23 s [vector] +++ OK, passed 100 tests.
  14611. 1466.23 s [vector] mempty: OK
  14612. 1466.23 s [vector] +++ OK, passed 100 tests.
  14613. 1466.23 s [vector] mappend: OK
  14614. 1466.24 s [vector] +++ OK, passed 100 tests.
  14615. 1466.26 s [vector] mconcat: OK (0.03s)
  14616. 1466.26 s [vector] +++ OK, passed 100 tests.
  14617. 1466.26 s [vector] glength: OK
  14618. 1466.26 s [vector] +++ OK, passed 100 tests.
  14619. 1466.26 s [vector] sum: OK
  14620. 1466.26 s [vector] +++ OK, passed 100 tests.
  14621. 1466.26 s [vector] product: OK
  14622. 1466.26 s [vector] +++ OK, passed 100 tests.
  14623. 1466.26 s [vector] enumFromN: OK
  14624. 1466.26 s [vector] +++ OK, passed 100 tests.
  14625. 1466.27 s [vector] enumFromThenN: OK
  14626. 1466.27 s [vector] +++ OK, passed 100 tests.
  14627. 1466.27 s [vector] enumFromTo: OK
  14628. 1466.27 s [vector] +++ OK, passed 100 tests.
  14629. 1466.27 s [vector] enumFromThenTo: OK
  14630. 1466.27 s [vector] +++ OK, passed 100 tests; 3 discarded.
  14631. 1466.27 s [vector] (Double)
  14632. 1466.27 s [vector] fromList.toList == id: OK
  14633. 1466.27 s [vector] +++ OK, passed 100 tests.
  14634. 1466.27 s [vector] toList.fromList == id: OK
  14635. 1466.27 s [vector] +++ OK, passed 100 tests.
  14636. 1466.27 s [vector] unstream.stream == id: OK
  14637. 1466.27 s [vector] +++ OK, passed 100 tests.
  14638. 1466.27 s [vector] stream.unstream == id: OK
  14639. 1466.27 s [vector] +++ OK, passed 100 tests.
  14640. 1466.27 s [vector] eq: OK
  14641. 1466.27 s [vector] +++ OK, passed 100 tests.
  14642. 1466.27 s [vector] length: OK
  14643. 1466.27 s [vector] +++ OK, passed 100 tests.
  14644. 1466.28 s [vector] null: OK
  14645. 1466.28 s [vector] +++ OK, passed 100 tests.
  14646. 1466.28 s [vector] index: OK
  14647. 1466.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14648. 1466.28 s [vector] safeIndex: OK
  14649. 1466.28 s [vector] +++ OK, passed 100 tests.
  14650. 1466.28 s [vector] head: OK
  14651. 1466.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14652. 1466.28 s [vector] last: OK
  14653. 1466.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14654. 1466.28 s [vector] unsafeIndex: OK
  14655. 1466.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14656. 1466.29 s [vector] unsafeHead: OK
  14657. 1466.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14658. 1466.29 s [vector] unsafeLast: OK
  14659. 1466.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14660. 1466.29 s [vector] slice: OK
  14661. 1466.29 s [vector] +++ OK, passed 100 tests.
  14662. 1466.29 s [vector] init: OK
  14663. 1466.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14664. 1466.29 s [vector] tail: OK
  14665. 1466.29 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14666. 1466.29 s [vector] take: OK
  14667. 1466.29 s [vector] +++ OK, passed 100 tests.
  14668. 1466.29 s [vector] drop: OK
  14669. 1466.29 s [vector] +++ OK, passed 100 tests.
  14670. 1466.29 s [vector] splitAt: OK
  14671. 1466.29 s [vector] +++ OK, passed 100 tests.
  14672. 1466.29 s [vector] empty: OK
  14673. 1466.29 s [vector] +++ OK, passed 100 tests.
  14674. 1466.29 s [vector] singleton: OK
  14675. 1466.29 s [vector] +++ OK, passed 100 tests.
  14676. 1466.29 s [vector] replicate: OK
  14677. 1466.29 s [vector] +++ OK, passed 100 tests.
  14678. 1466.29 s [vector] generate: OK
  14679. 1466.30 s [vector] +++ OK, passed 100 tests.
  14680. 1466.30 s [vector] iterateN: OK
  14681. 1466.30 s [vector] +++ OK, passed 100 tests.
  14682. 1466.32 s [vector] iterateNM: OK (0.02s)
  14683. 1466.32 s [vector] +++ OK, passed 100 tests.
  14684. 1466.36 s [vector] generateM: OK (0.03s)
  14685. 1466.36 s [vector] +++ OK, passed 100 tests.
  14686. 1466.36 s [vector] replicateM: OK (0.01s)
  14687. 1466.36 s [vector] +++ OK, passed 100 tests.
  14688. 1466.36 s [vector] create: OK
  14689. 1466.36 s [vector] +++ OK, passed 100 tests.
  14690. 1466.36 s [vector] createT: OK
  14691. 1466.36 s [vector] +++ OK, passed 100 tests.
  14692. 1466.36 s [vector] unfoldr: OK
  14693. 1466.36 s [vector] +++ OK, passed 100 tests.
  14694. 1466.36 s [vector] unfoldrN: OK
  14695. 1466.36 s [vector] +++ OK, passed 100 tests.
  14696. 1466.37 s [vector] unfoldrExactN: OK
  14697. 1466.37 s [vector] +++ OK, passed 100 tests.
  14698. 1466.37 s [vector] unfoldrM: OK
  14699. 1466.37 s [vector] +++ OK, passed 100 tests.
  14700. 1466.38 s [vector] unfoldrNM: OK
  14701. 1466.38 s [vector] +++ OK, passed 100 tests.
  14702. 1466.40 s [vector] unfoldrExactNM: OK (0.02s)
  14703. 1466.40 s [vector] +++ OK, passed 100 tests.
  14704. 1466.42 s [vector] constructN: OK (0.02s)
  14705. 1466.42 s [vector] +++ OK, passed 100 tests.
  14706. 1466.42 s [vector] constructrN: OK (0.01s)
  14707. 1466.42 s [vector] +++ OK, passed 100 tests.
  14708. 1466.43 s [vector] cons: OK
  14709. 1466.43 s [vector] +++ OK, passed 100 tests.
  14710. 1466.43 s [vector] snoc: OK
  14711. 1466.43 s [vector] +++ OK, passed 100 tests.
  14712. 1466.44 s [vector] append: OK
  14713. 1466.44 s [vector] +++ OK, passed 100 tests.
  14714. 1466.46 s [vector] concat: OK (0.03s)
  14715. 1466.46 s [vector] +++ OK, passed 100 tests.
  14716. 1466.46 s [vector] force: OK
  14717. 1466.48 s [vector] +++ OK, passed 100 tests.
  14718. 1466.48 s [vector] upd: OK
  14719. 1466.48 s [vector] +++ OK, passed 100 tests.
  14720. 1466.48 s [vector] accum: OK (0.02s)
  14721. 1466.48 s [vector] +++ OK, passed 100 tests.
  14722. 1466.48 s [vector] reverse: OK
  14723. 1466.48 s [vector] +++ OK, passed 100 tests.
  14724. 1466.48 s [vector] backpermute: OK
  14725. 1466.49 s [vector] +++ OK, passed 100 tests.
  14726. 1466.50 s [vector] map: OK
  14727. 1466.50 s [vector] +++ OK, passed 100 tests.
  14728. 1466.50 s [vector] imap: OK (0.01s)
  14729. 1466.50 s [vector] +++ OK, passed 100 tests.
  14730. 1466.52 s [vector] concatMap: OK
  14731. 1466.52 s [vector] +++ OK, passed 100 tests.
  14732. 1466.52 s [vector] mapM: OK
  14733. 1466.52 s [vector] +++ OK, passed 100 tests.
  14734. 1466.56 s [vector] mapM_: OK (0.04s)
  14735. 1466.56 s [vector] +++ OK, passed 100 tests.
  14736. 1466.56 s [vector] forM: OK
  14737. 1466.56 s [vector] +++ OK, passed 100 tests.
  14738. 1466.62 s [vector] forM_: OK (0.04s)
  14739. 1466.62 s [vector] +++ OK, passed 100 tests.
  14740. 1466.62 s [vector] imapM: OK (0.01s)
  14741. 1466.62 s [vector] +++ OK, passed 100 tests.
  14742. 1466.66 s [vector] imapM_: OK (0.04s)
  14743. 1466.66 s [vector] +++ OK, passed 100 tests.
  14744. 1466.68 s [vector] zipWith: OK
  14745. 1466.68 s [vector] +++ OK, passed 100 tests.
  14746. 1466.68 s [vector] zipWith3: OK (0.01s)
  14747. 1466.68 s [vector] +++ OK, passed 100 tests.
  14748. 1466.69 s [vector] izipWith: OK
  14749. 1466.69 s [vector] +++ OK, passed 100 tests.
  14750. 1466.70 s [vector] izipWith3: OK (0.01s)
  14751. 1466.70 s [vector] +++ OK, passed 100 tests.
  14752. 1466.71 s [vector] izipWithM: OK
  14753. 1466.72 s [vector] +++ OK, passed 100 tests.
  14754. 1466.74 s [vector] izipWithM_: OK (0.03s)
  14755. 1466.74 s [vector] +++ OK, passed 100 tests.
  14756. 1466.76 s [vector] zipWithM: OK
  14757. 1466.76 s [vector] +++ OK, passed 100 tests.
  14758. 1466.78 s [vector] zipWithM_: OK (0.03s)
  14759. 1466.78 s [vector] +++ OK, passed 100 tests.
  14760. 1466.78 s [vector] filter: OK
  14761. 1466.78 s [vector] +++ OK, passed 100 tests.
  14762. 1466.79 s [vector] ifilter: OK
  14763. 1466.79 s [vector] +++ OK, passed 100 tests.
  14764. 1466.83 s [vector] filterM: OK (0.04s)
  14765. 1466.83 s [vector] +++ OK, passed 100 tests.
  14766. 1466.84 s [vector] uniq: OK
  14767. 1466.84 s [vector] +++ OK, passed 100 tests.
  14768. 1466.84 s [vector] mapMaybe: OK
  14769. 1466.84 s [vector] +++ OK, passed 100 tests.
  14770. 1466.85 s [vector] imapMaybe: OK
  14771. 1466.85 s [vector] +++ OK, passed 100 tests.
  14772. 1466.85 s [vector] takeWhile: OK
  14773. 1466.85 s [vector] +++ OK, passed 100 tests.
  14774. 1466.86 s [vector] dropWhile: OK
  14775. 1466.86 s [vector] +++ OK, passed 100 tests.
  14776. 1466.86 s [vector] partition: OK
  14777. 1466.86 s [vector] +++ OK, passed 100 tests.
  14778. 1466.87 s [vector] partitionWith: OK
  14779. 1466.87 s [vector] +++ OK, passed 100 tests.
  14780. 1466.87 s [vector] span: OK
  14781. 1466.87 s [vector] +++ OK, passed 100 tests.
  14782. 1466.87 s [vector] break: OK
  14783. 1466.87 s [vector] +++ OK, passed 100 tests.
  14784. 1466.87 s [vector] spanR: OK
  14785. 1466.87 s [vector] +++ OK, passed 100 tests.
  14786. 1466.88 s [vector] breakR: OK
  14787. 1466.88 s [vector] +++ OK, passed 100 tests.
  14788. 1466.88 s [vector] groupBy: OK
  14789. 1466.88 s [vector] +++ OK, passed 100 tests.
  14790. 1466.88 s [vector] elem: OK
  14791. 1466.88 s [vector] +++ OK, passed 100 tests.
  14792. 1466.88 s [vector] notElem: OK
  14793. 1466.88 s [vector] +++ OK, passed 100 tests.
  14794. 1466.88 s [vector] find: OK
  14795. 1466.88 s [vector] +++ OK, passed 100 tests.
  14796. 1466.88 s [vector] findIndex: OK
  14797. 1466.88 s [vector] +++ OK, passed 100 tests.
  14798. 1466.89 s [vector] findIndexR: OK
  14799. 1466.89 s [vector] +++ OK, passed 100 tests.
  14800. 1466.89 s [vector] findIndices: OK
  14801. 1466.89 s [vector] +++ OK, passed 100 tests.
  14802. 1466.89 s [vector] elemIndex: OK
  14803. 1466.89 s [vector] +++ OK, passed 100 tests.
  14804. 1466.90 s [vector] elemIndices: OK
  14805. 1466.90 s [vector] +++ OK, passed 100 tests.
  14806. 1466.92 s [vector] foldl: OK (0.01s)
  14807. 1466.92 s [vector] +++ OK, passed 100 tests.
  14808. 1466.93 s [vector] foldl1: OK (0.01s)
  14809. 1466.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14810. 1466.94 s [vector] foldl': OK (0.01s)
  14811. 1466.94 s [vector] +++ OK, passed 100 tests.
  14812. 1466.95 s [vector] foldl1': OK (0.01s)
  14813. 1466.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14814. 1466.95 s [vector] foldr: OK (0.01s)
  14815. 1466.95 s [vector] +++ OK, passed 100 tests.
  14816. 1466.97 s [vector] foldr1: OK
  14817. 1466.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14818. 1466.98 s [vector] foldr': OK (0.01s)
  14819. 1466.99 s [vector] +++ OK, passed 100 tests.
  14820. 1466.99 s [vector] foldr1': OK (0.01s)
  14821. 1466.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14822. 1467.02 s [vector] ifoldl: OK
  14823. 1467.02 s [vector] +++ OK, passed 100 tests.
  14824. 1467.03 s [vector] ifoldl': OK (0.01s)
  14825. 1467.03 s [vector] +++ OK, passed 100 tests.
  14826. 1467.04 s [vector] ifoldr: OK (0.01s)
  14827. 1467.04 s [vector] +++ OK, passed 100 tests.
  14828. 1467.04 s [vector] ifoldr': OK (0.01s)
  14829. 1467.04 s [vector] +++ OK, passed 100 tests.
  14830. 1467.06 s [vector] ifoldM: OK (0.01s)
  14831. 1467.06 s [vector] +++ OK, passed 100 tests.
  14832. 1467.08 s [vector] ifoldM': OK (0.01s)
  14833. 1467.08 s [vector] +++ OK, passed 100 tests.
  14834. 1467.12 s [vector] ifoldM_: OK (0.04s)
  14835. 1467.12 s [vector] +++ OK, passed 100 tests.
  14836. 1467.15 s [vector] ifoldM'_: OK (0.03s)
  14837. 1467.15 s [vector] +++ OK, passed 100 tests.
  14838. 1467.15 s [vector] all: OK
  14839. 1467.15 s [vector] +++ OK, passed 100 tests.
  14840. 1467.16 s [vector] any: OK
  14841. 1467.16 s [vector] +++ OK, passed 100 tests.
  14842. 1467.17 s [vector] prescanl: OK (0.01s)
  14843. 1467.17 s [vector] +++ OK, passed 100 tests.
  14844. 1467.18 s [vector] prescanl': OK (0.01s)
  14845. 1467.19 s [vector] +++ OK, passed 100 tests.
  14846. 1467.20 s [vector] postscanl: OK (0.02s)
  14847. 1467.20 s [vector] +++ OK, passed 100 tests.
  14848. 1467.20 s [vector] postscanl': OK (0.01s)
  14849. 1467.20 s [vector] +++ OK, passed 100 tests.
  14850. 1467.22 s [vector] scanl: OK (0.01s)
  14851. 1467.22 s [vector] +++ OK, passed 100 tests.
  14852. 1467.24 s [vector] scanl': OK (0.01s)
  14853. 1467.24 s [vector] +++ OK, passed 100 tests.
  14854. 1467.25 s [vector] scanl1: OK (0.01s)
  14855. 1467.25 s [vector] +++ OK, passed 100 tests.
  14856. 1467.26 s [vector] scanl1': OK (0.01s)
  14857. 1467.26 s [vector] +++ OK, passed 100 tests.
  14858. 1467.26 s [vector] iscanl: OK (0.01s)
  14859. 1467.26 s [vector] +++ OK, passed 100 tests.
  14860. 1467.28 s [vector] iscanl': OK (0.01s)
  14861. 1467.28 s [vector] +++ OK, passed 100 tests.
  14862. 1467.30 s [vector] prescanr: OK (0.01s)
  14863. 1467.30 s [vector] +++ OK, passed 100 tests.
  14864. 1467.31 s [vector] prescanr': OK (0.01s)
  14865. 1467.31 s [vector] +++ OK, passed 100 tests.
  14866. 1467.32 s [vector] postscanr: OK (0.01s)
  14867. 1467.32 s [vector] +++ OK, passed 100 tests.
  14868. 1467.34 s [vector] postscanr': OK (0.01s)
  14869. 1467.34 s [vector] +++ OK, passed 100 tests.
  14870. 1467.34 s [vector] scanr: OK (0.01s)
  14871. 1467.34 s [vector] +++ OK, passed 100 tests.
  14872. 1467.36 s [vector] scanr': OK (0.01s)
  14873. 1467.37 s [vector] +++ OK, passed 100 tests.
  14874. 1467.38 s [vector] scanr1: OK (0.01s)
  14875. 1467.38 s [vector] +++ OK, passed 100 tests.
  14876. 1467.39 s [vector] scanr1': OK (0.01s)
  14877. 1467.39 s [vector] +++ OK, passed 100 tests.
  14878. 1467.40 s [vector] iscanr: OK (0.01s)
  14879. 1467.40 s [vector] +++ OK, passed 100 tests.
  14880. 1467.41 s [vector] iscanr': OK (0.01s)
  14881. 1467.41 s [vector] +++ OK, passed 100 tests.
  14882. 1467.41 s [vector] mut_read: OK
  14883. 1467.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14884. 1467.42 s [vector] mut_write: OK
  14885. 1467.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14886. 1467.43 s [vector] mut_modify: OK
  14887. 1467.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14888. 1467.44 s [vector] mut_generate: OK
  14889. 1467.44 s [vector] +++ OK, passed 100 tests.
  14890. 1467.44 s [vector] mut_generateM: OK (0.01s)
  14891. 1467.44 s [vector] +++ OK, passed 100 tests.
  14892. 1467.46 s [vector] mut_mapM_: OK (0.03s)
  14893. 1467.46 s [vector] +++ OK, passed 100 tests.
  14894. 1467.50 s [vector] mut_imapM_: OK (0.03s)
  14895. 1467.50 s [vector] +++ OK, passed 100 tests.
  14896. 1467.52 s [vector] mut_forM_: OK (0.04s)
  14897. 1467.52 s [vector] +++ OK, passed 100 tests.
  14898. 1467.56 s [vector] mut_iforM_: OK (0.03s)
  14899. 1467.57 s [vector] +++ OK, passed 100 tests.
  14900. 1467.58 s [vector] mut_foldr: OK (0.01s)
  14901. 1467.58 s [vector] +++ OK, passed 100 tests.
  14902. 1467.58 s [vector] mut_foldr': OK (0.01s)
  14903. 1467.59 s [vector] +++ OK, passed 100 tests.
  14904. 1467.60 s [vector] mut_foldl: OK (0.02s)
  14905. 1467.60 s [vector] +++ OK, passed 100 tests.
  14906. 1467.62 s [vector] mut_foldl': OK (0.02s)
  14907. 1467.62 s [vector] +++ OK, passed 100 tests.
  14908. 1467.64 s [vector] mut_ifoldr: OK (0.02s)
  14909. 1467.65 s [vector] +++ OK, passed 100 tests.
  14910. 1467.66 s [vector] mut_ifoldr': OK (0.02s)
  14911. 1467.66 s [vector] +++ OK, passed 100 tests.
  14912. 1467.68 s [vector] mut_ifoldl: OK (0.01s)
  14913. 1467.68 s [vector] +++ OK, passed 100 tests.
  14914. 1467.69 s [vector] mut_ifoldl': OK (0.01s)
  14915. 1467.69 s [vector] +++ OK, passed 100 tests.
  14916. 1467.71 s [vector] mut_foldM: OK
  14917. 1467.71 s [vector] +++ OK, passed 100 tests.
  14918. 1467.72 s [vector] mut_foldM': OK (0.01s)
  14919. 1467.73 s [vector] +++ OK, passed 100 tests.
  14920. 1467.74 s [vector] mut_foldrM: OK (0.01s)
  14921. 1467.74 s [vector] +++ OK, passed 100 tests.
  14922. 1467.74 s [vector] mut_foldrM': OK (0.01s)
  14923. 1467.74 s [vector] +++ OK, passed 100 tests.
  14924. 1467.76 s [vector] mut_ifoldM: OK (0.01s)
  14925. 1467.76 s [vector] +++ OK, passed 100 tests.
  14926. 1467.78 s [vector] mut_ifoldM': OK (0.01s)
  14927. 1467.78 s [vector] +++ OK, passed 100 tests.
  14928. 1467.78 s [vector] mut_ifoldrM: OK (0.01s)
  14929. 1467.79 s [vector] +++ OK, passed 100 tests.
  14930. 1467.80 s [vector] mut_ifoldrM': OK (0.02s)
  14931. 1467.80 s [vector] +++ OK, passed 100 tests.
  14932. 1467.80 s [vector] compare: OK
  14933. 1467.80 s [vector] +++ OK, passed 100 tests.
  14934. 1467.80 s [vector] maximum: OK
  14935. 1467.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14936. 1467.80 s [vector] minimum: OK
  14937. 1467.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14938. 1467.80 s [vector] minIndex: OK
  14939. 1467.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14940. 1467.80 s [vector] maxIndex: OK
  14941. 1467.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14942. 1467.80 s [vector] maximumBy: OK
  14943. 1467.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14944. 1467.80 s [vector] minimumBy: OK
  14945. 1467.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14946. 1467.80 s [vector] maximumOn: OK
  14947. 1467.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14948. 1467.81 s [vector] minimumOn: OK
  14949. 1467.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14950. 1467.81 s [vector] maxIndexBy: OK
  14951. 1467.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14952. 1467.81 s [vector] minIndexBy: OK
  14953. 1467.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14954. 1467.81 s [vector] ListFirstMaxIndexWins: OK
  14955. 1467.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14956. 1467.81 s [vector] FalseListFirstMaxIndexWins: OK
  14957. 1467.81 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  14958. 1467.81 s [vector] []
  14959. 1467.81 s [vector] zip: OK
  14960. 1467.81 s [vector] +++ OK, passed 100 tests.
  14961. 1467.81 s [vector] zip3: OK
  14962. 1467.82 s [vector] +++ OK, passed 100 tests.
  14963. 1467.82 s [vector] unzip: OK
  14964. 1467.82 s [vector] +++ OK, passed 100 tests.
  14965. 1467.82 s [vector] unzip3: OK
  14966. 1467.82 s [vector] +++ OK, passed 100 tests.
  14967. 1467.82 s [vector] indexed: OK
  14968. 1467.82 s [vector] +++ OK, passed 100 tests.
  14969. 1467.82 s [vector] update: OK
  14970. 1467.82 s [vector] +++ OK, passed 100 tests.
  14971. 1467.82 s [vector] mempty: OK
  14972. 1467.83 s [vector] +++ OK, passed 100 tests.
  14973. 1467.83 s [vector] mappend: OK
  14974. 1467.83 s [vector] +++ OK, passed 100 tests.
  14975. 1467.85 s [vector] mconcat: OK (0.02s)
  14976. 1467.85 s [vector] +++ OK, passed 100 tests.
  14977. 1467.85 s [vector] glength: OK
  14978. 1467.85 s [vector] +++ OK, passed 100 tests.
  14979. 1467.85 s [vector] sum: OK
  14980. 1467.85 s [vector] +++ OK, passed 100 tests.
  14981. 1467.85 s [vector] product: OK
  14982. 1467.85 s [vector] +++ OK, passed 100 tests.
  14983. 1467.85 s [vector] enumFromN: OK
  14984. 1467.85 s [vector] +++ OK, passed 100 tests.
  14985. 1467.85 s [vector] enumFromThenN: OK
  14986. 1467.85 s [vector] +++ OK, passed 100 tests.
  14987. 1467.85 s [vector] enumFromTo: OK
  14988. 1467.85 s [vector] +++ OK, passed 100 tests.
  14989. 1467.85 s [vector] enumFromThenTo: OK
  14990. 1467.85 s [vector] +++ OK, passed 100 tests; 5 discarded.
  14991. 1467.85 s [vector] (Int,Bool)
  14992. 1467.85 s [vector] fromList.toList == id: OK
  14993. 1467.85 s [vector] +++ OK, passed 100 tests.
  14994. 1467.85 s [vector] toList.fromList == id: OK
  14995. 1467.85 s [vector] +++ OK, passed 100 tests.
  14996. 1467.85 s [vector] unstream.stream == id: OK
  14997. 1467.85 s [vector] +++ OK, passed 100 tests.
  14998. 1467.86 s [vector] stream.unstream == id: OK
  14999. 1467.86 s [vector] +++ OK, passed 100 tests.
  15000. 1467.86 s [vector] eq: OK
  15001. 1467.86 s [vector] +++ OK, passed 100 tests.
  15002. 1467.86 s [vector] length: OK
  15003. 1467.86 s [vector] +++ OK, passed 100 tests.
  15004. 1467.86 s [vector] null: OK
  15005. 1467.86 s [vector] +++ OK, passed 100 tests.
  15006. 1467.86 s [vector] index: OK
  15007. 1467.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15008. 1467.86 s [vector] safeIndex: OK
  15009. 1467.86 s [vector] +++ OK, passed 100 tests.
  15010. 1467.86 s [vector] head: OK
  15011. 1467.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15012. 1467.86 s [vector] last: OK
  15013. 1467.86 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15014. 1467.86 s [vector] unsafeIndex: OK
  15015. 1467.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15016. 1467.86 s [vector] unsafeHead: OK
  15017. 1467.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15018. 1467.87 s [vector] unsafeLast: OK
  15019. 1467.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15020. 1467.87 s [vector] slice: OK
  15021. 1467.87 s [vector] +++ OK, passed 100 tests.
  15022. 1467.87 s [vector] init: OK
  15023. 1467.87 s [vector] +++ OK, passed 100 tests; 25 discarded.
  15024. 1467.87 s [vector] tail: OK
  15025. 1467.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15026. 1467.87 s [vector] take: OK
  15027. 1467.87 s [vector] +++ OK, passed 100 tests.
  15028. 1467.87 s [vector] drop: OK
  15029. 1467.87 s [vector] +++ OK, passed 100 tests.
  15030. 1467.87 s [vector] splitAt: OK
  15031. 1467.87 s [vector] +++ OK, passed 100 tests.
  15032. 1467.87 s [vector] empty: OK
  15033. 1467.87 s [vector] +++ OK, passed 100 tests.
  15034. 1467.87 s [vector] singleton: OK
  15035. 1467.87 s [vector] +++ OK, passed 100 tests.
  15036. 1467.88 s [vector] replicate: OK
  15037. 1467.88 s [vector] +++ OK, passed 100 tests.
  15038. 1467.88 s [vector] generate: OK
  15039. 1467.88 s [vector] +++ OK, passed 100 tests.
  15040. 1467.89 s [vector] iterateN: OK
  15041. 1467.89 s [vector] +++ OK, passed 100 tests.
  15042. 1467.90 s [vector] iterateNM: OK (0.02s)
  15043. 1467.90 s [vector] +++ OK, passed 100 tests.
  15044. 1467.94 s [vector] generateM: OK (0.04s)
  15045. 1467.94 s [vector] +++ OK, passed 100 tests.
  15046. 1467.95 s [vector] replicateM: OK (0.02s)
  15047. 1467.95 s [vector] +++ OK, passed 100 tests.
  15048. 1467.96 s [vector] create: OK
  15049. 1467.96 s [vector] +++ OK, passed 100 tests.
  15050. 1467.96 s [vector] createT: OK
  15051. 1467.96 s [vector] +++ OK, passed 100 tests.
  15052. 1467.96 s [vector] unfoldr: OK
  15053. 1467.96 s [vector] +++ OK, passed 100 tests.
  15054. 1467.96 s [vector] unfoldrN: OK
  15055. 1467.96 s [vector] +++ OK, passed 100 tests.
  15056. 1467.96 s [vector] unfoldrExactN: OK
  15057. 1467.96 s [vector] +++ OK, passed 100 tests.
  15058. 1467.96 s [vector] unfoldrM: OK
  15059. 1467.96 s [vector] +++ OK, passed 100 tests.
  15060. 1467.98 s [vector] unfoldrNM: OK
  15061. 1467.98 s [vector] +++ OK, passed 100 tests.
  15062. 1467.99 s [vector] unfoldrExactNM: OK (0.02s)
  15063. 1467.99 s [vector] +++ OK, passed 100 tests.
  15064. 1467.99 s [vector] constructN: OK
  15065. 1467.99 s [vector] +++ OK, passed 100 tests.
  15066. 1467.99 s [vector] constructrN: OK
  15067. 1467.99 s [vector] +++ OK, passed 100 tests.
  15068. 1468.00 s [vector] cons: OK
  15069. 1468.00 s [vector] +++ OK, passed 100 tests.
  15070. 1468.00 s [vector] snoc: OK
  15071. 1468.00 s [vector] +++ OK, passed 100 tests.
  15072. 1468.00 s [vector] append: OK
  15073. 1468.00 s [vector] +++ OK, passed 100 tests.
  15074. 1468.04 s [vector] concat: OK (0.04s)
  15075. 1468.04 s [vector] +++ OK, passed 100 tests.
  15076. 1468.04 s [vector] force: OK
  15077. 1468.04 s [vector] +++ OK, passed 100 tests.
  15078. 1468.04 s [vector] upd: OK
  15079. 1468.04 s [vector] +++ OK, passed 100 tests.
  15080. 1468.05 s [vector] accum: OK
  15081. 1468.05 s [vector] +++ OK, passed 100 tests.
  15082. 1468.05 s [vector] reverse: OK
  15083. 1468.05 s [vector] +++ OK, passed 100 tests.
  15084. 1468.06 s [vector] backpermute: OK
  15085. 1468.06 s [vector] +++ OK, passed 100 tests.
  15086. 1468.06 s [vector] map: OK
  15087. 1468.06 s [vector] +++ OK, passed 100 tests.
  15088. 1468.06 s [vector] imap: OK
  15089. 1468.06 s [vector] +++ OK, passed 100 tests.
  15090. 1468.07 s [vector] concatMap: OK
  15091. 1468.07 s [vector] +++ OK, passed 100 tests.
  15092. 1468.07 s [vector] mapM: OK
  15093. 1468.07 s [vector] +++ OK, passed 100 tests.
  15094. 1468.10 s [vector] mapM_: OK (0.03s)
  15095. 1468.10 s [vector] +++ OK, passed 100 tests.
  15096. 1468.10 s [vector] forM: OK
  15097. 1468.11 s [vector] +++ OK, passed 100 tests.
  15098. 1468.14 s [vector] forM_: OK (0.03s)
  15099. 1468.14 s [vector] +++ OK, passed 100 tests.
  15100. 1468.14 s [vector] imapM: OK
  15101. 1468.14 s [vector] +++ OK, passed 100 tests.
  15102. 1468.18 s [vector] imapM_: OK (0.03s)
  15103. 1468.18 s [vector] +++ OK, passed 100 tests.
  15104. 1468.18 s [vector] zipWith: OK
  15105. 1468.18 s [vector] +++ OK, passed 100 tests.
  15106. 1468.19 s [vector] zipWith3: OK
  15107. 1468.19 s [vector] +++ OK, passed 100 tests.
  15108. 1468.19 s [vector] izipWith: OK
  15109. 1468.19 s [vector] +++ OK, passed 100 tests.
  15110. 1468.20 s [vector] izipWith3: OK
  15111. 1468.20 s [vector] +++ OK, passed 100 tests.
  15112. 1468.20 s [vector] izipWithM: OK
  15113. 1468.20 s [vector] +++ OK, passed 100 tests.
  15114. 1468.23 s [vector] izipWithM_: OK (0.02s)
  15115. 1468.23 s [vector] +++ OK, passed 100 tests.
  15116. 1468.24 s [vector] zipWithM: OK
  15117. 1468.24 s [vector] +++ OK, passed 100 tests.
  15118. 1468.25 s [vector] zipWithM_: OK (0.02s)
  15119. 1468.26 s [vector] +++ OK, passed 100 tests.
  15120. 1468.26 s [vector] filter: OK
  15121. 1468.26 s [vector] +++ OK, passed 100 tests.
  15122. 1468.26 s [vector] ifilter: OK
  15123. 1468.26 s [vector] +++ OK, passed 100 tests.
  15124. 1468.31 s [vector] filterM: OK (0.05s)
  15125. 1468.31 s [vector] +++ OK, passed 100 tests.
  15126. 1468.31 s [vector] uniq: OK
  15127. 1468.31 s [vector] +++ OK, passed 100 tests.
  15128. 1468.31 s [vector] mapMaybe: OK
  15129. 1468.31 s [vector] +++ OK, passed 100 tests.
  15130. 1468.32 s [vector] imapMaybe: OK
  15131. 1468.32 s [vector] +++ OK, passed 100 tests.
  15132. 1468.32 s [vector] takeWhile: OK
  15133. 1468.32 s [vector] +++ OK, passed 100 tests.
  15134. 1468.32 s [vector] dropWhile: OK
  15135. 1468.32 s [vector] +++ OK, passed 100 tests.
  15136. 1468.32 s [vector] partition: OK
  15137. 1468.32 s [vector] +++ OK, passed 100 tests.
  15138. 1468.33 s [vector] partitionWith: OK
  15139. 1468.33 s [vector] +++ OK, passed 100 tests.
  15140. 1468.33 s [vector] span: OK
  15141. 1468.33 s [vector] +++ OK, passed 100 tests.
  15142. 1468.33 s [vector] break: OK
  15143. 1468.33 s [vector] +++ OK, passed 100 tests.
  15144. 1468.34 s [vector] spanR: OK
  15145. 1468.34 s [vector] +++ OK, passed 100 tests.
  15146. 1468.34 s [vector] breakR: OK
  15147. 1468.34 s [vector] +++ OK, passed 100 tests.
  15148. 1468.34 s [vector] groupBy: OK
  15149. 1468.34 s [vector] +++ OK, passed 100 tests.
  15150. 1468.34 s [vector] elem: OK
  15151. 1468.34 s [vector] +++ OK, passed 100 tests.
  15152. 1468.34 s [vector] notElem: OK
  15153. 1468.34 s [vector] +++ OK, passed 100 tests.
  15154. 1468.34 s [vector] find: OK
  15155. 1468.34 s [vector] +++ OK, passed 100 tests.
  15156. 1468.34 s [vector] findIndex: OK
  15157. 1468.34 s [vector] +++ OK, passed 100 tests.
  15158. 1468.34 s [vector] findIndexR: OK
  15159. 1468.35 s [vector] +++ OK, passed 100 tests.
  15160. 1468.35 s [vector] findIndices: OK
  15161. 1468.35 s [vector] +++ OK, passed 100 tests.
  15162. 1468.35 s [vector] elemIndex: OK
  15163. 1468.35 s [vector] +++ OK, passed 100 tests.
  15164. 1468.35 s [vector] elemIndices: OK
  15165. 1468.35 s [vector] +++ OK, passed 100 tests.
  15166. 1468.35 s [vector] foldl: OK
  15167. 1468.36 s [vector] +++ OK, passed 100 tests.
  15168. 1468.36 s [vector] foldl1: OK
  15169. 1468.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15170. 1468.36 s [vector] foldl': OK
  15171. 1468.36 s [vector] +++ OK, passed 100 tests.
  15172. 1468.36 s [vector] foldl1': OK
  15173. 1468.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15174. 1468.37 s [vector] foldr: OK
  15175. 1468.37 s [vector] +++ OK, passed 100 tests.
  15176. 1468.37 s [vector] foldr1: OK
  15177. 1468.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15178. 1468.37 s [vector] foldr': OK
  15179. 1468.37 s [vector] +++ OK, passed 100 tests.
  15180. 1468.37 s [vector] foldr1': OK
  15181. 1468.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15182. 1468.38 s [vector] ifoldl: OK
  15183. 1468.38 s [vector] +++ OK, passed 100 tests.
  15184. 1468.38 s [vector] ifoldl': OK
  15185. 1468.38 s [vector] +++ OK, passed 100 tests.
  15186. 1468.39 s [vector] ifoldr: OK
  15187. 1468.39 s [vector] +++ OK, passed 100 tests.
  15188. 1468.40 s [vector] ifoldr': OK
  15189. 1468.40 s [vector] +++ OK, passed 100 tests.
  15190. 1468.40 s [vector] ifoldM: OK
  15191. 1468.40 s [vector] +++ OK, passed 100 tests.
  15192. 1468.40 s [vector] ifoldM': OK
  15193. 1468.40 s [vector] +++ OK, passed 100 tests.
  15194. 1468.44 s [vector] ifoldM_: OK (0.04s)
  15195. 1468.44 s [vector] +++ OK, passed 100 tests.
  15196. 1468.46 s [vector] ifoldM'_: OK (0.02s)
  15197. 1468.46 s [vector] +++ OK, passed 100 tests.
  15198. 1468.47 s [vector] all: OK
  15199. 1468.47 s [vector] +++ OK, passed 100 tests.
  15200. 1468.48 s [vector] any: OK
  15201. 1468.48 s [vector] +++ OK, passed 100 tests.
  15202. 1468.48 s [vector] prescanl: OK
  15203. 1468.48 s [vector] +++ OK, passed 100 tests.
  15204. 1468.48 s [vector] prescanl': OK
  15205. 1468.48 s [vector] +++ OK, passed 100 tests.
  15206. 1468.49 s [vector] postscanl: OK
  15207. 1468.49 s [vector] +++ OK, passed 100 tests.
  15208. 1468.49 s [vector] postscanl': OK
  15209. 1468.50 s [vector] +++ OK, passed 100 tests.
  15210. 1468.50 s [vector] scanl: OK
  15211. 1468.51 s [vector] +++ OK, passed 100 tests.
  15212. 1468.51 s [vector] scanl': OK
  15213. 1468.51 s [vector] +++ OK, passed 100 tests.
  15214. 1468.51 s [vector] scanl1: OK
  15215. 1468.51 s [vector] +++ OK, passed 100 tests.
  15216. 1468.51 s [vector] scanl1': OK
  15217. 1468.51 s [vector] +++ OK, passed 100 tests.
  15218. 1468.52 s [vector] iscanl: OK (0.01s)
  15219. 1468.52 s [vector] +++ OK, passed 100 tests.
  15220. 1468.52 s [vector] iscanl': OK
  15221. 1468.52 s [vector] +++ OK, passed 100 tests.
  15222. 1468.53 s [vector] prescanr: OK
  15223. 1468.54 s [vector] +++ OK, passed 100 tests.
  15224. 1468.54 s [vector] prescanr': OK
  15225. 1468.54 s [vector] +++ OK, passed 100 tests.
  15226. 1468.54 s [vector] postscanr: OK
  15227. 1468.54 s [vector] +++ OK, passed 100 tests.
  15228. 1468.55 s [vector] postscanr': OK
  15229. 1468.55 s [vector] +++ OK, passed 100 tests.
  15230. 1468.55 s [vector] scanr: OK
  15231. 1468.55 s [vector] +++ OK, passed 100 tests.
  15232. 1468.56 s [vector] scanr': OK
  15233. 1468.56 s [vector] +++ OK, passed 100 tests.
  15234. 1468.56 s [vector] scanr1: OK
  15235. 1468.56 s [vector] +++ OK, passed 100 tests.
  15236. 1468.56 s [vector] scanr1': OK
  15237. 1468.56 s [vector] +++ OK, passed 100 tests.
  15238. 1468.57 s [vector] iscanr: OK
  15239. 1468.57 s [vector] +++ OK, passed 100 tests.
  15240. 1468.58 s [vector] iscanr': OK
  15241. 1468.58 s [vector] +++ OK, passed 100 tests.
  15242. 1468.58 s [vector] mut_read: OK
  15243. 1468.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15244. 1468.58 s [vector] mut_write: OK
  15245. 1468.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15246. 1468.58 s [vector] mut_modify: OK
  15247. 1468.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15248. 1468.58 s [vector] mut_generate: OK
  15249. 1468.58 s [vector] +++ OK, passed 100 tests.
  15250. 1468.60 s [vector] mut_generateM: OK (0.01s)
  15251. 1468.60 s [vector] +++ OK, passed 100 tests.
  15252. 1468.63 s [vector] mut_mapM_: OK (0.03s)
  15253. 1468.63 s [vector] +++ OK, passed 100 tests.
  15254. 1468.66 s [vector] mut_imapM_: OK (0.01s)
  15255. 1468.66 s [vector] +++ OK, passed 100 tests.
  15256. 1468.68 s [vector] mut_forM_: OK (0.03s)
  15257. 1468.68 s [vector] +++ OK, passed 100 tests.
  15258. 1468.72 s [vector] mut_iforM_: OK (0.03s)
  15259. 1468.72 s [vector] +++ OK, passed 100 tests.
  15260. 1468.72 s [vector] mut_foldr: OK
  15261. 1468.72 s [vector] +++ OK, passed 100 tests.
  15262. 1468.72 s [vector] mut_foldr': OK
  15263. 1468.72 s [vector] +++ OK, passed 100 tests.
  15264. 1468.72 s [vector] mut_foldl: OK
  15265. 1468.73 s [vector] +++ OK, passed 100 tests.
  15266. 1468.73 s [vector] mut_foldl': OK
  15267. 1468.73 s [vector] +++ OK, passed 100 tests.
  15268. 1468.74 s [vector] mut_ifoldr: OK
  15269. 1468.74 s [vector] +++ OK, passed 100 tests.
  15270. 1468.74 s [vector] mut_ifoldr': OK
  15271. 1468.74 s [vector] +++ OK, passed 100 tests.
  15272. 1468.74 s [vector] mut_ifoldl: OK
  15273. 1468.74 s [vector] +++ OK, passed 100 tests.
  15274. 1468.75 s [vector] mut_ifoldl': OK
  15275. 1468.75 s [vector] +++ OK, passed 100 tests.
  15276. 1468.76 s [vector] mut_foldM: OK
  15277. 1468.76 s [vector] +++ OK, passed 100 tests.
  15278. 1468.77 s [vector] mut_foldM': OK
  15279. 1468.77 s [vector] +++ OK, passed 100 tests.
  15280. 1468.77 s [vector] mut_foldrM: OK
  15281. 1468.77 s [vector] +++ OK, passed 100 tests.
  15282. 1468.77 s [vector] mut_foldrM': OK
  15283. 1468.77 s [vector] +++ OK, passed 100 tests.
  15284. 1468.77 s [vector] mut_ifoldM: OK
  15285. 1468.77 s [vector] +++ OK, passed 100 tests.
  15286. 1468.78 s [vector] mut_ifoldM': OK
  15287. 1468.78 s [vector] +++ OK, passed 100 tests.
  15288. 1468.78 s [vector] mut_ifoldrM: OK
  15289. 1468.78 s [vector] +++ OK, passed 100 tests.
  15290. 1468.78 s [vector] mut_ifoldrM': OK
  15291. 1468.78 s [vector] +++ OK, passed 100 tests.
  15292. 1468.78 s [vector] compare: OK
  15293. 1468.78 s [vector] +++ OK, passed 100 tests.
  15294. 1468.78 s [vector] maximum: OK
  15295. 1468.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15296. 1468.79 s [vector] minimum: OK
  15297. 1468.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15298. 1468.79 s [vector] minIndex: OK
  15299. 1468.79 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15300. 1468.79 s [vector] maxIndex: OK
  15301. 1468.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15302. 1468.79 s [vector] maximumBy: OK
  15303. 1468.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15304. 1468.79 s [vector] minimumBy: OK
  15305. 1468.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15306. 1468.79 s [vector] maximumOn: OK
  15307. 1468.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15308. 1468.79 s [vector] minimumOn: OK
  15309. 1468.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15310. 1468.79 s [vector] maxIndexBy: OK
  15311. 1468.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15312. 1468.79 s [vector] minIndexBy: OK
  15313. 1468.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15314. 1468.79 s [vector] ListFirstMaxIndexWins: OK
  15315. 1468.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15316. 1468.80 s [vector] FalseListFirstMaxIndexWins: OK
  15317. 1468.80 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  15318. 1468.80 s [vector] []
  15319. 1468.80 s [vector] zip: OK
  15320. 1468.80 s [vector] +++ OK, passed 100 tests.
  15321. 1468.80 s [vector] zip3: OK
  15322. 1468.81 s [vector] +++ OK, passed 100 tests.
  15323. 1468.81 s [vector] unzip: OK
  15324. 1468.81 s [vector] +++ OK, passed 100 tests.
  15325. 1468.81 s [vector] unzip3: OK
  15326. 1468.81 s [vector] +++ OK, passed 100 tests.
  15327. 1468.81 s [vector] indexed: OK
  15328. 1468.81 s [vector] +++ OK, passed 100 tests.
  15329. 1468.81 s [vector] update: OK
  15330. 1468.81 s [vector] +++ OK, passed 100 tests.
  15331. 1468.81 s [vector] mempty: OK
  15332. 1468.81 s [vector] +++ OK, passed 100 tests.
  15333. 1468.82 s [vector] mappend: OK
  15334. 1468.82 s [vector] +++ OK, passed 100 tests.
  15335. 1468.86 s [vector] mconcat: OK (0.05s)
  15336. 1468.86 s [vector] +++ OK, passed 100 tests.
  15337. 1468.87 s [vector] glength: OK
  15338. 1468.87 s [vector] +++ OK, passed 100 tests.
  15339. 1468.87 s [vector] (Int,Bool,Int)
  15340. 1468.87 s [vector] fromList.toList == id: OK
  15341. 1468.87 s [vector] +++ OK, passed 100 tests.
  15342. 1468.87 s [vector] toList.fromList == id: OK
  15343. 1468.87 s [vector] +++ OK, passed 100 tests.
  15344. 1468.87 s [vector] unstream.stream == id: OK
  15345. 1468.87 s [vector] +++ OK, passed 100 tests.
  15346. 1468.87 s [vector] stream.unstream == id: OK
  15347. 1468.87 s [vector] +++ OK, passed 100 tests.
  15348. 1468.87 s [vector] eq: OK
  15349. 1468.87 s [vector] +++ OK, passed 100 tests.
  15350. 1468.87 s [vector] length: OK
  15351. 1468.87 s [vector] +++ OK, passed 100 tests.
  15352. 1468.87 s [vector] null: OK
  15353. 1468.87 s [vector] +++ OK, passed 100 tests.
  15354. 1468.87 s [vector] index: OK
  15355. 1468.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15356. 1468.88 s [vector] safeIndex: OK
  15357. 1468.88 s [vector] +++ OK, passed 100 tests.
  15358. 1468.88 s [vector] head: OK
  15359. 1468.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15360. 1468.88 s [vector] last: OK
  15361. 1468.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15362. 1468.88 s [vector] unsafeIndex: OK
  15363. 1468.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15364. 1468.88 s [vector] unsafeHead: OK
  15365. 1468.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15366. 1468.88 s [vector] unsafeLast: OK
  15367. 1468.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15368. 1468.88 s [vector] slice: OK
  15369. 1468.88 s [vector] +++ OK, passed 100 tests.
  15370. 1468.88 s [vector] init: OK
  15371. 1468.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15372. 1468.89 s [vector] tail: OK
  15373. 1468.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15374. 1468.89 s [vector] take: OK
  15375. 1468.89 s [vector] +++ OK, passed 100 tests.
  15376. 1468.89 s [vector] drop: OK
  15377. 1468.89 s [vector] +++ OK, passed 100 tests.
  15378. 1468.89 s [vector] splitAt: OK
  15379. 1468.89 s [vector] +++ OK, passed 100 tests.
  15380. 1468.89 s [vector] empty: OK
  15381. 1468.89 s [vector] +++ OK, passed 100 tests.
  15382. 1468.89 s [vector] singleton: OK
  15383. 1468.89 s [vector] +++ OK, passed 100 tests.
  15384. 1468.89 s [vector] replicate: OK
  15385. 1468.89 s [vector] +++ OK, passed 100 tests.
  15386. 1468.90 s [vector] generate: OK
  15387. 1468.90 s [vector] +++ OK, passed 100 tests.
  15388. 1468.90 s [vector] iterateN: OK
  15389. 1468.90 s [vector] +++ OK, passed 100 tests.
  15390. 1468.92 s [vector] iterateNM: OK (0.02s)
  15391. 1468.92 s [vector] +++ OK, passed 100 tests.
  15392. 1468.99 s [vector] generateM: OK (0.05s)
  15393. 1468.99 s [vector] +++ OK, passed 100 tests.
  15394. 1468.99 s [vector] replicateM: OK (0.02s)
  15395. 1468.99 s [vector] +++ OK, passed 100 tests.
  15396. 1468.99 s [vector] create: OK
  15397. 1468.99 s [vector] +++ OK, passed 100 tests.
  15398. 1468.99 s [vector] createT: OK
  15399. 1468.99 s [vector] +++ OK, passed 100 tests.
  15400. 1468.99 s [vector] unfoldr: OK
  15401. 1468.99 s [vector] +++ OK, passed 100 tests.
  15402. 1468.99 s [vector] unfoldrN: OK
  15403. 1468.99 s [vector] +++ OK, passed 100 tests.
  15404. 1469.00 s [vector] unfoldrExactN: OK
  15405. 1469.00 s [vector] +++ OK, passed 100 tests.
  15406. 1469.00 s [vector] unfoldrM: OK
  15407. 1469.00 s [vector] +++ OK, passed 100 tests.
  15408. 1469.00 s [vector] unfoldrNM: OK
  15409. 1469.00 s [vector] +++ OK, passed 100 tests.
  15410. 1469.02 s [vector] unfoldrExactNM: OK (0.02s)
  15411. 1469.02 s [vector] +++ OK, passed 100 tests.
  15412. 1469.03 s [vector] constructN: OK
  15413. 1469.03 s [vector] +++ OK, passed 100 tests.
  15414. 1469.03 s [vector] constructrN: OK
  15415. 1469.04 s [vector] +++ OK, passed 100 tests.
  15416. 1469.04 s [vector] cons: OK
  15417. 1469.04 s [vector] +++ OK, passed 100 tests.
  15418. 1469.04 s [vector] snoc: OK
  15419. 1469.04 s [vector] +++ OK, passed 100 tests.
  15420. 1469.06 s [vector] append: OK
  15421. 1469.06 s [vector] +++ OK, passed 100 tests.
  15422. 1469.10 s [vector] concat: OK (0.06s)
  15423. 1469.10 s [vector] +++ OK, passed 100 tests.
  15424. 1469.10 s [vector] force: OK
  15425. 1469.10 s [vector] +++ OK, passed 100 tests.
  15426. 1469.11 s [vector] upd: OK
  15427. 1469.11 s [vector] +++ OK, passed 100 tests.
  15428. 1469.11 s [vector] accum: OK
  15429. 1469.11 s [vector] +++ OK, passed 100 tests.
  15430. 1469.12 s [vector] reverse: OK
  15431. 1469.12 s [vector] +++ OK, passed 100 tests.
  15432. 1469.12 s [vector] backpermute: OK
  15433. 1469.12 s [vector] +++ OK, passed 100 tests.
  15434. 1469.13 s [vector] map: OK
  15435. 1469.14 s [vector] +++ OK, passed 100 tests.
  15436. 1469.14 s [vector] imap: OK
  15437. 1469.14 s [vector] +++ OK, passed 100 tests.
  15438. 1469.14 s [vector] concatMap: OK
  15439. 1469.14 s [vector] +++ OK, passed 100 tests.
  15440. 1469.15 s [vector] mapM: OK
  15441. 1469.15 s [vector] +++ OK, passed 100 tests.
  15442. 1469.16 s [haskell-language-server] Preprocessing library 'hls-notes-plugin' for haskell-language-server-2.12.0.0...
  15443. 1469.16 s [haskell-language-server] Building library 'hls-notes-plugin' for haskell-language-server-2.12.0.0...
  15444. 1469.20 s [vector] mapM_: OK (0.03s)
  15445. 1469.20 s [vector] +++ OK, passed 100 tests.
  15446. 1469.20 s [vector] forM: OK
  15447. 1469.20 s [vector] +++ OK, passed 100 tests.
  15448. 1469.24 s [vector] forM_: OK (0.04s)
  15449. 1469.24 s [vector] +++ OK, passed 100 tests.
  15450. 1469.25 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 )
  15451. 1469.26 s [vector] imapM: OK (0.01s)
  15452. 1469.26 s [vector] +++ OK, passed 100 tests.
  15453. 1469.30 s [vector] imapM_: OK (0.04s)
  15454. 1469.30 s [vector] +++ OK, passed 100 tests.
  15455. 1469.30 s [vector] zipWith: OK
  15456. 1469.30 s [vector] +++ OK, passed 100 tests.
  15457. 1469.30 s [vector] zipWith3: OK
  15458. 1469.30 s [vector] +++ OK, passed 100 tests.
  15459. 1469.32 s [vector] izipWith: OK
  15460. 1469.32 s [vector] +++ OK, passed 100 tests.
  15461. 1469.32 s [vector] izipWith3: OK
  15462. 1469.32 s [vector] +++ OK, passed 100 tests.
  15463. 1469.34 s [vector] izipWithM: OK
  15464. 1469.34 s [vector] +++ OK, passed 100 tests.
  15465. 1469.36 s [vector] izipWithM_: OK (0.03s)
  15466. 1469.36 s [vector] +++ OK, passed 100 tests.
  15467. 1469.36 s [vector] zipWithM: OK
  15468. 1469.36 s [vector] +++ OK, passed 100 tests.
  15469. 1469.40 s [vector] zipWithM_: OK (0.03s)
  15470. 1469.40 s [vector] +++ OK, passed 100 tests.
  15471. 1469.40 s [vector] filter: OK
  15472. 1469.40 s [vector] +++ OK, passed 100 tests.
  15473. 1469.40 s [vector] ifilter: OK
  15474. 1469.40 s [vector] +++ OK, passed 100 tests.
  15475. 1469.46 s [vector] filterM: OK (0.06s)
  15476. 1469.46 s [vector] +++ OK, passed 100 tests.
  15477. 1469.46 s [vector] uniq: OK
  15478. 1469.46 s [vector] +++ OK, passed 100 tests.
  15479. 1469.46 s [vector] mapMaybe: OK
  15480. 1469.46 s [vector] +++ OK, passed 100 tests.
  15481. 1469.47 s [vector] imapMaybe: OK
  15482. 1469.63 s [vector] +++ OK, passed 100 tests.
  15483. 1469.63 s [vector] takeWhile: OK
  15484. 1469.63 s [vector] +++ OK, passed 100 tests.
  15485. 1469.63 s [vector] dropWhile: OK
  15486. 1469.63 s [vector] +++ OK, passed 100 tests.
  15487. 1469.63 s [vector] partition: OK
  15488. 1469.63 s [vector] +++ OK, passed 100 tests.
  15489. 1469.63 s [vector] partitionWith: OK
  15490. 1469.63 s [vector] +++ OK, passed 100 tests.
  15491. 1469.63 s [vector] span: OK
  15492. 1469.63 s [vector] +++ OK, passed 100 tests.
  15493. 1469.63 s [vector] break: OK
  15494. 1469.63 s [vector] +++ OK, passed 100 tests.
  15495. 1469.63 s [vector] spanR: OK
  15496. 1469.63 s [vector] +++ OK, passed 100 tests.
  15497. 1469.63 s [vector] breakR: OK
  15498. 1469.63 s [vector] +++ OK, passed 100 tests.
  15499. 1469.63 s [vector] groupBy: OK
  15500. 1469.63 s [vector] +++ OK, passed 100 tests.
  15501. 1469.63 s [vector] elem: OK
  15502. 1469.63 s [vector] +++ OK, passed 100 tests.
  15503. 1469.63 s [vector] notElem: OK
  15504. 1469.63 s [vector] +++ OK, passed 100 tests.
  15505. 1469.63 s [vector] find: OK
  15506. 1469.63 s [vector] +++ OK, passed 100 tests.
  15507. 1469.63 s [vector] findIndex: OK
  15508. 1469.63 s [vector] +++ OK, passed 100 tests.
  15509. 1469.63 s [vector] findIndexR: OK
  15510. 1469.63 s [vector] +++ OK, passed 100 tests.
  15511. 1469.63 s [vector] findIndices: OK
  15512. 1469.63 s [vector] +++ OK, passed 100 tests.
  15513. 1469.63 s [vector] elemIndex: OK
  15514. 1469.63 s [vector] +++ OK, passed 100 tests.
  15515. 1469.63 s [vector] elemIndices: OK
  15516. 1469.63 s [vector] +++ OK, passed 100 tests.
  15517. 1469.63 s [vector] foldl: OK
  15518. 1469.63 s [vector] +++ OK, passed 100 tests.
  15519. 1469.63 s [vector] foldl1: OK
  15520. 1469.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15521. 1469.63 s [vector] foldl': OK
  15522. 1469.63 s [vector] +++ OK, passed 100 tests.
  15523. 1469.63 s [vector] foldl1': OK
  15524. 1469.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15525. 1469.63 s [vector] foldr: OK
  15526. 1469.63 s [vector] +++ OK, passed 100 tests.
  15527. 1469.63 s [vector] foldr1: OK
  15528. 1469.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15529. 1469.63 s [vector] foldr': OK
  15530. 1469.63 s [vector] +++ OK, passed 100 tests.
  15531. 1469.63 s [vector] foldr1': OK
  15532. 1469.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15533. 1469.63 s [vector] ifoldl: OK
  15534. 1469.63 s [vector] +++ OK, passed 100 tests.
  15535. 1469.63 s [vector] ifoldl': OK
  15536. 1469.63 s [vector] +++ OK, passed 100 tests.
  15537. 1469.63 s [vector] ifoldr: OK
  15538. 1469.63 s [vector] +++ OK, passed 100 tests.
  15539. 1469.63 s [vector] ifoldr': OK
  15540. 1469.63 s [vector] +++ OK, passed 100 tests.
  15541. 1469.63 s [vector] ifoldM: OK
  15542. 1469.63 s [vector] +++ OK, passed 100 tests.
  15543. 1469.63 s [vector] ifoldM': OK
  15544. 1469.63 s [vector] +++ OK, passed 100 tests.
  15545. 1469.64 s [vector] ifoldM_: OK (0.04s)
  15546. 1469.64 s [vector] +++ OK, passed 100 tests.
  15547. 1469.70 s [vector] ifoldM'_: OK (0.06s)
  15548. 1469.70 s [vector] +++ OK, passed 100 tests.
  15549. 1469.70 s [vector] all: OK
  15550. 1469.70 s [vector] +++ OK, passed 100 tests.
  15551. 1469.70 s [vector] any: OK
  15552. 1469.70 s [vector] +++ OK, passed 100 tests.
  15553. 1469.72 s [vector] prescanl: OK (0.01s)
  15554. 1469.72 s [vector] +++ OK, passed 100 tests.
  15555. 1469.72 s [vector] prescanl': OK
  15556. 1469.72 s [vector] +++ OK, passed 100 tests.
  15557. 1469.73 s [vector] postscanl: OK
  15558. 1469.73 s [vector] +++ OK, passed 100 tests.
  15559. 1469.74 s [vector] postscanl': OK
  15560. 1469.74 s [vector] +++ OK, passed 100 tests.
  15561. 1469.74 s [vector] scanl: OK
  15562. 1469.74 s [vector] +++ OK, passed 100 tests.
  15563. 1469.75 s [vector] scanl': OK
  15564. 1469.75 s [vector] +++ OK, passed 100 tests.
  15565. 1469.75 s [vector] scanl1: OK
  15566. 1469.75 s [vector] +++ OK, passed 100 tests.
  15567. 1469.76 s [vector] scanl1': OK
  15568. 1469.76 s [vector] +++ OK, passed 100 tests.
  15569. 1469.77 s [vector] iscanl: OK
  15570. 1469.77 s [vector] +++ OK, passed 100 tests.
  15571. 1469.78 s [vector] iscanl': OK
  15572. 1469.78 s [vector] +++ OK, passed 100 tests.
  15573. 1469.78 s [vector] prescanr: OK
  15574. 1469.79 s [vector] +++ OK, passed 100 tests.
  15575. 1469.79 s [vector] prescanr': OK
  15576. 1469.79 s [vector] +++ OK, passed 100 tests.
  15577. 1469.80 s [vector] postscanr: OK
  15578. 1469.80 s [vector] +++ OK, passed 100 tests.
  15579. 1469.82 s [vector] postscanr': OK (0.01s)
  15580. 1469.82 s [vector] +++ OK, passed 100 tests.
  15581. 1469.82 s [vector] scanr: OK
  15582. 1469.82 s [vector] +++ OK, passed 100 tests.
  15583. 1469.82 s [vector] scanr': OK
  15584. 1469.83 s [vector] +++ OK, passed 100 tests.
  15585. 1469.84 s [vector] scanr1: OK
  15586. 1469.84 s [vector] +++ OK, passed 100 tests.
  15587. 1469.84 s [vector] scanr1': OK
  15588. 1469.84 s [vector] +++ OK, passed 100 tests.
  15589. 1469.85 s [vector] iscanr: OK
  15590. 1469.85 s [vector] +++ OK, passed 100 tests.
  15591. 1469.85 s [vector] iscanr': OK
  15592. 1469.85 s [vector] +++ OK, passed 100 tests.
  15593. 1469.85 s [vector] mut_read: OK
  15594. 1469.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15595. 1469.86 s [vector] mut_write: OK
  15596. 1469.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15597. 1469.86 s [vector] mut_modify: OK
  15598. 1469.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15599. 1469.86 s [vector] mut_generate: OK
  15600. 1469.86 s [vector] +++ OK, passed 100 tests.
  15601. 1469.88 s [vector] mut_generateM: OK (0.02s)
  15602. 1469.88 s [vector] +++ OK, passed 100 tests.
  15603. 1469.94 s [vector] mut_mapM_: OK (0.05s)
  15604. 1469.94 s [vector] +++ OK, passed 100 tests.
  15605. 1469.98 s [vector] mut_imapM_: OK (0.05s)
  15606. 1469.98 s [vector] +++ OK, passed 100 tests.
  15607. 1470.03 s [vector] mut_forM_: OK (0.05s)
  15608. 1470.03 s [vector] +++ OK, passed 100 tests.
  15609. 1470.09 s [vector] mut_iforM_: OK (0.04s)
  15610. 1470.09 s [vector] +++ OK, passed 100 tests.
  15611. 1470.10 s [vector] mut_foldr: OK (0.01s)
  15612. 1470.10 s [vector] +++ OK, passed 100 tests.
  15613. 1470.10 s [vector] mut_foldr': OK
  15614. 1470.10 s [vector] +++ OK, passed 100 tests.
  15615. 1470.11 s [vector] mut_foldl: OK
  15616. 1470.11 s [vector] +++ OK, passed 100 tests.
  15617. 1470.12 s [vector] mut_foldl': OK
  15618. 1470.12 s [vector] +++ OK, passed 100 tests.
  15619. 1470.12 s [vector] mut_ifoldr: OK
  15620. 1470.12 s [vector] +++ OK, passed 100 tests.
  15621. 1470.12 s [vector] mut_ifoldr': OK
  15622. 1470.12 s [vector] +++ OK, passed 100 tests.
  15623. 1470.14 s [vector] mut_ifoldl: OK
  15624. 1470.14 s [vector] +++ OK, passed 100 tests.
  15625. 1470.14 s [vector] mut_ifoldl': OK (0.01s)
  15626. 1470.14 s [vector] +++ OK, passed 100 tests.
  15627. 1470.15 s [vector] mut_foldM: OK
  15628. 1470.15 s [vector] +++ OK, passed 100 tests.
  15629. 1470.15 s [vector] mut_foldM': OK
  15630. 1470.15 s [vector] +++ OK, passed 100 tests.
  15631. 1470.16 s [vector] mut_foldrM: OK
  15632. 1470.16 s [vector] +++ OK, passed 100 tests.
  15633. 1470.17 s [vector] mut_foldrM': OK
  15634. 1470.17 s [vector] +++ OK, passed 100 tests.
  15635. 1470.18 s [vector] mut_ifoldM: OK
  15636. 1470.18 s [vector] +++ OK, passed 100 tests.
  15637. 1470.18 s [vector] mut_ifoldM': OK
  15638. 1470.18 s [vector] +++ OK, passed 100 tests.
  15639. 1470.19 s [vector] mut_ifoldrM: OK
  15640. 1470.19 s [vector] +++ OK, passed 100 tests.
  15641. 1470.19 s [vector] mut_ifoldrM': OK
  15642. 1470.20 s [vector] +++ OK, passed 100 tests.
  15643. 1470.20 s [vector] compare: OK
  15644. 1470.20 s [vector] +++ OK, passed 100 tests.
  15645. 1470.20 s [vector] maximum: OK
  15646. 1470.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15647. 1470.20 s [vector] minimum: OK
  15648. 1470.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15649. 1470.21 s [vector] minIndex: OK
  15650. 1470.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15651. 1470.21 s [vector] maxIndex: OK
  15652. 1470.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15653. 1470.21 s [vector] maximumBy: OK
  15654. 1470.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15655. 1470.21 s [vector] minimumBy: OK
  15656. 1470.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15657. 1470.21 s [vector] maximumOn: OK
  15658. 1470.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15659. 1470.22 s [vector] minimumOn: OK
  15660. 1470.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15661. 1470.22 s [vector] maxIndexBy: OK
  15662. 1470.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15663. 1470.23 s [vector] minIndexBy: OK
  15664. 1470.23 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15665. 1470.23 s [vector] ListFirstMaxIndexWins: OK
  15666. 1470.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15667. 1470.23 s [vector] FalseListFirstMaxIndexWins: OK
  15668. 1470.23 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  15669. 1470.23 s [vector] []
  15670. 1470.24 s [vector] zip: OK
  15671. 1470.24 s [vector] +++ OK, passed 100 tests.
  15672. 1470.24 s [vector] zip3: OK
  15673. 1470.24 s [vector] +++ OK, passed 100 tests.
  15674. 1470.24 s [vector] unzip: OK
  15675. 1470.24 s [vector] +++ OK, passed 100 tests.
  15676. 1470.25 s [vector] unzip3: OK
  15677. 1470.25 s [vector] +++ OK, passed 100 tests.
  15678. 1470.25 s [vector] indexed: OK
  15679. 1470.25 s [vector] +++ OK, passed 100 tests.
  15680. 1470.25 s [vector] update: OK
  15681. 1470.26 s [vector] +++ OK, passed 100 tests.
  15682. 1470.26 s [vector] mempty: OK
  15683. 1470.26 s [vector] +++ OK, passed 100 tests.
  15684. 1470.26 s [vector] mappend: OK
  15685. 1470.26 s [vector] +++ OK, passed 100 tests.
  15686. 1470.30 s [vector] mconcat: OK (0.06s)
  15687. 1470.30 s [vector] +++ OK, passed 100 tests.
  15688. 1470.30 s [vector] glength: OK
  15689. 1470.30 s [vector] +++ OK, passed 100 tests.
  15690. 1470.30 s [vector] unstream
  15691. 1470.30 s [vector] unstream == vunstream (exact): OK
  15692. 1470.30 s [vector] +++ OK, passed 100 tests.
  15693. 1470.30 s [vector] unstream == vunstream (unknown): OK
  15694. 1470.30 s [vector] +++ OK, passed 100 tests.
  15695. 1470.30 s [vector] unstreamR ~= vunstream (exact): OK
  15696. 1470.30 s [vector] +++ OK, passed 100 tests.
  15697. 1470.30 s [vector] unstreamR ~= vunstream (unknown): OK
  15698. 1470.30 s [vector] +++ OK, passed 100 tests.
  15699. 1470.30 s [vector] Data.Vector.Storable.Vector Alignment
  15700. 1470.30 s [vector] Aligned Double: OK
  15701. 1470.30 s [vector] Aligned Int: OK
  15702. 1470.30 s [vector] Regression tests
  15703. 1470.30 s [vector] enumFromTo crash #188
  15704. 1470.30 s [vector] Word8: OK
  15705. 1470.30 s [vector] Word16: OK
  15706. 1470.30 s [vector] Word32: OK
  15707. 1470.30 s [vector] Word64: OK
  15708. 1470.30 s [vector] Word: OK
  15709. 1470.30 s [vector] Int8: OK
  15710. 1470.30 s [vector] Int16: OK
  15711. 1470.30 s [vector] Int32: OK
  15712. 1470.30 s [vector] Int64: OK
  15713. 1470.30 s [vector] Int: OK
  15714. 1470.30 s [vector] Char: OK
  15715. 1470.30 s [vector] Negative tests
  15716. 1470.30 s [vector] slice out of bounds #257
  15717. 1470.30 s [vector] Boxed
  15718. 1470.30 s [vector] Negative ix: OK
  15719. 1470.30 s [vector] Negative size: OK
  15720. 1470.30 s [vector] Negative ix and size: OK
  15721. 1470.30 s [vector] Too large ix: OK
  15722. 1470.30 s [vector] Too large size: OK
  15723. 1470.30 s [vector] Too large ix and size: OK
  15724. 1470.30 s [vector] Overflow: OK
  15725. 1470.30 s [vector] OutOfMemory: OK
  15726. 1470.30 s [vector] Primitive
  15727. 1470.30 s [vector] Negative ix: OK
  15728. 1470.30 s [vector] Negative size: OK
  15729. 1470.30 s [vector] Negative ix and size: OK
  15730. 1470.30 s [vector] Too large ix: OK
  15731. 1470.30 s [vector] Too large size: OK
  15732. 1470.30 s [vector] Too large ix and size: OK
  15733. 1470.30 s [vector] Overflow: OK
  15734. 1470.30 s [vector] OutOfMemory: OK
  15735. 1470.30 s [vector] Storable
  15736. 1470.30 s [vector] Negative ix: OK
  15737. 1470.30 s [vector] Negative size: OK
  15738. 1470.30 s [vector] Negative ix and size: OK
  15739. 1470.30 s [vector] Too large ix: OK
  15740. 1470.30 s [vector] Too large size: OK
  15741. 1470.30 s [vector] Too large ix and size: OK
  15742. 1470.30 s [vector] Overflow: OK
  15743. 1470.30 s [vector] OutOfMemory: OK
  15744. 1470.30 s [vector] Unboxed
  15745. 1470.30 s [vector] Negative ix: OK
  15746. 1470.30 s [vector] Negative size: OK
  15747. 1470.30 s [vector] Negative ix and size: OK
  15748. 1470.30 s [vector] Too large ix: OK
  15749. 1470.30 s [vector] Too large size: OK
  15750. 1470.30 s [vector] Too large ix and size: OK
  15751. 1470.30 s [vector] Overflow: OK
  15752. 1470.30 s [vector] OutOfMemory: OK
  15753. 1470.30 s [vector] take #282
  15754. 1470.30 s [vector] Boxed: OK
  15755. 1470.30 s [vector] Primitive: OK
  15756. 1470.30 s [vector] Storable: OK
  15757. 1470.30 s [vector] Unboxed: OK
  15758. 1470.30 s [vector] Data.Vector
  15759. 1470.30 s [vector] MonadFix: OK
  15760. 1470.30 s [vector] toFromArray: OK
  15761. 1470.30 s [vector] toFromArraySlice: OK
  15762. 1470.31 s [vector] toFromArraySliceUnsafe: OK
  15763. 1470.31 s [vector] toFromMutableArray: OK
  15764. 1470.31 s [vector] Data.Vector.Mutable (Move): OK
  15765. 1470.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15766. 1470.31 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  15767. 1470.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15768. 1470.32 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  15769. 1470.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15770. 1470.32 s [vector] Data.Vector.Storable.Mutable (Move): OK
  15771. 1470.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15772. 1470.32 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  15773. 1470.32 s [vector] +++ OK, passed 100 tests.
  15774. 1470.32 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  15775. 1470.32 s [vector] +++ OK, passed 100 tests.
  15776. 1470.33 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  15777. 1470.33 s [vector] +++ OK, passed 100 tests.
  15778. 1470.33 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  15779. 1470.33 s [vector] +++ OK, passed 100 tests.
  15780. 1470.33 s [vector]
  15781. 1470.33 s [vector] All 2808 tests passed (13.82s)
  15782. 1470.33 s [vector] Test suite vector-tests-O2: PASS
  15783. 1470.33 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  15784. 1470.33 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  15785. 1470.34 s [vector] checkPhase completed in 31 seconds
  15786. 1470.34 s [vector] Phase: haddockPhase
  15787. 1470.35 s [vector] Phase: installPhase
  15788. 1470.39 s [vector] Installing library in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  15789. 1470.67 s [haskell-language-server] plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs:8:1: warning: [GHC-66111] [-Wunused-imports]
  15790. 1470.67 s [haskell-language-server] The import of ‘Data.Foldable’ is redundant
  15791. 1470.67 s [haskell-language-server] except perhaps to import instances from ‘Data.Foldable’
  15792. 1470.67 s [haskell-language-server] To import instances alone, use: import Data.Foldable()
  15793. 1470.67 s [haskell-language-server] |
  15794. 1470.67 s [haskell-language-server] 8 | import Data.Foldable (foldl')
  15795. 1470.67 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15796. 1470.67 s [haskell-language-server]
  15797. 1471.11 s [vector] Installing internal library benchmarks-O2 in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2
  15798. 1471.41 s [vector] Phase: fixupPhase
  15799. 1471.43 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  15800. 1471.45 s [vector] shrinking /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSvector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2-ghc9.12.2.so
  15801. 1471.46 s [vector] shrinking /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSvector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH-ghc9.12.2.so
  15802. 1471.48 s [vector] checking for references to /build/ in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0...
  15803. 1471.54 s [vector] patching script interpreter paths in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  15804. 1471.55 s [vector] stripping (with command strip and flags -S -p) in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib
  15805. 1472.44 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  15806. 1472.91 s [vector:post-build] Nothing to push - all store paths are already on Cachix.
  15807. 1472.93 s [vector:post-build] Uploading to the NixCI cache: /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  15808. 1472.99 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15809. 1473.02 s [vector:post-build] copying 1 paths...
  15810. 1473.02 s [vector:post-build] copying path '/nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  15811. 1488.16 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15812. 1488.26 s [vector:post-build] copying 0 paths...
  15813. 1488.28 s Progress: 17 of 34 built (1 building), 593 of 593 downloaded from cache
  15814. 1488.35 s Building /nix/store/zsswivj44k6g1mv7kqsfri8v1ghfgidx-nothunks-0.3.1.drv
  15815. 1488.35 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 )
  15816. 1488.35 s [haskell-language-server] plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs:8:1: warning: [GHC-66111] [-Wunused-imports]
  15817. 1488.35 s [haskell-language-server] The import of ‘Data.Foldable’ is redundant
  15818. 1488.35 s [haskell-language-server] except perhaps to import instances from ‘Data.Foldable’
  15819. 1488.35 s [haskell-language-server] To import instances alone, use: import Data.Foldable()
  15820. 1488.35 s [haskell-language-server] |
  15821. 1488.35 s [haskell-language-server] 8 | import Data.Foldable (foldl')
  15822. 1488.35 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15823. 1488.35 s [haskell-language-server]
  15824. 1488.35 s [haskell-language-server] Preprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0...
  15825. 1488.35 s [haskell-language-server] Building library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0...
  15826. 1488.35 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 )
  15827. 1488.35 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 )
  15828. 1488.54 s [nothunks] Phase: setupCompilerEnvironmentPhase
  15829. 1488.54 s [nothunks] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  15830. 1488.82 s [nothunks] Phase: unpackPhase
  15831. 1488.82 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  15832. 1488.83 s [nothunks] source root is nothunks-0.3.1
  15833. 1488.84 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  15834. 1488.84 s [nothunks] Phase: patchPhase
  15835. 1488.84 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  15836. 1488.85 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  15837. 1488.86 s [nothunks] Phase: compileBuildDriverPhase
  15838. 1488.86 s [nothunks] setupCompileFlags: -package-db=/build/tmp.bRPj4BZP5F/setup-package.conf.d -threaded
  15839. 1488.93 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.bRPj4BZP5F/Main.o )
  15840. 1489.00 s [nothunks] [2 of 2] Linking Setup
  15841. 1490.49 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  15842. 1490.50 s [nothunks] Phase: configurePhase
  15843. 1490.51 s [nothunks] configureFlags: --verbose --prefix=/nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.bRPj4BZP5F/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
  15844. 1490.51 s [nothunks] Using Parsec parser
  15845. 1490.51 s [nothunks] Configuring nothunks-0.3.1...
  15846. 1490.55 s [nothunks] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  15847. 1490.55 s [nothunks] 'ghc' version < 9.12):
  15848. 1490.55 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  15849. 1490.55 s [nothunks] 9.12.2
  15850. 1490.88 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  15851. 1491.19 s [nothunks] Dependency base: using base-4.21.0.0
  15852. 1491.19 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  15853. 1491.19 s [nothunks] Dependency containers: using containers-0.7
  15854. 1491.19 s [nothunks] Dependency ghc-heap: using ghc-heap-9.12.2
  15855. 1491.19 s [nothunks] Dependency stm: using stm-2.5.3.1
  15856. 1491.19 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.2
  15857. 1491.19 s [nothunks] Dependency time: using time-1.14
  15858. 1491.19 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  15859. 1491.19 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  15860. 1491.19 s [nothunks] Dependency base: using base-4.21.0.0
  15861. 1491.19 s [nothunks] Dependency containers: using containers-0.7
  15862. 1491.19 s [nothunks] Dependency ghc-prim: using ghc-prim-0.13.0
  15863. 1491.19 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  15864. 1491.19 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  15865. 1491.19 s [nothunks] Dependency random: using random-1.2.1.3
  15866. 1491.19 s [nothunks] Dependency stm: using stm-2.5.3.1
  15867. 1491.19 s [nothunks] Dependency tasty: using tasty-1.5.3
  15868. 1491.19 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  15869. 1491.19 s [nothunks] Source component graph:
  15870. 1491.19 s [nothunks] component lib
  15871. 1491.19 s [nothunks] component test:nothunks-test dependency lib
  15872. 1491.19 s [nothunks] Configured component graph:
  15873. 1491.19 s [nothunks] component nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  15874. 1491.19 s [nothunks] include base-4.21.0.0-b334
  15875. 1491.19 s [nothunks] include bytestring-0.12.2.0-0cf8
  15876. 1491.19 s [nothunks] include containers-0.7-d79e
  15877. 1491.19 s [nothunks] include ghc-heap-9.12.2-832c
  15878. 1491.19 s [nothunks] include stm-2.5.3.1-ef8d
  15879. 1491.19 s [nothunks] include text-2.1.2-e822
  15880. 1491.19 s [nothunks] include time-1.14-3dc5
  15881. 1491.19 s [nothunks] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  15882. 1491.19 s [nothunks] include wherefrom-compat-0.1.1.1-A92ja6MztHp7tH6ALtCvHn
  15883. 1491.19 s [nothunks] component nothunks-0.3.1-3kSAicIDPyE2qJz2aIZqdd-nothunks-test
  15884. 1491.19 s [nothunks] include base-4.21.0.0-b334
  15885. 1491.19 s [nothunks] include containers-0.7-d79e
  15886. 1491.19 s [nothunks] include ghc-prim-0.13.0-cbf2
  15887. 1491.19 s [nothunks] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  15888. 1491.19 s [nothunks] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  15889. 1491.19 s [nothunks] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  15890. 1491.19 s [nothunks] include stm-2.5.3.1-ef8d
  15891. 1491.19 s [nothunks] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  15892. 1491.19 s [nothunks] include tasty-hedgehog-1.4.0.2-5ishr1AGQIN1gnZlV75Roe
  15893. 1491.19 s [nothunks] Linked component graph:
  15894. 1491.19 s [nothunks] unit nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  15895. 1491.19 s [nothunks] include base-4.21.0.0-b334
  15896. 1491.19 s [nothunks] include bytestring-0.12.2.0-0cf8
  15897. 1491.19 s [nothunks] include containers-0.7-d79e
  15898. 1491.19 s [nothunks] include ghc-heap-9.12.2-832c
  15899. 1491.19 s [nothunks] include stm-2.5.3.1-ef8d
  15900. 1491.19 s [nothunks] include text-2.1.2-e822
  15901. 1491.19 s [nothunks] include time-1.14-3dc5
  15902. 1491.19 s [nothunks] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  15903. 1491.19 s [nothunks] include wherefrom-compat-0.1.1.1-A92ja6MztHp7tH6ALtCvHn
  15904. 1491.19 s [nothunks] NoThunks.Class=nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl:NoThunks.Class
  15905. 1491.19 s [nothunks] unit nothunks-0.3.1-3kSAicIDPyE2qJz2aIZqdd-nothunks-test
  15906. 1491.19 s [nothunks] include base-4.21.0.0-b334
  15907. 1491.19 s [nothunks] include containers-0.7-d79e
  15908. 1491.19 s [nothunks] include ghc-prim-0.13.0-cbf2
  15909. 1491.19 s [nothunks] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  15910. 1491.19 s [nothunks] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  15911. 1491.19 s [nothunks] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  15912. 1491.19 s [nothunks] include stm-2.5.3.1-ef8d
  15913. 1491.19 s [nothunks] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  15914. 1491.19 s [nothunks] include tasty-hedgehog-1.4.0.2-5ishr1AGQIN1gnZlV75Roe
  15915. 1491.19 s [nothunks] Ready component graph:
  15916. 1491.19 s [nothunks] definite nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  15917. 1491.19 s [nothunks] depends base-4.21.0.0-b334
  15918. 1491.19 s [nothunks] depends bytestring-0.12.2.0-0cf8
  15919. 1491.19 s [nothunks] depends containers-0.7-d79e
  15920. 1491.19 s [nothunks] depends ghc-heap-9.12.2-832c
  15921. 1491.19 s [nothunks] depends stm-2.5.3.1-ef8d
  15922. 1491.19 s [nothunks] depends text-2.1.2-e822
  15923. 1491.19 s [nothunks] depends time-1.14-3dc5
  15924. 1491.19 s [nothunks] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  15925. 1491.19 s [nothunks] depends wherefrom-compat-0.1.1.1-A92ja6MztHp7tH6ALtCvHn
  15926. 1491.19 s [nothunks] definite nothunks-0.3.1-3kSAicIDPyE2qJz2aIZqdd-nothunks-test
  15927. 1491.19 s [nothunks] depends base-4.21.0.0-b334
  15928. 1491.19 s [nothunks] depends containers-0.7-d79e
  15929. 1491.19 s [nothunks] depends ghc-prim-0.13.0-cbf2
  15930. 1491.19 s [nothunks] depends hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  15931. 1491.19 s [nothunks] depends nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  15932. 1491.19 s [nothunks] depends random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  15933. 1491.19 s [nothunks] depends stm-2.5.3.1-ef8d
  15934. 1491.19 s [nothunks] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  15935. 1491.19 s [nothunks] depends tasty-hedgehog-1.4.0.2-5ishr1AGQIN1gnZlV75Roe
  15936. 1491.19 s [nothunks] Using Cabal-3.14.1.0 compiled by ghc-9.12
  15937. 1491.19 s [nothunks] Using compiler: ghc-9.12.2
  15938. 1491.19 s [nothunks] Using install prefix:
  15939. 1491.19 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  15940. 1491.19 s [nothunks] Executables installed in:
  15941. 1491.19 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/bin
  15942. 1491.19 s [nothunks] Libraries installed in:
  15943. 1491.19 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  15944. 1491.19 s [nothunks] Dynamic Libraries installed in:
  15945. 1491.19 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  15946. 1491.19 s [nothunks] Private executables installed in:
  15947. 1491.19 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1
  15948. 1491.19 s [nothunks] Data files installed in:
  15949. 1491.19 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/share/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1
  15950. 1491.19 s [nothunks] Documentation installed in:
  15951. 1491.19 s [nothunks] /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  15952. 1491.20 s [nothunks] Configuration files installed in:
  15953. 1491.20 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/etc
  15954. 1491.20 s [nothunks] No alex found
  15955. 1491.20 s [nothunks] Using ar found on system at:
  15956. 1491.20 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15957. 1491.20 s [nothunks] No c2hs found
  15958. 1491.20 s [nothunks] No cpphs found
  15959. 1491.20 s [nothunks] No doctest found
  15960. 1491.20 s [nothunks] Using gcc version 14.3.0 given by user at:
  15961. 1491.20 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15962. 1491.20 s [nothunks] Using ghc version 9.12.2 found on system at:
  15963. 1491.20 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  15964. 1491.20 s [nothunks] Using ghc-pkg version 9.12.2 found on system at:
  15965. 1491.20 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  15966. 1491.20 s [nothunks] No ghcjs found
  15967. 1491.20 s [nothunks] No ghcjs-pkg found
  15968. 1491.20 s [nothunks] No greencard found
  15969. 1491.20 s [nothunks] Using haddock version 2.30.0 found on system at:
  15970. 1491.20 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  15971. 1491.20 s [nothunks] No happy found
  15972. 1491.20 s [nothunks] No haskell-suite found
  15973. 1491.20 s [nothunks] No haskell-suite-pkg found
  15974. 1491.20 s [nothunks] No hmake found
  15975. 1491.20 s [nothunks] Using hpc version 0.69 found on system at:
  15976. 1491.20 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  15977. 1491.20 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  15978. 1491.20 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  15979. 1491.20 s [nothunks] Using hscolour version 1.25 found on system at:
  15980. 1491.20 s [nothunks] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  15981. 1491.20 s [nothunks] No jhc found
  15982. 1491.20 s [nothunks] Using ld found on system at:
  15983. 1491.20 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  15984. 1491.20 s [nothunks] No pkg-config found
  15985. 1491.20 s [nothunks] Using runghc version 9.12.2 found on system at:
  15986. 1491.20 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  15987. 1491.20 s [nothunks] Using strip version 2.44 found on system at:
  15988. 1491.20 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15989. 1491.20 s [nothunks] Using tar found on system at:
  15990. 1491.20 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15991. 1491.20 s [nothunks] No uhc found
  15992. 1491.45 s [nothunks] Phase: buildPhase
  15993. 1491.54 s [nothunks] Preprocessing library for nothunks-0.3.1...
  15994. 1491.54 s [nothunks] Building library for nothunks-0.3.1...
  15995. 1491.64 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  15996. 1494.67 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  15997. 1496.00 s [haskell-language-server] Preprocessing library 'hls-class-plugin' for haskell-language-server-2.12.0.0...
  15998. 1496.00 s [haskell-language-server] Building library 'hls-class-plugin' for haskell-language-server-2.12.0.0...
  15999. 1496.31 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 )
  16000. 1498.13 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 )
  16001. 1499.01 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  16002. 1499.06 s Waiting for lock on pandoc-lua-engine
  16003. 1499.06 s Waiting for lock on pandoc-server-0.1.0.11-doc
  16004. 1499.06 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  16005. 1499.09 s [haskell-language-server] plugins/hls-class-plugin/src/Ide/Plugin/Class/Types.hs:25:1: warning: [GHC-66111] [-Wunused-imports]
  16006. 1499.09 s [haskell-language-server] The import of ‘Development.IDE.GHC.Compat.Util’ is redundant
  16007. 1499.09 s [haskell-language-server] except perhaps to import instances from ‘Development.IDE.GHC.Compat.Util’
  16008. 1499.09 s [haskell-language-server] To import instances alone, use: import Development.IDE.GHC.Compat.Util()
  16009. 1499.09 s [haskell-language-server] |
  16010. 1499.09 s [haskell-language-server] 25 | import Development.IDE.GHC.Compat.Util (bagToList)
  16011. 1499.09 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16012. 1499.09 s [haskell-language-server]
  16013. 1499.28 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 )
  16014. 1500.81 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 )
  16015. 1500.87 s [haskell-language-server] plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs:9:1: warning: [GHC-66111] [-Wunused-imports]
  16016. 1500.87 s [haskell-language-server] The import of ‘Data.Functor.Identity’ is redundant
  16017. 1500.87 s [haskell-language-server] except perhaps to import instances from ‘Data.Functor.Identity’
  16018. 1500.87 s [haskell-language-server] To import instances alone, use: import Data.Functor.Identity()
  16019. 1500.87 s [haskell-language-server] |
  16020. 1500.87 s [haskell-language-server] 9 | import Data.Functor.Identity (Identity)
  16021. 1500.87 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16022. 1500.87 s [haskell-language-server]
  16023. 1501.12 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 )
  16024. 1501.46 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 )
  16025. 1502.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 )
  16026. 1502.74 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  16027. 1503.08 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 )
  16028. 1503.24 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  16029. 1504.90 s [nothunks] Phase: checkPhase
  16030. 1505.12 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 )
  16031. 1505.57 s [nothunks] Running 1 test suites...
  16032. 1505.57 s [nothunks] Test suite nothunks-test: RUNNING...
  16033. 1505.58 s [nothunks] Tests
  16034. 1505.58 s [nothunks] NoThunks.Class
  16035. 1505.59 s [nothunks] Sanity
  16036. 1505.59 s [nothunks] IntNotNF: OK
  16037. 1505.59 s [nothunks] ✓ <interactive> passed 1 test.
  16038. 1505.59 s [nothunks] IntIsNF: OK
  16039. 1505.59 s [nothunks] ✓ <interactive> passed 1 test.
  16040. 1505.59 s [nothunks] Pair: OK
  16041. 1505.59 s [nothunks] ✓ <interactive> passed 1 test.
  16042. 1505.59 s [nothunks] Sum: OK
  16043. 1505.59 s [nothunks] ✓ <interactive> passed 1 test.
  16044. 1505.59 s [nothunks] Fn: OK
  16045. 1505.59 s [nothunks] ✓ <interactive> passed 1 test.
  16046. 1505.59 s [nothunks] IO: OK
  16047. 1505.59 s [nothunks] ✓ <interactive> passed 1 test.
  16048. 1505.59 s [nothunks] InspectHeap
  16049. 1505.61 s [nothunks] Int: OK (0.02s)
  16050. 1505.61 s [nothunks] ✓ <interactive> passed 1000 tests.
  16051. 1505.61 s [nothunks] Just ["Int"] 50% ██████████··········
  16052. 1505.61 s [nothunks] Nothing 50% █████████▉··········
  16053. 1505.65 s [nothunks] IntInt: OK (0.03s)
  16054. 1505.65 s [nothunks] ✓ <interactive> passed 1000 tests.
  16055. 1505.65 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  16056. 1505.65 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  16057. 1505.65 s [nothunks] Nothing 13% ██▌·················
  16058. 1505.67 s [nothunks] SumInt: OK (0.02s)
  16059. 1505.67 s [nothunks] ✓ <interactive> passed 1000 tests.
  16060. 1505.67 s [nothunks] Just ["Either"] 32% ██████▌·············
  16061. 1505.67 s [nothunks] Just ["Int","Either"] 35% ██████▉·············
  16062. 1505.67 s [nothunks] Nothing 33% ██████▌·············
  16063. 1505.71 s [nothunks] ListInt: OK (0.03s)
  16064. 1505.71 s [nothunks] ✓ <interactive> passed 1000 tests.
  16065. 1505.71 s [nothunks] Just ["Int","List"] 22% ████▌···············
  16066. 1505.71 s [nothunks] Just ["List"] 44% ████████▊···········
  16067. 1505.71 s [nothunks] Nothing 33% ██████▋·············
  16068. 1505.73 s [nothunks] IntListInt: OK (0.04s)
  16069. 1505.73 s [nothunks] ✓ <interactive> passed 1000 tests.
  16070. 1505.73 s [nothunks] Just ["Int","List","Tuple2"] 6% █▎··················
  16071. 1505.73 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  16072. 1505.73 s [nothunks] Just ["List","Tuple2"] 11% ██··················
  16073. 1505.73 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  16074. 1505.73 s [nothunks] Nothing 8% █▋··················
  16075. 1505.80 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  16076. 1505.80 s [nothunks] after 11 tests and 2 shrinks.
  16077. 1505.80 s [nothunks] shrink path: 11:cA
  16078. 1505.80 s [nothunks] Just ["Int","Seq"] 9% █▊··················
  16079. 1505.80 s [nothunks] Nothing 82% ████████████████▎···
  16080. 1505.80 s [nothunks]
  16081. 1505.80 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  16082. 1505.80 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  16083. 1505.80 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  16084. 1505.80 s [nothunks] 168 ┃ -> Proxy a
  16085. 1505.80 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  16086. 1505.80 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  16087. 1505.80 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  16088. 1505.80 s [nothunks] 172 ┃ -> Property
  16089. 1505.80 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  16090. 1505.80 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  16091. 1505.80 s [nothunks] ┃ │ Wrap
  16092. 1505.80 s [nothunks] ┃ │ { unwrap =
  16093. 1505.80 s [nothunks] ┃ │ SeqEnqueue
  16094. 1505.80 s [nothunks] ┃ │ (IntValue 0)
  16095. 1505.80 s [nothunks] ┃ │ (SeqEnqueue
  16096. 1505.80 s [nothunks] ┃ │ (IntValue 0)
  16097. 1505.80 s [nothunks] ┃ │ (SeqEnqueue
  16098. 1505.80 s [nothunks] ┃ │ (IntValue 0)
  16099. 1505.80 s [nothunks] ┃ │ (SeqEnqueue
  16100. 1505.80 s [nothunks] ┃ │ (IntValue 0)
  16101. 1505.80 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  16102. 1505.80 s [nothunks] ┃ │ }
  16103. 1505.80 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  16104. 1505.80 s [nothunks] 176 ┃ fromModel m $ \a -> do
  16105. 1505.80 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  16106. 1505.80 s [nothunks] ┃ │ IsNF
  16107. 1505.80 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  16108. 1505.80 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  16109. 1505.80 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16110. 1505.80 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  16111. 1505.80 s [nothunks] ┃ │ - Just
  16112. 1505.80 s [nothunks] ┃ │ - ThunkInfo
  16113. 1505.80 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  16114. 1505.80 s [nothunks] ┃ │ + Nothing
  16115. 1505.80 s [nothunks]
  16116. 1505.80 s [nothunks] This failure can be reproduced by running:
  16117. 1505.81 s [nothunks] > recheckAt (Seed 8988716961891366295 11317120313616566873) "11:cA" EXPECTED FAILURE
  16118. 1505.81 s [nothunks]
  16119. 1505.81 s [nothunks] OK (0.07s)
  16120. 1505.84 s [nothunks] ✓ <interactive> passed 1 test.
  16121. 1505.84 s [nothunks] Model
  16122. 1505.84 s [nothunks] Int: OK (0.02s)
  16123. 1505.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  16124. 1505.84 s [nothunks] Just ["Int"] 52% ██████████▎·········
  16125. 1505.84 s [nothunks] Nothing 48% █████████▋··········
  16126. 1505.84 s [nothunks] IntInt: OK (0.02s)
  16127. 1505.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  16128. 1505.84 s [nothunks] Just ["Int","Tuple2"] 35% ███████·············
  16129. 1505.84 s [nothunks] Just ["Tuple2"] 52% ██████████▎·········
  16130. 1505.84 s [nothunks] Nothing 13% ██▋·················
  16131. 1505.88 s [nothunks] SumInt: OK (0.02s)
  16132. 1505.88 s [nothunks] ✓ <interactive> passed 1000 tests.
  16133. 1505.88 s [nothunks] Just ["Either"] 33% ██████▋·············
  16134. 1505.88 s [nothunks] Just ["Int","Either"] 31% ██████▎·············
  16135. 1505.88 s [nothunks] Nothing 35% ███████·············
  16136. 1505.89 s [nothunks] ListInt: OK (0.02s)
  16137. 1505.89 s [nothunks] ✓ <interactive> passed 1000 tests.
  16138. 1505.89 s [nothunks] Just ["Int","List"] 21% ████················
  16139. 1505.89 s [nothunks] Just ["List"] 46% █████████▏··········
  16140. 1505.89 s [nothunks] Nothing 34% ██████▋·············
  16141. 1505.91 s [nothunks] IntListInt: OK (0.03s)
  16142. 1505.91 s [nothunks] ✓ <interactive> passed 1000 tests.
  16143. 1505.91 s [nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
  16144. 1505.91 s [nothunks] Just ["Int","Tuple2"] 26% █████▎··············
  16145. 1505.91 s [nothunks] Just ["List","Tuple2"] 10% ██··················
  16146. 1505.91 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  16147. 1505.91 s [nothunks] Nothing 8% █▌··················
  16148. 1506.00 s [nothunks] SeqInt: OK (0.10s)
  16149. 1506.00 s [nothunks] ✓ <interactive> passed 1000 tests.
  16150. 1506.00 s [nothunks] Just ["Int","Seq"] 46% █████████▏··········
  16151. 1506.00 s [nothunks] Nothing 54% ██████████▊·········
  16152. 1506.05 s [nothunks] AllowThunksIn: OK (0.04s)
  16153. 1506.05 s [nothunks] ✓ <interactive> passed 1000 tests.
  16154. 1506.05 s [nothunks] Just ["Int","field2","Record"] 25% █████···············
  16155. 1506.05 s [nothunks] Just ["Record"] 48% █████████▌··········
  16156. 1506.05 s [nothunks] Nothing 26% █████▎··············
  16157. 1506.07 s [nothunks] Fn: OK (0.01s)
  16158. 1506.07 s [nothunks] ✓ <interactive> passed 1000 tests.
  16159. 1506.07 s [nothunks] Just ["->"] 27% █████▎··············
  16160. 1506.07 s [nothunks] Nothing 73% ██████████████▋·····
  16161. 1506.07 s [nothunks] IO: OK (0.01s)
  16162. 1506.07 s [nothunks] ✓ <interactive> passed 1000 tests.
  16163. 1506.07 s [nothunks] Just ["IO"] 24% ████▉···············
  16164. 1506.07 s [nothunks] Nothing 76% ███████████████·····
  16165. 1506.09 s [nothunks] ThunkFreeFn: OK (0.01s)
  16166. 1506.09 s [nothunks] ✓ <interactive> passed 1000 tests.
  16167. 1506.09 s [nothunks] Just ["->"] 26% █████···············
  16168. 1506.09 s [nothunks] Just ["...","->"] 38% ███████▌············
  16169. 1506.09 s [nothunks] Nothing 37% ███████▎············
  16170. 1506.09 s [nothunks] ThunkFreeIO: OK (0.01s)
  16171. 1506.09 s [nothunks] ✓ <interactive> passed 1000 tests.
  16172. 1506.09 s [nothunks] Just ["...","IO"] 37% ███████▍············
  16173. 1506.09 s [nothunks] Just ["IO"] 24% ████▊···············
  16174. 1506.09 s [nothunks] Nothing 39% ███████▊············
  16175. 1506.09 s [nothunks] MutableVars
  16176. 1506.09 s [nothunks] IORef
  16177. 1506.10 s [nothunks] NotNF: OK
  16178. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16179. 1506.10 s [nothunks] NF: OK
  16180. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16181. 1506.10 s [nothunks] NotNFPure: OK
  16182. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16183. 1506.10 s [nothunks] NFPure: OK
  16184. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16185. 1506.10 s [nothunks] NotNFAtomically: OK
  16186. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16187. 1506.10 s [nothunks] NFAtomically: OK
  16188. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16189. 1506.10 s [nothunks] MVar
  16190. 1506.10 s [nothunks] NotNF: OK
  16191. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16192. 1506.10 s [nothunks] NF: OK
  16193. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16194. 1506.10 s [nothunks] NotNFPure: OK
  16195. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16196. 1506.10 s [nothunks] NFPure: OK
  16197. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16198. 1506.10 s [nothunks] NotNFAtomically: OK
  16199. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16200. 1506.10 s [nothunks] NFAtomically: OK
  16201. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16202. 1506.10 s [nothunks] TVar
  16203. 1506.10 s [nothunks] NotNF: OK
  16204. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16205. 1506.10 s [nothunks] NF: OK
  16206. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16207. 1506.10 s [nothunks] NotNFPure: OK
  16208. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16209. 1506.10 s [nothunks] NFPure: OK
  16210. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16211. 1506.10 s [nothunks] NotNFAtomically: OK
  16212. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16213. 1506.10 s [nothunks] NFAtomically: OK
  16214. 1506.10 s [nothunks] ✓ <interactive> passed 1 test.
  16215. 1506.10 s [nothunks]
  16216. 1506.10 s [nothunks] All 41 tests passed (0.51s)
  16217. 1506.10 s [nothunks] Test suite nothunks-test: PASS
  16218. 1506.10 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  16219. 1506.10 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  16220. 1506.11 s [nothunks] Phase: haddockPhase
  16221. 1506.20 s [haskell-language-server] plugins/hls-class-plugin/src/Ide/Plugin/Class/Types.hs:25:1: warning: [GHC-66111] [-Wunused-imports]
  16222. 1506.20 s [haskell-language-server] The import of ‘Development.IDE.GHC.Compat.Util’ is redundant
  16223. 1506.20 s [haskell-language-server] except perhaps to import instances from ‘Development.IDE.GHC.Compat.Util’
  16224. 1506.20 s [haskell-language-server] To import instances alone, use: import Development.IDE.GHC.Compat.Util()
  16225. 1506.20 s [haskell-language-server] |
  16226. 1506.20 s [haskell-language-server] 25 | import Development.IDE.GHC.Compat.Util (bagToList)
  16227. 1506.20 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16228. 1506.20 s [haskell-language-server]
  16229. 1506.79 s [nothunks] Preprocessing library for nothunks-0.3.1...
  16230. 1506.79 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  16231. 1506.79 s [nothunks] Warning: The documentation for the following packages are not installed. No
  16232. 1506.79 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  16233. 1507.16 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing ) [HIE file is missing]
  16234. 1508.10 s [nothunks] Haddock coverage:
  16235. 1508.10 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  16236. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:230:18
  16237. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:230:1
  16238. 1508.10 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16239. 1508.10 s [nothunks] by specifying the type/value namespace explicitly.
  16240. 1508.10 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  16241. 1508.10 s [nothunks] Warning: 'GHC' is out of scope.
  16242. 1508.10 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16243. 1508.10 s [nothunks] Warning: 'a' is out of scope.
  16244. 1508.10 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16245. 1508.10 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  16246. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:334:48
  16247. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:334:1
  16248. 1508.10 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16249. 1508.10 s [nothunks] by specifying the type/value namespace explicitly.
  16250. 1508.10 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  16251. 1508.10 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  16252. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:353:25
  16253. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:353:1
  16254. 1508.10 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16255. 1508.10 s [nothunks] by specifying the type/value namespace explicitly.
  16256. 1508.10 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  16257. 1508.10 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  16258. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:358:47
  16259. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:358:1
  16260. 1508.10 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16261. 1508.10 s [nothunks] by specifying the type/value namespace explicitly.
  16262. 1508.10 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  16263. 1508.10 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  16264. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:308:27
  16265. 1508.10 s [nothunks] * at src/NoThunks/Class.hs:308:1
  16266. 1508.10 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16267. 1508.10 s [nothunks] by specifying the type/value namespace explicitly.
  16268. 1508.10 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  16269. 1508.19 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  16270. 1508.19 s [nothunks] Missing documentation for:
  16271. 1508.19 s [nothunks] Module header
  16272. 1508.99 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  16273. 1508.99 s [nothunks] - NoThunks.Class.Elem
  16274. 1508.99 s [nothunks] - NoThunks.Class.GShowTypeOf
  16275. 1508.99 s [nothunks] - NoThunks.Class.GWRecordField
  16276. 1508.99 s [nothunks] - NoThunks.Class.HasFields
  16277. 1508.99 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  16278. 1508.99 s [nothunks] - Data.Vector.Vector
  16279. 1508.99 s [nothunks] - NoThunks.Class.checkContainsThunks
  16280. 1510.02 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 )
  16281. 1510.07 s [haskell-language-server] plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs:9:1: warning: [GHC-66111] [-Wunused-imports]
  16282. 1510.07 s [haskell-language-server] The import of ‘Data.Functor.Identity’ is redundant
  16283. 1510.07 s [haskell-language-server] except perhaps to import instances from ‘Data.Functor.Identity’
  16284. 1510.07 s [haskell-language-server] To import instances alone, use: import Data.Functor.Identity()
  16285. 1510.07 s [haskell-language-server] |
  16286. 1510.07 s [haskell-language-server] 9 | import Data.Functor.Identity (Identity)
  16287. 1510.07 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16288. 1510.07 s [haskell-language-server]
  16289. 1510.38 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 )
  16290. 1510.87 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 )
  16291. 1511.51 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 )
  16292. 1516.55 s [nothunks] Documentation created: dist/doc/html/nothunks,
  16293. 1516.55 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  16294. 1517.50 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  16295. 1517.66 s [nothunks] Phase: installPhase
  16296. 1517.86 s [nothunks] Installing library in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  16297. 1518.92 s [nothunks] Phase: fixupPhase
  16298. 1519.10 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  16299. 1519.10 s [nothunks] shrinking /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSnothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl-ghc9.12.2.so
  16300. 1519.21 s [nothunks] checking for references to /build/ in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1...
  16301. 1519.23 s [nothunks] patching script interpreter paths in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  16302. 1519.23 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib
  16303. 1519.68 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc
  16304. 1519.68 s [nothunks] checking for references to /build/ in /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc...
  16305. 1519.70 s [nothunks] patching script interpreter paths in /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc
  16306. 1519.85 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  16307. 1520.32 s [nothunks:post-build] Nothing to push - all store paths are already on Cachix.
  16308. 1520.35 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  16309. 1520.42 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16310. 1520.48 s [nothunks:post-build] copying 1 paths...
  16311. 1520.48 s [nothunks:post-build] copying path '/nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  16312. 1521.33 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16313. 1521.44 s [nothunks:post-build] copying 0 paths...
  16314. 1521.47 s Progress: 18 of 33 built (1 building), 593 of 593 downloaded from cache
  16315. 1523.02 s Building /nix/store/2ivbb618b8h11ny2wdx7qjywgjg4d7kb-unordered-containers-0.2.20.1.drv
  16316. 1523.17 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  16317. 1523.20 s [unordered-containers] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  16318. 1523.45 s [unordered-containers] Phase: unpackPhase
  16319. 1523.58 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  16320. 1523.59 s [unordered-containers] source root is unordered-containers-0.2.20.1
  16321. 1523.60 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  16322. 1523.61 s [unordered-containers] Phase: patchPhase
  16323. 1523.63 s [unordered-containers] Phase: compileBuildDriverPhase
  16324. 1523.64 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.30InEiE4Hv/setup-package.conf.d -threaded
  16325. 1523.74 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.30InEiE4Hv/Main.o )
  16326. 1523.85 s [unordered-containers] [2 of 2] Linking Setup
  16327. 1524.39 s [haskell-language-server] Preprocessing library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0...
  16328. 1524.39 s [haskell-language-server] Building library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0...
  16329. 1524.62 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 )
  16330. 1526.06 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  16331. 1526.07 s [unordered-containers] Phase: configurePhase
  16332. 1526.07 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.30InEiE4Hv/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
  16333. 1526.08 s [unordered-containers] Using Parsec parser
  16334. 1526.08 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  16335. 1526.13 s [unordered-containers] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  16336. 1526.13 s [unordered-containers] 'ghc' version < 9.12):
  16337. 1526.13 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  16338. 1526.13 s [unordered-containers] 9.12.2
  16339. 1526.54 s [unordered-containers] Flags chosen: debug=False
  16340. 1527.45 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.21.0.0
  16341. 1527.45 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
  16342. 1527.45 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  16343. 1527.45 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.23.0.0
  16344. 1527.45 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  16345. 1527.45 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  16346. 1527.45 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  16347. 1527.45 s [unordered-containers] Dependency base: using base-4.21.0.0
  16348. 1527.45 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  16349. 1527.45 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  16350. 1527.45 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  16351. 1527.45 s [unordered-containers] Dependency random: using random-1.2.1.3
  16352. 1527.45 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  16353. 1527.45 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  16354. 1527.45 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  16355. 1527.45 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  16356. 1527.45 s [unordered-containers] Source component graph:
  16357. 1527.45 s [unordered-containers] component lib
  16358. 1527.45 s [unordered-containers] component test:unordered-containers-tests dependency lib
  16359. 1527.45 s [unordered-containers] Configured component graph:
  16360. 1527.45 s [unordered-containers] component unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  16361. 1527.45 s [unordered-containers] include base-4.21.0.0-b334
  16362. 1527.45 s [unordered-containers] include deepseq-1.5.1.0-3c62
  16363. 1527.45 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  16364. 1527.45 s [unordered-containers] include template-haskell-2.23.0.0-4ee9
  16365. 1527.45 s [unordered-containers] component unordered-containers-0.2.20.1-33hNwrDDYUvDIxwoJthJjL-unordered-containers-tests
  16366. 1527.45 s [unordered-containers] include ChasingBottoms-1.3.1.17-5GE1PYLkkwE5eKyEuTckWY
  16367. 1527.45 s [unordered-containers] include HUnit-1.6.2.0-3ZugMwA5Fqe3c2fSrjhIxu
  16368. 1527.45 s [unordered-containers] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  16369. 1527.45 s [unordered-containers] include base-4.21.0.0-b334
  16370. 1527.45 s [unordered-containers] include containers-0.7-d79e
  16371. 1527.45 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  16372. 1527.45 s [unordered-containers] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  16373. 1527.45 s [unordered-containers] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  16374. 1527.45 s [unordered-containers] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  16375. 1527.45 s [unordered-containers] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  16376. 1527.45 s [unordered-containers] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  16377. 1527.45 s [unordered-containers] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  16378. 1527.45 s [unordered-containers] Linked component graph:
  16379. 1527.45 s [unordered-containers] unit unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  16380. 1527.45 s [unordered-containers] include base-4.21.0.0-b334
  16381. 1527.45 s [unordered-containers] include deepseq-1.5.1.0-3c62
  16382. 1527.45 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  16383. 1527.45 s [unordered-containers] include template-haskell-2.23.0.0-4ee9
  16384. 1527.45 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashSet.Internal
  16385. 1527.45 s [unordered-containers] unit unordered-containers-0.2.20.1-33hNwrDDYUvDIxwoJthJjL-unordered-containers-tests
  16386. 1527.45 s [unordered-containers] include ChasingBottoms-1.3.1.17-5GE1PYLkkwE5eKyEuTckWY
  16387. 1527.45 s [unordered-containers] include HUnit-1.6.2.0-3ZugMwA5Fqe3c2fSrjhIxu
  16388. 1527.45 s [unordered-containers] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  16389. 1527.45 s [unordered-containers] include base-4.21.0.0-b334
  16390. 1527.45 s [unordered-containers] include containers-0.7-d79e
  16391. 1527.45 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  16392. 1527.45 s [unordered-containers] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  16393. 1527.45 s [unordered-containers] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  16394. 1527.45 s [unordered-containers] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  16395. 1527.45 s [unordered-containers] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  16396. 1527.45 s [unordered-containers] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  16397. 1527.45 s [unordered-containers] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  16398. 1527.45 s [unordered-containers] Ready component graph:
  16399. 1527.45 s [unordered-containers] definite unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  16400. 1527.45 s [unordered-containers] depends base-4.21.0.0-b334
  16401. 1527.45 s [unordered-containers] depends deepseq-1.5.1.0-3c62
  16402. 1527.45 s [unordered-containers] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  16403. 1527.45 s [unordered-containers] depends template-haskell-2.23.0.0-4ee9
  16404. 1527.45 s [unordered-containers] definite unordered-containers-0.2.20.1-33hNwrDDYUvDIxwoJthJjL-unordered-containers-tests
  16405. 1527.45 s [unordered-containers] depends ChasingBottoms-1.3.1.17-5GE1PYLkkwE5eKyEuTckWY
  16406. 1527.45 s [unordered-containers] depends HUnit-1.6.2.0-3ZugMwA5Fqe3c2fSrjhIxu
  16407. 1527.45 s [unordered-containers] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  16408. 1527.45 s [unordered-containers] depends base-4.21.0.0-b334
  16409. 1527.45 s [unordered-containers] depends containers-0.7-d79e
  16410. 1527.45 s [unordered-containers] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  16411. 1527.45 s [unordered-containers] depends nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  16412. 1527.45 s [unordered-containers] depends random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  16413. 1527.45 s [unordered-containers] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  16414. 1527.45 s [unordered-containers] depends tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  16415. 1527.45 s [unordered-containers] depends tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  16416. 1527.45 s [unordered-containers] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  16417. 1527.45 s [unordered-containers] Using Cabal-3.14.1.0 compiled by ghc-9.12
  16418. 1527.45 s [unordered-containers] Using compiler: ghc-9.12.2
  16419. 1527.45 s [unordered-containers] Using install prefix:
  16420. 1527.45 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1
  16421. 1527.45 s [unordered-containers] Executables installed in:
  16422. 1527.45 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/bin
  16423. 1527.45 s [unordered-containers] Libraries installed in:
  16424. 1527.45 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  16425. 1527.45 s [unordered-containers] Dynamic Libraries installed in:
  16426. 1527.45 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  16427. 1527.45 s [unordered-containers] Private executables installed in:
  16428. 1527.45 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1
  16429. 1527.45 s [unordered-containers] Data files installed in:
  16430. 1527.45 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1
  16431. 1527.45 s [unordered-containers] Documentation installed in:
  16432. 1527.45 s [unordered-containers] /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  16433. 1527.45 s [unordered-containers] Configuration files installed in:
  16434. 1527.45 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/etc
  16435. 1527.45 s [unordered-containers] No alex found
  16436. 1527.45 s [unordered-containers] Using ar found on system at:
  16437. 1527.45 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16438. 1527.45 s [unordered-containers] No c2hs found
  16439. 1527.45 s [unordered-containers] No cpphs found
  16440. 1527.45 s [unordered-containers] No doctest found
  16441. 1527.45 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  16442. 1527.45 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16443. 1527.45 s [unordered-containers] Using ghc version 9.12.2 found on system at:
  16444. 1527.45 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  16445. 1527.46 s [unordered-containers] Using ghc-pkg version 9.12.2 found on system at:
  16446. 1527.46 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  16447. 1527.46 s [unordered-containers] No ghcjs found
  16448. 1527.46 s [unordered-containers] No ghcjs-pkg found
  16449. 1527.46 s [unordered-containers] No greencard found
  16450. 1527.46 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  16451. 1527.46 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  16452. 1527.46 s [unordered-containers] No happy found
  16453. 1527.46 s [unordered-containers] No haskell-suite found
  16454. 1527.46 s [unordered-containers] No haskell-suite-pkg found
  16455. 1527.46 s [unordered-containers] No hmake found
  16456. 1527.46 s [unordered-containers] Using hpc version 0.69 found on system at:
  16457. 1527.46 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  16458. 1527.46 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  16459. 1527.46 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  16460. 1527.46 s [unordered-containers] Using hscolour version 1.25 found on system at:
  16461. 1527.46 s [unordered-containers] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  16462. 1527.46 s [unordered-containers] No jhc found
  16463. 1527.46 s [unordered-containers] Using ld found on system at:
  16464. 1527.46 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  16465. 1527.46 s [unordered-containers] No pkg-config found
  16466. 1527.46 s [unordered-containers] Using runghc version 9.12.2 found on system at:
  16467. 1527.46 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  16468. 1527.46 s [unordered-containers] Using strip version 2.44 found on system at:
  16469. 1527.46 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16470. 1527.46 s [unordered-containers] Using tar found on system at:
  16471. 1527.46 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16472. 1527.46 s [unordered-containers] No uhc found
  16473. 1527.73 s [unordered-containers] Phase: buildPhase
  16474. 1527.83 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  16475. 1527.85 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  16476. 1527.97 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16477. 1527.97 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16478. 1527.97 s [unordered-containers] |
  16479. 1527.97 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16480. 1527.97 s [unordered-containers] | ^^^^^^^^^^
  16481. 1527.97 s [unordered-containers]
  16482. 1528.53 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 )
  16483. 1528.72 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16484. 1528.72 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16485. 1528.72 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16486. 1528.72 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16487. 1528.72 s [unordered-containers] |
  16488. 1528.72 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16489. 1528.72 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16490. 1528.72 s [unordered-containers]
  16491. 1528.72 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  16492. 1528.72 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  16493. 1528.72 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  16494. 1528.72 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  16495. 1528.72 s [unordered-containers] |
  16496. 1528.72 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  16497. 1528.72 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16498. 1528.72 s [unordered-containers]
  16499. 1528.98 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 )
  16500. 1529.36 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 )
  16501. 1529.36 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 )
  16502. 1538.64 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 )
  16503. 1539.19 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 )
  16504. 1542.37 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 )
  16505. 1542.37 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  16506. 1542.37 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 )
  16507. 1542.37 s [haskell-language-server] Preprocessing library 'hls-eval-plugin' for haskell-language-server-2.12.0.0...
  16508. 1542.38 s [haskell-language-server] Building library 'hls-eval-plugin' for haskell-language-server-2.12.0.0...
  16509. 1542.40 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 )
  16510. 1542.66 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 )
  16511. 1542.71 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16512. 1542.71 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16513. 1542.71 s [unordered-containers] |
  16514. 1542.71 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16515. 1542.71 s [unordered-containers] | ^^^^^^^^^^
  16516. 1542.71 s [unordered-containers]
  16517. 1542.97 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  16518. 1543.14 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16519. 1543.14 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16520. 1543.14 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16521. 1543.14 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16522. 1543.14 s [unordered-containers] |
  16523. 1543.14 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16524. 1543.14 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16525. 1543.14 s [unordered-containers]
  16526. 1543.15 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  16527. 1543.15 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  16528. 1543.15 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  16529. 1543.15 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  16530. 1543.15 s [unordered-containers] |
  16531. 1543.15 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  16532. 1543.15 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16533. 1543.15 s [unordered-containers]
  16534. 1543.52 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 )
  16535. 1543.52 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 )
  16536. 1543.68 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 )
  16537. 1544.16 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  16538. 1544.16 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  16539. 1545.65 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 )
  16540. 1554.39 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 )
  16541. 1555.16 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 )
  16542. 1557.48 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  16543. 1558.38 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  16544. 1559.31 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 )
  16545. 1559.31 s [haskell-language-server] plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs:88:18: warning: [GHC-63394] [-Wx-partial]
  16546. 1559.31 s [haskell-language-server] In the use of ‘head’
  16547. 1559.31 s [haskell-language-server] (imported from Prelude, but defined in GHC.Internal.List):
  16548. 1559.31 s [haskell-language-server] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16549. 1559.31 s [haskell-language-server] |
  16550. 1559.31 s [haskell-language-server] 88 | evalPrint <- head <$> runDecls ("evalPrint x = P.writeFile " <> show temp <> " (P.show x)")
  16551. 1559.31 s [haskell-language-server] | ^^^^
  16552. 1559.31 s [haskell-language-server]
  16553. 1559.31 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 )
  16554. 1562.23 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  16555. 1562.23 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  16556. 1562.24 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  16557. 1562.44 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  16558. 1562.64 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 )
  16559. 1563.51 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 )
  16560. 1564.35 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16561. 1564.36 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16562. 1564.60 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 )
  16563. 1564.60 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 )
  16564. 1564.61 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 )
  16565. 1564.73 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 )
  16566. 1564.98 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  16567. 1564.98 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  16568. 1564.98 s [unordered-containers] In the use of ‘head’
  16569. 1564.98 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  16570. 1564.98 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16571. 1564.98 s [unordered-containers] |
  16572. 1564.98 s [unordered-containers] 93 | k = head keys
  16573. 1564.98 s [unordered-containers] | ^^^^
  16574. 1564.98 s [unordered-containers]
  16575. 1566.42 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 )
  16576. 1569.13 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 )
  16577. 1569.15 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  16578. 1569.15 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  16579. 1569.15 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  16580. 1569.15 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  16581. 1569.15 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  16582. 1569.15 s [unordered-containers] |
  16583. 1569.15 s [unordered-containers] 7 | import Data.Foldable (foldl')
  16584. 1569.15 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16585. 1569.15 s [unordered-containers]
  16586. 1569.15 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 )
  16587. 1569.15 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 )
  16588. 1578.10 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 )
  16589. 1578.14 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  16590. 1578.14 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  16591. 1578.75 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  16592. 1579.76 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 )
  16593. 1580.17 s [unordered-containers] buildPhase completed in 52 seconds
  16594. 1580.17 s [unordered-containers] Phase: checkPhase
  16595. 1580.48 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 )
  16596. 1580.53 s [unordered-containers] Running 1 test suites...
  16597. 1580.53 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  16598. 1580.54 s [unordered-containers] All
  16599. 1580.54 s [unordered-containers] Properties
  16600. 1580.54 s [unordered-containers] Data.HashMap.Lazy
  16601. 1580.54 s [unordered-containers] instances
  16602. 1580.54 s [unordered-containers] Eq
  16603. 1580.55 s [unordered-containers] ==: OK (0.01s)
  16604. 1580.55 s [unordered-containers] +++ OK, passed 100 tests.
  16605. 1580.57 s [unordered-containers] /=: OK (0.02s)
  16606. 1580.57 s [unordered-containers] +++ OK, passed 100 tests.
  16607. 1580.57 s [unordered-containers] Ord
  16608. 1580.57 s [unordered-containers] compare reflexive: OK (0.02s)
  16609. 1580.57 s [unordered-containers] +++ OK, passed 100 tests.
  16610. 1580.57 s [unordered-containers] compare transitive: OK (0.02s)
  16611. 1580.57 s [unordered-containers] +++ OK, passed 100 tests.
  16612. 1580.57 s [unordered-containers] compare antisymmetric: OK
  16613. 1580.57 s [unordered-containers] +++ OK, passed 100 tests.
  16614. 1580.57 s [unordered-containers] Ord => Eq: OK (0.02s)
  16615. 1580.57 s [unordered-containers] +++ OK, passed 100 tests.
  16616. 1580.69 s [unordered-containers] Read/Show: OK (0.12s)
  16617. 1580.69 s [unordered-containers] +++ OK, passed 100 tests.
  16618. 1580.69 s [unordered-containers] Functor: OK (0.06s)
  16619. 1580.69 s [unordered-containers] +++ OK, passed 100 tests.
  16620. 1580.69 s [unordered-containers] Foldable: OK
  16621. 1580.69 s [unordered-containers] +++ OK, passed 100 tests.
  16622. 1580.69 s [unordered-containers] Bifoldable
  16623. 1580.69 s [unordered-containers] bifoldMap: OK (0.02s)
  16624. 1580.69 s [unordered-containers] +++ OK, passed 100 tests.
  16625. 1580.69 s [unordered-containers] bifoldr: OK (0.01s)
  16626. 1580.69 s [unordered-containers] +++ OK, passed 100 tests.
  16627. 1580.69 s [unordered-containers] bifoldl: OK (0.03s)
  16628. 1580.69 s [unordered-containers] +++ OK, passed 100 tests.
  16629. 1580.69 s [unordered-containers] Hashable: OK (0.02s)
  16630. 1580.69 s [unordered-containers] +++ OK, passed 100 tests.
  16631. 1580.69 s [unordered-containers] empty
  16632. 1580.70 s [unordered-containers] valid: OK
  16633. 1580.70 s [unordered-containers] +++ OK, passed 1 test.
  16634. 1580.70 s [unordered-containers] singleton
  16635. 1580.70 s [unordered-containers] valid: OK
  16636. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16637. 1580.70 s [unordered-containers] size: OK (0.02s)
  16638. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16639. 1580.70 s [unordered-containers] member: OK (0.01s)
  16640. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16641. 1580.70 s [unordered-containers] lookup: OK (0.01s)
  16642. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16643. 1580.70 s [unordered-containers] !?: OK
  16644. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16645. 1580.70 s [unordered-containers] insert
  16646. 1580.70 s [unordered-containers] model: OK (0.02s)
  16647. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16648. 1580.70 s [unordered-containers] valid: OK (0.01s)
  16649. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16650. 1580.70 s [unordered-containers] insertWith
  16651. 1580.70 s [unordered-containers] insertWith: OK
  16652. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16653. 1580.70 s [unordered-containers] valid: OK (0.01s)
  16654. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16655. 1580.70 s [unordered-containers] delete
  16656. 1580.70 s [unordered-containers] model: OK
  16657. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16658. 1580.70 s [unordered-containers] valid: OK
  16659. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16660. 1580.70 s [unordered-containers] adjust
  16661. 1580.70 s [unordered-containers] model: OK
  16662. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16663. 1580.70 s [unordered-containers] valid: OK
  16664. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16665. 1580.70 s [unordered-containers] update
  16666. 1580.70 s [unordered-containers] model: OK (0.02s)
  16667. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16668. 1580.70 s [unordered-containers] valid: OK
  16669. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16670. 1580.70 s [unordered-containers] alter
  16671. 1580.70 s [unordered-containers] model: OK
  16672. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16673. 1580.70 s [unordered-containers] valid: OK (0.01s)
  16674. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16675. 1580.70 s [unordered-containers] alterF
  16676. 1580.70 s [unordered-containers] model
  16677. 1580.70 s [unordered-containers] []: OK (0.13s)
  16678. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16679. 1580.70 s [unordered-containers] adjust: OK (0.01s)
  16680. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16681. 1580.70 s [unordered-containers] insert: OK (0.01s)
  16682. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16683. 1580.70 s [unordered-containers] insertWith: OK
  16684. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16685. 1580.70 s [unordered-containers] delete: OK
  16686. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16687. 1580.70 s [unordered-containers] lookup: OK
  16688. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16689. 1580.70 s [unordered-containers] valid: OK
  16690. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16691. 1580.70 s [unordered-containers] isSubmapOf
  16692. 1580.70 s [unordered-containers] model: OK (0.02s)
  16693. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16694. 1580.70 s [unordered-containers] m ⊆ m: OK
  16695. 1580.70 s [unordered-containers] +++ OK, passed 100 tests.
  16696. 1580.71 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.01s)
  16697. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16698. 1580.71 s [unordered-containers] m1\m2 ⊆ m1: OK
  16699. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16700. 1580.71 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.02s)
  16701. 1580.71 s [unordered-containers] +++ OK, passed 100 tests; 169 discarded.
  16702. 1580.71 s [unordered-containers] delete k m ⊆ m: OK
  16703. 1580.71 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  16704. 1580.71 s [unordered-containers] m ⊈ delete k m : OK
  16705. 1580.71 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  16706. 1580.71 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  16707. 1580.71 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  16708. 1580.71 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  16709. 1580.71 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  16710. 1580.71 s [unordered-containers] union
  16711. 1580.71 s [unordered-containers] model: OK
  16712. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16713. 1580.71 s [unordered-containers] valid: OK (0.01s)
  16714. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16715. 1580.71 s [unordered-containers] unionWith
  16716. 1580.71 s [unordered-containers] model: OK (0.03s)
  16717. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16718. 1580.71 s [unordered-containers] valid: OK (0.01s)
  16719. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16720. 1580.71 s [unordered-containers] unionWithKey
  16721. 1580.71 s [unordered-containers] model: OK (0.05s)
  16722. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16723. 1580.71 s [unordered-containers] valid: OK
  16724. 1580.71 s [unordered-containers] +++ OK, passed 100 tests.
  16725. 1580.71 s [unordered-containers] unions
  16726. 1581.66 s [unordered-containers] model: OK (1.08s)
  16727. 1581.66 s [unordered-containers] +++ OK, passed 100 tests.
  16728. 1581.66 s [unordered-containers] valid: OK (0.50s)
  16729. 1581.66 s [unordered-containers] +++ OK, passed 100 tests.
  16730. 1581.66 s [unordered-containers] difference
  16731. 1581.66 s [unordered-containers] model: OK (0.02s)
  16732. 1581.66 s [unordered-containers] +++ OK, passed 100 tests.
  16733. 1581.66 s [unordered-containers] valid: OK
  16734. 1581.66 s [unordered-containers] +++ OK, passed 100 tests.
  16735. 1581.66 s [unordered-containers] differenceWith
  16736. 1581.66 s [unordered-containers] model: OK (0.02s)
  16737. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16738. 1581.67 s [unordered-containers] valid: OK (0.01s)
  16739. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16740. 1581.67 s [unordered-containers] intersection
  16741. 1581.67 s [unordered-containers] model: OK (0.01s)
  16742. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16743. 1581.67 s [unordered-containers] valid: OK (0.01s)
  16744. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16745. 1581.67 s [unordered-containers] intersectionWith
  16746. 1581.67 s [unordered-containers] model: OK (0.05s)
  16747. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16748. 1581.67 s [unordered-containers] valid: OK (0.02s)
  16749. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16750. 1581.67 s [unordered-containers] intersectionWithKey
  16751. 1581.67 s [unordered-containers] model: OK (0.14s)
  16752. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16753. 1581.67 s [unordered-containers] valid: OK (0.02s)
  16754. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16755. 1581.67 s [unordered-containers] compose
  16756. 1581.67 s [unordered-containers] valid: OK
  16757. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16758. 1581.67 s [unordered-containers] map
  16759. 1581.67 s [unordered-containers] model: OK (0.02s)
  16760. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16761. 1581.67 s [unordered-containers] valid: OK (0.03s)
  16762. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16763. 1581.67 s [unordered-containers] traverseWithKey
  16764. 1581.67 s [unordered-containers] model: OK (0.29s)
  16765. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16766. 1581.67 s [unordered-containers] valid: OK (0.01s)
  16767. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16768. 1581.67 s [unordered-containers] mapKeys
  16769. 1581.67 s [unordered-containers] model: OK (0.01s)
  16770. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16771. 1581.67 s [unordered-containers] valid: OK (0.39s)
  16772. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16773. 1581.67 s [unordered-containers] foldr: OK (0.01s)
  16774. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16775. 1581.67 s [unordered-containers] foldl: OK (0.02s)
  16776. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16777. 1581.67 s [unordered-containers] foldrWithKey: OK
  16778. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16779. 1581.67 s [unordered-containers] foldlWithKey: OK
  16780. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16781. 1581.67 s [unordered-containers] foldrWithKey': OK (0.01s)
  16782. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16783. 1581.67 s [unordered-containers] foldlWithKey': OK
  16784. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16785. 1581.67 s [unordered-containers] foldl': OK (0.01s)
  16786. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16787. 1581.67 s [unordered-containers] foldr': OK (0.01s)
  16788. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16789. 1581.67 s [unordered-containers] foldMapWithKey: OK (0.01s)
  16790. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16791. 1581.67 s [unordered-containers] filter
  16792. 1581.67 s [unordered-containers] model: OK (0.17s)
  16793. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16794. 1581.67 s [unordered-containers] valid: OK (0.08s)
  16795. 1581.67 s [unordered-containers] +++ OK, passed 100 tests.
  16796. 1581.67 s [unordered-containers] filterWithKey
  16797. 1582.05 s [unordered-containers] model: OK (1.42s)
  16798. 1582.05 s [unordered-containers] +++ OK, passed 100 tests.
  16799. 1582.05 s [unordered-containers] valid: OK (0.72s)
  16800. 1582.05 s [unordered-containers] +++ OK, passed 100 tests.
  16801. 1582.06 s [unordered-containers] mapMaybe
  16802. 1582.06 s [unordered-containers] model: OK (0.11s)
  16803. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16804. 1582.06 s [unordered-containers] valid: OK (0.04s)
  16805. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16806. 1582.06 s [unordered-containers] mapMaybeWithKey
  16807. 1582.06 s [unordered-containers] model: OK (1.39s)
  16808. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16809. 1582.06 s [unordered-containers] valid: OK (0.44s)
  16810. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16811. 1582.06 s [unordered-containers] elems: OK (0.05s)
  16812. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16813. 1582.06 s [unordered-containers] keys: OK (0.02s)
  16814. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16815. 1582.06 s [unordered-containers] fromList
  16816. 1582.06 s [unordered-containers] model: OK (0.01s)
  16817. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16818. 1582.06 s [unordered-containers] valid: OK (0.02s)
  16819. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16820. 1582.06 s [unordered-containers] fromListWith
  16821. 1582.06 s [unordered-containers] model: OK (0.01s)
  16822. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16823. 1582.06 s [unordered-containers] valid: OK (0.01s)
  16824. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16825. 1582.06 s [unordered-containers] fromListWithKey
  16826. 1582.06 s [unordered-containers] model: OK (0.03s)
  16827. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16828. 1582.06 s [unordered-containers] valid: OK (0.01s)
  16829. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16830. 1582.06 s [unordered-containers] toList: OK (0.02s)
  16831. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16832. 1582.06 s [unordered-containers] Data.HashMap.Strict
  16833. 1582.06 s [unordered-containers] instances
  16834. 1582.06 s [unordered-containers] Eq
  16835. 1582.06 s [unordered-containers] ==: OK (0.03s)
  16836. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16837. 1582.06 s [unordered-containers] /=: OK (0.03s)
  16838. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16839. 1582.06 s [unordered-containers] Ord
  16840. 1582.06 s [unordered-containers] compare reflexive: OK (0.04s)
  16841. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16842. 1582.06 s [unordered-containers] compare transitive: OK (0.02s)
  16843. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16844. 1582.06 s [unordered-containers] compare antisymmetric: OK (0.02s)
  16845. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16846. 1582.06 s [unordered-containers] Ord => Eq: OK (0.03s)
  16847. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16848. 1582.06 s [unordered-containers] Read/Show: OK (0.35s)
  16849. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16850. 1582.06 s [unordered-containers] Functor: OK (0.09s)
  16851. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16852. 1582.06 s [unordered-containers] Foldable: OK (0.03s)
  16853. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16854. 1582.06 s [unordered-containers] Bifoldable
  16855. 1582.06 s [unordered-containers] bifoldMap: OK (0.02s)
  16856. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16857. 1582.06 s [unordered-containers] bifoldr: OK (0.02s)
  16858. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16859. 1582.06 s [unordered-containers] bifoldl: OK (0.02s)
  16860. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16861. 1582.06 s [unordered-containers] Hashable: OK (0.03s)
  16862. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16863. 1582.06 s [unordered-containers] empty
  16864. 1582.06 s [unordered-containers] valid: OK
  16865. 1582.06 s [unordered-containers] +++ OK, passed 1 test.
  16866. 1582.06 s [unordered-containers] singleton
  16867. 1582.06 s [unordered-containers] valid: OK (0.02s)
  16868. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16869. 1582.06 s [unordered-containers] size: OK (0.02s)
  16870. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16871. 1582.06 s [unordered-containers] member: OK (0.03s)
  16872. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16873. 1582.06 s [unordered-containers] lookup: OK (0.02s)
  16874. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16875. 1582.06 s [unordered-containers] !?: OK (0.03s)
  16876. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16877. 1582.06 s [unordered-containers] insert
  16878. 1582.06 s [unordered-containers] model: OK (0.03s)
  16879. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16880. 1582.06 s [unordered-containers] valid: OK (0.02s)
  16881. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16882. 1582.06 s [unordered-containers] insertWith
  16883. 1582.06 s [unordered-containers] insertWith: OK (0.01s)
  16884. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16885. 1582.06 s [unordered-containers] valid: OK (0.02s)
  16886. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16887. 1582.06 s [unordered-containers] delete
  16888. 1582.06 s [unordered-containers] model: OK (0.02s)
  16889. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16890. 1582.06 s [unordered-containers] valid: OK (0.01s)
  16891. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16892. 1582.06 s [unordered-containers] adjust
  16893. 1582.06 s [unordered-containers] model: OK (0.02s)
  16894. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16895. 1582.06 s [unordered-containers] valid: OK (0.02s)
  16896. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16897. 1582.06 s [unordered-containers] update
  16898. 1582.06 s [unordered-containers] model: OK (0.03s)
  16899. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16900. 1582.06 s [unordered-containers] valid: OK (0.02s)
  16901. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16902. 1582.06 s [unordered-containers] alter
  16903. 1582.06 s [unordered-containers] model: OK (0.03s)
  16904. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16905. 1582.06 s [unordered-containers] valid: OK (0.01s)
  16906. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16907. 1582.06 s [unordered-containers] alterF
  16908. 1582.06 s [unordered-containers] model
  16909. 1582.06 s [unordered-containers] []: OK (0.11s)
  16910. 1582.06 s [unordered-containers] +++ OK, passed 100 tests.
  16911. 1582.06 s [unordered-containers] adjust: OK (0.02s)
  16912. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16913. 1582.07 s [unordered-containers] insert: OK (0.02s)
  16914. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16915. 1582.07 s [unordered-containers] insertWith: OK (0.01s)
  16916. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16917. 1582.07 s [unordered-containers] delete: OK (0.02s)
  16918. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16919. 1582.07 s [unordered-containers] lookup: OK (0.02s)
  16920. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16921. 1582.07 s [unordered-containers] valid: OK (0.05s)
  16922. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16923. 1582.07 s [unordered-containers] isSubmapOf
  16924. 1582.07 s [unordered-containers] model: OK (0.03s)
  16925. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16926. 1582.07 s [unordered-containers] m ⊆ m: OK (0.02s)
  16927. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16928. 1582.07 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.02s)
  16929. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16930. 1582.07 s [unordered-containers] m1\m2 ⊆ m1: OK (0.03s)
  16931. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16932. 1582.07 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  16933. 1582.07 s [unordered-containers] +++ OK, passed 100 tests; 195 discarded.
  16934. 1582.07 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  16935. 1582.07 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  16936. 1582.07 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  16937. 1582.07 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  16938. 1582.07 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.01s)
  16939. 1582.07 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  16940. 1582.07 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  16941. 1582.07 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  16942. 1582.07 s [unordered-containers] union
  16943. 1582.07 s [unordered-containers] model: OK (0.07s)
  16944. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16945. 1582.07 s [unordered-containers] valid: OK (0.02s)
  16946. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16947. 1582.07 s [unordered-containers] unionWith
  16948. 1582.07 s [unordered-containers] model: OK (0.11s)
  16949. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16950. 1582.07 s [unordered-containers] valid: OK (0.10s)
  16951. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16952. 1582.07 s [unordered-containers] unionWithKey
  16953. 1582.07 s [unordered-containers] model: OK (0.08s)
  16954. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16955. 1582.07 s [unordered-containers] valid: OK (0.07s)
  16956. 1582.07 s [unordered-containers] +++ OK, passed 100 tests.
  16957. 1582.07 s [unordered-containers] unions
  16958. 1582.16 s [unordered-containers] model: OK (1.24s)
  16959. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16960. 1582.16 s [unordered-containers] valid: OK (0.78s)
  16961. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16962. 1582.16 s [unordered-containers] difference
  16963. 1582.16 s [unordered-containers] model: OK (0.04s)
  16964. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16965. 1582.16 s [unordered-containers] valid: OK (0.03s)
  16966. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16967. 1582.16 s [unordered-containers] differenceWith
  16968. 1582.16 s [unordered-containers] model: OK (0.09s)
  16969. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16970. 1582.16 s [unordered-containers] valid: OK (0.05s)
  16971. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16972. 1582.16 s [unordered-containers] intersection
  16973. 1582.16 s [unordered-containers] model: OK (0.04s)
  16974. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16975. 1582.16 s [unordered-containers] valid: OK (0.05s)
  16976. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16977. 1582.16 s [unordered-containers] intersectionWith
  16978. 1582.16 s [unordered-containers] model: OK (0.10s)
  16979. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16980. 1582.16 s [unordered-containers] valid: OK (0.06s)
  16981. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16982. 1582.16 s [unordered-containers] intersectionWithKey
  16983. 1582.16 s [unordered-containers] model: OK (0.16s)
  16984. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16985. 1582.16 s [unordered-containers] valid: OK (0.09s)
  16986. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16987. 1582.16 s [unordered-containers] compose
  16988. 1582.16 s [unordered-containers] valid: OK (0.07s)
  16989. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16990. 1582.16 s [unordered-containers] map
  16991. 1582.16 s [unordered-containers] model: OK (0.12s)
  16992. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16993. 1582.16 s [unordered-containers] valid: OK (0.06s)
  16994. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16995. 1582.16 s [unordered-containers] traverseWithKey
  16996. 1582.16 s [unordered-containers] model: OK (0.37s)
  16997. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  16998. 1582.16 s [unordered-containers] valid: OK (0.04s)
  16999. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  17000. 1582.16 s [unordered-containers] mapKeys
  17001. 1582.16 s [unordered-containers] model: OK (0.03s)
  17002. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  17003. 1582.16 s [unordered-containers] valid: OK (0.64s)
  17004. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  17005. 1582.16 s [unordered-containers] foldr: OK (0.02s)
  17006. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  17007. 1582.16 s [unordered-containers] foldl: OK (0.03s)
  17008. 1582.16 s [unordered-containers] +++ OK, passed 100 tests.
  17009. 1582.16 s [unordered-containers] foldrWithKey: OK (0.03s)
  17010. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17011. 1582.17 s [unordered-containers] foldlWithKey: OK (0.05s)
  17012. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17013. 1582.17 s [unordered-containers] foldrWithKey': OK (0.01s)
  17014. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17015. 1582.17 s [unordered-containers] foldlWithKey': OK (0.03s)
  17016. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17017. 1582.17 s [unordered-containers] foldl': OK (0.04s)
  17018. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17019. 1582.17 s [unordered-containers] foldr': OK (0.03s)
  17020. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17021. 1582.17 s [unordered-containers] foldMapWithKey: OK (0.02s)
  17022. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17023. 1582.17 s [unordered-containers] filter
  17024. 1582.17 s [unordered-containers] model: OK (0.10s)
  17025. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17026. 1582.17 s [unordered-containers] valid: OK (0.05s)
  17027. 1582.17 s [unordered-containers] +++ OK, passed 100 tests.
  17028. 1582.17 s [unordered-containers] filterWithKey
  17029. 1582.34 s [unordered-containers] model: OK (1.20s)
  17030. 1582.34 s [unordered-containers] +++ OK, passed 100 tests.
  17031. 1582.34 s [unordered-containers] valid: OK (0.69s)
  17032. 1582.34 s [unordered-containers] +++ OK, passed 100 tests.
  17033. 1582.34 s [unordered-containers] mapMaybe
  17034. 1582.34 s [unordered-containers] model: OK (0.08s)
  17035. 1582.34 s [unordered-containers] +++ OK, passed 100 tests.
  17036. 1582.34 s [unordered-containers] valid: OK (0.07s)
  17037. 1582.34 s [unordered-containers] +++ OK, passed 100 tests.
  17038. 1582.34 s [unordered-containers] mapMaybeWithKey
  17039. 1582.36 s [unordered-containers] model: OK (1.18s)
  17040. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17041. 1582.36 s [unordered-containers] valid: OK (0.84s)
  17042. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17043. 1582.36 s [unordered-containers] elems: OK (0.03s)
  17044. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17045. 1582.36 s [unordered-containers] keys: OK (0.03s)
  17046. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17047. 1582.36 s [unordered-containers] fromList
  17048. 1582.36 s [unordered-containers] model: OK (0.03s)
  17049. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17050. 1582.36 s [unordered-containers] valid: OK (0.02s)
  17051. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17052. 1582.36 s [unordered-containers] fromListWith
  17053. 1582.36 s [unordered-containers] model: OK (0.01s)
  17054. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17055. 1582.36 s [unordered-containers] valid: OK (0.02s)
  17056. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17057. 1582.36 s [unordered-containers] fromListWithKey
  17058. 1582.36 s [unordered-containers] model: OK (0.07s)
  17059. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17060. 1582.36 s [unordered-containers] valid: OK (0.17s)
  17061. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17062. 1582.36 s [unordered-containers] toList: OK (0.02s)
  17063. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17064. 1582.36 s [unordered-containers] Data.HashSet
  17065. 1582.36 s [unordered-containers] instances
  17066. 1582.36 s [unordered-containers] Eq
  17067. 1582.36 s [unordered-containers] ==: OK (0.04s)
  17068. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17069. 1582.36 s [unordered-containers] == permutations: OK (0.01s)
  17070. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17071. 1582.36 s [unordered-containers] /=: OK (0.05s)
  17072. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17073. 1582.36 s [unordered-containers] Ord
  17074. 1582.36 s [unordered-containers] compare reflexive: OK (0.01s)
  17075. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17076. 1582.36 s [unordered-containers] compare transitive: OK (0.05s)
  17077. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17078. 1582.36 s [unordered-containers] compare antisymmetric: OK (0.03s)
  17079. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17080. 1582.36 s [unordered-containers] Ord => Eq: OK (0.05s)
  17081. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17082. 1582.36 s [unordered-containers] Read/Show: OK (0.37s)
  17083. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17084. 1582.36 s [unordered-containers] Foldable: OK (0.04s)
  17085. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17086. 1582.36 s [unordered-containers] Hashable: OK (0.04s)
  17087. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17088. 1582.36 s [unordered-containers] size: OK (0.01s)
  17089. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17090. 1582.36 s [unordered-containers] member: OK (0.02s)
  17091. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17092. 1582.36 s [unordered-containers] insert: OK (0.03s)
  17093. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17094. 1582.36 s [unordered-containers] delete: OK (0.03s)
  17095. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17096. 1582.36 s [unordered-containers] union: OK (0.07s)
  17097. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17098. 1582.36 s [unordered-containers] map: OK (0.90s)
  17099. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17100. 1582.36 s [unordered-containers] foldr: OK (0.03s)
  17101. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17102. 1582.36 s [unordered-containers] foldl': OK (0.02s)
  17103. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17104. 1582.36 s [unordered-containers] filter: OK (0.86s)
  17105. 1582.36 s [unordered-containers] +++ OK, passed 100 tests.
  17106. 1582.37 s [unordered-containers] toList: OK
  17107. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17108. 1582.37 s [unordered-containers] Data.HashMap.Internal.List
  17109. 1582.37 s [unordered-containers] isPermutationBy: OK (0.01s)
  17110. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17111. 1582.37 s [unordered-containers] isPermutationBy of different length: OK
  17112. 1582.37 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17113. 1582.37 s [unordered-containers] pUnorderedCompare: OK (0.07s)
  17114. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17115. 1582.37 s [unordered-containers] modelUnorderedCompare
  17116. 1582.37 s [unordered-containers] reflexive: OK (0.01s)
  17117. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17118. 1582.37 s [unordered-containers] anti-symmetric: OK (0.01s)
  17119. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17120. 1582.37 s [unordered-containers] transitive: OK (0.03s)
  17121. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17122. 1582.37 s [unordered-containers] Regression tests
  17123. 1582.37 s [unordered-containers] issue32: OK
  17124. 1582.37 s [unordered-containers] issue39a: OK
  17125. 1582.37 s [unordered-containers] issue39b: OK (0.03s)
  17126. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17127. 1582.37 s [unordered-containers] issue254 lazy: OK
  17128. 1582.37 s [unordered-containers] issue254 strict: OK
  17129. 1582.37 s [unordered-containers] issue379
  17130. 1582.37 s [unordered-containers] Lazy.unionWith: OK
  17131. 1582.37 s [unordered-containers] union: OK
  17132. 1582.37 s [unordered-containers] Strict.unionWith: OK
  17133. 1582.37 s [unordered-containers] Strict.unionWithKey: OK
  17134. 1582.37 s [unordered-containers] issue381
  17135. 1582.37 s [unordered-containers] mapMaybe: OK
  17136. 1582.37 s [unordered-containers] mapMaybeWithKey: OK
  17137. 1582.37 s [unordered-containers] issue382: OK
  17138. 1582.37 s [unordered-containers] issue383: OK
  17139. 1582.37 s [unordered-containers] issue420: OK
  17140. 1582.37 s [unordered-containers] issue491
  17141. 1582.37 s [unordered-containers] 1: OK
  17142. 1582.37 s [unordered-containers] 2: OK
  17143. 1582.37 s [unordered-containers] 3: OK
  17144. 1582.37 s [unordered-containers] Strictness
  17145. 1582.37 s [unordered-containers] HashMap.Strict
  17146. 1582.37 s [unordered-containers] singleton is key-strict: OK
  17147. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17148. 1582.37 s [unordered-containers] singleton is value-strict: OK (0.02s)
  17149. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17150. 1582.37 s [unordered-containers] member is key-strict: OK
  17151. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17152. 1582.37 s [unordered-containers] lookup is key-strict: OK
  17153. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17154. 1582.37 s [unordered-containers] lookupDefault is key-strict: OK
  17155. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17156. 1582.37 s [unordered-containers] findWithDefault is key-strict: OK
  17157. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17158. 1582.37 s [unordered-containers] ! is key-strict: OK
  17159. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17160. 1582.37 s [unordered-containers] delete is key-strict: OK
  17161. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17162. 1582.37 s [unordered-containers] adjust is key-strict: OK
  17163. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17164. 1582.37 s [unordered-containers] adjust is value-strict: OK (0.02s)
  17165. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17166. 1582.37 s [unordered-containers] insert is key-strict: OK
  17167. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17168. 1582.37 s [unordered-containers] insert is value-strict: OK
  17169. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17170. 1582.37 s [unordered-containers] insertWith is key-strict: OK
  17171. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17172. 1582.37 s [unordered-containers] insertWith is value-strict: OK (0.02s)
  17173. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17174. 1582.37 s [unordered-containers] fromList is key-strict: OK
  17175. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17176. 1582.37 s [unordered-containers] fromList is value-strict: OK
  17177. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17178. 1582.37 s [unordered-containers] fromListWith is key-strict: OK
  17179. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17180. 1582.37 s [unordered-containers] fromListWith is value-strict: OK
  17181. 1582.37 s [unordered-containers] +++ OK, passed 100 tests.
  17182. 1582.37 s [unordered-containers]
  17183. 1582.37 s [unordered-containers] All 257 tests passed (1.82s)
  17184. 1582.38 s [unordered-containers] Test suite unordered-containers-tests: PASS
  17185. 1582.38 s [unordered-containers] Test suite logged to:
  17186. 1582.38 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  17187. 1582.38 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  17188. 1582.39 s [unordered-containers] Phase: haddockPhase
  17189. 1583.03 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  17190. 1583.03 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  17191. 1583.39 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  17192. 1583.45 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17193. 1583.46 s [unordered-containers] |
  17194. 1583.46 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17195. 1583.46 s [unordered-containers] | ^^^^^^^^^^
  17196. 1583.46 s [unordered-containers]
  17197. 1583.59 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing ) [Flags changed]
  17198. 1583.97 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  17199. 1583.97 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17200. 1583.97 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17201. 1583.97 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17202. 1583.97 s [unordered-containers] |
  17203. 1583.97 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17204. 1583.97 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17205. 1583.97 s [unordered-containers]
  17206. 1583.97 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  17207. 1583.97 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  17208. 1583.97 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  17209. 1583.97 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  17210. 1583.97 s [unordered-containers] |
  17211. 1583.97 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  17212. 1583.97 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  17213. 1583.97 s [unordered-containers]
  17214. 1583.97 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing ) [Flags changed]
  17215. 1584.00 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing ) [Flags changed]
  17216. 1584.18 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 )
  17217. 1584.18 s [haskell-language-server] plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs:88:18: warning: [GHC-63394] [-Wx-partial]
  17218. 1584.18 s [haskell-language-server] In the use of ‘head’
  17219. 1584.18 s [haskell-language-server] (imported from Prelude, but defined in GHC.Internal.List):
  17220. 1584.18 s [haskell-language-server] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  17221. 1584.18 s [haskell-language-server] |
  17222. 1584.18 s [haskell-language-server] 88 | evalPrint <- head <$> runDecls ("evalPrint x = P.writeFile " <> show temp <> " (P.show x)")
  17223. 1584.18 s [haskell-language-server] | ^^^^
  17224. 1584.18 s [haskell-language-server]
  17225. 1584.18 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 )
  17226. 1585.45 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing ) [Flags changed]
  17227. 1585.51 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing ) [Flags changed]
  17228. 1585.88 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing ) [Flags changed]
  17229. 1586.08 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing ) [Flags changed]
  17230. 1586.09 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing ) [Flags changed]
  17231. 1586.10 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing ) [Flags changed]
  17232. 1586.11 s [unordered-containers] Haddock coverage:
  17233. 1586.27 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  17234. 1586.27 s [unordered-containers] Missing documentation for:
  17235. 1586.27 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  17236. 1586.27 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  17237. 1586.27 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  17238. 1586.27 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  17239. 1586.27 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  17240. 1586.27 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  17241. 1586.27 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  17242. 1586.27 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  17243. 1586.27 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  17244. 1586.27 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  17245. 1586.27 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  17246. 1586.27 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  17247. 1586.27 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  17248. 1586.27 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  17249. 1586.27 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  17250. 1586.27 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  17251. 1586.27 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  17252. 1586.27 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  17253. 1586.27 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  17254. 1586.27 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  17255. 1586.27 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  17256. 1586.27 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  17257. 1586.27 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  17258. 1586.27 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  17259. 1586.27 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  17260. 1586.27 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  17261. 1586.27 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  17262. 1586.27 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  17263. 1586.27 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  17264. 1586.27 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  17265. 1586.27 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  17266. 1586.27 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  17267. 1586.27 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  17268. 1586.27 s [unordered-containers] Missing documentation for:
  17269. 1586.27 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  17270. 1586.27 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  17271. 1586.27 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  17272. 1586.27 s [unordered-containers] Warning: 'at' is out of scope.
  17273. 1586.27 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17274. 1586.27 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  17275. 1586.27 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  17276. 1586.27 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  17277. 1586.27 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17278. 1586.27 s [unordered-containers] by specifying the type/value namespace explicitly.
  17279. 1586.27 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  17280. 1586.29 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  17281. 1586.29 s [unordered-containers] Missing documentation for:
  17282. 1586.29 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  17283. 1586.29 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  17284. 1586.29 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  17285. 1586.29 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  17286. 1586.29 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  17287. 1586.29 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  17288. 1586.29 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  17289. 1586.29 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  17290. 1586.29 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  17291. 1586.29 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  17292. 1586.29 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  17293. 1586.29 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  17294. 1586.29 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  17295. 1586.29 s [unordered-containers] Missing documentation for:
  17296. 1586.29 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  17297. 1586.29 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  17298. 1586.29 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  17299. 1586.29 s [unordered-containers] Warning: 'lookup' is out of scope.
  17300. 1586.29 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17301. 1586.29 s [unordered-containers] Warning: 'at' is out of scope.
  17302. 1586.29 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17303. 1586.29 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  17304. 1586.29 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17305. 1586.29 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17306. 1586.29 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17307. 1586.29 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17308. 1586.29 s [unordered-containers] by specifying the type/value namespace explicitly.
  17309. 1586.29 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17310. 1586.30 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  17311. 1586.30 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17312. 1586.30 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17313. 1586.30 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17314. 1586.30 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17315. 1586.30 s [unordered-containers] by specifying the type/value namespace explicitly.
  17316. 1586.30 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17317. 1586.30 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  17318. 1586.30 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  17319. 1586.30 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  17320. 1586.45 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 )
  17321. 1586.64 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  17322. 1586.64 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17323. 1586.64 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  17324. 1586.64 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17325. 1586.65 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  17326. 1586.65 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17327. 1586.65 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  17328. 1586.65 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17329. 1586.65 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  17330. 1586.65 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17331. 1586.66 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  17332. 1586.66 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17333. 1592.69 s Waiting for lock on pandoc-cli
  17334. 1593.73 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers,
  17335. 1593.73 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  17336. 1594.67 s [haskell-language-server] Preprocessing library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0...
  17337. 1594.67 s [haskell-language-server] Building library 'hls-explicit-record-fields-plugin' for haskell-language-server-2.12.0.0...
  17338. 1594.75 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  17339. 1594.83 s [unordered-containers] Phase: installPhase
  17340. 1594.85 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 )
  17341. 1594.96 s [unordered-containers] Installing library in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  17342. 1595.46 s [unordered-containers] Phase: fixupPhase
  17343. 1595.49 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1
  17344. 1595.50 s [unordered-containers] shrinking /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSunordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF-ghc9.12.2.so
  17345. 1595.50 s [unordered-containers] checking for references to /build/ in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1...
  17346. 1595.53 s [unordered-containers] patching script interpreter paths in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1
  17347. 1595.54 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib
  17348. 1595.69 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  17349. 1595.70 s [unordered-containers] checking for references to /build/ in /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc...
  17350. 1595.72 s [unordered-containers] patching script interpreter paths in /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  17351. 1595.90 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1 /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  17352. 1596.39 s [unordered-containers:post-build] Nothing to push - all store paths are already on Cachix.
  17353. 1596.41 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1 /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  17354. 1596.46 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17355. 1596.57 s [unordered-containers:post-build] copying 1 paths...
  17356. 1596.57 s [unordered-containers:post-build] copying path '/nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  17357. 1600.00 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17358. 1600.08 s [unordered-containers:post-build] copying 0 paths...
  17359. 1600.10 s Progress: 19 of 31 built (1 building), 593 of 593 downloaded from cache
  17360. 1600.18 s Building /nix/store/hfkq61j8kik6qx530limn8vwv0l9ch00-quickcheck-instances-0.3.33.drv
  17361. 1600.18 s [haskell-language-server] plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs:52:1: warning: [GHC-38856] [-Wunused-imports]
  17362. 1600.18 s [haskell-language-server] The import of ‘HsWrap, HsWrap’
  17363. 1600.18 s [haskell-language-server] from module ‘Development.IDE.GHC.Compat’ is redundant
  17364. 1600.18 s [haskell-language-server] |
  17365. 1600.18 s [haskell-language-server] 52 | import Development.IDE.GHC.Compat (FieldLabel (flSelector),
  17366. 1600.18 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  17367. 1600.18 s [haskell-language-server]
  17368. 1600.18 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 )
  17369. 1600.35 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  17370. 1600.35 s [quickcheck-instances] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  17371. 1600.59 s [quickcheck-instances] Phase: unpackPhase
  17372. 1600.59 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  17373. 1600.60 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  17374. 1600.61 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  17375. 1600.61 s [quickcheck-instances] Phase: patchPhase
  17376. 1600.62 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  17377. 1600.63 s [quickcheck-instances] Phase: compileBuildDriverPhase
  17378. 1600.63 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.hDGN7var5c/setup-package.conf.d -threaded
  17379. 1600.69 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.hDGN7var5c/Main.o )
  17380. 1600.76 s [quickcheck-instances] [2 of 2] Linking Setup
  17381. 1601.42 s [haskell-language-server] plugins/hls-explicit-record-fields-plugin/src/Ide/Plugin/ExplicitFields.hs:52:1: warning: [GHC-38856] [-Wunused-imports]
  17382. 1601.42 s [haskell-language-server] The import of ‘HsWrap, HsWrap’
  17383. 1601.42 s [haskell-language-server] from module ‘Development.IDE.GHC.Compat’ is redundant
  17384. 1601.42 s [haskell-language-server] |
  17385. 1601.42 s [haskell-language-server] 52 | import Development.IDE.GHC.Compat (FieldLabel (flSelector),
  17386. 1601.42 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  17387. 1601.42 s [haskell-language-server]
  17388. 1602.48 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  17389. 1602.50 s [quickcheck-instances] Phase: configurePhase
  17390. 1602.50 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.hDGN7var5c/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
  17391. 1602.51 s [quickcheck-instances] Using Parsec parser
  17392. 1602.51 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  17393. 1602.56 s [quickcheck-instances] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  17394. 1602.56 s [quickcheck-instances] 'ghc' version < 9.12):
  17395. 1602.56 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  17396. 1602.56 s [quickcheck-instances] 9.12.2
  17397. 1603.20 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  17398. 1603.20 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  17399. 1603.20 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  17400. 1603.20 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.21.0.0
  17401. 1603.20 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  17402. 1603.20 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  17403. 1603.20 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  17404. 1603.20 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  17405. 1603.20 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  17406. 1603.20 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  17407. 1603.20 s [quickcheck-instances] integer-logarithms-1.0.4
  17408. 1603.20 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  17409. 1603.20 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  17410. 1603.20 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  17411. 1603.20 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  17412. 1603.20 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  17413. 1603.20 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  17414. 1603.20 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
  17415. 1603.20 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  17416. 1603.20 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  17417. 1603.20 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  17418. 1603.20 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.2
  17419. 1603.20 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  17420. 1603.20 s [quickcheck-instances] unordered-containers-0.2.20.1
  17421. 1603.20 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  17422. 1603.20 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  17423. 1603.20 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  17424. 1603.20 s [quickcheck-instances] Dependency base: using base-4.21.0.0
  17425. 1603.20 s [quickcheck-instances] Dependency containers: using containers-0.7
  17426. 1603.20 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  17427. 1603.20 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  17428. 1603.20 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  17429. 1603.20 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  17430. 1603.20 s [quickcheck-instances] Source component graph:
  17431. 1603.20 s [quickcheck-instances] component lib
  17432. 1603.20 s [quickcheck-instances] component test:self-test dependency lib
  17433. 1603.20 s [quickcheck-instances] Configured component graph:
  17434. 1603.20 s [quickcheck-instances] component quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17435. 1603.20 s [quickcheck-instances] include OneTuple-0.4.2-9yUF7jGnYxaAECoDfDC9gZ
  17436. 1603.20 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17437. 1603.20 s [quickcheck-instances] include array-0.5.8.0-d6d4
  17438. 1603.20 s [quickcheck-instances] include base-4.21.0.0-b334
  17439. 1603.20 s [quickcheck-instances] include bytestring-0.12.2.0-0cf8
  17440. 1603.20 s [quickcheck-instances] include case-insensitive-1.2.1.0-D0PevEiW49I9bqJrOtUHkS
  17441. 1603.20 s [quickcheck-instances] include containers-0.7-d79e
  17442. 1603.20 s [quickcheck-instances] include data-fix-0.3.4-LXjketSEK22HJBNry0yp7m
  17443. 1603.20 s [quickcheck-instances] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  17444. 1603.20 s [quickcheck-instances] include integer-logarithms-1.0.4-CGEBnVdocb1FsiJy43VXnU
  17445. 1603.20 s [quickcheck-instances] include old-time-1.1.0.4-4mhjMFh8CF1AsdPcX1m5yD
  17446. 1603.20 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  17447. 1603.20 s [quickcheck-instances] include scientific-0.3.8.0-Hj5LPtVmr86Dete6DVIqoE
  17448. 1603.20 s [quickcheck-instances] include splitmix-0.1.3.1-7dKiUNzaWtvEJHSk7DLUx
  17449. 1603.20 s [quickcheck-instances] include strict-0.5.1-FibWDv1dbC3CqfeTsaTydO
  17450. 1603.20 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  17451. 1603.20 s [quickcheck-instances] include text-2.1.2-e822
  17452. 1603.20 s [quickcheck-instances] include text-short-0.1.6-A5U4MHwbAcn3oDMToCfxcX
  17453. 1603.20 s [quickcheck-instances] include these-1.2.1-75zmMVeYMwmCe5t578HOX6
  17454. 1603.20 s [quickcheck-instances] include time-compat-1.9.8-586fbicX6a7IyVf7sZmFEK
  17455. 1603.20 s [quickcheck-instances] include transformers-0.6.1.2-2558
  17456. 1603.20 s [quickcheck-instances] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  17457. 1603.20 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  17458. 1603.20 s [quickcheck-instances] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  17459. 1603.20 s [quickcheck-instances] component quickcheck-instances-0.3.33-AnqMYWA5uZpHQqiCilE1uL-self-test
  17460. 1603.20 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17461. 1603.20 s [quickcheck-instances] include base-4.21.0.0-b334
  17462. 1603.20 s [quickcheck-instances] include containers-0.7-d79e
  17463. 1603.20 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  17464. 1603.20 s [quickcheck-instances] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17465. 1603.20 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  17466. 1603.20 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  17467. 1603.20 s [quickcheck-instances] Linked component graph:
  17468. 1603.20 s [quickcheck-instances] unit quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17469. 1603.20 s [quickcheck-instances] include OneTuple-0.4.2-9yUF7jGnYxaAECoDfDC9gZ
  17470. 1603.20 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17471. 1603.20 s [quickcheck-instances] include array-0.5.8.0-d6d4
  17472. 1603.20 s [quickcheck-instances] include base-4.21.0.0-b334
  17473. 1603.20 s [quickcheck-instances] include bytestring-0.12.2.0-0cf8
  17474. 1603.20 s [quickcheck-instances] include case-insensitive-1.2.1.0-D0PevEiW49I9bqJrOtUHkS
  17475. 1603.20 s [quickcheck-instances] include containers-0.7-d79e
  17476. 1603.20 s [quickcheck-instances] include data-fix-0.3.4-LXjketSEK22HJBNry0yp7m
  17477. 1603.20 s [quickcheck-instances] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  17478. 1603.20 s [quickcheck-instances] include integer-logarithms-1.0.4-CGEBnVdocb1FsiJy43VXnU
  17479. 1603.20 s [quickcheck-instances] include old-time-1.1.0.4-4mhjMFh8CF1AsdPcX1m5yD
  17480. 1603.20 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  17481. 1603.20 s [quickcheck-instances] include scientific-0.3.8.0-Hj5LPtVmr86Dete6DVIqoE
  17482. 1603.20 s [quickcheck-instances] include splitmix-0.1.3.1-7dKiUNzaWtvEJHSk7DLUx
  17483. 1603.20 s [quickcheck-instances] include strict-0.5.1-FibWDv1dbC3CqfeTsaTydO
  17484. 1603.20 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  17485. 1603.20 s [quickcheck-instances] include text-2.1.2-e822
  17486. 1603.20 s [quickcheck-instances] include text-short-0.1.6-A5U4MHwbAcn3oDMToCfxcX
  17487. 1603.20 s [quickcheck-instances] include these-1.2.1-75zmMVeYMwmCe5t578HOX6
  17488. 1603.20 s [quickcheck-instances] include time-compat-1.9.8-586fbicX6a7IyVf7sZmFEK
  17489. 1603.20 s [quickcheck-instances] include transformers-0.6.1.2-2558
  17490. 1603.20 s [quickcheck-instances] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  17491. 1603.20 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  17492. 1603.20 s [quickcheck-instances] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  17493. 1603.20 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Void
  17494. 1603.20 s [quickcheck-instances] unit quickcheck-instances-0.3.33-AnqMYWA5uZpHQqiCilE1uL-self-test
  17495. 1603.20 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17496. 1603.22 s [quickcheck-instances] include base-4.21.0.0-b334
  17497. 1603.22 s [quickcheck-instances] include containers-0.7-d79e
  17498. 1603.22 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  17499. 1603.22 s [quickcheck-instances] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17500. 1603.22 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  17501. 1603.22 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  17502. 1603.22 s [quickcheck-instances] Ready component graph:
  17503. 1603.22 s [quickcheck-instances] definite quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17504. 1603.22 s [quickcheck-instances] depends OneTuple-0.4.2-9yUF7jGnYxaAECoDfDC9gZ
  17505. 1603.22 s [quickcheck-instances] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17506. 1603.22 s [quickcheck-instances] depends array-0.5.8.0-d6d4
  17507. 1603.22 s [quickcheck-instances] depends base-4.21.0.0-b334
  17508. 1603.22 s [quickcheck-instances] depends bytestring-0.12.2.0-0cf8
  17509. 1603.22 s [quickcheck-instances] depends case-insensitive-1.2.1.0-D0PevEiW49I9bqJrOtUHkS
  17510. 1603.22 s [quickcheck-instances] depends containers-0.7-d79e
  17511. 1603.22 s [quickcheck-instances] depends data-fix-0.3.4-LXjketSEK22HJBNry0yp7m
  17512. 1603.22 s [quickcheck-instances] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  17513. 1603.22 s [quickcheck-instances] depends integer-logarithms-1.0.4-CGEBnVdocb1FsiJy43VXnU
  17514. 1603.22 s [quickcheck-instances] depends old-time-1.1.0.4-4mhjMFh8CF1AsdPcX1m5yD
  17515. 1603.22 s [quickcheck-instances] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  17516. 1603.22 s [quickcheck-instances] depends scientific-0.3.8.0-Hj5LPtVmr86Dete6DVIqoE
  17517. 1603.22 s [quickcheck-instances] depends splitmix-0.1.3.1-7dKiUNzaWtvEJHSk7DLUx
  17518. 1603.22 s [quickcheck-instances] depends strict-0.5.1-FibWDv1dbC3CqfeTsaTydO
  17519. 1603.22 s [quickcheck-instances] depends tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  17520. 1603.22 s [quickcheck-instances] depends text-2.1.2-e822
  17521. 1603.22 s [quickcheck-instances] depends text-short-0.1.6-A5U4MHwbAcn3oDMToCfxcX
  17522. 1603.22 s [quickcheck-instances] depends these-1.2.1-75zmMVeYMwmCe5t578HOX6
  17523. 1603.22 s [quickcheck-instances] depends time-compat-1.9.8-586fbicX6a7IyVf7sZmFEK
  17524. 1603.22 s [quickcheck-instances] depends transformers-0.6.1.2-2558
  17525. 1603.22 s [quickcheck-instances] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  17526. 1603.22 s [quickcheck-instances] depends uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  17527. 1603.22 s [quickcheck-instances] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  17528. 1603.22 s [quickcheck-instances] definite quickcheck-instances-0.3.33-AnqMYWA5uZpHQqiCilE1uL-self-test
  17529. 1603.22 s [quickcheck-instances] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17530. 1603.22 s [quickcheck-instances] depends base-4.21.0.0-b334
  17531. 1603.22 s [quickcheck-instances] depends containers-0.7-d79e
  17532. 1603.22 s [quickcheck-instances] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  17533. 1603.22 s [quickcheck-instances] depends quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17534. 1603.22 s [quickcheck-instances] depends tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  17535. 1603.22 s [quickcheck-instances] depends uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  17536. 1603.22 s [quickcheck-instances] Using Cabal-3.14.1.0 compiled by ghc-9.12
  17537. 1603.22 s [quickcheck-instances] Using compiler: ghc-9.12.2
  17538. 1603.22 s [quickcheck-instances] Using install prefix:
  17539. 1603.22 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33
  17540. 1603.22 s [quickcheck-instances] Executables installed in:
  17541. 1603.22 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/bin
  17542. 1603.22 s [quickcheck-instances] Libraries installed in:
  17543. 1603.22 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17544. 1603.22 s [quickcheck-instances] Dynamic Libraries installed in:
  17545. 1603.22 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  17546. 1603.22 s [quickcheck-instances] Private executables installed in:
  17547. 1603.22 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33
  17548. 1603.22 s [quickcheck-instances] Data files installed in:
  17549. 1603.22 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33
  17550. 1603.22 s [quickcheck-instances] Documentation installed in:
  17551. 1603.22 s [quickcheck-instances] /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  17552. 1603.22 s [quickcheck-instances] Configuration files installed in:
  17553. 1603.22 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/etc
  17554. 1603.22 s [quickcheck-instances] No alex found
  17555. 1603.22 s [quickcheck-instances] Using ar found on system at:
  17556. 1603.22 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17557. 1603.22 s [quickcheck-instances] No c2hs found
  17558. 1603.22 s [quickcheck-instances] No cpphs found
  17559. 1603.22 s [quickcheck-instances] No doctest found
  17560. 1603.22 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  17561. 1603.22 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17562. 1603.22 s [quickcheck-instances] Using ghc version 9.12.2 found on system at:
  17563. 1603.22 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  17564. 1603.22 s [quickcheck-instances] Using ghc-pkg version 9.12.2 found on system at:
  17565. 1603.22 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  17566. 1603.22 s [quickcheck-instances] No ghcjs found
  17567. 1603.22 s [quickcheck-instances] No ghcjs-pkg found
  17568. 1603.22 s [quickcheck-instances] No greencard found
  17569. 1603.22 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  17570. 1603.22 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  17571. 1603.22 s [quickcheck-instances] No happy found
  17572. 1603.22 s [quickcheck-instances] No haskell-suite found
  17573. 1603.22 s [quickcheck-instances] No haskell-suite-pkg found
  17574. 1603.22 s [quickcheck-instances] No hmake found
  17575. 1603.22 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  17576. 1603.22 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  17577. 1603.22 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  17578. 1603.22 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  17579. 1603.22 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  17580. 1603.22 s [quickcheck-instances] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  17581. 1603.22 s [quickcheck-instances] No jhc found
  17582. 1603.22 s [quickcheck-instances] Using ld found on system at:
  17583. 1603.22 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  17584. 1603.22 s [quickcheck-instances] No pkg-config found
  17585. 1603.22 s [quickcheck-instances] Using runghc version 9.12.2 found on system at:
  17586. 1603.22 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  17587. 1603.22 s [quickcheck-instances] Using strip version 2.44 found on system at:
  17588. 1603.22 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17589. 1603.22 s [quickcheck-instances] Using tar found on system at:
  17590. 1603.22 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17591. 1603.22 s [quickcheck-instances] No uhc found
  17592. 1603.46 s [quickcheck-instances] Phase: buildPhase
  17593. 1603.53 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  17594. 1603.55 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  17595. 1603.67 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 )
  17596. 1603.72 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 )
  17597. 1604.00 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 )
  17598. 1604.11 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 )
  17599. 1604.11 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 )
  17600. 1604.43 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 )
  17601. 1604.43 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 )
  17602. 1604.43 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 )
  17603. 1604.43 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 )
  17604. 1604.43 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 )
  17605. 1604.43 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 )
  17606. 1604.43 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 )
  17607. 1604.43 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 )
  17608. 1604.43 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 )
  17609. 1604.43 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 )
  17610. 1604.53 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 )
  17611. 1604.53 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 )
  17612. 1604.53 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 )
  17613. 1604.53 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 )
  17614. 1604.53 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 )
  17615. 1604.95 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 )
  17616. 1604.95 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 )
  17617. 1604.95 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 )
  17618. 1604.95 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 )
  17619. 1604.95 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 )
  17620. 1604.95 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 )
  17621. 1605.35 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 )
  17622. 1605.54 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 )
  17623. 1606.02 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 )
  17624. 1606.38 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
  17625. 1606.38 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
  17626. 1606.58 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 )
  17627. 1606.58 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 )
  17628. 1606.58 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 )
  17629. 1606.58 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 )
  17630. 1606.59 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 )
  17631. 1606.59 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 )
  17632. 1606.59 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 )
  17633. 1606.59 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 )
  17634. 1606.59 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 )
  17635. 1606.59 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 )
  17636. 1606.59 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 )
  17637. 1606.59 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 )
  17638. 1606.59 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 )
  17639. 1606.59 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 )
  17640. 1606.59 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 )
  17641. 1606.88 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 )
  17642. 1606.88 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 )
  17643. 1606.88 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 )
  17644. 1606.88 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 )
  17645. 1606.88 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 )
  17646. 1606.88 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  17647. 1609.41 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  17648. 1609.41 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  17649. 1609.49 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  17650. 1610.00 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  17651. 1610.95 s [quickcheck-instances] Phase: checkPhase
  17652. 1611.27 s [quickcheck-instances] Running 1 test suites...
  17653. 1611.27 s [quickcheck-instances] Test suite self-test: RUNNING...
  17654. 1611.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  17655. 1611.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  17656. 1611.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  17657. 1611.30 s [quickcheck-instances] +++ OK, passed 100 tests.
  17658. 1611.30 s [quickcheck-instances] +++ OK, passed 100 tests.
  17659. 1611.30 s [quickcheck-instances] Test suite self-test: PASS
  17660. 1611.30 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  17661. 1611.30 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  17662. 1611.30 s [quickcheck-instances] Phase: haddockPhase
  17663. 1611.38 s [haskell-language-server] Preprocessing executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0...
  17664. 1611.38 s [haskell-language-server] Building executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0...
  17665. 1611.49 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 )
  17666. 1613.40 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor
  17667. 1613.45 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  17668. 1613.47 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  17669. 1613.47 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  17670. 1613.47 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  17671. 1614.41 s [haskell-language-server] Preprocessing library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0...
  17672. 1614.41 s [haskell-language-server] Building library 'hls-hlint-plugin' for haskell-language-server-2.12.0.0...
  17673. 1614.46 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing ) [HIE file is missing]
  17674. 1614.47 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing ) [HIE file is missing]
  17675. 1614.50 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing ) [HIE file is missing]
  17676. 1614.56 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 )
  17677. 1614.64 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing ) [HIE file is missing]
  17678. 1614.68 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing ) [HIE file is missing]
  17679. 1614.72 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing ) [HIE file is missing]
  17680. 1614.75 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing ) [HIE file is missing]
  17681. 1614.77 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing ) [HIE file is missing]
  17682. 1614.78 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing ) [HIE file is missing]
  17683. 1614.82 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing ) [HIE file is missing]
  17684. 1614.86 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing ) [HIE file is missing]
  17685. 1614.88 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing ) [HIE file is missing]
  17686. 1614.89 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing ) [HIE file is missing]
  17687. 1615.01 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing ) [HIE file is missing]
  17688. 1615.01 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing ) [HIE file is missing]
  17689. 1615.07 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing ) [HIE file is missing]
  17690. 1615.08 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing ) [HIE file is missing]
  17691. 1615.09 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing ) [HIE file is missing]
  17692. 1615.09 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing ) [HIE file is missing]
  17693. 1615.11 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing ) [HIE file is missing]
  17694. 1615.21 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing ) [HIE file is missing]
  17695. 1615.29 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing ) [HIE file is missing]
  17696. 1615.31 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing ) [HIE file is missing]
  17697. 1615.34 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing ) [HIE file is missing]
  17698. 1615.65 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing ) [HIE file is missing]
  17699. 1615.66 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing ) [HIE file is missing]
  17700. 1615.67 s [quickcheck-instances] Haddock coverage:
  17701. 1615.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  17702. 1615.67 s [quickcheck-instances] Missing documentation for:
  17703. 1615.67 s [quickcheck-instances] Module header
  17704. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  17705. 1615.92 s [quickcheck-instances] Missing documentation for:
  17706. 1615.92 s [quickcheck-instances] Module header
  17707. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  17708. 1615.92 s [quickcheck-instances] Missing documentation for:
  17709. 1615.92 s [quickcheck-instances] Module header
  17710. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  17711. 1615.92 s [quickcheck-instances] Missing documentation for:
  17712. 1615.92 s [quickcheck-instances] Module header
  17713. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  17714. 1615.92 s [quickcheck-instances] Missing documentation for:
  17715. 1615.92 s [quickcheck-instances] Module header
  17716. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  17717. 1615.92 s [quickcheck-instances] Missing documentation for:
  17718. 1615.92 s [quickcheck-instances] Module header
  17719. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  17720. 1615.92 s [quickcheck-instances] Missing documentation for:
  17721. 1615.92 s [quickcheck-instances] Module header
  17722. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  17723. 1615.92 s [quickcheck-instances] Missing documentation for:
  17724. 1615.92 s [quickcheck-instances] Module header
  17725. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  17726. 1615.92 s [quickcheck-instances] Missing documentation for:
  17727. 1615.92 s [quickcheck-instances] Module header
  17728. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  17729. 1615.92 s [quickcheck-instances] Missing documentation for:
  17730. 1615.92 s [quickcheck-instances] Module header
  17731. 1615.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  17732. 1615.92 s [quickcheck-instances] Missing documentation for:
  17733. 1615.93 s [quickcheck-instances] Module header
  17734. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  17735. 1615.93 s [quickcheck-instances] Missing documentation for:
  17736. 1615.93 s [quickcheck-instances] Module header
  17737. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  17738. 1615.93 s [quickcheck-instances] Missing documentation for:
  17739. 1615.93 s [quickcheck-instances] Module header
  17740. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  17741. 1615.93 s [quickcheck-instances] Missing documentation for:
  17742. 1615.93 s [quickcheck-instances] Module header
  17743. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  17744. 1615.93 s [quickcheck-instances] Missing documentation for:
  17745. 1615.93 s [quickcheck-instances] Module header
  17746. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  17747. 1615.93 s [quickcheck-instances] Missing documentation for:
  17748. 1615.93 s [quickcheck-instances] Module header
  17749. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  17750. 1615.93 s [quickcheck-instances] Missing documentation for:
  17751. 1615.93 s [quickcheck-instances] Module header
  17752. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  17753. 1615.93 s [quickcheck-instances] Missing documentation for:
  17754. 1615.93 s [quickcheck-instances] Module header
  17755. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  17756. 1615.93 s [quickcheck-instances] Missing documentation for:
  17757. 1615.93 s [quickcheck-instances] Module header
  17758. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  17759. 1615.93 s [quickcheck-instances] Missing documentation for:
  17760. 1615.93 s [quickcheck-instances] Module header
  17761. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  17762. 1615.93 s [quickcheck-instances] Missing documentation for:
  17763. 1615.93 s [quickcheck-instances] Module header
  17764. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  17765. 1615.93 s [quickcheck-instances] Missing documentation for:
  17766. 1615.93 s [quickcheck-instances] Module header
  17767. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  17768. 1615.93 s [quickcheck-instances] Missing documentation for:
  17769. 1615.93 s [quickcheck-instances] Module header
  17770. 1615.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  17771. 1615.93 s [quickcheck-instances] Missing documentation for:
  17772. 1615.93 s [quickcheck-instances] Module header
  17773. 1615.93 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  17774. 1616.80 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  17775. 1616.83 s [quickcheck-instances] - Data.Vector.Vector
  17776. 1616.83 s [quickcheck-instances] - Data.Vector.Strict.Vector
  17777. 1616.83 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  17778. 1616.83 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  17779. 1616.83 s [quickcheck-instances] - Data.Vector.Storable.Vector
  17780. 1616.83 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  17781. 1622.53 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 )
  17782. 1623.84 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances,
  17783. 1623.84 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  17784. 1624.47 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  17785. 1624.55 s [quickcheck-instances] Phase: installPhase
  17786. 1624.61 s [quickcheck-instances] Installing library in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17787. 1625.15 s [quickcheck-instances] Phase: fixupPhase
  17788. 1625.18 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33
  17789. 1625.18 s [quickcheck-instances] shrinking /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSquickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw-ghc9.12.2.so
  17790. 1625.21 s [quickcheck-instances] checking for references to /build/ in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33...
  17791. 1625.27 s [quickcheck-instances] patching script interpreter paths in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33
  17792. 1625.28 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib
  17793. 1625.49 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  17794. 1625.50 s [quickcheck-instances] checking for references to /build/ in /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc...
  17795. 1625.53 s [quickcheck-instances] patching script interpreter paths in /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  17796. 1625.68 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33 /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  17797. 1626.04 s [quickcheck-instances:post-build] Nothing to push - all store paths are already on Cachix.
  17798. 1626.07 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33 /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  17799. 1626.12 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17800. 1626.17 s [quickcheck-instances:post-build] copying 1 paths...
  17801. 1626.17 s [quickcheck-instances:post-build] copying path '/nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  17802. 1627.89 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17803. 1627.98 s [quickcheck-instances:post-build] copying 0 paths...
  17804. 1628.02 s Progress: 20 of 31 built (1 building), 593 of 593 downloaded from cache
  17805. 1628.08 s Building /nix/store/klkin8nnnnj5ykgmlz1f26r6s2ffp1hd-extra-1.8.1.drv
  17806. 1628.25 s [extra] Phase: setupCompilerEnvironmentPhase
  17807. 1628.25 s [extra] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  17808. 1628.49 s [extra] Phase: unpackPhase
  17809. 1628.50 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  17810. 1628.50 s [extra] source root is extra-1.8.1
  17811. 1628.51 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  17812. 1628.52 s [extra] Phase: patchPhase
  17813. 1628.53 s [extra] Phase: compileBuildDriverPhase
  17814. 1628.53 s [extra] setupCompileFlags: -package-db=/build/tmp.FrilIyBwU1/setup-package.conf.d -threaded
  17815. 1628.59 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.FrilIyBwU1/Main.o )
  17816. 1628.66 s [extra] [2 of 2] Linking Setup
  17817. 1630.30 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  17818. 1630.31 s [extra] Phase: configurePhase
  17819. 1630.32 s [extra] configureFlags: --verbose --prefix=/nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.FrilIyBwU1/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
  17820. 1630.32 s [extra] Using Parsec parser
  17821. 1630.32 s [extra] Configuring extra-1.8.1...
  17822. 1630.36 s [extra] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  17823. 1630.36 s [extra] 'ghc' version < 9.12):
  17824. 1630.36 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  17825. 1630.36 s [extra] 9.12.2
  17826. 1630.96 s [extra] Dependency base >=4.9 && <5: using base-4.21.0.0
  17827. 1630.96 s [extra] Dependency clock >=0.7: using clock-0.8.4
  17828. 1630.96 s [extra] Dependency directory: using directory-1.3.9.0
  17829. 1630.96 s [extra] Dependency filepath: using filepath-1.5.4.0
  17830. 1630.96 s [extra] Dependency process: using process-1.6.25.0
  17831. 1630.96 s [extra] Dependency time: using time-1.14
  17832. 1630.96 s [extra] Dependency unix: using unix-2.8.6.0
  17833. 1630.96 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  17834. 1630.96 s [extra] Dependency base >=4 && <5: using base-4.21.0.0
  17835. 1630.96 s [extra] Dependency directory: using directory-1.3.9.0
  17836. 1630.96 s [extra] Dependency extra: using extra-1.8.1
  17837. 1630.96 s [extra] Dependency filepath: using filepath-1.5.4.0
  17838. 1630.96 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  17839. 1630.96 s [extra] Dependency unix: using unix-2.8.6.0
  17840. 1630.96 s [extra] Source component graph:
  17841. 1630.96 s [extra] component lib
  17842. 1630.96 s [extra] component test:extra-test dependency lib
  17843. 1630.96 s [extra] Configured component graph:
  17844. 1630.96 s [extra] component extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  17845. 1630.96 s [extra] include base-4.21.0.0-b334
  17846. 1630.96 s [extra] include clock-0.8.4-ID3ZHKSe7qB9bOrwwoeq20
  17847. 1630.96 s [extra] include directory-1.3.9.0-d362
  17848. 1630.96 s [extra] include filepath-1.5.4.0-7227
  17849. 1630.96 s [extra] include process-1.6.25.0-bd82
  17850. 1630.96 s [extra] include time-1.14-3dc5
  17851. 1630.96 s [extra] include unix-2.8.6.0-935f
  17852. 1630.96 s [extra] component extra-1.8.1-FcxSS1akaIPKLupWFutujD-extra-test
  17853. 1630.96 s [extra] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17854. 1630.96 s [extra] include base-4.21.0.0-b334
  17855. 1630.96 s [extra] include directory-1.3.9.0-d362
  17856. 1630.96 s [extra] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  17857. 1630.96 s [extra] include filepath-1.5.4.0-7227
  17858. 1630.96 s [extra] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17859. 1630.96 s [extra] include unix-2.8.6.0-935f
  17860. 1630.96 s [extra] Linked component graph:
  17861. 1630.96 s [extra] unit extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  17862. 1630.96 s [extra] include base-4.21.0.0-b334
  17863. 1630.96 s [extra] include clock-0.8.4-ID3ZHKSe7qB9bOrwwoeq20
  17864. 1630.96 s [extra] include directory-1.3.9.0-d362
  17865. 1630.96 s [extra] include filepath-1.5.4.0-7227
  17866. 1630.96 s [extra] include process-1.6.25.0-bd82
  17867. 1630.96 s [extra] include time-1.14-3dc5
  17868. 1630.96 s [extra] include unix-2.8.6.0-935f
  17869. 1630.96 s [extra] Control.Concurrent.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Version.Extra,Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Extra,Numeric.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Numeric.Extra,System.Directory.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Environment.Extra,System.IO.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.IO.Extra,System.Info.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Info.Extra,System.Process.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Process.Extra,System.Time.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Time.Extra,Text.Read.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Text.Read.Extra
  17870. 1630.96 s [extra] unit extra-1.8.1-FcxSS1akaIPKLupWFutujD-extra-test
  17871. 1630.96 s [extra] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17872. 1630.96 s [extra] include base-4.21.0.0-b334
  17873. 1630.96 s [extra] include directory-1.3.9.0-d362
  17874. 1630.96 s [extra] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  17875. 1630.96 s [extra] include filepath-1.5.4.0-7227
  17876. 1630.96 s [extra] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17877. 1630.96 s [extra] include unix-2.8.6.0-935f
  17878. 1630.96 s [extra] Ready component graph:
  17879. 1630.96 s [extra] definite extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  17880. 1630.96 s [extra] depends base-4.21.0.0-b334
  17881. 1630.96 s [extra] depends clock-0.8.4-ID3ZHKSe7qB9bOrwwoeq20
  17882. 1630.96 s [extra] depends directory-1.3.9.0-d362
  17883. 1630.96 s [extra] depends filepath-1.5.4.0-7227
  17884. 1630.96 s [extra] depends process-1.6.25.0-bd82
  17885. 1630.96 s [extra] depends time-1.14-3dc5
  17886. 1630.96 s [extra] depends unix-2.8.6.0-935f
  17887. 1630.96 s [extra] definite extra-1.8.1-FcxSS1akaIPKLupWFutujD-extra-test
  17888. 1630.96 s [extra] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  17889. 1630.96 s [extra] depends base-4.21.0.0-b334
  17890. 1630.96 s [extra] depends directory-1.3.9.0-d362
  17891. 1630.96 s [extra] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  17892. 1630.96 s [extra] depends filepath-1.5.4.0-7227
  17893. 1630.96 s [extra] depends quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  17894. 1630.96 s [extra] depends unix-2.8.6.0-935f
  17895. 1630.96 s [extra] Using Cabal-3.14.1.0 compiled by ghc-9.12
  17896. 1630.96 s [extra] Using compiler: ghc-9.12.2
  17897. 1630.96 s [extra] Using install prefix: /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1
  17898. 1630.96 s [extra] Executables installed in:
  17899. 1630.96 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/bin
  17900. 1630.96 s [extra] Libraries installed in:
  17901. 1630.96 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  17902. 1630.96 s [extra] Dynamic Libraries installed in:
  17903. 1630.96 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  17904. 1630.96 s [extra] Private executables installed in:
  17905. 1630.96 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/libexec/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1
  17906. 1630.96 s [extra] Data files installed in:
  17907. 1630.96 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/share/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1
  17908. 1630.96 s [extra] Documentation installed in:
  17909. 1630.96 s [extra] /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc/share/doc/extra-1.8.1
  17910. 1630.96 s [extra] Configuration files installed in:
  17911. 1630.96 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/etc
  17912. 1630.96 s [extra] No alex found
  17913. 1630.96 s [extra] Using ar found on system at:
  17914. 1630.96 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17915. 1630.96 s [extra] No c2hs found
  17916. 1630.96 s [extra] No cpphs found
  17917. 1630.96 s [extra] No doctest found
  17918. 1630.96 s [extra] Using gcc version 14.3.0 given by user at:
  17919. 1630.96 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17920. 1630.96 s [extra] Using ghc version 9.12.2 found on system at:
  17921. 1630.96 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  17922. 1630.96 s [extra] Using ghc-pkg version 9.12.2 found on system at:
  17923. 1630.96 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  17924. 1630.96 s [extra] No ghcjs found
  17925. 1630.96 s [extra] No ghcjs-pkg found
  17926. 1630.96 s [extra] No greencard found
  17927. 1630.96 s [extra] Using haddock version 2.30.0 found on system at:
  17928. 1630.96 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  17929. 1630.96 s [extra] No happy found
  17930. 1630.96 s [extra] No haskell-suite found
  17931. 1630.96 s [extra] No haskell-suite-pkg found
  17932. 1630.96 s [extra] No hmake found
  17933. 1630.96 s [extra] Using hpc version 0.69 found on system at:
  17934. 1630.96 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  17935. 1630.96 s [extra] Using hsc2hs version 0.68.10 found on system at:
  17936. 1630.96 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  17937. 1630.96 s [extra] Using hscolour version 1.25 found on system at:
  17938. 1630.96 s [extra] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  17939. 1630.96 s [extra] No jhc found
  17940. 1630.96 s [extra] Using ld found on system at:
  17941. 1630.96 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  17942. 1630.96 s [extra] No pkg-config found
  17943. 1630.96 s [extra] Using runghc version 9.12.2 found on system at:
  17944. 1630.96 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  17945. 1630.96 s [extra] Using strip version 2.44 found on system at:
  17946. 1630.96 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17947. 1630.96 s [extra] Using tar found on system at:
  17948. 1630.96 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17949. 1630.96 s [extra] No uhc found
  17950. 1631.20 s [extra] Phase: buildPhase
  17951. 1631.27 s [extra] Preprocessing library for extra-1.8.1...
  17952. 1631.28 s [extra] Building library for extra-1.8.1...
  17953. 1631.56 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 )
  17954. 1631.70 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 )
  17955. 1631.70 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 )
  17956. 1631.73 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 )
  17957. 1631.73 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  17958. 1631.73 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  17959. 1631.73 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 )
  17960. 1632.91 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 )
  17961. 1632.97 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 )
  17962. 1633.06 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 )
  17963. 1633.09 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 )
  17964. 1633.09 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 )
  17965. 1633.30 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 )
  17966. 1633.78 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
  17967. 1633.86 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 )
  17968. 1633.86 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 )
  17969. 1633.87 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 )
  17970. 1634.12 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 )
  17971. 1634.12 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 )
  17972. 1634.71 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 )
  17973. 1634.71 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  17974. 1635.29 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 )
  17975. 1635.89 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  17976. 1636.18 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  17977. 1636.18 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  17978. 1636.18 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  17979. 1636.18 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  17980. 1636.18 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  17981. 1636.18 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  17982. 1637.54 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  17983. 1637.76 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  17984. 1638.53 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  17985. 1638.55 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  17986. 1638.55 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  17987. 1639.03 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  17988. 1639.41 s [haskell-language-server] Preprocessing library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0...
  17989. 1639.41 s [haskell-language-server] Building library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0...
  17990. 1639.45 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  17991. 1639.57 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  17992. 1639.57 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  17993. 1639.57 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  17994. 1639.58 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 )
  17995. 1640.14 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  17996. 1640.14 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  17997. 1640.35 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  17998. 1640.35 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  17999. 1640.54 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18000. 1641.92 s [haskell-language-server] plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
  18001. 1641.92 s [haskell-language-server] The import of ‘System.Directory’ is redundant
  18002. 1641.92 s [haskell-language-server] except perhaps to import instances from ‘System.Directory’
  18003. 1641.92 s [haskell-language-server] To import instances alone, use: import System.Directory()
  18004. 1641.92 s [haskell-language-server] |
  18005. 1641.92 s [haskell-language-server] 28 | import System.Directory
  18006. 1641.92 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  18007. 1641.92 s [haskell-language-server]
  18008. 1643.99 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  18009. 1643.99 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  18010. 1644.06 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18011. 1644.40 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 )
  18012. 1644.48 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18013. 1646.32 s [haskell-language-server] plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
  18014. 1646.32 s [haskell-language-server] The import of ‘System.Directory’ is redundant
  18015. 1646.32 s [haskell-language-server] except perhaps to import instances from ‘System.Directory’
  18016. 1646.32 s [haskell-language-server] To import instances alone, use: import System.Directory()
  18017. 1646.32 s [haskell-language-server] |
  18018. 1646.32 s [haskell-language-server] 28 | import System.Directory
  18019. 1646.32 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  18020. 1646.32 s [haskell-language-server]
  18021. 1649.66 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18022. 1649.68 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18023. 1650.07 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18024. 1651.02 s [extra] Phase: checkPhase
  18025. 1651.32 s [extra] Running 1 test suites...
  18026. 1651.32 s [extra] Test suite extra-test: RUNNING...
  18027. 1651.33 s [extra] withTempFile
  18028. 1651.33 s [extra] +++ OK, passed 100 tests.
  18029. 1651.33 s [extra] captureOutput
  18030. 1651.34 s [extra] +++ OK, passed 100 tests.
  18031. 1651.34 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18032. 1651.37 s [extra] +++ OK, passed 100 tests.
  18033. 1651.37 s [extra] \(x :: IO Int) -> join (once x) == x
  18034. 1651.40 s [extra] +++ OK, passed 100 tests.
  18035. 1651.40 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18036. 1651.43 s [extra] +++ OK, passed 100 tests.
  18037. 1651.43 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18038. 1651.47 s [extra] +++ OK, passed 100 tests.
  18039. 1651.47 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18040. 1651.50 s [extra] +++ OK, passed 100 tests.
  18041. 1651.50 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18042. 1651.54 s [extra] +++ OK, passed 100 tests.
  18043. 1651.54 s [extra] stringException "test" == pure "test"
  18044. 1651.54 s [extra] +++ OK, passed 100 tests.
  18045. 1651.54 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18046. 1651.54 s [extra] +++ OK, passed 100 tests.
  18047. 1651.54 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18048. 1651.54 s [extra] +++ OK, passed 100 tests.
  18049. 1651.54 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18050. 1651.54 s [extra] +++ OK, passed 100 tests.
  18051. 1651.54 s [extra] ignore (print 1) == print 1
  18052. 1651.54 s [extra] +++ OK, passed 100 tests.
  18053. 1651.54 s [extra] ignore (fail "die") == pure ()
  18054. 1651.54 s [extra] +++ OK, passed 100 tests.
  18055. 1651.54 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18056. 1651.54 s [extra] +++ OK, passed 100 tests.
  18057. 1651.54 s [extra] seq (errorIO "foo") (print 1) == print 1
  18058. 1651.54 s [extra] +++ OK, passed 100 tests.
  18059. 1651.54 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18060. 1651.54 s [extra] +++ OK, passed 100 tests.
  18061. 1651.54 s [extra] seq (assertIO False) (print 1) == print 1
  18062. 1651.54 s [extra] +++ OK, passed 100 tests.
  18063. 1651.54 s [extra] retry 1 (print "x") == print "x"
  18064. 1651.54 s [extra] +++ OK, passed 100 tests.
  18065. 1651.54 s [extra] retry 3 (fail "die") == fail "die"
  18066. 1651.54 s [extra] +++ OK, passed 100 tests.
  18067. 1651.54 s [extra] whenJust Nothing print == pure ()
  18068. 1651.54 s [extra] +++ OK, passed 100 tests.
  18069. 1651.55 s [extra] whenJust (Just 1) print == print 1
  18070. 1651.55 s [extra] +++ OK, passed 100 tests.
  18071. 1651.55 s [extra] pureIf @Maybe True 5 == Just 5
  18072. 1651.55 s [extra] +++ OK, passed 100 tests.
  18073. 1651.55 s [extra] pureIf @Maybe False 5 == Nothing
  18074. 1651.55 s [extra] +++ OK, passed 100 tests.
  18075. 1651.55 s [extra] pureIf @[] True 5 == [5]
  18076. 1651.55 s [extra] +++ OK, passed 100 tests.
  18077. 1651.55 s [extra] pureIf @[] False 5 == []
  18078. 1651.55 s [extra] +++ OK, passed 100 tests.
  18079. 1651.55 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18080. 1651.55 s [extra] +++ OK, passed 100 tests.
  18081. 1651.55 s [extra] whenMaybe False (print 1) == pure Nothing
  18082. 1651.55 s [extra] +++ OK, passed 100 tests.
  18083. 1651.55 s [extra] \(x :: Maybe ()) -> unit x == x
  18084. 1651.55 s [extra] +++ OK, passed 100 tests.
  18085. 1651.55 s [extra] guarded even 2 == [2]
  18086. 1651.55 s [extra] +++ OK, passed 100 tests.
  18087. 1651.55 s [extra] guarded odd 2 == Nothing
  18088. 1651.55 s [extra] +++ OK, passed 100 tests.
  18089. 1651.55 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18090. 1651.55 s [extra] +++ OK, passed 100 tests.
  18091. 1651.55 s [extra] guardedA (return . even) 42 == Just [42]
  18092. 1651.55 s [extra] +++ OK, passed 100 tests.
  18093. 1651.55 s [extra] guardedA (return . odd) 42 == Just []
  18094. 1651.55 s [extra] +++ OK, passed 100 tests.
  18095. 1651.55 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18096. 1651.55 s [extra] +++ OK, passed 100 tests.
  18097. 1651.55 s [extra] fold1M (\x y -> Just x) [] == undefined
  18098. 1651.55 s [extra] +++ OK, passed 100 tests.
  18099. 1651.55 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18100. 1651.55 s [extra] +++ OK, passed 100 tests.
  18101. 1651.55 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18102. 1651.55 s [extra] +++ OK, passed 100 tests.
  18103. 1651.55 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18104. 1651.55 s [extra] +++ OK, passed 100 tests.
  18105. 1651.55 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18106. 1651.55 s [extra] +++ OK, passed 100 tests.
  18107. 1651.55 s [extra] Just True ||^ undefined == Just True
  18108. 1651.55 s [extra] +++ OK, passed 100 tests.
  18109. 1651.55 s [extra] Just False ||^ Just True == Just True
  18110. 1651.55 s [extra] +++ OK, passed 100 tests.
  18111. 1651.55 s [extra] Just False ||^ Just False == Just False
  18112. 1651.55 s [extra] +++ OK, passed 100 tests.
  18113. 1651.55 s [extra] Just False &&^ undefined == Just False
  18114. 1651.55 s [extra] +++ OK, passed 100 tests.
  18115. 1651.55 s [extra] Just True &&^ Just True == Just True
  18116. 1651.55 s [extra] +++ OK, passed 100 tests.
  18117. 1651.55 s [extra] Just True &&^ Just False == Just False
  18118. 1651.55 s [extra] +++ OK, passed 100 tests.
  18119. 1651.55 s [extra] anyM Just [False,True ,undefined] == Just True
  18120. 1651.55 s [extra] +++ OK, passed 100 tests.
  18121. 1651.55 s [extra] anyM Just [False,False,undefined] == undefined
  18122. 1651.55 s [extra] +++ OK, passed 100 tests.
  18123. 1651.55 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18124. 1651.55 s [extra] +++ OK, passed 100 tests.
  18125. 1651.55 s [extra] allM Just [True,False,undefined] == Just False
  18126. 1651.55 s [extra] +++ OK, passed 100 tests.
  18127. 1651.55 s [extra] allM Just [True,True ,undefined] == undefined
  18128. 1651.55 s [extra] +++ OK, passed 100 tests.
  18129. 1651.55 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18130. 1651.55 s [extra] +++ OK, passed 100 tests.
  18131. 1651.55 s [extra] orM [Just False,Just True ,undefined] == Just True
  18132. 1651.55 s [extra] +++ OK, passed 100 tests.
  18133. 1651.55 s [extra] orM [Just False,Just False,undefined] == undefined
  18134. 1651.55 s [extra] +++ OK, passed 100 tests.
  18135. 1651.55 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18136. 1651.55 s [extra] +++ OK, passed 100 tests.
  18137. 1651.55 s [extra] andM [Just True,Just False,undefined] == Just False
  18138. 1651.55 s [extra] +++ OK, passed 100 tests.
  18139. 1651.55 s [extra] andM [Just True,Just True ,undefined] == undefined
  18140. 1651.55 s [extra] +++ OK, passed 100 tests.
  18141. 1651.55 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18142. 1651.55 s [extra] +++ OK, passed 100 tests.
  18143. 1651.55 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18144. 1651.55 s [extra] +++ OK, passed 100 tests.
  18145. 1651.55 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18146. 1651.55 s [extra] +++ OK, passed 100 tests.
  18147. 1651.55 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18148. 1651.55 s [extra] +++ OK, passed 100 tests.
  18149. 1651.55 s [extra] fromLeft 1 (Left 3) == 3
  18150. 1651.55 s [extra] +++ OK, passed 100 tests.
  18151. 1651.55 s [extra] fromLeft 1 (Right "foo") == 1
  18152. 1651.55 s [extra] +++ OK, passed 100 tests.
  18153. 1651.55 s [extra] fromRight 1 (Right 3) == 3
  18154. 1651.55 s [extra] +++ OK, passed 100 tests.
  18155. 1651.55 s [extra] fromRight 1 (Left "foo") == 1
  18156. 1651.55 s [extra] +++ OK, passed 100 tests.
  18157. 1651.55 s [extra] \x -> fromLeft' (Left x) == x
  18158. 1651.55 s [extra] +++ OK, passed 100 tests.
  18159. 1651.55 s [extra] \x -> fromLeft' (Right x) == undefined
  18160. 1651.56 s [extra] +++ OK, passed 100 tests.
  18161. 1651.56 s [extra] \x -> fromRight' (Right x) == x
  18162. 1651.56 s [extra] +++ OK, passed 100 tests.
  18163. 1651.56 s [extra] \x -> fromRight' (Left x) == undefined
  18164. 1651.56 s [extra] +++ OK, passed 100 tests.
  18165. 1651.56 s [extra] \x -> fromEither (Left x ) == x
  18166. 1651.56 s [extra] +++ OK, passed 100 tests.
  18167. 1651.56 s [extra] \x -> fromEither (Right x) == x
  18168. 1651.56 s [extra] +++ OK, passed 100 tests.
  18169. 1651.56 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18170. 1651.56 s [extra] +++ OK, passed 100 tests.
  18171. 1651.56 s [extra] \a -> maybeToEither a Nothing == Left a
  18172. 1651.56 s [extra] +++ OK, passed 100 tests.
  18173. 1651.56 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18174. 1651.56 s [extra] +++ OK, passed 100 tests.
  18175. 1651.56 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18176. 1651.56 s [extra] +++ OK, passed 100 tests.
  18177. 1651.56 s [extra] mapLeft show (Left 1) == Left "1"
  18178. 1651.56 s [extra] +++ OK, passed 100 tests.
  18179. 1651.56 s [extra] mapLeft show (Right True) == Right True
  18180. 1651.56 s [extra] +++ OK, passed 100 tests.
  18181. 1651.56 s [extra] mapRight show (Left 1) == Left 1
  18182. 1651.56 s [extra] +++ OK, passed 100 tests.
  18183. 1651.56 s [extra] mapRight show (Right True) == Right "True"
  18184. 1651.57 s [extra] +++ OK, passed 100 tests.
  18185. 1651.57 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18186. 1651.57 s [extra] +++ OK, passed 100 tests.
  18187. 1651.57 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18188. 1651.57 s [extra] +++ OK, passed 100 tests.
  18189. 1651.57 s [extra] \xs -> repeatedly line1 xs == lines xs
  18190. 1651.57 s [extra] +++ OK, passed 100 tests.
  18191. 1651.57 s [extra] disjoint [1,2,3] [4,5] == True
  18192. 1651.57 s [extra] +++ OK, passed 100 tests.
  18193. 1651.57 s [extra] disjoint [1,2,3] [4,1] == False
  18194. 1651.57 s [extra] +++ OK, passed 100 tests.
  18195. 1651.57 s [extra] disjointOrd [1,2,3] [4,5] == True
  18196. 1651.57 s [extra] +++ OK, passed 100 tests.
  18197. 1651.57 s [extra] disjointOrd [1,2,3] [4,1] == False
  18198. 1651.57 s [extra] +++ OK, passed 100 tests.
  18199. 1651.57 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18200. 1651.57 s [extra] +++ OK, passed 100 tests.
  18201. 1651.57 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18202. 1651.57 s [extra] +++ OK, passed 100 tests.
  18203. 1651.57 s [extra] anySame [1,1,2] == True
  18204. 1651.57 s [extra] +++ OK, passed 100 tests.
  18205. 1651.57 s [extra] anySame [1,2,3] == False
  18206. 1651.57 s [extra] +++ OK, passed 100 tests.
  18207. 1651.57 s [extra] anySame (1:2:1:undefined) == True
  18208. 1651.57 s [extra] +++ OK, passed 100 tests.
  18209. 1651.57 s [extra] anySame [] == False
  18210. 1651.57 s [extra] +++ OK, passed 100 tests.
  18211. 1651.57 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18212. 1651.57 s [extra] +++ OK, passed 100 tests.
  18213. 1651.57 s [extra] allSame [1,1,2] == False
  18214. 1651.57 s [extra] +++ OK, passed 100 tests.
  18215. 1651.57 s [extra] allSame [1,1,1] == True
  18216. 1651.57 s [extra] +++ OK, passed 100 tests.
  18217. 1651.57 s [extra] allSame [1] == True
  18218. 1651.57 s [extra] +++ OK, passed 100 tests.
  18219. 1651.57 s [extra] allSame [] == True
  18220. 1651.57 s [extra] +++ OK, passed 100 tests.
  18221. 1651.57 s [extra] allSame (1:1:2:undefined) == False
  18222. 1651.57 s [extra] +++ OK, passed 100 tests.
  18223. 1651.57 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18224. 1651.57 s [extra] +++ OK, passed 100 tests.
  18225. 1651.57 s [extra] headDef 1 [] == 1
  18226. 1651.57 s [extra] +++ OK, passed 100 tests.
  18227. 1651.57 s [extra] headDef 1 [2,3,4] == 2
  18228. 1651.57 s [extra] +++ OK, passed 100 tests.
  18229. 1651.57 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18230. 1651.57 s [extra] +++ OK, passed 100 tests.
  18231. 1651.57 s [extra] lastDef 1 [] == 1
  18232. 1651.57 s [extra] +++ OK, passed 100 tests.
  18233. 1651.57 s [extra] lastDef 1 [2,3,4] == 4
  18234. 1651.57 s [extra] +++ OK, passed 100 tests.
  18235. 1651.57 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18236. 1651.57 s [extra] +++ OK, passed 100 tests.
  18237. 1651.57 s [extra] [2,3,4] !? 1 == Just 3
  18238. 1651.57 s [extra] +++ OK, passed 100 tests.
  18239. 1651.57 s [extra] [2,3,4] !? (-1) == Nothing
  18240. 1651.57 s [extra] +++ OK, passed 100 tests.
  18241. 1651.57 s [extra] [] !? 0 == Nothing
  18242. 1651.57 s [extra] +++ OK, passed 100 tests.
  18243. 1651.57 s [extra] notNull [] == False
  18244. 1651.57 s [extra] +++ OK, passed 100 tests.
  18245. 1651.57 s [extra] notNull [1] == True
  18246. 1651.57 s [extra] +++ OK, passed 100 tests.
  18247. 1651.57 s [extra] \xs -> notNull xs == not (null xs)
  18248. 1651.57 s [extra] +++ OK, passed 100 tests.
  18249. 1651.57 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18250. 1651.57 s [extra] +++ OK, passed 100 tests.
  18251. 1651.57 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18252. 1651.57 s [extra] +++ OK, passed 100 tests.
  18253. 1651.57 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  18254. 1651.57 s [extra] +++ OK, passed 100 tests.
  18255. 1651.57 s [extra] unsnoc "test" == Just ("tes",'t')
  18256. 1651.57 s [extra] +++ OK, passed 100 tests.
  18257. 1651.57 s [extra] unsnoc "" == Nothing
  18258. 1651.57 s [extra] +++ OK, passed 100 tests.
  18259. 1651.57 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  18260. 1651.57 s [extra] +++ OK, passed 100 tests.
  18261. 1651.57 s [extra] cons 't' "est" == "test"
  18262. 1651.57 s [extra] +++ OK, passed 100 tests.
  18263. 1651.57 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  18264. 1651.57 s [extra] +++ OK, passed 100 tests.
  18265. 1651.57 s [extra] snoc "tes" 't' == "test"
  18266. 1651.57 s [extra] +++ OK, passed 100 tests.
  18267. 1651.57 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  18268. 1651.57 s [extra] +++ OK, passed 100 tests.
  18269. 1651.57 s [extra] enumerate == [False, True]
  18270. 1651.57 s [extra] +++ OK, passed 100 tests.
  18271. 1651.57 s [extra] takeEnd 3 "hello" == "llo"
  18272. 1651.57 s [extra] +++ OK, passed 100 tests.
  18273. 1651.57 s [extra] takeEnd 5 "bye" == "bye"
  18274. 1651.57 s [extra] +++ OK, passed 100 tests.
  18275. 1651.57 s [extra] takeEnd (-1) "bye" == ""
  18276. 1651.57 s [extra] +++ OK, passed 100 tests.
  18277. 1651.58 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  18278. 1651.58 s [extra] +++ OK, passed 100 tests.
  18279. 1651.58 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  18280. 1651.58 s [extra] +++ OK, passed 100 tests.
  18281. 1651.58 s [extra] dropEnd 3 "hello" == "he"
  18282. 1651.58 s [extra] +++ OK, passed 100 tests.
  18283. 1651.58 s [extra] dropEnd 5 "bye" == ""
  18284. 1651.58 s [extra] +++ OK, passed 100 tests.
  18285. 1651.58 s [extra] dropEnd (-1) "bye" == "bye"
  18286. 1651.58 s [extra] +++ OK, passed 100 tests.
  18287. 1651.58 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  18288. 1651.58 s [extra] +++ OK, passed 100 tests.
  18289. 1651.58 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  18290. 1651.58 s [extra] +++ OK, passed 100 tests.
  18291. 1651.58 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  18292. 1651.58 s [extra] +++ OK, passed 100 tests.
  18293. 1651.58 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  18294. 1651.58 s [extra] +++ OK, passed 100 tests.
  18295. 1651.58 s [extra] splitAtEnd 3 "he" == ("", "he")
  18296. 1651.58 s [extra] +++ OK, passed 100 tests.
  18297. 1651.58 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  18298. 1651.58 s [extra] +++ OK, passed 100 tests.
  18299. 1651.58 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  18300. 1651.58 s [extra] +++ OK, passed 100 tests.
  18301. 1651.58 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  18302. 1651.58 s [extra] +++ OK, passed 100 tests.
  18303. 1651.58 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  18304. 1651.58 s [extra] +++ OK, passed 100 tests.
  18305. 1651.58 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  18306. 1651.58 s [extra] +++ OK, passed 100 tests.
  18307. 1651.58 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  18308. 1651.58 s [extra] +++ OK, passed 100 tests.
  18309. 1651.58 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  18310. 1651.58 s [extra] +++ OK, passed 100 tests.
  18311. 1651.58 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  18312. 1651.58 s [extra] +++ OK, passed 100 tests.
  18313. 1651.58 s [extra] trim " hello " == "hello"
  18314. 1651.58 s [extra] +++ OK, passed 100 tests.
  18315. 1651.58 s [extra] trimStart " hello " == "hello "
  18316. 1651.58 s [extra] +++ OK, passed 100 tests.
  18317. 1651.58 s [extra] trimEnd " hello " == " hello"
  18318. 1651.58 s [extra] +++ OK, passed 100 tests.
  18319. 1651.58 s [extra] \s -> trim s == trimEnd (trimStart s)
  18320. 1651.58 s [extra] +++ OK, passed 100 tests.
  18321. 1651.58 s [extra] lower "This is A TEST" == "this is a test"
  18322. 1651.58 s [extra] +++ OK, passed 100 tests.
  18323. 1651.58 s [extra] lower "" == ""
  18324. 1651.58 s [extra] +++ OK, passed 100 tests.
  18325. 1651.58 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  18326. 1651.58 s [extra] +++ OK, passed 100 tests.
  18327. 1651.58 s [extra] upper "" == ""
  18328. 1651.58 s [extra] +++ OK, passed 100 tests.
  18329. 1651.58 s [extra] word1 "" == ("", "")
  18330. 1651.58 s [extra] +++ OK, passed 100 tests.
  18331. 1651.58 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  18332. 1651.58 s [extra] +++ OK, passed 100 tests.
  18333. 1651.58 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  18334. 1651.58 s [extra] +++ OK, passed 100 tests.
  18335. 1651.58 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  18336. 1651.58 s [extra] +++ OK, passed 100 tests.
  18337. 1651.58 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  18338. 1651.58 s [extra] +++ OK, passed 100 tests.
  18339. 1651.58 s [extra] line1 "" == ("", "")
  18340. 1651.58 s [extra] +++ OK, passed 100 tests.
  18341. 1651.58 s [extra] line1 "test" == ("test","")
  18342. 1651.58 s [extra] +++ OK, passed 100 tests.
  18343. 1651.58 s [extra] line1 "test\n" == ("test","")
  18344. 1651.58 s [extra] +++ OK, passed 100 tests.
  18345. 1651.58 s [extra] line1 "test\nrest" == ("test","rest")
  18346. 1651.58 s [extra] +++ OK, passed 100 tests.
  18347. 1651.58 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  18348. 1651.58 s [extra] +++ OK, passed 100 tests.
  18349. 1651.58 s [extra] escapeHTML "this is a test" == "this is a test"
  18350. 1651.58 s [extra] +++ OK, passed 100 tests.
  18351. 1651.58 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  18352. 1651.58 s [extra] +++ OK, passed 100 tests.
  18353. 1651.58 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  18354. 1651.58 s [extra] +++ OK, passed 100 tests.
  18355. 1651.58 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  18356. 1651.58 s [extra] +++ OK, passed 100 tests.
  18357. 1651.58 s [extra] escapeJSON "this is a test" == "this is a test"
  18358. 1651.58 s [extra] +++ OK, passed 100 tests.
  18359. 1651.58 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  18360. 1651.58 s [extra] +++ OK, passed 100 tests.
  18361. 1651.58 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  18362. 1651.58 s [extra] +++ OK, passed 100 tests.
  18363. 1651.59 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  18364. 1651.59 s [extra] +++ OK, passed 100 tests.
  18365. 1651.59 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  18366. 1651.59 s [extra] +++ OK, passed 100 tests.
  18367. 1651.59 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  18368. 1651.59 s [extra] +++ OK, passed 100 tests.
  18369. 1651.59 s [extra] maximumOn id [] == undefined
  18370. 1651.59 s [extra] +++ OK, passed 100 tests.
  18371. 1651.59 s [extra] maximumOn length ["test","extra","a"] == "extra"
  18372. 1651.59 s [extra] +++ OK, passed 100 tests.
  18373. 1651.59 s [extra] minimumOn id [] == undefined
  18374. 1651.59 s [extra] +++ OK, passed 100 tests.
  18375. 1651.59 s [extra] minimumOn length ["test","extra","a"] == "a"
  18376. 1651.59 s [extra] +++ OK, passed 100 tests.
  18377. 1651.59 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  18378. 1651.59 s [extra] +++ OK, passed 100 tests.
  18379. 1651.59 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  18380. 1651.59 s [extra] +++ OK, passed 100 tests.
  18381. 1651.59 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  18382. 1651.59 s [extra] +++ OK, passed 100 tests.
  18383. 1651.59 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18384. 1651.59 s [extra] +++ OK, passed 100 tests.
  18385. 1651.59 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18386. 1651.59 s [extra] +++ OK, passed 100 tests.
  18387. 1651.59 s [extra] sum' [1, 2, 3] == 6
  18388. 1651.59 s [extra] +++ OK, passed 100 tests.
  18389. 1651.59 s [extra] sumOn' read ["1", "2", "3"] == 6
  18390. 1651.59 s [extra] +++ OK, passed 100 tests.
  18391. 1651.59 s [extra] product' [1, 2, 4] == 8
  18392. 1651.59 s [extra] +++ OK, passed 100 tests.
  18393. 1651.59 s [extra] productOn' read ["1", "2", "4"] == 8
  18394. 1651.59 s [extra] +++ OK, passed 100 tests.
  18395. 1651.59 s [extra] merge "ace" "bd" == "abcde"
  18396. 1651.59 s [extra] +++ OK, passed 100 tests.
  18397. 1651.59 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  18398. 1651.59 s [extra] +++ OK, passed 100 tests.
  18399. 1651.59 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  18400. 1651.59 s [extra] +++ OK, passed 100 tests.
  18401. 1651.59 s [extra] replace "el" "e" "Hello" == "Helo"
  18402. 1651.59 s [extra] +++ OK, passed 100 tests.
  18403. 1651.59 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  18404. 1651.59 s [extra] +++ OK, passed 100 tests.
  18405. 1651.59 s [extra] replace "" "x" "" == "x"
  18406. 1651.59 s [extra] +++ OK, passed 100 tests.
  18407. 1651.59 s [extra] \xs ys -> replace xs xs ys == ys
  18408. 1651.60 s [extra] +++ OK, passed 100 tests.
  18409. 1651.60 s [extra] breakEnd isLower "youRE" == ("you","RE")
  18410. 1651.60 s [extra] +++ OK, passed 100 tests.
  18411. 1651.60 s [extra] breakEnd isLower "youre" == ("youre","")
  18412. 1651.60 s [extra] +++ OK, passed 100 tests.
  18413. 1651.60 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  18414. 1651.60 s [extra] +++ OK, passed 100 tests.
  18415. 1651.60 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  18416. 1651.60 s [extra] +++ OK, passed 100 tests.
  18417. 1651.60 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  18418. 1651.60 s [extra] +++ OK, passed 100 tests.
  18419. 1651.60 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  18420. 1651.60 s [extra] +++ OK, passed 100 tests.
  18421. 1651.60 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  18422. 1651.60 s [extra] +++ OK, passed 100 tests.
  18423. 1651.60 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  18424. 1651.60 s [extra] +++ OK, passed 100 tests.
  18425. 1651.60 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  18426. 1651.60 s [extra] +++ OK, passed 100 tests.
  18427. 1651.60 s [extra] \s -> wordsBy isSpace s == words s
  18428. 1651.60 s [extra] +++ OK, passed 100 tests.
  18429. 1651.60 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  18430. 1651.60 s [extra] +++ OK, passed 100 tests.
  18431. 1651.60 s [extra] \s -> linesBy (== '\n') s == lines s
  18432. 1651.60 s [extra] +++ OK, passed 100 tests.
  18433. 1651.60 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  18434. 1651.60 s [extra] +++ OK, passed 100 tests.
  18435. 1651.60 s [extra] firstJust id [Nothing,Just 3] == Just 3
  18436. 1651.60 s [extra] +++ OK, passed 100 tests.
  18437. 1651.60 s [extra] firstJust id [Nothing,Nothing] == Nothing
  18438. 1651.60 s [extra] +++ OK, passed 100 tests.
  18439. 1651.60 s [extra] drop1 "" == ""
  18440. 1651.60 s [extra] +++ OK, passed 100 tests.
  18441. 1651.60 s [extra] drop1 "test" == "est"
  18442. 1651.60 s [extra] +++ OK, passed 100 tests.
  18443. 1651.60 s [extra] \xs -> drop 1 xs == drop1 xs
  18444. 1651.60 s [extra] +++ OK, passed 100 tests.
  18445. 1651.60 s [extra] dropEnd1 "" == ""
  18446. 1651.60 s [extra] +++ OK, passed 100 tests.
  18447. 1651.60 s [extra] dropEnd1 "test" == "tes"
  18448. 1651.60 s [extra] +++ OK, passed 100 tests.
  18449. 1651.60 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  18450. 1651.60 s [extra] +++ OK, passed 100 tests.
  18451. 1651.60 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  18452. 1651.60 s [extra] +++ OK, passed 100 tests.
  18453. 1651.60 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  18454. 1651.62 s [extra] +++ OK, passed 100 tests.
  18455. 1651.62 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  18456. 1651.62 s [extra] +++ OK, passed 100 tests.
  18457. 1651.62 s [extra] breakOn "/" "foobar" == ("foobar", "")
  18458. 1651.62 s [extra] +++ OK, passed 100 tests.
  18459. 1651.62 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  18460. 1651.62 s [extra] +++ OK, passed 100 tests.
  18461. 1651.62 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  18462. 1651.62 s [extra] +++ OK, passed 100 tests.
  18463. 1651.62 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  18464. 1651.62 s [extra] +++ OK, passed 100 tests.
  18465. 1651.62 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  18466. 1651.62 s [extra] +++ OK, passed 100 tests.
  18467. 1651.62 s [extra] splitOn "x" "x" == ["",""]
  18468. 1651.62 s [extra] +++ OK, passed 100 tests.
  18469. 1651.62 s [extra] splitOn "x" "" == [""]
  18470. 1651.62 s [extra] +++ OK, passed 100 tests.
  18471. 1651.62 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  18472. 1651.62 s [extra] +++ OK, passed 100 tests; 16 discarded.
  18473. 1651.62 s [extra] \c x -> splitOn [c] x == split (==c) x
  18474. 1651.62 s [extra] +++ OK, passed 100 tests.
  18475. 1651.62 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  18476. 1651.62 s [extra] +++ OK, passed 100 tests.
  18477. 1651.62 s [extra] split (== 'a') "" == [""]
  18478. 1651.62 s [extra] +++ OK, passed 100 tests.
  18479. 1651.62 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  18480. 1651.62 s [extra] +++ OK, passed 100 tests.
  18481. 1651.62 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  18482. 1651.62 s [extra] +++ OK, passed 100 tests.
  18483. 1651.62 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  18484. 1651.62 s [extra] +++ OK, passed 100 tests.
  18485. 1651.62 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  18486. 1651.62 s [extra] +++ OK, passed 100 tests.
  18487. 1651.62 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  18488. 1651.62 s [extra] +++ OK, passed 100 tests.
  18489. 1651.62 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  18490. 1651.62 s [extra] +++ OK, passed 100 tests.
  18491. 1651.62 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  18492. 1651.62 s [extra] +++ OK, passed 100 tests.
  18493. 1651.62 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  18494. 1651.62 s [extra] +++ OK, passed 100 tests.
  18495. 1651.62 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  18496. 1651.62 s [extra] +++ OK, passed 100 tests.
  18497. 1651.62 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  18498. 1651.62 s [extra] +++ OK, passed 100 tests.
  18499. 1651.62 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  18500. 1651.62 s [extra] +++ OK, passed 100 tests.
  18501. 1651.62 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  18502. 1651.62 s [extra] +++ OK, passed 100 tests.
  18503. 1651.62 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  18504. 1651.62 s [extra] +++ OK, passed 100 tests.
  18505. 1651.62 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  18506. 1651.62 s [extra] +++ OK, passed 100 tests.
  18507. 1651.62 s [extra] stripSuffix "" "baz" == Just "baz"
  18508. 1651.62 s [extra] +++ OK, passed 100 tests.
  18509. 1651.62 s [extra] stripSuffix "foo" "quux" == Nothing
  18510. 1651.62 s [extra] +++ OK, passed 100 tests.
  18511. 1651.62 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  18512. 1651.62 s [extra] +++ OK, passed 100 tests.
  18513. 1651.62 s [extra] stripInfix "/" "foobar" == Nothing
  18514. 1651.62 s [extra] +++ OK, passed 100 tests.
  18515. 1651.62 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  18516. 1651.62 s [extra] +++ OK, passed 100 tests.
  18517. 1651.62 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  18518. 1651.62 s [extra] +++ OK, passed 100 tests.
  18519. 1651.62 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  18520. 1651.62 s [extra] +++ OK, passed 100 tests.
  18521. 1651.62 s [extra] chunksOf 8 "" == []
  18522. 1651.62 s [extra] +++ OK, passed 100 tests.
  18523. 1651.62 s [extra] chunksOf 0 "test" == undefined
  18524. 1651.62 s [extra] +++ OK, passed 100 tests.
  18525. 1651.62 s [extra] nubSort "this is a test" == " aehist"
  18526. 1651.62 s [extra] +++ OK, passed 100 tests.
  18527. 1651.62 s [extra] \xs -> nubSort xs == nub (sort xs)
  18528. 1651.62 s [extra] +++ OK, passed 100 tests.
  18529. 1651.62 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  18530. 1651.62 s [extra] +++ OK, passed 100 tests.
  18531. 1651.62 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  18532. 1651.62 s [extra] +++ OK, passed 100 tests.
  18533. 1651.62 s [extra] nubOrd "this is a test" == "this ae"
  18534. 1651.62 s [extra] +++ OK, passed 100 tests.
  18535. 1651.62 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  18536. 1651.62 s [extra] +++ OK, passed 100 tests.
  18537. 1651.62 s [extra] \xs -> nubOrd xs == nub xs
  18538. 1651.62 s [extra] +++ OK, passed 100 tests.
  18539. 1651.62 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  18540. 1651.62 s [extra] +++ OK, passed 100 tests.
  18541. 1651.62 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  18542. 1651.62 s [extra] +++ OK, passed 100 tests.
  18543. 1651.62 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  18544. 1651.63 s [extra] +++ OK, passed 100 tests.
  18545. 1651.63 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  18546. 1651.63 s [extra] +++ OK, passed 100 tests.
  18547. 1651.63 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  18548. 1651.63 s [extra] +++ OK, passed 100 tests.
  18549. 1651.63 s [extra] comparingLength [1,2,3] [False] == GT
  18550. 1651.63 s [extra] +++ OK, passed 100 tests.
  18551. 1651.63 s [extra] comparingLength [1,2] "ab" == EQ
  18552. 1651.63 s [extra] +++ OK, passed 100 tests.
  18553. 1651.63 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  18554. 1651.63 s [extra] +++ OK, passed 100 tests.
  18555. 1651.63 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  18556. 1651.63 s [extra] +++ OK, passed 100 tests.
  18557. 1651.63 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  18558. 1651.63 s [extra] +++ OK, passed 100 tests.
  18559. 1651.63 s [extra] mwhen True "test" == "test"
  18560. 1651.63 s [extra] +++ OK, passed 100 tests.
  18561. 1651.63 s [extra] mwhen False "test" == ""
  18562. 1651.63 s [extra] +++ OK, passed 100 tests.
  18563. 1651.63 s [extra] first succ (1,"test") == (2,"test")
  18564. 1651.63 s [extra] +++ OK, passed 100 tests.
  18565. 1651.63 s [extra] second reverse (1,"test") == (1,"tset")
  18566. 1651.63 s [extra] +++ OK, passed 100 tests.
  18567. 1651.63 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  18568. 1651.63 s [extra] +++ OK, passed 100 tests.
  18569. 1651.63 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  18570. 1651.63 s [extra] +++ OK, passed 100 tests.
  18571. 1651.63 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  18572. 1651.63 s [extra] +++ OK, passed 100 tests.
  18573. 1651.63 s [extra] (succ &&& pred) 1 == (2,0)
  18574. 1651.63 s [extra] +++ OK, passed 100 tests.
  18575. 1651.63 s [extra] dupe 12 == (12, 12)
  18576. 1651.63 s [extra] +++ OK, passed 100 tests.
  18577. 1651.63 s [extra] both succ (1,2) == (2,3)
  18578. 1651.63 s [extra] +++ OK, passed 100 tests.
  18579. 1651.63 s [extra] first3 succ (1,1,1) == (2,1,1)
  18580. 1651.63 s [extra] +++ OK, passed 100 tests.
  18581. 1651.63 s [extra] second3 succ (1,1,1) == (1,2,1)
  18582. 1651.63 s [extra] +++ OK, passed 100 tests.
  18583. 1651.63 s [extra] third3 succ (1,1,1) == (1,1,2)
  18584. 1651.63 s [extra] +++ OK, passed 100 tests.
  18585. 1651.63 s [extra] \x -> readVersion (showVersion x) == x
  18586. 1651.63 s [extra] +++ OK, passed 100 tests.
  18587. 1651.63 s [extra] readVersion "hello" == undefined
  18588. 1651.63 s [extra] +++ OK, passed 100 tests.
  18589. 1651.63 s [extra] showDP 4 pi == "3.1416"
  18590. 1651.63 s [extra] +++ OK, passed 100 tests.
  18591. 1651.63 s [extra] showDP 0 pi == "3"
  18592. 1651.63 s [extra] +++ OK, passed 100 tests.
  18593. 1651.63 s [extra] showDP 2 3 == "3.00"
  18594. 1651.63 s [extra] +++ OK, passed 100 tests.
  18595. 1651.63 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  18596. 1651.63 s [extra] +++ OK, passed 100 tests.
  18597. 1651.63 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  18598. 1651.63 s [extra] +++ OK, passed 100 tests.
  18599. 1651.63 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  18600. 1651.63 s [extra] +++ OK, passed 100 tests.
  18601. 1651.63 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  18602. 1651.63 s [extra] +++ OK, passed 100 tests.
  18603. 1651.63 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  18604. 1651.63 s [extra] +++ OK, passed 100 tests.
  18605. 1651.63 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18606. 1651.63 s [extra] +++ OK, passed 100 tests.
  18607. 1651.63 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18608. 1651.63 s [extra] +++ OK, passed 100 tests.
  18609. 1651.63 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  18610. 1651.64 s [extra] +++ OK, passed 100 tests.
  18611. 1651.64 s [extra] isWindows == (os == "mingw32")
  18612. 1651.64 s [extra] +++ OK, passed 100 tests.
  18613. 1651.64 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  18614. 1652.58 s [extra] +++ OK, passed 100 tests.
  18615. 1652.58 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  18616. 1652.60 s [extra] +++ OK, passed 100 tests.
  18617. 1652.60 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  18618. 1652.62 s [extra] +++ OK, passed 100 tests.
  18619. 1652.62 s [extra] captureOutput (print 1) == pure ("1\n",())
  18620. 1652.62 s [extra] +++ OK, passed 100 tests.
  18621. 1652.62 s [extra] withTempFile doesFileExist == pure True
  18622. 1652.62 s [extra] +++ OK, passed 100 tests.
  18623. 1652.62 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  18624. 1652.63 s [extra] +++ OK, passed 100 tests.
  18625. 1652.63 s [extra] withTempFile readFile' == pure ""
  18626. 1652.63 s [extra] +++ OK, passed 100 tests.
  18627. 1652.63 s [extra] withTempDir doesDirectoryExist == pure True
  18628. 1652.63 s [extra] +++ OK, passed 100 tests.
  18629. 1652.63 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  18630. 1652.63 s [extra] +++ OK, passed 100 tests.
  18631. 1652.63 s [extra] withTempDir listFiles == pure []
  18632. 1652.63 s [extra] +++ OK, passed 100 tests.
  18633. 1652.63 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  18634. 1652.63 s [extra] +++ OK, passed 100 tests.
  18635. 1652.63 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  18636. 1652.63 s [extra] +++ OK, passed 100 tests.
  18637. 1652.63 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  18638. 1652.63 s [extra] +++ OK, passed 100 tests.
  18639. 1652.63 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  18640. 1652.63 s [extra] +++ OK, passed 100 tests.
  18641. 1652.63 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  18642. 1652.63 s [extra] +++ OK, passed 100 tests.
  18643. 1652.63 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  18644. 1652.63 s [extra] +++ OK, passed 100 tests.
  18645. 1652.63 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  18646. 1653.63 s [extra] +++ OK, passed 100 tests.
  18647. 1653.63 s [extra] timeout (-3) (print 1) == pure Nothing
  18648. 1653.63 s [extra] +++ OK, passed 100 tests.
  18649. 1653.63 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  18650. 1653.63 s [extra] +++ OK, passed 100 tests.
  18651. 1653.63 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  18652. 1653.74 s [extra] 0.100374742
  18653. 1653.74 s [extra] +++ OK, passed 100 tests.
  18654. 1653.74 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  18655. 1653.84 s [extra] +++ OK, passed 100 tests.
  18656. 1653.84 s [extra] showDuration 3.435 == "3.44s"
  18657. 1653.84 s [extra] +++ OK, passed 100 tests.
  18658. 1653.84 s [extra] showDuration 623.8 == "10m24s"
  18659. 1653.84 s [extra] +++ OK, passed 100 tests.
  18660. 1653.84 s [extra] showDuration 62003.8 == "17h13m"
  18661. 1653.84 s [extra] +++ OK, passed 100 tests.
  18662. 1653.84 s [extra] showDuration 1e8 == "27777h47m"
  18663. 1653.84 s [extra] +++ OK, passed 100 tests.
  18664. 1653.84 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  18665. 1653.84 s [extra] +++ OK, passed 100 tests.
  18666. 1653.84 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  18667. 1654.84 s [extra] +++ OK, passed 100 tests.
  18668. 1654.84 s [extra] Extra export
  18669. 1654.84 s [extra] +++ OK, passed 100 tests.
  18670. 1654.84 s [extra] withTempFile
  18671. 1654.85 s [extra] ....done
  18672. 1654.94 s [extra] withTempDir
  18673. 1654.94 s [extra] ....done
  18674. 1654.94 s [extra] retry
  18675. 1654.94 s [extra] +++ OK, passed 100 tests.
  18676. 1654.94 s [extra] barrier
  18677. 1654.94 s [extra] Success (325 tests)
  18678. 1654.94 s [extra] Test suite extra-test: PASS
  18679. 1654.94 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  18680. 1654.94 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  18681. 1654.94 s [extra] Phase: haddockPhase
  18682. 1655.36 s [extra] Preprocessing library for extra-1.8.1...
  18683. 1655.37 s [extra] Running Haddock on library for extra-1.8.1...
  18684. 1656.37 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing ) [HIE file is missing]
  18685. 1656.42 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing ) [HIE file is missing]
  18686. 1656.43 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing ) [HIE file is missing]
  18687. 1656.47 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing ) [HIE file is missing]
  18688. 1656.48 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing ) [HIE file is missing]
  18689. 1656.51 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing ) [HIE file is missing]
  18690. 1656.51 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing ) [HIE file is missing]
  18691. 1656.81 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing ) [HIE file is missing]
  18692. 1656.81 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing ) [HIE file is missing]
  18693. 1656.84 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing ) [HIE file is missing]
  18694. 1656.84 s [haskell-language-server] Preprocessing library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0...
  18695. 1656.84 s [haskell-language-server] Building library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0...
  18696. 1656.85 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing ) [HIE file is missing]
  18697. 1656.96 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing ) [HIE file is missing]
  18698. 1656.97 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 )
  18699. 1657.02 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing ) [HIE file is missing]
  18700. 1657.03 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing ) [HIE file is missing]
  18701. 1657.08 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing ) [HIE file is missing]
  18702. 1657.11 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing ) [HIE file is missing]
  18703. 1657.12 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing ) [HIE file is missing]
  18704. 1657.25 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing ) [HIE file is missing]
  18705. 1657.25 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing ) [HIE file is missing]
  18706. 1657.27 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing ) [HIE file is missing]
  18707. 1657.30 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing ) [HIE file is missing]
  18708. 1657.41 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing ) [HIE file is missing]
  18709. 1657.41 s [extra] Haddock coverage:
  18710. 1657.58 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  18711. 1657.58 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  18712. 1657.58 s [extra] Warning: 'Arrow' is out of scope.
  18713. 1657.58 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18714. 1657.58 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  18715. 1657.58 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  18716. 1657.58 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  18717. 1657.59 s [extra] Warning: 'unzip' is ambiguous. It is defined
  18718. 1657.59 s [extra] * in ‘GHC.Internal.Data.Functor’
  18719. 1657.59 s [extra] * in ‘GHC.Internal.List’
  18720. 1657.59 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18721. 1657.59 s [extra] by specifying the type/value namespace explicitly.
  18722. 1657.59 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  18723. 1657.59 s [extra] Warning: '(:)' is out of scope.
  18724. 1657.59 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18725. 1657.59 s [extra] Warning: 'firstJustM' is out of scope.
  18726. 1657.59 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18727. 1657.60 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  18728. 1657.60 s [extra] Warning: 'Version' is ambiguous. It is defined
  18729. 1657.60 s [extra] * in ‘GHC.Internal.Data.Version’
  18730. 1657.60 s [extra] * in ‘GHC.Internal.Data.Version’
  18731. 1657.60 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18732. 1657.60 s [extra] by specifying the type/value namespace explicitly.
  18733. 1657.60 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  18734. 1657.60 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  18735. 1657.60 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  18736. 1657.60 s [extra] Warning: 'fromJust' is out of scope.
  18737. 1657.60 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18738. 1657.60 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  18739. 1657.60 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  18740. 1657.60 s [extra] * in ‘GHC.Internal.IO.Exception’
  18741. 1657.60 s [extra] * in ‘GHC.Internal.IO.Exception’
  18742. 1657.60 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18743. 1657.60 s [extra] by specifying the type/value namespace explicitly.
  18744. 1657.60 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  18745. 1657.60 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  18746. 1657.60 s [extra] * in ‘GHC.Internal.Exception.Type’
  18747. 1657.60 s [extra] * in ‘GHC.Internal.Exception.Type’
  18748. 1657.60 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18749. 1657.60 s [extra] by specifying the type/value namespace explicitly.
  18750. 1657.60 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  18751. 1657.60 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  18752. 1657.60 s [extra] * in ‘GHC.Internal.Exception’
  18753. 1657.60 s [extra] * in ‘GHC.Internal.Exception’
  18754. 1657.60 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18755. 1657.60 s [extra] by specifying the type/value namespace explicitly.
  18756. 1657.60 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  18757. 1657.60 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  18758. 1657.61 s [extra] Warning: 'find' is out of scope.
  18759. 1657.61 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18760. 1657.61 s [extra] Warning: 'mconcatMap' is out of scope.
  18761. 1657.61 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18762. 1657.61 s [extra] Warning: 'partition' is out of scope.
  18763. 1657.61 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18764. 1657.61 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  18765. 1657.61 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  18766. 1657.61 s [extra] Missing documentation for:
  18767. 1657.61 s [extra] Module header
  18768. 1657.61 s [extra] Warning: 'Lock' is ambiguous. It is defined
  18769. 1657.61 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  18770. 1657.61 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  18771. 1657.61 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18772. 1657.61 s [extra] by specifying the type/value namespace explicitly.
  18773. 1657.61 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  18774. 1657.61 s [extra] Warning: 'Var' is ambiguous. It is defined
  18775. 1657.61 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  18776. 1657.61 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  18777. 1657.61 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18778. 1657.61 s [extra] by specifying the type/value namespace explicitly.
  18779. 1657.61 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  18780. 1657.61 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  18781. 1657.61 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  18782. 1657.61 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  18783. 1657.61 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18784. 1657.61 s [extra] by specifying the type/value namespace explicitly.
  18785. 1657.61 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  18786. 1657.61 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  18787. 1657.62 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  18788. 1657.62 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  18789. 1657.62 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  18790. 1657.62 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  18791. 1657.62 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  18792. 1657.62 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  18793. 1657.63 s [extra] 100% (270 /270) in 'Extra'
  18794. 1657.63 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  18795. 1657.89 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  18796. 1657.89 s [extra] - GHC.Internal.Generics.Rep1_Solo
  18797. 1657.89 s [extra] - GHC.Internal.Generics.Rep_Solo
  18798. 1659.73 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 )
  18799. 1663.76 s [extra] Documentation created: dist/doc/html/extra, dist/doc/html/extra/extra.txt
  18800. 1664.20 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  18801. 1664.26 s [extra] Phase: installPhase
  18802. 1664.33 s [extra] Installing library in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  18803. 1664.78 s [extra] Phase: fixupPhase
  18804. 1664.80 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1
  18805. 1664.82 s [extra] shrinking /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSextra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX-ghc9.12.2.so
  18806. 1664.82 s [extra] checking for references to /build/ in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1...
  18807. 1664.87 s [extra] patching script interpreter paths in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1
  18808. 1664.88 s [extra] stripping (with command strip and flags -S -p) in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib
  18809. 1664.99 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  18810. 1665.01 s [extra] checking for references to /build/ in /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc...
  18811. 1665.04 s [extra] patching script interpreter paths in /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  18812. 1665.18 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1 /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  18813. 1665.58 s [extra:post-build] Nothing to push - all store paths are already on Cachix.
  18814. 1665.63 s [extra:post-build] Uploading to the NixCI cache: /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1 /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  18815. 1665.67 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18816. 1665.80 s [extra:post-build] copying 1 paths...
  18817. 1665.80 s [extra:post-build] copying path '/nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1' to 'https://cache.nix-ci.com'...
  18818. 1667.47 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18819. 1667.58 s [extra:post-build] copying 0 paths...
  18820. 1667.60 s Progress: 21 of 31 built (1 building), 593 of 593 downloaded from cache
  18821. 1667.65 s Building /nix/store/wcyb838h79fi5fk0y7w8jznhlnsczw6s-algebraic-graphs-0.7.drv
  18822. 1667.75 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  18823. 1667.75 s [algebraic-graphs] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  18824. 1667.95 s [algebraic-graphs] Phase: unpackPhase
  18825. 1667.96 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  18826. 1667.97 s [algebraic-graphs] source root is algebraic-graphs-0.7
  18827. 1667.97 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  18828. 1667.98 s [algebraic-graphs] Phase: patchPhase
  18829. 1667.98 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  18830. 1667.99 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  18831. 1667.99 s [algebraic-graphs] patching file algebraic-graphs.cabal
  18832. 1668.05 s [algebraic-graphs] Phase: compileBuildDriverPhase
  18833. 1668.06 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.KMqqNNGxxf/setup-package.conf.d -threaded
  18834. 1668.11 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.KMqqNNGxxf/Main.o )
  18835. 1668.23 s [algebraic-graphs] [2 of 2] Linking Setup
  18836. 1668.48 s [haskell-language-server] Preprocessing library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0...
  18837. 1668.48 s [haskell-language-server] Building library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0...
  18838. 1668.57 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  18839. 1668.57 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  18840. 1668.57 s [haskell-language-server] but were not needed for compilation:
  18841. 1668.57 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk)
  18842. 1668.57 s [haskell-language-server]
  18843. 1668.59 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 )
  18844. 1669.90 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  18845. 1669.91 s [algebraic-graphs] Phase: configurePhase
  18846. 1669.92 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.KMqqNNGxxf/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/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  18847. 1669.94 s [algebraic-graphs] Using Parsec parser
  18848. 1669.94 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  18849. 1669.97 s [algebraic-graphs] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  18850. 1669.97 s [algebraic-graphs] 'ghc' version < 9.12):
  18851. 1669.97 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  18852. 1669.97 s [algebraic-graphs] 9.12.2
  18853. 1670.53 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  18854. 1670.53 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  18855. 1670.53 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  18856. 1670.53 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  18857. 1670.53 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  18858. 1670.53 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  18859. 1670.53 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  18860. 1670.53 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  18861. 1670.53 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  18862. 1670.53 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  18863. 1670.53 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  18864. 1670.53 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  18865. 1670.53 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  18866. 1670.53 s [algebraic-graphs] inspection-testing-0.6.2
  18867. 1670.53 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  18868. 1670.53 s [algebraic-graphs] Source component graph:
  18869. 1670.53 s [algebraic-graphs] component lib
  18870. 1670.53 s [algebraic-graphs] component test:main dependency lib
  18871. 1670.53 s [algebraic-graphs] Configured component graph:
  18872. 1670.53 s [algebraic-graphs] component algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  18873. 1670.53 s [algebraic-graphs] include array-0.5.8.0-d6d4
  18874. 1670.53 s [algebraic-graphs] include base-4.21.0.0-b334
  18875. 1670.53 s [algebraic-graphs] include containers-0.7-d79e
  18876. 1670.53 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  18877. 1670.53 s [algebraic-graphs] include transformers-0.6.1.2-2558
  18878. 1670.53 s [algebraic-graphs] component algebraic-graphs-0.7-FKZbJT4N7FF2rJCgZTt0Vb-main
  18879. 1670.53 s [algebraic-graphs] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  18880. 1670.53 s [algebraic-graphs] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  18881. 1670.53 s [algebraic-graphs] include array-0.5.8.0-d6d4
  18882. 1670.53 s [algebraic-graphs] include base-4.21.0.0-b334
  18883. 1670.53 s [algebraic-graphs] include containers-0.7-d79e
  18884. 1670.53 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  18885. 1670.53 s [algebraic-graphs] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  18886. 1670.53 s [algebraic-graphs] include inspection-testing-0.6.2-BXrtKPpIYmk3oPkvyBHJek
  18887. 1670.53 s [algebraic-graphs] include transformers-0.6.1.2-2558
  18888. 1670.53 s [algebraic-graphs] Linked component graph:
  18889. 1670.53 s [algebraic-graphs] unit algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  18890. 1670.53 s [algebraic-graphs] include array-0.5.8.0-d6d4
  18891. 1670.53 s [algebraic-graphs] include base-4.21.0.0-b334
  18892. 1670.53 s [algebraic-graphs] include containers-0.7-d79e
  18893. 1670.53 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  18894. 1670.53 s [algebraic-graphs] include transformers-0.6.1.2-2558
  18895. 1670.54 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Data.Graph.Typed
  18896. 1670.54 s [algebraic-graphs] unit algebraic-graphs-0.7-FKZbJT4N7FF2rJCgZTt0Vb-main
  18897. 1670.54 s [algebraic-graphs] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  18898. 1670.54 s [algebraic-graphs] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  18899. 1670.54 s [algebraic-graphs] include array-0.5.8.0-d6d4
  18900. 1670.54 s [algebraic-graphs] include base-4.21.0.0-b334
  18901. 1670.54 s [algebraic-graphs] include containers-0.7-d79e
  18902. 1670.54 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  18903. 1670.54 s [algebraic-graphs] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  18904. 1670.54 s [algebraic-graphs] include inspection-testing-0.6.2-BXrtKPpIYmk3oPkvyBHJek
  18905. 1670.54 s [algebraic-graphs] include transformers-0.6.1.2-2558
  18906. 1670.54 s [algebraic-graphs] Ready component graph:
  18907. 1670.54 s [algebraic-graphs] definite algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  18908. 1670.54 s [algebraic-graphs] depends array-0.5.8.0-d6d4
  18909. 1670.54 s [algebraic-graphs] depends base-4.21.0.0-b334
  18910. 1670.54 s [algebraic-graphs] depends containers-0.7-d79e
  18911. 1670.54 s [algebraic-graphs] depends deepseq-1.5.1.0-3c62
  18912. 1670.54 s [algebraic-graphs] depends transformers-0.6.1.2-2558
  18913. 1670.54 s [algebraic-graphs] definite algebraic-graphs-0.7-FKZbJT4N7FF2rJCgZTt0Vb-main
  18914. 1670.54 s [algebraic-graphs] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  18915. 1670.54 s [algebraic-graphs] depends algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  18916. 1670.54 s [algebraic-graphs] depends array-0.5.8.0-d6d4
  18917. 1670.54 s [algebraic-graphs] depends base-4.21.0.0-b334
  18918. 1670.54 s [algebraic-graphs] depends containers-0.7-d79e
  18919. 1670.54 s [algebraic-graphs] depends deepseq-1.5.1.0-3c62
  18920. 1670.54 s [algebraic-graphs] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  18921. 1670.54 s [algebraic-graphs] depends inspection-testing-0.6.2-BXrtKPpIYmk3oPkvyBHJek
  18922. 1670.54 s [algebraic-graphs] depends transformers-0.6.1.2-2558
  18923. 1670.54 s [algebraic-graphs] Using Cabal-3.14.1.0 compiled by ghc-9.12
  18924. 1670.54 s [algebraic-graphs] Using compiler: ghc-9.12.2
  18925. 1670.54 s [algebraic-graphs] Using install prefix:
  18926. 1670.54 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  18927. 1670.54 s [algebraic-graphs] Executables installed in:
  18928. 1670.54 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/bin
  18929. 1670.54 s [algebraic-graphs] Libraries installed in:
  18930. 1670.54 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  18931. 1670.54 s [algebraic-graphs] Dynamic Libraries installed in:
  18932. 1670.54 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  18933. 1670.54 s [algebraic-graphs] Private executables installed in:
  18934. 1670.54 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7
  18935. 1670.54 s [algebraic-graphs] Data files installed in:
  18936. 1670.54 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7
  18937. 1670.54 s [algebraic-graphs] Documentation installed in:
  18938. 1670.54 s [algebraic-graphs] /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  18939. 1670.54 s [algebraic-graphs] Configuration files installed in:
  18940. 1670.54 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/etc
  18941. 1670.54 s [algebraic-graphs] No alex found
  18942. 1670.54 s [algebraic-graphs] Using ar found on system at:
  18943. 1670.54 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18944. 1670.54 s [algebraic-graphs] No c2hs found
  18945. 1670.54 s [algebraic-graphs] No cpphs found
  18946. 1670.54 s [algebraic-graphs] No doctest found
  18947. 1670.54 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  18948. 1670.54 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18949. 1670.54 s [algebraic-graphs] Using ghc version 9.12.2 found on system at:
  18950. 1670.54 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  18951. 1670.54 s [algebraic-graphs] Using ghc-pkg version 9.12.2 found on system at:
  18952. 1670.54 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  18953. 1670.54 s [algebraic-graphs] No ghcjs found
  18954. 1670.54 s [algebraic-graphs] No ghcjs-pkg found
  18955. 1670.54 s [algebraic-graphs] No greencard found
  18956. 1670.54 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  18957. 1670.54 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  18958. 1670.54 s [algebraic-graphs] No happy found
  18959. 1670.54 s [algebraic-graphs] No haskell-suite found
  18960. 1670.54 s [algebraic-graphs] No haskell-suite-pkg found
  18961. 1670.54 s [algebraic-graphs] No hmake found
  18962. 1670.54 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  18963. 1670.54 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  18964. 1670.54 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  18965. 1670.55 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  18966. 1670.55 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  18967. 1670.55 s [algebraic-graphs] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  18968. 1670.55 s [algebraic-graphs] No jhc found
  18969. 1670.55 s [algebraic-graphs] Using ld found on system at:
  18970. 1670.55 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  18971. 1670.55 s [algebraic-graphs] No pkg-config found
  18972. 1670.55 s [algebraic-graphs] Using runghc version 9.12.2 found on system at:
  18973. 1670.55 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  18974. 1670.55 s [algebraic-graphs] Using strip version 2.44 found on system at:
  18975. 1670.55 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18976. 1670.55 s [algebraic-graphs] Using tar found on system at:
  18977. 1670.55 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18978. 1670.55 s [algebraic-graphs] No uhc found
  18979. 1670.74 s [algebraic-graphs] Phase: buildPhase
  18980. 1670.81 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  18981. 1670.82 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  18982. 1670.92 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 )
  18983. 1670.94 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 )
  18984. 1671.56 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 )
  18985. 1671.56 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 )
  18986. 1671.56 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 )
  18987. 1671.56 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 )
  18988. 1671.56 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 )
  18989. 1671.88 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 )
  18990. 1672.64 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 )
  18991. 1672.95 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 )
  18992. 1672.95 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  18993. 1674.13 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 )
  18994. 1674.42 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 )
  18995. 1674.56 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 )
  18996. 1674.93 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
  18997. 1675.03 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  18998. 1675.03 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  18999. 1675.03 s [haskell-language-server] but were not needed for compilation:
  19000. 1675.03 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-IZycf2oXopa6XoUj4s6ZBk)
  19001. 1675.03 s [haskell-language-server]
  19002. 1675.04 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 )
  19003. 1675.66 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 )
  19004. 1675.66 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 )
  19005. 1675.66 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 )
  19006. 1675.66 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19007. 1675.66 s [algebraic-graphs] In the use of ‘head’
  19008. 1675.66 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19009. 1675.66 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19010. 1675.66 s [algebraic-graphs] |
  19011. 1675.66 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19012. 1675.66 s [algebraic-graphs] | ^^^^
  19013. 1675.66 s [algebraic-graphs]
  19014. 1675.66 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19015. 1675.66 s [algebraic-graphs] In the use of ‘tail’
  19016. 1675.66 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19017. 1675.66 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19018. 1675.66 s [algebraic-graphs] |
  19019. 1675.66 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19020. 1675.66 s [algebraic-graphs] | ^^^^
  19021. 1675.66 s [algebraic-graphs]
  19022. 1675.66 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19023. 1675.66 s [algebraic-graphs] In the use of ‘head’
  19024. 1675.66 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19025. 1675.66 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19026. 1675.66 s [algebraic-graphs] |
  19027. 1675.66 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19028. 1675.66 s [algebraic-graphs] | ^^^^
  19029. 1675.66 s [algebraic-graphs]
  19030. 1675.66 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19031. 1675.66 s [algebraic-graphs] In the use of ‘tail’
  19032. 1675.66 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19033. 1675.66 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19034. 1675.66 s [algebraic-graphs] |
  19035. 1675.66 s [algebraic-graphs] 397 | bnd' = tail bnd
  19036. 1675.66 s [algebraic-graphs] | ^^^^
  19037. 1675.66 s [algebraic-graphs]
  19038. 1675.66 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 )
  19039. 1675.66 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 )
  19040. 1675.66 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19041. 1675.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19042. 1675.66 s [algebraic-graphs] will become an error in a future GHC release.
  19043. 1675.66 s [algebraic-graphs] Suggested fix:
  19044. 1675.66 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19045. 1675.66 s [algebraic-graphs] |
  19046. 1675.66 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19047. 1675.66 s [algebraic-graphs] | ^
  19048. 1675.66 s [algebraic-graphs]
  19049. 1675.66 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19050. 1675.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19051. 1675.66 s [algebraic-graphs] will become an error in a future GHC release.
  19052. 1675.66 s [algebraic-graphs] Suggested fix:
  19053. 1675.66 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19054. 1675.66 s [algebraic-graphs] |
  19055. 1675.66 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19056. 1675.66 s [algebraic-graphs] | ^
  19057. 1675.66 s [algebraic-graphs]
  19058. 1675.66 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19059. 1675.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19060. 1675.66 s [algebraic-graphs] will become an error in a future GHC release.
  19061. 1675.66 s [algebraic-graphs] Suggested fix:
  19062. 1675.66 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19063. 1675.66 s [algebraic-graphs] |
  19064. 1675.66 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19065. 1675.66 s [algebraic-graphs] | ^
  19066. 1675.66 s [algebraic-graphs]
  19067. 1675.66 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19068. 1675.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19069. 1675.66 s [algebraic-graphs] will become an error in a future GHC release.
  19070. 1675.66 s [algebraic-graphs] Suggested fix:
  19071. 1675.66 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19072. 1675.66 s [algebraic-graphs] |
  19073. 1675.66 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19074. 1675.66 s [algebraic-graphs] | ^
  19075. 1675.66 s [algebraic-graphs]
  19076. 1675.66 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19077. 1675.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19078. 1675.66 s [algebraic-graphs] will become an error in a future GHC release.
  19079. 1675.66 s [algebraic-graphs] Suggested fix:
  19080. 1675.66 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19081. 1675.66 s [algebraic-graphs] |
  19082. 1675.66 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19083. 1675.66 s [algebraic-graphs] | ^
  19084. 1675.66 s [algebraic-graphs]
  19085. 1675.66 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19086. 1675.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19087. 1675.66 s [algebraic-graphs] will become an error in a future GHC release.
  19088. 1675.66 s [algebraic-graphs] Suggested fix:
  19089. 1675.66 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19090. 1675.66 s [algebraic-graphs] |
  19091. 1675.66 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19092. 1675.66 s [algebraic-graphs] | ^
  19093. 1675.66 s [algebraic-graphs]
  19094. 1675.66 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19095. 1675.66 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19096. 1675.66 s [algebraic-graphs] will become an error in a future GHC release.
  19097. 1675.66 s [algebraic-graphs] Suggested fix:
  19098. 1675.66 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19099. 1675.66 s [algebraic-graphs] |
  19100. 1675.66 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19101. 1675.66 s [algebraic-graphs] | ^
  19102. 1675.66 s [algebraic-graphs]
  19103. 1675.66 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 )
  19104. 1675.66 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 )
  19105. 1676.00 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 )
  19106. 1676.01 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 )
  19107. 1676.01 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 )
  19108. 1676.43 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 )
  19109. 1676.56 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 )
  19110. 1676.73 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 )
  19111. 1676.73 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19112. 1676.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19113. 1676.73 s [algebraic-graphs] will become an error in a future GHC release.
  19114. 1676.73 s [algebraic-graphs] Suggested fix:
  19115. 1676.73 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19116. 1676.73 s [algebraic-graphs] |
  19117. 1676.73 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19118. 1676.73 s [algebraic-graphs] | ^
  19119. 1676.73 s [algebraic-graphs]
  19120. 1676.73 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 )
  19121. 1676.73 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19122. 1676.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19123. 1676.73 s [algebraic-graphs] will become an error in a future GHC release.
  19124. 1676.73 s [algebraic-graphs] Suggested fix:
  19125. 1676.73 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19126. 1676.73 s [algebraic-graphs] |
  19127. 1676.73 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19128. 1676.73 s [algebraic-graphs] | ^
  19129. 1676.73 s [algebraic-graphs]
  19130. 1676.73 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19131. 1676.73 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19132. 1676.73 s [algebraic-graphs] will become an error in a future GHC release.
  19133. 1676.73 s [algebraic-graphs] Suggested fix:
  19134. 1676.73 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19135. 1676.73 s [algebraic-graphs] |
  19136. 1676.73 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19137. 1676.73 s [algebraic-graphs] | ^
  19138. 1676.73 s [algebraic-graphs]
  19139. 1676.73 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 )
  19140. 1676.73 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 )
  19141. 1676.73 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 )
  19142. 1676.74 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 )
  19143. 1676.75 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 )
  19144. 1676.75 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 )
  19145. 1676.78 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 )
  19146. 1677.04 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19147. 1677.10 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 )
  19148. 1677.79 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 )
  19149. 1677.79 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 )
  19150. 1677.79 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 )
  19151. 1677.79 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 )
  19152. 1677.82 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 )
  19153. 1678.10 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19154. 1678.69 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 )
  19155. 1679.04 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19156. 1679.04 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19157. 1680.07 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 )
  19158. 1680.39 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 )
  19159. 1680.77 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 )
  19160. 1680.82 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 )
  19161. 1681.50 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19162. 1681.50 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 )
  19163. 1681.50 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 )
  19164. 1681.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19165. 1681.50 s [algebraic-graphs] In the use of ‘head’
  19166. 1681.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19167. 1681.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19168. 1681.50 s [algebraic-graphs] |
  19169. 1681.50 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19170. 1681.50 s [algebraic-graphs] | ^^^^
  19171. 1681.50 s [algebraic-graphs]
  19172. 1681.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19173. 1681.50 s [algebraic-graphs] In the use of ‘tail’
  19174. 1681.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19175. 1681.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19176. 1681.50 s [algebraic-graphs] |
  19177. 1681.50 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19178. 1681.50 s [algebraic-graphs] | ^^^^
  19179. 1681.50 s [algebraic-graphs]
  19180. 1681.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19181. 1681.50 s [algebraic-graphs] In the use of ‘head’
  19182. 1681.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19183. 1681.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19184. 1681.50 s [algebraic-graphs] |
  19185. 1681.50 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19186. 1681.50 s [algebraic-graphs] | ^^^^
  19187. 1681.50 s [algebraic-graphs]
  19188. 1681.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19189. 1681.50 s [algebraic-graphs] In the use of ‘tail’
  19190. 1681.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19191. 1681.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19192. 1681.50 s [algebraic-graphs] |
  19193. 1681.50 s [algebraic-graphs] 397 | bnd' = tail bnd
  19194. 1681.50 s [algebraic-graphs] | ^^^^
  19195. 1681.50 s [algebraic-graphs]
  19196. 1681.51 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 )
  19197. 1681.51 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19198. 1681.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19199. 1681.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19200. 1681.51 s [algebraic-graphs] will become an error in a future GHC release.
  19201. 1681.51 s [algebraic-graphs] Suggested fix:
  19202. 1681.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19203. 1681.51 s [algebraic-graphs] |
  19204. 1681.51 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19205. 1681.51 s [algebraic-graphs] | ^
  19206. 1681.51 s [algebraic-graphs]
  19207. 1681.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19208. 1681.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19209. 1681.51 s [algebraic-graphs] will become an error in a future GHC release.
  19210. 1681.51 s [algebraic-graphs] Suggested fix:
  19211. 1681.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19212. 1681.51 s [algebraic-graphs] |
  19213. 1681.51 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19214. 1681.51 s [algebraic-graphs] | ^
  19215. 1681.51 s [algebraic-graphs]
  19216. 1681.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19217. 1681.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19218. 1681.51 s [algebraic-graphs] will become an error in a future GHC release.
  19219. 1681.51 s [algebraic-graphs] Suggested fix:
  19220. 1681.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19221. 1681.51 s [algebraic-graphs] |
  19222. 1681.51 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19223. 1681.51 s [algebraic-graphs] | ^
  19224. 1681.51 s [algebraic-graphs]
  19225. 1681.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19226. 1681.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19227. 1681.51 s [algebraic-graphs] will become an error in a future GHC release.
  19228. 1681.51 s [algebraic-graphs] Suggested fix:
  19229. 1681.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19230. 1681.51 s [algebraic-graphs] |
  19231. 1681.51 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19232. 1681.51 s [algebraic-graphs] | ^
  19233. 1681.51 s [algebraic-graphs]
  19234. 1681.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19235. 1681.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19236. 1681.51 s [algebraic-graphs] will become an error in a future GHC release.
  19237. 1681.51 s [algebraic-graphs] Suggested fix:
  19238. 1681.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19239. 1681.51 s [algebraic-graphs] |
  19240. 1681.51 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19241. 1681.51 s [algebraic-graphs] | ^
  19242. 1681.51 s [algebraic-graphs]
  19243. 1681.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19244. 1681.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19245. 1681.51 s [algebraic-graphs] will become an error in a future GHC release.
  19246. 1681.51 s [algebraic-graphs] Suggested fix:
  19247. 1681.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19248. 1681.51 s [algebraic-graphs] |
  19249. 1681.51 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19250. 1681.51 s [algebraic-graphs] | ^
  19251. 1681.51 s [algebraic-graphs]
  19252. 1681.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19253. 1681.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19254. 1681.51 s [algebraic-graphs] will become an error in a future GHC release.
  19255. 1681.51 s [algebraic-graphs] Suggested fix:
  19256. 1681.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19257. 1681.51 s [algebraic-graphs] |
  19258. 1681.51 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19259. 1681.51 s [algebraic-graphs] | ^
  19260. 1681.51 s [algebraic-graphs]
  19261. 1681.51 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19262. 1681.57 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 )
  19263. 1681.99 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19264. 1681.99 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 )
  19265. 1681.99 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19266. 1682.52 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 )
  19267. 1682.76 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 )
  19268. 1682.92 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19269. 1682.92 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19270. 1682.93 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19271. 1682.93 s [algebraic-graphs] will become an error in a future GHC release.
  19272. 1682.93 s [algebraic-graphs] Suggested fix:
  19273. 1682.93 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19274. 1682.93 s [algebraic-graphs] |
  19275. 1682.93 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19276. 1682.93 s [algebraic-graphs] | ^
  19277. 1682.93 s [algebraic-graphs]
  19278. 1682.93 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 )
  19279. 1682.93 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19280. 1682.93 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19281. 1682.93 s [algebraic-graphs] will become an error in a future GHC release.
  19282. 1682.93 s [algebraic-graphs] Suggested fix:
  19283. 1682.93 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19284. 1682.93 s [algebraic-graphs] |
  19285. 1682.93 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19286. 1682.93 s [algebraic-graphs] | ^
  19287. 1682.93 s [algebraic-graphs]
  19288. 1682.93 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19289. 1682.93 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19290. 1682.93 s [algebraic-graphs] will become an error in a future GHC release.
  19291. 1682.93 s [algebraic-graphs] Suggested fix:
  19292. 1682.93 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  19293. 1682.93 s [algebraic-graphs] |
  19294. 1682.93 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19295. 1682.93 s [algebraic-graphs] | ^
  19296. 1682.93 s [algebraic-graphs]
  19297. 1682.93 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19298. 1682.93 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19299. 1682.93 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 )
  19300. 1683.03 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 )
  19301. 1683.03 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 )
  19302. 1683.03 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 )
  19303. 1683.08 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19304. 1684.31 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  19305. 1684.31 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  19306. 1684.43 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 )
  19307. 1685.68 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 )
  19308. 1687.35 s [haskell-language-server] Preprocessing library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0...
  19309. 1687.36 s [haskell-language-server] Building library 'hls-cabal-plugin' for haskell-language-server-2.12.0.0...
  19310. 1687.61 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 )
  19311. 1688.51 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 )
  19312. 1688.51 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 )
  19313. 1688.51 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 )
  19314. 1688.51 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:71: warning: [GHC-00834] [-Wview-pattern-signatures]
  19315. 1688.51 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19316. 1688.51 s [algebraic-graphs] • This code might stop working in a future GHC release
  19317. 1688.51 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19318. 1688.51 s [algebraic-graphs] unless the view function is an endofunction.
  19319. 1688.51 s [algebraic-graphs] • Current parse: ‘apply -> (f1 :: Int -> Int)’
  19320. 1688.51 s [algebraic-graphs] Future parse: ‘(apply -> f1) :: Int -> Int’
  19321. 1688.51 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19322. 1688.51 s [algebraic-graphs] |
  19323. 1688.51 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19324. 1688.51 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19325. 1688.51 s [algebraic-graphs]
  19326. 1688.51 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:99: warning: [GHC-00834] [-Wview-pattern-signatures]
  19327. 1688.51 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19328. 1688.51 s [algebraic-graphs] • This code might stop working in a future GHC release
  19329. 1688.51 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19330. 1688.51 s [algebraic-graphs] unless the view function is an endofunction.
  19331. 1688.51 s [algebraic-graphs] • Current parse: ‘apply -> (g1 :: Int -> Int)’
  19332. 1688.51 s [algebraic-graphs] Future parse: ‘(apply -> g1) :: Int -> Int’
  19333. 1688.51 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19334. 1688.51 s [algebraic-graphs] |
  19335. 1688.51 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19336. 1688.51 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19337. 1688.51 s [algebraic-graphs]
  19338. 1688.51 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:127: warning: [GHC-00834] [-Wview-pattern-signatures]
  19339. 1688.51 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19340. 1688.51 s [algebraic-graphs] • This code might stop working in a future GHC release
  19341. 1688.51 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19342. 1688.51 s [algebraic-graphs] unless the view function is an endofunction.
  19343. 1688.51 s [algebraic-graphs] • Current parse: ‘apply -> (f2 :: Int -> Int)’
  19344. 1688.51 s [algebraic-graphs] Future parse: ‘(apply -> f2) :: Int -> Int’
  19345. 1688.51 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19346. 1688.51 s [algebraic-graphs] |
  19347. 1688.51 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19348. 1688.51 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19349. 1688.51 s [algebraic-graphs]
  19350. 1688.51 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:155: warning: [GHC-00834] [-Wview-pattern-signatures]
  19351. 1688.51 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19352. 1688.51 s [algebraic-graphs] • This code might stop working in a future GHC release
  19353. 1688.51 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19354. 1688.51 s [algebraic-graphs] unless the view function is an endofunction.
  19355. 1688.51 s [algebraic-graphs] • Current parse: ‘apply -> (g2 :: Int -> Int)’
  19356. 1688.51 s [algebraic-graphs] Future parse: ‘(apply -> g2) :: Int -> Int’
  19357. 1688.51 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19358. 1688.51 s [algebraic-graphs] |
  19359. 1688.51 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  19360. 1688.51 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  19361. 1688.51 s [algebraic-graphs]
  19362. 1689.72 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 )
  19363. 1689.77 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 )
  19364. 1689.92 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 )
  19365. 1689.98 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 )
  19366. 1690.14 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 )
  19367. 1690.41 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 )
  19368. 1690.41 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 )
  19369. 1690.45 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 )
  19370. 1690.45 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 )
  19371. 1690.45 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 )
  19372. 1690.45 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:50: warning: [GHC-00834] [-Wview-pattern-signatures]
  19373. 1690.45 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19374. 1690.45 s [algebraic-graphs] • This code might stop working in a future GHC release
  19375. 1690.45 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19376. 1690.45 s [algebraic-graphs] unless the view function is an endofunction.
  19377. 1690.45 s [algebraic-graphs] • Current parse: ‘apply -> (f :: Int -> Int)’
  19378. 1690.45 s [algebraic-graphs] Future parse: ‘(apply -> f) :: Int -> Int’
  19379. 1690.45 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19380. 1690.45 s [algebraic-graphs] |
  19381. 1690.45 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  19382. 1690.45 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  19383. 1690.45 s [algebraic-graphs]
  19384. 1690.45 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:77: warning: [GHC-00834] [-Wview-pattern-signatures]
  19385. 1690.45 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  19386. 1690.45 s [algebraic-graphs] • This code might stop working in a future GHC release
  19387. 1690.45 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  19388. 1690.45 s [algebraic-graphs] unless the view function is an endofunction.
  19389. 1690.45 s [algebraic-graphs] • Current parse: ‘apply -> (g :: Int -> Int)’
  19390. 1690.45 s [algebraic-graphs] Future parse: ‘(apply -> g) :: Int -> Int’
  19391. 1690.45 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  19392. 1690.45 s [algebraic-graphs] |
  19393. 1690.45 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  19394. 1690.45 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  19395. 1690.45 s [algebraic-graphs]
  19396. 1690.47 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 )
  19397. 1690.47 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 )
  19398. 1690.47 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 )
  19399. 1690.47 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 )
  19400. 1691.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.o, dist/build/hls-cabal-plugin/Ide/Plugin/Cabal/Completion/Completions.dyn_o )
  19401. 1691.35 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 )
  19402. 1691.35 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 )
  19403. 1691.35 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 )
  19404. 1691.35 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 )
  19405. 1691.35 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 )
  19406. 1691.35 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 )
  19407. 1691.35 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 )
  19408. 1691.35 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 )
  19409. 1691.35 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 )
  19410. 1691.35 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 )
  19411. 1691.35 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 )
  19412. 1692.50 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 )
  19413. 1694.20 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 )
  19414. 1694.37 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 )
  19415. 1694.42 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 )
  19416. 1694.45 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 )
  19417. 1694.58 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 )
  19418. 1694.60 s [algebraic-graphs] [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
  19419. 1694.60 s [algebraic-graphs] [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
  19420. 1694.92 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 )
  19421. 1695.23 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 )
  19422. 1695.23 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 )
  19423. 1695.23 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 )
  19424. 1695.24 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 )
  19425. 1695.24 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 )
  19426. 1695.47 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 )
  19427. 1695.47 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 )
  19428. 1695.47 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 )
  19429. 1695.47 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 )
  19430. 1696.12 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 )
  19431. 1696.14 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 )
  19432. 1696.14 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 )
  19433. 1696.14 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 )
  19434. 1696.14 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 )
  19435. 1696.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 )
  19436. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19437. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19438. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19439. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19440. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19441. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19442. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19443. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19444. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19445. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19446. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19447. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19448. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19449. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19450. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19451. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19452. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19453. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19454. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19455. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19456. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19457. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19458. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19459. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19460. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19461. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19462. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19463. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19464. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19465. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19466. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19467. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19468. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19469. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19470. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19471. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19472. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19473. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19474. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19475. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19476. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19477. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19478. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19479. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19480. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19481. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19482. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19483. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19484. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19485. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19486. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19487. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19488. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19489. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19490. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19491. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19492. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19493. 1696.14 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19494. 1696.14 s [algebraic-graphs] inspection testing successful
  19495. 1696.14 s [algebraic-graphs] expected successes: 58
  19496. 1696.14 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 )
  19497. 1696.14 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 )
  19498. 1696.14 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 )
  19499. 1696.32 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 )
  19500. 1696.72 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 )
  19501. 1696.72 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 )
  19502. 1696.72 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 )
  19503. 1696.72 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 )
  19504. 1696.72 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 )
  19505. 1696.89 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19506. 1697.22 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 )
  19507. 1697.59 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 )
  19508. 1697.63 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 )
  19509. 1697.63 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 )
  19510. 1697.63 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 )
  19511. 1697.63 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 )
  19512. 1697.92 s [algebraic-graphs] Phase: checkPhase
  19513. 1698.16 s [algebraic-graphs] Running 1 test suites...
  19514. 1698.16 s [algebraic-graphs] Test suite main: RUNNING...
  19515. 1705.08 s [algebraic-graphs]
  19516. 1705.08 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19517. 1705.08 s [algebraic-graphs] OK: show empty == "empty"
  19518. 1705.09 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19519. 1705.09 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19520. 1705.09 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19521. 1705.09 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19522. 1705.09 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19523. 1705.09 s [algebraic-graphs]
  19524. 1705.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19525. 1705.09 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19526. 1705.09 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19527. 1705.09 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19528. 1705.09 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19529. 1705.09 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19530. 1705.09 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19531. 1705.09 s [algebraic-graphs]
  19532. 1705.09 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19533. 1705.09 s [algebraic-graphs] OK: isEmpty empty == True
  19534. 1705.09 s [algebraic-graphs] OK: hasVertex x empty == False
  19535. 1705.09 s [algebraic-graphs] OK: vertexCount empty == 0
  19536. 1705.09 s [algebraic-graphs] OK: edgeCount empty == 0
  19537. 1705.10 s [algebraic-graphs]
  19538. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19539. 1705.10 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19540. 1705.10 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19541. 1705.10 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19542. 1705.10 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19543. 1705.10 s [algebraic-graphs]
  19544. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19545. 1705.10 s [algebraic-graphs] OK: vertices [] == empty
  19546. 1705.10 s [algebraic-graphs] OK: vertices [x] == vertex x
  19547. 1705.10 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19548. 1705.10 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19549. 1705.10 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19550. 1705.10 s [algebraic-graphs]
  19551. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  19552. 1705.10 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  19553. 1705.10 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  19554. 1705.10 s [algebraic-graphs]
  19555. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  19556. 1705.10 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  19557. 1705.10 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  19558. 1705.10 s [algebraic-graphs]
  19559. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  19560. 1705.10 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19561. 1705.10 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19562. 1705.10 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19563. 1705.10 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  19564. 1705.10 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19565. 1705.10 s [algebraic-graphs]
  19566. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  19567. 1705.10 s [algebraic-graphs] OK: isEmpty empty == True
  19568. 1705.10 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19569. 1705.10 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19570. 1705.10 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  19571. 1705.10 s [algebraic-graphs]
  19572. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  19573. 1705.10 s [algebraic-graphs] OK: hasVertex x empty == False
  19574. 1705.10 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19575. 1705.10 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19576. 1705.10 s [algebraic-graphs]
  19577. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  19578. 1705.10 s [algebraic-graphs] OK: hasEdge x y empty == False
  19579. 1705.10 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19580. 1705.10 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  19581. 1705.10 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19582. 1705.10 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19583. 1705.10 s [algebraic-graphs]
  19584. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  19585. 1705.10 s [algebraic-graphs] OK: vertexCount empty == 0
  19586. 1705.10 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19587. 1705.10 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19588. 1705.10 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19589. 1705.10 s [algebraic-graphs]
  19590. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  19591. 1705.10 s [algebraic-graphs] OK: edgeCount empty == 0
  19592. 1705.10 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19593. 1705.10 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  19594. 1705.10 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19595. 1705.10 s [algebraic-graphs]
  19596. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  19597. 1705.10 s [algebraic-graphs] OK: vertexList empty == []
  19598. 1705.10 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19599. 1705.10 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19600. 1705.10 s [algebraic-graphs]
  19601. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  19602. 1705.10 s [algebraic-graphs] OK: edgeList empty == []
  19603. 1705.10 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19604. 1705.10 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  19605. 1705.10 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19606. 1705.10 s [algebraic-graphs]
  19607. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  19608. 1705.10 s [algebraic-graphs] OK: adjacencyList empty == []
  19609. 1705.10 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19610. 1705.10 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  19611. 1705.10 s [algebraic-graphs]
  19612. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  19613. 1705.10 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19614. 1705.10 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19615. 1705.10 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19616. 1705.10 s [algebraic-graphs]
  19617. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  19618. 1705.10 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19619. 1705.10 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19620. 1705.10 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  19621. 1705.10 s [algebraic-graphs]
  19622. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  19623. 1705.10 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19624. 1705.10 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19625. 1705.10 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  19626. 1705.10 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  19627. 1705.10 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  19628. 1705.10 s [algebraic-graphs]
  19629. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  19630. 1705.10 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19631. 1705.10 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19632. 1705.10 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  19633. 1705.10 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  19634. 1705.10 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  19635. 1705.10 s [algebraic-graphs]
  19636. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  19637. 1705.10 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19638. 1705.10 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19639. 1705.10 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  19640. 1705.10 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19641. 1705.10 s [algebraic-graphs]
  19642. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  19643. 1705.10 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  19644. 1705.10 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19645. 1705.10 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19646. 1705.10 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  19647. 1705.10 s [algebraic-graphs]
  19648. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  19649. 1705.10 s [algebraic-graphs] OK: transpose empty == empty
  19650. 1705.10 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19651. 1705.10 s [algebraic-graphs] OK: transpose . transpose == id
  19652. 1705.10 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19653. 1705.10 s [algebraic-graphs]
  19654. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  19655. 1705.10 s [algebraic-graphs] OK: induce (const True ) x == x
  19656. 1705.10 s [algebraic-graphs] OK: induce (const False) x == empty
  19657. 1705.10 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19658. 1705.10 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19659. 1705.10 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19660. 1705.10 s [algebraic-graphs]
  19661. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  19662. 1705.10 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19663. 1705.10 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  19664. 1705.10 s [algebraic-graphs]
  19665. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  19666. 1705.10 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  19667. 1705.10 s [algebraic-graphs]
  19668. 1705.10 s [algebraic-graphs] OK: box x y ~~ box y x
  19669. 1705.10 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19670. 1705.10 s [algebraic-graphs] OK: box x empty ~~ empty
  19671. 1705.10 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19672. 1705.10 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19673. 1705.10 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19674. 1705.10 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19675. 1705.10 s [algebraic-graphs]
  19676. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  19677. 1705.10 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19678. 1705.10 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19679. 1705.10 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  19680. 1705.10 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19681. 1705.10 s [algebraic-graphs]
  19682. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  19683. 1705.10 s [algebraic-graphs] OK: topSort empty == []
  19684. 1705.10 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  19685. 1705.10 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  19686. 1705.10 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  19687. 1705.10 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  19688. 1705.10 s [algebraic-graphs]
  19689. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  19690. 1705.10 s [algebraic-graphs] OK: scc empty == empty
  19691. 1705.10 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  19692. 1705.10 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  19693. 1705.10 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  19694. 1705.10 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  19695. 1705.10 s [algebraic-graphs]
  19696. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  19697. 1705.10 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  19698. 1705.10 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  19699. 1705.10 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  19700. 1705.10 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  19701. 1705.10 s [algebraic-graphs]
  19702. 1705.10 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  19703. 1705.10 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  19704. 1705.10 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  19705. 1705.10 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  19706. 1705.10 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  19707. 1705.10 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  19708. 1705.10 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  19709. 1705.45 s [haskell-language-server] Preprocessing library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0...
  19710. 1705.46 s Waiting for lock on bash-language-server
  19711. 1705.46 s [haskell-language-server] Building library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0...
  19712. 1705.86 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  19713. 1705.86 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  19714. 1705.86 s [haskell-language-server] but were not needed for compilation:
  19715. 1705.86 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm)
  19716. 1705.86 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-CnW24tC17yJ4pR2cvFEpth)
  19717. 1705.86 s [haskell-language-server]
  19718. 1705.88 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 )
  19719. 1706.17 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 )
  19720. 1706.36 s [haskell-language-server] plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs:10:64: warning: [GHC-61689] [-Wdodgy-imports]
  19721. 1706.36 s [haskell-language-server] Module ‘GHC.Hs’ does not export ‘AnnLet’.
  19722. 1706.36 s [haskell-language-server] |
  19723. 1706.36 s [haskell-language-server] 10 | import GHC.Hs hiding (AnnLet)
  19724. 1706.36 s [haskell-language-server] | ^^^^^^
  19725. 1706.36 s [haskell-language-server]
  19726. 1708.68 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  19727. 1708.68 s [algebraic-graphs]
  19728. 1708.68 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  19729. 1708.68 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  19730. 1708.68 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  19731. 1708.68 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  19732. 1708.68 s [algebraic-graphs]
  19733. 1708.68 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  19734. 1708.68 s [algebraic-graphs] OK: Arbitrary
  19735. 1708.68 s [algebraic-graphs] OK: empty
  19736. 1708.68 s [algebraic-graphs] OK: vertex
  19737. 1708.68 s [algebraic-graphs] OK: vertices
  19738. 1708.68 s [algebraic-graphs] OK: union
  19739. 1708.68 s [algebraic-graphs] OK: join
  19740. 1708.68 s [algebraic-graphs] OK: transpose
  19741. 1708.68 s [algebraic-graphs] OK: box
  19742. 1708.68 s [algebraic-graphs] OK: transitiveClosure
  19743. 1708.68 s [algebraic-graphs] OK: scc
  19744. 1708.68 s [algebraic-graphs] OK: toAcyclic
  19745. 1708.68 s [algebraic-graphs] OK: toAcyclicOrd
  19746. 1708.68 s [algebraic-graphs]
  19747. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap ============
  19748. 1708.68 s [algebraic-graphs] OK: Axioms of graphs
  19749. 1708.68 s [algebraic-graphs]
  19750. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  19751. 1708.68 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  19752. 1708.68 s [algebraic-graphs]
  19753. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  19754. 1708.68 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  19755. 1708.68 s [algebraic-graphs]
  19756. 1708.68 s [algebraic-graphs] OK: consistent empty == True
  19757. 1708.68 s [algebraic-graphs] OK: consistent (vertex x) == True
  19758. 1708.68 s [algebraic-graphs] OK: consistent (overlay x y) == True
  19759. 1708.68 s [algebraic-graphs] OK: consistent (connect x y) == True
  19760. 1708.68 s [algebraic-graphs] OK: consistent (edge x y) == True
  19761. 1708.68 s [algebraic-graphs] OK: consistent (edges xs) == True
  19762. 1708.68 s [algebraic-graphs] OK: consistent (stars xs) == True
  19763. 1708.68 s [algebraic-graphs]
  19764. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  19765. 1708.68 s [algebraic-graphs] OK: show (empty ) == "empty"
  19766. 1708.68 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19767. 1708.68 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19768. 1708.68 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19769. 1708.68 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19770. 1708.68 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19771. 1708.68 s [algebraic-graphs]
  19772. 1708.68 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19773. 1708.68 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19774. 1708.68 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19775. 1708.68 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19776. 1708.68 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19777. 1708.68 s [algebraic-graphs]
  19778. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  19779. 1708.68 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19780. 1708.68 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19781. 1708.68 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19782. 1708.68 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19783. 1708.68 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19784. 1708.68 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19785. 1708.68 s [algebraic-graphs] OK: x <= x + y
  19786. 1708.68 s [algebraic-graphs] OK: x + y <= x * y
  19787. 1708.68 s [algebraic-graphs]
  19788. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  19789. 1708.68 s [algebraic-graphs] OK: isEmpty empty == True
  19790. 1708.68 s [algebraic-graphs] OK: hasVertex x empty == False
  19791. 1708.68 s [algebraic-graphs] OK: vertexCount empty == 0
  19792. 1708.68 s [algebraic-graphs] OK: edgeCount empty == 0
  19793. 1708.68 s [algebraic-graphs]
  19794. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  19795. 1708.68 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19796. 1708.68 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19797. 1708.68 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19798. 1708.68 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19799. 1708.68 s [algebraic-graphs]
  19800. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  19801. 1708.68 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19802. 1708.68 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19803. 1708.68 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19804. 1708.68 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19805. 1708.68 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19806. 1708.68 s [algebraic-graphs]
  19807. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  19808. 1708.68 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19809. 1708.68 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19810. 1708.68 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19811. 1708.68 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19812. 1708.68 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19813. 1708.68 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19814. 1708.68 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19815. 1708.68 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19816. 1708.68 s [algebraic-graphs]
  19817. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  19818. 1708.68 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19819. 1708.68 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19820. 1708.68 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19821. 1708.68 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19822. 1708.68 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19823. 1708.68 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19824. 1708.68 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19825. 1708.68 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19826. 1708.68 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19827. 1708.68 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19828. 1708.68 s [algebraic-graphs]
  19829. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  19830. 1708.68 s [algebraic-graphs] OK: vertices [] == empty
  19831. 1708.68 s [algebraic-graphs] OK: vertices [x] == vertex x
  19832. 1708.68 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19833. 1708.68 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19834. 1708.68 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19835. 1708.68 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19836. 1708.68 s [algebraic-graphs]
  19837. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  19838. 1708.68 s [algebraic-graphs] OK: edges [] == empty
  19839. 1708.68 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19840. 1708.68 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19841. 1708.68 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19842. 1708.68 s [algebraic-graphs]
  19843. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  19844. 1708.68 s [algebraic-graphs] OK: overlays [] == empty
  19845. 1708.68 s [algebraic-graphs] OK: overlays [x] == x
  19846. 1708.68 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19847. 1708.68 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19848. 1708.68 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19849. 1708.68 s [algebraic-graphs]
  19850. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  19851. 1708.68 s [algebraic-graphs] OK: connects [] == empty
  19852. 1708.68 s [algebraic-graphs] OK: connects [x] == x
  19853. 1708.68 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19854. 1708.68 s [algebraic-graphs] OK: connects == foldr connect empty
  19855. 1708.68 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19856. 1708.68 s [algebraic-graphs]
  19857. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  19858. 1708.68 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  19859. 1708.68 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  19860. 1708.68 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  19861. 1708.68 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  19862. 1708.68 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  19863. 1708.68 s [algebraic-graphs]
  19864. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  19865. 1708.68 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19866. 1708.68 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19867. 1708.68 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19868. 1708.68 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19869. 1708.68 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19870. 1708.68 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19871. 1708.68 s [algebraic-graphs]
  19872. 1708.68 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  19873. 1708.68 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19874. 1708.68 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19875. 1708.68 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19876. 1708.68 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19877. 1708.68 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19878. 1708.68 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19879. 1708.68 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19880. 1708.68 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19881. 1708.68 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19882. 1708.68 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19883. 1708.68 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19884. 1708.68 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19885. 1708.68 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19886. 1708.68 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19887. 1708.68 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19888. 1708.68 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19889. 1708.68 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19890. 1708.68 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19891. 1708.68 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19892. 1708.68 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19893. 1708.68 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19894. 1708.68 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19895. 1708.68 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19896. 1708.68 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19897. 1708.68 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19898. 1708.68 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19899. 1708.68 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19900. 1708.68 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19901. 1708.68 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19902. 1708.68 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19903. 1708.68 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19904. 1708.68 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19905. 1708.68 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19906. 1708.68 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19907. 1709.57 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19908. 1709.57 s [algebraic-graphs]
  19909. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  19910. 1709.57 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19911. 1709.57 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19912. 1709.57 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19913. 1709.57 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19914. 1709.57 s [algebraic-graphs]
  19915. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  19916. 1709.57 s [algebraic-graphs] OK: isEmpty empty == True
  19917. 1709.57 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19918. 1709.57 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19919. 1709.57 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19920. 1709.57 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19921. 1709.57 s [algebraic-graphs]
  19922. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  19923. 1709.57 s [algebraic-graphs] OK: hasVertex x empty == False
  19924. 1709.57 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19925. 1709.57 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19926. 1709.57 s [algebraic-graphs]
  19927. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  19928. 1709.57 s [algebraic-graphs] OK: hasEdge x y empty == False
  19929. 1709.57 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19930. 1709.57 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19931. 1709.57 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19932. 1709.57 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19933. 1709.57 s [algebraic-graphs]
  19934. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  19935. 1709.57 s [algebraic-graphs] OK: vertexCount empty == 0
  19936. 1709.57 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19937. 1709.57 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19938. 1709.57 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19939. 1709.57 s [algebraic-graphs]
  19940. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  19941. 1709.57 s [algebraic-graphs] OK: edgeCount empty == 0
  19942. 1709.57 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19943. 1709.57 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19944. 1709.57 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19945. 1709.57 s [algebraic-graphs]
  19946. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  19947. 1709.57 s [algebraic-graphs] OK: vertexList empty == []
  19948. 1709.57 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19949. 1709.57 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19950. 1709.57 s [algebraic-graphs]
  19951. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  19952. 1709.57 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19953. 1709.57 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19954. 1709.57 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19955. 1709.57 s [algebraic-graphs]
  19956. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  19957. 1709.57 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  19958. 1709.57 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  19959. 1709.57 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  19960. 1709.57 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  19961. 1709.57 s [algebraic-graphs]
  19962. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  19963. 1709.57 s [algebraic-graphs] OK: edgeList empty == []
  19964. 1709.57 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19965. 1709.57 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19966. 1709.57 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19967. 1709.57 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19968. 1709.57 s [algebraic-graphs]
  19969. 1709.57 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  19970. 1709.57 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19971. 1709.57 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19972. 1709.57 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19973. 1709.57 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19974. 1709.58 s [algebraic-graphs]
  19975. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  19976. 1709.58 s [algebraic-graphs] OK: adjacencyList empty == []
  19977. 1709.58 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19978. 1709.58 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  19979. 1709.58 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  19980. 1709.58 s [algebraic-graphs]
  19981. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  19982. 1709.58 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19983. 1709.58 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19984. 1709.58 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19985. 1709.58 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19986. 1709.58 s [algebraic-graphs]
  19987. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  19988. 1709.58 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  19989. 1709.58 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  19990. 1709.58 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  19991. 1709.58 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  19992. 1709.58 s [algebraic-graphs]
  19993. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  19994. 1709.58 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19995. 1709.58 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19996. 1709.58 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19997. 1709.58 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19998. 1709.58 s [algebraic-graphs]
  19999. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20000. 1709.58 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20001. 1709.58 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20002. 1709.58 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20003. 1709.58 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20004. 1709.58 s [algebraic-graphs]
  20005. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20006. 1709.58 s [algebraic-graphs] OK: path [] == empty
  20007. 1709.58 s [algebraic-graphs] OK: path [x] == vertex x
  20008. 1709.58 s [algebraic-graphs] OK: path [x,y] == edge x y
  20009. 1709.58 s [algebraic-graphs]
  20010. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20011. 1709.58 s [algebraic-graphs] OK: circuit [] == empty
  20012. 1709.58 s [algebraic-graphs] OK: circuit [x] == edge x x
  20013. 1709.58 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20014. 1709.58 s [algebraic-graphs]
  20015. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20016. 1709.58 s [algebraic-graphs] OK: clique [] == empty
  20017. 1709.58 s [algebraic-graphs] OK: clique [x] == vertex x
  20018. 1709.58 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20019. 1709.58 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20020. 1709.58 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20021. 1709.58 s [algebraic-graphs]
  20022. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20023. 1709.58 s [algebraic-graphs] OK: biclique [] [] == empty
  20024. 1709.58 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20025. 1709.58 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20026. 1709.58 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20027. 1709.58 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20028. 1709.58 s [algebraic-graphs]
  20029. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20030. 1709.58 s [algebraic-graphs] OK: star x [] == vertex x
  20031. 1709.58 s [algebraic-graphs] OK: star x [y] == edge x y
  20032. 1709.58 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20033. 1709.58 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20034. 1709.58 s [algebraic-graphs]
  20035. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20036. 1709.58 s [algebraic-graphs] OK: stars [] == empty
  20037. 1709.58 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20038. 1709.58 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20039. 1709.58 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20040. 1709.58 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20041. 1709.58 s [algebraic-graphs] OK: stars . adjacencyList == id
  20042. 1709.58 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20043. 1709.58 s [algebraic-graphs]
  20044. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20045. 1709.58 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20046. 1709.58 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20047. 1709.58 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20048. 1709.58 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20049. 1709.58 s [algebraic-graphs]
  20050. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20051. 1709.58 s [algebraic-graphs] OK: forest [] == empty
  20052. 1709.58 s [algebraic-graphs] OK: forest [x] == tree x
  20053. 1709.58 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20054. 1709.58 s [algebraic-graphs] OK: forest == overlays . map tree
  20055. 1709.58 s [algebraic-graphs]
  20056. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20057. 1709.58 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20058. 1709.58 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20059. 1709.58 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20060. 1709.58 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20061. 1709.58 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20062. 1709.58 s [algebraic-graphs]
  20063. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20064. 1709.58 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20065. 1709.58 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20066. 1709.58 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20067. 1709.58 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20068. 1709.58 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20069. 1709.58 s [algebraic-graphs]
  20070. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20071. 1709.58 s [algebraic-graphs] OK: replaceVertex x x == id
  20072. 1709.58 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20073. 1709.58 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20074. 1709.58 s [algebraic-graphs]
  20075. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20076. 1709.58 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20077. 1709.58 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20078. 1709.58 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20079. 1709.58 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20080. 1709.58 s [algebraic-graphs]
  20081. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20082. 1709.58 s [algebraic-graphs] OK: transpose empty == empty
  20083. 1709.58 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20084. 1709.58 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20085. 1709.58 s [algebraic-graphs] OK: transpose . transpose == id
  20086. 1709.58 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20087. 1709.58 s [algebraic-graphs]
  20088. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20089. 1709.58 s [algebraic-graphs] OK: gmap f empty == empty
  20090. 1709.58 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20091. 1709.58 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20092. 1709.58 s [algebraic-graphs] OK: gmap id == id
  20093. 1709.58 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20094. 1709.58 s [algebraic-graphs]
  20095. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20096. 1709.58 s [algebraic-graphs] OK: induce (const True ) x == x
  20097. 1709.58 s [algebraic-graphs] OK: induce (const False) x == empty
  20098. 1709.58 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20099. 1709.58 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20100. 1709.58 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20101. 1709.58 s [algebraic-graphs]
  20102. 1709.58 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20103. 1709.58 s [algebraic-graphs] OK: compose empty x == empty
  20104. 1709.58 s [algebraic-graphs] OK: compose x empty == empty
  20105. 1709.58 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20106. 1709.58 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20107. 1709.58 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20108. 1709.58 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20109. 1709.83 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20110. 1709.83 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20111. 1709.83 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20112. 1709.83 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20113. 1709.83 s [algebraic-graphs]
  20114. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20115. 1709.83 s [algebraic-graphs] OK: closure empty == empty
  20116. 1709.83 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20117. 1709.83 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20118. 1709.83 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20119. 1709.83 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20120. 1709.83 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20121. 1709.83 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20122. 1709.83 s [algebraic-graphs] OK: closure . closure == closure
  20123. 1709.83 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20124. 1709.83 s [algebraic-graphs]
  20125. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20126. 1709.83 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20127. 1709.83 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20128. 1709.83 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20129. 1709.83 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20130. 1709.83 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20131. 1709.83 s [algebraic-graphs]
  20132. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20133. 1709.83 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20134. 1709.83 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20135. 1709.83 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20136. 1709.83 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20137. 1709.83 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20138. 1709.83 s [algebraic-graphs]
  20139. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20140. 1709.83 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20141. 1709.83 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20142. 1709.83 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20143. 1709.83 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20144. 1709.83 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20145. 1709.83 s [algebraic-graphs]
  20146. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20147. 1709.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20148. 1709.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20149. 1709.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20150. 1709.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20151. 1709.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20152. 1709.83 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20153. 1709.83 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20154. 1709.83 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20155. 1709.83 s [algebraic-graphs] OK: bfsForest x [] == []
  20156. 1709.83 s [algebraic-graphs] OK: bfsForest empty vs == []
  20157. 1709.83 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20158. 1709.83 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20159. 1709.83 s [algebraic-graphs]
  20160. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20161. 1709.83 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20162. 1709.83 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20163. 1709.83 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20164. 1709.83 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20165. 1709.83 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20166. 1709.83 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20167. 1709.83 s [algebraic-graphs] OK: bfs empty vs == []
  20168. 1709.83 s [algebraic-graphs] OK: bfs x [] == []
  20169. 1709.83 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20170. 1709.83 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20171. 1709.83 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20172. 1709.83 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20173. 1709.83 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20174. 1709.83 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20175. 1709.83 s [algebraic-graphs]
  20176. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20177. 1709.83 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20178. 1709.83 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20179. 1709.83 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20180. 1709.83 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20181. 1709.83 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20182. 1709.83 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20183. 1709.83 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20184. 1709.83 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20185. 1709.83 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20186. 1709.83 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20187. 1709.83 s [algebraic-graphs]
  20188. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20189. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20190. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20191. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20192. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20193. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20194. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20195. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20196. 1709.83 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20197. 1709.83 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20198. 1709.83 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20199. 1709.83 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20200. 1709.83 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20201. 1709.83 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20202. 1709.83 s [algebraic-graphs]
  20203. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20204. 1709.83 s [algebraic-graphs] OK: dfs empty vs == []
  20205. 1709.83 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20206. 1709.83 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20207. 1709.83 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20208. 1709.83 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20209. 1709.83 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20210. 1709.83 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20211. 1709.83 s [algebraic-graphs] OK: dfs x [] == []
  20212. 1709.83 s [algebraic-graphs]
  20213. 1709.83 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20214. 1709.83 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20215. 1709.83 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20216. 1709.83 s [algebraic-graphs]
  20217. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20218. 1709.83 s [algebraic-graphs] OK: reachable empty x == []
  20219. 1709.83 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20220. 1709.83 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20221. 1709.83 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20222. 1709.83 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20223. 1709.83 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20224. 1709.83 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20225. 1709.83 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20226. 1709.83 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20227. 1709.83 s [algebraic-graphs]
  20228. 1709.83 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20229. 1709.83 s [algebraic-graphs]
  20230. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20231. 1709.83 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20232. 1709.83 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20233. 1709.83 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20234. 1709.83 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20235. 1709.83 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20236. 1709.83 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20237. 1709.83 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20238. 1709.83 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20239. 1709.83 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20240. 1709.83 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20241. 1709.83 s [algebraic-graphs]
  20242. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20243. 1709.83 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20244. 1709.83 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20245. 1709.83 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20246. 1709.83 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20247. 1709.83 s [algebraic-graphs]
  20248. 1709.83 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20249. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20250. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20251. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20252. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20253. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20254. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20255. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20256. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20257. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20258. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20259. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20260. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20261. 1709.83 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20262. 1714.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20263. 1714.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20264. 1714.64 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20265. 1714.64 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20266. 1714.64 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20267. 1714.64 s [algebraic-graphs]
  20268. 1714.64 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20269. 1714.64 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20270. 1714.64 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20271. 1714.64 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20272. 1714.64 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20273. 1714.64 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20274. 1714.64 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20275. 1714.64 s [algebraic-graphs]
  20276. 1714.64 s [algebraic-graphs] ============ AdjacencyMap ============
  20277. 1714.64 s [algebraic-graphs] OK: Axioms of graphs
  20278. 1714.64 s [algebraic-graphs]
  20279. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20280. 1714.64 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20281. 1714.64 s [algebraic-graphs]
  20282. 1714.64 s [algebraic-graphs] OK: consistent empty == True
  20283. 1714.64 s [algebraic-graphs] OK: consistent (vertex x) == True
  20284. 1714.64 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20285. 1714.64 s [algebraic-graphs] OK: consistent (connect x y) == True
  20286. 1714.64 s [algebraic-graphs] OK: consistent (edge x y) == True
  20287. 1714.64 s [algebraic-graphs] OK: consistent (edges xs) == True
  20288. 1714.64 s [algebraic-graphs] OK: consistent (stars xs) == True
  20289. 1714.64 s [algebraic-graphs]
  20290. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20291. 1714.64 s [algebraic-graphs] OK: show (empty ) == "empty"
  20292. 1714.64 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20293. 1714.64 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20294. 1714.64 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20295. 1714.64 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20296. 1714.64 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20297. 1714.64 s [algebraic-graphs]
  20298. 1714.64 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20299. 1714.64 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20300. 1714.64 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20301. 1714.64 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20302. 1714.64 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20303. 1714.64 s [algebraic-graphs]
  20304. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20305. 1714.64 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20306. 1714.64 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20307. 1714.64 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20308. 1714.64 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20309. 1714.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20310. 1714.64 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20311. 1714.64 s [algebraic-graphs] OK: x <= x + y
  20312. 1714.64 s [algebraic-graphs] OK: x + y <= x * y
  20313. 1714.64 s [algebraic-graphs]
  20314. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20315. 1714.64 s [algebraic-graphs] OK: isEmpty empty == True
  20316. 1714.64 s [algebraic-graphs] OK: hasVertex x empty == False
  20317. 1714.64 s [algebraic-graphs] OK: vertexCount empty == 0
  20318. 1714.64 s [algebraic-graphs] OK: edgeCount empty == 0
  20319. 1714.64 s [algebraic-graphs]
  20320. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20321. 1714.64 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20322. 1714.64 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20323. 1714.64 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20324. 1714.64 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20325. 1714.64 s [algebraic-graphs]
  20326. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20327. 1714.64 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20328. 1714.64 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20329. 1714.64 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20330. 1714.64 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20331. 1714.64 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20332. 1714.64 s [algebraic-graphs]
  20333. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20334. 1714.64 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20335. 1714.64 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20336. 1714.64 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20337. 1714.64 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20338. 1714.64 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20339. 1714.64 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20340. 1714.64 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20341. 1714.64 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20342. 1714.64 s [algebraic-graphs]
  20343. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20344. 1714.64 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20345. 1714.64 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20346. 1714.64 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20347. 1714.64 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20348. 1714.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20349. 1714.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20350. 1714.64 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20351. 1714.64 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20352. 1714.64 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20353. 1714.64 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20354. 1714.64 s [algebraic-graphs]
  20355. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20356. 1714.64 s [algebraic-graphs] OK: vertices [] == empty
  20357. 1714.64 s [algebraic-graphs] OK: vertices [x] == vertex x
  20358. 1714.64 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20359. 1714.64 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20360. 1714.64 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20361. 1714.64 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20362. 1714.64 s [algebraic-graphs]
  20363. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20364. 1714.64 s [algebraic-graphs] OK: edges [] == empty
  20365. 1714.64 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20366. 1714.64 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20367. 1714.64 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20368. 1714.64 s [algebraic-graphs]
  20369. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20370. 1714.64 s [algebraic-graphs] OK: overlays [] == empty
  20371. 1714.64 s [algebraic-graphs] OK: overlays [x] == x
  20372. 1714.64 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20373. 1714.64 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20374. 1714.64 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20375. 1714.64 s [algebraic-graphs]
  20376. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20377. 1714.64 s [algebraic-graphs] OK: connects [] == empty
  20378. 1714.64 s [algebraic-graphs] OK: connects [x] == x
  20379. 1714.64 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20380. 1714.64 s [algebraic-graphs] OK: connects == foldr connect empty
  20381. 1714.64 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20382. 1714.64 s [algebraic-graphs]
  20383. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20384. 1714.64 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20385. 1714.64 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20386. 1714.64 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20387. 1714.64 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20388. 1714.64 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20389. 1714.64 s [algebraic-graphs]
  20390. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20391. 1714.64 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20392. 1714.64 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20393. 1714.64 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20394. 1714.64 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20395. 1714.64 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20396. 1714.64 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20397. 1714.64 s [algebraic-graphs]
  20398. 1714.64 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20399. 1714.64 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20400. 1714.64 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20401. 1714.64 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20402. 1714.64 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20403. 1714.64 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20404. 1714.64 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20405. 1714.64 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20406. 1714.64 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20407. 1714.64 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20408. 1714.64 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20409. 1714.64 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20410. 1714.64 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20411. 1714.64 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20412. 1714.64 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20413. 1714.64 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20414. 1714.64 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20415. 1714.64 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20416. 1714.64 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20417. 1714.64 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20418. 1714.64 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20419. 1714.64 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20420. 1714.64 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20421. 1714.64 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20422. 1714.64 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20423. 1714.64 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20424. 1714.64 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20425. 1714.64 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20426. 1714.64 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20427. 1714.64 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20428. 1714.64 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20429. 1714.64 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20430. 1714.64 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20431. 1714.64 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20432. 1716.40 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20433. 1716.40 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20434. 1716.40 s [algebraic-graphs]
  20435. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20436. 1716.40 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20437. 1716.40 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20438. 1716.40 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20439. 1716.40 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20440. 1716.40 s [algebraic-graphs]
  20441. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20442. 1716.40 s [algebraic-graphs] OK: isEmpty empty == True
  20443. 1716.40 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20444. 1716.40 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20445. 1716.40 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20446. 1716.40 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20447. 1716.40 s [algebraic-graphs]
  20448. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20449. 1716.40 s [algebraic-graphs] OK: hasVertex x empty == False
  20450. 1716.40 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20451. 1716.40 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20452. 1716.40 s [algebraic-graphs]
  20453. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20454. 1716.40 s [algebraic-graphs] OK: hasEdge x y empty == False
  20455. 1716.40 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20456. 1716.40 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20457. 1716.40 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20458. 1716.40 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20459. 1716.40 s [algebraic-graphs]
  20460. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20461. 1716.40 s [algebraic-graphs] OK: vertexCount empty == 0
  20462. 1716.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20463. 1716.40 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20464. 1716.40 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20465. 1716.40 s [algebraic-graphs]
  20466. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20467. 1716.40 s [algebraic-graphs] OK: edgeCount empty == 0
  20468. 1716.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20469. 1716.40 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20470. 1716.40 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20471. 1716.40 s [algebraic-graphs]
  20472. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20473. 1716.40 s [algebraic-graphs] OK: vertexList empty == []
  20474. 1716.40 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20475. 1716.40 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20476. 1716.40 s [algebraic-graphs]
  20477. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20478. 1716.40 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20479. 1716.40 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20480. 1716.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20481. 1716.40 s [algebraic-graphs]
  20482. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20483. 1716.40 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20484. 1716.40 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20485. 1716.40 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20486. 1716.40 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20487. 1716.40 s [algebraic-graphs]
  20488. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20489. 1716.40 s [algebraic-graphs] OK: edgeList empty == []
  20490. 1716.40 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20491. 1716.40 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20492. 1716.40 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20493. 1716.40 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20494. 1716.40 s [algebraic-graphs]
  20495. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20496. 1716.40 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20497. 1716.40 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20498. 1716.40 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20499. 1716.40 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20500. 1716.40 s [algebraic-graphs]
  20501. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20502. 1716.40 s [algebraic-graphs] OK: adjacencyList empty == []
  20503. 1716.40 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20504. 1716.40 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20505. 1716.40 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20506. 1716.40 s [algebraic-graphs]
  20507. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20508. 1716.40 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20509. 1716.40 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20510. 1716.40 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20511. 1716.40 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20512. 1716.40 s [algebraic-graphs]
  20513. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20514. 1716.40 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20515. 1716.40 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20516. 1716.40 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20517. 1716.40 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20518. 1716.40 s [algebraic-graphs]
  20519. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20520. 1716.40 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20521. 1716.40 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20522. 1716.40 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20523. 1716.40 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20524. 1716.40 s [algebraic-graphs]
  20525. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20526. 1716.40 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20527. 1716.40 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20528. 1716.40 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20529. 1716.40 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20530. 1716.40 s [algebraic-graphs]
  20531. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20532. 1716.40 s [algebraic-graphs] OK: path [] == empty
  20533. 1716.40 s [algebraic-graphs] OK: path [x] == vertex x
  20534. 1716.40 s [algebraic-graphs] OK: path [x,y] == edge x y
  20535. 1716.40 s [algebraic-graphs]
  20536. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20537. 1716.40 s [algebraic-graphs] OK: circuit [] == empty
  20538. 1716.40 s [algebraic-graphs] OK: circuit [x] == edge x x
  20539. 1716.40 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20540. 1716.40 s [algebraic-graphs]
  20541. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20542. 1716.40 s [algebraic-graphs] OK: clique [] == empty
  20543. 1716.40 s [algebraic-graphs] OK: clique [x] == vertex x
  20544. 1716.40 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20545. 1716.40 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20546. 1716.40 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20547. 1716.40 s [algebraic-graphs]
  20548. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20549. 1716.40 s [algebraic-graphs] OK: biclique [] [] == empty
  20550. 1716.40 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20551. 1716.40 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20552. 1716.40 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20553. 1716.40 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20554. 1716.40 s [algebraic-graphs]
  20555. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20556. 1716.40 s [algebraic-graphs] OK: star x [] == vertex x
  20557. 1716.40 s [algebraic-graphs] OK: star x [y] == edge x y
  20558. 1716.40 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20559. 1716.40 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20560. 1716.40 s [algebraic-graphs]
  20561. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20562. 1716.40 s [algebraic-graphs] OK: stars [] == empty
  20563. 1716.40 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20564. 1716.40 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20565. 1716.40 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20566. 1716.40 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20567. 1716.40 s [algebraic-graphs] OK: stars . adjacencyList == id
  20568. 1716.40 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20569. 1716.40 s [algebraic-graphs]
  20570. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  20571. 1716.40 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20572. 1716.40 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20573. 1716.40 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20574. 1716.40 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20575. 1716.40 s [algebraic-graphs]
  20576. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  20577. 1716.40 s [algebraic-graphs] OK: forest [] == empty
  20578. 1716.40 s [algebraic-graphs] OK: forest [x] == tree x
  20579. 1716.40 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20580. 1716.40 s [algebraic-graphs] OK: forest == overlays . map tree
  20581. 1716.40 s [algebraic-graphs]
  20582. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  20583. 1716.40 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20584. 1716.40 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20585. 1716.40 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20586. 1716.40 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20587. 1716.40 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20588. 1716.40 s [algebraic-graphs]
  20589. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  20590. 1716.40 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20591. 1716.40 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20592. 1716.40 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20593. 1716.40 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20594. 1716.40 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20595. 1716.40 s [algebraic-graphs]
  20596. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  20597. 1716.40 s [algebraic-graphs] OK: replaceVertex x x == id
  20598. 1716.40 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20599. 1716.40 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20600. 1716.40 s [algebraic-graphs]
  20601. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  20602. 1716.40 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20603. 1716.40 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20604. 1716.40 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20605. 1716.40 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20606. 1716.40 s [algebraic-graphs]
  20607. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  20608. 1716.40 s [algebraic-graphs] OK: transpose empty == empty
  20609. 1716.40 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20610. 1716.40 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20611. 1716.40 s [algebraic-graphs] OK: transpose . transpose == id
  20612. 1716.40 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20613. 1716.40 s [algebraic-graphs]
  20614. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  20615. 1716.40 s [algebraic-graphs] OK: gmap f empty == empty
  20616. 1716.40 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20617. 1716.40 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20618. 1716.40 s [algebraic-graphs] OK: gmap id == id
  20619. 1716.40 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20620. 1716.40 s [algebraic-graphs]
  20621. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  20622. 1716.40 s [algebraic-graphs] OK: induce (const True ) x == x
  20623. 1716.40 s [algebraic-graphs] OK: induce (const False) x == empty
  20624. 1716.40 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20625. 1716.40 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20626. 1716.40 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20627. 1716.40 s [algebraic-graphs]
  20628. 1716.40 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  20629. 1716.40 s [algebraic-graphs] OK: compose empty x == empty
  20630. 1716.40 s [algebraic-graphs] OK: compose x empty == empty
  20631. 1716.40 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20632. 1716.40 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20633. 1716.40 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20634. 1716.40 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20635. 1717.68 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 )
  20636. 1717.68 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 )
  20637. 1717.68 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 )
  20638. 1717.79 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 )
  20639. 1718.51 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20640. 1718.51 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20641. 1718.51 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20642. 1718.51 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20643. 1718.51 s [algebraic-graphs]
  20644. 1718.51 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  20645. 1718.51 s [algebraic-graphs] OK: closure empty == empty
  20646. 1718.52 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20647. 1718.52 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20648. 1718.52 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20649. 1718.52 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20650. 1718.52 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20651. 1718.52 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20652. 1718.52 s [algebraic-graphs] OK: closure . closure == closure
  20653. 1718.52 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20654. 1718.52 s [algebraic-graphs]
  20655. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  20656. 1718.52 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20657. 1718.52 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20658. 1718.52 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20659. 1718.52 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20660. 1718.52 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20661. 1718.52 s [algebraic-graphs]
  20662. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  20663. 1718.52 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20664. 1718.52 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20665. 1718.52 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20666. 1718.52 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20667. 1718.52 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20668. 1718.52 s [algebraic-graphs]
  20669. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  20670. 1718.52 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20671. 1718.52 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20672. 1718.52 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20673. 1718.52 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20674. 1718.52 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20675. 1718.52 s [algebraic-graphs]
  20676. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.box ============
  20677. 1718.52 s [algebraic-graphs] OK: box x y ~~ box y x
  20678. 1718.52 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20679. 1718.52 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20680. 1718.52 s [algebraic-graphs] OK: box x empty ~~ empty
  20681. 1718.52 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20682. 1718.52 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20683. 1718.52 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20684. 1718.52 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20685. 1718.52 s [algebraic-graphs]
  20686. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  20687. 1718.52 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20688. 1718.52 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20689. 1718.52 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20690. 1718.52 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20691. 1718.52 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20692. 1718.52 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20693. 1718.52 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20694. 1718.52 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20695. 1718.52 s [algebraic-graphs] OK: bfsForest x [] == []
  20696. 1718.52 s [algebraic-graphs] OK: bfsForest empty vs == []
  20697. 1718.52 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20698. 1718.52 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20699. 1718.52 s [algebraic-graphs]
  20700. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  20701. 1718.52 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20702. 1718.52 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20703. 1718.52 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20704. 1718.52 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20705. 1718.52 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20706. 1718.52 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20707. 1718.52 s [algebraic-graphs] OK: bfs empty vs == []
  20708. 1718.52 s [algebraic-graphs] OK: bfs x [] == []
  20709. 1718.52 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20710. 1718.52 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20711. 1718.52 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20712. 1718.52 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20713. 1718.52 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20714. 1718.52 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20715. 1718.52 s [algebraic-graphs]
  20716. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  20717. 1718.52 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20718. 1718.52 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20719. 1718.52 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20720. 1718.52 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20721. 1718.52 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20722. 1718.52 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20723. 1718.52 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20724. 1718.52 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20725. 1718.52 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20726. 1718.52 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20727. 1718.52 s [algebraic-graphs]
  20728. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  20729. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20730. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20731. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20732. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20733. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20734. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20735. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20736. 1718.52 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20737. 1718.52 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20738. 1718.52 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20739. 1718.52 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20740. 1718.52 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20741. 1718.52 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20742. 1718.52 s [algebraic-graphs]
  20743. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20744. 1718.52 s [algebraic-graphs] OK: dfs empty vs == []
  20745. 1718.52 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20746. 1718.52 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20747. 1718.52 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20748. 1718.52 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20749. 1718.52 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20750. 1718.52 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20751. 1718.52 s [algebraic-graphs] OK: dfs x [] == []
  20752. 1718.52 s [algebraic-graphs]
  20753. 1718.52 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20754. 1718.52 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20755. 1718.52 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20756. 1718.52 s [algebraic-graphs]
  20757. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20758. 1718.52 s [algebraic-graphs] OK: reachable empty x == []
  20759. 1718.52 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20760. 1718.52 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20761. 1718.52 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20762. 1718.52 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20763. 1718.52 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20764. 1718.52 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20765. 1718.52 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20766. 1718.52 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20767. 1718.52 s [algebraic-graphs]
  20768. 1718.52 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20769. 1718.52 s [algebraic-graphs]
  20770. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  20771. 1718.52 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20772. 1718.52 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20773. 1718.52 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20774. 1718.52 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20775. 1718.52 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20776. 1718.52 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20777. 1718.52 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20778. 1718.52 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20779. 1718.52 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20780. 1718.52 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20781. 1718.52 s [algebraic-graphs]
  20782. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  20783. 1718.52 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20784. 1718.52 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20785. 1718.52 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20786. 1718.52 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20787. 1718.52 s [algebraic-graphs]
  20788. 1718.52 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  20789. 1718.52 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20790. 1718.52 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20791. 1718.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20792. 1718.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20793. 1718.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20794. 1718.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20795. 1718.52 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20796. 1718.61 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 )
  20797. 1719.46 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 )
  20798. 1719.46 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 )
  20799. 1719.46 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 )
  20800. 1719.46 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 )
  20801. 1719.46 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 )
  20802. 1719.46 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 )
  20803. 1724.43 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20804. 1724.43 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20805. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20806. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20807. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20808. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20809. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20810. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20811. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20812. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20813. 1724.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20814. 1724.49 s [algebraic-graphs]
  20815. 1724.49 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  20816. 1724.49 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20817. 1724.49 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20818. 1724.49 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20819. 1724.49 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20820. 1724.49 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20821. 1724.49 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20822. 1724.49 s [algebraic-graphs]
  20823. 1724.49 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  20824. 1724.49 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20825. 1724.49 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20826. 1724.49 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20827. 1724.49 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20828. 1724.49 s [algebraic-graphs]
  20829. 1724.49 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  20830. 1724.49 s [algebraic-graphs] OK: scc empty == empty
  20831. 1724.49 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20832. 1724.49 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  20833. 1724.49 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20834. 1724.49 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  20835. 1724.49 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  20836. 1724.49 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20837. 1724.49 s [algebraic-graphs] OK: isAcyclic . scc == const True
  20838. 1724.49 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  20839. 1724.49 s [algebraic-graphs] OK: scc g == KL.scc g
  20840. 1724.49 s [algebraic-graphs]
  20841. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  20842. 1724.49 s [algebraic-graphs] OK: 0 == rightVertex 0
  20843. 1724.49 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  20844. 1724.49 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  20845. 1724.49 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  20846. 1724.49 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  20847. 1724.49 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  20848. 1724.49 s [algebraic-graphs]
  20849. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  20850. 1724.49 s [algebraic-graphs] OK: show empty == "empty"
  20851. 1724.49 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  20852. 1724.49 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  20853. 1724.49 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  20854. 1724.49 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  20855. 1724.49 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  20856. 1724.49 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  20857. 1724.49 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  20858. 1724.49 s [algebraic-graphs]
  20859. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  20860. 1724.49 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  20861. 1724.49 s [algebraic-graphs]
  20862. 1724.49 s [algebraic-graphs] OK: x + y == y + x
  20863. 1724.49 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  20864. 1724.49 s [algebraic-graphs] OK: x * empty == x
  20865. 1724.49 s [algebraic-graphs] OK: empty * x == x
  20866. 1724.49 s [algebraic-graphs] OK: x * y == y * x
  20867. 1724.49 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  20868. 1724.49 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  20869. 1724.49 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  20870. 1724.49 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  20871. 1724.49 s [algebraic-graphs] OK: x + empty == x
  20872. 1724.49 s [algebraic-graphs] OK: empty + x == x
  20873. 1724.49 s [algebraic-graphs] OK: x + x == x
  20874. 1724.49 s [algebraic-graphs] OK: x * y + x + y == x * y
  20875. 1724.49 s [algebraic-graphs] OK: x * x * x == x * x
  20876. 1724.49 s [algebraic-graphs]
  20877. 1724.49 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  20878. 1724.49 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  20879. 1724.49 s [algebraic-graphs]
  20880. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  20881. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20882. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20883. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20884. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20885. 1724.49 s [algebraic-graphs]
  20886. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  20887. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20888. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20889. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20890. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20891. 1724.49 s [algebraic-graphs]
  20892. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  20893. 1724.49 s [algebraic-graphs] OK: isEmpty empty == True
  20894. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20895. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20896. 1724.49 s [algebraic-graphs] OK: hasVertex x empty == False
  20897. 1724.49 s [algebraic-graphs]
  20898. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  20899. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20900. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20901. 1724.49 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  20902. 1724.49 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  20903. 1724.49 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  20904. 1724.49 s [algebraic-graphs]
  20905. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  20906. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20907. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20908. 1724.49 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  20909. 1724.49 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  20910. 1724.49 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  20911. 1724.49 s [algebraic-graphs]
  20912. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  20913. 1724.49 s [algebraic-graphs] OK: vertex . Left == leftVertex
  20914. 1724.49 s [algebraic-graphs] OK: vertex . Right == rightVertex
  20915. 1724.49 s [algebraic-graphs]
  20916. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  20917. 1724.49 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  20918. 1724.49 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20919. 1724.49 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20920. 1724.49 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20921. 1724.49 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  20922. 1724.49 s [algebraic-graphs]
  20923. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  20924. 1724.49 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20925. 1724.49 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20926. 1724.49 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20927. 1724.49 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20928. 1724.49 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20929. 1724.49 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20930. 1724.49 s [algebraic-graphs]
  20931. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  20932. 1724.49 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  20933. 1724.49 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  20934. 1724.49 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  20935. 1724.49 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  20936. 1724.49 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  20937. 1724.49 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20938. 1724.49 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20939. 1724.49 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20940. 1724.49 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20941. 1724.49 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20942. 1724.49 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  20943. 1724.49 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  20944. 1724.49 s [algebraic-graphs]
  20945. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  20946. 1724.49 s [algebraic-graphs] OK: vertices [] [] == empty
  20947. 1724.49 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  20948. 1724.49 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  20949. 1724.49 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  20950. 1724.49 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  20951. 1724.49 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  20952. 1724.49 s [algebraic-graphs]
  20953. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  20954. 1724.49 s [algebraic-graphs] OK: edges [] == empty
  20955. 1724.49 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20956. 1724.49 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20957. 1724.49 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  20958. 1724.49 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20959. 1724.49 s [algebraic-graphs]
  20960. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  20961. 1724.49 s [algebraic-graphs] OK: overlays [] == empty
  20962. 1724.49 s [algebraic-graphs] OK: overlays [x] == x
  20963. 1724.49 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20964. 1724.49 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20965. 1724.49 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20966. 1724.49 s [algebraic-graphs]
  20967. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  20968. 1724.49 s [algebraic-graphs] OK: connects [] == empty
  20969. 1724.49 s [algebraic-graphs] OK: connects [x] == x
  20970. 1724.49 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20971. 1724.49 s [algebraic-graphs] OK: connects == foldr connect empty
  20972. 1724.49 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20973. 1724.49 s [algebraic-graphs]
  20974. 1724.49 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  20975. 1725.70 s [algebraic-graphs] OK: swap empty == empty
  20976. 1725.70 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  20977. 1725.70 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  20978. 1725.70 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  20979. 1725.70 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  20980. 1725.70 s [algebraic-graphs] OK: swap . swap == id
  20981. 1725.70 s [algebraic-graphs]
  20982. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  20983. 1725.70 s [algebraic-graphs] OK: toBipartite empty == empty
  20984. 1725.70 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  20985. 1725.70 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  20986. 1725.70 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  20987. 1725.70 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  20988. 1725.70 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  20989. 1725.70 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  20990. 1725.70 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  20991. 1725.70 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  20992. 1725.70 s [algebraic-graphs]
  20993. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  20994. 1725.70 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  20995. 1725.70 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  20996. 1725.70 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  20997. 1725.70 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  20998. 1725.70 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  20999. 1725.70 s [algebraic-graphs]
  21000. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21001. 1725.70 s [algebraic-graphs] OK: fromBipartite empty == empty
  21002. 1725.70 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21003. 1725.70 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21004. 1725.70 s [algebraic-graphs]
  21005. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21006. 1725.70 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21007. 1725.70 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21008. 1725.70 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21009. 1725.70 s [algebraic-graphs]
  21010. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21011. 1725.70 s [algebraic-graphs] OK: isEmpty empty == True
  21012. 1725.70 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21013. 1725.70 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21014. 1725.70 s [algebraic-graphs] OK: isEmpty == (==) empty
  21015. 1725.70 s [algebraic-graphs]
  21016. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21017. 1725.70 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21018. 1725.70 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21019. 1725.70 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21020. 1725.70 s [algebraic-graphs]
  21021. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21022. 1725.70 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21023. 1725.70 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21024. 1725.70 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21025. 1725.70 s [algebraic-graphs]
  21026. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21027. 1725.70 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21028. 1725.70 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21029. 1725.70 s [algebraic-graphs]
  21030. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21031. 1725.70 s [algebraic-graphs] OK: hasEdge x y empty == False
  21032. 1725.70 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21033. 1725.70 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21034. 1725.70 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21035. 1725.70 s [algebraic-graphs]
  21036. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21037. 1725.70 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21038. 1725.70 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21039. 1725.70 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21040. 1725.70 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21041. 1725.70 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21042. 1725.70 s [algebraic-graphs]
  21043. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21044. 1725.70 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21045. 1725.70 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21046. 1725.70 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21047. 1725.70 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21048. 1725.70 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21049. 1725.70 s [algebraic-graphs]
  21050. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21051. 1725.70 s [algebraic-graphs] OK: vertexCount empty == 0
  21052. 1725.70 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21053. 1725.70 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21054. 1725.70 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21055. 1725.70 s [algebraic-graphs]
  21056. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21057. 1725.70 s [algebraic-graphs] OK: edgeCount empty == 0
  21058. 1725.70 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21059. 1725.70 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21060. 1725.70 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21061. 1725.70 s [algebraic-graphs]
  21062. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21063. 1725.70 s [algebraic-graphs] OK: leftVertexList empty == []
  21064. 1725.70 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21065. 1725.70 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21066. 1725.70 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21067. 1725.70 s [algebraic-graphs]
  21068. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21069. 1725.70 s [algebraic-graphs] OK: rightVertexList empty == []
  21070. 1725.70 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21071. 1725.70 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21072. 1725.70 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21073. 1725.70 s [algebraic-graphs]
  21074. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21075. 1725.70 s [algebraic-graphs] OK: vertexList empty == []
  21076. 1725.70 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21077. 1725.70 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21078. 1725.70 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21079. 1725.70 s [algebraic-graphs]
  21080. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21081. 1725.70 s [algebraic-graphs] OK: edgeList empty == []
  21082. 1725.70 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21083. 1725.70 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21084. 1725.70 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21085. 1725.70 s [algebraic-graphs]
  21086. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21087. 1725.70 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21088. 1725.70 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21089. 1725.70 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21090. 1725.70 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21091. 1725.70 s [algebraic-graphs]
  21092. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21093. 1725.70 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21094. 1725.70 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21095. 1725.70 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21096. 1725.70 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21097. 1725.70 s [algebraic-graphs]
  21098. 1725.70 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21099. 1725.70 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21100. 1725.70 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21101. 1725.70 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21102. 1725.71 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21103. 1725.71 s [algebraic-graphs]
  21104. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21105. 1725.71 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21106. 1725.71 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21107. 1725.71 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21108. 1725.71 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21109. 1725.71 s [algebraic-graphs]
  21110. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21111. 1725.71 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21112. 1725.71 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21113. 1725.71 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21114. 1725.71 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21115. 1725.71 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21116. 1725.71 s [algebraic-graphs]
  21117. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21118. 1725.71 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21119. 1725.71 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21120. 1725.71 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21121. 1725.71 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21122. 1725.71 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21123. 1725.71 s [algebraic-graphs]
  21124. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21125. 1725.71 s [algebraic-graphs] OK: evenList [] == Nil
  21126. 1725.71 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21127. 1725.71 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21128. 1725.71 s [algebraic-graphs]
  21129. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21130. 1725.71 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21131. 1725.71 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21132. 1725.71 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21133. 1725.71 s [algebraic-graphs]
  21134. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21135. 1725.71 s [algebraic-graphs] OK: path Nil == empty
  21136. 1725.71 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21137. 1725.71 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21138. 1725.71 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21139. 1725.71 s [algebraic-graphs]
  21140. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21141. 1725.71 s [algebraic-graphs] OK: circuit [] == empty
  21142. 1725.71 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21143. 1725.71 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21144. 1725.71 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21145. 1725.71 s [algebraic-graphs]
  21146. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21147. 1725.71 s [algebraic-graphs] OK: biclique [] [] == empty
  21148. 1725.71 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21149. 1725.71 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21150. 1725.71 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21151. 1725.71 s [algebraic-graphs]
  21152. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21153. 1725.71 s [algebraic-graphs] OK: star x [] == leftVertex x
  21154. 1725.71 s [algebraic-graphs] OK: star x [y] == edge x y
  21155. 1725.71 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21156. 1725.71 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21157. 1725.71 s [algebraic-graphs]
  21158. 1725.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21159. 1725.71 s [algebraic-graphs] OK: stars [] == empty
  21160. 1725.71 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21161. 1725.71 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21162. 1725.71 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21163. 1726.89 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  21164. 1726.89 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  21165. 1726.89 s [haskell-language-server] but were not needed for compilation:
  21166. 1726.89 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-Hmy7tyNTDWcJfTMwsqlHHm)
  21167. 1726.89 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-CnW24tC17yJ4pR2cvFEpth)
  21168. 1726.89 s [haskell-language-server]
  21169. 1726.90 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 )
  21170. 1727.26 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 )
  21171. 1727.39 s [haskell-language-server] plugins/hls-refactor-plugin/src/Development/IDE/GHC/Dump.hs:10:64: warning: [GHC-61689] [-Wdodgy-imports]
  21172. 1727.39 s [haskell-language-server] Module ‘GHC.Hs’ does not export ‘AnnLet’.
  21173. 1727.39 s [haskell-language-server] |
  21174. 1727.39 s [haskell-language-server] 10 | import GHC.Hs hiding (AnnLet)
  21175. 1727.39 s [haskell-language-server] | ^^^^^^
  21176. 1727.39 s [haskell-language-server]
  21177. 1739.17 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 )
  21178. 1739.18 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 )
  21179. 1739.18 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 )
  21180. 1739.38 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 )
  21181. 1740.46 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 )
  21182. 1741.44 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 )
  21183. 1741.44 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 )
  21184. 1741.44 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 )
  21185. 1741.44 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 )
  21186. 1741.44 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 )
  21187. 1741.44 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 )
  21188. 1742.46 s Waiting for lock on project-manager-path-for-duoids
  21189. 1744.05 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21190. 1744.05 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21191. 1744.05 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21192. 1744.05 s [algebraic-graphs]
  21193. 1744.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21194. 1744.05 s [algebraic-graphs] OK: mesh xs [] == empty
  21195. 1744.05 s [algebraic-graphs] OK: mesh [] ys == empty
  21196. 1744.05 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21197. 1744.05 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21198. 1744.05 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21199. 1744.05 s [algebraic-graphs]
  21200. 1744.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21201. 1744.05 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21202. 1744.05 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21203. 1744.05 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21204. 1744.05 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21205. 1744.05 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21206. 1744.05 s [algebraic-graphs]
  21207. 1744.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21208. 1744.05 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21209. 1744.05 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21210. 1744.05 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21211. 1744.05 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21212. 1744.05 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21213. 1744.05 s [algebraic-graphs]
  21214. 1744.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21215. 1744.05 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21216. 1744.05 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21217. 1744.05 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21218. 1744.05 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21219. 1744.05 s [algebraic-graphs]
  21220. 1744.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21221. 1744.05 s [algebraic-graphs] OK: bimap f g empty == empty
  21222. 1744.05 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21223. 1744.06 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21224. 1744.06 s [algebraic-graphs] OK: bimap id id == id
  21225. 1744.06 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21226. 1744.06 s [algebraic-graphs]
  21227. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21228. 1744.06 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21229. 1744.06 s [algebraic-graphs]
  21230. 1744.06 s [algebraic-graphs] OK: box x y ~~ box y x
  21231. 1744.06 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21232. 1744.06 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21233. 1744.06 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21234. 1744.06 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21235. 1744.06 s [algebraic-graphs] OK: box x empty ~~ empty
  21236. 1744.06 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21237. 1744.06 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21238. 1744.06 s [algebraic-graphs]
  21239. 1744.06 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21240. 1744.06 s [algebraic-graphs]
  21241. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21242. 1744.06 s [algebraic-graphs] OK: consistent empty == True
  21243. 1744.06 s [algebraic-graphs] OK: consistent (vertex x) == True
  21244. 1744.06 s [algebraic-graphs] OK: consistent (edge x y) == True
  21245. 1744.06 s [algebraic-graphs] OK: consistent (edges x) == True
  21246. 1744.06 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21247. 1744.06 s [algebraic-graphs] OK: consistent (swap x) == True
  21248. 1744.06 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21249. 1744.06 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21250. 1744.06 s [algebraic-graphs]
  21251. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21252. 1744.06 s [algebraic-graphs] OK: detectParts empty == Right empty
  21253. 1744.06 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21254. 1744.06 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21255. 1744.06 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21256. 1744.06 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21257. 1744.06 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21258. 1744.06 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21259. 1744.06 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21260. 1744.06 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21261. 1744.06 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21262. 1744.06 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21263. 1744.06 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21264. 1744.06 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21265. 1744.06 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21266. 1744.06 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21267. 1744.06 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21268. 1744.06 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21269. 1744.06 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21270. 1744.06 s [algebraic-graphs]
  21271. 1744.06 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21272. 1744.06 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21273. 1744.06 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21274. 1744.06 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21275. 1744.06 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21276. 1744.06 s [algebraic-graphs]
  21277. 1744.06 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21278. 1744.06 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21279. 1744.06 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21280. 1744.06 s [algebraic-graphs]
  21281. 1744.06 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21282. 1744.06 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21283. 1744.06 s [algebraic-graphs]
  21284. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21285. 1744.06 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21286. 1744.06 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21287. 1744.06 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21288. 1744.06 s [algebraic-graphs]
  21289. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21290. 1744.06 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21291. 1744.06 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21292. 1744.06 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21293. 1744.06 s [algebraic-graphs]
  21294. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21295. 1744.06 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21296. 1744.06 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21297. 1744.06 s [algebraic-graphs]
  21298. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21299. 1744.06 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21300. 1744.06 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21301. 1744.06 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21302. 1744.06 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21303. 1744.06 s [algebraic-graphs]
  21304. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21305. 1744.06 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21306. 1744.06 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21307. 1744.06 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21308. 1744.06 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21309. 1744.06 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21310. 1744.06 s [algebraic-graphs]
  21311. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21312. 1744.06 s [algebraic-graphs] OK: maxMatching empty == matching []
  21313. 1744.06 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21314. 1744.06 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21315. 1744.06 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21316. 1744.06 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21317. 1744.06 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21318. 1744.06 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21319. 1744.06 s [algebraic-graphs]
  21320. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21321. 1744.06 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21322. 1744.06 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21323. 1744.06 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21324. 1744.06 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21325. 1744.06 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21326. 1744.06 s [algebraic-graphs]
  21327. 1744.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21328. 1744.06 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21329. 1746.29 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21330. 1746.29 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21331. 1746.32 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21332. 1746.32 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21333. 1746.32 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21334. 1746.32 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21335. 1746.32 s [algebraic-graphs]
  21336. 1746.32 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21337. 1746.32 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21338. 1746.32 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21339. 1746.32 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21340. 1746.32 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21341. 1746.32 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21342. 1746.32 s [algebraic-graphs]
  21343. 1746.32 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21344. 1746.32 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21345. 1746.32 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21346. 1746.32 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21347. 1746.32 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21348. 1746.32 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21349. 1746.32 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21350. 1746.32 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21351. 1746.32 s [algebraic-graphs]
  21352. 1746.32 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21353. 1746.32 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21354. 1746.32 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21355. 1746.32 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21356. 1746.32 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21357. 1746.32 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21358. 1746.32 s [algebraic-graphs]
  21359. 1746.32 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21360. 1746.32 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21361. 1746.32 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21362. 1746.32 s [algebraic-graphs]
  21363. 1746.32 s [algebraic-graphs] ============ Export.Eq ============
  21364. 1746.32 s [algebraic-graphs] OK: mempty /= literal ""
  21365. 1746.32 s [algebraic-graphs]
  21366. 1746.32 s [algebraic-graphs] ============ Export.Ord ============
  21367. 1746.32 s [algebraic-graphs] OK: mempty < literal ""
  21368. 1746.32 s [algebraic-graphs]
  21369. 1746.32 s [algebraic-graphs] ============ Export.isEmpty ============
  21370. 1746.32 s [algebraic-graphs] OK: isEmpty mempty == True
  21371. 1746.32 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21372. 1746.32 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21373. 1746.32 s [algebraic-graphs]
  21374. 1746.32 s [algebraic-graphs] ============ Export.literal ============
  21375. 1746.32 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21376. 1746.32 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21377. 1746.32 s [algebraic-graphs] OK: render . literal == id
  21378. 1746.32 s [algebraic-graphs]
  21379. 1746.32 s [algebraic-graphs] ============ Export.render ============
  21380. 1746.32 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21381. 1746.32 s [algebraic-graphs] OK: render mempty == mempty
  21382. 1746.32 s [algebraic-graphs]
  21383. 1746.32 s [algebraic-graphs] ============ Export.<+> ============
  21384. 1746.32 s [algebraic-graphs] OK: x <+> mempty == x
  21385. 1746.32 s [algebraic-graphs] OK: mempty <+> x == x
  21386. 1746.32 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21387. 1746.32 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21388. 1746.32 s [algebraic-graphs]
  21389. 1746.32 s [algebraic-graphs] ============ Export.brackets ============
  21390. 1746.32 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21391. 1746.32 s [algebraic-graphs] OK: brackets mempty == "[]"
  21392. 1746.32 s [algebraic-graphs]
  21393. 1746.32 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21394. 1746.32 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21395. 1746.32 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21396. 1746.32 s [algebraic-graphs]
  21397. 1746.32 s [algebraic-graphs] ============ Export.indent ============
  21398. 1746.32 s [algebraic-graphs] OK: indent 0 == id
  21399. 1746.32 s [algebraic-graphs] OK: indent 1 mempty == " "
  21400. 1746.32 s [algebraic-graphs]
  21401. 1746.32 s [algebraic-graphs] ============ Export.unlines ============
  21402. 1746.32 s [algebraic-graphs] OK: unlines [] == mempty
  21403. 1746.32 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21404. 1746.32 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21405. 1746.32 s [algebraic-graphs]
  21406. 1746.32 s [algebraic-graphs] ============ Export.export ============
  21407. 1746.32 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21408. 1746.32 s [algebraic-graphs]
  21409. 1746.32 s [algebraic-graphs] ============ Export.Dot.export ============
  21410. 1746.32 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21411. 1746.32 s [algebraic-graphs]
  21412. 1746.32 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21413. 1746.32 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21414. 1746.32 s [algebraic-graphs]
  21415. 1746.32 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21416. 1746.32 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21417. 1746.32 s [algebraic-graphs]
  21418. 1746.32 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21419. 1746.32 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21420. 1746.32 s [algebraic-graphs]
  21421. 1746.32 s [algebraic-graphs] ============ Graph ============
  21422. 1746.32 s [algebraic-graphs] OK: Axioms of graphs
  21423. 1746.32 s [algebraic-graphs] OK: Theorems of graphs
  21424. 1746.32 s [algebraic-graphs]
  21425. 1746.32 s [algebraic-graphs] ============ Graph.Ord ============
  21426. 1746.32 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21427. 1746.32 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21428. 1746.32 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21429. 1746.32 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21430. 1746.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21431. 1746.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21432. 1746.32 s [algebraic-graphs] OK: x <= x + y
  21433. 1746.32 s [algebraic-graphs] OK: x + y <= x * y
  21434. 1746.32 s [algebraic-graphs]
  21435. 1746.32 s [algebraic-graphs] ============ Graph.empty ============
  21436. 1746.32 s [algebraic-graphs] OK: isEmpty empty == True
  21437. 1746.32 s [algebraic-graphs] OK: hasVertex x empty == False
  21438. 1746.32 s [algebraic-graphs] OK: vertexCount empty == 0
  21439. 1746.32 s [algebraic-graphs] OK: edgeCount empty == 0
  21440. 1746.32 s [algebraic-graphs]
  21441. 1746.32 s [algebraic-graphs] ============ Graph.vertex ============
  21442. 1746.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21443. 1746.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21444. 1746.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21445. 1746.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21446. 1746.32 s [algebraic-graphs]
  21447. 1746.32 s [algebraic-graphs] ============ Graph.edge ============
  21448. 1746.32 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21449. 1746.32 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21450. 1746.32 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21451. 1746.32 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21452. 1746.32 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21453. 1746.32 s [algebraic-graphs]
  21454. 1746.32 s [algebraic-graphs] ============ Graph.overlay ============
  21455. 1746.32 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21456. 1746.32 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21457. 1746.32 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21458. 1746.32 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21459. 1746.32 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21460. 1746.32 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21461. 1746.32 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21462. 1746.32 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21463. 1746.32 s [algebraic-graphs]
  21464. 1746.32 s [algebraic-graphs] ============ Graph.connect ============
  21465. 1746.32 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21466. 1746.32 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21467. 1746.32 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21468. 1746.32 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21469. 1746.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21470. 1746.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21471. 1746.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21472. 1746.32 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21473. 1746.32 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21474. 1746.32 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21475. 1746.32 s [algebraic-graphs]
  21476. 1746.32 s [algebraic-graphs] ============ Graph.vertices ============
  21477. 1746.33 s [algebraic-graphs] OK: vertices [] == empty
  21478. 1746.33 s [algebraic-graphs] OK: vertices [x] == vertex x
  21479. 1746.33 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21480. 1746.33 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21481. 1746.33 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21482. 1746.33 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21483. 1746.33 s [algebraic-graphs]
  21484. 1746.33 s [algebraic-graphs] ============ Graph.edges ============
  21485. 1746.33 s [algebraic-graphs] OK: edges [] == empty
  21486. 1746.33 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21487. 1746.33 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21488. 1746.33 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21489. 1746.33 s [algebraic-graphs]
  21490. 1746.33 s [algebraic-graphs] ============ Graph.overlays ============
  21491. 1746.33 s [algebraic-graphs] OK: overlays [] == empty
  21492. 1746.33 s [algebraic-graphs] OK: overlays [x] == x
  21493. 1746.33 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21494. 1746.33 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21495. 1746.33 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21496. 1746.33 s [algebraic-graphs]
  21497. 1746.33 s [algebraic-graphs] ============ Graph.connects ============
  21498. 1746.33 s [algebraic-graphs] OK: connects [] == empty
  21499. 1746.33 s [algebraic-graphs] OK: connects [x] == x
  21500. 1746.33 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21501. 1746.33 s [algebraic-graphs] OK: connects == foldr connect empty
  21502. 1746.33 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21503. 1746.33 s [algebraic-graphs]
  21504. 1746.33 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21505. 1746.33 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21506. 1746.33 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21507. 1746.33 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21508. 1746.33 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21509. 1746.33 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21510. 1746.33 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21511. 1746.33 s [algebraic-graphs]
  21512. 1746.33 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21513. 1746.33 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21514. 1746.33 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21515. 1746.33 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21516. 1746.33 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21517. 1746.33 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21518. 1746.33 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21519. 1746.33 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21520. 1746.33 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21521. 1746.33 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21522. 1747.03 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21523. 1747.03 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21524. 1747.03 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21525. 1747.03 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21526. 1747.03 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21527. 1747.03 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21528. 1747.03 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21529. 1747.03 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21530. 1747.03 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21531. 1747.03 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21532. 1747.03 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21533. 1747.03 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21534. 1747.03 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21535. 1747.03 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21536. 1747.03 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21537. 1747.03 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21538. 1747.03 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21539. 1747.03 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21540. 1747.03 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21541. 1747.03 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21542. 1747.03 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21543. 1747.03 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21544. 1747.03 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21545. 1747.03 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21546. 1747.03 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21547. 1747.03 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21548. 1747.03 s [algebraic-graphs]
  21549. 1747.03 s [algebraic-graphs] ============ Graph.foldg ============
  21550. 1747.03 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21551. 1747.03 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21552. 1747.03 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21553. 1747.03 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21554. 1747.03 s [algebraic-graphs]
  21555. 1747.03 s [algebraic-graphs] ============ Graph.isEmpty ============
  21556. 1747.03 s [algebraic-graphs] OK: isEmpty empty == True
  21557. 1747.03 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21558. 1747.03 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21559. 1747.03 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21560. 1747.03 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21561. 1747.03 s [algebraic-graphs]
  21562. 1747.03 s [algebraic-graphs] ============ Graph.hasVertex ============
  21563. 1747.03 s [algebraic-graphs] OK: hasVertex x empty == False
  21564. 1747.03 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21565. 1747.03 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21566. 1747.03 s [algebraic-graphs]
  21567. 1747.03 s [algebraic-graphs] ============ Graph.hasEdge ============
  21568. 1747.03 s [algebraic-graphs] OK: hasEdge x y empty == False
  21569. 1747.03 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21570. 1747.03 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21571. 1747.03 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21572. 1747.03 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21573. 1747.03 s [algebraic-graphs]
  21574. 1747.03 s [algebraic-graphs] ============ Graph.vertexCount ============
  21575. 1747.03 s [algebraic-graphs] OK: vertexCount empty == 0
  21576. 1747.03 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21577. 1747.03 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21578. 1747.03 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21579. 1747.03 s [algebraic-graphs]
  21580. 1747.03 s [algebraic-graphs] ============ Graph.edgeCount ============
  21581. 1747.03 s [algebraic-graphs] OK: edgeCount empty == 0
  21582. 1747.03 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21583. 1747.03 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21584. 1747.03 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21585. 1747.03 s [algebraic-graphs]
  21586. 1747.03 s [algebraic-graphs] ============ Graph.vertexList ============
  21587. 1747.03 s [algebraic-graphs] OK: vertexList empty == []
  21588. 1747.03 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21589. 1747.03 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21590. 1747.03 s [algebraic-graphs]
  21591. 1747.03 s [algebraic-graphs] ============ Graph.vertexSet ============
  21592. 1747.04 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21593. 1747.04 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21594. 1747.04 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21595. 1747.04 s [algebraic-graphs]
  21596. 1747.04 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21597. 1747.04 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21598. 1747.04 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21599. 1747.04 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21600. 1747.04 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21601. 1747.04 s [algebraic-graphs]
  21602. 1747.04 s [algebraic-graphs] ============ Graph.edgeList ============
  21603. 1747.04 s [algebraic-graphs] OK: edgeList empty == []
  21604. 1747.04 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21605. 1747.04 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21606. 1747.04 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21607. 1747.04 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21608. 1747.04 s [algebraic-graphs]
  21609. 1747.04 s [algebraic-graphs] ============ Graph.edgeSet ============
  21610. 1747.04 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21611. 1747.04 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21612. 1747.04 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21613. 1747.04 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21614. 1747.04 s [algebraic-graphs]
  21615. 1747.04 s [algebraic-graphs] ============ Graph.adjacencyList ============
  21616. 1747.04 s [algebraic-graphs] OK: adjacencyList empty == []
  21617. 1747.04 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21618. 1747.04 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21619. 1747.04 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21620. 1747.04 s [algebraic-graphs]
  21621. 1747.04 s [algebraic-graphs] ============ Graph.preSet ============
  21622. 1747.04 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21623. 1747.04 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21624. 1747.04 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21625. 1747.04 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21626. 1747.04 s [algebraic-graphs]
  21627. 1747.04 s [algebraic-graphs] ============ Graph.preIntSet ============
  21628. 1747.04 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21629. 1747.04 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21630. 1747.04 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21631. 1747.04 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21632. 1747.04 s [algebraic-graphs]
  21633. 1747.04 s [algebraic-graphs] ============ Graph.postSet ============
  21634. 1747.04 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21635. 1747.04 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21636. 1747.04 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21637. 1747.04 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21638. 1747.04 s [algebraic-graphs]
  21639. 1747.04 s [algebraic-graphs] ============ Graph.postIntSet ============
  21640. 1747.04 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21641. 1747.04 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21642. 1747.04 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21643. 1747.04 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21644. 1747.04 s [algebraic-graphs]
  21645. 1747.04 s [algebraic-graphs] ============ Graph.size ============
  21646. 1747.04 s [algebraic-graphs] OK: size empty == 1
  21647. 1747.04 s [algebraic-graphs] OK: size (vertex x) == 1
  21648. 1747.04 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  21649. 1747.04 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  21650. 1747.04 s [algebraic-graphs] OK: size x >= 1
  21651. 1747.04 s [algebraic-graphs] OK: size x >= vertexCount x
  21652. 1747.04 s [algebraic-graphs]
  21653. 1747.04 s [algebraic-graphs] ============ Graph.path ============
  21654. 1747.04 s [algebraic-graphs] OK: path [] == empty
  21655. 1747.04 s [algebraic-graphs] OK: path [x] == vertex x
  21656. 1747.04 s [algebraic-graphs] OK: path [x,y] == edge x y
  21657. 1747.04 s [algebraic-graphs]
  21658. 1747.04 s [algebraic-graphs] ============ Graph.circuit ============
  21659. 1747.04 s [algebraic-graphs] OK: circuit [] == empty
  21660. 1747.04 s [algebraic-graphs] OK: circuit [x] == edge x x
  21661. 1747.04 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21662. 1747.04 s [algebraic-graphs]
  21663. 1747.04 s [algebraic-graphs] ============ Graph.clique ============
  21664. 1747.04 s [algebraic-graphs] OK: clique [] == empty
  21665. 1747.04 s [algebraic-graphs] OK: clique [x] == vertex x
  21666. 1747.04 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21667. 1747.04 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21668. 1747.04 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21669. 1747.04 s [algebraic-graphs]
  21670. 1747.04 s [algebraic-graphs] ============ Graph.biclique ============
  21671. 1747.04 s [algebraic-graphs] OK: biclique [] [] == empty
  21672. 1747.04 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21673. 1747.04 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21674. 1747.04 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21675. 1747.04 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21676. 1747.04 s [algebraic-graphs]
  21677. 1747.04 s [algebraic-graphs] ============ Graph.star ============
  21678. 1747.04 s [algebraic-graphs] OK: star x [] == vertex x
  21679. 1747.04 s [algebraic-graphs] OK: star x [y] == edge x y
  21680. 1747.04 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21681. 1747.04 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21682. 1747.04 s [algebraic-graphs]
  21683. 1747.04 s [algebraic-graphs] ============ Graph.stars ============
  21684. 1747.04 s [algebraic-graphs] OK: stars [] == empty
  21685. 1747.04 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21686. 1747.04 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21687. 1747.04 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21688. 1747.04 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21689. 1747.04 s [algebraic-graphs] OK: stars . adjacencyList == id
  21690. 1747.04 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21691. 1747.04 s [algebraic-graphs]
  21692. 1747.04 s [algebraic-graphs] ============ Graph.tree ============
  21693. 1747.04 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21694. 1747.04 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21695. 1747.04 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21696. 1747.04 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21697. 1747.04 s [algebraic-graphs]
  21698. 1747.04 s [algebraic-graphs] ============ Graph.forest ============
  21699. 1747.04 s [algebraic-graphs] OK: forest [] == empty
  21700. 1747.04 s [algebraic-graphs] OK: forest [x] == tree x
  21701. 1747.04 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21702. 1747.04 s [algebraic-graphs] OK: forest == overlays . map tree
  21703. 1747.04 s [algebraic-graphs]
  21704. 1747.04 s [algebraic-graphs] ============ Graph.removeVertex ============
  21705. 1750.54 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21706. 1750.54 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21707. 1750.54 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21708. 1750.54 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21709. 1750.54 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21710. 1750.54 s [algebraic-graphs]
  21711. 1750.54 s [algebraic-graphs] ============ Graph.removeEdge ============
  21712. 1750.54 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21713. 1750.54 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21714. 1750.54 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21715. 1750.54 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21716. 1750.54 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21717. 1750.54 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  21718. 1750.54 s [algebraic-graphs]
  21719. 1750.54 s [algebraic-graphs] ============ Graph.replaceVertex ============
  21720. 1750.54 s [algebraic-graphs] OK: replaceVertex x x == id
  21721. 1750.54 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21722. 1750.54 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21723. 1750.54 s [algebraic-graphs]
  21724. 1750.54 s [algebraic-graphs] ============ Graph.mergeVertices ============
  21725. 1750.54 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21726. 1750.54 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21727. 1750.54 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21728. 1750.54 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21729. 1750.54 s [algebraic-graphs]
  21730. 1750.54 s [algebraic-graphs] ============ Graph.transpose ============
  21731. 1750.54 s [algebraic-graphs] OK: transpose empty == empty
  21732. 1750.54 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21733. 1750.54 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21734. 1750.54 s [algebraic-graphs] OK: transpose . transpose == id
  21735. 1750.54 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21736. 1750.54 s [algebraic-graphs]
  21737. 1750.54 s [algebraic-graphs] ============ Graph.gmap ============
  21738. 1750.54 s [algebraic-graphs] OK: gmap f empty == empty
  21739. 1750.54 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21740. 1750.54 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21741. 1750.54 s [algebraic-graphs] OK: gmap id == id
  21742. 1750.54 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21743. 1750.54 s [algebraic-graphs]
  21744. 1750.54 s [algebraic-graphs] ============ Graph.induce ============
  21745. 1750.54 s [algebraic-graphs] OK: induce (const True ) x == x
  21746. 1750.54 s [algebraic-graphs] OK: induce (const False) x == empty
  21747. 1750.54 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21748. 1750.54 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21749. 1750.54 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21750. 1750.54 s [algebraic-graphs]
  21751. 1750.54 s [algebraic-graphs] ============ Graph.induceJust ============
  21752. 1750.54 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21753. 1750.54 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21754. 1750.54 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21755. 1750.54 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21756. 1750.54 s [algebraic-graphs]
  21757. 1750.54 s [algebraic-graphs] ============ Graph.compose ============
  21758. 1750.54 s [algebraic-graphs] OK: compose empty x == empty
  21759. 1750.54 s [algebraic-graphs] OK: compose x empty == empty
  21760. 1750.54 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21761. 1750.54 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21762. 1750.54 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21763. 1750.54 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21764. 1750.54 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21765. 1750.54 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21766. 1750.54 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21767. 1750.54 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21768. 1750.54 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  21769. 1750.54 s [algebraic-graphs]
  21770. 1750.54 s [algebraic-graphs] ============ Graph.(===) ============
  21771. 1750.54 s [algebraic-graphs] OK: x === x == True
  21772. 1750.54 s [algebraic-graphs] OK: x === x + empty == False
  21773. 1750.54 s [algebraic-graphs] OK: x + y === x + y == True
  21774. 1750.54 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  21775. 1750.54 s [algebraic-graphs] OK: x + y === x * y == False
  21776. 1750.54 s [algebraic-graphs]
  21777. 1750.54 s [algebraic-graphs] ============ Graph.mesh ============
  21778. 1750.54 s [algebraic-graphs] OK: mesh xs [] == empty
  21779. 1750.54 s [algebraic-graphs] OK: mesh [] ys == empty
  21780. 1750.54 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  21781. 1750.54 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  21782. 1750.54 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  21783. 1750.54 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  21784. 1750.54 s [algebraic-graphs]
  21785. 1750.54 s [algebraic-graphs] ============ Graph.torus ============
  21786. 1750.54 s [algebraic-graphs] OK: torus xs [] == empty
  21787. 1750.54 s [algebraic-graphs] OK: torus [] ys == empty
  21788. 1750.54 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  21789. 1750.54 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  21790. 1750.54 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  21791. 1750.54 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  21792. 1750.54 s [algebraic-graphs]
  21793. 1750.54 s [algebraic-graphs] ============ Graph.deBruijn ============
  21794. 1750.54 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  21795. 1750.54 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  21796. 1750.54 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  21797. 1750.54 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  21798. 1750.54 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  21799. 1750.54 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  21800. 1750.54 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  21801. 1750.54 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  21802. 1750.54 s [algebraic-graphs]
  21803. 1750.54 s [algebraic-graphs] ============ Graph.splitVertex ============
  21804. 1750.54 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  21805. 1750.54 s [algebraic-graphs] OK: splitVertex x [x] == id
  21806. 1750.54 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  21807. 1750.54 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  21808. 1750.54 s [algebraic-graphs]
  21809. 1750.54 s [algebraic-graphs] ============ Graph.bind ============
  21810. 1750.54 s [algebraic-graphs] OK: bind empty f == empty
  21811. 1750.54 s [algebraic-graphs] OK: bind (vertex x) f == f x
  21812. 1750.54 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  21813. 1750.54 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  21814. 1750.54 s [algebraic-graphs] OK: bind x (const empty) == empty
  21815. 1750.54 s [algebraic-graphs] OK: bind x vertex == x
  21816. 1750.54 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  21817. 1750.54 s [algebraic-graphs]
  21818. 1750.54 s [algebraic-graphs] ============ Graph.simplify ============
  21819. 1750.54 s [algebraic-graphs] OK: simplify == id
  21820. 1750.54 s [algebraic-graphs] OK: size (simplify x) <= size x
  21821. 1750.54 s [algebraic-graphs]
  21822. 1750.54 s [algebraic-graphs] ============ Graph.box ============
  21823. 1750.54 s [algebraic-graphs] OK: box x y ~~ box y x
  21824. 1750.54 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21825. 1750.54 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21826. 1750.54 s [algebraic-graphs] OK: box x empty ~~ empty
  21827. 1750.54 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21828. 1750.54 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21829. 1750.54 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21830. 1750.54 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21831. 1750.54 s [algebraic-graphs]
  21832. 1750.54 s [algebraic-graphs] ============ Graph.sparsify ============
  21833. 1750.54 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  21834. 1750.54 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  21835. 1750.54 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  21836. 1750.54 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  21837. 1750.54 s [algebraic-graphs]
  21838. 1750.54 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  21839. 1750.54 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  21840. 1750.54 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  21841. 1750.54 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  21842. 1750.54 s [algebraic-graphs]
  21843. 1750.54 s [algebraic-graphs] ============ Graph.context ============
  21844. 1750.54 s [algebraic-graphs] OK: context (const False) x == Nothing
  21845. 1750.54 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  21846. 1750.54 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  21847. 1750.54 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  21848. 1750.54 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  21849. 1750.54 s [algebraic-graphs]
  21850. 1750.54 s [algebraic-graphs] ============ Graph.buildg ============
  21851. 1750.54 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  21852. 1750.54 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  21853. 1750.54 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
  21854. 1750.54 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
  21855. 1750.54 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  21856. 1750.54 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  21857. 1750.54 s [algebraic-graphs]
  21858. 1750.54 s [algebraic-graphs] ============ Internal.List ============
  21859. 1750.55 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  21860. 1750.55 s [algebraic-graphs]
  21861. 1750.55 s [algebraic-graphs] ============ Graph.Label ============
  21862. 1750.55 s [algebraic-graphs]
  21863. 1750.55 s [algebraic-graphs] ============ Any: instances ============
  21864. 1750.55 s [algebraic-graphs] OK: Semiring
  21865. 1750.55 s [algebraic-graphs] OK: StarSemiring
  21866. 1750.55 s [algebraic-graphs] OK: Dioid
  21867. 1750.55 s [algebraic-graphs]
  21868. 1750.55 s [algebraic-graphs] ============ Distance Int: instances ============
  21869. 1750.55 s [algebraic-graphs] OK: Semiring
  21870. 1750.55 s [algebraic-graphs] OK: StarSemiring
  21871. 1750.55 s [algebraic-graphs] OK: Dioid
  21872. 1750.55 s [algebraic-graphs]
  21873. 1750.55 s [algebraic-graphs] ============ Capacity Int: instances ============
  21874. 1750.55 s [algebraic-graphs] OK: Semiring
  21875. 1750.55 s [algebraic-graphs] OK: StarSemiring
  21876. 1750.55 s [algebraic-graphs] OK: Dioid
  21877. 1750.55 s [algebraic-graphs]
  21878. 1750.55 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  21879. 1750.55 s [algebraic-graphs] OK: LeftNearRing
  21880. 1750.55 s [algebraic-graphs]
  21881. 1750.55 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  21882. 1750.55 s [algebraic-graphs] OK: Semiring
  21883. 1750.55 s [algebraic-graphs] OK: Dioid
  21884. 1750.55 s [algebraic-graphs]
  21885. 1750.55 s [algebraic-graphs] ============ Count Int: instances ============
  21886. 1750.55 s [algebraic-graphs] OK: Semiring
  21887. 1750.55 s [algebraic-graphs] OK: StarSemiring
  21888. 1750.55 s [algebraic-graphs]
  21889. 1750.55 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  21890. 1750.55 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  21891. 1750.55 s [algebraic-graphs] OK: empty
  21892. 1750.55 s [algebraic-graphs] OK: vertex
  21893. 1750.55 s [algebraic-graphs] OK: edge
  21894. 1750.55 s [algebraic-graphs] OK: overlay
  21895. 1750.55 s [algebraic-graphs] OK: connect
  21896. 1750.55 s [algebraic-graphs] OK: vertices
  21897. 1750.55 s [algebraic-graphs] OK: edges
  21898. 1750.55 s [algebraic-graphs] OK: overlays
  21899. 1750.55 s [algebraic-graphs] OK: fromAdjacencyMaps
  21900. 1750.55 s [algebraic-graphs] OK: removeVertex
  21901. 1750.55 s [algebraic-graphs] OK: removeEdge
  21902. 1750.55 s [algebraic-graphs] OK: replaceVertex
  21903. 1750.55 s [algebraic-graphs] OK: replaceEdge
  21904. 1750.55 s [algebraic-graphs] OK: transpose
  21905. 1750.55 s [algebraic-graphs] OK: gmap
  21906. 1750.55 s [algebraic-graphs] OK: emap
  21907. 1750.55 s [algebraic-graphs] OK: induce
  21908. 1750.55 s [algebraic-graphs] OK: closure
  21909. 1750.55 s [algebraic-graphs] OK: reflexiveClosure
  21910. 1750.55 s [algebraic-graphs] OK: symmetricClosure
  21911. 1750.55 s [algebraic-graphs] OK: transitiveClosure
  21912. 1750.55 s [algebraic-graphs]
  21913. 1750.55 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  21914. 1750.55 s [algebraic-graphs] OK: isEmpty empty == True
  21915. 1750.55 s [algebraic-graphs] OK: hasVertex x empty == False
  21916. 1750.55 s [algebraic-graphs] OK: vertexCount empty == 0
  21917. 1750.55 s [algebraic-graphs] OK: edgeCount empty == 0
  21918. 1750.55 s [algebraic-graphs]
  21919. 1750.55 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  21920. 1750.55 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21921. 1750.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21922. 1750.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21923. 1750.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21924. 1750.55 s [algebraic-graphs]
  21925. 1753.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  21926. 1753.23 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  21927. 1753.23 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  21928. 1753.23 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  21929. 1753.23 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  21930. 1753.23 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  21931. 1753.23 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  21932. 1753.23 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  21933. 1753.23 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  21934. 1753.23 s [algebraic-graphs]
  21935. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  21936. 1753.23 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21937. 1753.23 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21938. 1753.23 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21939. 1753.23 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21940. 1753.23 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21941. 1753.23 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21942. 1753.23 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21943. 1753.23 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21944. 1753.23 s [algebraic-graphs]
  21945. 1753.23 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  21946. 1753.23 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  21947. 1753.23 s [algebraic-graphs]
  21948. 1753.23 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  21949. 1753.23 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  21950. 1753.23 s [algebraic-graphs]
  21951. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  21952. 1753.23 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  21953. 1753.23 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  21954. 1753.23 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  21955. 1753.23 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  21956. 1753.23 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21957. 1753.23 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  21958. 1753.23 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  21959. 1753.23 s [algebraic-graphs]
  21960. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  21961. 1753.23 s [algebraic-graphs] OK: vertices [] == empty
  21962. 1753.23 s [algebraic-graphs] OK: vertices [x] == vertex x
  21963. 1753.23 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21964. 1753.23 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21965. 1753.23 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21966. 1753.23 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21967. 1753.23 s [algebraic-graphs]
  21968. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  21969. 1753.23 s [algebraic-graphs] OK: edges [] == empty
  21970. 1753.23 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  21971. 1753.23 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  21972. 1753.23 s [algebraic-graphs]
  21973. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  21974. 1753.23 s [algebraic-graphs] OK: overlays [] == empty
  21975. 1753.23 s [algebraic-graphs] OK: overlays [x] == x
  21976. 1753.23 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21977. 1753.23 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21978. 1753.23 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21979. 1753.23 s [algebraic-graphs]
  21980. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  21981. 1753.23 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  21982. 1753.23 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  21983. 1753.23 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  21984. 1753.23 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  21985. 1753.23 s [algebraic-graphs]
  21986. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  21987. 1753.23 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21988. 1753.23 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21989. 1753.23 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21990. 1753.23 s [algebraic-graphs]
  21991. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  21992. 1753.23 s [algebraic-graphs] OK: isEmpty empty == True
  21993. 1753.23 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21994. 1753.23 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21995. 1753.23 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21996. 1753.23 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  21997. 1753.23 s [algebraic-graphs]
  21998. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  21999. 1753.23 s [algebraic-graphs] OK: hasVertex x empty == False
  22000. 1753.23 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22001. 1753.23 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22002. 1753.23 s [algebraic-graphs]
  22003. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22004. 1753.23 s [algebraic-graphs] OK: hasEdge x y empty == False
  22005. 1753.23 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22006. 1753.23 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22007. 1753.23 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22008. 1753.23 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22009. 1753.23 s [algebraic-graphs]
  22010. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22011. 1753.23 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22012. 1753.23 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22013. 1753.23 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22014. 1753.23 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22015. 1753.23 s [algebraic-graphs]
  22016. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22017. 1753.23 s [algebraic-graphs] OK: vertexCount empty == 0
  22018. 1753.23 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22019. 1753.23 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22020. 1753.23 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22021. 1753.23 s [algebraic-graphs]
  22022. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22023. 1753.23 s [algebraic-graphs] OK: edgeCount empty == 0
  22024. 1753.23 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22025. 1753.23 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22026. 1753.23 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22027. 1753.23 s [algebraic-graphs]
  22028. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22029. 1753.23 s [algebraic-graphs] OK: vertexList empty == []
  22030. 1753.23 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22031. 1753.23 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22032. 1753.23 s [algebraic-graphs]
  22033. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22034. 1753.23 s [algebraic-graphs] OK: edgeList empty == []
  22035. 1753.23 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22036. 1753.23 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22037. 1753.23 s [algebraic-graphs]
  22038. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22039. 1753.23 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22040. 1753.23 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22041. 1753.23 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22042. 1753.23 s [algebraic-graphs]
  22043. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22044. 1753.23 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22045. 1753.23 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22046. 1753.23 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22047. 1753.23 s [algebraic-graphs]
  22048. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22049. 1753.23 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22050. 1753.23 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22051. 1753.23 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22052. 1753.23 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22053. 1753.23 s [algebraic-graphs]
  22054. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22055. 1753.23 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22056. 1753.23 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22057. 1753.23 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22058. 1753.23 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22059. 1753.23 s [algebraic-graphs]
  22060. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22061. 1753.23 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22062. 1753.23 s [algebraic-graphs]
  22063. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22064. 1753.23 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22065. 1753.23 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22066. 1753.23 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22067. 1753.23 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22068. 1753.23 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22069. 1753.23 s [algebraic-graphs]
  22070. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22071. 1753.23 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22072. 1753.23 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22073. 1753.23 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22074. 1753.23 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22075. 1753.23 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22076. 1753.23 s [algebraic-graphs]
  22077. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22078. 1753.23 s [algebraic-graphs] OK: replaceVertex x x == id
  22079. 1753.23 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22080. 1753.23 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22081. 1753.23 s [algebraic-graphs]
  22082. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22083. 1753.23 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22084. 1753.23 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22085. 1753.23 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22086. 1753.23 s [algebraic-graphs]
  22087. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22088. 1753.23 s [algebraic-graphs] OK: transpose empty == empty
  22089. 1753.23 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22090. 1753.23 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22091. 1753.23 s [algebraic-graphs] OK: transpose . transpose == id
  22092. 1753.23 s [algebraic-graphs]
  22093. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22094. 1753.23 s [algebraic-graphs] OK: gmap f empty == empty
  22095. 1753.23 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22096. 1753.23 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22097. 1753.23 s [algebraic-graphs] OK: gmap id == id
  22098. 1753.23 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22099. 1753.23 s [algebraic-graphs]
  22100. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22101. 1753.23 s [algebraic-graphs] OK: emap h empty == empty
  22102. 1753.23 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22103. 1753.23 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22104. 1753.23 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22105. 1753.23 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22106. 1753.23 s [algebraic-graphs] OK: emap id == id
  22107. 1753.23 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22108. 1753.23 s [algebraic-graphs]
  22109. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22110. 1753.23 s [algebraic-graphs] OK: induce (const True ) x == x
  22111. 1753.23 s [algebraic-graphs] OK: induce (const False) x == empty
  22112. 1753.23 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22113. 1753.23 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22114. 1753.23 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22115. 1753.23 s [algebraic-graphs]
  22116. 1753.23 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22117. 1753.48 s [haskell-language-server] Preprocessing library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0...
  22118. 1753.48 s [haskell-language-server] Building library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0...
  22119. 1753.59 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 )
  22120. 1754.10 s [haskell-language-server] plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs:264:13: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  22121. 1754.10 s [haskell-language-server] Pattern match(es) are non-exhaustive
  22122. 1754.10 s [haskell-language-server] In a pattern binding:
  22123. 1754.10 s [haskell-language-server] Patterns of type ‘EpToken "where"’ not matched:
  22124. 1754.10 s [haskell-language-server] NoEpTok
  22125. 1754.10 s [haskell-language-server] EpTok (EpaDelta _ _ _)
  22126. 1754.10 s [haskell-language-server] |
  22127. 1754.10 s [haskell-language-server] 264 | (EpTok (EpaSpan aw)) = andd_where annDataDefn
  22128. 1754.10 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  22129. 1754.10 s [haskell-language-server]
  22130. 1754.38 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22131. 1754.38 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22132. 1754.38 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22133. 1754.38 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22134. 1754.38 s [algebraic-graphs]
  22135. 1754.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22136. 1754.38 s [algebraic-graphs] OK: closure empty == empty
  22137. 1754.38 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22138. 1754.38 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22139. 1754.38 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22140. 1754.38 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22141. 1754.38 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22142. 1754.38 s [algebraic-graphs] OK: closure . closure == closure
  22143. 1754.38 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22144. 1754.38 s [algebraic-graphs]
  22145. 1754.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22146. 1754.38 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22147. 1754.38 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22148. 1754.38 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22149. 1754.38 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22150. 1754.38 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22151. 1754.38 s [algebraic-graphs]
  22152. 1754.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22153. 1754.38 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22154. 1754.38 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22155. 1754.38 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22156. 1754.38 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22157. 1754.38 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22158. 1754.38 s [algebraic-graphs]
  22159. 1754.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22160. 1754.38 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22161. 1754.38 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22162. 1754.38 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22163. 1754.38 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22164. 1754.38 s [algebraic-graphs]
  22165. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22166. 1754.38 s [algebraic-graphs] OK: isEmpty empty == True
  22167. 1754.38 s [algebraic-graphs] OK: hasVertex x empty == False
  22168. 1754.38 s [algebraic-graphs] OK: vertexCount empty == 0
  22169. 1754.38 s [algebraic-graphs] OK: edgeCount empty == 0
  22170. 1754.38 s [algebraic-graphs]
  22171. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22172. 1754.38 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22173. 1754.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22174. 1754.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22175. 1754.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22176. 1754.38 s [algebraic-graphs]
  22177. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22178. 1754.38 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22179. 1754.38 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22180. 1754.38 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22181. 1754.38 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22182. 1754.38 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22183. 1754.38 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22184. 1754.38 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22185. 1754.38 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22186. 1754.38 s [algebraic-graphs]
  22187. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22188. 1754.38 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22189. 1754.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22190. 1754.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22191. 1754.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22192. 1754.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22193. 1754.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22194. 1754.38 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22195. 1754.38 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22196. 1754.38 s [algebraic-graphs]
  22197. 1754.38 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22198. 1754.38 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22199. 1754.38 s [algebraic-graphs]
  22200. 1754.38 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22201. 1754.38 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22202. 1754.38 s [algebraic-graphs]
  22203. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22204. 1754.38 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22205. 1754.38 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22206. 1754.38 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22207. 1754.38 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22208. 1754.38 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22209. 1754.38 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22210. 1754.38 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22211. 1754.38 s [algebraic-graphs]
  22212. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22213. 1754.38 s [algebraic-graphs] OK: vertices [] == empty
  22214. 1754.38 s [algebraic-graphs] OK: vertices [x] == vertex x
  22215. 1754.38 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22216. 1754.38 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22217. 1754.38 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22218. 1754.38 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22219. 1754.38 s [algebraic-graphs]
  22220. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22221. 1754.38 s [algebraic-graphs] OK: edges [] == empty
  22222. 1754.38 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22223. 1754.38 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22224. 1754.38 s [algebraic-graphs]
  22225. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22226. 1754.38 s [algebraic-graphs] OK: overlays [] == empty
  22227. 1754.38 s [algebraic-graphs] OK: overlays [x] == x
  22228. 1754.38 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22229. 1754.38 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22230. 1754.38 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22231. 1754.38 s [algebraic-graphs]
  22232. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22233. 1754.38 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22234. 1754.38 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22235. 1754.38 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22236. 1754.38 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22237. 1754.38 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22238. 1754.38 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22239. 1754.38 s [algebraic-graphs]
  22240. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22241. 1754.38 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22242. 1754.38 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22243. 1754.38 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22244. 1754.38 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22245. 1754.38 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22246. 1754.38 s [algebraic-graphs]
  22247. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22248. 1754.38 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22249. 1754.38 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22250. 1754.38 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22251. 1754.38 s [algebraic-graphs]
  22252. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22253. 1754.38 s [algebraic-graphs] OK: isEmpty empty == True
  22254. 1754.38 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22255. 1754.38 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22256. 1754.38 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22257. 1754.38 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22258. 1754.38 s [algebraic-graphs]
  22259. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22260. 1754.38 s [algebraic-graphs] OK: size empty == 1
  22261. 1754.38 s [algebraic-graphs] OK: size (vertex x) == 1
  22262. 1754.38 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22263. 1754.38 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22264. 1754.38 s [algebraic-graphs] OK: size x >= 1
  22265. 1754.38 s [algebraic-graphs] OK: size x >= vertexCount x
  22266. 1754.38 s [algebraic-graphs]
  22267. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22268. 1754.38 s [algebraic-graphs] OK: hasVertex x empty == False
  22269. 1754.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22270. 1754.38 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22271. 1754.38 s [algebraic-graphs]
  22272. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22273. 1754.38 s [algebraic-graphs] OK: hasEdge x y empty == False
  22274. 1754.38 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22275. 1754.38 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22276. 1754.38 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22277. 1754.38 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22278. 1754.38 s [algebraic-graphs]
  22279. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22280. 1754.38 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22281. 1754.38 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22282. 1754.38 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22283. 1754.38 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22284. 1754.38 s [algebraic-graphs]
  22285. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22286. 1754.38 s [algebraic-graphs] OK: vertexCount empty == 0
  22287. 1754.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22288. 1754.38 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22289. 1754.38 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22290. 1754.38 s [algebraic-graphs]
  22291. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22292. 1754.38 s [algebraic-graphs] OK: edgeCount empty == 0
  22293. 1754.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22294. 1754.38 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22295. 1754.38 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22296. 1754.38 s [algebraic-graphs]
  22297. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22298. 1754.38 s [algebraic-graphs] OK: vertexList empty == []
  22299. 1754.38 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22300. 1754.38 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22301. 1754.38 s [algebraic-graphs]
  22302. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22303. 1754.38 s [algebraic-graphs] OK: edgeList empty == []
  22304. 1754.38 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22305. 1754.38 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22306. 1754.38 s [algebraic-graphs]
  22307. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22308. 1754.38 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22309. 1754.38 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22310. 1754.38 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22311. 1754.38 s [algebraic-graphs]
  22312. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22313. 1754.38 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22314. 1754.38 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22315. 1754.38 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22316. 1754.38 s [algebraic-graphs]
  22317. 1754.38 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22318. 1754.38 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22319. 1754.38 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22320. 1754.44 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 )
  22321. 1756.66 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 )
  22322. 1757.04 s [haskell-language-server] plugins/hls-gadt-plugin/src/Ide/Plugin/GHC.hs:264:13: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  22323. 1757.04 s [haskell-language-server] Pattern match(es) are non-exhaustive
  22324. 1757.04 s [haskell-language-server] In a pattern binding:
  22325. 1757.04 s [haskell-language-server] Patterns of type ‘EpToken "where"’ not matched:
  22326. 1757.04 s [haskell-language-server] NoEpTok
  22327. 1757.04 s [haskell-language-server] EpTok (EpaDelta _ _ _)
  22328. 1757.04 s [haskell-language-server] |
  22329. 1757.04 s [haskell-language-server] 264 | (EpTok (EpaSpan aw)) = andd_where annDataDefn
  22330. 1757.04 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  22331. 1757.04 s [haskell-language-server]
  22332. 1757.23 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22333. 1757.23 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22334. 1757.23 s [algebraic-graphs]
  22335. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22336. 1757.23 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22337. 1757.23 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22338. 1757.23 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22339. 1757.23 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22340. 1757.23 s [algebraic-graphs]
  22341. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22342. 1757.23 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22343. 1757.23 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22344. 1757.23 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22345. 1757.23 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22346. 1757.23 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22347. 1757.23 s [algebraic-graphs]
  22348. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22349. 1757.23 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22350. 1757.23 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22351. 1757.23 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22352. 1757.23 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22353. 1757.23 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22354. 1757.23 s [algebraic-graphs]
  22355. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22356. 1757.23 s [algebraic-graphs] OK: replaceVertex x x == id
  22357. 1757.23 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22358. 1757.23 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22359. 1757.23 s [algebraic-graphs]
  22360. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22361. 1757.23 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22362. 1757.23 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22363. 1757.23 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22364. 1757.23 s [algebraic-graphs]
  22365. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22366. 1757.23 s [algebraic-graphs] OK: transpose empty == empty
  22367. 1757.23 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22368. 1757.23 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22369. 1757.23 s [algebraic-graphs] OK: transpose . transpose == id
  22370. 1757.23 s [algebraic-graphs]
  22371. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22372. 1757.23 s [algebraic-graphs] OK: fmap f empty == empty
  22373. 1757.23 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22374. 1757.23 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22375. 1757.23 s [algebraic-graphs] OK: fmap id == id
  22376. 1757.23 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22377. 1757.23 s [algebraic-graphs]
  22378. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22379. 1757.23 s [algebraic-graphs] OK: emap h empty == empty
  22380. 1757.23 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22381. 1757.23 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22382. 1757.23 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22383. 1757.23 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22384. 1757.23 s [algebraic-graphs] OK: emap id == id
  22385. 1757.23 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22386. 1757.23 s [algebraic-graphs]
  22387. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22388. 1757.23 s [algebraic-graphs] OK: induce (const True ) x == x
  22389. 1757.23 s [algebraic-graphs] OK: induce (const False) x == empty
  22390. 1757.23 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22391. 1757.23 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22392. 1757.23 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22393. 1757.23 s [algebraic-graphs]
  22394. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22395. 1757.23 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22396. 1757.23 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22397. 1757.23 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22398. 1757.23 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22399. 1757.23 s [algebraic-graphs]
  22400. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22401. 1757.23 s [algebraic-graphs] OK: closure empty == empty
  22402. 1757.23 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22403. 1757.23 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22404. 1757.23 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22405. 1757.23 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22406. 1757.23 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22407. 1757.23 s [algebraic-graphs] OK: closure . closure == closure
  22408. 1757.23 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22409. 1757.23 s [algebraic-graphs]
  22410. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22411. 1757.23 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22412. 1757.23 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22413. 1757.23 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22414. 1757.23 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22415. 1757.23 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22416. 1757.23 s [algebraic-graphs]
  22417. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22418. 1757.23 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22419. 1757.23 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22420. 1757.23 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22421. 1757.23 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22422. 1757.23 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22423. 1757.23 s [algebraic-graphs]
  22424. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22425. 1757.23 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22426. 1757.23 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22427. 1757.23 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22428. 1757.23 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22429. 1757.23 s [algebraic-graphs]
  22430. 1757.23 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22431. 1757.23 s [algebraic-graphs] OK: context (const False) x == Nothing
  22432. 1757.23 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22433. 1757.23 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22434. 1757.23 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22435. 1757.23 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22436. 1757.23 s [algebraic-graphs]
  22437. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22438. 1757.23 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22439. 1757.23 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22440. 1757.23 s [algebraic-graphs]
  22441. 1757.23 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22442. 1757.23 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22443. 1757.23 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22444. 1757.23 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22445. 1757.23 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22446. 1757.23 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22447. 1757.23 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22448. 1757.23 s [algebraic-graphs] OK: x <= x + y
  22449. 1757.23 s [algebraic-graphs] OK: x + y <= x * y
  22450. 1757.23 s [algebraic-graphs]
  22451. 1757.23 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22452. 1757.23 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22453. 1757.23 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22454. 1757.23 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22455. 1757.23 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22456. 1757.23 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22457. 1757.23 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22458. 1757.23 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22459. 1757.23 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22460. 1757.23 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22461. 1757.23 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22462. 1757.23 s [algebraic-graphs]
  22463. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22464. 1757.23 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22465. 1757.23 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22466. 1757.23 s [algebraic-graphs]
  22467. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22468. 1757.23 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22469. 1757.23 s [algebraic-graphs]
  22470. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22471. 1757.23 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22472. 1757.23 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22473. 1757.23 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22474. 1757.23 s [algebraic-graphs]
  22475. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22476. 1757.23 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22477. 1757.23 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22478. 1757.23 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22479. 1757.23 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22480. 1757.23 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22481. 1757.23 s [algebraic-graphs]
  22482. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22483. 1757.23 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22484. 1757.23 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22485. 1757.23 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22486. 1757.23 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22487. 1757.23 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22488. 1757.23 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22489. 1757.23 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22490. 1757.23 s [algebraic-graphs]
  22491. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22492. 1757.23 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22493. 1757.23 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22494. 1757.23 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22495. 1757.23 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22496. 1757.23 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22497. 1757.23 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22498. 1757.23 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22499. 1757.23 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22500. 1757.23 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22501. 1757.23 s [algebraic-graphs]
  22502. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22503. 1757.23 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22504. 1757.23 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22505. 1757.23 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22506. 1757.23 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22507. 1757.23 s [algebraic-graphs]
  22508. 1757.23 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22509. 1757.23 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22510. 1757.23 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22511. 1757.23 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22512. 1757.23 s [algebraic-graphs]
  22513. 1757.48 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 )
  22514. 1760.45 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22515. 1760.45 s [algebraic-graphs] OK: overlays1 [x] == x
  22516. 1760.45 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22517. 1760.52 s [algebraic-graphs]
  22518. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22519. 1760.52 s [algebraic-graphs] OK: connects1 [x] == x
  22520. 1760.52 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22521. 1760.52 s [algebraic-graphs]
  22522. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22523. 1760.52 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22524. 1760.52 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22525. 1760.52 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22526. 1760.52 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22527. 1760.52 s [algebraic-graphs]
  22528. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22529. 1760.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22530. 1760.52 s [algebraic-graphs]
  22531. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22532. 1760.52 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22533. 1760.52 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22534. 1760.52 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22535. 1760.52 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22536. 1760.52 s [algebraic-graphs]
  22537. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22538. 1760.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22539. 1760.52 s [algebraic-graphs] OK: vertexCount x >= 1
  22540. 1760.52 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22541. 1760.52 s [algebraic-graphs]
  22542. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22543. 1760.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22544. 1760.52 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22545. 1760.52 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22546. 1760.52 s [algebraic-graphs]
  22547. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22548. 1760.52 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22549. 1760.52 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22550. 1760.52 s [algebraic-graphs]
  22551. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22552. 1760.52 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22553. 1760.52 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22554. 1760.52 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22555. 1760.52 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22556. 1760.52 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22557. 1760.52 s [algebraic-graphs]
  22558. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22559. 1760.52 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22560. 1760.52 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22561. 1760.52 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22562. 1760.52 s [algebraic-graphs]
  22563. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22564. 1760.52 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22565. 1760.52 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22566. 1760.52 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22567. 1760.52 s [algebraic-graphs]
  22568. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22569. 1760.52 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22570. 1760.52 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22571. 1760.52 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22572. 1760.52 s [algebraic-graphs]
  22573. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22574. 1760.52 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22575. 1760.52 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22576. 1760.52 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22577. 1760.52 s [algebraic-graphs]
  22578. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22579. 1760.52 s [algebraic-graphs] OK: path1 [x] == vertex x
  22580. 1760.52 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22581. 1760.52 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22582. 1760.52 s [algebraic-graphs]
  22583. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22584. 1760.52 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22585. 1760.52 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22586. 1760.52 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22587. 1760.52 s [algebraic-graphs]
  22588. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22589. 1760.52 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22590. 1760.52 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22591. 1760.52 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22592. 1760.52 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22593. 1760.52 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22594. 1760.52 s [algebraic-graphs]
  22595. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22596. 1760.52 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22597. 1760.52 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22598. 1760.52 s [algebraic-graphs]
  22599. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22600. 1760.52 s [algebraic-graphs] OK: star x [] == vertex x
  22601. 1760.52 s [algebraic-graphs] OK: star x [y] == edge x y
  22602. 1760.52 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22603. 1760.52 s [algebraic-graphs]
  22604. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22605. 1760.52 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22606. 1760.52 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22607. 1760.52 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22608. 1760.52 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22609. 1760.52 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22610. 1760.52 s [algebraic-graphs]
  22611. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22612. 1760.52 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22613. 1760.52 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22614. 1760.52 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22615. 1760.52 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22616. 1760.52 s [algebraic-graphs]
  22617. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22618. 1760.52 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22619. 1760.52 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22620. 1760.52 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22621. 1760.52 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22622. 1760.52 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22623. 1760.52 s [algebraic-graphs]
  22624. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  22625. 1760.52 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22626. 1760.52 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22627. 1760.52 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22628. 1760.52 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22629. 1760.52 s [algebraic-graphs]
  22630. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  22631. 1760.52 s [algebraic-graphs] OK: replaceVertex x x == id
  22632. 1760.52 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22633. 1760.52 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22634. 1760.52 s [algebraic-graphs]
  22635. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  22636. 1760.52 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22637. 1760.52 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22638. 1760.52 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22639. 1760.52 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22640. 1760.52 s [algebraic-graphs]
  22641. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  22642. 1760.52 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22643. 1760.52 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22644. 1760.52 s [algebraic-graphs] OK: transpose . transpose == id
  22645. 1760.52 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22646. 1760.52 s [algebraic-graphs]
  22647. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  22648. 1760.52 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22649. 1760.52 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22650. 1760.52 s [algebraic-graphs] OK: gmap id == id
  22651. 1760.52 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22652. 1760.52 s [algebraic-graphs]
  22653. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  22654. 1760.52 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22655. 1760.52 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22656. 1760.52 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22657. 1760.52 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22658. 1760.52 s [algebraic-graphs]
  22659. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  22660. 1760.52 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22661. 1760.52 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22662. 1760.52 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  22663. 1760.52 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  22664. 1760.52 s [algebraic-graphs]
  22665. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  22666. 1760.52 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  22667. 1760.52 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  22668. 1760.52 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22669. 1760.52 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  22670. 1760.52 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22671. 1760.52 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22672. 1760.52 s [algebraic-graphs] OK: closure . closure == closure
  22673. 1760.52 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22674. 1760.52 s [algebraic-graphs]
  22675. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  22676. 1760.52 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  22677. 1760.52 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  22678. 1760.52 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22679. 1760.52 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22680. 1760.52 s [algebraic-graphs]
  22681. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  22682. 1760.52 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22683. 1760.52 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  22684. 1760.52 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22685. 1760.52 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22686. 1760.52 s [algebraic-graphs]
  22687. 1760.52 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  22688. 1760.52 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22689. 1760.52 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  22690. 1760.52 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  22691. 1760.52 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22692. 1760.52 s [algebraic-graphs]
  22693. 1760.52 s [algebraic-graphs] ============ NonEmpty.Graph.============
  22694. 1760.52 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22695. 1760.52 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22696. 1760.52 s [algebraic-graphs]
  22697. 1760.52 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  22698. 1760.52 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22699. 1760.52 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22700. 1760.52 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22701. 1760.52 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22702. 1760.52 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22703. 1760.52 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22704. 1760.52 s [algebraic-graphs] OK: x <= x + y
  22705. 1760.52 s [algebraic-graphs] OK: x + y <= x * y
  22706. 1760.52 s [algebraic-graphs]
  22707. 1760.52 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  22708. 1760.52 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22709. 1760.52 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  22710. 1760.52 s [algebraic-graphs] OK: fmap id == id
  22711. 1760.52 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22712. 1760.52 s [algebraic-graphs]
  22713. 1760.52 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  22714. 1760.52 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  22715. 1761.88 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  22716. 1761.88 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  22717. 1761.88 s [algebraic-graphs] OK: (x >>= vertex) == x
  22718. 1761.88 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  22719. 1761.88 s [algebraic-graphs]
  22720. 1761.88 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  22721. 1761.88 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22722. 1761.88 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  22723. 1761.88 s [algebraic-graphs]
  22724. 1761.88 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  22725. 1761.88 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22726. 1761.88 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22727. 1761.88 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22728. 1761.88 s [algebraic-graphs] OK: size (vertex x) == 1
  22729. 1761.88 s [algebraic-graphs]
  22730. 1761.88 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  22731. 1761.88 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22732. 1761.88 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22733. 1761.88 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22734. 1761.88 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22735. 1761.88 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22736. 1761.88 s [algebraic-graphs]
  22737. 1761.88 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  22738. 1761.88 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22739. 1761.88 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22740. 1761.88 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22741. 1761.88 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22742. 1761.88 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22743. 1761.88 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22744. 1761.88 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22745. 1761.88 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22746. 1761.88 s [algebraic-graphs]
  22747. 1761.88 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  22748. 1761.88 s [algebraic-graphs] OK: overlay1 empty x == x
  22749. 1761.88 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  22750. 1761.88 s [algebraic-graphs]
  22751. 1761.88 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  22752. 1761.88 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22753. 1761.88 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22754. 1761.88 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22755. 1761.88 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22756. 1761.88 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22757. 1761.88 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22758. 1761.89 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22759. 1761.89 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22760. 1761.89 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22761. 1761.89 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22762. 1761.89 s [algebraic-graphs]
  22763. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  22764. 1761.89 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22765. 1761.89 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22766. 1761.89 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22767. 1761.89 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22768. 1761.89 s [algebraic-graphs]
  22769. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  22770. 1761.89 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22771. 1761.89 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22772. 1761.89 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22773. 1761.89 s [algebraic-graphs]
  22774. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  22775. 1761.89 s [algebraic-graphs] OK: overlays1 [x] == x
  22776. 1761.89 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22777. 1761.89 s [algebraic-graphs]
  22778. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  22779. 1761.89 s [algebraic-graphs] OK: connects1 [x] == x
  22780. 1761.89 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22781. 1761.89 s [algebraic-graphs]
  22782. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  22783. 1761.89 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  22784. 1761.89 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  22785. 1761.89 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  22786. 1761.89 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  22787. 1761.89 s [algebraic-graphs]
  22788. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  22789. 1761.89 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22790. 1761.89 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22791. 1761.89 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22792. 1761.89 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22793. 1761.89 s [algebraic-graphs]
  22794. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  22795. 1761.89 s [algebraic-graphs] OK: x === x == True
  22796. 1761.89 s [algebraic-graphs] OK: x + y === x + y == True
  22797. 1761.89 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22798. 1761.89 s [algebraic-graphs] OK: x + y === x * y == False
  22799. 1761.89 s [algebraic-graphs]
  22800. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  22801. 1761.89 s [algebraic-graphs] OK: size (vertex x) == 1
  22802. 1761.89 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22803. 1761.89 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22804. 1761.89 s [algebraic-graphs] OK: size x >= 1
  22805. 1761.89 s [algebraic-graphs] OK: size x >= vertexCount x
  22806. 1761.89 s [algebraic-graphs]
  22807. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  22808. 1761.89 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22809. 1761.89 s [algebraic-graphs]
  22810. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  22811. 1761.89 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22812. 1761.89 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22813. 1761.89 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22814. 1761.89 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22815. 1761.89 s [algebraic-graphs]
  22816. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  22817. 1761.89 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22818. 1761.89 s [algebraic-graphs] OK: vertexCount x >= 1
  22819. 1761.89 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22820. 1761.89 s [algebraic-graphs]
  22821. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  22822. 1761.89 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22823. 1761.89 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22824. 1761.89 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22825. 1761.89 s [algebraic-graphs]
  22826. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  22827. 1761.89 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22828. 1761.89 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22829. 1761.89 s [algebraic-graphs]
  22830. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  22831. 1761.89 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22832. 1761.89 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22833. 1761.89 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22834. 1761.89 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22835. 1761.89 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22836. 1761.89 s [algebraic-graphs]
  22837. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  22838. 1761.89 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22839. 1761.89 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22840. 1761.89 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22841. 1761.89 s [algebraic-graphs]
  22842. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  22843. 1761.89 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22844. 1761.89 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22845. 1761.89 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22846. 1761.89 s [algebraic-graphs]
  22847. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  22848. 1761.89 s [algebraic-graphs] OK: path1 [x] == vertex x
  22849. 1761.89 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22850. 1761.89 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22851. 1761.89 s [algebraic-graphs]
  22852. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  22853. 1761.89 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22854. 1761.89 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22855. 1761.89 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22856. 1761.89 s [algebraic-graphs]
  22857. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  22858. 1761.89 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22859. 1761.89 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22860. 1761.89 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22861. 1761.89 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22862. 1761.89 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22863. 1761.89 s [algebraic-graphs]
  22864. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  22865. 1761.89 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22866. 1761.89 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22867. 1761.89 s [algebraic-graphs]
  22868. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  22869. 1761.89 s [algebraic-graphs] OK: star x [] == vertex x
  22870. 1761.89 s [algebraic-graphs] OK: star x [y] == edge x y
  22871. 1761.89 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22872. 1761.89 s [algebraic-graphs]
  22873. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  22874. 1761.89 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22875. 1761.89 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22876. 1761.89 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22877. 1761.89 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22878. 1761.89 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22879. 1761.89 s [algebraic-graphs]
  22880. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  22881. 1761.89 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22882. 1761.89 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22883. 1761.89 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22884. 1761.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)]
  22885. 1761.89 s [algebraic-graphs]
  22886. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  22887. 1761.89 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  22888. 1761.89 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  22889. 1761.89 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  22890. 1761.89 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22891. 1761.89 s [algebraic-graphs]
  22892. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  22893. 1761.89 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  22894. 1761.89 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  22895. 1761.89 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  22896. 1761.89 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  22897. 1761.89 s [algebraic-graphs]
  22898. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  22899. 1761.89 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22900. 1761.89 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22901. 1761.89 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22902. 1761.89 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22903. 1761.89 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22904. 1761.89 s [algebraic-graphs]
  22905. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  22906. 1761.89 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22907. 1761.89 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22908. 1761.89 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22909. 1761.89 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22910. 1761.89 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22911. 1761.89 s [algebraic-graphs]
  22912. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  22913. 1761.89 s [algebraic-graphs] OK: replaceVertex x x == id
  22914. 1761.89 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22915. 1761.89 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22916. 1761.89 s [algebraic-graphs]
  22917. 1761.89 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  22918. 1761.89 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22919. 1766.38 s [haskell-language-server] Preprocessing library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0...
  22920. 1766.38 s [haskell-language-server] Building library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0...
  22921. 1766.47 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 )
  22922. 1768.03 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 )
  22923. 1768.41 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22924. 1768.41 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22925. 1768.41 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22926. 1768.41 s [algebraic-graphs]
  22927. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  22928. 1768.41 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  22929. 1768.41 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  22930. 1768.41 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22931. 1768.41 s [algebraic-graphs]
  22932. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  22933. 1768.41 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22934. 1768.41 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22935. 1768.41 s [algebraic-graphs] OK: transpose . transpose == id
  22936. 1768.41 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22937. 1768.41 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22938. 1768.41 s [algebraic-graphs]
  22939. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  22940. 1768.41 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22941. 1768.41 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22942. 1768.41 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22943. 1768.41 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22944. 1768.41 s [algebraic-graphs]
  22945. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  22946. 1768.41 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22947. 1768.41 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22948. 1768.41 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  22949. 1768.41 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  22950. 1768.41 s [algebraic-graphs]
  22951. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  22952. 1768.41 s [algebraic-graphs] OK: simplify == id
  22953. 1768.41 s [algebraic-graphs] OK: size (simplify x) <= size x
  22954. 1768.41 s [algebraic-graphs] OK: simplify 1 === 1
  22955. 1768.41 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  22956. 1768.41 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  22957. 1768.41 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  22958. 1768.41 s [algebraic-graphs]
  22959. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  22960. 1768.41 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22961. 1768.41 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22962. 1768.41 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22963. 1768.41 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22964. 1768.41 s [algebraic-graphs]
  22965. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  22966. 1768.41 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22967. 1768.41 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22968. 1768.41 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22969. 1768.41 s [algebraic-graphs]
  22970. 1768.41 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  22971. 1768.41 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  22972. 1768.41 s [algebraic-graphs] OK: box x y ~~ box y x
  22973. 1768.41 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22974. 1768.41 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22975. 1768.41 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22976. 1768.41 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22977. 1768.41 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22978. 1768.41 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22979. 1768.41 s [algebraic-graphs]
  22980. 1768.41 s [algebraic-graphs] ============ Relation ============
  22981. 1768.41 s [algebraic-graphs] OK: Axioms of graphs
  22982. 1768.41 s [algebraic-graphs]
  22983. 1768.41 s [algebraic-graphs] ============ Relation.consistent ============
  22984. 1768.41 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  22985. 1768.41 s [algebraic-graphs]
  22986. 1768.41 s [algebraic-graphs] OK: consistent empty == True
  22987. 1768.41 s [algebraic-graphs] OK: consistent (vertex x) == True
  22988. 1768.41 s [algebraic-graphs] OK: consistent (overlay x y) == True
  22989. 1768.41 s [algebraic-graphs] OK: consistent (connect x y) == True
  22990. 1768.41 s [algebraic-graphs] OK: consistent (edge x y) == True
  22991. 1768.41 s [algebraic-graphs] OK: consistent (edges xs) == True
  22992. 1768.41 s [algebraic-graphs] OK: consistent (stars xs) == True
  22993. 1768.41 s [algebraic-graphs]
  22994. 1768.41 s [algebraic-graphs] ============ Relation.Show ============
  22995. 1768.41 s [algebraic-graphs] OK: show (empty ) == "empty"
  22996. 1768.41 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  22997. 1768.41 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  22998. 1768.41 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  22999. 1768.41 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23000. 1768.41 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23001. 1768.41 s [algebraic-graphs]
  23002. 1768.41 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23003. 1768.41 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23004. 1768.41 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23005. 1768.41 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23006. 1768.41 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23007. 1768.41 s [algebraic-graphs]
  23008. 1768.41 s [algebraic-graphs] ============ Relation.Ord ============
  23009. 1768.41 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23010. 1768.41 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23011. 1768.41 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23012. 1768.41 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23013. 1768.41 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23014. 1768.41 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23015. 1768.41 s [algebraic-graphs] OK: x <= x + y
  23016. 1768.41 s [algebraic-graphs] OK: x + y <= x * y
  23017. 1768.41 s [algebraic-graphs]
  23018. 1768.41 s [algebraic-graphs] ============ Relation.empty ============
  23019. 1768.41 s [algebraic-graphs] OK: isEmpty empty == True
  23020. 1768.42 s [algebraic-graphs] OK: hasVertex x empty == False
  23021. 1768.42 s [algebraic-graphs] OK: vertexCount empty == 0
  23022. 1768.42 s [algebraic-graphs] OK: edgeCount empty == 0
  23023. 1768.42 s [algebraic-graphs]
  23024. 1768.42 s [algebraic-graphs] ============ Relation.vertex ============
  23025. 1768.42 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23026. 1768.42 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23027. 1768.42 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23028. 1768.42 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23029. 1768.42 s [algebraic-graphs]
  23030. 1768.42 s [algebraic-graphs] ============ Relation.edge ============
  23031. 1768.42 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23032. 1768.42 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23033. 1768.42 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23034. 1768.42 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23035. 1768.42 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23036. 1768.42 s [algebraic-graphs]
  23037. 1768.42 s [algebraic-graphs] ============ Relation.overlay ============
  23038. 1768.42 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23039. 1768.42 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23040. 1768.42 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23041. 1768.42 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23042. 1768.42 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23043. 1768.42 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23044. 1768.42 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23045. 1768.42 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23046. 1768.42 s [algebraic-graphs]
  23047. 1768.42 s [algebraic-graphs] ============ Relation.connect ============
  23048. 1768.42 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23049. 1768.42 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23050. 1768.42 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23051. 1768.42 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23052. 1768.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23053. 1768.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23054. 1768.42 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23055. 1768.42 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23056. 1768.42 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23057. 1768.42 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23058. 1768.42 s [algebraic-graphs]
  23059. 1768.42 s [algebraic-graphs] ============ Relation.vertices ============
  23060. 1768.42 s [algebraic-graphs] OK: vertices [] == empty
  23061. 1768.42 s [algebraic-graphs] OK: vertices [x] == vertex x
  23062. 1768.42 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23063. 1768.42 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23064. 1768.42 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23065. 1768.42 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23066. 1768.42 s [algebraic-graphs]
  23067. 1768.42 s [algebraic-graphs] ============ Relation.edges ============
  23068. 1768.42 s [algebraic-graphs] OK: edges [] == empty
  23069. 1768.42 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23070. 1768.42 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23071. 1768.42 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23072. 1768.42 s [algebraic-graphs]
  23073. 1768.42 s [algebraic-graphs] ============ Relation.overlays ============
  23074. 1768.42 s [algebraic-graphs] OK: overlays [] == empty
  23075. 1768.42 s [algebraic-graphs] OK: overlays [x] == x
  23076. 1768.42 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23077. 1768.42 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23078. 1768.42 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23079. 1768.42 s [algebraic-graphs]
  23080. 1768.42 s [algebraic-graphs] ============ Relation.connects ============
  23081. 1768.42 s [algebraic-graphs] OK: connects [] == empty
  23082. 1768.42 s [algebraic-graphs] OK: connects [x] == x
  23083. 1768.42 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23084. 1768.42 s [algebraic-graphs] OK: connects == foldr connect empty
  23085. 1768.42 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23086. 1768.42 s [algebraic-graphs]
  23087. 1768.42 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23088. 1768.42 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23089. 1768.42 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23090. 1768.42 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23091. 1768.42 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23092. 1768.42 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23093. 1768.42 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23094. 1768.42 s [algebraic-graphs]
  23095. 1768.42 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23096. 1768.42 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23097. 1768.42 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23098. 1768.42 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23099. 1768.42 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23100. 1768.42 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23101. 1768.42 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23102. 1768.42 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23103. 1768.42 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23104. 1768.42 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23105. 1768.42 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23106. 1768.42 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23107. 1768.42 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23108. 1768.42 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23109. 1768.42 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23110. 1768.42 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23111. 1768.42 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23112. 1768.42 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23113. 1771.74 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23114. 1771.78 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23115. 1771.78 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23116. 1771.78 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23117. 1771.78 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23118. 1771.78 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23119. 1771.78 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23120. 1771.78 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23121. 1771.78 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23122. 1771.78 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23123. 1771.78 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23124. 1771.78 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23125. 1771.78 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23126. 1771.78 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23127. 1771.78 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23128. 1771.78 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23129. 1771.78 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23130. 1771.78 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23131. 1771.78 s [algebraic-graphs]
  23132. 1771.78 s [algebraic-graphs] ============ Relation.foldg ============
  23133. 1771.78 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23134. 1771.78 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23135. 1771.78 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23136. 1771.78 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23137. 1771.78 s [algebraic-graphs]
  23138. 1771.78 s [algebraic-graphs] ============ Relation.isEmpty ============
  23139. 1771.78 s [algebraic-graphs] OK: isEmpty empty == True
  23140. 1771.78 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23141. 1771.78 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23142. 1771.78 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23143. 1771.78 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23144. 1771.78 s [algebraic-graphs]
  23145. 1771.78 s [algebraic-graphs] ============ Relation.hasVertex ============
  23146. 1771.78 s [algebraic-graphs] OK: hasVertex x empty == False
  23147. 1771.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23148. 1771.78 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23149. 1771.78 s [algebraic-graphs]
  23150. 1771.78 s [algebraic-graphs] ============ Relation.hasEdge ============
  23151. 1771.78 s [algebraic-graphs] OK: hasEdge x y empty == False
  23152. 1771.78 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23153. 1771.78 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23154. 1771.78 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23155. 1771.78 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23156. 1771.78 s [algebraic-graphs]
  23157. 1771.78 s [algebraic-graphs] ============ Relation.vertexCount ============
  23158. 1771.78 s [algebraic-graphs] OK: vertexCount empty == 0
  23159. 1771.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23160. 1771.78 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23161. 1771.78 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23162. 1771.78 s [algebraic-graphs]
  23163. 1771.78 s [algebraic-graphs] ============ Relation.edgeCount ============
  23164. 1771.78 s [algebraic-graphs] OK: edgeCount empty == 0
  23165. 1771.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23166. 1771.78 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23167. 1771.78 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23168. 1771.78 s [algebraic-graphs]
  23169. 1771.78 s [algebraic-graphs] ============ Relation.vertexList ============
  23170. 1771.78 s [algebraic-graphs] OK: vertexList empty == []
  23171. 1771.78 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23172. 1771.78 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23173. 1771.78 s [algebraic-graphs]
  23174. 1771.78 s [algebraic-graphs] ============ Relation.vertexSet ============
  23175. 1771.78 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23176. 1771.78 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23177. 1771.78 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23178. 1771.78 s [algebraic-graphs]
  23179. 1771.78 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23180. 1771.78 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23181. 1771.78 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23182. 1771.78 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23183. 1771.78 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23184. 1771.78 s [algebraic-graphs]
  23185. 1771.78 s [algebraic-graphs] ============ Relation.edgeList ============
  23186. 1771.78 s [algebraic-graphs] OK: edgeList empty == []
  23187. 1771.78 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23188. 1771.78 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23189. 1771.78 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23190. 1771.78 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23191. 1771.78 s [algebraic-graphs]
  23192. 1771.78 s [algebraic-graphs] ============ Relation.edgeSet ============
  23193. 1771.79 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23194. 1771.79 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23195. 1771.79 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23196. 1771.79 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23197. 1771.79 s [algebraic-graphs]
  23198. 1771.79 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23199. 1771.79 s [algebraic-graphs] OK: adjacencyList empty == []
  23200. 1771.79 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23201. 1771.79 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23202. 1771.79 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23203. 1771.79 s [algebraic-graphs]
  23204. 1771.79 s [algebraic-graphs] ============ Relation.preSet ============
  23205. 1771.79 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23206. 1771.79 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23207. 1771.79 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23208. 1771.79 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23209. 1771.79 s [algebraic-graphs]
  23210. 1771.79 s [algebraic-graphs] ============ Relation.preIntSet ============
  23211. 1771.79 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23212. 1771.79 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23213. 1771.79 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23214. 1771.79 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23215. 1771.79 s [algebraic-graphs]
  23216. 1771.79 s [algebraic-graphs] ============ Relation.postSet ============
  23217. 1771.79 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23218. 1771.79 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23219. 1771.79 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23220. 1771.79 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23221. 1771.79 s [algebraic-graphs]
  23222. 1771.79 s [algebraic-graphs] ============ Relation.postIntSet ============
  23223. 1771.79 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23224. 1771.79 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23225. 1771.79 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23226. 1771.79 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23227. 1771.79 s [algebraic-graphs]
  23228. 1771.79 s [algebraic-graphs] ============ Relation.path ============
  23229. 1771.79 s [algebraic-graphs] OK: path [] == empty
  23230. 1771.79 s [algebraic-graphs] OK: path [x] == vertex x
  23231. 1771.79 s [algebraic-graphs] OK: path [x,y] == edge x y
  23232. 1771.79 s [algebraic-graphs]
  23233. 1771.79 s [algebraic-graphs] ============ Relation.circuit ============
  23234. 1771.79 s [algebraic-graphs] OK: circuit [] == empty
  23235. 1771.79 s [algebraic-graphs] OK: circuit [x] == edge x x
  23236. 1771.79 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23237. 1771.79 s [algebraic-graphs]
  23238. 1771.79 s [algebraic-graphs] ============ Relation.clique ============
  23239. 1771.79 s [algebraic-graphs] OK: clique [] == empty
  23240. 1771.79 s [algebraic-graphs] OK: clique [x] == vertex x
  23241. 1771.79 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23242. 1771.79 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23243. 1771.79 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23244. 1771.79 s [algebraic-graphs]
  23245. 1771.79 s [algebraic-graphs] ============ Relation.biclique ============
  23246. 1771.79 s [algebraic-graphs] OK: biclique [] [] == empty
  23247. 1771.79 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23248. 1771.79 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23249. 1771.79 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23250. 1771.79 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23251. 1771.79 s [algebraic-graphs]
  23252. 1771.79 s [algebraic-graphs] ============ Relation.star ============
  23253. 1771.79 s [algebraic-graphs] OK: star x [] == vertex x
  23254. 1771.79 s [algebraic-graphs] OK: star x [y] == edge x y
  23255. 1771.79 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23256. 1771.79 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23257. 1771.79 s [algebraic-graphs]
  23258. 1771.79 s [algebraic-graphs] ============ Relation.stars ============
  23259. 1771.79 s [algebraic-graphs] OK: stars [] == empty
  23260. 1771.79 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23261. 1771.79 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23262. 1771.79 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23263. 1771.79 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23264. 1771.79 s [algebraic-graphs] OK: stars . adjacencyList == id
  23265. 1771.79 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23266. 1771.79 s [algebraic-graphs]
  23267. 1771.79 s [algebraic-graphs] ============ Relation.tree ============
  23268. 1771.79 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23269. 1771.79 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23270. 1771.79 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23271. 1771.79 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23272. 1771.79 s [algebraic-graphs]
  23273. 1771.79 s [algebraic-graphs] ============ Relation.forest ============
  23274. 1771.79 s [algebraic-graphs] OK: forest [] == empty
  23275. 1771.79 s [algebraic-graphs] OK: forest [x] == tree x
  23276. 1771.79 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23277. 1771.79 s [algebraic-graphs] OK: forest == overlays . map tree
  23278. 1771.79 s [algebraic-graphs]
  23279. 1771.79 s [algebraic-graphs] ============ Relation.removeVertex ============
  23280. 1771.79 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23281. 1771.79 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23282. 1771.79 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23283. 1771.79 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23284. 1771.79 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23285. 1771.79 s [algebraic-graphs]
  23286. 1771.79 s [algebraic-graphs] ============ Relation.removeEdge ============
  23287. 1771.79 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23288. 1771.79 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23289. 1771.79 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23290. 1771.79 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23291. 1771.79 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23292. 1771.79 s [algebraic-graphs]
  23293. 1771.79 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23294. 1771.79 s [algebraic-graphs] OK: replaceVertex x x == id
  23295. 1771.79 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23296. 1771.79 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23297. 1771.79 s [algebraic-graphs]
  23298. 1771.79 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23299. 1771.79 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23300. 1775.45 s [haskell-language-server] Preprocessing library 'hls-rename-plugin' for haskell-language-server-2.12.0.0...
  23301. 1775.45 s [haskell-language-server] Building library 'hls-rename-plugin' for haskell-language-server-2.12.0.0...
  23302. 1775.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.o, dist/build/hls-rename-plugin/Ide/Plugin/Rename.dyn_o )
  23303. 1778.99 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 )
  23304. 1789.02 s [haskell-language-server] Preprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0...
  23305. 1789.02 s [haskell-language-server] Building library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0...
  23306. 1789.16 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 )
  23307. 1790.65 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 )
  23308. 1791.16 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 )
  23309. 1792.91 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 )
  23310. 1794.48 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 )
  23311. 1795.11 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23312. 1795.11 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23313. 1795.11 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23314. 1795.11 s [algebraic-graphs]
  23315. 1795.11 s [algebraic-graphs] ============ Relation.transpose ============
  23316. 1795.11 s [algebraic-graphs] OK: transpose empty == empty
  23317. 1795.11 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23318. 1795.11 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23319. 1795.11 s [algebraic-graphs] OK: transpose . transpose == id
  23320. 1795.11 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23321. 1795.11 s [algebraic-graphs]
  23322. 1795.11 s [algebraic-graphs] ============ Relation.gmap ============
  23323. 1795.11 s [algebraic-graphs] OK: gmap f empty == empty
  23324. 1795.11 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23325. 1795.11 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23326. 1795.11 s [algebraic-graphs] OK: gmap id == id
  23327. 1795.11 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23328. 1795.11 s [algebraic-graphs]
  23329. 1795.11 s [algebraic-graphs] ============ Relation.induce ============
  23330. 1795.11 s [algebraic-graphs] OK: induce (const True ) x == x
  23331. 1795.11 s [algebraic-graphs] OK: induce (const False) x == empty
  23332. 1795.11 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23333. 1795.11 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23334. 1795.11 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23335. 1795.11 s [algebraic-graphs]
  23336. 1795.11 s [algebraic-graphs] ============ Relation.compose ============
  23337. 1795.11 s [algebraic-graphs] OK: compose empty x == empty
  23338. 1795.11 s [algebraic-graphs] OK: compose x empty == empty
  23339. 1795.11 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23340. 1795.11 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23341. 1795.11 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23342. 1795.11 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23343. 1795.11 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23344. 1795.11 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23345. 1795.11 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23346. 1795.11 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23347. 1795.11 s [algebraic-graphs]
  23348. 1795.11 s [algebraic-graphs] ============ Relation.closure ============
  23349. 1795.11 s [algebraic-graphs] OK: closure empty == empty
  23350. 1795.11 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23351. 1795.11 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23352. 1795.11 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23353. 1795.11 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23354. 1795.11 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23355. 1795.11 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23356. 1795.11 s [algebraic-graphs] OK: closure . closure == closure
  23357. 1795.11 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23358. 1795.11 s [algebraic-graphs]
  23359. 1795.11 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23360. 1795.11 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23361. 1795.11 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23362. 1795.11 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23363. 1795.11 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23364. 1795.11 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23365. 1795.11 s [algebraic-graphs]
  23366. 1795.11 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23367. 1795.11 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23368. 1795.11 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23369. 1795.11 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23370. 1795.11 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23371. 1795.11 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23372. 1795.11 s [algebraic-graphs]
  23373. 1795.11 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23374. 1795.11 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23375. 1795.11 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23376. 1795.11 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23377. 1795.11 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23378. 1795.11 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23379. 1795.11 s [algebraic-graphs]
  23380. 1795.11 s [algebraic-graphs] ============ Relation.induceJust ============
  23381. 1795.11 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23382. 1795.11 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23383. 1795.11 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23384. 1795.11 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23385. 1795.11 s [algebraic-graphs]
  23386. 1795.11 s [algebraic-graphs] ============ ReflexiveRelation ============
  23387. 1795.11 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23388. 1795.11 s [algebraic-graphs]
  23389. 1795.11 s [algebraic-graphs] ============ TransitiveRelation ============
  23390. 1795.11 s [algebraic-graphs] OK: Axioms of transitive graphs
  23391. 1795.11 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23392. 1795.11 s [algebraic-graphs]
  23393. 1795.11 s [algebraic-graphs] ============ PreorderRelation ============
  23394. 1795.11 s [algebraic-graphs] OK: Axioms of preorder graphs
  23395. 1795.11 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23396. 1795.11 s [algebraic-graphs]
  23397. 1795.11 s [algebraic-graphs] ============ Symmetric.Relation ============
  23398. 1795.11 s [algebraic-graphs] OK: Axioms of undirected graphs
  23399. 1795.11 s [algebraic-graphs]
  23400. 1795.11 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23401. 1795.11 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23402. 1795.11 s [algebraic-graphs]
  23403. 1795.11 s [algebraic-graphs] OK: consistent empty == True
  23404. 1795.11 s [algebraic-graphs] OK: consistent (vertex x) == True
  23405. 1795.11 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23406. 1795.11 s [algebraic-graphs] OK: consistent (connect x y) == True
  23407. 1795.11 s [algebraic-graphs] OK: consistent (edge x y) == True
  23408. 1795.11 s [algebraic-graphs] OK: consistent (edges xs) == True
  23409. 1795.11 s [algebraic-graphs] OK: consistent (stars xs) == True
  23410. 1795.11 s [algebraic-graphs]
  23411. 1795.11 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23412. 1795.11 s [algebraic-graphs] OK: show (empty ) == "empty"
  23413. 1795.11 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23414. 1795.11 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23415. 1795.11 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23416. 1795.11 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23417. 1795.12 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23418. 1795.12 s [algebraic-graphs]
  23419. 1795.12 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23420. 1795.12 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23421. 1795.12 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23422. 1795.12 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23423. 1795.12 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23424. 1795.12 s [algebraic-graphs]
  23425. 1795.12 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23426. 1795.12 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23427. 1795.12 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23428. 1795.12 s [algebraic-graphs]
  23429. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23430. 1795.12 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23431. 1795.12 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23432. 1795.12 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23433. 1795.12 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23434. 1795.12 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23435. 1795.12 s [algebraic-graphs]
  23436. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23437. 1795.12 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23438. 1795.12 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23439. 1795.12 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23440. 1795.12 s [algebraic-graphs]
  23441. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23442. 1795.12 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23443. 1795.12 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23444. 1795.12 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23445. 1795.12 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23446. 1795.12 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23447. 1795.12 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23448. 1795.12 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23449. 1795.12 s [algebraic-graphs] OK: x <= x + y
  23450. 1795.12 s [algebraic-graphs] OK: x + y <= x * y
  23451. 1795.12 s [algebraic-graphs]
  23452. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23453. 1795.12 s [algebraic-graphs] OK: isEmpty empty == True
  23454. 1795.12 s [algebraic-graphs] OK: hasVertex x empty == False
  23455. 1795.12 s [algebraic-graphs] OK: vertexCount empty == 0
  23456. 1795.12 s [algebraic-graphs] OK: edgeCount empty == 0
  23457. 1795.12 s [algebraic-graphs]
  23458. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23459. 1795.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23460. 1795.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23461. 1795.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23462. 1795.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23463. 1795.12 s [algebraic-graphs]
  23464. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23465. 1795.12 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23466. 1795.12 s [algebraic-graphs] OK: edge x y == edge y x
  23467. 1795.12 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23468. 1795.12 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23469. 1795.12 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23470. 1795.12 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23471. 1795.12 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23472. 1795.12 s [algebraic-graphs]
  23473. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23474. 1795.12 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23475. 1795.12 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23476. 1795.12 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23477. 1795.12 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23478. 1795.12 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23479. 1795.12 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23480. 1795.12 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23481. 1795.12 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23482. 1795.12 s [algebraic-graphs]
  23483. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23484. 1795.12 s [algebraic-graphs] OK: connect x y == connect y x
  23485. 1795.12 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23486. 1795.12 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23487. 1795.12 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23488. 1795.12 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23489. 1795.12 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23490. 1795.12 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23491. 1795.12 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23492. 1795.12 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23493. 1795.12 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23494. 1795.12 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23495. 1795.12 s [algebraic-graphs]
  23496. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23497. 1795.12 s [algebraic-graphs] OK: vertices [] == empty
  23498. 1795.12 s [algebraic-graphs] OK: vertices [x] == vertex x
  23499. 1795.12 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23500. 1795.12 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23501. 1795.12 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23502. 1795.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23503. 1795.12 s [algebraic-graphs]
  23504. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23505. 1795.12 s [algebraic-graphs] OK: edges [] == empty
  23506. 1795.12 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23507. 1795.12 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23508. 1795.12 s [algebraic-graphs]
  23509. 1795.12 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23510. 1795.12 s [algebraic-graphs] OK: overlays [] == empty
  23511. 1795.18 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 )
  23512. 1801.89 s [haskell-language-server] Preprocessing library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0...
  23513. 1801.89 s [haskell-language-server] Building library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0...
  23514. 1802.00 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 )
  23515. 1803.63 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 )
  23516. 1807.71 s [algebraic-graphs] OK: overlays [x] == x
  23517. 1807.71 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23518. 1807.71 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23519. 1807.73 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23520. 1807.73 s [algebraic-graphs]
  23521. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23522. 1807.73 s [algebraic-graphs] OK: connects [] == empty
  23523. 1807.73 s [algebraic-graphs] OK: connects [x] == x
  23524. 1807.73 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23525. 1807.73 s [algebraic-graphs] OK: connects == foldr connect empty
  23526. 1807.73 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23527. 1807.73 s [algebraic-graphs] OK: connects == connects . reverse
  23528. 1807.73 s [algebraic-graphs]
  23529. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23530. 1807.73 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23531. 1807.73 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23532. 1807.73 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23533. 1807.73 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23534. 1807.73 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23535. 1807.73 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23536. 1807.73 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23537. 1807.73 s [algebraic-graphs]
  23538. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23539. 1807.73 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23540. 1807.73 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23541. 1807.73 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23542. 1807.73 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23543. 1807.73 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23544. 1807.73 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23545. 1807.73 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23546. 1807.73 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23547. 1807.73 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23548. 1807.73 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23549. 1807.73 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23550. 1807.73 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23551. 1807.73 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23552. 1807.73 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23553. 1807.73 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23554. 1807.73 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23555. 1807.73 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23556. 1807.73 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23557. 1807.73 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23558. 1807.73 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23559. 1807.73 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23560. 1807.73 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23561. 1807.73 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23562. 1807.73 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23563. 1807.73 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23564. 1807.73 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23565. 1807.73 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23566. 1807.73 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23567. 1807.73 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23568. 1807.73 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23569. 1807.73 s [algebraic-graphs]
  23570. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23571. 1807.73 s [algebraic-graphs] OK: isEmpty empty == True
  23572. 1807.73 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23573. 1807.73 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23574. 1807.73 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23575. 1807.73 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23576. 1807.73 s [algebraic-graphs]
  23577. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23578. 1807.73 s [algebraic-graphs] OK: hasVertex x empty == False
  23579. 1807.73 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23580. 1807.73 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23581. 1807.73 s [algebraic-graphs]
  23582. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23583. 1807.73 s [algebraic-graphs] OK: hasEdge x y empty == False
  23584. 1807.73 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23585. 1807.73 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23586. 1807.73 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23587. 1807.73 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23588. 1807.73 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23589. 1807.73 s [algebraic-graphs]
  23590. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23591. 1807.73 s [algebraic-graphs] OK: vertexCount empty == 0
  23592. 1807.73 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23593. 1807.73 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23594. 1807.73 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23595. 1807.73 s [algebraic-graphs]
  23596. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23597. 1807.73 s [algebraic-graphs] OK: edgeCount empty == 0
  23598. 1807.73 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23599. 1807.73 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23600. 1807.73 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23601. 1807.73 s [algebraic-graphs]
  23602. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23603. 1807.73 s [algebraic-graphs] OK: vertexList empty == []
  23604. 1807.73 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23605. 1807.73 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23606. 1807.73 s [algebraic-graphs]
  23607. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23608. 1807.73 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23609. 1807.73 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23610. 1807.73 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23611. 1807.73 s [algebraic-graphs]
  23612. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23613. 1807.73 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23614. 1807.73 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23615. 1807.73 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23616. 1807.73 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23617. 1807.73 s [algebraic-graphs]
  23618. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23619. 1807.73 s [algebraic-graphs] OK: edgeList empty == []
  23620. 1807.73 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23621. 1807.73 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23622. 1807.73 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23623. 1807.73 s [algebraic-graphs]
  23624. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23625. 1807.73 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23626. 1807.73 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23627. 1807.73 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23628. 1807.73 s [algebraic-graphs]
  23629. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23630. 1807.73 s [algebraic-graphs] OK: adjacencyList empty == []
  23631. 1807.73 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23632. 1807.73 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23633. 1807.73 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23634. 1807.73 s [algebraic-graphs]
  23635. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23636. 1807.73 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23637. 1807.73 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23638. 1807.73 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23639. 1807.73 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23640. 1807.73 s [algebraic-graphs]
  23641. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23642. 1807.73 s [algebraic-graphs] OK: path [] == empty
  23643. 1807.73 s [algebraic-graphs] OK: path [x] == vertex x
  23644. 1807.73 s [algebraic-graphs] OK: path [x,y] == edge x y
  23645. 1807.73 s [algebraic-graphs] OK: path == path . reverse
  23646. 1807.73 s [algebraic-graphs]
  23647. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  23648. 1807.73 s [algebraic-graphs] OK: circuit [] == empty
  23649. 1807.73 s [algebraic-graphs] OK: circuit [x] == edge x x
  23650. 1807.73 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23651. 1807.73 s [algebraic-graphs] OK: circuit == circuit . reverse
  23652. 1807.73 s [algebraic-graphs]
  23653. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  23654. 1807.73 s [algebraic-graphs] OK: clique [] == empty
  23655. 1807.73 s [algebraic-graphs] OK: clique [x] == vertex x
  23656. 1807.73 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23657. 1807.73 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23658. 1807.73 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23659. 1807.73 s [algebraic-graphs] OK: clique == clique . reverse
  23660. 1807.73 s [algebraic-graphs]
  23661. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  23662. 1807.73 s [algebraic-graphs] OK: biclique [] [] == empty
  23663. 1807.73 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23664. 1807.73 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23665. 1807.73 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23666. 1807.73 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23667. 1807.73 s [algebraic-graphs]
  23668. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  23669. 1807.73 s [algebraic-graphs] OK: star x [] == vertex x
  23670. 1807.73 s [algebraic-graphs] OK: star x [y] == edge x y
  23671. 1807.73 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23672. 1807.73 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23673. 1807.73 s [algebraic-graphs]
  23674. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  23675. 1807.73 s [algebraic-graphs] OK: stars [] == empty
  23676. 1807.73 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23677. 1807.73 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23678. 1807.73 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23679. 1807.73 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23680. 1807.73 s [algebraic-graphs] OK: stars . adjacencyList == id
  23681. 1807.73 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23682. 1807.73 s [algebraic-graphs]
  23683. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  23684. 1807.73 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23685. 1807.73 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23686. 1807.73 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23687. 1807.73 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23688. 1807.73 s [algebraic-graphs]
  23689. 1807.73 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  23690. 1807.73 s [algebraic-graphs] OK: forest [] == empty
  23691. 1810.18 s [haskell-language-server] Preprocessing library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0...
  23692. 1810.18 s [haskell-language-server] Building library 'hls-fourmolu-plugin' for haskell-language-server-2.12.0.0...
  23693. 1810.28 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 )
  23694. 1813.57 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 )
  23695. 1814.64 s [algebraic-graphs] OK: forest [x] == tree x
  23696. 1814.64 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23697. 1814.64 s [algebraic-graphs] OK: forest == overlays . map tree
  23698. 1814.64 s [algebraic-graphs]
  23699. 1814.64 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  23700. 1814.64 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23701. 1814.64 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23702. 1814.64 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23703. 1814.64 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23704. 1814.64 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23705. 1814.64 s [algebraic-graphs]
  23706. 1814.64 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  23707. 1814.64 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23708. 1814.64 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23709. 1814.64 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23710. 1814.64 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23711. 1814.64 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23712. 1814.64 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23713. 1814.64 s [algebraic-graphs]
  23714. 1814.64 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  23715. 1814.64 s [algebraic-graphs] OK: replaceVertex x x == id
  23716. 1814.64 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23717. 1814.64 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23718. 1814.64 s [algebraic-graphs]
  23719. 1814.64 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  23720. 1814.64 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23721. 1814.64 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23722. 1814.64 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23723. 1814.64 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23724. 1814.64 s [algebraic-graphs]
  23725. 1814.64 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  23726. 1814.64 s [algebraic-graphs] OK: gmap f empty == empty
  23727. 1814.64 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23728. 1814.64 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23729. 1814.64 s [algebraic-graphs] OK: gmap id == id
  23730. 1814.64 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23731. 1814.64 s [algebraic-graphs]
  23732. 1814.64 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  23733. 1814.64 s [algebraic-graphs] OK: induce (const True ) x == x
  23734. 1814.64 s [algebraic-graphs] OK: induce (const False) x == empty
  23735. 1814.64 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23736. 1814.64 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23737. 1814.64 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23738. 1814.64 s [algebraic-graphs]
  23739. 1814.64 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  23740. 1814.64 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23741. 1814.64 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23742. 1814.64 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23743. 1814.64 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23744. 1814.64 s [algebraic-graphs]
  23745. 1814.64 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  23746. 1814.64 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  23747. 1814.64 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  23748. 1814.64 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  23749. 1814.64 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  23750. 1814.64 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  23751. 1814.64 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  23752. 1814.64 s [algebraic-graphs]
  23753. 1814.64 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  23754. 1814.64 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  23755. 1814.64 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  23756. 1814.64 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  23757. 1814.64 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  23758. 1814.64 s [algebraic-graphs]
  23759. 1814.64 s [algebraic-graphs] ============ Typed ============
  23760. 1814.64 s [algebraic-graphs]
  23761. 1814.64 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  23762. 1814.64 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23763. 1814.64 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23764. 1814.64 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  23765. 1814.64 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23766. 1814.64 s [algebraic-graphs]
  23767. 1814.64 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  23768. 1814.64 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23769. 1814.64 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23770. 1814.64 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  23771. 1814.64 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23772. 1814.64 s [algebraic-graphs]
  23773. 1814.64 s [algebraic-graphs] ============ Typed.dfsForest ============
  23774. 1814.64 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  23775. 1814.64 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  23776. 1814.64 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  23777. 1814.64 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  23778. 1814.64 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  23779. 1814.64 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  23780. 1814.64 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  23781. 1814.64 s [algebraic-graphs]
  23782. 1814.64 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  23783. 1814.64 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  23784. 1814.64 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  23785. 1814.64 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  23786. 1814.64 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  23787. 1814.64 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  23788. 1814.64 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  23789. 1814.64 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  23790. 1814.64 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  23791. 1814.64 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  23792. 1814.64 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  23793. 1814.64 s [algebraic-graphs]
  23794. 1814.64 s [algebraic-graphs] ============ Typed.dfs ============
  23795. 1814.64 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  23796. 1814.64 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  23797. 1814.64 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  23798. 1814.64 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  23799. 1814.64 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  23800. 1814.64 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  23801. 1814.65 s [algebraic-graphs] OK: dfs % x $ [] == []
  23802. 1814.65 s [algebraic-graphs]
  23803. 1814.65 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  23804. 1814.65 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  23805. 1814.65 s [algebraic-graphs]
  23806. 1814.65 s [algebraic-graphs] ============ Typed.topSort ============
  23807. 1814.65 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  23808. 1814.65 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  23809. 1814.65 s [algebraic-graphs]
  23810. 1814.65 s [algebraic-graphs] ============ Graph.Undirected ============
  23811. 1814.65 s [algebraic-graphs] OK: Axioms of undirected graphs
  23812. 1814.65 s [algebraic-graphs]
  23813. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  23814. 1814.65 s [algebraic-graphs] OK: show (empty ) == "empty"
  23815. 1814.65 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23816. 1814.65 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23817. 1814.65 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23818. 1814.65 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23819. 1814.65 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23820. 1814.65 s [algebraic-graphs]
  23821. 1814.65 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23822. 1814.65 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23823. 1814.65 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23824. 1814.65 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23825. 1814.65 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23826. 1814.65 s [algebraic-graphs]
  23827. 1814.65 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23828. 1814.65 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23829. 1814.65 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23830. 1814.65 s [algebraic-graphs]
  23831. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  23832. 1814.65 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  23833. 1814.65 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23834. 1814.65 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  23835. 1814.65 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  23836. 1814.65 s [algebraic-graphs]
  23837. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  23838. 1814.65 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  23839. 1814.65 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23840. 1814.65 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  23841. 1814.65 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  23842. 1814.65 s [algebraic-graphs]
  23843. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  23844. 1814.65 s [algebraic-graphs] OK: complement empty == empty
  23845. 1814.65 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  23846. 1814.65 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  23847. 1814.65 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  23848. 1814.65 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  23849. 1814.65 s [algebraic-graphs] OK: complement . complement == id
  23850. 1814.65 s [algebraic-graphs]
  23851. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  23852. 1814.65 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23853. 1814.65 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23854. 1814.65 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23855. 1814.65 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23856. 1814.65 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23857. 1814.65 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23858. 1814.65 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23859. 1814.65 s [algebraic-graphs] OK: x <= x + y
  23860. 1814.65 s [algebraic-graphs] OK: x + y <= x * y
  23861. 1814.65 s [algebraic-graphs]
  23862. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  23863. 1814.65 s [algebraic-graphs] OK: isEmpty empty == True
  23864. 1814.65 s [algebraic-graphs] OK: hasVertex x empty == False
  23865. 1814.65 s [algebraic-graphs] OK: vertexCount empty == 0
  23866. 1814.65 s [algebraic-graphs] OK: edgeCount empty == 0
  23867. 1814.65 s [algebraic-graphs]
  23868. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  23869. 1814.65 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23870. 1814.65 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23871. 1814.65 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23872. 1814.65 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23873. 1814.65 s [algebraic-graphs]
  23874. 1814.65 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  23875. 1814.65 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23876. 1814.65 s [algebraic-graphs] OK: edge x y == edge y x
  23877. 1822.88 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0...
  23878. 1822.88 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0...
  23879. 1822.98 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23880. 1822.99 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23881. 1822.99 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23882. 1822.99 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23883. 1822.99 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23884. 1822.99 s [algebraic-graphs]
  23885. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  23886. 1822.99 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23887. 1822.99 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23888. 1822.99 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23889. 1822.99 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23890. 1822.99 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23891. 1822.99 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23892. 1822.99 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23893. 1822.99 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23894. 1822.99 s [algebraic-graphs]
  23895. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  23896. 1822.99 s [algebraic-graphs] OK: connect x y == connect y x
  23897. 1822.99 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23898. 1822.99 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23899. 1822.99 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23900. 1822.99 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23901. 1822.99 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23902. 1822.99 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23903. 1822.99 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23904. 1822.99 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23905. 1822.99 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23906. 1822.99 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23907. 1822.99 s [algebraic-graphs]
  23908. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  23909. 1822.99 s [algebraic-graphs] OK: vertices [] == empty
  23910. 1822.99 s [algebraic-graphs] OK: vertices [x] == vertex x
  23911. 1822.99 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23912. 1822.99 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23913. 1822.99 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23914. 1822.99 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23915. 1822.99 s [algebraic-graphs]
  23916. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  23917. 1822.99 s [algebraic-graphs] OK: edges [] == empty
  23918. 1822.99 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23919. 1822.99 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23920. 1822.99 s [algebraic-graphs]
  23921. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  23922. 1822.99 s [algebraic-graphs] OK: overlays [] == empty
  23923. 1822.99 s [algebraic-graphs] OK: overlays [x] == x
  23924. 1822.99 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23925. 1822.99 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23926. 1822.99 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23927. 1822.99 s [algebraic-graphs]
  23928. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  23929. 1822.99 s [algebraic-graphs] OK: connects [] == empty
  23930. 1822.99 s [algebraic-graphs] OK: connects [x] == x
  23931. 1822.99 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23932. 1822.99 s [algebraic-graphs] OK: connects == foldr connect empty
  23933. 1822.99 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23934. 1822.99 s [algebraic-graphs] OK: connects == connects . reverse
  23935. 1822.99 s [algebraic-graphs]
  23936. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  23937. 1822.99 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23938. 1822.99 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23939. 1822.99 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23940. 1822.99 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23941. 1822.99 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23942. 1822.99 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23943. 1822.99 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23944. 1822.99 s [algebraic-graphs]
  23945. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.path ============
  23946. 1822.99 s [algebraic-graphs] OK: path [] == empty
  23947. 1822.99 s [algebraic-graphs] OK: path [x] == vertex x
  23948. 1822.99 s [algebraic-graphs] OK: path [x,y] == edge x y
  23949. 1822.99 s [algebraic-graphs] OK: path == path . reverse
  23950. 1822.99 s [algebraic-graphs]
  23951. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  23952. 1822.99 s [algebraic-graphs] OK: circuit [] == empty
  23953. 1822.99 s [algebraic-graphs] OK: circuit [x] == edge x x
  23954. 1822.99 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23955. 1822.99 s [algebraic-graphs] OK: circuit == circuit . reverse
  23956. 1822.99 s [algebraic-graphs]
  23957. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  23958. 1822.99 s [algebraic-graphs] OK: clique [] == empty
  23959. 1822.99 s [algebraic-graphs] OK: clique [x] == vertex x
  23960. 1822.99 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23961. 1822.99 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23962. 1822.99 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23963. 1822.99 s [algebraic-graphs] OK: clique == clique . reverse
  23964. 1822.99 s [algebraic-graphs]
  23965. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  23966. 1822.99 s [algebraic-graphs] OK: biclique [] [] == empty
  23967. 1822.99 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23968. 1822.99 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23969. 1822.99 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23970. 1822.99 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23971. 1822.99 s [algebraic-graphs]
  23972. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.star ============
  23973. 1822.99 s [algebraic-graphs] OK: star x [] == vertex x
  23974. 1822.99 s [algebraic-graphs] OK: star x [y] == edge x y
  23975. 1822.99 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23976. 1822.99 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23977. 1822.99 s [algebraic-graphs]
  23978. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  23979. 1822.99 s [algebraic-graphs] OK: stars [] == empty
  23980. 1822.99 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23981. 1822.99 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23982. 1822.99 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23983. 1822.99 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23984. 1822.99 s [algebraic-graphs] OK: stars . adjacencyList == id
  23985. 1822.99 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23986. 1822.99 s [algebraic-graphs]
  23987. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  23988. 1822.99 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23989. 1822.99 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23990. 1822.99 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23991. 1822.99 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23992. 1822.99 s [algebraic-graphs]
  23993. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  23994. 1822.99 s [algebraic-graphs] OK: forest [] == empty
  23995. 1822.99 s [algebraic-graphs] OK: forest [x] == tree x
  23996. 1822.99 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23997. 1822.99 s [algebraic-graphs] OK: forest == overlays . map tree
  23998. 1822.99 s [algebraic-graphs]
  23999. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24000. 1822.99 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24001. 1822.99 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24002. 1822.99 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24003. 1822.99 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24004. 1822.99 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24005. 1822.99 s [algebraic-graphs]
  24006. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24007. 1822.99 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24008. 1822.99 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24009. 1822.99 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24010. 1822.99 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24011. 1822.99 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24012. 1822.99 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24013. 1822.99 s [algebraic-graphs]
  24014. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24015. 1822.99 s [algebraic-graphs] OK: replaceVertex x x == id
  24016. 1822.99 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24017. 1822.99 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24018. 1822.99 s [algebraic-graphs]
  24019. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24020. 1822.99 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24021. 1822.99 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24022. 1822.99 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24023. 1822.99 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24024. 1822.99 s [algebraic-graphs]
  24025. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24026. 1822.99 s [algebraic-graphs] OK: gmap f empty == empty
  24027. 1822.99 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24028. 1822.99 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24029. 1822.99 s [algebraic-graphs] OK: gmap id == id
  24030. 1822.99 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24031. 1822.99 s [algebraic-graphs]
  24032. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24033. 1822.99 s [algebraic-graphs] OK: induce (const True ) x == x
  24034. 1822.99 s [algebraic-graphs] OK: induce (const False) x == empty
  24035. 1822.99 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24036. 1822.99 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24037. 1822.99 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24038. 1822.99 s [algebraic-graphs]
  24039. 1822.99 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24040. 1822.99 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24041. 1822.99 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24042. 1822.99 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24043. 1822.99 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24044. 1822.99 s [algebraic-graphs] Test suite main: PASS
  24045. 1822.99 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24046. 1822.99 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24047. 1823.00 s [algebraic-graphs] checkPhase completed in 2 minutes 5 seconds
  24048. 1823.00 s [algebraic-graphs] Phase: haddockPhase
  24049. 1823.10 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24050. 1823.10 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24051. 1823.10 s [haskell-language-server] but were not needed for compilation:
  24052. 1823.10 s [haskell-language-server] - ghc-9.12.2 (exposed by flag -package-id ghc-9.12.2-82d3)
  24053. 1823.10 s [haskell-language-server]
  24054. 1823.11 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  24055. 1823.55 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  24056. 1823.55 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  24057. 1823.72 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24058. 1824.00 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [HIE file is missing]
  24059. 1824.09 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [HIE file is missing]
  24060. 1824.16 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [HIE file is missing]
  24061. 1824.26 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [HIE file is missing]
  24062. 1824.37 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 )
  24063. 1824.37 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 )
  24064. 1824.46 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [HIE file is missing]
  24065. 1824.49 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24066. 1824.59 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  24067. 1824.75 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [HIE file is missing]
  24068. 1824.89 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24069. 1824.99 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  24070. 1825.07 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  24071. 1825.07 s [algebraic-graphs] In the use of ‘head’
  24072. 1825.07 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24073. 1825.08 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24074. 1825.08 s [algebraic-graphs] |
  24075. 1825.08 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  24076. 1825.08 s [algebraic-graphs] | ^^^^
  24077. 1825.08 s [algebraic-graphs]
  24078. 1825.08 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  24079. 1825.08 s [algebraic-graphs] In the use of ‘tail’
  24080. 1825.08 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24081. 1825.08 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24082. 1825.08 s [algebraic-graphs] |
  24083. 1825.08 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  24084. 1825.08 s [algebraic-graphs] | ^^^^
  24085. 1825.08 s [algebraic-graphs]
  24086. 1825.08 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  24087. 1825.08 s [algebraic-graphs] In the use of ‘head’
  24088. 1825.08 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24089. 1825.08 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24090. 1825.08 s [algebraic-graphs] |
  24091. 1825.08 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  24092. 1825.08 s [algebraic-graphs] | ^^^^
  24093. 1825.08 s [algebraic-graphs]
  24094. 1825.08 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  24095. 1825.08 s [algebraic-graphs] In the use of ‘tail’
  24096. 1825.08 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24097. 1825.08 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24098. 1825.08 s [algebraic-graphs] |
  24099. 1825.09 s [algebraic-graphs] 397 | bnd' = tail bnd
  24100. 1825.09 s [algebraic-graphs] | ^^^^
  24101. 1825.09 s [algebraic-graphs]
  24102. 1825.09 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24103. 1825.13 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [HIE file is missing]
  24104. 1825.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24105. 1825.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24106. 1825.24 s [algebraic-graphs] will become an error in a future GHC release.
  24107. 1825.24 s [algebraic-graphs] Suggested fix:
  24108. 1825.24 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24109. 1825.24 s [algebraic-graphs] |
  24110. 1825.25 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24111. 1825.25 s [algebraic-graphs] | ^
  24112. 1825.25 s [algebraic-graphs]
  24113. 1825.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24114. 1825.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24115. 1825.25 s [algebraic-graphs] will become an error in a future GHC release.
  24116. 1825.25 s [algebraic-graphs] Suggested fix:
  24117. 1825.25 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24118. 1825.25 s [algebraic-graphs] |
  24119. 1825.25 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24120. 1825.25 s [algebraic-graphs] | ^
  24121. 1825.25 s [algebraic-graphs]
  24122. 1825.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24123. 1825.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24124. 1825.25 s [algebraic-graphs] will become an error in a future GHC release.
  24125. 1825.25 s [algebraic-graphs] Suggested fix:
  24126. 1825.25 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24127. 1825.25 s [algebraic-graphs] |
  24128. 1825.25 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24129. 1825.25 s [algebraic-graphs] | ^
  24130. 1825.25 s [algebraic-graphs]
  24131. 1825.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24132. 1825.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24133. 1825.25 s [algebraic-graphs] will become an error in a future GHC release.
  24134. 1825.25 s [algebraic-graphs] Suggested fix:
  24135. 1825.25 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24136. 1825.25 s [algebraic-graphs] |
  24137. 1825.25 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24138. 1825.25 s [algebraic-graphs] | ^
  24139. 1825.25 s [algebraic-graphs]
  24140. 1825.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24141. 1825.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24142. 1825.25 s [algebraic-graphs] will become an error in a future GHC release.
  24143. 1825.25 s [algebraic-graphs] Suggested fix:
  24144. 1825.25 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24145. 1825.25 s [algebraic-graphs] |
  24146. 1825.25 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24147. 1825.25 s [algebraic-graphs] | ^
  24148. 1825.25 s [algebraic-graphs]
  24149. 1825.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24150. 1825.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24151. 1825.25 s [algebraic-graphs] will become an error in a future GHC release.
  24152. 1825.25 s [algebraic-graphs] Suggested fix:
  24153. 1825.25 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24154. 1825.25 s [algebraic-graphs] |
  24155. 1825.26 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24156. 1825.26 s [algebraic-graphs] | ^
  24157. 1825.26 s [algebraic-graphs]
  24158. 1825.26 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24159. 1825.26 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24160. 1825.26 s [algebraic-graphs] will become an error in a future GHC release.
  24161. 1825.26 s [algebraic-graphs] Suggested fix:
  24162. 1825.26 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24163. 1825.26 s [algebraic-graphs] |
  24164. 1825.26 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24165. 1825.26 s [algebraic-graphs] | ^
  24166. 1825.26 s [algebraic-graphs]
  24167. 1825.26 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [HIE file is missing]
  24168. 1825.35 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [HIE file is missing]
  24169. 1825.42 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [HIE file is missing]
  24170. 1825.59 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [HIE file is missing]
  24171. 1825.70 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [HIE file is missing]
  24172. 1825.82 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 )
  24173. 1825.85 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [HIE file is missing]
  24174. 1825.86 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [HIE file is missing]
  24175. 1825.87 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [HIE file is missing]
  24176. 1825.89 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24177. 1825.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24178. 1825.89 s [algebraic-graphs] will become an error in a future GHC release.
  24179. 1825.89 s [algebraic-graphs] Suggested fix:
  24180. 1825.89 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24181. 1825.89 s [algebraic-graphs] |
  24182. 1825.89 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24183. 1825.89 s [algebraic-graphs] | ^
  24184. 1825.89 s [algebraic-graphs]
  24185. 1825.89 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [HIE file is missing]
  24186. 1825.91 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24187. 1825.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24188. 1825.91 s [algebraic-graphs] will become an error in a future GHC release.
  24189. 1825.91 s [algebraic-graphs] Suggested fix:
  24190. 1825.91 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24191. 1825.91 s [algebraic-graphs] |
  24192. 1825.91 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24193. 1825.91 s [algebraic-graphs] | ^
  24194. 1825.91 s [algebraic-graphs]
  24195. 1825.91 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24196. 1825.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24197. 1825.91 s [algebraic-graphs] will become an error in a future GHC release.
  24198. 1825.91 s [algebraic-graphs] Suggested fix:
  24199. 1825.91 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  24200. 1825.91 s [algebraic-graphs] |
  24201. 1825.91 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24202. 1825.91 s [algebraic-graphs] | ^
  24203. 1825.91 s [algebraic-graphs]
  24204. 1825.92 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [HIE file is missing]
  24205. 1825.98 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [HIE file is missing]
  24206. 1826.08 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [HIE file is missing]
  24207. 1826.09 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [HIE file is missing]
  24208. 1826.10 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [HIE file is missing]
  24209. 1826.11 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [HIE file is missing]
  24210. 1826.13 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) [HIE file is missing]
  24211. 1826.14 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 )
  24212. 1826.14 s [algebraic-graphs] Haddock coverage:
  24213. 1826.15 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24214. 1826.15 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24215. 1826.15 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24216. 1826.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24217. 1826.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24218. 1826.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24219. 1826.20 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24220. 1826.21 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24221. 1826.21 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24222. 1826.21 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24223. 1826.21 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24224. 1826.21 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24225. 1826.21 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24226. 1826.22 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24227. 1826.23 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24228. 1826.23 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24229. 1826.23 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24230. 1826.23 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24231. 1826.23 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24232. 1826.23 s [algebraic-graphs] Missing documentation for:
  24233. 1826.23 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24234. 1826.24 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  24235. 1826.24 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  24236. 1826.24 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  24237. 1826.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24238. 1826.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24239. 1826.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  24240. 1826.24 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24241. 1826.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24242. 1826.24 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24243. 1826.24 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24244. 1826.24 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  24245. 1826.24 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  24246. 1826.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24247. 1826.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24248. 1826.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  24249. 1826.24 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24250. 1826.24 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24251. 1826.24 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24252. 1826.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24253. 1826.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24254. 1826.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  24255. 1826.26 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24256. 1826.35 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24257. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24258. 1826.35 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24259. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24260. 1826.35 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24261. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24262. 1826.35 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24263. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24264. 1826.35 s [algebraic-graphs] Warning: 'box' is out of scope.
  24265. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24266. 1826.35 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24267. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24268. 1826.35 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24269. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24270. 1826.35 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24271. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24272. 1826.35 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24273. 1826.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24274. 1826.35 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24275. 1826.36 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  24276. 1826.36 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24277. 1826.36 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  24278. 1826.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24279. 1826.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24280. 1826.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24281. 1826.36 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24282. 1826.36 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24283. 1826.36 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24284. 1826.36 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24285. 1826.36 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24286. 1826.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24287. 1826.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24288. 1826.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24289. 1826.38 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24290. 1826.38 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24291. 1826.38 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24292. 1826.38 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24293. 1826.38 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24294. 1826.38 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24295. 1826.38 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24296. 1826.38 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24297. 1826.38 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24298. 1826.38 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  24299. 1826.38 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  24300. 1826.38 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24301. 1826.38 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24302. 1826.38 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24303. 1826.38 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24304. 1826.39 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24305. 1826.39 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  24306. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  24307. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  24308. 1826.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24309. 1826.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24310. 1826.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  24311. 1826.39 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  24312. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  24313. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  24314. 1826.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24315. 1826.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24316. 1826.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  24317. 1826.39 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  24318. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  24319. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  24320. 1826.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24321. 1826.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24322. 1826.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  24323. 1826.39 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  24324. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  24325. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  24326. 1826.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24327. 1826.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24328. 1826.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  24329. 1826.39 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  24330. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  24331. 1826.39 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  24332. 1826.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24333. 1826.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24334. 1826.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  24335. 1826.39 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24336. 1826.39 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24337. 1826.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24338. 1826.39 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24339. 1826.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24340. 1826.39 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24341. 1826.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24342. 1826.40 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  24343. 1826.40 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  24344. 1826.40 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24345. 1826.40 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24346. 1826.40 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24347. 1826.40 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24348. 1826.40 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24349. 1826.40 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24350. 1826.40 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24351. 1826.40 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24352. 1826.40 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24353. 1826.40 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24354. 1826.41 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24355. 1826.41 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24356. 1826.41 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24357. 1826.41 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24358. 1826.41 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24359. 1826.41 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24360. 1826.41 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24361. 1826.41 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24362. 1826.41 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  24363. 1826.41 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24364. 1826.41 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24365. 1826.41 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24366. 1826.41 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24367. 1826.42 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24368. 1826.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24369. 1826.42 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24370. 1826.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24371. 1826.42 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24372. 1826.42 s [algebraic-graphs] Missing documentation for:
  24373. 1826.42 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24374. 1826.42 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24375. 1826.42 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24376. 1826.42 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24377. 1826.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24378. 1826.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24379. 1826.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24380. 1826.42 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24381. 1826.42 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  24382. 1826.42 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24383. 1826.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24384. 1826.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24385. 1826.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24386. 1826.42 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24387. 1826.42 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  24388. 1826.42 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24389. 1826.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24390. 1826.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24391. 1826.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24392. 1826.43 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24393. 1826.43 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  24394. 1826.43 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24395. 1826.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24396. 1826.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24397. 1826.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24398. 1826.43 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24399. 1826.43 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  24400. 1826.43 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24401. 1826.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24402. 1826.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24403. 1826.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24404. 1826.43 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24405. 1826.43 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  24406. 1826.43 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  24407. 1826.43 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  24408. 1826.43 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24409. 1826.43 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24410. 1826.43 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  24411. 1826.43 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24412. 1826.44 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  24413. 1826.44 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  24414. 1826.44 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  24415. 1826.44 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24416. 1826.44 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24417. 1826.44 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  24418. 1826.44 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24419. 1826.44 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24420. 1826.44 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24421. 1826.44 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24422. 1826.44 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24423. 1826.44 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24424. 1826.45 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24425. 1826.45 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24426. 1826.45 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24427. 1826.46 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24428. 1826.46 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24429. 1826.46 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24430. 1826.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24431. 1826.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24432. 1826.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24433. 1826.46 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24434. 1826.46 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  24435. 1826.46 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24436. 1826.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24437. 1826.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24438. 1826.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24439. 1826.46 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24440. 1826.46 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  24441. 1826.46 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24442. 1826.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24443. 1826.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24444. 1826.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24445. 1826.47 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24446. 1826.48 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24447. 1826.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24448. 1826.48 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24449. 1826.49 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24450. 1826.49 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24451. 1826.49 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24452. 1826.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24453. 1826.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24454. 1826.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24455. 1826.49 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  24456. 1826.49 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  24457. 1826.49 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24458. 1826.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24459. 1826.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24460. 1826.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24461. 1826.50 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24462. 1826.50 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24463. 1826.50 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  24464. 1826.50 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  24465. 1826.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24466. 1826.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24467. 1826.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  24468. 1826.50 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24469. 1826.50 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  24470. 1826.50 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24471. 1826.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24472. 1826.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24473. 1826.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  24474. 1826.51 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  24475. 1826.51 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  24476. 1826.51 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  24477. 1826.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24478. 1826.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24479. 1826.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  24480. 1826.51 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24481. 1826.51 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24482. 1826.51 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24483. 1826.51 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  24484. 1826.51 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  24485. 1826.51 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  24486. 1826.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24487. 1826.52 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24488. 1826.52 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  24489. 1826.52 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24490. 1826.52 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  24491. 1826.52 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  24492. 1826.52 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  24493. 1826.52 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24494. 1826.52 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24495. 1826.52 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  24496. 1826.52 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24497. 1826.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24498. 1826.52 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24499. 1826.52 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24500. 1826.52 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24501. 1826.52 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24502. 1826.52 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24503. 1826.52 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24504. 1826.52 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24505. 1826.54 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24506. 1826.54 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24507. 1826.54 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  24508. 1826.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  24509. 1826.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24510. 1826.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24511. 1826.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24512. 1826.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24513. 1826.54 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24514. 1826.54 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24515. 1826.54 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24516. 1826.54 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  24517. 1826.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  24518. 1826.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24519. 1826.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24520. 1826.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24521. 1826.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24522. 1826.54 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24523. 1826.54 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24524. 1826.54 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24525. 1826.54 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  24526. 1826.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  24527. 1826.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24528. 1826.55 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24529. 1826.55 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24530. 1826.55 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24531. 1826.55 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24532. 1826.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24533. 1826.55 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24534. 1826.55 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24535. 1826.55 s [algebraic-graphs] Missing documentation for:
  24536. 1826.55 s [algebraic-graphs] Module header
  24537. 1826.55 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24538. 1826.55 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  24539. 1826.55 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  24540. 1826.55 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  24541. 1826.55 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  24542. 1826.55 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  24543. 1826.55 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  24544. 1826.55 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  24545. 1826.55 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  24546. 1826.55 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  24547. 1826.55 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24548. 1826.55 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24549. 1826.55 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  24550. 1826.55 s [algebraic-graphs] Warning: 'array' is out of scope.
  24551. 1826.55 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24552. 1826.55 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24553. 1826.55 s [algebraic-graphs] Missing documentation for:
  24554. 1826.55 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  24555. 1826.70 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  24556. 1826.70 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  24557. 1826.70 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24558. 1826.70 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24559. 1826.70 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  24560. 1826.70 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  24561. 1826.70 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24562. 1826.70 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24563. 1826.71 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  24564. 1826.71 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  24565. 1826.71 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  24566. 1826.71 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  24567. 1826.71 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24568. 1826.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24569. 1826.72 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  24570. 1826.72 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  24571. 1826.72 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  24572. 1826.72 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  24573. 1826.73 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  24574. 1826.73 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  24575. 1826.73 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  24576. 1826.73 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  24577. 1826.73 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  24578. 1826.74 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  24579. 1826.74 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  24580. 1826.74 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24581. 1826.74 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  24582. 1826.74 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24583. 1826.74 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24584. 1826.74 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24585. 1826.74 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24586. 1826.74 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24587. 1826.74 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24588. 1826.75 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24589. 1826.75 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24590. 1826.75 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24591. 1826.75 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  24592. 1826.75 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24593. 1826.75 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24594. 1826.76 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  24595. 1826.76 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24596. 1826.76 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24597. 1826.76 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  24598. 1826.76 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24599. 1826.77 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  24600. 1826.77 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  24601. 1826.77 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24602. 1826.77 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24603. 1826.77 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24604. 1826.77 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  24605. 1826.77 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24606. 1826.77 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24607. 1826.78 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  24608. 1826.78 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  24609. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24610. 1826.78 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  24611. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24612. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24613. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24614. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  24615. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24616. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24617. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24618. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  24619. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24620. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24621. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  24622. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  24623. 1826.78 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  24624. 1826.78 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24625. 1826.78 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24626. 1826.78 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24627. 1826.78 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24628. 1826.78 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  24629. 1826.78 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24630. 1826.79 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  24631. 1826.79 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24632. 1826.79 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  24633. 1826.79 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24634. 1826.79 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  24635. 1826.79 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24636. 1827.03 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  24637. 1827.03 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  24638. 1827.03 s [haskell-language-server] but were not needed for compilation:
  24639. 1827.03 s [haskell-language-server] - ghc-9.12.2 (exposed by flag -package-id ghc-9.12.2-82d3)
  24640. 1827.03 s [haskell-language-server]
  24641. 1827.04 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  24642. 1828.36 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 )
  24643. 1828.45 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  24644. 1829.81 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  24645. 1830.39 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  24646. 1831.76 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs,
  24647. 1831.76 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24648. 1832.30 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  24649. 1832.37 s [algebraic-graphs] Phase: installPhase
  24650. 1832.45 s [algebraic-graphs] Installing library in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  24651. 1833.10 s [algebraic-graphs] Phase: fixupPhase
  24652. 1833.11 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  24653. 1833.11 s [algebraic-graphs] shrinking /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSalgebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a-ghc9.12.2.so
  24654. 1833.15 s [algebraic-graphs] checking for references to /build/ in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7...
  24655. 1833.19 s [algebraic-graphs] patching script interpreter paths in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  24656. 1833.19 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib
  24657. 1833.47 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc
  24658. 1833.49 s [algebraic-graphs] checking for references to /build/ in /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc...
  24659. 1833.52 s [algebraic-graphs] patching script interpreter paths in /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc
  24660. 1833.68 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  24661. 1834.11 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  24662. 1834.12 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  24663. 1834.16 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24664. 1834.17 s [algebraic-graphs:post-build] copying 2 paths...
  24665. 1834.17 s [algebraic-graphs:post-build] copying path '/nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24666. 1835.58 s [algebraic-graphs:post-build] copying path '/nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24667. 1841.91 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24668. 1842.00 s [algebraic-graphs:post-build] copying 0 paths...
  24669. 1842.02 s Progress: 22 of 27 built (1 building), 593 of 593 downloaded from cache
  24670. 1842.07 s Building /nix/store/c9ys9dfi3gsz070g1vh64jyf2rssikf2-ghc-9.12.2-with-packages.drv
  24671. 1842.07 s [haskell-language-server] Preprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0...
  24672. 1842.07 s [haskell-language-server] Building executable 'haskell-language-server' for haskell-language-server-2.12.0.0...
  24673. 1842.07 s [haskell-language-server] [1 of 1] Compiling Main ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
  24674. 1842.07 s [haskell-language-server] [2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
  24675. 1842.07 s [haskell-language-server] Preprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0...
  24676. 1842.07 s [haskell-language-server] Building executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0...
  24677. 1842.13 s [ghc-9.12.2-with-packages] /nix/store/39gb85lds43f7spl5690pdk8d65fpr5l-doctest-0.24.2/nix-support:
  24678. 1842.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24679. 1842.14 s [ghc-9.12.2-with-packages] /nix/store/7g5rhcln9b5xc36jq2vizcngpyp61vgv-ghc-compat-plugin-0.1.0.1/nix-support:
  24680. 1842.14 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24681. 1842.14 s [ghc-9.12.2-with-packages] /nix/store/q6v155i381w7bwwybxw7j6n48zi29a0r-hedgehog-1.5/nix-support:
  24682. 1842.14 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24683. 1842.18 s [ghc-9.12.2-with-packages] /nix/store/rhl5w4b1m4vqd4jl293y64a66kfqs698-Cabal-3.12.1.0/nix-support:
  24684. 1842.18 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24685. 1842.19 s [ghc-9.12.2-with-packages] /nix/store/h8g1g2m0jdhzda195p1plr7666qbxa26-cabal-doctest-1.0.12/nix-support:
  24686. 1842.19 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24687. 1842.20 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 )
  24688. 1842.21 s [ghc-9.12.2-with-packages] /nix/store/6c9zw7f46s39p46hbarp75p8jxcza9zf-temporary-1.3/nix-support:
  24689. 1842.21 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24690. 1842.21 s [ghc-9.12.2-with-packages] /nix/store/6c9zw7f46s39p46hbarp75p8jxcza9zf-temporary-1.3/nix-support:
  24691. 1842.21 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24692. 1842.21 s [ghc-9.12.2-with-packages] /nix/store/xg51g5848hpl9mps77x2gh0kqp5vpy1v-ansi-terminal-1.1.3/nix-support:
  24693. 1842.21 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24694. 1842.21 s [ghc-9.12.2-with-packages] /nix/store/xg51g5848hpl9mps77x2gh0kqp5vpy1v-ansi-terminal-1.1.3/nix-support:
  24695. 1842.21 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24696. 1842.21 s [ghc-9.12.2-with-packages] /nix/store/ipgap254wlcl0bxhd0637mn5k6dhijrs-async-2.2.5/nix-support:
  24697. 1842.21 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24698. 1842.22 s [ghc-9.12.2-with-packages] /nix/store/ipgap254wlcl0bxhd0637mn5k6dhijrs-async-2.2.5/nix-support:
  24699. 1842.22 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24700. 1842.22 s [ghc-9.12.2-with-packages] /nix/store/9yp7zgnf5ldsswrcn24lr4wmk6gjs95f-barbies-2.1.1.0/nix-support:
  24701. 1842.22 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24702. 1842.23 s [ghc-9.12.2-with-packages] /nix/store/9yp7zgnf5ldsswrcn24lr4wmk6gjs95f-barbies-2.1.1.0/nix-support:
  24703. 1842.23 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24704. 1842.23 s [ghc-9.12.2-with-packages] /nix/store/zag06nyx3hrgh9q0ng1pxjc7fhl02qf6-concurrent-output-1.10.21/nix-support:
  24705. 1842.23 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24706. 1842.23 s [ghc-9.12.2-with-packages] /nix/store/zag06nyx3hrgh9q0ng1pxjc7fhl02qf6-concurrent-output-1.10.21/nix-support:
  24707. 1842.23 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24708. 1842.23 s [ghc-9.12.2-with-packages] /nix/store/14hg9mg5gjcfm6mv57msj2gfrhczbfgb-lifted-async-0.10.2.7/nix-support:
  24709. 1842.24 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24710. 1842.24 s [ghc-9.12.2-with-packages] /nix/store/14hg9mg5gjcfm6mv57msj2gfrhczbfgb-lifted-async-0.10.2.7/nix-support:
  24711. 1842.24 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24712. 1842.24 s [ghc-9.12.2-with-packages] /nix/store/s67l7qhsmagm8rqynpp5rb3sgbc9a5kf-mmorph-1.2.1/nix-support:
  24713. 1842.24 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24714. 1842.24 s [ghc-9.12.2-with-packages] /nix/store/s67l7qhsmagm8rqynpp5rb3sgbc9a5kf-mmorph-1.2.1/nix-support:
  24715. 1842.24 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24716. 1842.24 s [ghc-9.12.2-with-packages] /nix/store/7l39g9km1nh2psckx2x38mmri14fvc9l-monad-control-1.0.3.1/nix-support:
  24717. 1842.24 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24718. 1842.24 s [ghc-9.12.2-with-packages] /nix/store/7l39g9km1nh2psckx2x38mmri14fvc9l-monad-control-1.0.3.1/nix-support:
  24719. 1842.24 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24720. 1842.25 s [ghc-9.12.2-with-packages] /nix/store/423avffd1cpailh8mv3fwln1fiiyb6ap-pretty-show-1.10/nix-support:
  24721. 1842.25 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24722. 1842.25 s [ghc-9.12.2-with-packages] /nix/store/423avffd1cpailh8mv3fwln1fiiyb6ap-pretty-show-1.10/nix-support:
  24723. 1842.25 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24724. 1842.25 s [ghc-9.12.2-with-packages] /nix/store/wfq9yc6in1kk2934d7f3djrknzf52wlh-primitive-0.9.1.0/nix-support:
  24725. 1842.25 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24726. 1842.25 s [ghc-9.12.2-with-packages] /nix/store/wfq9yc6in1kk2934d7f3djrknzf52wlh-primitive-0.9.1.0/nix-support:
  24727. 1842.25 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24728. 1842.26 s [ghc-9.12.2-with-packages] /nix/store/d5vb2zs15rh4k0dhiprx92v727nsb9kh-random-1.2.1.3/nix-support:
  24729. 1842.26 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24730. 1842.26 s [ghc-9.12.2-with-packages] /nix/store/d5vb2zs15rh4k0dhiprx92v727nsb9kh-random-1.2.1.3/nix-support:
  24731. 1842.26 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24732. 1842.26 s [ghc-9.12.2-with-packages] /nix/store/2jwii2l1zjhs98x4vj0w8r35bmybwxdg-resourcet-1.3.0/nix-support:
  24733. 1842.26 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24734. 1842.26 s [ghc-9.12.2-with-packages] /nix/store/2jwii2l1zjhs98x4vj0w8r35bmybwxdg-resourcet-1.3.0/nix-support:
  24735. 1842.26 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24736. 1842.26 s [ghc-9.12.2-with-packages] /nix/store/vjd636z43wwk701gmwlbgy4nlq4d1xz4-safe-exceptions-0.1.7.4/nix-support:
  24737. 1842.26 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24738. 1842.27 s [ghc-9.12.2-with-packages] /nix/store/vjd636z43wwk701gmwlbgy4nlq4d1xz4-safe-exceptions-0.1.7.4/nix-support:
  24739. 1842.27 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24740. 1842.27 s [ghc-9.12.2-with-packages] /nix/store/z9sdjmgzn83ri3hfzhfg8dn7yrl9jhps-transformers-base-0.4.6/nix-support:
  24741. 1842.27 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24742. 1842.27 s [ghc-9.12.2-with-packages] /nix/store/z9sdjmgzn83ri3hfzhfg8dn7yrl9jhps-transformers-base-0.4.6/nix-support:
  24743. 1842.27 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24744. 1842.27 s [ghc-9.12.2-with-packages] /nix/store/96nf4ff4shj7yg3r6knm3jws42gxp33r-wl-pprint-annotated-0.1.0.1/nix-support:
  24745. 1842.27 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24746. 1842.27 s [ghc-9.12.2-with-packages] /nix/store/96nf4ff4shj7yg3r6knm3jws42gxp33r-wl-pprint-annotated-0.1.0.1/nix-support:
  24747. 1842.27 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24748. 1842.30 s [ghc-9.12.2-with-packages] /nix/store/xriyfhc7v4dar5kld3909n7n7yxv1fnm-Cabal-syntax-3.12.1.0/nix-support:
  24749. 1842.30 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24750. 1842.31 s [ghc-9.12.2-with-packages] /nix/store/xriyfhc7v4dar5kld3909n7n7yxv1fnm-Cabal-syntax-3.12.1.0/nix-support:
  24751. 1842.31 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24752. 1842.31 s [ghc-9.12.2-with-packages] /nix/store/m0142z9fsakrn9yyicrnqdndww3vgd64-ansi-terminal-types-1.1.3/nix-support:
  24753. 1842.31 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24754. 1842.31 s [ghc-9.12.2-with-packages] /nix/store/m0142z9fsakrn9yyicrnqdndww3vgd64-ansi-terminal-types-1.1.3/nix-support:
  24755. 1842.31 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24756. 1842.32 s [ghc-9.12.2-with-packages] /nix/store/n9m44dbds9vzw5xmgficydgzk7hhbmc8-hashable-1.5.0.0/nix-support:
  24757. 1842.32 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24758. 1842.32 s [ghc-9.12.2-with-packages] /nix/store/n9m44dbds9vzw5xmgficydgzk7hhbmc8-hashable-1.5.0.0/nix-support:
  24759. 1842.32 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24760. 1842.33 s [ghc-9.12.2-with-packages] /nix/store/8vgq4w4m05fwqyp1lf1xpdw21cwm4vbb-distributive-0.6.2.1/nix-support:
  24761. 1842.33 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24762. 1842.33 s [ghc-9.12.2-with-packages] /nix/store/8vgq4w4m05fwqyp1lf1xpdw21cwm4vbb-distributive-0.6.2.1/nix-support:
  24763. 1842.33 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24764. 1842.33 s [ghc-9.12.2-with-packages] /nix/store/2bw7j5ycplznsly2rvppqnp62is235sh-constraints-0.14.2/nix-support:
  24765. 1842.33 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24766. 1842.34 s [ghc-9.12.2-with-packages] /nix/store/2bw7j5ycplznsly2rvppqnp62is235sh-constraints-0.14.2/nix-support:
  24767. 1842.34 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24768. 1842.34 s [ghc-9.12.2-with-packages] /nix/store/4gfdxa8hl1w74n5yp3ck2wbj7mzj1cmd-lifted-base-0.2.3.12/nix-support:
  24769. 1842.34 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24770. 1842.34 s [ghc-9.12.2-with-packages] /nix/store/4gfdxa8hl1w74n5yp3ck2wbj7mzj1cmd-lifted-base-0.2.3.12/nix-support:
  24771. 1842.34 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24772. 1842.35 s [ghc-9.12.2-with-packages] /nix/store/5jinlayffmmgvsr8m7105q1cjj4gfpz2-transformers-compat-0.7.2/nix-support:
  24773. 1842.35 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24774. 1842.35 s [ghc-9.12.2-with-packages] /nix/store/5jinlayffmmgvsr8m7105q1cjj4gfpz2-transformers-compat-0.7.2/nix-support:
  24775. 1842.35 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24776. 1842.36 s [ghc-9.12.2-with-packages] /nix/store/bdc1bdwqz4x1ssfrqwpa5m42s1r0k0xh-splitmix-0.1.3.1/nix-support:
  24777. 1842.36 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24778. 1842.36 s [ghc-9.12.2-with-packages] /nix/store/bdc1bdwqz4x1ssfrqwpa5m42s1r0k0xh-splitmix-0.1.3.1/nix-support:
  24779. 1842.36 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24780. 1842.36 s [ghc-9.12.2-with-packages] /nix/store/k62bxh5mp5jkx6fz6p0g2pql3p6axf1x-unliftio-core-0.2.1.0/nix-support:
  24781. 1842.36 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24782. 1842.36 s [ghc-9.12.2-with-packages] /nix/store/k62bxh5mp5jkx6fz6p0g2pql3p6axf1x-unliftio-core-0.2.1.0/nix-support:
  24783. 1842.36 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24784. 1842.36 s [ghc-9.12.2-with-packages] /nix/store/kvbnnrw3p2rqry9n0xfr84j9mlhvkkw0-base-orphans-0.9.3/nix-support:
  24785. 1842.36 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24786. 1842.36 s [ghc-9.12.2-with-packages] /nix/store/kvbnnrw3p2rqry9n0xfr84j9mlhvkkw0-base-orphans-0.9.3/nix-support:
  24787. 1842.36 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24788. 1842.37 s [ghc-9.12.2-with-packages] /nix/store/sxjk0703g3jy7l7afnyys0xy2hq87vkg-tagged-0.8.9/nix-support:
  24789. 1842.37 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24790. 1842.37 s [ghc-9.12.2-with-packages] /nix/store/sxjk0703g3jy7l7afnyys0xy2hq87vkg-tagged-0.8.9/nix-support:
  24791. 1842.37 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24792. 1842.37 s [ghc-9.12.2-with-packages] /nix/store/cfx4qsi8c39l5ayzgx5hw30wpfnncql7-boring-0.2.2/nix-support:
  24793. 1842.37 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24794. 1842.37 s [ghc-9.12.2-with-packages] /nix/store/cfx4qsi8c39l5ayzgx5hw30wpfnncql7-boring-0.2.2/nix-support:
  24795. 1842.37 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24796. 1844.75 s [ghc-9.12.2-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/d7bhyha02xydn76g57kcp3pwi0abqz3j-ghc-9.12.2-with-packages
  24797. 1845.17 s [ghc-9.12.2-with-packages:post-build] Pushing 1 paths (152 are already present) using zstd to cache sellout ⏳
  24798. 1845.17 s [ghc-9.12.2-with-packages:post-build]
  24799. 1845.63 s [ghc-9.12.2-with-packages:post-build] Pushing /nix/store/d7bhyha02xydn76g57kcp3pwi0abqz3j-ghc-9.12.2-with-packages (6.77 MiB)
  24800. 1847.40 s [ghc-9.12.2-with-packages:post-build]
  24801. 1847.42 s [ghc-9.12.2-with-packages:post-build] All done.
  24802. 1847.42 s [ghc-9.12.2-with-packages:post-build] Uploading to the NixCI cache: /nix/store/d7bhyha02xydn76g57kcp3pwi0abqz3j-ghc-9.12.2-with-packages
  24803. 1847.46 s [ghc-9.12.2-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24804. 1847.60 s [ghc-9.12.2-with-packages:post-build] copying 1 paths...
  24805. 1847.60 s [ghc-9.12.2-with-packages:post-build] copying path '/nix/store/d7bhyha02xydn76g57kcp3pwi0abqz3j-ghc-9.12.2-with-packages' to 'https://cache.nix-ci.com'...
  24806. 1848.85 s [ghc-9.12.2-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24807. 1849.03 s [ghc-9.12.2-with-packages:post-build] copying 1 paths...
  24808. 1849.03 s [ghc-9.12.2-with-packages:post-build] copying path '/nix/store/c9ys9dfi3gsz070g1vh64jyf2rssikf2-ghc-9.12.2-with-packages.drv' to 'https://cache.nix-ci.com'...
  24809. 1849.17 s Progress: 23 of 26 built (1 building), 593 of 593 downloaded from cache
  24810. 1849.17 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 )
  24811. 1849.17 s [haskell-language-server] [3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
  24812. 1849.17 s [haskell-language-server] Preprocessing library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0...
  24813. 1849.17 s [haskell-language-server] Building library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0...
  24814. 1849.17 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 )
  24815. 1849.17 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 )
  24816. 1849.17 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  24817. 1849.17 s [haskell-language-server] Pattern match(es) are non-exhaustive
  24818. 1849.17 s [haskell-language-server] In a pattern binding:
  24819. 1849.17 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  24820. 1849.17 s [haskell-language-server] Failure _
  24821. 1849.17 s [haskell-language-server] CompletionInvoked _
  24822. 1849.17 s [haskell-language-server] |
  24823. 1849.17 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  24824. 1849.17 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  24825. 1849.17 s [haskell-language-server]
  24826. 1849.17 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  24827. 1849.17 s [haskell-language-server] Pattern match(es) are non-exhaustive
  24828. 1849.17 s [haskell-language-server] In a lambda abstraction:
  24829. 1849.17 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  24830. 1849.17 s [haskell-language-server] ‘ProcessHandle’ not matched:
  24831. 1849.17 s [haskell-language-server] Nothing _ _ _
  24832. 1849.17 s [haskell-language-server] (Just _) Nothing _ _
  24833. 1849.17 s [haskell-language-server] (Just _) (Just _) Nothing _
  24834. 1849.17 s [haskell-language-server] |
  24835. 1849.17 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  24836. 1849.17 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  24837. 1849.17 s [haskell-language-server]
  24838. 1849.17 s [haskell-language-server] ghcide-bench/src/Experiments.hs:630:37: warning: [GHC-63394] [-Wx-partial]
  24839. 1849.17 s [haskell-language-server] In the use of ‘head’
  24840. 1849.17 s [haskell-language-server] (imported from Data.List, but defined in GHC.Internal.List):
  24841. 1849.17 s [haskell-language-server] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24842. 1849.17 s [haskell-language-server] |
  24843. 1849.17 s [haskell-language-server] 630 | let DocumentPositions{..} = head docs
  24844. 1849.17 s [haskell-language-server] | ^^^^
  24845. 1849.17 s [haskell-language-server]
  24846. 1850.82 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 )
  24847. 1852.20 s [haskell-language-server] [2 of 2] Compiling Experiments ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.p_o )
  24848. 1852.86 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  24849. 1852.91 s [haskell-language-server] Pattern match(es) are non-exhaustive
  24850. 1852.91 s [haskell-language-server] In a pattern binding:
  24851. 1852.91 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  24852. 1852.91 s [haskell-language-server] Failure _
  24853. 1852.91 s [haskell-language-server] CompletionInvoked _
  24854. 1852.91 s [haskell-language-server] |
  24855. 1852.91 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  24856. 1852.91 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  24857. 1852.91 s [haskell-language-server]
  24858. 1852.91 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  24859. 1852.91 s [haskell-language-server] Pattern match(es) are non-exhaustive
  24860. 1852.91 s [haskell-language-server] In a lambda abstraction:
  24861. 1852.91 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  24862. 1852.91 s [haskell-language-server] ‘ProcessHandle’ not matched:
  24863. 1852.91 s [haskell-language-server] Nothing _ _ _
  24864. 1852.91 s [haskell-language-server] (Just _) Nothing _ _
  24865. 1852.91 s [haskell-language-server] (Just _) (Just _) Nothing _
  24866. 1852.91 s [haskell-language-server] |
  24867. 1852.91 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  24868. 1852.91 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  24869. 1852.91 s [haskell-language-server]
  24870. 1852.91 s [haskell-language-server] ghcide-bench/src/Experiments.hs:630:37: warning: [GHC-63394] [-Wx-partial]
  24871. 1852.91 s [haskell-language-server] In the use of ‘head’
  24872. 1852.91 s [haskell-language-server] (imported from Data.List, but defined in GHC.Internal.List):
  24873. 1852.91 s [haskell-language-server] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24874. 1852.91 s [haskell-language-server] |
  24875. 1852.91 s [haskell-language-server] 630 | let DocumentPositions{..} = head docs
  24876. 1852.91 s [haskell-language-server] | ^^^^
  24877. 1852.91 s [haskell-language-server]
  24878. 1861.28 s [haskell-language-server] Preprocessing executable 'ghcide-bench' for haskell-language-server-2.12.0.0...
  24879. 1861.28 s [haskell-language-server] Building executable 'ghcide-bench' for haskell-language-server-2.12.0.0...
  24880. 1861.35 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-bench/exe/Main.hs, dist/build/ghcide-bench/ghcide-bench-tmp/Main.dyn_o )
  24881. 1861.81 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-bench/ghcide-bench
  24882. 1863.30 s [haskell-language-server] buildPhase completed in 9 minutes 7 seconds
  24883. 1863.30 s [haskell-language-server] Phase: haddockPhase
  24884. 1863.31 s [haskell-language-server] Phase: installPhase
  24885. 1863.48 s [haskell-language-server] Installing internal library hls-cabal-fmt-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin
  24886. 1863.50 s [haskell-language-server] Installing internal library hls-explicit-imports-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin
  24887. 1863.55 s [haskell-language-server] Installing internal library hls-code-range-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin
  24888. 1863.59 s [haskell-language-server] Installing internal library hls-explicit-fixity-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin
  24889. 1863.61 s [haskell-language-server] Installing internal library hls-ormolu-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin
  24890. 1863.64 s [haskell-language-server] Installing internal library hls-pragmas-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin
  24891. 1863.67 s [haskell-language-server] Installing internal library hls-module-name-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin
  24892. 1863.70 s [haskell-language-server] Installing internal library hls-call-hierarchy-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin
  24893. 1863.75 s [haskell-language-server] Installing internal library hls-notes-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin
  24894. 1863.79 s [haskell-language-server] Installing internal library hls-qualify-imported-names-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin
  24895. 1863.81 s [haskell-language-server] Installing internal library hls-class-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin
  24896. 1863.88 s [haskell-language-server] Installing internal library hls-overloaded-record-dot-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin
  24897. 1863.92 s [haskell-language-server] Installing internal library hls-eval-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin
  24898. 1864.11 s [haskell-language-server] Installing internal library hls-explicit-record-fields-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin
  24899. 1864.15 s [haskell-language-server] Installing executable ghcide-test-preprocessor in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24900. 1864.15 s [haskell-language-server] Warning: The directory
  24901. 1864.15 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24902. 1864.15 s [haskell-language-server] is not in the system search path.
  24903. 1864.15 s [haskell-language-server] Installing internal library hls-hlint-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin
  24904. 1864.21 s [haskell-language-server] Installing internal library hls-stylish-haskell-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin
  24905. 1864.23 s [haskell-language-server] Installing internal library hls-change-type-signature-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin
  24906. 1864.25 s [haskell-language-server] Installing internal library hls-semantic-tokens-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin
  24907. 1864.32 s [haskell-language-server] Installing internal library hls-cabal-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin
  24908. 1864.48 s [haskell-language-server] Installing internal library hls-refactor-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin
  24909. 1864.83 s [haskell-language-server] Installing internal library hls-gadt-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin
  24910. 1864.86 s [haskell-language-server] Installing internal library hls-signature-help-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin
  24911. 1864.88 s [haskell-language-server] Installing internal library hls-rename-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin
  24912. 1864.91 s [haskell-language-server] Installing internal library hls-alternate-number-format-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin
  24913. 1864.95 s [haskell-language-server] Installing internal library hls-cabal-gild-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin
  24914. 1864.97 s [haskell-language-server] Installing internal library hls-fourmolu-plugin in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin
  24915. 1865.00 s [haskell-language-server] Installing library in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q
  24916. 1865.06 s [haskell-language-server] Installing executable haskell-language-server in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24917. 1865.06 s [haskell-language-server] Warning: The directory
  24918. 1865.06 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24919. 1865.06 s [haskell-language-server] is not in the system search path.
  24920. 1865.06 s [haskell-language-server] Installing executable haskell-language-server-wrapper in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24921. 1865.06 s [haskell-language-server] Warning: The directory
  24922. 1865.06 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24923. 1865.06 s [haskell-language-server] is not in the system search path.
  24924. 1865.07 s [haskell-language-server] Installing internal library ghcide-bench-lib in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/haskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib
  24925. 1865.15 s [haskell-language-server] Installing executable ghcide-bench in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24926. 1865.15 s [haskell-language-server] Warning: The directory
  24927. 1865.15 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24928. 1865.15 s [haskell-language-server] is not in the system search path.
  24929. 1867.52 s [haskell-language-server] Phase: fixupPhase
  24930. 1867.54 s [haskell-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0
  24931. 1867.56 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
  24932. 1867.74 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
  24933. 1867.76 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.12.2-unwrapped
  24934. 1867.88 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin/ghcide-bench
  24935. 1868.01 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-1c5fr4SuHwG141CXYZcClP-hls-fourmolu-plugin-ghc9.12.2.so
  24936. 1868.11 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-4CM9DwY5w7gA4dXKLpAYC9-hls-refactor-plugin-ghc9.12.2.so
  24937. 1868.21 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-2sEia9o9aAq1x9RSxuhRjg-hls-alternate-number-format-plugin-ghc9.12.2.so
  24938. 1868.30 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-2e5NIs4CNeL911CKdgjLk9-hls-cabal-gild-plugin-ghc9.12.2.so
  24939. 1868.40 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-4Jzm3f4qz2t7wfSmR0XGJi-hls-cabal-plugin-ghc9.12.2.so
  24940. 1868.51 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-ADx2PjkwP2cDmuzcAoMack-hls-explicit-record-fields-plugin-ghc9.12.2.so
  24941. 1868.60 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-LgQBTpyh5cfIyMqEtjNnWx-hls-cabal-fmt-plugin-ghc9.12.2.so
  24942. 1868.68 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-LZcSI1W0m7FFUgI55MSx4-hls-explicit-imports-plugin-ghc9.12.2.so
  24943. 1868.77 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-ExRiYwaBeWh4iz802S9PKV-hls-call-hierarchy-plugin-ghc9.12.2.so
  24944. 1868.85 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-By1Tl3622clAzCNbREG731-hls-overloaded-record-dot-plugin-ghc9.12.2.so
  24945. 1868.94 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-8s4t7D9yKnEIlLLXPHdgbs-hls-hlint-plugin-ghc9.12.2.so
  24946. 1869.03 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-DxnGXIvfOPq76djOefvEsm-hls-qualify-imported-names-plugin-ghc9.12.2.so
  24947. 1869.12 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-LN4Ij2amtc29AspGUNUzuh-hls-code-range-plugin-ghc9.12.2.so
  24948. 1869.20 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-GbbWB3aQD7K9ZuViG4AzFQ-hls-module-name-plugin-ghc9.12.2.so
  24949. 1869.28 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-AvgOORIPiGCBvNQ4UtUup8-hls-eval-plugin-ghc9.12.2.so
  24950. 1869.38 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-GslrCWmb5r61YFbjiAWDj4-hls-ormolu-plugin-ghc9.12.2.so
  24951. 1869.47 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-3fcFI8sTqHo83DlTn5cgYo-hls-rename-plugin-ghc9.12.2.so
  24952. 1869.56 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-HtzHmrUZ9Vt54MIU34Pn0n-hls-explicit-fixity-plugin-ghc9.12.2.so
  24953. 1869.64 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-5MkKg2YkzR5KkH2R3ZI4IE-hls-semantic-tokens-plugin-ghc9.12.2.so
  24954. 1869.73 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-CWn0OtoAuq0mQA4d02OXS-hls-class-plugin-ghc9.12.2.so
  24955. 1869.82 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-75srUIY3ApLDGePFzdLQM8-hls-gadt-plugin-ghc9.12.2.so
  24956. 1869.91 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-1YhlOVsuNHb4UPoQO1Gymb-ghcide-bench-lib-ghc9.12.2.so
  24957. 1870.01 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-EeqxawudWer2pPQqhwa5Ve-hls-notes-plugin-ghc9.12.2.so
  24958. 1870.09 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-JwlquXAq4ZYKcaNcvCjz3q-ghc9.12.2.so
  24959. 1870.19 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-7SRUNXxtWLy31vWRUKXcbW-hls-change-type-signature-plugin-ghc9.12.2.so
  24960. 1870.30 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-GkfQ7gwXiuBGIGRCBxsXPV-hls-pragmas-plugin-ghc9.12.2.so
  24961. 1870.39 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-8oFhCHA1Ay04ezTJf5SHnl-hls-stylish-haskell-plugin-ghc9.12.2.so
  24962. 1870.48 s [haskell-language-server] shrinking /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHShaskell-language-server-2.12.0.0-43RZ1nStZrdGFmn0Osvbzu-hls-signature-help-plugin-ghc9.12.2.so
  24963. 1870.58 s [haskell-language-server] checking for references to /build/ in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0...
  24964. 1870.70 s [haskell-language-server] patching script interpreter paths in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0
  24965. 1870.71 s [haskell-language-server] /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-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"
  24966. 1870.73 s [haskell-language-server] stripping (with command strip and flags -S -p) in /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/lib /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin
  24967. 1871.50 s [haskell-language-server] rewriting symlink /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0/bin/haskell-language-server-9.12.2 to be relative to /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0
  24968. 1873.45 s [haskell-language-server:post-build] Uploading to cachix cache "sellout": /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0
  24969. 1873.91 s [haskell-language-server:post-build] Pushing 1 paths (581 are already present) using zstd to cache sellout ⏳
  24970. 1873.91 s [haskell-language-server:post-build]
  24971. 1874.25 s [haskell-language-server:post-build] Pushing /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0 (105.59 MiB)
  24972. 1876.11 s [haskell-language-server:post-build]
  24973. 1876.11 s [haskell-language-server:post-build] All done.
  24974. 1876.13 s [haskell-language-server:post-build] Uploading to the NixCI cache: /nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0
  24975. 1876.17 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24976. 1876.22 s [haskell-language-server:post-build] copying 1 paths...
  24977. 1876.22 s [haskell-language-server:post-build] copying path '/nix/store/j8x889qqbjiifkwx30fg1v5kk25jvkbv-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...
  24978. 1897.55 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1897.78 s [haskell-language-server:post-build] copying 1 paths...
  24980. 1897.78 s [haskell-language-server:post-build] copying path '/nix/store/sns0bncs4hl9s78h8zgch64jfw4lf4i2-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  24981. 1897.94 s Progress: 24 of 26 built, 593 of 593 downloaded from cache
  24982. 1898.04 s Building /nix/store/yaw44698qvpydy7i6073gddiz01m520r-ghc-shell-for-packages-0.drv
  24983. 1898.92 s [ghc-shell-for-packages:post-build] Uploading to cachix cache "sellout": /nix/store/l7f2f8r5ga7j9rsrp80ss01ziyfmx6qk-ghc-shell-for-packages-0
  24984. 1899.51 s [ghc-shell-for-packages:post-build] Pushing 2 paths (798 are already present) using zstd to cache sellout ⏳
  24985. 1899.51 s [ghc-shell-for-packages:post-build]
  24986. 1899.84 s [ghc-shell-for-packages:post-build] Pushing /nix/store/c9gi6iyyki9z92gycdb13wbpjqxwsxis-bzip2-1.0.8 (82.87 KiB)
  24987. 1899.96 s [ghc-shell-for-packages:post-build] Pushing /nix/store/l7f2f8r5ga7j9rsrp80ss01ziyfmx6qk-ghc-shell-for-packages-0 (336.00 B)
  24988. 1900.80 s [ghc-shell-for-packages:post-build]
  24989. 1900.80 s [ghc-shell-for-packages:post-build] All done.
  24990. 1900.82 s [ghc-shell-for-packages:post-build] Uploading to the NixCI cache: /nix/store/l7f2f8r5ga7j9rsrp80ss01ziyfmx6qk-ghc-shell-for-packages-0
  24991. 1900.85 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1900.91 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24993. 1900.91 s [ghc-shell-for-packages:post-build] copying path '/nix/store/l7f2f8r5ga7j9rsrp80ss01ziyfmx6qk-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  24994. 1901.13 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1901.54 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24996. 1901.54 s [ghc-shell-for-packages:post-build] copying path '/nix/store/yaw44698qvpydy7i6073gddiz01m520r-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  24997. 1901.72 s Progress: 25 of 26 built, 593 of 593 downloaded from cache
  24998. 1901.72 s Progress: 26 of 26 built, 593 of 593 downloaded from cache
  24999. 1901.72 s /nix/store/l7f2f8r5ga7j9rsrp80ss01ziyfmx6qk-ghc-shell-for-packages-0
  25000. 1901.81 s Build succeeded.
Tail Raw Logs