1. 798.73 s [pandoc] #1: OK (0.06s)
  2. 798.73 s [pandoc] 7494.md
  3. 798.73 s [pandoc] #1: OK
  4. 798.74 s [pandoc] #2: OK
  5. 798.75 s [pandoc] #3: OK
  6. 798.75 s [pandoc] #4: OK
  7. 798.76 s [pandoc] #5: OK
  8. 798.76 s [pandoc] sloppypar.md
  9. 798.77 s [pandoc] #1: OK
  10. 798.78 s [pandoc] #2: OK
  11. 798.78 s [pandoc] 5420.md
  12. 798.78 s [pandoc] #1: OK
  13. 798.78 s [pandoc] shift-heading-level-by.md
  14. 798.79 s [pandoc] #1: OK
  15. 798.80 s [pandoc] #2: OK
  16. 798.80 s [pandoc] 6424.md
  17. 798.80 s [pandoc] #1: OK
  18. 798.80 s [pandoc] 5619.md
  19. 798.81 s [pandoc] #1: OK
  20. 798.81 s [pandoc] 6925.md
  21. 798.82 s [pandoc] #1: OK
  22. 798.82 s [pandoc] 6858.md
  23. 798.83 s [pandoc] #1: OK
  24. 798.84 s [pandoc] #2: OK (0.01s)
  25. 798.84 s [pandoc] 10537.md
  26. 798.85 s [pandoc] #1: OK
  27. 798.86 s [pandoc] #2: OK
  28. 798.86 s [pandoc] 7861.md
  29. 798.86 s [pandoc] #1: OK
  30. 798.86 s [pandoc] 10414.md
  31. 798.87 s [pandoc] #1: OK
  32. 798.87 s [pandoc] 8653.md
  33. 798.88 s [pandoc] #1: OK
  34. 798.89 s [pandoc] #2: OK (0.01s)
  35. 798.89 s [pandoc] dots.md
  36. 798.91 s [pandoc] #1: OK (0.01s)
  37. 798.91 s [pandoc] pandoc-citeproc-401.md
  38. 799.00 s [pandoc] #1: OK (0.10s)
  39. 799.00 s [pandoc] 7132.md
  40. 799.01 s [pandoc] #1: OK
  41. 799.01 s [pandoc] 4794.md
  42. 799.02 s [pandoc] #1: OK
  43. 799.02 s [pandoc] pandoc-citeproc-75.md
  44. 799.06 s [pandoc] #1: OK (0.04s)
  45. 799.06 s [pandoc] 5686.md
  46. 799.33 s [pandoc] #1: OK (0.01s)
  47. 799.33 s [pandoc] jats-figure-alt-text.md
  48. 799.33 s [pandoc] #1: OK (0.01s)
  49. 799.33 s [pandoc] 8661.md
  50. 799.33 s [pandoc] #1: OK
  51. 799.33 s [pandoc] pandoc-citeproc-361.md
  52. 799.33 s [pandoc] #1: OK (0.04s)
  53. 799.33 s [pandoc] 4933.md
  54. 799.33 s [pandoc] #1: OK
  55. 799.33 s [pandoc] 9021.md
  56. 799.33 s [haskell-language-server] plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs:8:1: warning: [GHC-66111] [-Wunused-imports]
  57. 799.33 s [haskell-language-server] The import of ‘Data.Foldable’ is redundant
  58. 799.33 s [haskell-language-server] except perhaps to import instances from ‘Data.Foldable’
  59. 799.33 s [haskell-language-server] To import instances alone, use: import Data.Foldable()
  60. 799.33 s [haskell-language-server] |
  61. 799.33 s [haskell-language-server] 8 | import Data.Foldable (foldl')
  62. 799.33 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  63. 799.33 s [haskell-language-server]
  64. 799.33 s [pandoc] #1: OK (0.03s)
  65. 799.33 s [pandoc] 9452.md
  66. 799.33 s [pandoc] #1: OK
  67. 799.33 s [pandoc] biblatex-knuth-ct.md
  68. 799.33 s [pandoc] #1: OK (0.03s)
  69. 799.33 s [pandoc] html-writer-a-in-a.md
  70. 799.33 s [pandoc] #1: OK (0.01s)
  71. 799.33 s [pandoc] biblatex-issue288.md
  72. 799.33 s [pandoc] #1: OK (0.02s)
  73. 799.33 s [pandoc] 8178.md
  74. 799.33 s [pandoc] #1: OK
  75. 799.33 s [pandoc] #2: OK
  76. 799.33 s [pandoc] #3: OK
  77. 799.33 s [pandoc] 8254.md
  78. 799.33 s [pandoc] #1: OK
  79. 799.33 s [pandoc] 8402.md
  80. 799.33 s [pandoc] #1: OK (0.01s)
  81. 799.33 s [pandoc] 4842.md
  82. 799.33 s [pandoc] #1: OK
  83. 799.33 s [pandoc] 1905.md
  84. 799.33 s [pandoc] #1: OK
  85. 799.33 s [pandoc] #2: OK (0.01s)
  86. 799.33 s [pandoc] #3: OK
  87. 799.33 s [pandoc] latex-tabular-column-specs.md
  88. 799.33 s [pandoc] #1: OK (0.01s)
  89. 799.33 s [pandoc] 10057.md
  90. 799.34 s [pandoc] #1: OK
  91. 799.34 s [pandoc] 3568.md
  92. 799.35 s [pandoc] #1: OK (0.01s)
  93. 799.35 s [pandoc] 7668.md
  94. 799.38 s [pandoc] #1: OK (0.03s)
  95. 799.38 s [pandoc] 5543.md
  96. 799.38 s [pandoc] #1: OK
  97. 799.38 s [pandoc] 8243.md
  98. 799.40 s [pandoc] #1: OK (0.01s)
  99. 799.40 s [pandoc] biblatex-vazques-de-parga-mvbook.md
  100. 799.43 s [pandoc] #1: OK (0.03s)
  101. 799.43 s [pandoc] 4159.md
  102. 799.43 s [pandoc] #1: OK
  103. 799.43 s [pandoc] gfm.md
  104. 799.44 s [pandoc] #1: OK
  105. 799.45 s [pandoc] #2: OK
  106. 799.46 s [pandoc] #3: OK
  107. 799.47 s [pandoc] #4: OK
  108. 799.48 s [pandoc] #5: OK
  109. 799.48 s [pandoc] #6: OK
  110. 799.49 s [pandoc] #7: OK
  111. 799.50 s [pandoc] #8: OK
  112. 799.51 s [pandoc] #9: OK
  113. 799.51 s [pandoc] #10: OK
  114. 799.52 s [pandoc] #11: OK
  115. 799.53 s [pandoc] #12: OK
  116. 799.53 s [pandoc] #13: OK
  117. 799.54 s [pandoc] #14: OK
  118. 799.54 s [pandoc] 2228.md
  119. 799.55 s [pandoc] #1: OK
  120. 799.55 s [pandoc] 4054.md
  121. 799.56 s [pandoc] #1: OK
  122. 799.56 s [pandoc] #2: OK (0.01s)
  123. 799.56 s [pandoc] rst-links.md
  124. 799.58 s [pandoc] #1: OK (0.01s)
  125. 799.59 s [pandoc] #2: OK (0.01s)
  126. 799.59 s [pandoc] 9193.md
  127. 799.60 s [pandoc] #1: OK
  128. 799.60 s [pandoc] bits-toc-elements.md
  129. 799.61 s [pandoc] #1: OK (0.01s)
  130. 799.61 s [pandoc] 4545.md
  131. 799.62 s [pandoc] #1: OK
  132. 799.63 s [pandoc] #2: OK
  133. 799.63 s [pandoc] 4690.md
  134. 799.64 s [pandoc] #1: OK
  135. 799.64 s [pandoc] pandoc-citeproc-65.md
  136. 799.67 s [pandoc] #1: OK (0.04s)
  137. 799.67 s [pandoc] 1841.md
  138. 799.69 s [pandoc] #1: OK (0.01s)
  139. 799.70 s [pandoc] #2: OK (0.01s)
  140. 799.70 s [pandoc] 5540.md
  141. 799.70 s [pandoc] #1: OK
  142. 799.70 s [pandoc] biblatex-reese.md
  143. 799.73 s [pandoc] #1: OK (0.03s)
  144. 799.73 s [pandoc] pandoc-citeproc-chicago-author-date.md
  145. 799.86 s [pandoc] #1: OK (0.13s)
  146. 799.86 s [pandoc] 7512.md
  147. 799.87 s [pandoc] #1: OK
  148. 799.88 s [pandoc] #2: OK
  149. 799.88 s [pandoc] biblatex-hyman.md
  150. 799.90 s [pandoc] #1: OK (0.03s)
  151. 799.90 s [pandoc] biblatex-periodical.md
  152. 799.92 s [pandoc] #1: OK (0.02s)
  153. 799.92 s [pandoc] 8638.md
  154. 799.93 s [pandoc] #1: OK
  155. 799.93 s [pandoc] 8770-document.md
  156. 799.94 s [pandoc] #1: OK (0.01s)
  157. 799.94 s [pandoc] biblatex-doody.md
  158. 799.97 s [pandoc] #1: OK (0.03s)
  159. 799.97 s [pandoc] 9445.md
  160. 799.97 s [pandoc] #1: OK
  161. 799.98 s [pandoc] 7953.md
  162. 799.98 s [pandoc] #1: OK
  163. 799.98 s [pandoc] 4564.md
  164. 800.00 s [pandoc] #1: OK (0.01s)
  165. 800.00 s [pandoc] 7546.md
  166. 800.01 s [pandoc] #1: OK (0.02s)
  167. 800.01 s [pandoc] 9275.md
  168. 800.03 s [pandoc] #1: OK (0.02s)
  169. 800.05 s [pandoc] #2: OK (0.02s)
  170. 800.05 s [pandoc] 8853.md
  171. 800.07 s [pandoc] #1: OK (0.01s)
  172. 800.07 s [pandoc] 5654.md
  173. 800.08 s [pandoc] #1: OK (0.02s)
  174. 800.08 s [pandoc] biblatex-gillies.md
  175. 800.11 s [pandoc] #1: OK (0.03s)
  176. 800.11 s [pandoc] 6836.md
  177. 800.12 s [pandoc] #1: OK
  178. 800.12 s [pandoc] 7930.md
  179. 800.14 s [pandoc] #1: OK (0.01s)
  180. 800.14 s [pandoc] hspace.md
  181. 800.15 s [pandoc] #1: OK (0.01s)
  182. 800.17 s [pandoc] #2: OK (0.02s)
  183. 800.18 s [pandoc] #3: OK
  184. 800.18 s [pandoc] #4: OK
  185. 800.18 s [pandoc] 8364.md
  186. 800.22 s [pandoc] #1: OK (0.04s)
  187. 800.22 s [pandoc] 9603.md
  188. 800.23 s [pandoc] #1: OK (0.01s)
  189. 800.23 s [pandoc] 3530.md
  190. 800.24 s [pandoc] #1: OK (0.01s)
  191. 800.25 s [pandoc] #2: OK
  192. 800.25 s [pandoc] pandoc-citeproc-250.md
  193. 800.29 s [pandoc] #1: OK (0.03s)
  194. 800.29 s [pandoc] 2549.md
  195. 800.30 s [pandoc] #1: OK (0.02s)
  196. 800.31 s [pandoc] #2: OK
  197. 800.32 s [pandoc] #3: OK
  198. 800.33 s [pandoc] #4: OK
  199. 800.33 s [pandoc] 3324.md
  200. 800.34 s [pandoc] #1: OK
  201. 800.34 s [pandoc] 4280.md
  202. 800.34 s [pandoc] #1: OK
  203. 800.34 s [pandoc] 9481.md
  204. 800.36 s [pandoc] #1: OK (0.01s)
  205. 800.36 s [pandoc] bits-title-display-as.md
  206. 800.36 s [pandoc] #1: OK
  207. 800.37 s [pandoc] #2: OK
  208. 800.38 s [pandoc] #3: OK (0.01s)
  209. 800.38 s [pandoc] 3615.md
  210. 800.39 s [pandoc] #1: OK
  211. 800.39 s [pandoc] #2: OK
  212. 800.39 s [pandoc] biblatex-title-and-shorttitle.md
  213. 800.42 s [pandoc] #1: OK (0.03s)
  214. 800.42 s [pandoc] 512.md
  215. 800.43 s [pandoc] #1: OK
  216. 800.44 s [pandoc] #2: OK
  217. 800.45 s [pandoc] #3: OK
  218. 800.45 s [pandoc] ascii.md
  219. 800.46 s [pandoc] #1: OK
  220. 800.46 s [pandoc] #2: OK
  221. 800.47 s [pandoc] #3: OK
  222. 800.48 s [pandoc] #4: OK
  223. 800.49 s [pandoc] #5: OK
  224. 800.51 s [pandoc] #6: OK (0.02s)
  225. 800.52 s [pandoc] #7: OK (0.02s)
  226. 800.53 s [pandoc] #8: OK
  227. 800.55 s [pandoc] #9: OK (0.01s)
  228. 800.55 s [pandoc] #10: OK
  229. 800.57 s [pandoc] #11: OK (0.01s)
  230. 800.59 s [pandoc] #12: OK (0.03s)
  231. 800.59 s [pandoc] 3804.md
  232. 800.60 s [pandoc] #1: OK
  233. 800.60 s [pandoc] 4781.md
  234. 800.60 s [pandoc] #1: OK
  235. 800.61 s [pandoc] #2: OK
  236. 800.61 s [pandoc] 3736.md
  237. 800.62 s [pandoc] #1: OK
  238. 800.63 s [pandoc] #2: OK
  239. 800.63 s [pandoc] #3: OK
  240. 800.63 s [pandoc] 6948.md
  241. 800.64 s [pandoc] #1: OK
  242. 800.64 s [pandoc] #2: OK
  243. 800.65 s [pandoc] #3: OK
  244. 800.65 s [pandoc] 9676.md
  245. 800.66 s [pandoc] #1: OK
  246. 800.66 s [pandoc] 9555.md
  247. 800.67 s [pandoc] #1: OK
  248. 800.67 s [pandoc] 5321.md
  249. 800.68 s [pandoc] #1: OK
  250. 800.68 s [pandoc] #2: OK
  251. 800.68 s [pandoc] 6620.md
  252. 800.70 s [pandoc] #1: OK (0.01s)
  253. 800.70 s [pandoc] 2378.md
  254. 800.70 s [pandoc] #1: OK
  255. 800.70 s [pandoc] 4877.md
  256. 800.71 s [pandoc] #1: OK
  257. 800.71 s [pandoc] #2: OK
  258. 800.71 s [pandoc] 5574.md
  259. 800.74 s [pandoc] #1: OK (0.01s)
  260. 800.74 s [pandoc] biblatex-nietzsche-historie.md
  261. 800.77 s [pandoc] #1: OK (0.04s)
  262. 800.77 s [pandoc] 4420.md
  263. 800.77 s [pandoc] #1: OK
  264. 800.77 s [pandoc] 7743.md
  265. 800.78 s [pandoc] #1: OK
  266. 800.79 s [pandoc] #2: OK
  267. 800.79 s [pandoc] #3: OK
  268. 800.80 s [pandoc] #4: OK
  269. 800.81 s [pandoc] #5: OK
  270. 800.81 s [pandoc] #6: OK
  271. 800.87 s [pandoc] #7: OK (0.06s)
  272. 800.88 s [pandoc] #8: OK
  273. 800.88 s [pandoc] 7434.md
  274. 800.90 s [pandoc] #1: OK (0.01s)
  275. 800.90 s [pandoc] 4186.md
  276. 800.90 s [pandoc] #1: OK
  277. 801.42 s [pandoc] #2: OK (0.51s)
  278. 801.42 s [pandoc] 7173.md
  279. 801.43 s [pandoc] #1: OK
  280. 801.43 s [pandoc] #2: OK
  281. 801.45 s [pandoc] #3: OK (0.01s)
  282. 801.45 s [pandoc] #4: OK
  283. 801.46 s [pandoc] #5: OK
  284. 801.46 s [pandoc] 3690.md
  285. 801.47 s [pandoc] #1: OK
  286. 801.47 s [pandoc] biblatex-vangennep-trans.md
  287. 801.49 s [pandoc] #1: OK (0.02s)
  288. 801.49 s [pandoc] bits-book-part-wrapper.md
  289. 801.50 s [pandoc] #1: OK
  290. 801.50 s [pandoc] 9478.md
  291. 801.51 s [pandoc] #1: OK
  292. 801.51 s [pandoc] pandoc-citeproc-320.md
  293. 801.60 s [pandoc] #1: OK (0.09s)
  294. 801.60 s [pandoc] 6009.md
  295. 801.61 s [pandoc] #1: OK
  296. 801.61 s [pandoc] 5793.md
  297. 801.62 s [pandoc] #1: OK
  298. 801.63 s [pandoc] #2: OK
  299. 801.63 s [pandoc] biblatex-spiegelberg.md
  300. 801.66 s [pandoc] #1: OK (0.03s)
  301. 801.66 s [pandoc] 10271.md
  302. 801.66 s [pandoc] #1: OK
  303. 801.66 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 )
  304. 801.67 s [pandoc] #2: OK
  305. 801.68 s [pandoc] #3: OK
  306. 801.69 s [pandoc] #4: OK
  307. 801.69 s [pandoc] 7920.md
  308. 801.70 s [pandoc] #1: OK
  309. 801.71 s [pandoc] #2: OK (0.02s)
  310. 801.72 s [pandoc] #3: OK
  311. 801.72 s [pandoc] 6675.md
  312. 801.73 s [pandoc] #1: OK (0.01s)
  313. 801.73 s [pandoc] 7525.md
  314. 801.74 s [pandoc] #1: OK (0.01s)
  315. 801.75 s [pandoc] #2: OK
  316. 801.76 s [pandoc] #3: OK
  317. 801.76 s [pandoc] biblatex-ctan.md
  318. 801.80 s [pandoc] #1: OK (0.03s)
  319. 801.80 s [pandoc] pandoc-citeproc-51.md
  320. 801.91 s [pandoc] #1: OK (0.11s)
  321. 801.91 s [pandoc] 6308.md
  322. 801.91 s [pandoc] #1: OK
  323. 801.92 s [pandoc] 4281.md
  324. 801.92 s [pandoc] #1: OK
  325. 801.92 s [pandoc] 6384.md
  326. 801.94 s [pandoc] #1: OK (0.01s)
  327. 801.94 s [pandoc] biblatex-baez-article.md
  328. 801.97 s [pandoc] #1: OK (0.03s)
  329. 801.97 s [pandoc] biblatex-test-case-conversion.md
  330. 802.00 s [pandoc] #1: OK (0.03s)
  331. 802.00 s [pandoc] pandoc-citeproc-327.md
  332. 802.04 s [pandoc] #1: OK (0.04s)
  333. 802.04 s [pandoc] 10279.md
  334. 802.06 s [pandoc] #1: OK (0.01s)
  335. 802.06 s [pandoc] 4960.md
  336. 802.07 s [pandoc] #1: OK
  337. 802.07 s [pandoc] #2: OK
  338. 802.08 s [pandoc] #3: OK
  339. 802.08 s [pandoc] 4880.md
  340. 802.09 s [pandoc] #1: OK (0.01s)
  341. 802.09 s [pandoc] dokuwiki-quote.md
  342. 802.09 s [pandoc] #1: OK
  343. 802.09 s [pandoc] citeproc-author-in-text-suffix.md
  344. 802.10 s [pandoc] #1: OK
  345. 802.10 s [pandoc] 5081.md
  346. 802.11 s [pandoc] #1: OK (0.01s)
  347. 802.11 s [pandoc] 7573.md
  348. 802.12 s [pandoc] #1: OK
  349. 802.12 s [pandoc] biblatex-britannica.md
  350. 802.15 s [pandoc] #1: OK (0.03s)
  351. 802.15 s [pandoc] 5050.md
  352. 802.15 s [pandoc] #1: OK
  353. 802.15 s [pandoc] biblatex-sorace.md
  354. 802.18 s [pandoc] #1: OK (0.03s)
  355. 802.18 s [pandoc] macros.md
  356. 802.19 s [pandoc] #1: OK (0.01s)
  357. 802.20 s [pandoc] #2: OK
  358. 802.21 s [pandoc] #3: OK
  359. 802.21 s [pandoc] #4: OK
  360. 802.22 s [pandoc] #5: OK
  361. 802.23 s [pandoc] #6: OK
  362. 802.24 s [pandoc] #7: OK
  363. 802.25 s [pandoc] #8: OK
  364. 802.26 s [pandoc] #9: OK
  365. 802.26 s [pandoc] #10: OK
  366. 802.27 s [pandoc] #11: OK
  367. 802.27 s [pandoc] #12: OK
  368. 802.27 s [pandoc] 5876.md
  369. 802.28 s [pandoc] #1: OK
  370. 802.28 s [pandoc] #2: OK
  371. 802.30 s [pandoc] #3: OK
  372. 802.32 s [pandoc] #4: OK (0.02s)
  373. 802.32 s [pandoc] pandoc-citeproc-locators-delimited.md
  374. 802.34 s [pandoc] #1: OK (0.03s)
  375. 802.34 s [pandoc] 3533-rst-csv-tables.md
  376. 802.36 s [pandoc] #1: OK (0.02s)
  377. 802.38 s [pandoc] #2: OK (0.01s)
  378. 802.39 s [pandoc] #3: OK (0.01s)
  379. 802.39 s [pandoc] pandoc-citeproc-371.md
  380. 802.44 s [pandoc] #1: OK (0.05s)
  381. 802.44 s [pandoc] 3309.md
  382. 802.44 s [pandoc] #1: OK
  383. 802.45 s [pandoc] #2: OK
  384. 802.46 s [pandoc] #3: OK
  385. 802.46 s [pandoc] 7847.md
  386. 802.46 s [pandoc] #1: OK
  387. 802.47 s [pandoc] #2: OK
  388. 802.48 s [pandoc] #3: OK
  389. 802.48 s [pandoc] 4253.md
  390. 802.48 s [pandoc] #1: OK
  391. 802.48 s [pandoc] 5986.md
  392. 802.51 s [pandoc] #1: OK (0.02s)
  393. 802.51 s [pandoc] 5753.md
  394. 802.51 s [pandoc] #1: OK
  395. 802.51 s [pandoc] 9196.md
  396. 802.52 s [pandoc] #1: OK
  397. 802.52 s [pandoc] 7713.md
  398. 802.53 s [pandoc] #1: OK
  399. 802.53 s [pandoc] 982.md
  400. 802.54 s [pandoc] #1: OK
  401. 802.54 s [pandoc] 4667.md
  402. 802.55 s [pandoc] #1: OK
  403. 802.55 s [pandoc] biblatex-averroes-hercz.md
  404. 802.57 s [pandoc] #1: OK (0.02s)
  405. 802.57 s [pandoc] 5079.md
  406. 802.58 s [pandoc] #1: OK
  407. 802.58 s [pandoc] 8028.md
  408. 802.59 s [pandoc] #1: OK
  409. 802.59 s [pandoc] 9159.md
  410. 802.59 s [pandoc] #1: OK
  411. 802.60 s [pandoc] duplicate_attributes.md
  412. 802.61 s [pandoc] #1: OK (0.02s)
  413. 802.61 s [pandoc] biblatex-laufenberg.md
  414. 802.64 s [pandoc] #1: OK (0.03s)
  415. 802.64 s [pandoc] 9632.md
  416. 802.65 s [pandoc] #1: OK
  417. 802.65 s [pandoc] 3587.md
  418. 802.66 s [pandoc] #1: OK (0.01s)
  419. 802.67 s [pandoc] #2: OK
  420. 802.67 s [pandoc] #3: OK
  421. 802.68 s [pandoc] #4: OK
  422. 802.69 s [pandoc] #5: OK
  423. 802.69 s [pandoc] #6: OK
  424. 802.70 s [pandoc] #7: OK
  425. 802.71 s [pandoc] #8: OK
  426. 802.71 s [pandoc] #9: OK
  427. 802.72 s [pandoc] #10: OK
  428. 802.72 s [pandoc] #11: OK
  429. 802.73 s [haskell-language-server] plugins/hls-notes-plugin/src/Ide/Plugin/Notes.hs:8:1: warning: [GHC-66111] [-Wunused-imports]
  430. 802.73 s [haskell-language-server] The import of ‘Data.Foldable’ is redundant
  431. 802.73 s [haskell-language-server] except perhaps to import instances from ‘Data.Foldable’
  432. 802.73 s [haskell-language-server] To import instances alone, use: import Data.Foldable()
  433. 802.73 s [haskell-language-server] |
  434. 802.73 s [haskell-language-server] 8 | import Data.Foldable (foldl')
  435. 802.73 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  436. 802.73 s [haskell-language-server]
  437. 802.73 s [pandoc] #12: OK
  438. 802.74 s [pandoc] #13: OK
  439. 802.74 s [pandoc] #14: OK
  440. 802.75 s [pandoc] #15: OK
  441. 802.76 s [pandoc] #16: OK
  442. 802.76 s [pandoc] #17: OK
  443. 802.77 s [pandoc] #18: OK
  444. 802.78 s [pandoc] #19: OK
  445. 802.78 s [pandoc] 10848.md
  446. 802.78 s [pandoc] #1: OK
  447. 802.79 s [pandoc] #2: OK
  448. 802.80 s [pandoc] #3: OK
  449. 802.80 s [pandoc] 7397.md
  450. 802.81 s [pandoc] #1: OK
  451. 802.81 s [pandoc] pandoc-citeproc-no-author.md
  452. 802.86 s [pandoc] #1: OK (0.05s)
  453. 802.86 s [pandoc] 5368.md
  454. 802.87 s [pandoc] #1: OK
  455. 802.87 s [pandoc] 4742.md
  456. 802.89 s [pandoc] #1: OK (0.01s)
  457. 802.90 s [pandoc] #2: OK (0.02s)
  458. 802.91 s [pandoc] #3: OK
  459. 802.91 s [pandoc] biblatex-knuth-ct-e.md
  460. 802.93 s [pandoc] #1: OK (0.02s)
  461. 802.93 s [pandoc] 6265.md
  462. 802.94 s [pandoc] #1: OK
  463. 802.94 s [pandoc] 4156.md
  464. 802.94 s [pandoc] #1: OK
  465. 802.94 s [pandoc] 7272.md
  466. 802.95 s [pandoc] #1: OK
  467. 802.95 s [pandoc] 9293.md
  468. 802.96 s [pandoc] #1: OK
  469. 802.96 s [pandoc] 10094.md
  470. 802.97 s [pandoc] #1: OK (0.01s)
  471. 802.97 s [pandoc] biblatex-averroes-bland.md
  472. 802.99 s [pandoc] #1: OK (0.02s)
  473. 802.99 s [pandoc] 3681.md
  474. 803.00 s [pandoc] #1: OK
  475. 803.01 s [pandoc] #2: OK
  476. 803.01 s [pandoc] #3: OK
  477. 803.01 s [pandoc] 9017.md
  478. 803.04 s [pandoc] #1: OK (0.03s)
  479. 803.04 s [pandoc] 9987.md
  480. 803.06 s [pandoc] #1: OK (0.01s)
  481. 803.06 s [pandoc] 1629.md
  482. 803.06 s [pandoc] #1: OK
  483. 803.06 s [pandoc] wikilinks_title_after_pipe.md
  484. 803.07 s [pandoc] #1: OK
  485. 803.08 s [pandoc] #2: OK
  486. 803.10 s [pandoc] #3: OK (0.02s)
  487. 803.11 s [pandoc] #4: OK
  488. 803.11 s [pandoc] 10062.md
  489. 803.11 s [pandoc] #1: OK
  490. 803.11 s [pandoc] 5655.md
  491. 803.12 s [pandoc] #1: OK
  492. 803.13 s [pandoc] #2: OK
  493. 803.13 s [pandoc] 8681.md
  494. 803.14 s [pandoc] #1: OK
  495. 803.14 s [pandoc] biblatex-pines.md
  496. 803.17 s [pandoc] #1: OK (0.04s)
  497. 803.17 s [pandoc] pandoc-citeproc-76.md
  498. 803.25 s [pandoc] #1: OK (0.07s)
  499. 803.25 s [pandoc] typst-property-output.md
  500. 803.25 s [pandoc] #1: OK
  501. 803.26 s [pandoc] #2: OK
  502. 803.26 s [pandoc] #3: OK
  503. 803.27 s [pandoc] #4: OK
  504. 803.27 s [pandoc] #5: OK
  505. 803.28 s [pandoc] #6: OK
  506. 803.29 s [pandoc] #7: OK
  507. 803.29 s [pandoc] #8: OK
  508. 803.30 s [pandoc] #9: OK
  509. 803.30 s [pandoc] #10: OK
  510. 803.31 s [pandoc] #11: OK
  511. 803.32 s [pandoc] #12: OK
  512. 803.32 s [pandoc] #13: OK
  513. 803.33 s [pandoc] #14: OK
  514. 803.34 s [pandoc] #15: OK
  515. 803.34 s [pandoc] 3510.md
  516. 803.35 s [pandoc] #1: OK
  517. 803.35 s [pandoc] biblatex-crossref-inbook-mvbook.md
  518. 803.36 s [pandoc] #1: OK (0.01s)
  519. 803.36 s [pandoc] 6658.md
  520. 803.38 s [pandoc] #1: OK (0.02s)
  521. 803.38 s [pandoc] rst_block_subst.md
  522. 803.38 s [pandoc] #1: OK
  523. 803.38 s [pandoc] pandoc-citeproc-70.md
  524. 803.47 s [pandoc] #1: OK (0.08s)
  525. 803.47 s [pandoc] 4885.md
  526. 803.48 s [pandoc] #1: OK
  527. 803.48 s [pandoc] pandoc-citeproc-175.md
  528. 803.51 s [pandoc] #1: OK (0.03s)
  529. 803.51 s [pandoc] 4624.md
  530. 803.52 s [pandoc] #1: OK
  531. 803.52 s [pandoc] 5549.md
  532. 803.52 s [pandoc] #1: OK
  533. 803.52 s [pandoc] 6752.md
  534. 803.54 s [pandoc] #1: OK (0.01s)
  535. 803.54 s [pandoc] 10747.md
  536. 803.54 s [pandoc] #1: OK
  537. 803.54 s [pandoc] 7099.md
  538. 803.55 s [pandoc] #1: OK
  539. 803.55 s [pandoc] #2: OK
  540. 803.55 s [pandoc] 262.md
  541. 803.56 s [pandoc] #1: OK
  542. 803.57 s [pandoc] #2: OK
  543. 803.57 s [pandoc] biblatex-gonzalez.md
  544. 803.60 s [pandoc] #1: OK (0.03s)
  545. 803.60 s [pandoc] 5416.md
  546. 803.60 s [pandoc] #1: OK
  547. 803.61 s [pandoc] #2: OK
  548. 803.61 s [pandoc] 3537.md
  549. 803.61 s [pandoc] #1: OK
  550. 803.62 s [pandoc] #2: OK
  551. 803.62 s [pandoc] #3: OK
  552. 803.62 s [pandoc] pandoc-citeproc-47.md
  553. 803.70 s [pandoc] #1: OK (0.08s)
  554. 803.70 s [pandoc] biblatex-jaffe.md
  555. 803.75 s [pandoc] #1: OK (0.04s)
  556. 803.75 s [pandoc] biblatex-crossref-nested.md
  557. 803.78 s [pandoc] #1: OK (0.04s)
  558. 803.78 s [pandoc] 5340.md
  559. 803.79 s [pandoc] #1: OK (0.01s)
  560. 803.79 s [pandoc] figures-html.md
  561. 803.81 s [pandoc] #1: OK (0.01s)
  562. 803.82 s [pandoc] #2: OK (0.01s)
  563. 803.85 s [pandoc] #3: OK (0.03s)
  564. 803.86 s [pandoc] #4: OK (0.02s)
  565. 803.87 s [pandoc] #5: OK
  566. 803.88 s [pandoc] #6: OK
  567. 803.88 s [pandoc] 8256.md
  568. 803.89 s [pandoc] #1: OK (0.02s)
  569. 803.89 s [pandoc] biblatex-inbook.md
  570. 803.92 s [pandoc] #1: OK (0.03s)
  571. 803.92 s [pandoc] 9586.md
  572. 803.93 s [pandoc] #1: OK
  573. 803.93 s [pandoc] 9865.md
  574. 803.94 s [pandoc] #1: OK
  575. 803.95 s [pandoc] #2: OK
  576. 803.96 s [pandoc] #3: OK
  577. 803.96 s [pandoc] biblatex-averroes-hannes.md
  578. 803.98 s [pandoc] #1: OK (0.03s)
  579. 803.98 s [pandoc] 7112.md
  580. 804.00 s [pandoc] #1: OK
  581. 804.00 s [pandoc] 9792.md
  582. 804.01 s [pandoc] #1: OK (0.02s)
  583. 804.01 s [pandoc] 3407.md
  584. 804.02 s [pandoc] #1: OK
  585. 804.02 s [pandoc] #2: OK
  586. 804.02 s [pandoc] 8204.md
  587. 804.03 s [pandoc] #1: OK
  588. 804.04 s [pandoc] #2: OK
  589. 804.05 s [pandoc] #3: OK
  590. 804.05 s [pandoc] biblatex-cotton.md
  591. 804.08 s [pandoc] #1: OK (0.03s)
  592. 804.33 s [pandoc] 3585.md
  593. 804.33 s [pandoc] #1: OK
  594. 804.33 s [pandoc] #2: OK (0.01s)
  595. 804.33 s [pandoc] 4470.md
  596. 804.33 s [pandoc] #1: OK (0.02s)
  597. 804.33 s [pandoc] #2: OK
  598. 804.33 s [pandoc] #3: OK
  599. 804.33 s [pandoc] #4: OK
  600. 804.33 s [pandoc] 4164.md
  601. 804.33 s [pandoc] #1: OK
  602. 804.33 s [pandoc] #2: OK
  603. 804.33 s [pandoc] pandoc-citeproc-31.md
  604. 804.33 s [pandoc] #1: OK (0.10s)
  605. 804.33 s [pandoc] 9630.md
  606. 804.33 s [pandoc] #1: OK
  607. 804.33 s [pandoc] 7145.md
  608. 804.33 s [pandoc] #1: OK
  609. 804.33 s [pandoc] 8770-section.md
  610. 804.33 s [pandoc] #1: OK (0.01s)
  611. 804.33 s [pandoc] 5116.md
  612. 804.33 s [pandoc] #1: OK
  613. 804.34 s [pandoc] #2: OK
  614. 804.34 s [pandoc] #3: OK
  615. 804.34 s [pandoc] 5010.md
  616. 804.34 s [pandoc] #1: OK
  617. 804.34 s [pandoc] #2: OK
  618. 804.34 s [pandoc] pandoc-citeproc-27.md
  619. 804.34 s [pandoc] #1: OK (0.03s)
  620. 804.34 s [pandoc] emoji.md
  621. 804.35 s [pandoc] #1: OK
  622. 804.36 s [pandoc] #2: OK (0.01s)
  623. 804.38 s [pandoc] #3: OK (0.01s)
  624. 804.39 s [pandoc] #4: OK (0.01s)
  625. 804.39 s [pandoc] 9150.md
  626. 804.40 s [pandoc] #1: OK
  627. 804.40 s [pandoc] #2: OK
  628. 804.41 s [pandoc] #3: OK
  629. 804.41 s [pandoc] 8611.md
  630. 804.42 s [pandoc] #1: OK (0.01s)
  631. 804.42 s [pandoc] Old
  632. 804.42 s [pandoc] markdown
  633. 804.42 s [pandoc] writer
  634. 804.53 s [pandoc] basic: OK (0.11s)
  635. 804.57 s [pandoc] tables: OK (0.04s)
  636. 804.58 s [pandoc] lhs to normal: OK (0.01s)
  637. 804.60 s [pandoc] lhs to lhs: OK (0.01s)
  638. 804.69 s [pandoc] basic: OK (0.09s)
  639. 804.72 s [pandoc] tables: OK (0.03s)
  640. 804.75 s [pandoc] planets table: OK (0.03s)
  641. 804.76 s [pandoc] nordics table: OK (0.01s)
  642. 804.77 s [pandoc] students table: OK (0.01s)
  643. 804.77 s [pandoc] reader
  644. 804.86 s [pandoc] basic: OK (0.09s)
  645. 804.89 s [pandoc] tables: OK (0.02s)
  646. 804.93 s [pandoc] pipe tables: OK (0.04s)
  647. 805.04 s [pandoc] more: OK (0.08s)
  648. 805.04 s [pandoc] lhs: OK (0.03s)
  649. 805.04 s [pandoc] citations
  650. 805.06 s [pandoc] citations: OK (0.02s)
  651. 805.06 s [pandoc] rst
  652. 805.06 s [pandoc] writer
  653. 805.13 s [pandoc] basic: OK (0.07s)
  654. 805.16 s [pandoc] tables: OK (0.03s)
  655. 805.17 s [pandoc] lhs to normal: OK (0.01s)
  656. 805.18 s [pandoc] lhs to lhs: OK (0.01s)
  657. 805.18 s [pandoc] reader
  658. 805.27 s [pandoc] basic: OK (0.09s)
  659. 805.31 s [pandoc] tables: OK (0.04s)
  660. 805.33 s [pandoc] lhs: OK (0.01s)
  661. 805.33 s [pandoc] latex
  662. 805.33 s [pandoc] writer
  663. 805.43 s [pandoc] basic: OK (0.10s)
  664. 805.45 s [pandoc] tables: OK (0.03s)
  665. 805.48 s [pandoc] planets table: OK (0.02s)
  666. 805.49 s [pandoc] nordics table: OK (0.01s)
  667. 805.50 s [pandoc] students table: OK (0.01s)
  668. 805.52 s [pandoc] lhs to normal: OK (0.02s)
  669. 805.53 s [pandoc] lhs to lhs: OK (0.01s)
  670. 805.53 s [pandoc] reader
  671. 805.59 s [pandoc] basic: OK (0.07s)
  672. 805.60 s [pandoc] lhs: OK
  673. 805.60 s [pandoc] html
  674. 805.60 s [pandoc] writer
  675. 805.71 s [pandoc] basic: OK (0.11s)
  676. 805.75 s [pandoc] tables: OK (0.03s)
  677. 805.77 s [pandoc] planets table: OK (0.03s)
  678. 805.79 s [pandoc] nordics table: OK (0.01s)
  679. 805.80 s [pandoc] students table: OK (0.01s)
  680. 805.89 s [pandoc] basic: OK (0.09s)
  681. 805.93 s [pandoc] tables: OK (0.04s)
  682. 805.96 s [pandoc] planets table: OK (0.03s)
  683. 805.97 s [pandoc] nordics table: OK (0.01s)
  684. 805.98 s [pandoc] students table: OK (0.01s)
  685. 806.00 s [pandoc] lhs to normal: OK (0.02s)
  686. 806.20 s [pandoc] lhs to lhs: OK (0.20s)
  687. 806.29 s [pandoc] reader: OK (0.09s)
  688. 806.29 s [pandoc] s5
  689. 806.32 s [pandoc] s5 writer (basic): OK (0.03s)
  690. 806.34 s [pandoc] s5 writer (fancy): OK (0.02s)
  691. 806.35 s [pandoc] html4 writer (fragment): OK (0.01s)
  692. 806.38 s [pandoc] html4 writer (inserts): OK (0.03s)
  693. 806.38 s [pandoc] textile
  694. 806.38 s [pandoc] writer
  695. 806.46 s [pandoc] basic: OK (0.08s)
  696. 806.48 s [pandoc] tables: OK (0.02s)
  697. 806.51 s [pandoc] reader: OK (0.03s)
  698. 806.51 s [pandoc] djot
  699. 806.51 s [pandoc] writer
  700. 806.58 s [pandoc] basic: OK (0.07s)
  701. 806.61 s [pandoc] tables: OK (0.03s)
  702. 806.64 s [pandoc] reader: OK (0.03s)
  703. 806.64 s [pandoc] docbook
  704. 806.64 s [pandoc] writer
  705. 806.73 s [pandoc] basic: OK (0.09s)
  706. 806.76 s [pandoc] tables: OK (0.03s)
  707. 806.84 s [pandoc] reader: OK (0.08s)
  708. 806.84 s [pandoc] reader: OK
  709. 806.86 s [pandoc] reader: OK (0.01s)
  710. 806.86 s [pandoc] docbook5
  711. 806.86 s [pandoc] writer
  712. 806.95 s [pandoc] basic: OK (0.09s)
  713. 806.98 s [pandoc] tables: OK (0.03s)
  714. 806.98 s [pandoc] jats
  715. 806.98 s [pandoc] writer
  716. 806.98 s [pandoc] jats_archiving
  717. 807.07 s [pandoc] basic: OK (0.10s)
  718. 807.10 s [pandoc] tables: OK (0.03s)
  719. 807.13 s [pandoc] planets table: OK (0.02s)
  720. 807.14 s [pandoc] nordics table: OK (0.01s)
  721. 807.15 s [pandoc] students table: OK
  722. 807.15 s [pandoc] jats_articleauthoring
  723. 807.23 s [pandoc] basic: OK (0.09s)
  724. 807.26 s [pandoc] tables: OK (0.03s)
  725. 807.26 s [pandoc] jats_publishing
  726. 807.35 s [pandoc] basic: OK (0.09s)
  727. 807.38 s [pandoc] tables: OK (0.03s)
  728. 807.45 s [pandoc] reader: OK (0.07s)
  729. 807.45 s [pandoc] jira
  730. 807.45 s [pandoc] writer
  731. 807.52 s [pandoc] basic: OK (0.08s)
  732. 807.55 s [pandoc] tables: OK (0.03s)
  733. 807.58 s [pandoc] reader: OK (0.03s)
  734. 807.58 s [pandoc] native
  735. 807.58 s [pandoc] writer
  736. 807.68 s [pandoc] basic: OK (0.10s)
  737. 807.72 s [pandoc] tables: OK (0.05s)
  738. 807.83 s [pandoc] reader: OK (0.11s)
  739. 807.83 s [pandoc] fb2
  740. 807.84 s [pandoc] basic: OK (0.01s)
  741. 807.84 s [pandoc] titles: OK
  742. 807.86 s [pandoc] images: OK (0.01s)
  743. 807.87 s [pandoc] images-embedded: OK (0.01s)
  744. 807.88 s [pandoc] math: OK
  745. 807.88 s [pandoc] meta: OK
  746. 807.91 s [pandoc] tables: OK (0.03s)
  747. 807.99 s [pandoc] testsuite: OK (0.07s)
  748. 807.99 s [pandoc] mediawiki
  749. 807.99 s [pandoc] writer
  750. 808.07 s [pandoc] basic: OK (0.08s)
  751. 808.09 s [pandoc] tables: OK (0.02s)
  752. 808.15 s [pandoc] basic: OK (0.06s)
  753. 808.18 s [pandoc] tables: OK (0.03s)
  754. 808.21 s [pandoc] planets table: OK (0.02s)
  755. 808.22 s [pandoc] nordics table: OK (0.01s)
  756. 808.23 s [pandoc] students table: OK
  757. 808.28 s [pandoc] reader: OK (0.05s)
  758. 808.28 s [pandoc] vimwiki
  759. 808.35 s [pandoc] reader: OK (0.07s)
  760. 808.35 s [pandoc] dokuwiki
  761. 808.35 s [pandoc] writer
  762. 808.42 s [pandoc] basic: OK (0.07s)
  763. 808.44 s [pandoc] tables: OK (0.02s)
  764. 808.45 s [pandoc] inline_formatting: OK (0.01s)
  765. 808.46 s [pandoc] multiblock table: OK
  766. 808.47 s [pandoc] external images: OK
  767. 808.47 s [pandoc] opml
  768. 808.56 s [pandoc] basic: OK (0.09s)
  769. 808.57 s [pandoc] reader: OK (0.01s)
  770. 808.57 s [pandoc] haddock
  771. 808.57 s [pandoc] writer
  772. 808.64 s [pandoc] basic: OK (0.07s)
  773. 808.67 s [pandoc] tables: OK (0.03s)
  774. 808.68 s [pandoc] reader: OK (0.01s)
  775. 808.68 s [pandoc] txt2tags
  776. 808.76 s [pandoc] reader: OK (0.08s)
  777. 808.76 s [pandoc] epub
  778. 808.82 s [pandoc] features: OK (0.06s)
  779. 808.92 s [pandoc] wasteland: OK (0.09s)
  780. 809.05 s [pandoc] formatting: OK (0.13s)
  781. 809.05 s [pandoc] twiki
  782. 809.09 s [pandoc] reader: OK (0.04s)
  783. 809.21 s [pandoc] tikiwiki
  784. 809.21 s [pandoc] reader: OK (0.03s)
  785. 809.21 s [pandoc] other writers
  786. 809.21 s [pandoc] opendocument
  787. 809.21 s [pandoc] basic: OK (0.09s)
  788. 809.25 s [pandoc] tables: OK (0.04s)
  789. 809.25 s [pandoc] context
  790. 809.32 s [pandoc] basic: OK (0.08s)
  791. 809.35 s [pandoc] tables: OK (0.03s)
  792. 809.35 s [pandoc] texinfo
  793. 809.43 s [pandoc] basic: OK (0.08s)
  794. 809.45 s [pandoc] tables: OK (0.02s)
  795. 809.45 s [pandoc] icml
  796. 809.55 s [pandoc] basic: OK (0.10s)
  797. 809.65 s [pandoc] tables: OK (0.10s)
  798. 809.65 s [pandoc] tei
  799. 809.72 s [pandoc] basic: OK (0.07s)
  800. 809.75 s [pandoc] tables: OK (0.03s)
  801. 809.75 s [pandoc] man
  802. 809.82 s [pandoc] basic: OK (0.07s)
  803. 809.85 s [pandoc] tables: OK (0.03s)
  804. 809.85 s [pandoc] plain
  805. 809.93 s [pandoc] basic: OK (0.08s)
  806. 809.95 s [pandoc] tables: OK (0.03s)
  807. 809.95 s [pandoc] asciidoc
  808. 810.03 s [pandoc] basic: OK (0.07s)
  809. 810.05 s [pandoc] tables: OK (0.02s)
  810. 810.05 s [pandoc] asciidoc_legacy
  811. 810.11 s [pandoc] basic: OK (0.06s)
  812. 810.14 s [pandoc] tables: OK (0.03s)
  813. 810.14 s [pandoc] xwiki
  814. 810.21 s [pandoc] basic: OK (0.06s)
  815. 810.23 s [pandoc] tables: OK (0.03s)
  816. 810.23 s [pandoc] zimwiki
  817. 810.30 s [pandoc] basic: OK (0.07s)
  818. 810.33 s [pandoc] tables: OK (0.03s)
  819. 810.33 s [pandoc] writers-lang-and-dir
  820. 810.35 s [pandoc] latex: OK (0.03s)
  821. 810.37 s [pandoc] context: OK (0.02s)
  822. 810.37 s [pandoc] muse
  823. 810.37 s [pandoc] writer
  824. 810.46 s [pandoc] basic: OK (0.09s)
  825. 810.49 s [pandoc] tables: OK (0.03s)
  826. 810.49 s [pandoc] ms
  827. 810.57 s [pandoc] basic: OK (0.08s)
  828. 810.60 s [pandoc] tables: OK (0.03s)
  829. 810.60 s [pandoc] typst
  830. 810.60 s [pandoc] writer
  831. 810.63 s [haskell-language-server] Preprocessing library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0...
  832. 810.63 s [haskell-language-server] Building library 'ghcide-bench-lib' for haskell-language-server-2.12.0.0...
  833. 810.69 s [pandoc] basic: OK (0.09s)
  834. 810.73 s [pandoc] tables: OK (0.04s)
  835. 810.74 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 )
  836. 810.81 s [pandoc] basic: OK (0.08s)
  837. 810.84 s [pandoc] tables: OK (0.03s)
  838. 810.86 s [pandoc] planets table: OK (0.02s)
  839. 810.87 s [pandoc] nordics table: OK (0.01s)
  840. 810.88 s [pandoc] students table: OK
  841. 810.88 s [pandoc] reader
  842. 811.09 s [pandoc] typst-reader: OK (0.21s)
  843. 811.09 s [pandoc] creole
  844. 811.12 s [pandoc] reader: OK (0.03s)
  845. 811.12 s [pandoc] man
  846. 811.15 s [pandoc] reader: OK (0.03s)
  847. 811.15 s [pandoc] org
  848. 811.17 s [pandoc] reader: OK (0.02s)
  849. 811.17 s [pandoc] writer
  850. 811.24 s [pandoc] basic: OK (0.07s)
  851. 811.27 s [pandoc] tables: OK (0.03s)
  852. 811.27 s [pandoc] rtf
  853. 811.27 s [pandoc] writer
  854. 811.37 s [pandoc] basic: OK (0.10s)
  855. 811.40 s [pandoc] tables: OK (0.03s)
  856. 811.40 s [pandoc] endnotexml
  857. 811.41 s [pandoc] reader: OK
  858. 811.41 s [pandoc] ipynb
  859. 811.43 s [pandoc] reader: OK (0.01s)
  860. 811.44 s [pandoc] writer: OK (0.01s)
  861. 811.45 s [pandoc] reader: OK
  862. 811.46 s [pandoc] writer: OK (0.01s)
  863. 811.48 s [pandoc] reader: OK (0.02s)
  864. 811.48 s [pandoc] markua
  865. 811.48 s [pandoc] writer
  866. 811.56 s [pandoc] basic: OK (0.07s)
  867. 811.59 s [pandoc] tables: OK (0.03s)
  868. 811.59 s [pandoc] ansi
  869. 811.61 s [pandoc] ansi: OK (0.03s)
  870. 811.61 s [pandoc] pod
  871. 811.62 s [pandoc] pod: OK (0.01s)
  872. 811.62 s [pandoc] Shared
  873. 811.62 s [pandoc] compactifyDL
  874. 811.62 s [pandoc] compactifyDL with empty def: OK
  875. 811.62 s [pandoc] collapseFilePath
  876. 811.62 s [pandoc] collapse: OK
  877. 811.62 s [pandoc] collapse: OK
  878. 811.62 s [pandoc] collapse: OK
  879. 811.62 s [pandoc] collapse: OK
  880. 811.62 s [pandoc] collapse: OK
  881. 811.62 s [pandoc] collapse: OK
  882. 811.62 s [pandoc] collapse: OK
  883. 811.62 s [pandoc] collapse: OK
  884. 811.62 s [pandoc] collapse: OK
  885. 811.62 s [pandoc] collapse: OK
  886. 811.62 s [pandoc] collapse: OK
  887. 811.62 s [pandoc] collapse: OK
  888. 811.62 s [pandoc] collapse: OK
  889. 811.62 s [pandoc] collapse: OK
  890. 811.62 s [pandoc] collapse: OK
  891. 811.62 s [pandoc] collapse: OK
  892. 811.62 s [pandoc] collapse: OK
  893. 811.62 s [pandoc] collapse: OK
  894. 811.62 s [pandoc] toLegacyTable
  895. 811.62 s [pandoc] decomposes a table with head: OK
  896. 811.62 s [pandoc] decomposes a table without head: OK
  897. 811.62 s [pandoc] decomposes the table from issue 7683: OK
  898. 811.62 s [pandoc] table of contents
  899. 811.62 s [pandoc] empty case: OK
  900. 811.62 s [pandoc] no headers: OK
  901. 811.62 s [pandoc] unlinked header: OK
  902. 811.62 s [pandoc] linked header: OK
  903. 811.62 s [pandoc] nested headlines: OK
  904. 811.62 s [pandoc] only referenced headers: OK
  905. 811.63 s [pandoc] section id used as backup: OK
  906. 811.63 s [pandoc] makeSections
  907. 811.77 s [pandoc] makeSections is idempotent: OK (0.15s)
  908. 811.77 s [pandoc] +++ OK, passed 100 tests.
  909. 811.77 s [pandoc] makeSections is idempotent for test case: OK
  910. 811.77 s [pandoc] MediaBag
  911. 811.78 s [pandoc] test fillMediaBag & extractMedia: OK
  912. 811.79 s [pandoc] Writers
  913. 811.79 s [pandoc] Native
  914. 812.41 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 )
  915. 813.11 s [pandoc] p_write_rt: OK (1.32s)
  916. 813.11 s [pandoc] +++ OK, passed 100 tests.
  917. 813.30 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  918. 813.30 s [haskell-language-server] Pattern match(es) are non-exhaustive
  919. 813.30 s [haskell-language-server] In a pattern binding:
  920. 813.30 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  921. 813.30 s [haskell-language-server] Failure _
  922. 813.30 s [haskell-language-server] CompletionInvoked _
  923. 813.30 s [haskell-language-server] |
  924. 813.30 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  925. 813.30 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  926. 813.30 s [haskell-language-server]
  927. 813.30 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  928. 813.30 s [haskell-language-server] Pattern match(es) are non-exhaustive
  929. 813.30 s [haskell-language-server] In a lambda abstraction:
  930. 813.30 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  931. 813.30 s [haskell-language-server] ‘ProcessHandle’ not matched:
  932. 813.30 s [haskell-language-server] Nothing _ _ _
  933. 813.30 s [haskell-language-server] (Just _) Nothing _ _
  934. 813.30 s [haskell-language-server] (Just _) (Just _) Nothing _
  935. 813.30 s [haskell-language-server] |
  936. 813.30 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  937. 813.30 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  938. 813.30 s [haskell-language-server]
  939. 813.30 s [haskell-language-server] ghcide-bench/src/Experiments.hs:630:37: warning: [GHC-63394] [-Wx-partial]
  940. 813.30 s [haskell-language-server] In the use of ‘head’
  941. 813.30 s [haskell-language-server] (imported from Data.List, but defined in GHC.Internal.List):
  942. 813.30 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"."
  943. 813.30 s [haskell-language-server] |
  944. 813.30 s [haskell-language-server] 630 | let DocumentPositions{..} = head docs
  945. 813.30 s [haskell-language-server] | ^^^^
  946. 813.30 s [haskell-language-server]
  947. 813.31 s [pandoc] p_write_blocks_rt: OK (0.21s)
  948. 813.31 s [pandoc] +++ OK, passed 100 tests.
  949. 813.31 s [pandoc] ConTeXt
  950. 813.31 s [pandoc] inline code
  951. 813.31 s [pandoc] with '}': OK
  952. 813.31 s [pandoc] without '}': OK
  953. 813.31 s [pandoc] span with ID: OK
  954. 813.31 s [pandoc] code property: OK
  955. 813.31 s [pandoc] +++ OK, passed 100 tests.
  956. 813.31 s [pandoc] headers
  957. 813.31 s [pandoc] level 1: OK
  958. 813.31 s [pandoc] Section as top-level: OK
  959. 813.31 s [pandoc] bullet lists
  960. 813.31 s [pandoc] nested: OK
  961. 813.31 s [pandoc] natural tables
  962. 813.31 s [pandoc] table with header and caption: OK
  963. 813.31 s [pandoc] LaTeX
  964. 813.31 s [pandoc] code blocks
  965. 813.31 s [pandoc] in footnotes: OK
  966. 813.31 s [pandoc] identifier: OK
  967. 813.31 s [pandoc] no identifier: OK
  968. 813.31 s [pandoc] definition lists
  969. 813.31 s [pandoc] with internal link: OK
  970. 813.31 s [pandoc] math
  971. 813.31 s [pandoc] escape |: OK
  972. 813.31 s [pandoc] headers
  973. 813.31 s [pandoc] unnumbered header: OK
  974. 813.31 s [pandoc] in list item: OK
  975. 813.31 s [pandoc] in definition list item: OK
  976. 813.31 s [pandoc] containing image: OK
  977. 813.31 s [pandoc] inline code
  978. 813.31 s [pandoc] struck out and highlighted: OK
  979. 813.31 s [pandoc] struck out and not highlighted: OK
  980. 813.31 s [pandoc] single quotes: OK
  981. 813.31 s [pandoc] backtick: OK
  982. 813.31 s [pandoc] inline note
  983. 813.31 s [pandoc] Big note in emph: OK
  984. 813.31 s [pandoc] Big note in strong: OK
  985. 813.31 s [pandoc] Big note in underline: OK
  986. 813.31 s [pandoc] Big note in strikeout: OK
  987. 813.31 s [pandoc] Small note in emph: OK
  988. 813.31 s [pandoc] Big note nested in emph and strong: OK
  989. 813.31 s [pandoc] Two Big notes in emph: OK
  990. 813.31 s [pandoc] writer options
  991. 813.31 s [pandoc] top-level division
  992. 813.31 s [pandoc] sections as top-level: OK
  993. 813.31 s [pandoc] chapters as top-level: OK
  994. 813.31 s [pandoc] parts as top-level: OK
  995. 813.31 s [pandoc] default top-level: OK
  996. 813.31 s [pandoc] sections as top-level in beamer: OK
  997. 813.32 s [pandoc] chapters are as part in beamer: OK
  998. 813.32 s [pandoc] parts as top-level in beamer: OK
  999. 813.32 s [pandoc] default top-level in beamer: OK
  1000. 813.32 s [pandoc] part top-level, section not in toc: OK
  1001. 813.32 s [pandoc] HTML
  1002. 813.32 s [pandoc] inline code
  1003. 813.32 s [pandoc] basic: OK
  1004. 813.32 s [pandoc] haskell: OK
  1005. 813.73 s [pandoc] nolanguage: OK (0.41s)
  1006. 813.73 s [pandoc] images
  1007. 813.73 s [pandoc] alt with formatting: OK
  1008. 813.73 s [pandoc] blocks
  1009. 813.73 s [pandoc] definition list with empty <dt>: OK
  1010. 813.73 s [pandoc] heading with disallowed attributes: OK
  1011. 813.73 s [pandoc] quotes
  1012. 813.73 s [pandoc] quote with cite attribute (without q-tags): OK
  1013. 813.73 s [pandoc] quote with cite attribute (with q-tags): OK
  1014. 813.73 s [pandoc] code
  1015. 813.73 s [pandoc] code should be rendered correctly: OK
  1016. 813.73 s [pandoc] sample
  1017. 813.73 s [pandoc] sample should be rendered correctly: OK
  1018. 813.73 s [pandoc] variable
  1019. 813.73 s [pandoc] variable should be rendered correctly: OK
  1020. 813.73 s [pandoc] sample with style
  1021. 813.73 s [pandoc] samp should wrap highlighted code: OK
  1022. 813.73 s [pandoc] variable with style
  1023. 813.73 s [pandoc] var should wrap highlighted code: OK
  1024. 813.74 s [pandoc] footnotes
  1025. 813.74 s [pandoc] at the end of a document: OK
  1026. 813.74 s [pandoc] at the end of a block: OK
  1027. 813.74 s [pandoc] at the end of a section: OK
  1028. 813.74 s [pandoc] at the end of a section, with section divs: OK
  1029. 813.74 s [pandoc] JATS
  1030. 813.74 s [pandoc] inline code
  1031. 813.74 s [pandoc] basic: OK
  1032. 813.74 s [pandoc] block code
  1033. 813.74 s [pandoc] basic: OK
  1034. 813.74 s [pandoc] lang: OK
  1035. 813.74 s [pandoc] images
  1036. 813.74 s [pandoc] basic: OK
  1037. 813.74 s [pandoc] inlines
  1038. 813.74 s [pandoc] Emphasis: OK
  1039. 813.74 s [pandoc] footnote in articleauthoring tag set: OK
  1040. 813.74 s [pandoc] bullet list
  1041. 813.74 s [pandoc] plain items: OK
  1042. 813.74 s [pandoc] item with implicit figure: OK
  1043. 813.74 s [pandoc] definition lists
  1044. 813.74 s [pandoc] with internal link: OK
  1045. 813.74 s [pandoc] math
  1046. 813.74 s [pandoc] escape |: OK
  1047. 813.74 s [pandoc] headers
  1048. 813.74 s [pandoc] unnumbered header: OK
  1049. 813.74 s [pandoc] unnumbered sub header: OK
  1050. 813.74 s [pandoc] containing image: OK
  1051. 813.74 s [pandoc] ids
  1052. 813.74 s [pandoc] non-ASCII in header ID: OK
  1053. 813.74 s [pandoc] disallowed symbol in header id: OK
  1054. 813.74 s [pandoc] disallowed symbols in internal link target: OK
  1055. 813.74 s [pandoc] code id starting with a number: OK
  1056. 813.74 s [pandoc] spans
  1057. 813.74 s [pandoc] unwrapped if no attributes given: OK
  1058. 813.74 s [pandoc] converted to named-content element if class given: OK
  1059. 813.74 s [pandoc] unwrapped if styled-content element would have no at...: OK
  1060. 813.74 s [pandoc] use content-type attribute if present: OK
  1061. 813.74 s [pandoc] Jira
  1062. 813.74 s [pandoc] inlines
  1063. 813.74 s [pandoc] underlined text: OK
  1064. 813.74 s [pandoc] image with attributes: OK
  1065. 813.74 s [pandoc] links
  1066. 813.74 s [pandoc] external link: OK
  1067. 813.74 s [pandoc] external link without description: OK
  1068. 813.74 s [pandoc] email link: OK
  1069. 813.74 s [pandoc] email link without description: OK
  1070. 813.74 s [pandoc] attachment link: OK
  1071. 813.74 s [pandoc] attachment link without description: OK
  1072. 813.74 s [pandoc] user link: OK
  1073. 813.74 s [pandoc] user link with user as description: OK
  1074. 813.74 s [pandoc] 'smart' link: OK
  1075. 813.74 s [pandoc] 'smart' card: OK
  1076. 813.74 s [pandoc] spans
  1077. 813.74 s [pandoc] id is used as anchor: OK
  1078. 813.74 s [pandoc] use `color` attribute: OK
  1079. 813.74 s [pandoc] code
  1080. 813.74 s [pandoc] code block with known language: OK
  1081. 813.74 s [pandoc] code block without language: OK
  1082. 813.74 s [pandoc] blocks
  1083. 813.74 s [pandoc] div
  1084. 813.74 s [pandoc] empty attributes: OK
  1085. 813.74 s [pandoc] just identifier: OK
  1086. 813.74 s [pandoc] with class 'panel': OK
  1087. 813.74 s [pandoc] panel with id: OK
  1088. 813.74 s [pandoc] title attribute: OK
  1089. 813.74 s [pandoc] nested panels: OK
  1090. 813.74 s [pandoc] Docbook
  1091. 813.74 s [pandoc] inline elements
  1092. 813.74 s [pandoc] links
  1093. 813.74 s [pandoc] db4 external link: OK
  1094. 813.74 s [pandoc] db5 external link: OK
  1095. 813.74 s [pandoc] anchor: OK
  1096. 813.74 s [pandoc] automatic anchor: OK
  1097. 813.74 s [pandoc] line blocks
  1098. 813.74 s [pandoc] none: OK
  1099. 813.74 s [pandoc] basic: OK
  1100. 813.74 s [pandoc] blockquote: OK
  1101. 813.74 s [pandoc] footnote: OK
  1102. 813.74 s [pandoc] divs
  1103. 813.74 s [pandoc] admonition: OK
  1104. 813.74 s [pandoc] admonition-with-title: OK
  1105. 813.74 s [pandoc] admonition-with-title-in-para: OK
  1106. 813.74 s [pandoc] single-child: OK
  1107. 813.74 s [pandoc] single-literal-child: OK
  1108. 813.74 s [pandoc] multiple-children: OK
  1109. 813.74 s [pandoc] compact lists
  1110. 813.74 s [pandoc] bullet
  1111. 813.74 s [pandoc] compact: OK
  1112. 813.74 s [pandoc] loose: OK
  1113. 813.74 s [pandoc] ordered
  1114. 813.75 s [pandoc] compact: OK
  1115. 813.75 s [pandoc] loose: OK
  1116. 813.75 s [pandoc] definition
  1117. 813.75 s [pandoc] compact: OK
  1118. 813.75 s [pandoc] loose: OK
  1119. 813.75 s [pandoc] writer options
  1120. 813.75 s [pandoc] top-level division
  1121. 813.75 s [pandoc] sections as top-level: OK
  1122. 813.75 s [pandoc] chapters as top-level: OK
  1123. 813.75 s [pandoc] parts as top-level: OK
  1124. 813.75 s [pandoc] default top-level: OK
  1125. 813.75 s [pandoc] section attributes
  1126. 813.75 s [pandoc] sections with attributes (db5): OK
  1127. 813.75 s [pandoc] sections with attributes (db4): OK
  1128. 813.75 s [pandoc] Markdown
  1129. 813.75 s [pandoc] indented code after list: OK
  1130. 813.75 s [pandoc] list with tight sublist: OK
  1131. 813.75 s [pandoc] emph/strong with spaces (#10696): OK
  1132. 813.75 s [pandoc] note and reference location
  1133. 813.75 s [pandoc] footnotes at the end of a document: OK
  1134. 813.75 s [pandoc] footnotes at the end of blocks: OK
  1135. 813.75 s [pandoc] footnotes and reference links at the end of blocks: OK
  1136. 813.75 s [pandoc] footnotes at the end of section: OK
  1137. 813.75 s [pandoc] Shortcut reference links
  1138. 813.75 s [pandoc] Simple link (shortcutable): OK
  1139. 813.75 s [pandoc] Followed by another link (unshortcutable): OK
  1140. 813.75 s [pandoc] Followed by space and another link (unshortcutable): OK
  1141. 813.75 s [pandoc] Reference link is used multiple times (unshortcutable): OK
  1142. 813.75 s [pandoc] Reference link is used multiple times (unshortcutable): OK
  1143. 813.75 s [pandoc] Reference link is followed by text in brackets: OK
  1144. 813.75 s [pandoc] Reference link is followed by space and text in brac...: OK
  1145. 813.75 s [pandoc] Reference link is followed by RawInline: OK
  1146. 813.75 s [pandoc] Reference link is followed by space and RawInline: OK
  1147. 813.75 s [pandoc] Reference link is followed by RawInline with space: OK
  1148. 813.75 s [pandoc] Reference link is followed by citation: OK
  1149. 813.75 s [pandoc] Reference link is followed by space and citation: OK
  1150. 813.75 s [pandoc] Org
  1151. 813.75 s [pandoc] links
  1152. 813.75 s [pandoc] simple link: OK
  1153. 813.75 s [pandoc] internal link to anchor: OK
  1154. 813.75 s [pandoc] lists
  1155. 813.75 s [pandoc] bullet task list: OK
  1156. 813.75 s [pandoc] ordered task list: OK
  1157. 813.75 s [pandoc] ordered task list with starting number: OK
  1158. 813.75 s [pandoc] bullet without task_lists: OK
  1159. 813.75 s [pandoc] code blocks
  1160. 813.75 s [pandoc] identifier: OK
  1161. 813.75 s [pandoc] attributes: OK
  1162. 813.75 s [pandoc] Plain
  1163. 813.75 s [pandoc] strongly emphasized text to uppercase: OK
  1164. 813.75 s [pandoc] AsciiDoc
  1165. 813.75 s [pandoc] emphasis
  1166. 813.75 s [pandoc] emph word before: OK
  1167. 813.75 s [pandoc] emph word after: OK
  1168. 813.75 s [pandoc] emph quoted: OK
  1169. 813.75 s [pandoc] strong word before: OK
  1170. 813.75 s [pandoc] strong word after: OK
  1171. 813.75 s [pandoc] strong quoted: OK
  1172. 813.75 s [pandoc] blocks
  1173. 813.75 s [pandoc] code block without line numbers: OK
  1174. 813.75 s [pandoc] code block with line numbers: OK
  1175. 813.75 s [pandoc] sidebar block: OK
  1176. 813.75 s [pandoc] tables
  1177. 813.75 s [pandoc] empty cells: OK
  1178. 813.75 s [pandoc] multiblock cells: OK
  1179. 813.75 s [pandoc] lists
  1180. 813.75 s [pandoc] bullet task list: OK
  1181. 813.75 s [pandoc] Docx
  1182. 813.75 s [pandoc] inlines
  1183. 813.80 s [pandoc] font formatting: OK (0.05s)
  1184. 813.85 s [pandoc] hyperlinks: OK (0.05s)
  1185. 813.92 s [pandoc] inline image: OK (0.06s)
  1186. 813.99 s [pandoc] inline images: OK (0.07s)
  1187. 814.02 s [pandoc] handling unicode input: OK (0.04s)
  1188. 814.06 s [pandoc] inline code: OK (0.03s)
  1189. 814.09 s [pandoc] inline code in subscript and superscript: OK (0.03s)
  1190. 814.22 s [pandoc] blocks
  1191. 814.22 s [pandoc] headers: OK (0.03s)
  1192. 814.22 s [pandoc] nested anchor spans in header: OK (0.04s)
  1193. 814.22 s [pandoc] lists: OK (0.05s)
  1194. 814.27 s [pandoc] lists continuing after interruption: OK (0.05s)
  1195. 814.41 s [pandoc] lists restarting after interruption: OK (0.14s)
  1196. 814.46 s [pandoc] lists with multiple initial list levels: OK (0.05s)
  1197. 814.52 s [pandoc] lists with div bullets: OK (0.05s)
  1198. 814.56 s [pandoc] definition lists: OK (0.04s)
  1199. 814.61 s [pandoc] task lists: OK (0.05s)
  1200. 814.65 s [pandoc] issue 9994: OK (0.04s)
  1201. 814.69 s [pandoc] footnotes and endnotes: OK (0.04s)
  1202. 814.73 s [pandoc] links in footnotes and endnotes: OK (0.04s)
  1203. 814.77 s [pandoc] blockquotes: OK (0.04s)
  1204. 814.82 s [pandoc] tables: OK (0.05s)
  1205. 814.87 s [pandoc] tables without explicit column widths: OK (0.05s)
  1206. 815.00 s [pandoc] tables with lists in cells: OK (0.13s)
  1207. 815.05 s [pandoc] tables with one row: OK (0.06s)
  1208. 815.12 s [pandoc] tables separated with RawBlock: OK (0.06s)
  1209. 815.17 s [pandoc] code block: OK (0.05s)
  1210. 815.22 s [pandoc] raw OOXML blocks: OK (0.05s)
  1211. 815.26 s [pandoc] raw bookmark markers: OK (0.05s)
  1212. 815.26 s [pandoc] track changes
  1213. 815.31 s [pandoc] insertion: OK (0.04s)
  1214. 815.40 s [pandoc] deletion: OK (0.10s)
  1215. 815.47 s [pandoc] move text: OK (0.05s)
  1216. 815.52 s [pandoc] comments: OK (0.06s)
  1217. 815.57 s [pandoc] scrubbed metadata: OK (0.05s)
  1218. 815.57 s [pandoc] custom styles
  1219. 815.61 s [pandoc] custom styles without reference.docx: OK (0.05s)
  1220. 815.74 s [pandoc] custom styles with reference.docx: OK (0.12s)
  1221. 815.80 s [pandoc] suppress custom style for headers and blockquotes: OK (0.07s)
  1222. 815.80 s [pandoc] metadata
  1223. 815.85 s [pandoc] document properties (core, custom): OK (0.04s)
  1224. 815.89 s [pandoc] document properties (short description): OK (0.04s)
  1225. 815.89 s [pandoc] RST
  1226. 815.89 s [pandoc] rubrics
  1227. 815.89 s [pandoc] in list item: OK
  1228. 815.89 s [pandoc] in definition list item: OK
  1229. 815.89 s [pandoc] in block quote: OK
  1230. 815.89 s [pandoc] with id: OK
  1231. 815.89 s [pandoc] with id class: OK
  1232. 815.89 s [pandoc] ligatures
  1233. 815.89 s [pandoc] a list is closed by a comment before a quote: OK
  1234. 815.89 s [pandoc] flatten
  1235. 815.89 s [pandoc] emerges nested styles as expected: OK
  1236. 815.89 s [pandoc] could introduce trailing spaces: OK
  1237. 815.89 s [pandoc] preserves empty parents: OK
  1238. 815.89 s [pandoc] inlines
  1239. 815.89 s [pandoc] are removed when empty: OK
  1240. 815.89 s [pandoc] do not cause the introduction of extra spaces when r...: OK
  1241. 815.89 s [pandoc] spaces are stripped at beginning and end: OK
  1242. 815.89 s [pandoc] single space stripped: OK
  1243. 815.89 s [pandoc] give priority to strong style over emphasis: OK
  1244. 815.89 s [pandoc] links are not elided by outer style: OK
  1245. 815.89 s [pandoc] RST inlines cannot start nor end with spaces: OK
  1246. 815.89 s [pandoc] keeps quotes: OK
  1247. 815.89 s [pandoc] backslash inserted between str and code: OK
  1248. 815.89 s [pandoc] headings
  1249. 815.89 s [pandoc] normal heading: OK
  1250. 815.89 s [pandoc] heading levels: OK
  1251. 815.89 s [pandoc] minimal heading levels: OK
  1252. 815.89 s [pandoc] subtitle: OK
  1253. 815.89 s [pandoc] TEI
  1254. 815.89 s [pandoc] block elements
  1255. 815.89 s [pandoc] para: OK
  1256. 815.89 s [pandoc] inlines
  1257. 815.89 s [pandoc] Emphasis: OK
  1258. 815.89 s [pandoc] SingleQuoted: OK
  1259. 815.89 s [pandoc] DoubleQuoted: OK
  1260. 815.89 s [pandoc] NestedQuoted: OK
  1261. 815.89 s [pandoc] markua
  1262. 815.89 s [pandoc] simple blurb/aside
  1263. 815.89 s [pandoc] blurb: OK
  1264. 815.89 s [pandoc] aside: OK
  1265. 815.89 s [pandoc] multiclass blurb/aside
  1266. 815.89 s [pandoc] blurb: OK
  1267. 815.89 s [pandoc] aside: OK
  1268. 815.89 s [pandoc] Muse
  1269. 815.89 s [pandoc] block elements
  1270. 815.89 s [pandoc] plain: OK
  1271. 815.89 s [pandoc] paragraphs
  1272. 815.89 s [pandoc] single paragraph: OK
  1273. 815.89 s [pandoc] two paragraphs: OK
  1274. 815.89 s [pandoc] line block: OK
  1275. 815.89 s [pandoc] code block: OK
  1276. 815.89 s [pandoc] html raw block: OK
  1277. 815.89 s [pandoc] block quote: OK
  1278. 815.89 s [pandoc] lists
  1279. 815.89 s [pandoc] simple lists
  1280. 815.89 s [pandoc] ordered list: OK
  1281. 815.89 s [pandoc] ordered list with Roman numerals: OK
  1282. 815.89 s [pandoc] bullet list: OK
  1283. 815.89 s [pandoc] definition list: OK
  1284. 815.89 s [pandoc] definition list with multiple descriptions: OK
  1285. 815.89 s [pandoc] definition list with empty term: OK
  1286. 815.89 s [pandoc] definition list terms starting with space: OK
  1287. 815.89 s [pandoc] definition list terms starting with list markers: OK
  1288. 815.89 s [pandoc] sequential lists
  1289. 815.89 s [pandoc] bullet lists: OK
  1290. 815.89 s [pandoc] ordered lists of the same style: OK
  1291. 815.89 s [pandoc] ordered lists with equal styles: OK
  1292. 815.89 s [pandoc] bullet and ordered lists: OK
  1293. 815.89 s [pandoc] different style ordered lists: OK
  1294. 815.89 s [pandoc] nested lists
  1295. 815.89 s [pandoc] nested ordered list: OK
  1296. 815.89 s [pandoc] nested bullet lists: OK
  1297. 815.89 s [pandoc] nested definition lists: OK
  1298. 815.89 s [pandoc] list item starting with list: OK
  1299. 815.89 s [pandoc] List inside block quote: OK
  1300. 815.89 s [pandoc] headings
  1301. 815.89 s [pandoc] normal heading: OK
  1302. 815.89 s [pandoc] heading levels: OK
  1303. 815.89 s [pandoc] heading with ID: OK
  1304. 815.89 s [pandoc] empty heading: OK
  1305. 815.89 s [pandoc] horizontal rule: OK
  1306. 815.89 s [pandoc] escape horizontal rule: OK
  1307. 815.89 s [pandoc] escape long horizontal rule: OK
  1308. 815.89 s [pandoc] don't escape horizontal inside paragraph: OK
  1309. 815.89 s [pandoc] escape nonbreaking space: OK
  1310. 815.89 s [pandoc] escape > in the beginning of line: OK
  1311. 815.89 s [pandoc] escape string with > and space in the beginning of l...: OK
  1312. 815.89 s [pandoc] tables
  1313. 815.89 s [pandoc] table without header: OK
  1314. 815.89 s [pandoc] table with header: OK
  1315. 815.89 s [pandoc] table with header and caption: OK
  1316. 815.89 s [pandoc] table inside bullet list: OK
  1317. 815.89 s [pandoc] table with one column: OK
  1318. 815.89 s [pandoc] div with bullet list: OK
  1319. 815.89 s [pandoc] inline elements
  1320. 815.89 s [pandoc] string
  1321. 815.89 s [pandoc] string: OK
  1322. 815.89 s [pandoc] escape footnote: OK
  1323. 815.89 s [pandoc] escape secondary note: OK
  1324. 815.89 s [pandoc] do not escape brackets: OK
  1325. 815.89 s [pandoc] escape verbatim close tag: OK
  1326. 815.89 s [pandoc] escape link-like text: OK
  1327. 815.89 s [pandoc] escape pipe to avoid accidental tables: OK
  1328. 815.89 s [pandoc] escape hash to avoid accidental anchors: OK
  1329. 815.89 s [pandoc] escape definition list markers: OK
  1330. 815.89 s [pandoc] normalize strings before escaping: OK
  1331. 815.89 s [pandoc] do not escape colon: OK
  1332. 815.89 s [pandoc] escape - to avoid accidental unordered lists: OK
  1333. 815.89 s [pandoc] escape - inside a list to avoid accidental nested un...: OK
  1334. 815.89 s [pandoc] escape strings starting with - inside a list: OK
  1335. 815.89 s [pandoc] escape - inside a note: OK
  1336. 815.89 s [pandoc] escape - after softbreak in note: OK
  1337. 815.89 s [pandoc] escape ; to avoid accidental comments: OK
  1338. 815.89 s [pandoc] escape strings starting with ; and space: OK
  1339. 815.89 s [pandoc] escape ; after softbreak: OK
  1340. 815.90 s [pandoc] escape ; after linebreak: OK
  1341. 815.90 s [pandoc] do not escape ; inside paragraph: OK
  1342. 815.90 s [pandoc] escape newlines: OK
  1343. 815.90 s [pandoc] emphasis
  1344. 815.90 s [pandoc] emphasis: OK
  1345. 815.90 s [pandoc] emphasis inside word: OK
  1346. 815.90 s [pandoc] emphasis before comma: OK
  1347. 815.90 s [pandoc] emphasis before period: OK
  1348. 815.90 s [pandoc] empty emphasis: OK
  1349. 815.90 s [pandoc] empty strong: OK
  1350. 815.90 s [pandoc] empty strong emphasis: OK
  1351. 815.90 s [pandoc] empty emphasized strong: OK
  1352. 815.90 s [pandoc] emphasized empty string: OK
  1353. 815.90 s [pandoc] strong empty string: OK
  1354. 815.90 s [pandoc] strong emphasized empty string: OK
  1355. 815.90 s [pandoc] emphasized strong empty string: OK
  1356. 815.90 s [pandoc] emphasized string with space: OK
  1357. 815.90 s [pandoc] emphasized string ending with space: OK
  1358. 815.90 s [pandoc] emphasized string with tab: OK
  1359. 815.90 s [pandoc] emphasized space between empty strings: OK
  1360. 815.90 s [pandoc] strong: OK
  1361. 815.90 s [pandoc] strong inside word: OK
  1362. 815.90 s [pandoc] strong emphasis: OK
  1363. 815.90 s [pandoc] strong after emphasis: OK
  1364. 815.90 s [pandoc] strong emphasis after emphasis: OK
  1365. 815.90 s [pandoc] strong in the end of emphasis: OK
  1366. 815.90 s [pandoc] switch to lightweight markup after <em> tag: OK
  1367. 815.90 s [pandoc] strikeout: OK
  1368. 815.90 s [pandoc] space at the beginning of emphasis: OK
  1369. 815.90 s [pandoc] space at the end of emphasis: OK
  1370. 815.90 s [pandoc] space at the beginning of strong: OK
  1371. 815.90 s [pandoc] space at the end of strong: OK
  1372. 815.90 s [pandoc] space at the beginning of strong emphasis: OK
  1373. 815.90 s [pandoc] space at the end of strong emphasis: OK
  1374. 815.90 s [pandoc] space at the beginning of emphasiszed strong: OK
  1375. 815.90 s [pandoc] space at the end of emphasized strong: OK
  1376. 815.90 s [pandoc] superscript: OK
  1377. 815.90 s [pandoc] subscript: OK
  1378. 815.90 s [pandoc] smallcaps: OK
  1379. 815.90 s [pandoc] smallcaps near emphasis: OK
  1380. 815.90 s [pandoc] single quoted: OK
  1381. 815.90 s [pandoc] double quoted: OK
  1382. 815.90 s [pandoc] code
  1383. 815.90 s [pandoc] simple: OK
  1384. 815.90 s [pandoc] empty: OK
  1385. 815.90 s [pandoc] space: OK
  1386. 815.90 s [pandoc] space at the beginning: OK
  1387. 815.90 s [pandoc] space at the end: OK
  1388. 815.90 s [pandoc] use tags for =: OK
  1389. 815.90 s [pandoc] escape tag: OK
  1390. 815.90 s [pandoc] normalization with attributes: OK
  1391. 815.90 s [pandoc] code tag: OK
  1392. 815.90 s [pandoc] normalization: OK
  1393. 815.90 s [pandoc] normalization with empty string: OK
  1394. 815.90 s [pandoc] emphasized code: OK
  1395. 815.90 s [pandoc] strong code: OK
  1396. 815.90 s [pandoc] spaces
  1397. 815.90 s [pandoc] space: OK
  1398. 815.90 s [pandoc] soft break: OK
  1399. 815.90 s [pandoc] remove soft break: OK
  1400. 815.90 s [pandoc] line break: OK
  1401. 815.90 s [pandoc] line break at the end: OK
  1402. 815.90 s [pandoc] no newline after line break in header: OK
  1403. 815.90 s [pandoc] no softbreak in header: OK
  1404. 815.90 s [pandoc] math
  1405. 815.90 s [pandoc] inline math: OK
  1406. 815.90 s [pandoc] display math: OK
  1407. 815.90 s [pandoc] multiple letters in inline math: OK
  1408. 815.90 s [pandoc] expand math before normalization: OK
  1409. 815.90 s [pandoc] multiple math expressions inside one inline list: OK
  1410. 815.90 s [pandoc] raw inline: OK
  1411. 815.90 s [pandoc] links
  1412. 815.90 s [pandoc] link with description: OK
  1413. 815.90 s [pandoc] link without description: OK
  1414. 815.90 s [pandoc] link to anchor: OK
  1415. 815.90 s [pandoc] link to image with description: OK
  1416. 815.90 s [pandoc] link to image without description: OK
  1417. 815.90 s [pandoc] escape brackets in links
  1418. 815.90 s [pandoc] link with description: OK
  1419. 815.90 s [pandoc] link without description: OK
  1420. 815.90 s [pandoc] image link with description: OK
  1421. 815.90 s [pandoc] image link without description: OK
  1422. 815.90 s [pandoc] image: OK
  1423. 815.90 s [pandoc] image with width: OK
  1424. 815.90 s [pandoc] left-aligned image with width: OK
  1425. 815.90 s [pandoc] right-aligned image with width: OK
  1426. 815.90 s [pandoc] escape brackets in image title: OK
  1427. 815.90 s [pandoc] note: OK
  1428. 815.90 s [pandoc] note location
  1429. 815.90 s [pandoc] footnotes at the end of document: OK
  1430. 815.90 s [pandoc] footnotes at the end of block: OK
  1431. 815.90 s [pandoc] footnotes at the end of section: OK
  1432. 815.90 s [pandoc] span with class: OK
  1433. 815.90 s [pandoc] span without class: OK
  1434. 815.90 s [pandoc] span with anchor: OK
  1435. 815.90 s [pandoc] empty span with anchor: OK
  1436. 815.90 s [pandoc] empty span without class and anchor: OK
  1437. 815.90 s [pandoc] span with class and anchor: OK
  1438. 815.90 s [pandoc] adjacent spans: OK
  1439. 815.90 s [pandoc] RTL
  1440. 815.90 s [pandoc] RTL span: OK
  1441. 815.90 s [pandoc] LTR span: OK
  1442. 815.90 s [pandoc] RTL span with a class: OK
  1443. 815.90 s [pandoc] LTR span with a class: OK
  1444. 815.90 s [pandoc] Escape <<< and >>>: OK
  1445. 815.90 s [pandoc] combined
  1446. 815.90 s [pandoc] emph word before: OK
  1447. 815.90 s [pandoc] emph word after: OK
  1448. 815.90 s [pandoc] emph quoted: OK
  1449. 815.90 s [pandoc] strong word before: OK
  1450. 815.90 s [pandoc] strong word after: OK
  1451. 815.90 s [pandoc] strong quoted: OK
  1452. 815.90 s [pandoc] FB2
  1453. 815.90 s [pandoc] block elements
  1454. 815.90 s [pandoc] para: OK
  1455. 815.90 s [pandoc] inlines
  1456. 815.90 s [pandoc] Emphasis: OK
  1457. 815.91 s [pandoc] bullet list: OK
  1458. 815.91 s [pandoc] PowerPoint
  1459. 815.91 s [pandoc] Default slide formatting
  1460. 815.96 s [pandoc] Inline formatting: OK (0.05s)
  1461. 816.01 s [pandoc] Slide breaks (default slide-level): OK (0.05s)
  1462. 816.07 s [pandoc] slide breaks (slide-level set to 1): OK (0.05s)
  1463. 816.09 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 )
  1464. 816.12 s [pandoc] lists: OK (0.05s)
  1465. 816.17 s [pandoc] start ordered list at specified num: OK (0.05s)
  1466. 816.24 s [pandoc] List continuation paragraph indentation: OK (0.07s)
  1467. 816.31 s [pandoc] tables: OK (0.07s)
  1468. 816.34 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 )
  1469. 816.34 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 )
  1470. 816.34 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 )
  1471. 816.34 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 )
  1472. 816.34 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 )
  1473. 816.34 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 )
  1474. 816.34 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  1475. 816.34 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  1476. 816.34 s [vector] |
  1477. 816.34 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  1478. 816.34 s [vector] | ^^^^^^
  1479. 816.34 s [vector]
  1480. 816.34 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1481. 816.34 s [vector] In the use of ‘head’
  1482. 816.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1483. 816.34 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1484. 816.34 s [vector] |
  1485. 816.34 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1486. 816.34 s [vector] | ^^^^
  1487. 816.34 s [vector]
  1488. 816.34 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1489. 816.34 s [vector] In the use of ‘tail’
  1490. 816.34 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1491. 816.34 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  1492. 816.34 s [vector] |
  1493. 816.34 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1494. 816.34 s [vector] | ^^^^
  1495. 816.34 s [vector]
  1496. 816.34 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 )
  1497. 816.38 s [pandoc] table of contents: OK (0.07s)
  1498. 816.43 s [pandoc] end notes: OK (0.05s)
  1499. 816.49 s [pandoc] end notes, with table of contents: OK (0.05s)
  1500. 816.55 s [pandoc] images: OK (0.07s)
  1501. 816.60 s [pandoc] two-column layout: OK (0.05s)
  1502. 816.66 s [pandoc] two-column (not comparison): OK (0.06s)
  1503. 816.72 s [pandoc] speaker notes: OK (0.06s)
  1504. 816.80 s [pandoc] speaker notes after a separating block: OK (0.08s)
  1505. 816.92 s [pandoc] speaker notes after a separating header: OK (0.12s)
  1506. 816.93 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  1507. 816.98 s [pandoc] speaker notes after metadata: OK (0.06s)
  1508. 817.05 s [pandoc] remove empty slides: OK (0.07s)
  1509. 817.11 s [pandoc] raw ooxml: OK (0.06s)
  1510. 817.17 s [pandoc] metadata, custom properties: OK (0.06s)
  1511. 817.24 s [pandoc] metadata, short description: OK (0.06s)
  1512. 817.30 s [pandoc] inline code and code blocks: OK (0.07s)
  1513. 817.36 s [pandoc] inline code and code blocks, custom formatting: OK (0.06s)
  1514. 817.36 s [pandoc] Using slide level 0, if the first thing on a slide is
  1515. 817.43 s [pandoc] a h1 it's used as the slide title: OK (0.07s)
  1516. 817.51 s [pandoc] a h2 it's used as the slide title: OK (0.08s)
  1517. 817.51 s [pandoc] a heading it's used as the slide title
  1518. 817.59 s [pandoc] (works with a table): OK (0.07s)
  1519. 817.66 s [pandoc] (content with caption layout): OK (0.07s)
  1520. 817.66 s [pandoc] comparison layout
  1521. 817.66 s [pandoc] comparison layout is used...
  1522. 817.71 s [haskell-language-server] [2 of 2] Compiling Experiments ( ghcide-bench/src/Experiments.hs, dist/build/ghcide-bench-lib/Experiments.p_o )
  1523. 817.72 s [pandoc] when two columns contain text + non-text: OK (0.07s)
  1524. 817.79 s [pandoc] even when only one col contains text + non-text: OK (0.07s)
  1525. 817.79 s [pandoc] extra ... in one column gets overlaid
  1526. 817.86 s [pandoc] text: OK (0.08s)
  1527. 817.95 s [pandoc] image: OK (0.08s)
  1528. 817.95 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  1529. 817.96 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  1530. 818.01 s [pandoc] is not used if the non-text comes first: OK (0.06s)
  1531. 818.01 s [pandoc] Content with Caption layout is ...
  1532. 818.06 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 )
  1533. 818.09 s [pandoc] used for heading, text, image on the same slide: OK (0.08s)
  1534. 818.17 s [pandoc] used for text and an image on the same slide: OK (0.07s)
  1535. 818.22 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 )
  1536. 818.25 s [pandoc] not used if the image comes first: OK (0.07s)
  1537. 818.25 s [pandoc] The Blank layout is used if a slide contains only...
  1538. 818.31 s [pandoc] speaker notes: OK (0.07s)
  1539. 818.36 s [pandoc] an empty heading with a body of only NBSPs: OK (0.06s)
  1540. 818.43 s [pandoc] a heading containing only non-breaking spaces: OK (0.06s)
  1541. 818.50 s [haskell-language-server] ghcide-bench/src/Experiments.hs:345:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  1542. 818.50 s [haskell-language-server] Pattern match(es) are non-exhaustive
  1543. 818.50 s [haskell-language-server] In a pattern binding:
  1544. 818.50 s [haskell-language-server] Patterns of type ‘ParserResult Config’ not matched:
  1545. 818.50 s [haskell-language-server] Failure _
  1546. 818.50 s [haskell-language-server] CompletionInvoked _
  1547. 818.50 s [haskell-language-server] |
  1548. 818.50 s [haskell-language-server] 345 | Success defConfig = execParserPure defaultPrefs (info configP fullDesc) []
  1549. 818.50 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1550. 818.50 s [haskell-language-server]
  1551. 818.50 s [haskell-language-server] ghcide-bench/src/Experiments.hs:453:42: warning: [GHC-62161] [-Wincomplete-uni-patterns]
  1552. 818.50 s [haskell-language-server] Pattern match(es) are non-exhaustive
  1553. 818.50 s [haskell-language-server] In a lambda abstraction:
  1554. 818.50 s [haskell-language-server] Patterns of type ‘Maybe Handle’, ‘Maybe Handle’, ‘Maybe Handle’,
  1555. 818.50 s [haskell-language-server] ‘ProcessHandle’ not matched:
  1556. 818.50 s [haskell-language-server] Nothing _ _ _
  1557. 818.50 s [haskell-language-server] (Just _) Nothing _ _
  1558. 818.51 s [haskell-language-server] (Just _) (Just _) Nothing _
  1559. 818.51 s [haskell-language-server] |
  1560. 818.51 s [haskell-language-server] 453 | run sess = withCreateProcess p $ \(Just inH) (Just outH) (Just errH) pH -> do
  1561. 818.51 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^...
  1562. 818.51 s [haskell-language-server]
  1563. 818.51 s [haskell-language-server] ghcide-bench/src/Experiments.hs:630:37: warning: [GHC-63394] [-Wx-partial]
  1564. 818.51 s [haskell-language-server] In the use of ‘head’
  1565. 818.51 s [haskell-language-server] (imported from Data.List, but defined in GHC.Internal.List):
  1566. 818.51 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"."
  1567. 818.51 s [haskell-language-server] |
  1568. 818.51 s [haskell-language-server] 630 | let DocumentPositions{..} = head docs
  1569. 818.51 s [haskell-language-server] | ^^^^
  1570. 818.51 s [haskell-language-server]
  1571. 818.54 s [pandoc] Incremental lists are supported: OK (0.11s)
  1572. 818.64 s [pandoc] One-off incremental lists are supported: OK (0.10s)
  1573. 818.72 s [pandoc] Background images: OK (0.09s)
  1574. 818.72 s [pandoc] With `--reference-doc` pptx file
  1575. 818.90 s [pandoc] Inline formatting: OK (0.17s)
  1576. 818.98 s [pandoc] Slide breaks (default slide-level): OK (0.08s)
  1577. 819.07 s [pandoc] slide breaks (slide-level set to 1): OK (0.09s)
  1578. 819.20 s [pandoc] lists: OK (0.13s)
  1579. 819.41 s [pandoc] start ordered list at specified num: OK (0.14s)
  1580. 819.41 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 )
  1581. 819.41 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1582. 819.41 s [vector] In the use of ‘tail’
  1583. 819.41 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1584. 819.41 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"."
  1585. 819.41 s [vector] |
  1586. 819.41 s [vector] 244 | postscanl f z = tail . scanl f z
  1587. 819.41 s [vector] | ^^^^
  1588. 819.41 s [vector]
  1589. 819.41 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1590. 819.41 s [vector] In the use of ‘tail’
  1591. 819.41 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1592. 819.41 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"."
  1593. 819.41 s [vector] |
  1594. 819.41 s [vector] 245 | prescanr f z = tail . scanr f z
  1595. 819.41 s [vector] | ^^^^
  1596. 819.41 s [vector]
  1597. 819.41 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 )
  1598. 819.41 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1599. 819.41 s [vector] In the use of ‘head’
  1600. 819.41 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1601. 819.41 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"."
  1602. 819.41 s [vector] |
  1603. 819.41 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1604. 819.41 s [vector] | ^^^^
  1605. 819.41 s [vector]
  1606. 819.41 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1607. 819.41 s [vector] In the use of ‘head’
  1608. 819.41 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1609. 819.41 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"."
  1610. 819.41 s [vector] |
  1611. 819.41 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1612. 819.41 s [vector] | ^^^^
  1613. 819.41 s [vector]
  1614. 819.41 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1615. 819.41 s [vector] In the use of ‘tail’
  1616. 819.41 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1617. 819.41 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"."
  1618. 819.41 s [vector] |
  1619. 819.41 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1620. 819.41 s [vector] | ^^^^
  1621. 819.41 s [vector]
  1622. 819.41 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1623. 819.41 s [vector] In the use of ‘head’
  1624. 819.41 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1625. 819.41 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"."
  1626. 819.41 s [vector] |
  1627. 819.41 s [vector] 439 | = V.uniq `eq` (map head . group)
  1628. 819.41 s [vector] | ^^^^
  1629. 819.41 s [vector]
  1630. 819.43 s [pandoc] List continuation paragraph indentation: OK (0.09s)
  1631. 819.52 s [pandoc] tables: OK (0.08s)
  1632. 819.62 s [pandoc] table of contents: OK (0.10s)
  1633. 819.72 s [pandoc] end notes: OK (0.11s)
  1634. 819.80 s [pandoc] end notes, with table of contents: OK (0.07s)
  1635. 819.90 s [pandoc] images: OK (0.10s)
  1636. 819.99 s [pandoc] two-column layout: OK (0.09s)
  1637. 820.08 s [pandoc] two-column (not comparison): OK (0.10s)
  1638. 820.26 s [pandoc] speaker notes: OK (0.18s)
  1639. 820.28 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 )
  1640. 820.37 s [pandoc] speaker notes after a separating block: OK (0.11s)
  1641. 820.40 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 )
  1642. 820.40 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 )
  1643. 820.40 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 )
  1644. 820.40 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 )
  1645. 820.41 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 )
  1646. 820.41 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 )
  1647. 820.41 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  1648. 820.41 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  1649. 820.41 s [vector] |
  1650. 820.41 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  1651. 820.41 s [vector] | ^^^^^^
  1652. 820.41 s [vector]
  1653. 820.41 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1654. 820.41 s [vector] In the use of ‘head’
  1655. 820.41 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1656. 820.41 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"."
  1657. 820.41 s [vector] |
  1658. 820.41 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1659. 820.41 s [vector] | ^^^^
  1660. 820.41 s [vector]
  1661. 820.41 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1662. 820.41 s [vector] In the use of ‘tail’
  1663. 820.41 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1664. 820.41 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"."
  1665. 820.41 s [vector] |
  1666. 820.41 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1667. 820.41 s [vector] | ^^^^
  1668. 820.41 s [vector]
  1669. 820.41 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 )
  1670. 820.45 s [pandoc] speaker notes after a separating header: OK (0.08s)
  1671. 820.53 s [pandoc] speaker notes after metadata: OK (0.08s)
  1672. 820.62 s [pandoc] remove empty slides: OK (0.09s)
  1673. 820.70 s [pandoc] raw ooxml: OK (0.08s)
  1674. 820.79 s [pandoc] metadata, custom properties: OK (0.09s)
  1675. 820.85 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  1676. 820.88 s [pandoc] metadata, short description: OK (0.09s)
  1677. 820.97 s [pandoc] inline code and code blocks: OK (0.08s)
  1678. 821.04 s [pandoc] inline code and code blocks, custom formatting: OK (0.08s)
  1679. 821.04 s [pandoc] Using slide level 0, if the first thing on a slide is
  1680. 821.12 s [pandoc] a h1 it's used as the slide title: OK (0.08s)
  1681. 821.22 s [pandoc] a h2 it's used as the slide title: OK (0.10s)
  1682. 821.22 s [pandoc] a heading it's used as the slide title
  1683. 821.30 s [pandoc] (works with a table): OK (0.08s)
  1684. 821.38 s [pandoc] (content with caption layout): OK (0.08s)
  1685. 821.38 s [pandoc] comparison layout
  1686. 821.38 s [pandoc] comparison layout is used...
  1687. 821.55 s [pandoc] when two columns contain text + non-text: OK (0.17s)
  1688. 821.64 s [pandoc] even when only one col contains text + non-text: OK (0.09s)
  1689. 821.64 s [pandoc] extra ... in one column gets overlaid
  1690. 821.74 s [pandoc] text: OK (0.10s)
  1691. 821.83 s [pandoc] image: OK (0.09s)
  1692. 821.84 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  1693. 821.85 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  1694. 821.92 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 )
  1695. 821.94 s [pandoc] is not used if the non-text comes first: OK (0.11s)
  1696. 821.94 s [pandoc] Content with Caption layout is ...
  1697. 822.10 s [pandoc] used for heading, text, image on the same slide: OK (0.16s)
  1698. 822.47 s [pandoc] used for text and an image on the same slide: OK (0.35s)
  1699. 822.73 s [pandoc] not used if the image comes first: OK (0.27s)
  1700. 822.73 s [pandoc] The Blank layout is used if a slide contains only...
  1701. 822.89 s [pandoc] speaker notes: OK (0.16s)
  1702. 822.99 s [pandoc] an empty heading with a body of only NBSPs: OK (0.10s)
  1703. 823.09 s [pandoc] a heading containing only non-breaking spaces: OK (0.09s)
  1704. 823.22 s [pandoc] Incremental lists are supported: OK (0.14s)
  1705. 823.44 s [pandoc] One-off incremental lists are supported: OK (0.22s)
  1706. 823.47 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 )
  1707. 823.47 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 )
  1708. 823.55 s [pandoc] Background images: OK (0.11s)
  1709. 823.59 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 )
  1710. 823.59 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 )
  1711. 823.59 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 )
  1712. 823.59 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 )
  1713. 823.59 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 )
  1714. 823.59 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 )
  1715. 823.59 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 )
  1716. 823.59 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 )
  1717. 823.59 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 )
  1718. 823.59 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 )
  1719. 823.59 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 )
  1720. 823.67 s [pandoc] Basic footer: OK (0.11s)
  1721. 823.77 s [pandoc] Footer with fixed date, replaced by meta block date: OK (0.10s)
  1722. 823.81 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 )
  1723. 823.87 s [pandoc] Footer not shown on title slide: OK (0.11s)
  1724. 824.07 s [pandoc] Footer with slide number starting from 3: OK (0.19s)
  1725. 824.38 s [pandoc] Layouts can be moved around in reference doc: OK (0.32s)
  1726. 824.58 s [pandoc] Layouts can be missing from the reference doc: OK (0.20s)
  1727. 824.68 s [pandoc] Ms
  1728. 824.68 s [pandoc] code blocks
  1729. 824.68 s [pandoc] basic: OK
  1730. 824.68 s [pandoc] escape starting .: OK
  1731. 824.68 s [pandoc] AnnotatedTable
  1732. 824.68 s [pandoc] toTable
  1733. 824.68 s [pandoc] annotates a sample table properly: OK
  1734. 825.32 s [pandoc] normalizes like the table builder: OK (0.73s)
  1735. 825.32 s [pandoc] +++ OK, passed 50 tests.
  1736. 825.33 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 )
  1737. 825.33 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 )
  1738. 825.34 s [pandoc] has valid final cell columns: OK
  1739. 825.34 s [pandoc] +++ OK, passed 50 tests.
  1740. 825.35 s [pandoc] has valid first row column data: OK
  1741. 825.35 s [pandoc] +++ OK, passed 50 tests.
  1742. 825.36 s [pandoc] has valid all row column data: OK (0.02s)
  1743. 825.36 s [pandoc] +++ OK, passed 50 tests.
  1744. 825.36 s [pandoc] has valid cell column data lengths: OK (0.02s)
  1745. 825.36 s [pandoc] +++ OK, passed 50 tests.
  1746. 825.36 s [pandoc] Readers
  1747. 825.36 s [pandoc] LaTeX
  1748. 825.36 s [pandoc] basic
  1749. 825.36 s [pandoc] simple: OK
  1750. 825.36 s [pandoc] space: OK
  1751. 825.36 s [pandoc] emphasized: OK
  1752. 825.36 s [pandoc] headers
  1753. 825.36 s [pandoc] level 1: OK
  1754. 825.36 s [pandoc] level 2: OK
  1755. 825.36 s [pandoc] level 3: OK
  1756. 825.36 s [pandoc] emph: OK
  1757. 825.36 s [pandoc] link: OK
  1758. 825.36 s [pandoc] math
  1759. 825.36 s [pandoc] escaped $: OK
  1760. 825.36 s [pandoc] space and comments
  1761. 825.36 s [pandoc] blank lines + space at beginning: OK
  1762. 825.36 s [pandoc] blank lines + space + comments: OK
  1763. 825.36 s [pandoc] comment in paragraph: OK
  1764. 825.36 s [pandoc] code blocks
  1765. 825.36 s [pandoc] identifier: OK
  1766. 825.36 s [pandoc] no identifier: OK
  1767. 825.36 s [pandoc] tables
  1768. 825.36 s [pandoc] Single cell table: OK
  1769. 825.36 s [pandoc] Multi cell table: OK
  1770. 825.36 s [pandoc] Multi line table: OK
  1771. 825.37 s [pandoc] Empty table: OK
  1772. 825.37 s [pandoc] Table with fixed column width: OK
  1773. 825.37 s [pandoc] Table with empty column separators: OK
  1774. 825.37 s [pandoc] Table with custom column separators: OK
  1775. 825.37 s [pandoc] Table with vertical alignment argument: OK
  1776. 825.37 s [pandoc] Table with multicolumn item: OK
  1777. 825.37 s [pandoc] table with multicolumn item (#6596): OK
  1778. 825.37 s [pandoc] Table with multirow item: OK
  1779. 825.37 s [pandoc] Table with multirow item using full prototype: OK
  1780. 825.37 s [pandoc] Table with nested multirow/multicolumn item: OK
  1781. 825.37 s [pandoc] Table with multicolumn header: OK
  1782. 825.38 s [pandoc] Table with normal empty cells: OK
  1783. 825.38 s [pandoc] citations
  1784. 825.38 s [pandoc] natbib
  1785. 825.38 s [pandoc] citet: OK
  1786. 825.38 s [pandoc] suffix: OK
  1787. 825.38 s [pandoc] suffix long: OK
  1788. 825.38 s [pandoc] multiple: OK
  1789. 825.38 s [pandoc] group: OK
  1790. 825.38 s [pandoc] suffix and locator: OK
  1791. 825.38 s [pandoc] suffix only: OK
  1792. 825.38 s [pandoc] no author: OK
  1793. 825.38 s [pandoc] markup: OK
  1794. 825.38 s [pandoc] biblatex
  1795. 825.38 s [pandoc] textcite: OK
  1796. 825.38 s [pandoc] suffix: OK
  1797. 825.38 s [pandoc] suffix long: OK
  1798. 825.38 s [pandoc] multiple: OK
  1799. 825.39 s [pandoc] group: OK
  1800. 825.39 s [pandoc] suffix and locator: OK
  1801. 825.39 s [pandoc] suffix only: OK
  1802. 825.39 s [pandoc] no author: OK
  1803. 825.39 s [pandoc] markup: OK
  1804. 825.39 s [pandoc] parencite: OK
  1805. 825.39 s [pandoc] images
  1806. 825.39 s [pandoc] Basic image: OK
  1807. 825.39 s [pandoc] Basic image with blank options: OK
  1808. 825.39 s [pandoc] Image with both width and height: OK
  1809. 825.39 s [pandoc] Image with width and height and a bunch of other opt...: OK
  1810. 825.39 s [pandoc] Image with just width: OK
  1811. 825.39 s [pandoc] Image with just height: OK
  1812. 825.39 s [pandoc] Image width relative to textsize: OK
  1813. 825.39 s [pandoc] Image with options with spaces: OK
  1814. 825.39 s [pandoc] Character Escapes
  1815. 825.39 s [pandoc] Two-character escapes: OK
  1816. 825.39 s [pandoc] One-character escapes: OK
  1817. 825.39 s [pandoc] memoir scene breaks
  1818. 825.39 s [pandoc] plainbreak: OK
  1819. 825.39 s [pandoc] plainbreak*: OK
  1820. 825.39 s [pandoc] fancybreak: OK
  1821. 825.39 s [pandoc] fancybreak*: OK
  1822. 825.39 s [pandoc] plainfancybreak: OK
  1823. 825.39 s [pandoc] plainfancybreak*: OK
  1824. 825.39 s [pandoc] pfbreak: OK
  1825. 825.39 s [pandoc] pfbreak*: OK
  1826. 825.39 s [pandoc] biblatex roman numerals
  1827. 825.39 s [pandoc] upper: OK
  1828. 825.39 s [pandoc] lower: OK
  1829. 825.39 s [pandoc] leading zero: OK
  1830. 825.39 s [pandoc] surrounding spaces: OK
  1831. 825.40 s [pandoc] zero: OK
  1832. 825.40 s [pandoc] space then unbraced argument: OK
  1833. 825.40 s [pandoc] space before braced argument: OK
  1834. 825.40 s [pandoc] polyglossia language spans
  1835. 825.40 s [pandoc] french: OK
  1836. 825.40 s [pandoc] nested: OK
  1837. 825.40 s [pandoc] with formatting: OK
  1838. 825.40 s [pandoc] language options: OK
  1839. 825.40 s [pandoc] unknown option fallback: OK
  1840. 825.40 s [pandoc] Markdown
  1841. 825.40 s [pandoc] inline code
  1842. 825.40 s [pandoc] with attribute: OK
  1843. 825.40 s [pandoc] with attribute space: OK
  1844. 825.40 s [pandoc] inline code in lists (regression tests for #6284)
  1845. 825.40 s [pandoc] code with list marker in text in ordered list: OK
  1846. 825.40 s [pandoc] code with list marker at start in ordered list: OK
  1847. 825.40 s [pandoc] code with list marker at start in ordered list: OK
  1848. 825.40 s [pandoc] code with list marker after literal backticks in ord...: OK
  1849. 825.40 s [pandoc] code with list marker after literal backticks in ord...: OK
  1850. 825.40 s [pandoc] code with list marker in text in bullet list: OK
  1851. 825.40 s [pandoc] code with list marker at start in bullet list: OK
  1852. 825.40 s [pandoc] code with list marker at start in bullet list: OK
  1853. 825.40 s [pandoc] code with list marker after literal backticks in bul...: OK
  1854. 825.40 s [pandoc] code with list marker after literal backticks in bul...: OK
  1855. 825.40 s [pandoc] lists with newlines in backticks: OK
  1856. 825.40 s [pandoc] lists with newlines in backticks: OK
  1857. 825.40 s [pandoc] lists with newlines in backticks: OK
  1858. 825.40 s [pandoc] lists with newlines in backticks: OK
  1859. 825.40 s [pandoc] lists with newlines in backticks: OK
  1860. 825.41 s [pandoc] lists with newlines in backticks: OK
  1861. 825.41 s [pandoc] lists with newlines in backticks: OK
  1862. 825.41 s [pandoc] lists with newlines in backticks: OK
  1863. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1864. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1865. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1866. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1867. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1868. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1869. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1870. 825.41 s [pandoc] lists with blank lines and indent in backticks: OK
  1871. 825.41 s [pandoc] emph and strong
  1872. 825.41 s [pandoc] two strongs in emph: OK
  1873. 825.41 s [pandoc] emph and strong emph alternating: OK
  1874. 825.41 s [pandoc] emph with spaced strong: OK
  1875. 825.41 s [pandoc] intraword underscore with opening underscore (#1121): OK
  1876. 825.41 s [pandoc] raw LaTeX
  1877. 825.41 s [pandoc] in URL: OK
  1878. 825.41 s [pandoc] raw HTML
  1879. 825.41 s [pandoc] nesting (issue #1330): OK
  1880. 825.41 s [pandoc] invalid tag (issue #1820: OK
  1881. 825.41 s [pandoc] technically invalid comment: OK
  1882. 825.41 s [pandoc] issue 2469: OK
  1883. 825.41 s [pandoc] raw email addresses
  1884. 825.41 s [pandoc] issue 2940: OK
  1885. 825.41 s [pandoc] emoji
  1886. 825.43 s [pandoc] emoji symbols: OK
  1887. 825.58 s [pandoc] unbalanced brackets: OK (0.17s)
  1888. 825.58 s [pandoc] backslash escapes
  1889. 825.58 s [pandoc] in URL: OK
  1890. 825.58 s [pandoc] in title: OK
  1891. 825.58 s [pandoc] in reference link title: OK
  1892. 825.58 s [pandoc] in reference link URL: OK
  1893. 825.58 s [pandoc] bare URIs
  1894. 825.58 s [pandoc] http://google.com is a search engine.: OK
  1895. 825.58 s [pandoc] <a href="http://foo.bar.baz">http://foo.bar.baz</a>: OK
  1896. 825.58 s [pandoc] Try this query: http://google.com?search=fish&time=h...: OK
  1897. 825.58 s [pandoc] HTTPS://GOOGLE.COM,: OK
  1898. 825.58 s [pandoc] http://el.wikipedia.org/wiki/Τεχνολογία,: OK
  1899. 825.58 s [pandoc] doi:10.1000/182,: OK
  1900. 825.58 s [pandoc] git://github.com/foo/bar.git,: OK
  1901. 825.58 s [pandoc] file:///Users/joe/joe.txt, and: OK
  1902. 825.59 s [pandoc] mailto:someone@somedomain.com.: OK
  1903. 825.59 s [pandoc] Use http: this is not a link!: OK
  1904. 825.59 s [pandoc] (http://google.com).: OK
  1905. 825.59 s [pandoc] http://en.wikipedia.org/wiki/Sprite_(computer_graphi...: OK
  1906. 825.59 s [pandoc] http://en.wikipedia.org/wiki/Sprite_[computer_graphi...: OK
  1907. 825.59 s [pandoc] http://en.wikipedia.org/wiki/Sprite_{computer_graphi...: OK
  1908. 825.59 s [pandoc] http://example.com/Notification_Center-GitHub-201011...: OK
  1909. 825.59 s [pandoc] https://github.com/github/hubot/blob/master/scripts/...: OK
  1910. 825.59 s [pandoc] http://www.rubyonrails.com: OK
  1911. 825.59 s [pandoc] http://www.rubyonrails.com:80: OK
  1912. 825.59 s [pandoc] http://www.rubyonrails.com/~minam: OK
  1913. 825.59 s [pandoc] https://www.rubyonrails.com/~minam: OK
  1914. 825.59 s [pandoc] http://www.rubyonrails.com/~minam/url%20with%20spaces: OK
  1915. 825.59 s [pandoc] http://www.rubyonrails.com/foo.cgi?something=here: OK
  1916. 825.59 s [pandoc] http://www.rubyonrails.com/foo.cgi?something=here&an...: OK
  1917. 825.59 s [pandoc] http://www.rubyonrails.com/contact;new: OK
  1918. 825.59 s [pandoc] http://www.rubyonrails.com/contact;new%20with%20spaces: OK
  1919. 825.59 s [pandoc] http://www.rubyonrails.com/contact;new?with=query&st...: OK
  1920. 825.59 s [pandoc] http://www.rubyonrails.com/~minam/contact;new?with=q...: OK
  1921. 825.59 s [pandoc] http://en.wikipedia.org/wiki/Wikipedia:Today%27s_fea...: OK
  1922. 825.59 s [pandoc] http://www.mail-archive.com/rails@lists.rubyonrails....: OK
  1923. 825.59 s [pandoc] http://www.amazon.com/Testing-Equal-Sign-In-Path/ref...: OK
  1924. 825.59 s [pandoc] http://en.wikipedia.org/wiki/Texas_hold%27em: OK
  1925. 825.59 s [pandoc] https://www.google.com/doku.php?id=gps:resource:scs:...: OK
  1926. 825.59 s [pandoc] http://www.rubyonrails.com: OK
  1927. 825.59 s [pandoc] http://manuals.ruby-on-rails.com/read/chapter.need_a...: OK
  1928. 825.59 s [pandoc] http://foo.example.com/controller/action?parm=value&...: OK
  1929. 825.59 s [pandoc] http://foo.example.com:3000/controller/action: OK
  1930. 825.59 s [pandoc] http://foo.example.com:3000/controller/action+pack: OK
  1931. 825.59 s [pandoc] http://business.timesonline.co.uk/article/0,,9065-24...: OK
  1932. 825.59 s [pandoc] http://www.mail-archive.com/ruby-talk@ruby-lang.org/: OK
  1933. 825.59 s [pandoc] https://example.org/?anchor=lala-: OK
  1934. 825.59 s [pandoc] https://example.org/?anchor=-lala: OK
  1935. 825.59 s [pandoc] autolinks
  1936. 825.59 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 )
  1937. 825.59 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 )
  1938. 825.59 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 )
  1939. 825.59 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 )
  1940. 825.59 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 )
  1941. 825.59 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 )
  1942. 825.59 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 )
  1943. 825.59 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 )
  1944. 825.60 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  1945. 825.60 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 )
  1946. 825.60 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 )
  1947. 825.60 s [pandoc] with unicode dash following: OK
  1948. 825.60 s [pandoc] a partial URL (#2277): OK
  1949. 825.60 s [pandoc] with some attributes: OK
  1950. 825.60 s [pandoc] with some attributes and spaces: OK
  1951. 825.60 s [pandoc] links
  1952. 825.60 s [pandoc] no autolink inside link: OK
  1953. 825.60 s [pandoc] no inline link inside link: OK
  1954. 825.60 s [pandoc] no bare URI inside link: OK
  1955. 825.60 s [pandoc] Github wiki links
  1956. 825.60 s [pandoc] autolink: OK
  1957. 825.60 s [pandoc] link with title: OK
  1958. 825.60 s [pandoc] bad link with title: OK
  1959. 825.60 s [pandoc] autolink not being a link: OK
  1960. 825.60 s [pandoc] autolink not being a link with a square bracket: OK
  1961. 825.60 s [pandoc] link with inline start should be a link: OK
  1962. 825.61 s [pandoc] Headers
  1963. 825.61 s [pandoc] blank line before header: OK
  1964. 825.61 s [pandoc] bracketed text (#2062): OK
  1965. 825.61 s [pandoc] ATX header without trailing #s: OK
  1966. 825.61 s [pandoc] ATX header without trailing #s: OK
  1967. 825.61 s [pandoc] setext header: OK
  1968. 825.61 s [pandoc] Implicit header references
  1969. 825.61 s [pandoc] ATX header without trailing #s: OK
  1970. 825.61 s [pandoc] ATX header with trailing #s: OK
  1971. 825.61 s [pandoc] setext header: OK
  1972. 825.61 s [pandoc] smart punctuation
  1973. 825.61 s [pandoc] quote before ellipses: OK
  1974. 825.61 s [pandoc] apostrophe before emph: OK
  1975. 825.61 s [pandoc] apostrophe in French: OK
  1976. 825.61 s [pandoc] apostrophe after math: OK
  1977. 825.61 s [pandoc] unclosed double quote: OK
  1978. 825.61 s [pandoc] sub- and superscripts
  1979. 825.61 s [pandoc] normal subscript: OK
  1980. 825.61 s [pandoc] normal superscript: OK
  1981. 825.61 s [pandoc] short subscript delimited by space: OK
  1982. 825.61 s [pandoc] short subscript delimited by newline: OK
  1983. 825.61 s [pandoc] short subscript delimited by EOF: OK
  1984. 825.61 s [pandoc] short subscript delimited by punctuation: OK
  1985. 825.61 s [pandoc] short subscript delimited by emph: OK
  1986. 825.61 s [pandoc] no nesting in short subscripts: OK
  1987. 825.61 s [pandoc] short superscript delimited by space: OK
  1988. 825.61 s [pandoc] short superscript delimited by newline: OK
  1989. 825.61 s [pandoc] short superscript delimited by ExF: OK
  1990. 825.61 s [pandoc] short superscript delimited by punctuation: OK
  1991. 825.61 s [pandoc] short superscript delimited by emph: OK
  1992. 825.62 s [pandoc] no nesting in short superscripts: OK
  1993. 825.62 s [pandoc] footnotes
  1994. 825.62 s [pandoc] indent followed by newline and flush-left text: OK
  1995. 825.62 s [pandoc] indent followed by newline and indented text: OK
  1996. 825.62 s [pandoc] recursive note: OK
  1997. 825.62 s [pandoc] lhs
  1998. 825.62 s [pandoc] inverse bird tracks and html: OK
  1999. 825.62 s [pandoc] definition lists
  2000. 825.62 s [pandoc] no blank space: OK
  2001. 825.62 s [pandoc] blank space before first def: OK
  2002. 825.62 s [pandoc] blank space before second def: OK
  2003. 825.62 s [pandoc] laziness: OK
  2004. 825.62 s [pandoc] no blank space before first of two paragraphs: OK
  2005. 825.62 s [pandoc] first line not indented: OK
  2006. 825.62 s [pandoc] list in definition: OK
  2007. 825.62 s [pandoc] in div: OK
  2008. 825.62 s [pandoc] +compact_definition_lists
  2009. 825.62 s [pandoc] basic compact list: OK
  2010. 825.62 s [pandoc] lists
  2011. 825.62 s [pandoc] issue #1154: OK
  2012. 825.62 s [pandoc] issue #1636: OK
  2013. 825.62 s [pandoc] entities
  2014. 825.62 s [pandoc] character references: OK
  2015. 825.62 s [pandoc] numeric: OK
  2016. 825.62 s [pandoc] in link title: OK
  2017. 825.62 s [pandoc] citations
  2018. 825.62 s [pandoc] simple: OK
  2019. 825.63 s [pandoc] key starts with digit: OK
  2020. 825.63 s [pandoc] footnote/link following citation
  2021. 825.63 s [pandoc] footnote: OK
  2022. 825.63 s [pandoc] normal link: OK
  2023. 825.63 s [pandoc] reference link: OK
  2024. 825.63 s [pandoc] short reference link: OK
  2025. 825.63 s [pandoc] implicit header link: OK
  2026. 825.63 s [pandoc] regular citation: OK
  2027. 825.63 s [pandoc] HTML
  2028. 825.63 s [pandoc] base tag
  2029. 825.63 s [pandoc] simple: OK
  2030. 825.63 s [pandoc] slash at end of base: OK
  2031. 825.63 s [pandoc] slash at beginning of href: OK
  2032. 825.63 s [pandoc] absolute URL: OK
  2033. 825.63 s [pandoc] anchors
  2034. 825.63 s [pandoc] anchor without href: OK
  2035. 825.63 s [pandoc] img
  2036. 825.63 s [pandoc] data-external attribute: OK
  2037. 825.63 s [pandoc] title: OK
  2038. 825.63 s [pandoc] lang
  2039. 825.63 s [pandoc] lang on <html>: OK
  2040. 825.63 s [pandoc] xml:lang on <html>: OK
  2041. 825.63 s [pandoc] main
  2042. 825.63 s [pandoc] <main> contents are parsed: OK
  2043. 825.63 s [pandoc] <main role=X> becomes <div role=X>: OK
  2044. 825.65 s [pandoc] <main> has attributes preserved: OK
  2045. 825.65 s [pandoc] <main> closes <p>: OK
  2046. 825.66 s [pandoc] <main> followed by text: OK
  2047. 825.66 s [pandoc] code
  2048. 825.67 s [pandoc] inline code block: OK
  2049. 825.67 s [pandoc] tt
  2050. 825.67 s [pandoc] inline tt block: OK
  2051. 825.67 s [pandoc] samp
  2052. 825.67 s [pandoc] inline samp block: OK
  2053. 825.67 s [pandoc] var
  2054. 825.67 s [pandoc] inline var block: OK
  2055. 825.68 s [pandoc] header
  2056. 825.68 s [pandoc] <header> is parsed as a div: OK
  2057. 825.68 s [pandoc] code block
  2058. 825.69 s [pandoc] attributes in pre > code element: OK
  2059. 825.69 s [pandoc] attributes in pre take precedence: OK
  2060. 826.39 s [pandoc] Round trip: OK (0.76s)
  2061. 826.39 s [pandoc] +++ OK, passed 25 tests.
  2062. 826.39 s [pandoc] JATS
  2063. 826.39 s [pandoc] inline code
  2064. 826.39 s [pandoc] basic: OK
  2065. 826.39 s [pandoc] block code
  2066. 826.39 s [pandoc] basic: OK
  2067. 826.39 s [pandoc] lang: OK
  2068. 826.39 s [pandoc] images
  2069. 826.39 s [pandoc] basic: OK
  2070. 826.39 s [pandoc] alt-text: OK
  2071. 826.39 s [pandoc] bullet list: OK
  2072. 826.39 s [pandoc] definition lists
  2073. 826.39 s [pandoc] with internal link: OK
  2074. 826.39 s [pandoc] math
  2075. 826.39 s [pandoc] escape |: OK
  2076. 826.39 s [pandoc] tex-math only: OK
  2077. 826.39 s [pandoc] math ml only: OK
  2078. 826.39 s [pandoc] headers
  2079. 826.39 s [pandoc] unnumbered sub header: OK
  2080. 826.39 s [pandoc] containing image: OK
  2081. 826.39 s [pandoc] metadata
  2082. 826.39 s [pandoc] abstract: OK
  2083. 826.39 s [pandoc] Jira
  2084. 826.39 s [pandoc] para
  2085. 826.39 s [pandoc] Simple sentence: OK
  2086. 826.39 s [pandoc] leading blank lines: OK
  2087. 826.39 s [pandoc] header
  2088. 826.39 s [pandoc] header: OK
  2089. 826.39 s [pandoc] list
  2090. 826.39 s [pandoc] simple list: OK
  2091. 826.39 s [pandoc] list with minus as bullets: OK
  2092. 826.39 s [pandoc] ordered list / enumeration: OK
  2093. 826.39 s [pandoc] block quote
  2094. 826.39 s [pandoc] simple block quote: OK
  2095. 826.39 s [pandoc] block quote between paragraphs: OK
  2096. 826.39 s [pandoc] table
  2097. 826.40 s [pandoc] table without header: OK
  2098. 826.40 s [pandoc] table with header: OK
  2099. 826.40 s [pandoc] table with column header: OK
  2100. 826.40 s [pandoc] table after paragraph: OK
  2101. 826.40 s [pandoc] panel
  2102. 826.40 s [pandoc] simple panel: OK
  2103. 826.40 s [pandoc] inlines
  2104. 826.40 s [pandoc] emphasis: OK
  2105. 826.40 s [pandoc] deleted: OK
  2106. 826.40 s [pandoc] monospaced: OK
  2107. 826.40 s [pandoc] sub- and superscript: OK
  2108. 826.40 s [pandoc] citation: OK
  2109. 826.40 s [pandoc] color: OK
  2110. 826.40 s [pandoc] hexcolor: OK
  2111. 826.40 s [pandoc] linebreak: OK
  2112. 826.40 s [pandoc] links
  2113. 826.40 s [pandoc] external: OK
  2114. 826.40 s [pandoc] URL in alias: OK
  2115. 826.40 s [pandoc] email: OK
  2116. 826.40 s [pandoc] email with description: OK
  2117. 826.40 s [pandoc] attachment: OK
  2118. 826.40 s [pandoc] attachment with description: OK
  2119. 826.40 s [pandoc] user: OK
  2120. 826.40 s [pandoc] user with description: OK
  2121. 826.40 s [pandoc] 'smart' link: OK
  2122. 826.40 s [pandoc] 'smart' card: OK
  2123. 826.40 s [pandoc] image: OK
  2124. 826.40 s [pandoc] thumbnail image: OK
  2125. 826.40 s [pandoc] image with attributes: OK
  2126. 826.40 s [pandoc] inserted text: OK
  2127. 826.40 s [pandoc] HTML entity: OK
  2128. 826.40 s [pandoc] non-strikeout dashes: OK
  2129. 826.40 s [pandoc] Org
  2130. 826.40 s [pandoc] Inlines
  2131. 826.40 s [pandoc] Plain String: OK
  2132. 826.40 s [pandoc] Emphasis: OK
  2133. 826.40 s [pandoc] Strong: OK
  2134. 826.40 s [pandoc] Strong Emphasis: OK
  2135. 826.40 s [pandoc] Emphasized Strong preceded by space: OK
  2136. 826.40 s [pandoc] Underline: OK
  2137. 826.40 s [pandoc] Strikeout: OK
  2138. 826.40 s [pandoc] Verbatim: OK
  2139. 826.40 s [pandoc] Code: OK
  2140. 826.40 s [pandoc] Math $..$: OK
  2141. 826.40 s [pandoc] Math $$..$$: OK
  2142. 826.40 s [pandoc] Math \[..\]: OK
  2143. 826.40 s [pandoc] Math \(..\): OK
  2144. 826.40 s [pandoc] Symbol: OK
  2145. 826.40 s [pandoc] Superscript simple expression: OK
  2146. 826.40 s [pandoc] Superscript multi char: OK
  2147. 826.40 s [pandoc] Subscript simple expression: OK
  2148. 826.40 s [pandoc] Subscript multi char: OK
  2149. 826.40 s [pandoc] Linebreak: OK
  2150. 826.41 s [pandoc] Inline note: OK
  2151. 826.41 s [pandoc] By default, markup-chars not occurring on word break...: OK
  2152. 826.41 s [pandoc] No empty markup: OK
  2153. 826.41 s [pandoc] Adherence to Org's rules for markup borders: OK
  2154. 826.41 s [pandoc] Quotes are allowed border chars: OK
  2155. 826.41 s [pandoc] Spaces are forbidden border chars: OK
  2156. 826.41 s [pandoc] Zero width spaces are forbidden border chars: OK
  2157. 826.41 s [pandoc] Markup should work properly after a blank line: OK
  2158. 826.41 s [pandoc] Inline math must stay within three lines: OK
  2159. 826.41 s [pandoc] Single-character math: OK
  2160. 826.41 s [pandoc] Markup may not span more than two lines: OK
  2161. 826.41 s [pandoc] Sub- and superscript expressions: OK
  2162. 826.41 s [pandoc] Verbatim text can contain equal signs (=): OK
  2163. 826.41 s [pandoc] Images
  2164. 826.41 s [pandoc] Image: OK
  2165. 826.41 s [pandoc] Image with explicit file: prefix: OK
  2166. 826.41 s [pandoc] Multiple images within a paragraph: OK
  2167. 826.41 s [pandoc] Image with html attributes: OK
  2168. 826.41 s [pandoc] HTML attributes can have trailing spaces: OK
  2169. 826.41 s [pandoc] Uppercase extension: OK
  2170. 826.41 s [pandoc] Explicit link: OK
  2171. 826.41 s [pandoc] Self-link: OK
  2172. 826.41 s [pandoc] Internal self-link (reference): OK
  2173. 826.41 s [pandoc] Absolute file link: OK
  2174. 826.41 s [pandoc] Link to file in parent directory: OK
  2175. 826.41 s [pandoc] Empty link (for gitit interop): OK
  2176. 826.41 s [pandoc] Image link: OK
  2177. 826.41 s [pandoc] Image link with non-image target: OK
  2178. 826.41 s [pandoc] Link to image: OK
  2179. 826.42 s [pandoc] Plain link: OK
  2180. 826.42 s [pandoc] Angle link: OK
  2181. 826.42 s [pandoc] Absolute file link: OK
  2182. 826.42 s [pandoc] File link: OK
  2183. 826.42 s [pandoc] Anchor: OK
  2184. 826.42 s [pandoc] Inline code block: OK
  2185. 826.42 s [pandoc] Inline code block with arguments: OK
  2186. 826.42 s [pandoc] Inline code block with a blank argument array: OK
  2187. 826.42 s [pandoc] Inline code block with toggle: OK
  2188. 826.42 s [pandoc] Inline LaTeX symbol: OK
  2189. 826.42 s [pandoc] Inline LaTeX command: OK
  2190. 826.42 s [pandoc] Inline LaTeX command with spaces: OK
  2191. 826.42 s [pandoc] Inline math symbols: OK
  2192. 826.42 s [pandoc] Inline LaTeX math command: OK
  2193. 826.42 s [pandoc] Unknown inline LaTeX command: OK
  2194. 826.42 s [pandoc] Export snippet: OK
  2195. 826.42 s [pandoc] MathML symbol in LaTeX-style: OK
  2196. 826.42 s [pandoc] MathML symbol in LaTeX-style, including braces: OK
  2197. 826.42 s [pandoc] MathML copy sign: OK
  2198. 826.43 s [pandoc] MathML symbols, space separated: OK
  2199. 826.43 s [pandoc] Macro: OK
  2200. 826.43 s [pandoc] Macro duplicating its argument: OK
  2201. 826.43 s [pandoc] Macro called with too few arguments: OK
  2202. 826.43 s [pandoc] Macro called with an escaped comma: OK
  2203. 826.43 s [pandoc] Citations
  2204. 826.43 s [pandoc] Org-cite citations
  2205. 826.43 s [pandoc] Citation: OK
  2206. 826.43 s [pandoc] Citation containing text: OK
  2207. 826.43 s [pandoc] Author-in-text citation with locator and suffix: OK
  2208. 826.43 s [pandoc] org-ref citations
  2209. 826.43 s [pandoc] simple citation: OK
  2210. 826.43 s [pandoc] simple citation with underscores: OK
  2211. 826.43 s [pandoc] simple citation succeeded by comma: OK
  2212. 826.43 s [pandoc] simple citation succeeded by dot: OK
  2213. 826.43 s [pandoc] simple citation succeeded by colon: OK
  2214. 826.43 s [pandoc] simple citep citation: OK
  2215. 826.43 s [pandoc] multiple simple citations: OK
  2216. 826.43 s [pandoc] multiple simple citations succeeded by comma: OK
  2217. 826.43 s [pandoc] extended citation: OK
  2218. 826.43 s [pandoc] LaTeX citation: OK
  2219. 826.43 s [pandoc] Footnotes
  2220. 826.43 s [pandoc] Footnote: OK
  2221. 826.43 s [pandoc] Two footnotes: OK
  2222. 826.43 s [pandoc] Emphasized text before footnote: OK
  2223. 826.43 s [pandoc] Footnote that starts with emphasized text: OK
  2224. 826.43 s [pandoc] Footnote followed by header: OK
  2225. 826.43 s [pandoc] Footnote followed by two blank lines: OK
  2226. 826.43 s [pandoc] Smart punctuation
  2227. 826.43 s [pandoc] quote before ellipses: OK
  2228. 826.43 s [pandoc] apostrophe before emph: OK
  2229. 826.44 s [pandoc] apostrophe in French: OK
  2230. 826.44 s [pandoc] Quotes cannot occur at the end of emphasized text: OK
  2231. 826.44 s [pandoc] Dashes are allowed at the borders of emphasis': OK
  2232. 826.44 s [pandoc] Single quotes can be followed by emphasized text: OK
  2233. 826.44 s [pandoc] Double quotes can be followed by emphasized text: OK
  2234. 826.44 s [pandoc] Basic Blocks
  2235. 826.44 s [pandoc] Paragraph: OK
  2236. 826.44 s [pandoc] Paragraph starting with an asterisk: OK
  2237. 826.44 s [pandoc] Paragraph containing asterisk at beginning of line: OK
  2238. 826.44 s [pandoc] Example block: OK
  2239. 826.44 s [pandoc] Example block surrounded by text: OK
  2240. 826.44 s [pandoc] Horizontal Rule: OK
  2241. 826.44 s [pandoc] Not a Horizontal Rule: OK
  2242. 826.44 s [pandoc] Comments
  2243. 826.44 s [pandoc] Comment Block: OK
  2244. 826.44 s [pandoc] Comment line: OK
  2245. 826.44 s [pandoc] Empty comment line: OK
  2246. 826.44 s [pandoc] Blocks and fragments
  2247. 826.44 s [pandoc] HTML block: OK
  2248. 826.44 s [pandoc] Quote block: OK
  2249. 826.44 s [pandoc] Verse block: OK
  2250. 826.44 s [pandoc] Verse block with blank lines: OK
  2251. 826.44 s [pandoc] Verse block with varying indentation: OK
  2252. 826.44 s [pandoc] Raw block LaTeX: OK
  2253. 826.44 s [pandoc] Raw LaTeX line: OK
  2254. 826.44 s [pandoc] Raw Beamer line: OK
  2255. 826.44 s [pandoc] Raw HTML line: OK
  2256. 826.44 s [pandoc] Export block HTML: OK
  2257. 826.44 s [pandoc] LaTeX fragment: OK
  2258. 826.44 s [pandoc] One-line LaTeX fragment: OK
  2259. 826.44 s [pandoc] LaTeX fragment with more arguments: OK
  2260. 826.44 s [pandoc] Convert blank lines in blocks to single newlines: OK
  2261. 826.44 s [pandoc] Accept `attr_html` attributes for generic block: OK
  2262. 826.44 s [pandoc] Headers
  2263. 826.44 s [pandoc] First Level Header: OK
  2264. 826.44 s [pandoc] Third Level Header: OK
  2265. 826.44 s [pandoc] Compact Headers with Paragraph: OK
  2266. 826.44 s [pandoc] Separated Headers with Paragraph: OK
  2267. 826.44 s [pandoc] Headers not preceded by a blank line: OK
  2268. 826.44 s [pandoc] Todo keywords
  2269. 826.44 s [pandoc] Header with known todo keyword: OK
  2270. 826.44 s [pandoc] Header marked as done: OK
  2271. 826.44 s [pandoc] emphasis in first word: OK
  2272. 826.44 s [pandoc] Header with unknown todo keyword: OK
  2273. 826.44 s [pandoc] Custom todo keywords: OK
  2274. 826.45 s [pandoc] Custom todo keywords with multiple done-states: OK
  2275. 826.45 s [pandoc] Tagged headers: OK
  2276. 826.45 s [pandoc] Untagged header containing colons: OK
  2277. 826.45 s [pandoc] Untagged header time followed by colon: OK
  2278. 826.45 s [pandoc] tag followed by text: OK
  2279. 826.45 s [pandoc] Header starting with strokeout text: OK
  2280. 826.45 s [pandoc] Comment Trees: OK
  2281. 826.45 s [pandoc] Nothing but a COMMENT header: OK
  2282. 826.45 s [pandoc] Tree with :noexport:: OK
  2283. 826.45 s [pandoc] Subtree with :noexport:: OK
  2284. 826.45 s [pandoc] Preferences are treated as header attributes: OK
  2285. 826.45 s [pandoc] Headers marked with a unnumbered property get a clas...: OK
  2286. 826.45 s [pandoc] planning information
  2287. 826.45 s [pandoc] Planning info is not included in output: OK
  2288. 826.45 s [pandoc] Properties after planning info are recognized: OK
  2289. 826.45 s [pandoc] Planning info followed by test: OK
  2290. 826.45 s [pandoc] third and forth level headers: OK
  2291. 826.45 s [pandoc] Figures
  2292. 826.45 s [pandoc] Figure: OK
  2293. 826.45 s [pandoc] Figure with no name: OK
  2294. 826.45 s [pandoc] Figure with `fig:` prefix in name: OK
  2295. 826.46 s [pandoc] Figure with HTML attributes: OK
  2296. 826.46 s [pandoc] LaTeX attributes are ignored: OK
  2297. 826.46 s [pandoc] Labelled figure: OK
  2298. 826.46 s [pandoc] Figure with empty caption: OK
  2299. 826.46 s [pandoc] Lists
  2300. 826.46 s [pandoc] Simple Bullet Lists: OK
  2301. 826.46 s [pandoc] Simple Bullet List with Ignored Counter Cookie: OK
  2302. 826.46 s [pandoc] Indented Bullet Lists: OK
  2303. 826.46 s [pandoc] Unindented *: OK
  2304. 826.46 s [pandoc] Multi-line Bullet Lists: OK
  2305. 826.46 s [pandoc] Nested Bullet Lists: OK
  2306. 826.46 s [pandoc] Bullet List with Decreasing Indent: OK
  2307. 826.46 s [pandoc] Header follows Bullet List: OK
  2308. 826.46 s [pandoc] Bullet List Unindented with trailing Header: OK
  2309. 826.46 s [pandoc] Empty bullet points: OK
  2310. 826.46 s [pandoc] Task list: OK
  2311. 826.46 s [pandoc] Task List with Counter Cookies: OK
  2312. 826.46 s [pandoc] Task with alphabetical markers and counter cookie: OK
  2313. 826.46 s [pandoc] Simple Ordered List: OK
  2314. 826.46 s [pandoc] Simple Ordered List with fancy lists extension: OK
  2315. 826.46 s [pandoc] Simple Ordered List with lower alpha marker: OK
  2316. 826.46 s [pandoc] Simple Ordered List with upper and lower alpha markers: OK
  2317. 826.46 s [pandoc] Simple Ordered List with Counter Cookie: OK
  2318. 826.46 s [pandoc] Simple Ordered List with Alphabetical Counter Cookie: OK
  2319. 826.46 s [pandoc] Simple Ordered List with Ignored Counter Cookie: OK
  2320. 826.46 s [pandoc] Simple Ordered List with Parens: OK
  2321. 826.46 s [pandoc] Indented Ordered List: OK
  2322. 826.47 s [pandoc] Empty ordered list item: OK
  2323. 826.47 s [pandoc] Empty ordered list item with fancy lists extension: OK
  2324. 826.47 s [pandoc] Empty ordered list item with counter cookie: OK
  2325. 826.47 s [pandoc] Nested Ordered Lists: OK
  2326. 826.47 s [pandoc] Ordered List in Bullet List: OK
  2327. 826.47 s [pandoc] Bullet List in Ordered List: OK
  2328. 826.47 s [pandoc] Definition List: OK
  2329. 826.47 s [pandoc] Definition list with multi-word term: OK
  2330. 826.47 s [pandoc] Compact definition list: OK
  2331. 826.47 s [pandoc] Definition List With Trailing Header: OK
  2332. 826.47 s [pandoc] Definition lists double-colon markers must be surrou...: OK
  2333. 826.47 s [pandoc] Loose bullet list: OK
  2334. 826.47 s [pandoc] Recognize preceding paragraphs in non-list contexts: OK
  2335. 826.47 s [pandoc] Markup after header and list: OK
  2336. 826.47 s [pandoc] CodeBlocks
  2337. 826.47 s [pandoc] Source block: OK
  2338. 826.47 s [pandoc] Source block with indented code: OK
  2339. 826.47 s [pandoc] Source block with tab-indented code: OK
  2340. 826.47 s [pandoc] Empty source block: OK
  2341. 826.47 s [pandoc] Source block between paragraphs: OK
  2342. 826.47 s [pandoc] Source block with babel arguments: OK
  2343. 826.47 s [pandoc] Source block with results and :exports both: OK
  2344. 826.47 s [pandoc] Source block with results and :exports code: OK
  2345. 826.47 s [pandoc] Source block with results and :exports results: OK
  2346. 826.47 s [pandoc] Source block with results and :exports none: OK
  2347. 826.47 s [pandoc] Source block with toggling header arguments: OK
  2348. 826.47 s [pandoc] Source block with line number switch: OK
  2349. 826.47 s [pandoc] Source block with multi-word parameter values: OK
  2350. 826.47 s [pandoc] Example block: OK
  2351. 826.47 s [pandoc] Code block with caption: OK
  2352. 826.47 s [pandoc] Non-letter chars in source block parameters: OK
  2353. 826.47 s [pandoc] Tables
  2354. 826.47 s [pandoc] Single cell table: OK
  2355. 826.48 s [pandoc] Multi cell table: OK
  2356. 826.48 s [pandoc] Multi line table: OK
  2357. 826.48 s [pandoc] Empty table: OK
  2358. 826.48 s [pandoc] Glider Table: OK
  2359. 826.48 s [pandoc] Table between Paragraphs: OK
  2360. 826.48 s [pandoc] Table with Header: OK
  2361. 826.48 s [pandoc] Table with final hline: OK
  2362. 826.48 s [pandoc] Table in a box: OK
  2363. 826.48 s [pandoc] Table with empty cells: OK
  2364. 826.48 s [pandoc] Table with empty rows: OK
  2365. 826.48 s [pandoc] Table with alignment row: OK
  2366. 826.48 s [pandoc] Pipe within text doesn't start a table: OK
  2367. 826.49 s [pandoc] Missing pipe at end of row: OK
  2368. 826.49 s [pandoc] Table with differing row lengths: OK
  2369. 826.49 s [pandoc] Table with caption: OK
  2370. 826.49 s [pandoc] named table: OK
  2371. 826.49 s [pandoc] Meta Information
  2372. 826.49 s [pandoc] Comments
  2373. 826.49 s [pandoc] Comment: OK
  2374. 826.49 s [pandoc] Hash not followed by space is text: OK
  2375. 826.49 s [pandoc] Comment surrounded by Text: OK
  2376. 826.49 s [pandoc] Export settings
  2377. 826.49 s [pandoc] Title: OK
  2378. 826.49 s [pandoc] Author
  2379. 826.49 s [pandoc] sets 'author' field: OK
  2380. 826.49 s [pandoc] Multiple author lines: OK
  2381. 826.49 s [pandoc] Date: OK
  2382. 826.49 s [pandoc] Description
  2383. 826.49 s [pandoc] Single line: OK
  2384. 826.49 s [pandoc] Multiline: OK
  2385. 826.49 s [pandoc] Subtitle: OK
  2386. 826.49 s [pandoc] Keywords: OK
  2387. 826.49 s [pandoc] Institute: OK
  2388. 826.49 s [pandoc] Document language: OK
  2389. 826.49 s [pandoc] Todo sequences
  2390. 826.49 s [pandoc] not included in document: OK
  2391. 826.49 s [pandoc] can contain multiple pipe characters: OK
  2392. 826.49 s [pandoc] LaTeX
  2393. 826.49 s [pandoc] LATEX_HEADER: OK
  2394. 826.49 s [pandoc] LATEX_HEADER_EXTRA: OK
  2395. 826.49 s [pandoc] LaTeX_CLASS
  2396. 826.49 s [pandoc] stored as documentclass: OK
  2397. 826.49 s [pandoc] last definition takes precedence: OK
  2398. 826.49 s [pandoc] LATEX_CLASS_OPTIONS as classoption: OK
  2399. 826.49 s [pandoc] HTML
  2400. 826.49 s [pandoc] HTML_HEAD values are added to header-includes: OK
  2401. 826.49 s [pandoc] HTML_HEAD_EXTRA behaves like HTML_HEAD: OK
  2402. 826.49 s [pandoc] Non-export keywords
  2403. 826.49 s [pandoc] #+link
  2404. 826.49 s [pandoc] Link abbreviation: OK
  2405. 826.49 s [pandoc] Link abbreviation, defined after first use: OK
  2406. 826.49 s [pandoc] Link abbreviation, URL encoded arguments: OK
  2407. 826.49 s [pandoc] Link abbreviation, append arguments: OK
  2408. 826.49 s [pandoc] emphasis config
  2409. 826.50 s [pandoc] Changing pre chars for emphasis: OK
  2410. 826.50 s [pandoc] Changing post chars for emphasis: OK
  2411. 826.50 s [pandoc] setting an invalid value restores the default: OK
  2412. 826.50 s [pandoc] Unknown keyword: OK
  2413. 826.50 s [pandoc] Properties drawer: OK
  2414. 826.50 s [pandoc] Logbook drawer: OK
  2415. 826.50 s [pandoc] Drawer surrounded by text: OK
  2416. 826.50 s [pandoc] Drawer markers must be the only text in the line: OK
  2417. 826.50 s [pandoc] Drawers can be arbitrary: OK
  2418. 826.50 s [pandoc] Anchor reference: OK
  2419. 826.50 s [pandoc] Search links are read as emph: OK
  2420. 826.50 s [pandoc] Link to nonexistent anchor: OK
  2421. 826.50 s [pandoc] Directives
  2422. 826.50 s [pandoc] export options
  2423. 826.50 s [pandoc] disable simple sub/superscript syntax: OK
  2424. 826.50 s [pandoc] directly select drawers to be exported: OK
  2425. 826.50 s [pandoc] exclude drawers from being exported: OK
  2426. 826.50 s [pandoc] don't include archive trees: OK
  2427. 826.50 s [pandoc] include complete archive trees: OK
  2428. 826.50 s [pandoc] include archive tree header only: OK
  2429. 826.50 s [pandoc] limit headline depth: OK
  2430. 826.50 s [pandoc] turn all headlines into lists: OK
  2431. 826.50 s [pandoc] preserve linebreaks as hard breaks: OK
  2432. 826.50 s [pandoc] disable author export: OK
  2433. 826.50 s [pandoc] disable creator export: OK
  2434. 826.50 s [pandoc] disable email export: OK
  2435. 826.50 s [pandoc] disable MathML-like entities: OK
  2436. 826.50 s [pandoc] Option f
  2437. 826.51 s [pandoc] disable inline footnotes: OK
  2438. 826.51 s [pandoc] disable reference footnotes: OK
  2439. 826.51 s [pandoc] disable inclusion of todo keywords: OK
  2440. 826.51 s [pandoc] remove tags from headlines: OK
  2441. 826.51 s [pandoc] LaTeX
  2442. 826.51 s [pandoc] Include LaTeX fragments
  2443. 826.51 s [pandoc] Inline command: OK
  2444. 826.51 s [pandoc] Alpha: OK
  2445. 826.51 s [pandoc] equation environment: OK
  2446. 826.51 s [pandoc] Ignore LaTeX fragments
  2447. 826.51 s [pandoc] Inline command: OK
  2448. 826.51 s [pandoc] MathML symbol (alpha): OK
  2449. 826.51 s [pandoc] equation environment: OK
  2450. 826.51 s [pandoc] Verbatim LaTeX
  2451. 826.51 s [pandoc] Inline command: OK
  2452. 826.51 s [pandoc] MathML symbol (alpha): OK
  2453. 826.51 s [pandoc] equation environment: OK
  2454. 826.51 s [pandoc] planning information
  2455. 826.51 s [pandoc] include planning info after headlines: OK
  2456. 826.51 s [pandoc] empty planning info is not included: OK
  2457. 826.51 s [pandoc] Option |
  2458. 826.51 s [pandoc] disable export of tables: OK
  2459. 826.52 s [pandoc] unknown options
  2460. 826.52 s [pandoc] unknown options are ignored: OK
  2461. 826.52 s [pandoc] highlighting after unknown option: OK
  2462. 826.52 s [pandoc] unknown option interleaved with known: OK
  2463. 826.52 s [pandoc] Include
  2464. 826.52 s [pandoc] file inclusion: OK
  2465. 826.52 s [pandoc] Included file belongs to item: OK
  2466. 826.52 s [pandoc] Default include preserves level: OK
  2467. 826.52 s [pandoc] Minlevel shifts level leftward: OK
  2468. 826.52 s [pandoc] Minlevel shifts level rightward: OK
  2469. 826.52 s [pandoc] Include file as source code snippet: OK
  2470. 826.52 s [pandoc] Include file as export snippet: OK
  2471. 826.52 s [pandoc] include directive is limited to one line: OK
  2472. 826.52 s [pandoc] RST
  2473. 826.52 s [pandoc] line block with blank line: OK
  2474. 826.52 s [pandoc] field list
  2475. 826.52 s [pandoc] general: OK
  2476. 826.52 s [pandoc] metadata: OK
  2477. 826.52 s [pandoc] with inline markup: OK
  2478. 826.52 s [pandoc] URLs with following punctuation: OK
  2479. 826.53 s [pandoc] Reference names with special characters: OK
  2480. 826.53 s [pandoc] Code directive with class and number-lines: OK
  2481. 826.53 s [pandoc] Code directive with number-lines, no line specified: OK
  2482. 826.53 s [pandoc] literal / line / code blocks
  2483. 826.53 s [pandoc] indented literal block: OK
  2484. 826.53 s [pandoc] line block with 3 lines: OK
  2485. 826.53 s [pandoc] line blocks with blank lines: OK
  2486. 826.53 s [pandoc] quoted literal block using >: OK
  2487. 826.53 s [pandoc] quoted literal block using | (not a line block): OK
  2488. 826.53 s [pandoc] class directive with single paragraph: OK
  2489. 826.53 s [pandoc] class directive with two paragraphs: OK
  2490. 826.53 s [pandoc] class directive around literal block: OK
  2491. 826.53 s [pandoc] interpreted text roles
  2492. 826.53 s [pandoc] literal role prefix: OK
  2493. 826.53 s [pandoc] literal role postfix: OK
  2494. 826.53 s [pandoc] literal text: OK
  2495. 826.53 s [pandoc] code role: OK
  2496. 826.53 s [pandoc] inherited code role: OK
  2497. 826.53 s [pandoc] custom code role with language field: OK
  2498. 826.53 s [pandoc] custom role with class field: OK
  2499. 826.53 s [pandoc] custom role with class field containing multiple whi...: OK
  2500. 826.53 s [pandoc] custom role with inherited class field: OK
  2501. 826.53 s [pandoc] custom role with unspecified parent role: OK
  2502. 826.53 s [pandoc] role with recursive inheritance: OK
  2503. 826.53 s [pandoc] unknown role: OK
  2504. 826.53 s [pandoc] footnotes
  2505. 826.53 s [pandoc] remove space before note: OK
  2506. 826.53 s [pandoc] inlines
  2507. 826.53 s [pandoc] links can contain an URI without being parsed twice ...: OK
  2508. 826.53 s [pandoc] inline markup cannot be nested: OK
  2509. 826.53 s [pandoc] bare URI parsing disabled inside emphasis (#4561): OK
  2510. 826.53 s [pandoc] include newlines: OK
  2511. 826.53 s [pandoc] RTF
  2512. 826.53 s [pandoc] footnote: OK
  2513. 826.53 s [pandoc] accent: OK
  2514. 826.53 s [pandoc] unicode: OK
  2515. 826.54 s [pandoc] image: OK
  2516. 826.54 s [pandoc] link: OK
  2517. 826.55 s [pandoc] heading: OK
  2518. 826.56 s [pandoc] formatting: OK
  2519. 826.56 s [pandoc] list_simple: OK
  2520. 826.58 s [pandoc] list_complex: OK (0.02s)
  2521. 826.58 s [pandoc] bookmark: OK
  2522. 826.58 s [pandoc] table_simple: OK
  2523. 826.58 s [pandoc] table_error_codes: OK
  2524. 826.58 s [pandoc] Docx
  2525. 826.58 s [pandoc] document
  2526. 826.58 s [pandoc] allow different document.xml file as defined in _rel...: OK
  2527. 826.58 s [pandoc] inlines
  2528. 826.58 s [pandoc] font formatting: OK
  2529. 826.58 s [pandoc] font formatting with character styles: OK
  2530. 826.59 s [pandoc] hyperlinks: OK
  2531. 826.59 s [pandoc] hyperlinks in <w:instrText> tag: OK
  2532. 826.59 s [pandoc] nested fields with <w:instrText> tag: OK
  2533. 826.59 s [pandoc] empty fields with <w:instrText> tag: OK
  2534. 826.59 s [pandoc] pageref hyperlinks in <w:instrText> tag: OK
  2535. 826.59 s [pandoc] inline image: OK
  2536. 826.59 s [pandoc] VML image: OK
  2537. 826.59 s [pandoc] VML image as object: OK
  2538. 826.59 s [pandoc] inline image in links: OK
  2539. 826.59 s [pandoc] handling unicode input: OK
  2540. 826.59 s [pandoc] literal tabs: OK
  2541. 826.59 s [pandoc] special punctuation: OK
  2542. 826.59 s [pandoc] normalizing inlines: OK
  2543. 826.59 s [pandoc] normalizing inlines deep inside blocks: OK
  2544. 826.59 s [pandoc] move trailing spaces outside of formatting: OK
  2545. 826.59 s [pandoc] remove trailing spaces from last inline: OK
  2546. 826.59 s [pandoc] inline code (with VerbatimChar style): OK
  2547. 826.59 s [pandoc] inline code in subscript and superscript: OK
  2548. 826.59 s [pandoc] inlines inside of Structured Document Tags: OK
  2549. 826.59 s [pandoc] Structured Document Tags in footnotes: OK
  2550. 826.60 s [pandoc] nested Structured Document Tags: OK
  2551. 826.60 s [pandoc] nested Smart Tags: OK
  2552. 826.60 s [pandoc] remove anchor spans with nothing pointing to them: OK
  2553. 826.60 s [pandoc] collapse overlapping targets (anchor spans): OK
  2554. 826.60 s [pandoc] anchor in header after anchor: OK
  2555. 826.61 s [pandoc] text in shape format: OK
  2556. 826.61 s [pandoc] blocks
  2557. 826.61 s [pandoc] headers: OK
  2558. 826.61 s [pandoc] headers already having auto identifiers: OK
  2559. 826.61 s [pandoc] avoid zero-level headers: OK
  2560. 826.61 s [pandoc] nested anchor spans in header: OK
  2561. 826.61 s [pandoc] single numbered item not made into list: OK
  2562. 826.61 s [pandoc] enumerated headers not made into numbered list: OK
  2563. 826.61 s [pandoc] i18n blocks (headers and blockquotes): OK
  2564. 826.61 s [pandoc] lists: OK
  2565. 826.61 s [pandoc] compact lists: OK
  2566. 826.61 s [pandoc] lists with level overrides: OK
  2567. 826.61 s [pandoc] lists continuing after interruption: OK
  2568. 826.61 s [pandoc] lists restarting after interruption: OK
  2569. 826.61 s [pandoc] sublists reset numbering to 1: OK
  2570. 826.61 s [pandoc] definition lists: OK
  2571. 826.62 s [pandoc] task lists: OK
  2572. 826.62 s [pandoc] custom defined lists in styles: OK
  2573. 826.62 s [pandoc] user deletes bullet after list item (=> part of item...: OK
  2574. 826.62 s [pandoc] user deletes bullet after par (=> new par): OK
  2575. 826.62 s [pandoc] footnotes and endnotes: OK
  2576. 826.62 s [pandoc] links in footnotes and endnotes: OK
  2577. 826.62 s [pandoc] blockquotes (parsing indent as blockquote): OK
  2578. 826.62 s [pandoc] blockquotes (parsing indent relative to the indent o...: OK
  2579. 826.63 s [pandoc] hanging indents: OK
  2580. 826.63 s [pandoc] tables: OK
  2581. 826.63 s [pandoc] tables with lists in cells: OK
  2582. 826.64 s [pandoc] a table with a header which contains rowspans greate...: OK
  2583. 826.64 s [pandoc] tables with one row: OK
  2584. 826.64 s [pandoc] tables with just one row, which is a header: OK
  2585. 826.64 s [pandoc] tables with variable width: OK
  2586. 826.64 s [pandoc] tables with captions which contain a Table field: OK
  2587. 826.65 s [pandoc] tables with captions which don't contain a Table field: OK
  2588. 826.65 s [pandoc] code block: OK
  2589. 826.65 s [pandoc] combine adjacent code blocks: OK
  2590. 826.65 s [pandoc] dropcap paragraphs: OK
  2591. 826.65 s [pandoc] citations
  2592. 826.66 s [pandoc] zotero with -citations: OK
  2593. 826.67 s [pandoc] zotero with +citations: OK (0.01s)
  2594. 826.67 s [pandoc] mendeley with -citations: OK
  2595. 826.67 s [pandoc] mendeley with +citations: OK
  2596. 826.67 s [pandoc] track changes
  2597. 826.67 s [pandoc] insertion (default): OK
  2598. 826.67 s [pandoc] insert insertion (accept): OK
  2599. 826.67 s [pandoc] remove insertion (reject): OK
  2600. 826.67 s [pandoc] deletion (default): OK
  2601. 826.67 s [pandoc] remove deletion (accept): OK
  2602. 826.67 s [pandoc] insert deletion (reject): OK
  2603. 826.67 s [pandoc] keep insertion (all): OK
  2604. 826.67 s [pandoc] keep deletion (all): OK
  2605. 826.67 s [pandoc] move text (accept): OK
  2606. 826.67 s [pandoc] move text (reject): OK
  2607. 826.67 s [pandoc] move text (all): OK
  2608. 826.67 s [pandoc] comments (accept -- no comments): OK
  2609. 826.68 s [pandoc] comments (reject -- comments): OK
  2610. 826.68 s [pandoc] comments (all comments): OK
  2611. 826.68 s [pandoc] paragraph insertion/deletion (accept): OK
  2612. 826.68 s [pandoc] paragraph insertion/deletion (reject): OK
  2613. 826.68 s [pandoc] paragraph insertion/deletion (all): OK
  2614. 826.68 s [pandoc] paragraph insertion/deletion (all): OK
  2615. 826.68 s [pandoc] comment warnings (accept -- no warnings): OK
  2616. 826.68 s [pandoc] comment warnings (reject -- no warnings): OK
  2617. 826.68 s [pandoc] comment warnings (all): OK
  2618. 826.68 s [pandoc] comments (with styles extension): OK
  2619. 826.68 s [pandoc] media
  2620. 826.68 s [pandoc] image extraction: OK
  2621. 826.68 s [pandoc] custom styles
  2622. 826.68 s [pandoc] custom styles (`+styles`) not enabled (default): OK
  2623. 826.68 s [pandoc] custom styles (`+styles`) enabled: OK
  2624. 826.68 s [pandoc] custom styles (`+styles`): Compact style is removed ...: OK
  2625. 826.68 s [pandoc] metadata
  2626. 826.68 s [pandoc] metadata fields: OK
  2627. 826.68 s [pandoc] stop recording metadata with normal text: OK
  2628. 826.68 s [pandoc] ODT
  2629. 826.69 s [pandoc] blockquote2: OK
  2630. 826.69 s [pandoc] bold: OK
  2631. 826.69 s [pandoc] endnote: OK
  2632. 826.69 s [pandoc] externalLink: OK
  2633. 826.69 s [pandoc] footnote: OK
  2634. 826.69 s [pandoc] formula: OK
  2635. 826.69 s [pandoc] headers: OK
  2636. 826.69 s [pandoc] italic: OK
  2637. 826.69 s [pandoc] paragraph: OK
  2638. 826.69 s [pandoc] strikeout: OK
  2639. 826.69 s [pandoc] underlined: OK
  2640. 826.69 s [pandoc] blockquote: OK
  2641. 826.69 s [pandoc] image: OK
  2642. 826.69 s [pandoc] imageIndex: OK
  2643. 826.69 s [pandoc] imageWithCaption: OK
  2644. 826.70 s [pandoc] inlinedCode: OK
  2645. 826.70 s [pandoc] listContinueNumbering: OK
  2646. 826.70 s [pandoc] listContinueNumbering2: OK
  2647. 826.70 s [pandoc] orderedListMixed: OK
  2648. 826.71 s [pandoc] orderedListRoman: OK
  2649. 826.71 s [pandoc] orderedListSimple: OK
  2650. 826.71 s [pandoc] orderedListHeader: OK
  2651. 826.71 s [pandoc] referenceToChapter: OK
  2652. 826.71 s [pandoc] referenceToListItem: OK
  2653. 826.71 s [pandoc] referenceToText: OK
  2654. 826.71 s [pandoc] simpleTable: OK
  2655. 826.72 s [pandoc] simpleTableWithCaption: OK
  2656. 826.72 s [pandoc] tab: OK
  2657. 826.72 s [pandoc] textMixedStyles: OK
  2658. 826.72 s [pandoc] tableWithContents: OK
  2659. 826.72 s [pandoc] unicode: OK
  2660. 826.72 s [pandoc] unorderedList: OK
  2661. 826.72 s [pandoc] unorderedListHeader: OK
  2662. 826.72 s [pandoc] Txt2Tags
  2663. 826.72 s [pandoc] Inlines
  2664. 826.72 s [pandoc] Plain String: OK
  2665. 826.72 s [pandoc] Emphasis: OK
  2666. 826.72 s [pandoc] Strong: OK
  2667. 826.72 s [pandoc] Strong Emphasis: OK
  2668. 826.72 s [pandoc] Strikeout: OK
  2669. 826.72 s [pandoc] Verbatim: OK
  2670. 826.72 s [pandoc] Symbol: OK
  2671. 826.72 s [pandoc] No empty markup: OK
  2672. 826.72 s [pandoc] Inline markup is greedy: OK
  2673. 826.72 s [pandoc] Markup must be greedy: OK
  2674. 826.72 s [pandoc] Inlines must be glued: OK
  2675. 826.72 s [pandoc] Macros: Date: OK
  2676. 826.72 s [pandoc] Macros: Mod Time: OK
  2677. 826.72 s [pandoc] Macros: Infile: OK
  2678. 826.72 s [pandoc] Macros: Outfile: OK
  2679. 826.72 s [pandoc] Autolink: OK
  2680. 826.72 s [pandoc] JPEG Image: OK
  2681. 826.72 s [pandoc] PNG Image: OK
  2682. 826.72 s [pandoc] Link: OK
  2683. 826.72 s [pandoc] Image link: OK
  2684. 826.73 s [pandoc] Invalid link: No trailing space: OK
  2685. 826.73 s [pandoc] Basic Blocks
  2686. 826.73 s [pandoc] Paragraph, lines grouped together: OK
  2687. 826.73 s [pandoc] Paragraph, ignore leading and trailing spaces: OK
  2688. 826.73 s [pandoc] Comment line in paragraph: OK
  2689. 826.73 s [pandoc] Paragraph: OK
  2690. 826.73 s [pandoc] First Level Header: OK
  2691. 826.73 s [pandoc] Third Level Header: OK
  2692. 826.73 s [pandoc] Header with label: OK
  2693. 826.73 s [pandoc] Invalid header, mismatched delimiters: OK
  2694. 826.73 s [pandoc] Invalid header, spaces in label: OK
  2695. 826.73 s [pandoc] Invalid header, invalid label character: OK
  2696. 826.73 s [pandoc] Headers not preceded by a blank line: OK
  2697. 826.73 s [pandoc] Paragraph starting with an equals: OK
  2698. 826.73 s [pandoc] Paragraph containing asterisk at beginning of line: OK
  2699. 826.73 s [pandoc] Horizontal Rule: OK
  2700. 826.73 s [pandoc] Comment Block: OK
  2701. 826.73 s [pandoc] Lists
  2702. 826.73 s [pandoc] Simple Bullet Lists: OK
  2703. 826.73 s [pandoc] Indented Bullet Lists: OK
  2704. 826.73 s [pandoc] Nested Bullet Lists: OK
  2705. 826.73 s [pandoc] Simple Ordered List: OK
  2706. 826.73 s [pandoc] Indented Ordered List: OK
  2707. 826.73 s [pandoc] Nested Ordered Lists: OK
  2708. 826.73 s [pandoc] Ordered List in Bullet List: OK
  2709. 826.73 s [pandoc] Bullet List in Ordered List: OK
  2710. 826.73 s [pandoc] Definition List: OK
  2711. 826.73 s [pandoc] Loose bullet list: OK
  2712. 826.73 s [pandoc] Tables
  2713. 826.73 s [pandoc] Single cell table: OK
  2714. 826.73 s [pandoc] Multi cell table: OK
  2715. 826.74 s [pandoc] Multi line table: OK
  2716. 826.74 s [pandoc] Empty table: OK
  2717. 826.74 s [pandoc] Glider Table: OK
  2718. 826.74 s [pandoc] Table with Header: OK
  2719. 826.74 s [pandoc] Table alignment determined by spacing: OK
  2720. 826.74 s [pandoc] Pipe within text doesn't start a table: OK
  2721. 826.74 s [pandoc] Table with differing row lengths: OK
  2722. 826.74 s [pandoc] Blocks and fragments
  2723. 826.74 s [pandoc] Source block: OK
  2724. 826.74 s [pandoc] tagged block: OK
  2725. 826.74 s [pandoc] Quote block: OK
  2726. 826.74 s [pandoc] EPUB
  2727. 826.74 s [pandoc] EPUB Mediabag
  2728. 826.74 s [pandoc] features bag: OK
  2729. 826.77 s [pandoc] EPUB3 cover bag: OK (0.02s)
  2730. 826.77 s [pandoc] EPUB3 no cover bag: OK
  2731. 826.77 s [pandoc] EPUB2 picture bag: OK
  2732. 826.77 s [pandoc] EPUB2 cover bag: OK
  2733. 826.77 s [pandoc] EPUB2 no cover bag: OK
  2734. 826.77 s [pandoc] Muse
  2735. 826.77 s [pandoc] Inlines
  2736. 826.77 s [pandoc] Plain String: OK
  2737. 826.77 s [pandoc] Muse is not XML: OK
  2738. 826.77 s [pandoc] Emphasis: OK
  2739. 826.77 s [pandoc] Newline in the beginning of emphasis: OK
  2740. 826.77 s [pandoc] Newline in the end of emphasis: OK
  2741. 826.77 s [pandoc] Comma after closing *: OK
  2742. 826.77 s [pandoc] Letter after closing *: OK
  2743. 826.78 s [pandoc] Letter before opening *: OK
  2744. 826.78 s [pandoc] Digit after closing *: OK
  2745. 826.78 s [pandoc] Emphasis tag: OK
  2746. 826.78 s [pandoc] Strong: OK
  2747. 826.78 s [pandoc] Strong tag: OK
  2748. 826.78 s [pandoc] Strong Emphasis: OK
  2749. 826.78 s [pandoc] Strong inside emphasis: OK
  2750. 826.78 s [pandoc] Emphasis inside strong: OK
  2751. 826.78 s [pandoc] Opening asterisk can't be preceded by another one: OK
  2752. 826.78 s [pandoc] Asterisk between words does not terminate emphasis: OK
  2753. 826.78 s [pandoc] Two asterisks between words do not terminate emphasis: OK
  2754. 826.78 s [pandoc] Three asterisks between words do not terminate empha...: OK
  2755. 826.78 s [pandoc] Two asterisks between words do not terminate strong: OK
  2756. 826.78 s [pandoc] Three asterisks between words do not terminate strong: OK
  2757. 826.78 s [pandoc] Three asterisks between words do not terminate stron...: OK
  2758. 826.78 s [pandoc] Six asterisks between words do not terminate strong ...: OK
  2759. 826.78 s [pandoc] Underline: OK
  2760. 826.78 s [pandoc] Superscript tag: OK
  2761. 826.78 s [pandoc] Subscript tag: OK
  2762. 826.78 s [pandoc] Strikeout tag: OK
  2763. 826.78 s [pandoc] Opening inline tags: OK
  2764. 826.78 s [pandoc] Closing inline tags: OK
  2765. 826.78 s [pandoc] Tag soup: OK
  2766. 826.78 s [pandoc] No multiparagraph inline tags: OK
  2767. 826.78 s [pandoc] Linebreak: OK
  2768. 826.79 s [pandoc] Trailing whitespace inside paragraph: OK
  2769. 826.79 s [pandoc] Non-breaking space: OK
  2770. 826.79 s [pandoc] Single ~: OK
  2771. 826.79 s [pandoc] Code markup
  2772. 826.79 s [pandoc] Code: OK
  2773. 826.79 s [pandoc] Not code: OK
  2774. 826.79 s [pandoc] Not code if closing = is detached: OK
  2775. 826.79 s [pandoc] Not code if opening = is detached: OK
  2776. 826.79 s [pandoc] Code if followed by comma: OK
  2777. 826.79 s [pandoc] Not code if followed by digit: OK
  2778. 826.79 s [pandoc] One character code: OK
  2779. 826.79 s [pandoc] Code with equal sign: OK
  2780. 826.79 s [pandoc] Three = characters is not a code: OK
  2781. 826.79 s [pandoc] Multiline code markup: OK
  2782. 826.79 s [pandoc] No multiparagraph code: OK
  2783. 826.79 s [pandoc] Code at the beginning of paragraph but not first col...: OK
  2784. 826.79 s [pandoc] Code tag: OK
  2785. 826.79 s [pandoc] Math tag: OK
  2786. 826.79 s [pandoc] Verbatim tag: OK
  2787. 826.79 s [pandoc] Verbatim inside code: OK
  2788. 826.79 s [pandoc] Verbatim tag after text: OK
  2789. 826.79 s [pandoc] Verbatim tag escapes block level markup: OK
  2790. 826.79 s [pandoc] Class tag: OK
  2791. 826.79 s [pandoc] Class tag without name: OK
  2792. 826.79 s [pandoc] RTL: OK
  2793. 826.79 s [pandoc] LTR: OK
  2794. 826.79 s [pandoc] Nested "</em>" inside em tag: OK
  2795. 826.79 s [pandoc] Links
  2796. 826.79 s [pandoc] Link without description: OK
  2797. 826.80 s [pandoc] Link with description: OK
  2798. 826.80 s [pandoc] Link with empty description: OK
  2799. 826.80 s [pandoc] Image: OK
  2800. 826.80 s [pandoc] Closing bracket is not allowed in image filename: OK
  2801. 826.80 s [pandoc] Image with description: OK
  2802. 826.80 s [pandoc] Image with space in filename: OK
  2803. 826.80 s [pandoc] Image with width: OK
  2804. 826.80 s [pandoc] At least one space is required between image filenam...: OK
  2805. 826.80 s [pandoc] Left-aligned image with width: OK
  2806. 826.80 s [pandoc] Right-aligned image with width: OK
  2807. 826.80 s [pandoc] Image link: OK
  2808. 826.80 s [pandoc] Image link with description: OK
  2809. 826.80 s [pandoc] No implicit links: OK
  2810. 826.80 s [pandoc] Link with empty URL: OK
  2811. 826.80 s [pandoc] No footnotes inside links: OK
  2812. 826.80 s [pandoc] Image inside link: OK
  2813. 826.80 s [pandoc] Link inside image description: OK
  2814. 826.80 s [pandoc] Literal
  2815. 826.80 s [pandoc] Inline literal: OK
  2816. 826.80 s [pandoc] Single inline literal in paragraph: OK
  2817. 826.80 s [pandoc] Blocks
  2818. 826.80 s [pandoc] Block elements end paragraphs: OK
  2819. 826.80 s [pandoc] Horizontal rule
  2820. 826.80 s [pandoc] Less than 4 dashes is not a horizontal rule: OK
  2821. 826.80 s [pandoc] 4 dashes is a horizontal rule: OK
  2822. 826.80 s [pandoc] 5 dashes is a horizontal rule: OK
  2823. 826.80 s [pandoc] 4 dashes with spaces is a horizontal rule: OK
  2824. 826.81 s [pandoc] Page breaks
  2825. 826.81 s [pandoc] Page break: OK
  2826. 826.81 s [pandoc] Page break with trailing space: OK
  2827. 826.81 s [pandoc] Paragraphs
  2828. 826.81 s [pandoc] Simple paragraph: OK
  2829. 826.81 s [pandoc] Indented paragraph: OK
  2830. 826.81 s [pandoc] Indentation in the middle of paragraph: OK
  2831. 826.81 s [pandoc] Quote: OK
  2832. 826.81 s [pandoc] Indentation does not indicate quote inside quote tag: OK
  2833. 826.81 s [pandoc] Multiline quote: OK
  2834. 826.81 s [pandoc] Div
  2835. 826.81 s [pandoc] Div without id: OK
  2836. 826.81 s [pandoc] Div with id: OK
  2837. 826.81 s [pandoc] Biblio: OK
  2838. 826.81 s [pandoc] Play: OK
  2839. 826.81 s [pandoc] Verse: OK
  2840. 826.81 s [pandoc] Verse in list: OK
  2841. 826.81 s [pandoc] Verse line starting with emphasis: OK
  2842. 826.81 s [pandoc] Multiline verse in list: OK
  2843. 826.81 s [pandoc] Paragraph after verse in list: OK
  2844. 826.82 s [pandoc] Empty quote tag: OK
  2845. 826.82 s [pandoc] Quote tag: OK
  2846. 826.82 s [pandoc] Nested quote tag: OK
  2847. 826.82 s [pandoc] Indented quote inside list: OK
  2848. 826.82 s [pandoc] Verse tag: OK
  2849. 826.82 s [pandoc] Verse tag with empty line inside: OK
  2850. 826.82 s [pandoc] Verse tag with verbatim close tag inside: OK
  2851. 826.82 s [pandoc] Example
  2852. 826.82 s [pandoc] Braces on separate lines: OK
  2853. 826.82 s [pandoc] Spaces after opening braces: OK
  2854. 826.82 s [pandoc] One blank line in the beginning: OK
  2855. 826.82 s [pandoc] One blank line in the end: OK
  2856. 826.82 s [pandoc] Indented braces: OK
  2857. 826.82 s [pandoc] Tabs: OK
  2858. 826.82 s [pandoc] One line: OK
  2859. 826.82 s [pandoc] Example tag
  2860. 826.82 s [pandoc] Tags on separate lines: OK
  2861. 826.82 s [pandoc] One line: OK
  2862. 826.82 s [pandoc] One blank line in the beginning: OK
  2863. 826.82 s [pandoc] One blank line in the end: OK
  2864. 826.82 s [pandoc] Example inside list: OK
  2865. 826.82 s [pandoc] Empty example inside list: OK
  2866. 826.82 s [pandoc] Example inside list with empty lines: OK
  2867. 826.82 s [pandoc] Indented example inside list: OK
  2868. 826.82 s [pandoc] Example inside definition list: OK
  2869. 826.82 s [pandoc] Example inside list definition with empty lines: OK
  2870. 826.82 s [pandoc] Example inside note: OK
  2871. 826.83 s [pandoc] Literal blocks
  2872. 826.83 s [pandoc] Literal block: OK
  2873. 826.83 s [pandoc] Center: OK
  2874. 826.83 s [pandoc] Right: OK
  2875. 826.83 s [pandoc] Comments
  2876. 826.83 s [pandoc] Comment tag: OK
  2877. 826.83 s [pandoc] Line comment: OK
  2878. 826.83 s [pandoc] Empty comment: OK
  2879. 826.83 s [pandoc] Text after empty comment: OK
  2880. 826.83 s [pandoc] Not a comment (does not start with a semicolon): OK
  2881. 826.83 s [pandoc] Not a comment (has no space after semicolon): OK
  2882. 826.83 s [pandoc] Not a comment (semicolon not in the first column): OK
  2883. 826.83 s [pandoc] Headers
  2884. 826.83 s [pandoc] Part: OK
  2885. 826.83 s [pandoc] Chapter: OK
  2886. 826.83 s [pandoc] Section: OK
  2887. 826.83 s [pandoc] Subsection: OK
  2888. 826.83 s [pandoc] Subsubsection: OK
  2889. 826.83 s [pandoc] Whitespace is required after *: OK
  2890. 826.83 s [pandoc] No headers in footnotes: OK
  2891. 826.83 s [pandoc] No headers in quotes: OK
  2892. 826.83 s [pandoc] Headers consume anchors: OK
  2893. 826.83 s [pandoc] Headers don't consume anchors separated with a blank...: OK
  2894. 826.83 s [pandoc] Headers terminate paragraph: OK
  2895. 826.83 s [pandoc] Headers terminate lists: OK
  2896. 826.83 s [pandoc] Paragraphs terminate Emacs Muse headers: OK
  2897. 826.83 s [pandoc] Paragraphs don't terminate Text::Amuse headers: OK
  2898. 826.83 s [pandoc] Empty header: OK
  2899. 826.83 s [pandoc] Auto identifiers: OK
  2900. 826.83 s [pandoc] Directives
  2901. 826.83 s [pandoc] Title: OK
  2902. 826.83 s [pandoc] Disable tables: OK
  2903. 826.83 s [pandoc] Multiple directives: OK
  2904. 826.83 s [pandoc] Multiline directive: OK
  2905. 826.83 s [pandoc] Amusewiki's #cover is translated to pandoc's #cover-...: OK
  2906. 826.83 s [pandoc] Anchors
  2907. 826.83 s [pandoc] Anchor: OK
  2908. 826.83 s [pandoc] Anchor cannot start with a number: OK
  2909. 826.83 s [pandoc] Not anchor if starts with a space: OK
  2910. 826.83 s [pandoc] Anchor inside a paragraph: OK
  2911. 826.83 s [pandoc] Anchor with "-": OK
  2912. 826.83 s [pandoc] Footnotes
  2913. 826.83 s [pandoc] Simple footnote: OK
  2914. 826.84 s [pandoc] Simple secondary footnote: OK
  2915. 826.84 s [pandoc] Missing footnote: OK
  2916. 826.84 s [pandoc] Missing secondary note: OK
  2917. 826.84 s [pandoc] Wrong note type: OK
  2918. 826.84 s [pandoc] Recursive footnote: OK
  2919. 826.84 s [pandoc] Nested footnotes: OK
  2920. 826.84 s [pandoc] No zero footnotes: OK
  2921. 826.84 s [pandoc] Footnotes can't start with zero: OK
  2922. 826.84 s [pandoc] Multiparagraph footnotes
  2923. 826.84 s [pandoc] Amusewiki multiparagraph footnotes: OK
  2924. 826.84 s [pandoc] Note continuation with verse: OK
  2925. 826.84 s [pandoc] Footnote ending in self-terminating element and foll...: OK
  2926. 826.84 s [pandoc] Footnote starting with empty line: OK
  2927. 826.84 s [pandoc] Indentation in footnote starting with empty line: OK
  2928. 826.85 s [pandoc] Emacs multiparagraph footnotes: OK
  2929. 826.85 s [pandoc] Tables
  2930. 826.85 s [pandoc] Two cell table: OK
  2931. 826.85 s [pandoc] Table with multiple words: OK
  2932. 826.85 s [pandoc] Not a table: OK
  2933. 826.85 s [pandoc] Not a table again: OK
  2934. 826.85 s [pandoc] Two line table: OK
  2935. 826.85 s [pandoc] Table with one header: OK
  2936. 826.85 s [pandoc] Table with two headers: OK
  2937. 826.86 s [pandoc] Header and footer reordering: OK
  2938. 826.86 s [pandoc] Table with caption: OK
  2939. 826.86 s [pandoc] Table caption with +: OK
  2940. 826.86 s [pandoc] Caption without table: OK
  2941. 826.86 s [pandoc] Table indented with space: OK
  2942. 826.86 s [pandoc] Empty cells: OK
  2943. 826.86 s [pandoc] Empty cell in the middle: OK
  2944. 826.86 s [pandoc] Grid table: OK
  2945. 826.86 s [pandoc] Grid table inside list: OK
  2946. 826.87 s [pandoc] Grid table with two rows: OK
  2947. 826.87 s [pandoc] Grid table inside grid table: OK
  2948. 826.87 s [pandoc] Grid table with example: OK
  2949. 826.87 s [pandoc] Lists
  2950. 826.87 s [pandoc] Bullet list: OK
  2951. 826.87 s [pandoc] Ordered list: OK
  2952. 826.87 s [pandoc] Ordered list with implicit numbers: OK
  2953. 826.87 s [pandoc] Ordered list with roman numerals: OK
  2954. 826.87 s [pandoc] Bullet list with empty items: OK
  2955. 826.87 s [pandoc] Ordered list with empty items: OK
  2956. 826.87 s [pandoc] Bullet list with last item empty: OK
  2957. 826.87 s [pandoc] Nested lists
  2958. 826.87 s [pandoc] Nested bullet list: OK
  2959. 826.87 s [pandoc] Nested ordered list: OK
  2960. 826.87 s [pandoc] Mixed nested list: OK
  2961. 826.87 s [pandoc] Text::Amuse includes only one space in list marker: OK
  2962. 826.87 s [pandoc] List continuation: OK
  2963. 826.87 s [pandoc] List continuation after nested list: OK
  2964. 826.87 s [pandoc] Blank lines
  2965. 826.87 s [pandoc] Blank lines between list items are not required: OK
  2966. 826.88 s [pandoc] One blank line between list items is allowed: OK
  2967. 826.88 s [pandoc] Two blank lines separate lists: OK
  2968. 826.88 s [pandoc] No blank line after multiline first item: OK
  2969. 826.88 s [pandoc] One blank line after multiline first item: OK
  2970. 826.88 s [pandoc] Two blank lines after multiline first item: OK
  2971. 826.88 s [pandoc] No blank line after list continuation: OK
  2972. 826.88 s [pandoc] One blank line after list continuation: OK
  2973. 826.88 s [pandoc] Two blank lines after list continuation: OK
  2974. 826.88 s [pandoc] No blank line after blockquote: OK
  2975. 826.88 s [pandoc] One blank line after blockquote: OK
  2976. 826.88 s [pandoc] Two blank lines after blockquote: OK
  2977. 826.88 s [pandoc] No blank line after verse: OK
  2978. 826.88 s [pandoc] One blank line after verse: OK
  2979. 826.88 s [pandoc] Two blank lines after verse: OK
  2980. 826.88 s [pandoc] List ending in self-terminating element and followed...: OK
  2981. 826.88 s [pandoc] Not a definition list: OK
  2982. 826.88 s [pandoc] Emacs Muse definition list: OK
  2983. 826.88 s [pandoc] Definition list: OK
  2984. 826.88 s [pandoc] Definition list term cannot include newline: OK
  2985. 826.88 s [pandoc] One-line definition list: OK
  2986. 826.88 s [pandoc] Definition list term may include single colon: OK
  2987. 826.88 s [pandoc] Definition list term with emphasis: OK
  2988. 826.89 s [pandoc] Definition list term with :: inside code: OK
  2989. 826.89 s [pandoc] Multi-line definition lists: OK
  2990. 826.89 s [pandoc] Definition list with verse: OK
  2991. 826.89 s [pandoc] Definition list with table: OK
  2992. 826.89 s [pandoc] Definition list with table inside bullet list: OK
  2993. 826.89 s [pandoc] Multi-line definition lists from Emacs Muse manual: OK
  2994. 826.89 s [pandoc] Multi-line definition lists from Emacs Muse manual w...: OK
  2995. 826.89 s [pandoc] One-line nested definition list: OK
  2996. 826.90 s [pandoc] Nested definition list: OK
  2997. 826.90 s [pandoc] Definition lists with multiple descriptions
  2998. 826.90 s [pandoc] Correctly indented second description: OK
  2999. 826.90 s [pandoc] Incorrectly indented second description: OK
  3000. 826.90 s [pandoc] Two blank lines separate definition lists: OK
  3001. 826.90 s [pandoc] No headers in list continuation: OK
  3002. 826.90 s [pandoc] Bullet list inside a tag: OK
  3003. 826.90 s [pandoc] Ordered list inside a tag: OK
  3004. 826.90 s [pandoc] Do not consume whitespace while looking for end tag: OK
  3005. 826.90 s [pandoc] Unclosed quote tag: OK
  3006. 826.90 s [pandoc] Unclosed quote tag inside list: OK
  3007. 826.90 s [pandoc] No indented closing tags: OK
  3008. 826.90 s [pandoc] Creole
  3009. 826.90 s [pandoc] Basic Text Formatting
  3010. 826.90 s [pandoc] bold, single line, fully delimited: OK
  3011. 826.90 s [pandoc] italics, single line, fully delimited: OK
  3012. 826.90 s [pandoc] bold in italics, fully delimited: OK
  3013. 826.90 s [pandoc] italics in bold, fully delimited: OK
  3014. 826.90 s [pandoc] escape bold marker: OK
  3015. 826.90 s [pandoc] escape italics marker: OK
  3016. 826.90 s [pandoc] inline nowiki, simple: OK
  3017. 826.90 s [pandoc] inline nowiki, curly braces inside: OK
  3018. 826.90 s [pandoc] placeholder: OK
  3019. 826.90 s [pandoc] placeholder escaped: OK
  3020. 826.90 s [pandoc] Headers
  3021. 826.90 s [pandoc] header level 1, no space, no trailing =: OK
  3022. 826.90 s [pandoc] header level 1, leading space, trailing =: OK
  3023. 826.90 s [pandoc] header level 2, no space, no trailing =: OK
  3024. 826.90 s [pandoc] header level 2, leading space, no trailing =: OK
  3025. 826.90 s [pandoc] header level 3, no space, no trailing =: OK
  3026. 826.90 s [pandoc] header level 3, no space, > 3 trailing =: OK
  3027. 826.90 s [pandoc] header level 4, no space, no trailing =: OK
  3028. 826.90 s [pandoc] header level 4, no space, < 4 trailing =: OK
  3029. 826.90 s [pandoc] header level 5, no space, no trailing =: OK
  3030. 826.90 s [pandoc] header level 6, no space, no trailing =: OK
  3031. 826.90 s [pandoc] Paragraphs
  3032. 826.90 s [pandoc] paragraphs: multiple, one line: OK
  3033. 826.90 s [pandoc] Lists
  3034. 826.91 s [pandoc] unordered list, two entries, one separating space: OK
  3035. 826.91 s [pandoc] unordered list, three entries, one separating space: OK
  3036. 826.91 s [pandoc] para followed by, unordered list, two entries, one s...: OK
  3037. 826.91 s [pandoc] nested unordered list, one separating space: OK
  3038. 826.91 s [pandoc] nested many unordered lists, one separating space: OK
  3039. 826.91 s [pandoc] nested unordered list, mixed separating space: OK
  3040. 826.91 s [pandoc] nested unordered list, one separating space, trailin...: OK
  3041. 826.91 s [pandoc] ordered list, two entries, one separating space: OK
  3042. 826.91 s [pandoc] ordered list, three entries, one separating space: OK
  3043. 826.91 s [pandoc] para followed by, ordered list, two entries, one sep...: OK
  3044. 826.91 s [pandoc] nested ordered list, one separating space: OK
  3045. 826.91 s [pandoc] nested ordered list, one separating space, trailing ...: OK
  3046. 826.92 s [pandoc] nested many ordered lists, one separating space: OK
  3047. 826.92 s [pandoc] nested ordered list, mixed separating space: OK
  3048. 826.92 s [pandoc] mixed nested ordered and unordered lists, one separa...: OK
  3049. 826.92 s [pandoc] NoWiki
  3050. 826.92 s [pandoc] quoted block, simple: OK
  3051. 826.92 s [pandoc] quoted block, curly bracket exception: OK
  3052. 826.92 s [pandoc] forced line breaks: OK
  3053. 826.92 s [pandoc] quoted block, after trailing white space: OK
  3054. 826.92 s [pandoc] Images and Links
  3055. 826.92 s [pandoc] image simple: OK
  3056. 826.92 s [pandoc] image with alt text: OK
  3057. 826.92 s [pandoc] auto link: OK
  3058. 826.92 s [pandoc] escaped auto link: OK
  3059. 826.92 s [pandoc] wiki link simple: OK
  3060. 826.93 s [pandoc] wiki link with name: OK
  3061. 826.93 s [pandoc] image link: OK
  3062. 826.93 s [pandoc] Table
  3063. 826.93 s [pandoc] Table with Header: OK
  3064. 826.93 s [pandoc] Table without Header: OK
  3065. 826.94 s [pandoc] Table without Header, no markers at line ends: OK
  3066. 826.94 s [pandoc] Table with Header, with formatting: OK
  3067. 826.94 s [pandoc] Man
  3068. 826.94 s [pandoc] Macros
  3069. 826.94 s [pandoc] Bold: OK
  3070. 826.94 s [pandoc] Italic: OK
  3071. 826.94 s [pandoc] BoldItalic: OK
  3072. 826.94 s [pandoc] H1: OK
  3073. 826.94 s [pandoc] H2: OK
  3074. 826.94 s [pandoc] Macro args: OK
  3075. 826.94 s [pandoc] Argument from next line: OK
  3076. 826.94 s [pandoc] comment: OK
  3077. 826.94 s [pandoc] link: OK
  3078. 826.94 s [pandoc] Escapes
  3079. 826.94 s [pandoc] fonts: OK
  3080. 826.94 s [pandoc] nested fonts: OK
  3081. 826.94 s [pandoc] nested fonts 2: OK
  3082. 826.94 s [pandoc] skip: OK
  3083. 826.94 s [pandoc] replace: OK
  3084. 826.94 s [pandoc] replace2: OK
  3085. 826.94 s [pandoc] comment with \": OK
  3086. 826.94 s [pandoc] comment with \#: OK
  3087. 826.94 s [pandoc] two letter escapes: OK
  3088. 826.94 s [pandoc] bracketed escapes: OK
  3089. 826.94 s [pandoc] unicode escapes: OK
  3090. 826.94 s [pandoc] unicode escapes (combined): OK
  3091. 826.94 s [pandoc] unknown escape (#5034): OK
  3092. 826.94 s [pandoc] Lists
  3093. 826.94 s [pandoc] bullet: OK
  3094. 826.94 s [pandoc] ordered: OK
  3095. 826.94 s [pandoc] upper: OK
  3096. 826.94 s [pandoc] nested: OK
  3097. 826.94 s [pandoc] change in list style: OK
  3098. 826.94 s [pandoc] CodeBlocks
  3099. 826.94 s [pandoc] cb1: OK
  3100. 826.94 s [pandoc] Tables
  3101. 826.94 s [pandoc] t1: OK
  3102. 826.94 s [pandoc] longcell: OK
  3103. 826.94 s [pandoc] Mdoc
  3104. 826.94 s [pandoc] one-line enclosures
  3105. 826.94 s [pandoc] Dq: OK
  3106. 826.95 s [pandoc] Sq: OK
  3107. 826.95 s [pandoc] empty: OK
  3108. 826.95 s [pandoc] nested: OK
  3109. 826.95 s [pandoc] nested with closing delimiters: OK
  3110. 826.95 s [pandoc] nested multiline enclosure: OK
  3111. 826.95 s [pandoc] with inlines: OK
  3112. 826.95 s [pandoc] with text production: OK
  3113. 826.95 s [pandoc] with Ns: OK
  3114. 826.95 s [pandoc] ending with open delimiter: OK
  3115. 826.95 s [pandoc] multiline enclosures
  3116. 826.95 s [pandoc] nested multiline: OK
  3117. 826.95 s [pandoc] nested on one line: OK
  3118. 826.95 s [pandoc] with wacky delimiters: OK
  3119. 826.95 s [pandoc] simple inlines
  3120. 826.95 s [pandoc] Sy: OK
  3121. 826.95 s [pandoc] Em: OK
  3122. 826.95 s [pandoc] Ev: OK
  3123. 826.95 s [pandoc] Ar: OK
  3124. 826.95 s [pandoc] In: OK
  3125. 826.95 s [pandoc] Mt: OK
  3126. 826.95 s [pandoc] No: OK
  3127. 826.95 s [pandoc] empty Pa with closing punctuation: OK
  3128. 826.95 s [pandoc] delimiters: OK
  3129. 826.95 s [pandoc] multiple: OK
  3130. 826.95 s [pandoc] Fl
  3131. 826.95 s [pandoc] simple: OK
  3132. 826.95 s [pandoc] multiple: OK
  3133. 826.96 s [pandoc] empty with following macro: OK
  3134. 826.96 s [pandoc] enclosed with following macro: OK
  3135. 826.96 s [pandoc] enclosed with following delimiters: OK
  3136. 826.96 s [pandoc] following Ns: OK
  3137. 826.96 s [pandoc] GNU: OK
  3138. 826.96 s [pandoc] GNU escaped: OK
  3139. 826.96 s [pandoc] GNU Fl Fl: OK
  3140. 826.96 s [pandoc] punctuation: OK
  3141. 826.96 s [pandoc] middle close paren: OK
  3142. 826.96 s [pandoc] empty with close paren: OK
  3143. 826.96 s [pandoc] empty with pipe: OK
  3144. 826.96 s [pandoc] empty with parens: OK
  3145. 826.96 s [pandoc] links
  3146. 826.96 s [pandoc] basic: OK
  3147. 826.96 s [pandoc] complicated: OK
  3148. 826.96 s [pandoc] unnamed: OK
  3149. 826.96 s [pandoc] Ns macro
  3150. 826.96 s [pandoc] at the beginning of a macro line (mandoc delta): OK
  3151. 826.96 s [pandoc] after a block closing macro: OK
  3152. 826.96 s [pandoc] in the middle of a macro line: OK
  3153. 826.96 s [pandoc] before closing punctuation: OK
  3154. 826.96 s [pandoc] after closing punctuation: OK
  3155. 826.96 s [pandoc] at the end of a macro line: OK
  3156. 826.96 s [pandoc] at the end of a partial-implicit line: OK
  3157. 826.96 s [pandoc] normal words: OK
  3158. 826.96 s [pandoc] opening punctuation: OK
  3159. 826.96 s [pandoc] closing punctuation: OK
  3160. 826.96 s [pandoc] spacing mode
  3161. 826.96 s [pandoc] all text: OK
  3162. 826.96 s [pandoc] text around macro: OK
  3163. 826.96 s [pandoc] mulitple macros: OK
  3164. 826.96 s [pandoc] mulitple control lines: OK
  3165. 826.96 s [pandoc] mixed control and text lines: OK
  3166. 826.96 s [pandoc] delimiters: OK
  3167. 826.96 s [pandoc] Ap macro
  3168. 826.96 s [pandoc] in the middle of a macro line: OK
  3169. 826.96 s [pandoc] with punctuation and called macro: OK
  3170. 826.96 s [pandoc] Pf macro
  3171. 826.96 s [pandoc] closing punctuation: OK
  3172. 826.96 s [pandoc] double punctuation: OK
  3173. 826.96 s [pandoc] opening punctuation: OK
  3174. 826.96 s [pandoc] unparsed argument: OK
  3175. 826.96 s [pandoc] text production
  3176. 826.96 s [pandoc] early NetBSD versions: OK
  3177. 826.97 s [pandoc] with Ns: OK
  3178. 826.97 s [pandoc] with punctuation: OK
  3179. 826.97 s [pandoc] with argument and punctuation: OK
  3180. 826.97 s [pandoc] BSD alone: OK
  3181. 826.97 s [pandoc] BSD with macro: OK
  3182. 826.97 s [pandoc] BSD with version: OK
  3183. 826.97 s [pandoc] BSD with variant: OK
  3184. 826.97 s [pandoc] inline punctuation
  3185. 826.97 s [pandoc] leading punctuation
  3186. 827.05 s [pandoc] open paren: OK
  3187. 827.05 s [pandoc] open square bracket: OK (0.08s)
  3188. 827.05 s [pandoc] pipe: OK
  3189. 827.05 s [pandoc] period: OK
  3190. 827.05 s [pandoc] comma: OK
  3191. 827.05 s [pandoc] semicolon: OK
  3192. 827.05 s [pandoc] colon: OK
  3193. 827.05 s [pandoc] question mark: OK
  3194. 827.05 s [pandoc] exclamation: OK
  3195. 827.05 s [pandoc] close paren: OK
  3196. 827.05 s [pandoc] close square bracket: OK
  3197. 827.05 s [pandoc] trailing punctuation
  3198. 827.05 s [pandoc] open paren: OK
  3199. 827.05 s [pandoc] open square bracket: OK
  3200. 827.05 s [pandoc] pipe: OK
  3201. 827.05 s [pandoc] period: OK
  3202. 827.05 s [pandoc] comma: OK
  3203. 827.05 s [pandoc] semicolon: OK
  3204. 827.05 s [pandoc] colon: OK
  3205. 827.05 s [pandoc] question mark: OK
  3206. 827.05 s [pandoc] exclamation: OK
  3207. 827.05 s [pandoc] close parens: OK
  3208. 827.05 s [pandoc] close square bracket: OK
  3209. 827.05 s [pandoc] middle punctuation
  3210. 827.05 s [pandoc] open paren: OK
  3211. 827.06 s [pandoc] open square bracket: OK
  3212. 827.06 s [pandoc] pipe: OK
  3213. 827.06 s [pandoc] period: OK
  3214. 827.06 s [pandoc] comma: OK
  3215. 827.06 s [pandoc] semicolon: OK
  3216. 827.06 s [pandoc] colon: OK
  3217. 827.06 s [pandoc] question mark: OK
  3218. 827.06 s [pandoc] exclamation: OK
  3219. 827.06 s [pandoc] close paren: OK
  3220. 827.06 s [pandoc] close square bracket: OK
  3221. 827.06 s [pandoc] FB2
  3222. 827.06 s [pandoc] Emphasis: OK
  3223. 827.06 s [pandoc] Titles: OK
  3224. 827.06 s [pandoc] Epigraph: OK
  3225. 827.06 s [pandoc] Poem: OK
  3226. 827.06 s [pandoc] Meta: OK
  3227. 827.06 s [pandoc] Notes: OK
  3228. 827.06 s [pandoc] DokuWiki
  3229. 827.06 s [pandoc] inlines
  3230. 827.06 s [pandoc] Bold: OK
  3231. 827.06 s [pandoc] Italic: OK
  3232. 827.06 s [pandoc] Underlined: OK
  3233. 827.06 s [pandoc] Monospaced: OK
  3234. 827.06 s [pandoc] Monospaced with nowiki: OK
  3235. 827.06 s [pandoc] Combined: OK
  3236. 827.06 s [pandoc] Nowiki: OK
  3237. 827.06 s [pandoc] Percent: OK
  3238. 827.06 s [pandoc] Subscript: OK
  3239. 827.06 s [pandoc] Superscript: OK
  3240. 827.06 s [pandoc] Deleted: OK
  3241. 827.06 s [pandoc] Inline code: OK
  3242. 827.06 s [pandoc] Inline file: OK
  3243. 827.06 s [pandoc] Inline HTML: OK
  3244. 827.06 s [pandoc] Inline PHP: OK
  3245. 827.06 s [pandoc] Linebreak: OK
  3246. 827.06 s [pandoc] External links
  3247. 827.06 s [pandoc] Autolink: OK
  3248. 827.07 s [pandoc] Link without description: OK
  3249. 827.07 s [pandoc] Link with description: OK
  3250. 827.07 s [pandoc] Trim whitespace around link and description: OK
  3251. 827.07 s [pandoc] Email address: OK
  3252. 827.07 s [pandoc] Internal links
  3253. 827.07 s [pandoc] Current namespace: OK
  3254. 827.07 s [pandoc] Current namespace starting with dot: OK
  3255. 827.07 s [pandoc] Current namespace starting with dot and colon: OK
  3256. 827.07 s [pandoc] Root namespace: OK
  3257. 827.07 s [pandoc] Parent namespace: OK
  3258. 827.07 s [pandoc] Parent namespace with colon: OK
  3259. 827.07 s [pandoc] Beneath the root namespace: OK
  3260. 827.07 s [pandoc] Explicitly beneath the root namespace: OK
  3261. 827.07 s [pandoc] Interwiki links
  3262. 827.07 s [pandoc] Interwiki without description: OK
  3263. 827.07 s [pandoc] Interwiki link with description: OK
  3264. 827.07 s [pandoc] Footnote: OK
  3265. 827.07 s [pandoc] Images
  3266. 827.07 s [pandoc] Image: OK
  3267. 827.07 s [pandoc] Image with caption: OK
  3268. 827.07 s [pandoc] Image with } in caption: OK
  3269. 827.07 s [pandoc] Wiki namespace starting with dot: OK
  3270. 827.07 s [pandoc] Left aligned image: OK
  3271. 827.07 s [pandoc] Right aligned image: OK
  3272. 827.07 s [pandoc] Centered image: OK
  3273. 827.07 s [pandoc] Image with width: OK
  3274. 827.07 s [pandoc] Image with width and height: OK
  3275. 827.07 s [pandoc] Linkonly: OK
  3276. 827.07 s [pandoc] Ignore ~~NOTOC~~: OK
  3277. 827.07 s [pandoc] Ignore ~~NOCACHE~~: OK
  3278. 827.07 s [pandoc] Sectioning
  3279. 827.07 s [pandoc] Headline level 1: OK
  3280. 827.07 s [pandoc] Headline level 2: OK
  3281. 827.07 s [pandoc] Headline level 3: OK
  3282. 827.07 s [pandoc] Headline level 4: OK
  3283. 827.07 s [pandoc] Headline level 5: OK
  3284. 827.07 s [pandoc] Only two closing = are required: OK
  3285. 827.07 s [pandoc] One closing = is not enough: OK
  3286. 827.07 s [pandoc] One closing = is not enough: OK
  3287. 827.08 s [pandoc] Horizontal line: OK
  3288. 827.08 s [pandoc] Lists
  3289. 827.08 s [pandoc] Unordered list: OK
  3290. 827.08 s [pandoc] Ordered list: OK
  3291. 827.08 s [pandoc] Multiline list items: OK
  3292. 827.08 s [pandoc] Block HTML: OK
  3293. 827.08 s [pandoc] Block PHP: OK
  3294. 827.08 s [pandoc] Quote: OK
  3295. 827.08 s [pandoc] Code block: OK
  3296. 827.08 s [pandoc] Java code block: OK
  3297. 827.08 s [pandoc] File with filename and no language: OK
  3298. 827.08 s [pandoc] Table: OK
  3299. 827.08 s [pandoc] Table with header: OK
  3300. 827.08 s [pandoc] Table with alignment: OK
  3301. 827.08 s [pandoc] Table with colspan: OK
  3302. 827.08 s [pandoc] Indented code block: OK
  3303. 827.08 s [pandoc] Pod
  3304. 827.08 s [pandoc] inlines
  3305. 827.08 s [pandoc] code with nested inlines: OK
  3306. 827.08 s [pandoc] compact in compact: OK
  3307. 827.08 s [pandoc] expanded in compact: OK
  3308. 827.08 s [pandoc] compact in expanded: OK
  3309. 827.08 s [pandoc] expanded in expanded: OK
  3310. 827.09 s [pandoc] links
  3311. 827.09 s [pandoc] compact
  3312. 827.09 s [pandoc] URL: OK
  3313. 827.09 s [pandoc] URL with link text: OK
  3314. 827.09 s [pandoc] perl manual: OK
  3315. 827.09 s [pandoc] manual with quoted section: OK
  3316. 827.09 s [pandoc] manual with section and formatted link text: OK
  3317. 827.09 s [pandoc] internal link: OK
  3318. 827.09 s [pandoc] internal link with formatting: OK
  3319. 827.09 s [pandoc] link with angle bracket: OK
  3320. 827.09 s [pandoc] empty name: OK
  3321. 827.09 s [pandoc] expanded
  3322. 827.09 s [pandoc] URL: OK
  3323. 827.09 s [pandoc] URL with link text: OK
  3324. 827.09 s [pandoc] perl manual: OK
  3325. 827.09 s [pandoc] manual with quoted section: OK
  3326. 827.09 s [pandoc] manual with section and formatted link text: OK
  3327. 827.09 s [pandoc] internal link: OK
  3328. 827.09 s [pandoc] internal link with formatting: OK
  3329. 827.09 s [pandoc] link with angle bracket: OK
  3330. 827.09 s [pandoc] empty name: OK
  3331. 827.09 s [pandoc] entities
  3332. 827.09 s [pandoc] required
  3333. 827.09 s [pandoc] quot: OK
  3334. 827.09 s [pandoc] amp: OK
  3335. 827.09 s [pandoc] apos: OK
  3336. 827.09 s [pandoc] lt: OK
  3337. 827.09 s [pandoc] gt: OK
  3338. 827.09 s [pandoc] sol: OK
  3339. 827.09 s [pandoc] verbar: OK
  3340. 827.09 s [pandoc] lchevron: OK
  3341. 827.09 s [pandoc] rchevron: OK
  3342. 827.09 s [pandoc] numeric
  3343. 827.09 s [pandoc] decimal: OK
  3344. 827.09 s [pandoc] octal: OK
  3345. 827.09 s [pandoc] hexadecimal: OK
  3346. 827.09 s [pandoc] hexadecimal variant: OK
  3347. 827.09 s [pandoc] actually decimal: OK
  3348. 827.09 s [pandoc] bogus
  3349. 827.09 s [pandoc] 0XA2: OK
  3350. 827.09 s [pandoc] not a real entity: OK
  3351. 827.09 s [pandoc] 162 1: OK
  3352. 827.09 s [pandoc] 99 bottles of beer: OK
  3353. 827.09 s [pandoc] 0xhh: OK
  3354. 827.09 s [pandoc] 077x: OK
  3355. 827.09 s [pandoc] 0x63 skidoo: OK
  3356. 827.09 s [pandoc]
  3357. 827.09 s [pandoc] All 3625 tests passed (43.12s)
  3358. 827.14 s [pandoc] Test suite test-pandoc: PASS
  3359. 827.14 s [pandoc] Test suite logged to: dist/test/pandoc-3.7.0.2-test-pandoc.log
  3360. 827.14 s [pandoc] 1 of 1 test suites (1 of 1 test cases) passed.
  3361. 827.15 s [pandoc] checkPhase completed in 45 seconds
  3362. 827.15 s [pandoc] Phase: haddockPhase
  3363. 827.16 s [pandoc] Phase: installPhase
  3364. 827.36 s [vector] buildPhase completed in 2 minutes 50 seconds
  3365. 827.36 s [vector] Phase: checkPhase
  3366. 827.49 s [pandoc] Installing internal library xml-light in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-3.7.0.2-KGPTJkDqL6PHRGo9hEntgT-xml-light
  3367. 827.57 s [pandoc] Installing library in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  3368. 827.62 s [vector] Running 2 test suites...
  3369. 827.62 s [vector] Test suite vector-tests-O0: RUNNING...
  3370. 827.91 s [vector] toplevel
  3371. 827.91 s [vector] Data.Vector.Fusion.Bundle
  3372. 827.91 s [vector] fromList.toList == id: OK
  3373. 827.91 s [vector] +++ OK, passed 100 tests.
  3374. 827.91 s [vector] toList.fromList == id: OK
  3375. 827.91 s [vector] +++ OK, passed 100 tests.
  3376. 827.91 s [vector] eq: OK
  3377. 827.91 s [vector] +++ OK, passed 100 tests.
  3378. 827.91 s [vector] length: OK
  3379. 827.91 s [vector] +++ OK, passed 100 tests.
  3380. 827.92 s [vector] null: OK
  3381. 827.92 s [vector] +++ OK, passed 100 tests.
  3382. 827.92 s [vector] empty: OK
  3383. 827.92 s [vector] +++ OK, passed 100 tests.
  3384. 827.92 s [vector] singleton: OK
  3385. 827.92 s [vector] +++ OK, passed 100 tests.
  3386. 827.92 s [vector] replicate: OK
  3387. 827.92 s [vector] +++ OK, passed 100 tests.
  3388. 827.92 s [vector] cons: OK
  3389. 827.92 s [vector] +++ OK, passed 100 tests.
  3390. 827.92 s [vector] snoc: OK
  3391. 827.92 s [vector] +++ OK, passed 100 tests.
  3392. 827.92 s [vector] append: OK
  3393. 827.92 s [vector] +++ OK, passed 100 tests.
  3394. 827.92 s [vector] head: OK
  3395. 827.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3396. 827.92 s [vector] last: OK
  3397. 827.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3398. 827.92 s [vector] index: OK
  3399. 827.93 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3400. 827.93 s [vector] extract: OK
  3401. 827.93 s [vector] +++ OK, passed 100 tests.
  3402. 827.93 s [vector] init: OK
  3403. 827.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3404. 827.93 s [vector] tail: OK
  3405. 827.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3406. 827.93 s [vector] take: OK
  3407. 827.93 s [vector] +++ OK, passed 100 tests.
  3408. 827.93 s [vector] drop: OK
  3409. 827.93 s [vector] +++ OK, passed 100 tests.
  3410. 827.93 s [vector] map: OK
  3411. 827.93 s [vector] +++ OK, passed 100 tests.
  3412. 827.93 s [vector] zipWith: OK
  3413. 827.93 s [vector] +++ OK, passed 100 tests.
  3414. 827.93 s [vector] zipWith3: OK
  3415. 827.93 s [vector] +++ OK, passed 100 tests.
  3416. 827.93 s [vector] filter: OK
  3417. 827.93 s [vector] +++ OK, passed 100 tests.
  3418. 827.93 s [vector] takeWhile: OK
  3419. 827.93 s [vector] +++ OK, passed 100 tests.
  3420. 827.93 s [vector] dropWhile: OK
  3421. 827.93 s [vector] +++ OK, passed 100 tests.
  3422. 827.93 s [vector] elem: OK
  3423. 827.93 s [vector] +++ OK, passed 100 tests.
  3424. 827.93 s [vector] notElem: OK
  3425. 827.93 s [vector] +++ OK, passed 100 tests.
  3426. 827.93 s [vector] find: OK
  3427. 827.93 s [vector] +++ OK, passed 100 tests.
  3428. 827.93 s [vector] findIndex: OK
  3429. 827.93 s [vector] +++ OK, passed 100 tests.
  3430. 827.93 s [vector] foldl: OK
  3431. 827.93 s [vector] +++ OK, passed 100 tests.
  3432. 827.93 s [vector] foldl1: OK
  3433. 827.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3434. 827.93 s [vector] foldl': OK
  3435. 827.93 s [vector] +++ OK, passed 100 tests.
  3436. 827.93 s [vector] foldl1': OK
  3437. 827.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3438. 827.93 s [vector] foldr: OK
  3439. 827.93 s [vector] +++ OK, passed 100 tests.
  3440. 827.93 s [vector] foldr1: OK
  3441. 827.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3442. 827.93 s [vector] prescanl: OK
  3443. 827.93 s [vector] +++ OK, passed 100 tests.
  3444. 827.93 s [vector] prescanl': OK
  3445. 827.93 s [vector] +++ OK, passed 100 tests.
  3446. 827.93 s [vector] postscanl: OK
  3447. 827.93 s [vector] +++ OK, passed 100 tests.
  3448. 827.93 s [vector] postscanl': OK
  3449. 827.93 s [vector] +++ OK, passed 100 tests.
  3450. 827.93 s [vector] scanl: OK
  3451. 827.93 s [vector] +++ OK, passed 100 tests.
  3452. 827.93 s [vector] scanl': OK
  3453. 827.93 s [vector] +++ OK, passed 100 tests.
  3454. 827.93 s [vector] scanl1: OK
  3455. 827.93 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3456. 827.93 s [vector] scanl1': OK
  3457. 827.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3458. 827.93 s [vector] concatMap: OK
  3459. 827.93 s [vector] +++ OK, passed 100 tests.
  3460. 827.93 s [vector] unfoldr: OK
  3461. 827.93 s [vector] +++ OK, passed 100 tests.
  3462. 827.93 s [vector] and: OK
  3463. 827.93 s [vector] +++ OK, passed 100 tests.
  3464. 827.93 s [vector] or: OK
  3465. 827.93 s [vector] +++ OK, passed 100 tests.
  3466. 827.93 s [vector] Tests.Vector.Boxed
  3467. 827.93 s [vector] Bool
  3468. 827.94 s [vector] fromList.toList == id: OK
  3469. 827.94 s [vector] +++ OK, passed 100 tests.
  3470. 827.94 s [vector] toList.fromList == id: OK
  3471. 827.94 s [vector] +++ OK, passed 100 tests.
  3472. 827.94 s [vector] unstream.stream == id: OK
  3473. 827.94 s [vector] +++ OK, passed 100 tests.
  3474. 827.94 s [vector] stream.unstream == id: OK
  3475. 827.94 s [vector] +++ OK, passed 100 tests.
  3476. 827.94 s [vector] eq: OK
  3477. 827.94 s [vector] +++ OK, passed 100 tests.
  3478. 827.94 s [vector] length: OK
  3479. 827.94 s [vector] +++ OK, passed 100 tests.
  3480. 827.94 s [vector] null: OK
  3481. 827.94 s [vector] +++ OK, passed 100 tests.
  3482. 827.94 s [vector] index: OK
  3483. 827.94 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3484. 827.95 s [vector] safeIndex: OK
  3485. 827.95 s [vector] +++ OK, passed 100 tests.
  3486. 827.95 s [vector] head: OK
  3487. 827.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3488. 827.95 s [vector] last: OK
  3489. 827.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3490. 827.95 s [vector] unsafeIndex: OK
  3491. 827.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3492. 827.95 s [vector] unsafeHead: OK
  3493. 827.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3494. 827.95 s [vector] unsafeLast: OK
  3495. 827.95 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3496. 827.95 s [vector] slice: OK
  3497. 827.96 s [vector] +++ OK, passed 100 tests.
  3498. 827.96 s [vector] init: OK
  3499. 827.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3500. 827.96 s [vector] tail: OK
  3501. 827.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3502. 827.96 s [vector] take: OK
  3503. 827.96 s [vector] +++ OK, passed 100 tests.
  3504. 827.96 s [vector] drop: OK
  3505. 827.96 s [vector] +++ OK, passed 100 tests.
  3506. 827.96 s [vector] splitAt: OK
  3507. 827.96 s [vector] +++ OK, passed 100 tests.
  3508. 827.96 s [vector] empty: OK
  3509. 827.96 s [vector] +++ OK, passed 100 tests.
  3510. 827.96 s [vector] singleton: OK
  3511. 827.96 s [vector] +++ OK, passed 100 tests.
  3512. 827.96 s [vector] replicate: OK
  3513. 827.96 s [vector] +++ OK, passed 100 tests.
  3514. 827.96 s [vector] generate: OK
  3515. 827.96 s [vector] +++ OK, passed 100 tests.
  3516. 827.96 s [vector] iterateN: OK
  3517. 827.96 s [vector] +++ OK, passed 100 tests.
  3518. 827.96 s [vector] iterateNM: OK (0.03s)
  3519. 827.96 s [vector] +++ OK, passed 100 tests.
  3520. 827.97 s [vector] generateM: OK (0.01s)
  3521. 827.97 s [vector] +++ OK, passed 100 tests.
  3522. 827.97 s [vector] replicateM: OK
  3523. 827.97 s [vector] +++ OK, passed 100 tests.
  3524. 827.97 s [vector] create: OK
  3525. 827.97 s [vector] +++ OK, passed 100 tests.
  3526. 827.97 s [vector] createT: OK
  3527. 827.97 s [vector] +++ OK, passed 100 tests.
  3528. 827.97 s [vector] unfoldr: OK
  3529. 827.97 s [vector] +++ OK, passed 100 tests.
  3530. 827.97 s [vector] unfoldrN: OK
  3531. 827.97 s [vector] +++ OK, passed 100 tests.
  3532. 827.97 s [vector] unfoldrExactN: OK
  3533. 827.97 s [vector] +++ OK, passed 100 tests.
  3534. 827.97 s [vector] unfoldrM: OK
  3535. 827.97 s [vector] +++ OK, passed 100 tests.
  3536. 827.97 s [vector] unfoldrNM: OK
  3537. 827.97 s [vector] +++ OK, passed 100 tests.
  3538. 827.97 s [vector] unfoldrExactNM: OK (0.04s)
  3539. 827.97 s [vector] +++ OK, passed 100 tests.
  3540. 827.97 s [vector] constructN: OK
  3541. 827.97 s [vector] +++ OK, passed 100 tests.
  3542. 827.97 s [vector] constructrN: OK
  3543. 827.97 s [vector] +++ OK, passed 100 tests.
  3544. 827.97 s [vector] cons: OK
  3545. 827.98 s [vector] +++ OK, passed 100 tests.
  3546. 827.98 s [vector] snoc: OK
  3547. 827.98 s [vector] +++ OK, passed 100 tests.
  3548. 827.98 s [vector] append: OK
  3549. 827.98 s [vector] +++ OK, passed 100 tests.
  3550. 827.98 s [vector] concat: OK
  3551. 827.98 s [vector] +++ OK, passed 100 tests.
  3552. 827.98 s [vector] force: OK
  3553. 827.98 s [vector] +++ OK, passed 100 tests.
  3554. 827.98 s [vector] upd: OK
  3555. 827.98 s [vector] +++ OK, passed 100 tests.
  3556. 827.98 s [vector] accum: OK
  3557. 827.98 s [vector] +++ OK, passed 100 tests.
  3558. 827.98 s [vector] reverse: OK
  3559. 827.98 s [vector] +++ OK, passed 100 tests.
  3560. 827.98 s [vector] backpermute: OK
  3561. 827.98 s [vector] +++ OK, passed 100 tests.
  3562. 827.98 s [vector] map: OK
  3563. 827.98 s [vector] +++ OK, passed 100 tests.
  3564. 827.98 s [vector] imap: OK
  3565. 827.98 s [vector] +++ OK, passed 100 tests.
  3566. 827.98 s [vector] concatMap: OK
  3567. 827.98 s [vector] +++ OK, passed 100 tests.
  3568. 827.98 s [vector] mapM: OK
  3569. 827.98 s [vector] +++ OK, passed 100 tests.
  3570. 827.98 s [vector] mapM_: OK (0.01s)
  3571. 827.98 s [vector] +++ OK, passed 100 tests.
  3572. 827.98 s [vector] forM: OK
  3573. 827.98 s [vector] +++ OK, passed 100 tests.
  3574. 827.98 s [vector] forM_: OK (0.01s)
  3575. 827.98 s [vector] +++ OK, passed 100 tests.
  3576. 827.99 s [vector] imapM: OK
  3577. 827.99 s [vector] +++ OK, passed 100 tests.
  3578. 827.99 s [vector] imapM_: OK (0.01s)
  3579. 827.99 s [vector] +++ OK, passed 100 tests.
  3580. 827.99 s [vector] zipWith: OK
  3581. 827.99 s [vector] +++ OK, passed 100 tests.
  3582. 827.99 s [vector] zipWith3: OK
  3583. 827.99 s [vector] +++ OK, passed 100 tests.
  3584. 827.99 s [vector] izipWith: OK
  3585. 827.99 s [vector] +++ OK, passed 100 tests.
  3586. 827.99 s [vector] izipWith3: OK
  3587. 827.99 s [vector] +++ OK, passed 100 tests.
  3588. 827.99 s [vector] izipWithM: OK
  3589. 827.99 s [vector] +++ OK, passed 100 tests.
  3590. 827.99 s [vector] izipWithM_: OK
  3591. 827.99 s [vector] +++ OK, passed 100 tests.
  3592. 827.99 s [vector] zipWithM: OK
  3593. 827.99 s [vector] +++ OK, passed 100 tests.
  3594. 827.99 s [vector] zipWithM_: OK (0.02s)
  3595. 827.99 s [vector] +++ OK, passed 100 tests.
  3596. 827.99 s [vector] filter: OK
  3597. 827.99 s [vector] +++ OK, passed 100 tests.
  3598. 827.99 s [vector] ifilter: OK
  3599. 827.99 s [vector] +++ OK, passed 100 tests.
  3600. 827.99 s [vector] filterM: OK (0.02s)
  3601. 827.99 s [vector] +++ OK, passed 100 tests.
  3602. 827.99 s [vector] uniq: OK
  3603. 827.99 s [vector] +++ OK, passed 100 tests.
  3604. 827.99 s [vector] mapMaybe: OK
  3605. 827.99 s [vector] +++ OK, passed 100 tests.
  3606. 828.00 s [vector] imapMaybe: OK
  3607. 828.00 s [vector] +++ OK, passed 100 tests.
  3608. 828.00 s [vector] takeWhile: OK
  3609. 828.00 s [vector] +++ OK, passed 100 tests.
  3610. 828.00 s [vector] dropWhile: OK
  3611. 828.00 s [vector] +++ OK, passed 100 tests.
  3612. 828.00 s [vector] partition: OK
  3613. 828.00 s [vector] +++ OK, passed 100 tests.
  3614. 828.00 s [vector] partitionWith: OK
  3615. 828.00 s [vector] +++ OK, passed 100 tests.
  3616. 828.00 s [vector] span: OK
  3617. 828.00 s [vector] +++ OK, passed 100 tests.
  3618. 828.00 s [vector] break: OK
  3619. 828.00 s [vector] +++ OK, passed 100 tests.
  3620. 828.00 s [vector] spanR: OK
  3621. 828.00 s [vector] +++ OK, passed 100 tests.
  3622. 828.00 s [vector] breakR: OK
  3623. 828.00 s [vector] +++ OK, passed 100 tests.
  3624. 828.00 s [vector] groupBy: OK
  3625. 828.00 s [vector] +++ OK, passed 100 tests.
  3626. 828.00 s [vector] elem: OK
  3627. 828.00 s [vector] +++ OK, passed 100 tests.
  3628. 828.00 s [vector] notElem: OK
  3629. 828.00 s [vector] +++ OK, passed 100 tests.
  3630. 828.00 s [vector] find: OK
  3631. 828.00 s [vector] +++ OK, passed 100 tests.
  3632. 828.00 s [vector] findIndex: OK
  3633. 828.00 s [vector] +++ OK, passed 100 tests.
  3634. 828.00 s [vector] findIndexR: OK
  3635. 828.00 s [vector] +++ OK, passed 100 tests.
  3636. 828.00 s [vector] findIndices: OK
  3637. 828.00 s [vector] +++ OK, passed 100 tests.
  3638. 828.00 s [vector] elemIndex: OK
  3639. 828.00 s [vector] +++ OK, passed 100 tests.
  3640. 828.00 s [vector] elemIndices: OK
  3641. 828.00 s [vector] +++ OK, passed 100 tests.
  3642. 828.00 s [vector] foldl: OK
  3643. 828.00 s [vector] +++ OK, passed 100 tests.
  3644. 828.00 s [vector] foldl1: OK
  3645. 828.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3646. 828.00 s [vector] foldl': OK
  3647. 828.00 s [vector] +++ OK, passed 100 tests.
  3648. 828.00 s [vector] foldl1': OK
  3649. 828.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3650. 828.00 s [vector] foldr: OK
  3651. 828.00 s [vector] +++ OK, passed 100 tests.
  3652. 828.00 s [vector] foldr1: OK
  3653. 828.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3654. 828.00 s [vector] foldr': OK
  3655. 828.00 s [vector] +++ OK, passed 100 tests.
  3656. 828.00 s [vector] foldr1': OK
  3657. 828.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3658. 828.00 s [vector] ifoldl: OK
  3659. 828.00 s [vector] +++ OK, passed 100 tests.
  3660. 828.00 s [vector] ifoldl': OK
  3661. 828.00 s [vector] +++ OK, passed 100 tests.
  3662. 828.00 s [vector] ifoldr: OK
  3663. 828.00 s [vector] +++ OK, passed 100 tests.
  3664. 828.00 s [vector] ifoldr': OK
  3665. 828.01 s [vector] +++ OK, passed 100 tests.
  3666. 828.02 s [vector] ifoldM: OK
  3667. 828.02 s [vector] +++ OK, passed 100 tests.
  3668. 828.02 s [vector] ifoldM': OK
  3669. 828.02 s [vector] +++ OK, passed 100 tests.
  3670. 828.04 s [vector] ifoldM_: OK (0.01s)
  3671. 828.04 s [vector] +++ OK, passed 100 tests.
  3672. 828.04 s [vector] ifoldM'_: OK (0.02s)
  3673. 828.04 s [vector] +++ OK, passed 100 tests.
  3674. 828.04 s [vector] all: OK
  3675. 828.04 s [vector] +++ OK, passed 100 tests.
  3676. 828.04 s [vector] any: OK
  3677. 828.04 s [vector] +++ OK, passed 100 tests.
  3678. 828.04 s [vector] prescanl: OK
  3679. 828.04 s [vector] +++ OK, passed 100 tests.
  3680. 828.04 s [vector] prescanl': OK
  3681. 828.04 s [vector] +++ OK, passed 100 tests.
  3682. 828.04 s [vector] postscanl: OK
  3683. 828.04 s [vector] +++ OK, passed 100 tests.
  3684. 828.04 s [vector] postscanl': OK
  3685. 828.04 s [vector] +++ OK, passed 100 tests.
  3686. 828.05 s [vector] scanl: OK
  3687. 828.05 s [vector] +++ OK, passed 100 tests.
  3688. 828.05 s [vector] scanl': OK
  3689. 828.05 s [vector] +++ OK, passed 100 tests.
  3690. 828.05 s [vector] scanl1: OK
  3691. 828.05 s [vector] +++ OK, passed 100 tests.
  3692. 828.05 s [vector] scanl1': OK
  3693. 828.05 s [vector] +++ OK, passed 100 tests.
  3694. 828.06 s [vector] iscanl: OK
  3695. 828.06 s [vector] +++ OK, passed 100 tests.
  3696. 828.06 s [vector] iscanl': OK
  3697. 828.06 s [vector] +++ OK, passed 100 tests.
  3698. 828.06 s [vector] prescanr: OK
  3699. 828.07 s [vector] +++ OK, passed 100 tests.
  3700. 828.07 s [vector] prescanr': OK
  3701. 828.07 s [vector] +++ OK, passed 100 tests.
  3702. 828.07 s [vector] postscanr: OK
  3703. 828.07 s [vector] +++ OK, passed 100 tests.
  3704. 828.07 s [vector] postscanr': OK
  3705. 828.07 s [vector] +++ OK, passed 100 tests.
  3706. 828.07 s [vector] scanr: OK
  3707. 828.07 s [vector] +++ OK, passed 100 tests.
  3708. 828.07 s [vector] scanr': OK
  3709. 828.07 s [vector] +++ OK, passed 100 tests.
  3710. 828.07 s [vector] scanr1: OK
  3711. 828.07 s [vector] +++ OK, passed 100 tests.
  3712. 828.07 s [vector] scanr1': OK
  3713. 828.07 s [vector] +++ OK, passed 100 tests.
  3714. 828.07 s [vector] iscanr: OK
  3715. 828.07 s [vector] +++ OK, passed 100 tests.
  3716. 828.07 s [vector] iscanr': OK
  3717. 828.08 s [vector] +++ OK, passed 100 tests.
  3718. 828.08 s [vector] mut_read: OK
  3719. 828.08 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3720. 828.08 s [vector] mut_write: OK
  3721. 828.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3722. 828.08 s [vector] mut_modify: OK
  3723. 828.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3724. 828.08 s [vector] mut_generate: OK
  3725. 828.08 s [vector] +++ OK, passed 100 tests.
  3726. 828.10 s [vector] mut_generateM: OK (0.01s)
  3727. 828.10 s [vector] +++ OK, passed 100 tests.
  3728. 828.11 s [vector] mut_mapM_: OK (0.01s)
  3729. 828.12 s [vector] +++ OK, passed 100 tests.
  3730. 828.12 s [vector] mut_imapM_: OK (0.01s)
  3731. 828.12 s [vector] +++ OK, passed 100 tests.
  3732. 828.14 s [vector] mut_forM_: OK (0.01s)
  3733. 828.14 s [vector] +++ OK, passed 100 tests.
  3734. 828.14 s [vector] mut_iforM_: OK (0.01s)
  3735. 828.14 s [vector] +++ OK, passed 100 tests.
  3736. 828.14 s [vector] mut_foldr: OK
  3737. 828.14 s [vector] +++ OK, passed 100 tests.
  3738. 828.14 s [vector] mut_foldr': OK
  3739. 828.14 s [vector] +++ OK, passed 100 tests.
  3740. 828.14 s [vector] mut_foldl: OK
  3741. 828.14 s [vector] +++ OK, passed 100 tests.
  3742. 828.14 s [vector] mut_foldl': OK
  3743. 828.15 s [vector] +++ OK, passed 100 tests.
  3744. 828.15 s [vector] mut_ifoldr: OK
  3745. 828.15 s [vector] +++ OK, passed 100 tests.
  3746. 828.15 s [vector] mut_ifoldr': OK
  3747. 828.15 s [vector] +++ OK, passed 100 tests.
  3748. 828.15 s [vector] mut_ifoldl: OK
  3749. 828.15 s [vector] +++ OK, passed 100 tests.
  3750. 828.15 s [vector] mut_ifoldl': OK
  3751. 828.15 s [vector] +++ OK, passed 100 tests.
  3752. 828.15 s [vector] mut_foldM: OK
  3753. 828.16 s [vector] +++ OK, passed 100 tests.
  3754. 828.16 s [vector] mut_foldM': OK
  3755. 828.16 s [vector] +++ OK, passed 100 tests.
  3756. 828.16 s [vector] mut_foldrM: OK
  3757. 828.16 s [vector] +++ OK, passed 100 tests.
  3758. 828.16 s [vector] mut_foldrM': OK
  3759. 828.16 s [vector] +++ OK, passed 100 tests.
  3760. 828.16 s [vector] mut_ifoldM: OK
  3761. 828.16 s [vector] +++ OK, passed 100 tests.
  3762. 828.16 s [vector] mut_ifoldM': OK
  3763. 828.16 s [vector] +++ OK, passed 100 tests.
  3764. 828.17 s [vector] mut_ifoldrM: OK
  3765. 828.17 s [vector] +++ OK, passed 100 tests.
  3766. 828.17 s [vector] mut_ifoldrM': OK
  3767. 828.17 s [vector] +++ OK, passed 100 tests.
  3768. 828.17 s [vector] compare: OK
  3769. 828.17 s [vector] +++ OK, passed 100 tests.
  3770. 828.17 s [vector] maximum: OK
  3771. 828.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3772. 828.17 s [vector] minimum: OK
  3773. 828.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3774. 828.17 s [vector] minIndex: OK
  3775. 828.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3776. 828.17 s [vector] maxIndex: OK
  3777. 828.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3778. 828.17 s [vector] maximumBy: OK
  3779. 828.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3780. 828.17 s [vector] minimumBy: OK
  3781. 828.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3782. 828.17 s [vector] maximumOn: OK
  3783. 828.17 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3784. 828.17 s [vector] minimumOn: OK
  3785. 828.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3786. 828.17 s [vector] maxIndexBy: OK
  3787. 828.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3788. 828.17 s [vector] minIndexBy: OK
  3789. 828.17 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3790. 828.18 s [vector] ListFirstMaxIndexWins: OK
  3791. 828.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3792. 828.18 s [vector] FalseListFirstMaxIndexWins: OK
  3793. 828.18 s [vector] +++ OK, failed as expected. (after 1 test):
  3794. 828.18 s [vector] Exception:
  3795. 828.18 s [vector] Prelude.foldr1: empty list
  3796. 828.18 s [vector] CallStack (from HasCallStack):
  3797. 828.18 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  3798. 828.18 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  3799. 828.18 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  3800. 828.18 s [vector] []
  3801. 828.18 s [vector] zip: OK
  3802. 828.18 s [vector] +++ OK, passed 100 tests.
  3803. 828.18 s [vector] zip3: OK
  3804. 828.18 s [vector] +++ OK, passed 100 tests.
  3805. 828.18 s [vector] unzip: OK
  3806. 828.18 s [vector] +++ OK, passed 100 tests.
  3807. 828.18 s [vector] unzip3: OK
  3808. 828.18 s [vector] +++ OK, passed 100 tests.
  3809. 828.18 s [vector] indexed: OK
  3810. 828.19 s [vector] +++ OK, passed 100 tests.
  3811. 828.19 s [vector] update: OK
  3812. 828.19 s [vector] +++ OK, passed 100 tests.
  3813. 828.19 s [vector] concat: OK
  3814. 828.19 s [vector] +++ OK, passed 100 tests.
  3815. 828.19 s [vector] mempty: OK
  3816. 828.20 s [vector] +++ OK, passed 100 tests.
  3817. 828.20 s [vector] mappend: OK
  3818. 828.20 s [vector] +++ OK, passed 100 tests.
  3819. 828.20 s [vector] mconcat: OK
  3820. 828.20 s [vector] +++ OK, passed 100 tests.
  3821. 828.20 s [vector] fmap: OK
  3822. 828.20 s [vector] +++ OK, passed 100 tests.
  3823. 828.22 s [vector] return: OK
  3824. 828.22 s [vector] +++ OK, passed 100 tests.
  3825. 828.22 s [vector] bind: OK (0.01s)
  3826. 828.22 s [vector] +++ OK, passed 100 tests.
  3827. 828.22 s [vector] mzip: OK
  3828. 828.22 s [vector] +++ OK, passed 100 tests.
  3829. 828.22 s [vector] munzip: OK
  3830. 828.22 s [vector] +++ OK, passed 100 tests.
  3831. 828.22 s [vector] applicative_pure: OK
  3832. 828.22 s [vector] +++ OK, passed 100 tests.
  3833. 828.24 s [vector] applicative_appl: OK (0.02s)
  3834. 828.24 s [vector] +++ OK, passed 100 tests.
  3835. 828.24 s [vector] alternative_empty: OK
  3836. 828.24 s [vector] +++ OK, passed 100 tests.
  3837. 828.26 s [vector] alternative_or: OK
  3838. 828.26 s [vector] +++ OK, passed 100 tests.
  3839. 828.28 s [vector] sequence: OK (0.02s)
  3840. 828.28 s [vector] +++ OK, passed 100 tests.
  3841. 828.28 s [vector] sequence_: OK (0.02s)
  3842. 828.28 s [vector] +++ OK, passed 100 tests.
  3843. 828.28 s [vector] glength: OK
  3844. 828.28 s [vector] +++ OK, passed 100 tests.
  3845. 828.28 s [vector] and: OK
  3846. 828.28 s [vector] +++ OK, passed 100 tests.
  3847. 828.28 s [vector] or: OK
  3848. 828.28 s [vector] +++ OK, passed 100 tests.
  3849. 828.28 s [vector] Int
  3850. 828.29 s [vector] fromList.toList == id: OK
  3851. 828.29 s [vector] +++ OK, passed 100 tests.
  3852. 828.29 s [vector] toList.fromList == id: OK
  3853. 828.29 s [vector] +++ OK, passed 100 tests.
  3854. 828.29 s [vector] unstream.stream == id: OK
  3855. 828.29 s [vector] +++ OK, passed 100 tests.
  3856. 828.29 s [vector] stream.unstream == id: OK
  3857. 828.29 s [vector] +++ OK, passed 100 tests.
  3858. 828.29 s [vector] eq: OK
  3859. 828.29 s [vector] +++ OK, passed 100 tests.
  3860. 828.29 s [vector] length: OK
  3861. 828.29 s [vector] +++ OK, passed 100 tests.
  3862. 828.29 s [vector] null: OK
  3863. 828.29 s [vector] +++ OK, passed 100 tests.
  3864. 828.29 s [vector] index: OK
  3865. 828.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3866. 828.29 s [vector] safeIndex: OK
  3867. 828.29 s [vector] +++ OK, passed 100 tests.
  3868. 828.29 s [vector] head: OK
  3869. 828.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3870. 828.29 s [vector] last: OK
  3871. 828.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3872. 828.29 s [vector] unsafeIndex: OK
  3873. 828.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3874. 828.29 s [vector] unsafeHead: OK
  3875. 828.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3876. 828.29 s [vector] unsafeLast: OK
  3877. 828.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3878. 828.29 s [vector] slice: OK
  3879. 828.29 s [vector] +++ OK, passed 100 tests.
  3880. 828.29 s [vector] init: OK
  3881. 828.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3882. 828.29 s [vector] tail: OK
  3883. 828.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3884. 828.29 s [vector] take: OK
  3885. 828.29 s [vector] +++ OK, passed 100 tests.
  3886. 828.29 s [vector] drop: OK
  3887. 828.29 s [vector] +++ OK, passed 100 tests.
  3888. 828.29 s [vector] splitAt: OK
  3889. 828.29 s [vector] +++ OK, passed 100 tests.
  3890. 828.29 s [vector] empty: OK
  3891. 828.29 s [vector] +++ OK, passed 100 tests.
  3892. 828.29 s [vector] singleton: OK
  3893. 828.29 s [vector] +++ OK, passed 100 tests.
  3894. 828.29 s [vector] replicate: OK
  3895. 828.29 s [vector] +++ OK, passed 100 tests.
  3896. 828.30 s [vector] generate: OK
  3897. 828.30 s [vector] +++ OK, passed 100 tests.
  3898. 828.30 s [vector] iterateN: OK
  3899. 828.30 s [vector] +++ OK, passed 100 tests.
  3900. 828.32 s [haskell-language-server] Preprocessing library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0...
  3901. 828.32 s [haskell-language-server] Building library 'hls-refactor-plugin' for haskell-language-server-2.12.0.0...
  3902. 828.34 s [vector] iterateNM: OK (0.03s)
  3903. 828.34 s [vector] +++ OK, passed 100 tests.
  3904. 828.35 s [vector] generateM: OK (0.02s)
  3905. 828.35 s [vector] +++ OK, passed 100 tests.
  3906. 828.35 s [vector] replicateM: OK
  3907. 828.35 s [vector] +++ OK, passed 100 tests.
  3908. 828.35 s [vector] create: OK
  3909. 828.35 s [vector] +++ OK, passed 100 tests.
  3910. 828.35 s [vector] createT: OK
  3911. 828.35 s [vector] +++ OK, passed 100 tests.
  3912. 828.35 s [vector] unfoldr: OK
  3913. 828.35 s [vector] +++ OK, passed 100 tests.
  3914. 828.36 s [vector] unfoldrN: OK
  3915. 828.36 s [vector] +++ OK, passed 100 tests.
  3916. 828.36 s [vector] unfoldrExactN: OK
  3917. 828.36 s [vector] +++ OK, passed 100 tests.
  3918. 828.36 s [vector] unfoldrM: OK
  3919. 828.36 s [vector] +++ OK, passed 100 tests.
  3920. 828.38 s [vector] unfoldrNM: OK (0.02s)
  3921. 828.38 s [vector] +++ OK, passed 100 tests.
  3922. 828.39 s [vector] unfoldrExactNM: OK (0.02s)
  3923. 828.39 s [vector] +++ OK, passed 100 tests.
  3924. 828.40 s [vector] constructN: OK
  3925. 828.40 s [vector] +++ OK, passed 100 tests.
  3926. 828.40 s [vector] constructrN: OK
  3927. 828.40 s [vector] +++ OK, passed 100 tests.
  3928. 828.40 s [vector] cons: OK
  3929. 828.40 s [vector] +++ OK, passed 100 tests.
  3930. 828.40 s [vector] snoc: OK
  3931. 828.40 s [vector] +++ OK, passed 100 tests.
  3932. 828.42 s [vector] append: OK
  3933. 828.42 s [vector] +++ OK, passed 100 tests.
  3934. 828.42 s [vector] concat: OK (0.01s)
  3935. 828.43 s [vector] +++ OK, passed 100 tests.
  3936. 828.43 s [vector] force: OK
  3937. 828.43 s [vector] +++ OK, passed 100 tests.
  3938. 828.43 s [vector] upd: OK
  3939. 828.43 s [vector] +++ OK, passed 100 tests.
  3940. 828.44 s [vector] accum: OK
  3941. 828.44 s [vector] +++ OK, passed 100 tests.
  3942. 828.44 s [vector] reverse: OK
  3943. 828.44 s [vector] +++ OK, passed 100 tests.
  3944. 828.44 s [vector] backpermute: OK
  3945. 828.44 s [vector] +++ OK, passed 100 tests.
  3946. 828.44 s [vector] map: OK
  3947. 828.44 s [vector] +++ OK, passed 100 tests.
  3948. 828.44 s [vector] imap: OK
  3949. 828.44 s [vector] +++ OK, passed 100 tests.
  3950. 828.45 s [vector] concatMap: OK
  3951. 828.45 s [vector] +++ OK, passed 100 tests.
  3952. 828.45 s [vector] mapM: OK
  3953. 828.45 s [vector] +++ OK, passed 100 tests.
  3954. 828.45 s [vector] mapM_: OK (0.02s)
  3955. 828.46 s [vector] +++ OK, passed 100 tests.
  3956. 828.46 s [vector] forM: OK
  3957. 828.46 s [vector] +++ OK, passed 100 tests.
  3958. 828.48 s [vector] forM_: OK (0.02s)
  3959. 828.48 s [vector] +++ OK, passed 100 tests.
  3960. 828.48 s [vector] imapM: OK
  3961. 828.48 s [vector] +++ OK, passed 100 tests.
  3962. 828.49 s [vector] imapM_: OK (0.01s)
  3963. 828.50 s [vector] +++ OK, passed 100 tests.
  3964. 828.50 s [vector] zipWith: OK
  3965. 828.50 s [vector] +++ OK, passed 100 tests.
  3966. 828.50 s [vector] zipWith3: OK
  3967. 828.50 s [vector] +++ OK, passed 100 tests.
  3968. 828.50 s [vector] izipWith: OK
  3969. 828.51 s [vector] +++ OK, passed 100 tests.
  3970. 828.52 s [vector] izipWith3: OK
  3971. 828.52 s [vector] +++ OK, passed 100 tests.
  3972. 828.52 s [vector] izipWithM: OK
  3973. 828.52 s [vector] +++ OK, passed 100 tests.
  3974. 828.53 s [vector] izipWithM_: OK (0.02s)
  3975. 828.53 s [vector] +++ OK, passed 100 tests.
  3976. 828.53 s [vector] zipWithM: OK
  3977. 828.54 s [vector] +++ OK, passed 100 tests.
  3978. 828.54 s [vector] zipWithM_: OK (0.01s)
  3979. 828.54 s [vector] +++ OK, passed 100 tests.
  3980. 828.54 s [vector] filter: OK
  3981. 828.54 s [vector] +++ OK, passed 100 tests.
  3982. 828.56 s [vector] ifilter: OK
  3983. 828.56 s [vector] +++ OK, passed 100 tests.
  3984. 828.58 s [vector] filterM: OK (0.04s)
  3985. 828.58 s [vector] +++ OK, passed 100 tests.
  3986. 828.58 s [vector] uniq: OK
  3987. 828.58 s [vector] +++ OK, passed 100 tests.
  3988. 828.58 s [vector] mapMaybe: OK
  3989. 828.59 s [vector] +++ OK, passed 100 tests.
  3990. 828.59 s [vector] imapMaybe: OK
  3991. 828.59 s [vector] +++ OK, passed 100 tests.
  3992. 828.59 s [vector] takeWhile: OK
  3993. 828.59 s [vector] +++ OK, passed 100 tests.
  3994. 828.59 s [vector] dropWhile: OK
  3995. 828.59 s [vector] +++ OK, passed 100 tests.
  3996. 828.60 s [vector] partition: OK
  3997. 828.60 s [vector] +++ OK, passed 100 tests.
  3998. 828.60 s [vector] partitionWith: OK
  3999. 828.60 s [vector] +++ OK, passed 100 tests.
  4000. 828.60 s [vector] span: OK
  4001. 828.60 s [vector] +++ OK, passed 100 tests.
  4002. 828.60 s [vector] break: OK
  4003. 828.60 s [vector] +++ OK, passed 100 tests.
  4004. 828.60 s [vector] spanR: OK
  4005. 828.60 s [vector] +++ OK, passed 100 tests.
  4006. 828.60 s [vector] breakR: OK
  4007. 828.60 s [vector] +++ OK, passed 100 tests.
  4008. 828.60 s [vector] groupBy: OK
  4009. 828.60 s [vector] +++ OK, passed 100 tests.
  4010. 828.60 s [vector] elem: OK
  4011. 828.60 s [vector] +++ OK, passed 100 tests.
  4012. 828.60 s [vector] notElem: OK
  4013. 828.60 s [vector] +++ OK, passed 100 tests.
  4014. 828.60 s [vector] find: OK
  4015. 828.60 s [vector] +++ OK, passed 100 tests.
  4016. 828.60 s [vector] findIndex: OK
  4017. 828.60 s [vector] +++ OK, passed 100 tests.
  4018. 828.60 s [vector] findIndexR: OK
  4019. 828.61 s [vector] +++ OK, passed 100 tests.
  4020. 828.61 s [vector] findIndices: OK
  4021. 828.61 s [vector] +++ OK, passed 100 tests.
  4022. 828.61 s [vector] elemIndex: OK
  4023. 828.61 s [vector] +++ OK, passed 100 tests.
  4024. 828.61 s [vector] elemIndices: OK
  4025. 828.61 s [vector] +++ OK, passed 100 tests.
  4026. 828.61 s [vector] foldl: OK
  4027. 828.61 s [vector] +++ OK, passed 100 tests.
  4028. 828.61 s [vector] foldl1: OK
  4029. 828.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4030. 828.61 s [vector] foldl': OK
  4031. 828.61 s [vector] +++ OK, passed 100 tests.
  4032. 828.62 s [vector] foldl1': OK
  4033. 828.62 s [vector] +++ OK, passed 100 tests; 27 discarded.
  4034. 828.62 s [vector] foldr: OK
  4035. 828.62 s [vector] +++ OK, passed 100 tests.
  4036. 828.62 s [vector] foldr1: OK
  4037. 828.63 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4038. 828.63 s [vector] foldr': OK
  4039. 828.63 s [vector] +++ OK, passed 100 tests.
  4040. 828.63 s [vector] foldr1': OK
  4041. 828.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4042. 828.63 s [vector] ifoldl: OK
  4043. 828.63 s [vector] +++ OK, passed 100 tests.
  4044. 828.64 s [vector] ifoldl': OK
  4045. 828.64 s [vector] +++ OK, passed 100 tests.
  4046. 828.64 s [vector] ifoldr: OK
  4047. 828.64 s [vector] +++ OK, passed 100 tests.
  4048. 828.64 s [vector] ifoldr': OK
  4049. 828.64 s [vector] +++ OK, passed 100 tests.
  4050. 828.64 s [vector] ifoldM: OK
  4051. 828.64 s [vector] +++ OK, passed 100 tests.
  4052. 828.65 s [vector] ifoldM': OK
  4053. 828.65 s [vector] +++ OK, passed 100 tests.
  4054. 828.68 s [vector] ifoldM_: OK (0.02s)
  4055. 828.68 s [vector] +++ OK, passed 100 tests.
  4056. 828.68 s [vector] ifoldM'_: OK (0.02s)
  4057. 828.68 s [vector] +++ OK, passed 100 tests.
  4058. 828.69 s [vector] all: OK
  4059. 828.69 s [vector] +++ OK, passed 100 tests.
  4060. 828.69 s [vector] any: OK
  4061. 828.69 s [vector] +++ OK, passed 100 tests.
  4062. 828.70 s [vector] prescanl: OK
  4063. 828.70 s [vector] +++ OK, passed 100 tests.
  4064. 828.70 s [vector] prescanl': OK
  4065. 828.70 s [vector] +++ OK, passed 100 tests.
  4066. 828.70 s [vector] postscanl: OK
  4067. 828.70 s [vector] +++ OK, passed 100 tests.
  4068. 828.70 s [vector] postscanl': OK
  4069. 828.70 s [vector] +++ OK, passed 100 tests.
  4070. 828.70 s [vector] scanl: OK
  4071. 828.70 s [vector] +++ OK, passed 100 tests.
  4072. 828.70 s [vector] scanl': OK
  4073. 828.70 s [vector] +++ OK, passed 100 tests.
  4074. 828.70 s [vector] scanl1: OK
  4075. 828.70 s [vector] +++ OK, passed 100 tests.
  4076. 828.70 s [vector] scanl1': OK
  4077. 828.71 s [vector] +++ OK, passed 100 tests.
  4078. 828.72 s [vector] iscanl: OK
  4079. 828.72 s [vector] +++ OK, passed 100 tests.
  4080. 828.72 s [vector] iscanl': OK
  4081. 828.72 s [vector] +++ OK, passed 100 tests.
  4082. 828.72 s [vector] prescanr: OK
  4083. 828.72 s [vector] +++ OK, passed 100 tests.
  4084. 828.72 s [vector] prescanr': OK
  4085. 828.72 s [vector] +++ OK, passed 100 tests.
  4086. 828.73 s [vector] postscanr: OK
  4087. 828.73 s [vector] +++ OK, passed 100 tests.
  4088. 828.73 s [vector] postscanr': OK
  4089. 828.73 s [vector] +++ OK, passed 100 tests.
  4090. 828.73 s [vector] scanr: OK
  4091. 828.73 s [vector] +++ OK, passed 100 tests.
  4092. 828.73 s [vector] scanr': OK
  4093. 828.74 s [vector] +++ OK, passed 100 tests.
  4094. 828.74 s [vector] scanr1: OK
  4095. 828.74 s [vector] +++ OK, passed 100 tests.
  4096. 828.74 s [vector] scanr1': OK
  4097. 828.74 s [vector] +++ OK, passed 100 tests.
  4098. 828.74 s [vector] iscanr: OK
  4099. 828.74 s [vector] +++ OK, passed 100 tests.
  4100. 828.74 s [vector] iscanr': OK
  4101. 828.74 s [vector] +++ OK, passed 100 tests.
  4102. 828.75 s [vector] mut_read: OK
  4103. 828.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4104. 828.75 s [vector] mut_write: OK
  4105. 828.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4106. 828.76 s [vector] mut_modify: OK
  4107. 828.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4108. 828.76 s [vector] mut_generate: OK
  4109. 828.76 s [vector] +++ OK, passed 100 tests.
  4110. 828.76 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  4111. 828.76 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  4112. 828.76 s [haskell-language-server] but were not needed for compilation:
  4113. 828.76 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-8J13051mbtS8lMbM88xAUh)
  4114. 828.76 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-8kuN6xJTZ3PR3xjZLPClW)
  4115. 828.76 s [haskell-language-server]
  4116. 828.78 s [vector] mut_generateM: OK (0.01s)
  4117. 828.78 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 )
  4118. 828.78 s [vector] +++ OK, passed 100 tests.
  4119. 828.78 s [vector] mut_mapM_: OK (0.02s)
  4120. 828.78 s [vector] +++ OK, passed 100 tests.
  4121. 828.80 s [vector] mut_imapM_: OK (0.02s)
  4122. 828.80 s [vector] +++ OK, passed 100 tests.
  4123. 828.82 s [vector] mut_forM_: OK (0.02s)
  4124. 828.82 s [vector] +++ OK, passed 100 tests.
  4125. 828.83 s [vector] mut_iforM_: OK (0.02s)
  4126. 828.83 s [vector] +++ OK, passed 100 tests.
  4127. 828.83 s [vector] mut_foldr: OK
  4128. 828.84 s [vector] +++ OK, passed 100 tests.
  4129. 828.84 s [vector] mut_foldr': OK
  4130. 828.84 s [vector] +++ OK, passed 100 tests.
  4131. 828.85 s [vector] mut_foldl: OK
  4132. 828.85 s [vector] +++ OK, passed 100 tests.
  4133. 828.86 s [vector] mut_foldl': OK
  4134. 828.86 s [vector] +++ OK, passed 100 tests.
  4135. 828.86 s [vector] mut_ifoldr: OK
  4136. 828.87 s [vector] +++ OK, passed 100 tests.
  4137. 828.87 s [vector] mut_ifoldr': OK
  4138. 828.87 s [vector] +++ OK, passed 100 tests.
  4139. 828.88 s [vector] mut_ifoldl: OK
  4140. 828.88 s [vector] +++ OK, passed 100 tests.
  4141. 828.88 s [vector] mut_ifoldl': OK
  4142. 828.88 s [vector] +++ OK, passed 100 tests.
  4143. 828.88 s [vector] mut_foldM: OK
  4144. 828.88 s [vector] +++ OK, passed 100 tests.
  4145. 828.88 s [vector] mut_foldM': OK
  4146. 828.88 s [vector] +++ OK, passed 100 tests.
  4147. 828.88 s [vector] mut_foldrM: OK
  4148. 828.88 s [vector] +++ OK, passed 100 tests.
  4149. 828.88 s [vector] mut_foldrM': OK
  4150. 828.88 s [vector] +++ OK, passed 100 tests.
  4151. 828.88 s [vector] mut_ifoldM: OK
  4152. 828.88 s [vector] +++ OK, passed 100 tests.
  4153. 828.88 s [vector] mut_ifoldM': OK
  4154. 828.88 s [vector] +++ OK, passed 100 tests.
  4155. 828.88 s [vector] mut_ifoldrM: OK
  4156. 828.88 s [vector] +++ OK, passed 100 tests.
  4157. 828.88 s [vector] mut_ifoldrM': OK
  4158. 828.88 s [vector] +++ OK, passed 100 tests.
  4159. 828.88 s [vector] compare: OK
  4160. 828.88 s [vector] +++ OK, passed 100 tests.
  4161. 828.88 s [vector] maximum: OK
  4162. 828.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4163. 828.88 s [vector] minimum: OK
  4164. 828.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4165. 828.88 s [vector] minIndex: OK
  4166. 828.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4167. 828.88 s [vector] maxIndex: OK
  4168. 828.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4169. 828.88 s [vector] maximumBy: OK
  4170. 828.88 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4171. 828.88 s [vector] minimumBy: OK
  4172. 828.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4173. 828.88 s [vector] maximumOn: OK
  4174. 828.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4175. 828.89 s [vector] minimumOn: OK
  4176. 828.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4177. 828.89 s [vector] maxIndexBy: OK
  4178. 828.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4179. 828.89 s [vector] minIndexBy: OK
  4180. 828.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4181. 828.89 s [vector] ListFirstMaxIndexWins: OK
  4182. 828.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4183. 828.89 s [vector] FalseListFirstMaxIndexWins: OK
  4184. 828.89 s [vector] +++ OK, failed as expected. (after 1 test):
  4185. 828.89 s [vector] Exception:
  4186. 828.89 s [vector] Prelude.foldr1: empty list
  4187. 828.89 s [vector] CallStack (from HasCallStack):
  4188. 828.89 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4189. 828.89 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4190. 828.89 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4191. 828.89 s [vector] []
  4192. 828.89 s [vector] zip: OK
  4193. 828.89 s [vector] +++ OK, passed 100 tests.
  4194. 828.89 s [vector] zip3: OK
  4195. 828.89 s [vector] +++ OK, passed 100 tests.
  4196. 828.89 s [vector] unzip: OK
  4197. 828.89 s [vector] +++ OK, passed 100 tests.
  4198. 828.89 s [vector] unzip3: OK
  4199. 828.89 s [vector] +++ OK, passed 100 tests.
  4200. 828.89 s [vector] indexed: OK
  4201. 828.89 s [vector] +++ OK, passed 100 tests.
  4202. 828.90 s [vector] update: OK
  4203. 828.90 s [vector] +++ OK, passed 100 tests.
  4204. 828.91 s [vector] concat: OK (0.01s)
  4205. 828.91 s [vector] +++ OK, passed 100 tests.
  4206. 828.91 s [vector] mempty: OK
  4207. 828.91 s [vector] +++ OK, passed 100 tests.
  4208. 828.91 s [vector] mappend: OK
  4209. 828.91 s [vector] +++ OK, passed 100 tests.
  4210. 828.92 s [vector] mconcat: OK
  4211. 828.92 s [vector] +++ OK, passed 100 tests.
  4212. 828.92 s [vector] fmap: OK
  4213. 828.92 s [vector] +++ OK, passed 100 tests.
  4214. 828.92 s [vector] return: OK
  4215. 828.92 s [vector] +++ OK, passed 100 tests.
  4216. 828.94 s [vector] bind: OK (0.02s)
  4217. 828.94 s [vector] +++ OK, passed 100 tests.
  4218. 828.94 s [vector] mzip: OK
  4219. 828.94 s [vector] +++ OK, passed 100 tests.
  4220. 828.95 s [vector] munzip: OK
  4221. 828.96 s [vector] +++ OK, passed 100 tests.
  4222. 828.96 s [vector] applicative_pure: OK
  4223. 828.96 s [vector] +++ OK, passed 100 tests.
  4224. 828.99 s [vector] applicative_appl: OK (0.04s)
  4225. 828.99 s [vector] +++ OK, passed 100 tests.
  4226. 828.99 s [vector] alternative_empty: OK
  4227. 828.99 s [vector] +++ OK, passed 100 tests.
  4228. 828.99 s [vector] alternative_or: OK
  4229. 828.99 s [vector] +++ OK, passed 100 tests.
  4230. 829.03 s [vector] sequence: OK (0.04s)
  4231. 829.03 s [vector] +++ OK, passed 100 tests.
  4232. 829.05 s [vector] sequence_: OK
  4233. 829.05 s [vector] +++ OK, passed 100 tests.
  4234. 829.05 s [vector] glength: OK
  4235. 829.05 s [vector] +++ OK, passed 100 tests.
  4236. 829.05 s [vector] sum: OK
  4237. 829.05 s [vector] +++ OK, passed 100 tests.
  4238. 829.05 s [vector] product: OK
  4239. 829.05 s [vector] +++ OK, passed 100 tests.
  4240. 829.05 s [vector] enumFromN: OK
  4241. 829.05 s [vector] +++ OK, passed 100 tests.
  4242. 829.05 s [vector] enumFromThenN: OK
  4243. 829.05 s [vector] +++ OK, passed 100 tests.
  4244. 829.05 s [vector] enumFromTo: OK
  4245. 829.05 s [vector] +++ OK, passed 100 tests.
  4246. 829.05 s [vector] enumFromThenTo: OK
  4247. 829.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4248. 829.05 s [vector] unstream
  4249. 829.05 s [vector] unstream == vunstream (exact): OK
  4250. 829.05 s [vector] +++ OK, passed 100 tests.
  4251. 829.06 s [vector] unstream == vunstream (unknown): OK
  4252. 829.06 s [vector] +++ OK, passed 100 tests.
  4253. 829.06 s [vector] unstreamR ~= vunstream (exact): OK
  4254. 829.06 s [vector] +++ OK, passed 100 tests.
  4255. 829.06 s [vector] unstreamR ~= vunstream (unknown): OK
  4256. 829.06 s [vector] +++ OK, passed 100 tests.
  4257. 829.06 s [vector] Tests.Vector.Primitive
  4258. 829.06 s [vector] Int
  4259. 829.06 s [vector] fromList.toList == id: OK
  4260. 829.06 s [vector] +++ OK, passed 100 tests.
  4261. 829.06 s [vector] toList.fromList == id: OK
  4262. 829.06 s [vector] +++ OK, passed 100 tests.
  4263. 829.06 s [vector] unstream.stream == id: OK
  4264. 829.06 s [vector] +++ OK, passed 100 tests.
  4265. 829.06 s [vector] stream.unstream == id: OK
  4266. 829.06 s [vector] +++ OK, passed 100 tests.
  4267. 829.06 s [vector] eq: OK
  4268. 829.06 s [vector] +++ OK, passed 100 tests.
  4269. 829.07 s [vector] length: OK
  4270. 829.07 s [vector] +++ OK, passed 100 tests.
  4271. 829.07 s [vector] null: OK
  4272. 829.07 s [vector] +++ OK, passed 100 tests.
  4273. 829.07 s [vector] index: OK
  4274. 829.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4275. 829.07 s [vector] safeIndex: OK
  4276. 829.07 s [vector] +++ OK, passed 100 tests.
  4277. 829.07 s [vector] head: OK
  4278. 829.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4279. 829.07 s [vector] last: OK
  4280. 829.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4281. 829.07 s [vector] unsafeIndex: OK
  4282. 829.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4283. 829.07 s [vector] unsafeHead: OK
  4284. 829.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4285. 829.07 s [vector] unsafeLast: OK
  4286. 829.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4287. 829.07 s [vector] slice: OK
  4288. 829.07 s [vector] +++ OK, passed 100 tests.
  4289. 829.07 s [vector] init: OK
  4290. 829.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4291. 829.07 s [vector] tail: OK
  4292. 829.07 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4293. 829.08 s [vector] take: OK
  4294. 829.08 s [vector] +++ OK, passed 100 tests.
  4295. 829.08 s [vector] drop: OK
  4296. 829.08 s [vector] +++ OK, passed 100 tests.
  4297. 829.08 s [vector] splitAt: OK
  4298. 829.08 s [vector] +++ OK, passed 100 tests.
  4299. 829.08 s [vector] empty: OK
  4300. 829.08 s [vector] +++ OK, passed 100 tests.
  4301. 829.08 s [vector] singleton: OK
  4302. 829.08 s [vector] +++ OK, passed 100 tests.
  4303. 829.08 s [vector] replicate: OK
  4304. 829.08 s [vector] +++ OK, passed 100 tests.
  4305. 829.08 s [vector] generate: OK
  4306. 829.09 s [vector] +++ OK, passed 100 tests.
  4307. 829.09 s [vector] iterateN: OK
  4308. 829.10 s [vector] +++ OK, passed 100 tests.
  4309. 829.13 s [vector] iterateNM: OK (0.04s)
  4310. 829.13 s [vector] +++ OK, passed 100 tests.
  4311. 829.14 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 )
  4312. 829.15 s [vector] generateM: OK
  4313. 829.15 s [vector] +++ OK, passed 100 tests.
  4314. 829.17 s [vector] replicateM: OK (0.02s)
  4315. 829.17 s [vector] +++ OK, passed 100 tests.
  4316. 829.17 s [vector] create: OK
  4317. 829.17 s [vector] +++ OK, passed 100 tests.
  4318. 829.17 s [vector] createT: OK
  4319. 829.17 s [vector] +++ OK, passed 100 tests.
  4320. 829.17 s [vector] unfoldr: OK
  4321. 829.17 s [vector] +++ OK, passed 100 tests.
  4322. 829.17 s [vector] unfoldrN: OK
  4323. 829.17 s [vector] +++ OK, passed 100 tests.
  4324. 829.18 s [vector] unfoldrExactN: OK
  4325. 829.18 s [vector] +++ OK, passed 100 tests.
  4326. 829.18 s [vector] unfoldrM: OK
  4327. 829.18 s [vector] +++ OK, passed 100 tests.
  4328. 829.18 s [vector] unfoldrNM: OK
  4329. 829.18 s [vector] +++ OK, passed 100 tests.
  4330. 829.22 s [vector] unfoldrExactNM: OK (0.03s)
  4331. 829.22 s [vector] +++ OK, passed 100 tests.
  4332. 829.22 s [vector] constructN: OK
  4333. 829.22 s [vector] +++ OK, passed 100 tests.
  4334. 829.22 s [vector] constructrN: OK
  4335. 829.22 s [vector] +++ OK, passed 100 tests.
  4336. 829.22 s [vector] cons: OK
  4337. 829.22 s [vector] +++ OK, passed 100 tests.
  4338. 829.24 s [vector] snoc: OK
  4339. 829.24 s [vector] +++ OK, passed 100 tests.
  4340. 829.24 s [vector] append: OK
  4341. 829.24 s [vector] +++ OK, passed 100 tests.
  4342. 829.24 s [vector] concat: OK (0.02s)
  4343. 829.25 s [vector] +++ OK, passed 100 tests.
  4344. 829.25 s [vector] force: OK
  4345. 829.25 s [vector] +++ OK, passed 100 tests.
  4346. 829.25 s [vector] upd: OK
  4347. 829.25 s [vector] +++ OK, passed 100 tests.
  4348. 829.25 s [vector] accum: OK
  4349. 829.25 s [vector] +++ OK, passed 100 tests.
  4350. 829.25 s [vector] reverse: OK
  4351. 829.25 s [vector] +++ OK, passed 100 tests.
  4352. 829.26 s [vector] backpermute: OK
  4353. 829.26 s [vector] +++ OK, passed 100 tests.
  4354. 829.26 s [vector] map: OK
  4355. 829.26 s [vector] +++ OK, passed 100 tests.
  4356. 829.26 s [vector] imap: OK
  4357. 829.26 s [vector] +++ OK, passed 100 tests.
  4358. 829.27 s [vector] concatMap: OK
  4359. 829.27 s [vector] +++ OK, passed 100 tests.
  4360. 829.28 s [vector] mapM: OK
  4361. 829.28 s [vector] +++ OK, passed 100 tests.
  4362. 829.29 s [vector] mapM_: OK (0.02s)
  4363. 829.29 s [vector] +++ OK, passed 100 tests.
  4364. 829.30 s [vector] forM: OK
  4365. 829.30 s [vector] +++ OK, passed 100 tests.
  4366. 829.31 s [vector] forM_: OK (0.02s)
  4367. 829.32 s [vector] +++ OK, passed 100 tests.
  4368. 829.32 s [vector] imapM: OK
  4369. 829.32 s [vector] +++ OK, passed 100 tests.
  4370. 829.34 s [vector] imapM_: OK (0.03s)
  4371. 829.35 s [vector] +++ OK, passed 100 tests.
  4372. 829.35 s [vector] zipWith: OK
  4373. 829.35 s [vector] +++ OK, passed 100 tests.
  4374. 829.35 s [vector] zipWith3: OK
  4375. 829.35 s [vector] +++ OK, passed 100 tests.
  4376. 829.36 s [vector] izipWith: OK
  4377. 829.36 s [vector] +++ OK, passed 100 tests.
  4378. 829.36 s [vector] izipWith3: OK
  4379. 829.36 s [vector] +++ OK, passed 100 tests.
  4380. 829.36 s [vector] izipWithM: OK
  4381. 829.38 s [vector] +++ OK, passed 100 tests.
  4382. 829.38 s [vector] izipWithM_: OK (0.01s)
  4383. 829.38 s [vector] +++ OK, passed 100 tests.
  4384. 829.38 s [vector] zipWithM: OK
  4385. 829.39 s [vector] +++ OK, passed 100 tests.
  4386. 829.40 s [vector] zipWithM_: OK (0.01s)
  4387. 829.40 s [vector] +++ OK, passed 100 tests.
  4388. 829.40 s [vector] filter: OK
  4389. 829.40 s [vector] +++ OK, passed 100 tests.
  4390. 829.42 s [vector] ifilter: OK
  4391. 829.42 s [vector] +++ OK, passed 100 tests.
  4392. 829.44 s [vector] filterM: OK (0.03s)
  4393. 829.44 s [vector] +++ OK, passed 100 tests.
  4394. 829.44 s [vector] uniq: OK
  4395. 829.44 s [vector] +++ OK, passed 100 tests.
  4396. 829.44 s [vector] mapMaybe: OK
  4397. 829.45 s [vector] +++ OK, passed 100 tests.
  4398. 829.45 s [vector] imapMaybe: OK
  4399. 829.45 s [vector] +++ OK, passed 100 tests.
  4400. 829.45 s [vector] takeWhile: OK
  4401. 829.45 s [vector] +++ OK, passed 100 tests.
  4402. 829.45 s [vector] dropWhile: OK
  4403. 829.45 s [vector] +++ OK, passed 100 tests.
  4404. 829.45 s [vector] partition: OK
  4405. 829.46 s [vector] +++ OK, passed 100 tests.
  4406. 829.46 s [vector] partitionWith: OK
  4407. 829.46 s [vector] +++ OK, passed 100 tests.
  4408. 829.46 s [vector] span: OK
  4409. 829.46 s [vector] +++ OK, passed 100 tests.
  4410. 829.46 s [vector] break: OK
  4411. 829.46 s [vector] +++ OK, passed 100 tests.
  4412. 829.46 s [vector] spanR: OK
  4413. 829.46 s [vector] +++ OK, passed 100 tests.
  4414. 829.46 s [vector] breakR: OK
  4415. 829.46 s [vector] +++ OK, passed 100 tests.
  4416. 829.46 s [vector] groupBy: OK
  4417. 829.46 s [vector] +++ OK, passed 100 tests.
  4418. 829.46 s [vector] elem: OK
  4419. 829.46 s [vector] +++ OK, passed 100 tests.
  4420. 829.46 s [vector] notElem: OK
  4421. 829.46 s [vector] +++ OK, passed 100 tests.
  4422. 829.46 s [vector] find: OK
  4423. 829.46 s [vector] +++ OK, passed 100 tests.
  4424. 829.46 s [vector] findIndex: OK
  4425. 829.47 s [vector] +++ OK, passed 100 tests.
  4426. 829.47 s [vector] findIndexR: OK
  4427. 829.47 s [vector] +++ OK, passed 100 tests.
  4428. 829.47 s [vector] findIndices: OK
  4429. 829.47 s [vector] +++ OK, passed 100 tests.
  4430. 829.47 s [vector] elemIndex: OK
  4431. 829.47 s [vector] +++ OK, passed 100 tests.
  4432. 829.47 s [vector] elemIndices: OK
  4433. 829.47 s [vector] +++ OK, passed 100 tests.
  4434. 829.47 s [vector] foldl: OK
  4435. 829.48 s [vector] +++ OK, passed 100 tests.
  4436. 829.48 s [vector] foldl1: OK
  4437. 829.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4438. 829.49 s [vector] foldl': OK
  4439. 829.49 s [vector] +++ OK, passed 100 tests.
  4440. 829.50 s [vector] foldl1': OK
  4441. 829.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4442. 829.50 s [vector] foldr: OK
  4443. 829.50 s [vector] +++ OK, passed 100 tests.
  4444. 829.50 s [vector] foldr1: OK
  4445. 829.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4446. 829.50 s [vector] foldr': OK
  4447. 829.50 s [vector] +++ OK, passed 100 tests.
  4448. 829.50 s [vector] foldr1': OK
  4449. 829.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4450. 829.50 s [vector] ifoldl: OK
  4451. 829.50 s [vector] +++ OK, passed 100 tests.
  4452. 829.51 s [vector] ifoldl': OK
  4453. 829.51 s [vector] +++ OK, passed 100 tests.
  4454. 829.51 s [vector] ifoldr: OK
  4455. 829.51 s [vector] +++ OK, passed 100 tests.
  4456. 829.51 s [vector] ifoldr': OK
  4457. 829.52 s [vector] +++ OK, passed 100 tests.
  4458. 829.52 s [vector] ifoldM: OK
  4459. 829.52 s [vector] +++ OK, passed 100 tests.
  4460. 829.52 s [vector] ifoldM': OK
  4461. 829.52 s [vector] +++ OK, passed 100 tests.
  4462. 829.56 s [vector] ifoldM_: OK (0.02s)
  4463. 829.56 s [vector] +++ OK, passed 100 tests.
  4464. 829.56 s [vector] ifoldM'_: OK (0.02s)
  4465. 829.56 s [vector] +++ OK, passed 100 tests.
  4466. 829.56 s [vector] all: OK
  4467. 829.56 s [vector] +++ OK, passed 100 tests.
  4468. 829.56 s [vector] any: OK
  4469. 829.57 s [vector] +++ OK, passed 100 tests.
  4470. 829.57 s [vector] prescanl: OK
  4471. 829.57 s [vector] +++ OK, passed 100 tests.
  4472. 829.58 s [vector] prescanl': OK
  4473. 829.58 s [vector] +++ OK, passed 100 tests.
  4474. 829.58 s [vector] postscanl: OK
  4475. 829.58 s [vector] +++ OK, passed 100 tests.
  4476. 829.58 s [vector] postscanl': OK
  4477. 829.58 s [vector] +++ OK, passed 100 tests.
  4478. 829.58 s [vector] scanl: OK
  4479. 829.58 s [vector] +++ OK, passed 100 tests.
  4480. 829.99 s [vector] scanl': OK
  4481. 829.99 s [vector] +++ OK, passed 100 tests.
  4482. 829.99 s [vector] scanl1: OK
  4483. 829.99 s [vector] +++ OK, passed 100 tests.
  4484. 829.99 s [vector] scanl1': OK
  4485. 829.99 s [vector] +++ OK, passed 100 tests.
  4486. 829.99 s [vector] iscanl: OK
  4487. 829.99 s [vector] +++ OK, passed 100 tests.
  4488. 829.99 s [vector] iscanl': OK
  4489. 829.99 s [vector] +++ OK, passed 100 tests.
  4490. 829.99 s [vector] prescanr: OK
  4491. 829.99 s [vector] +++ OK, passed 100 tests.
  4492. 829.99 s [vector] prescanr': OK
  4493. 829.99 s [vector] +++ OK, passed 100 tests.
  4494. 829.99 s [vector] postscanr: OK
  4495. 829.99 s [vector] +++ OK, passed 100 tests.
  4496. 829.99 s [vector] postscanr': OK
  4497. 829.99 s [vector] +++ OK, passed 100 tests.
  4498. 829.99 s [vector] scanr: OK
  4499. 829.99 s [vector] +++ OK, passed 100 tests.
  4500. 829.99 s [vector] scanr': OK
  4501. 829.99 s [vector] +++ OK, passed 100 tests.
  4502. 829.99 s [vector] scanr1: OK
  4503. 829.99 s [vector] +++ OK, passed 100 tests.
  4504. 829.99 s [vector] scanr1': OK
  4505. 829.99 s [vector] +++ OK, passed 100 tests.
  4506. 829.99 s [vector] iscanr: OK
  4507. 829.99 s [vector] +++ OK, passed 100 tests.
  4508. 829.99 s [vector] iscanr': OK
  4509. 829.99 s [vector] +++ OK, passed 100 tests.
  4510. 829.99 s [vector] mut_read: OK
  4511. 829.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4512. 829.99 s [vector] mut_write: OK
  4513. 829.99 s [vector] +++ OK, passed 100 tests; 24 discarded.
  4514. 829.99 s [vector] mut_modify: OK
  4515. 829.99 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4516. 829.99 s [vector] mut_generate: OK
  4517. 829.99 s [vector] +++ OK, passed 100 tests.
  4518. 829.99 s [vector] mut_generateM: OK (0.01s)
  4519. 829.99 s [vector] +++ OK, passed 100 tests.
  4520. 830.00 s [vector] mut_mapM_: OK (0.02s)
  4521. 830.00 s [vector] +++ OK, passed 100 tests.
  4522. 830.00 s [vector] mut_imapM_: OK (0.02s)
  4523. 830.00 s [vector] +++ OK, passed 100 tests.
  4524. 830.00 s [vector] mut_forM_: OK (0.02s)
  4525. 830.00 s [vector] +++ OK, passed 100 tests.
  4526. 830.00 s [vector] mut_iforM_: OK (0.02s)
  4527. 830.00 s [vector] +++ OK, passed 100 tests.
  4528. 830.00 s [vector] mut_foldr: OK
  4529. 830.00 s [vector] +++ OK, passed 100 tests.
  4530. 830.00 s [vector] mut_foldr': OK
  4531. 830.00 s [vector] +++ OK, passed 100 tests.
  4532. 830.00 s [vector] mut_foldl: OK
  4533. 830.00 s [vector] +++ OK, passed 100 tests.
  4534. 830.00 s [vector] mut_foldl': OK
  4535. 830.00 s [vector] +++ OK, passed 100 tests.
  4536. 830.00 s [vector] mut_ifoldr: OK
  4537. 830.00 s [vector] +++ OK, passed 100 tests.
  4538. 830.00 s [vector] mut_ifoldr': OK
  4539. 830.00 s [vector] +++ OK, passed 100 tests.
  4540. 830.00 s [vector] mut_ifoldl: OK
  4541. 830.00 s [vector] +++ OK, passed 100 tests.
  4542. 830.00 s [vector] mut_ifoldl': OK
  4543. 830.00 s [vector] +++ OK, passed 100 tests.
  4544. 830.00 s [vector] mut_foldM: OK
  4545. 830.00 s [vector] +++ OK, passed 100 tests.
  4546. 830.00 s [vector] mut_foldM': OK
  4547. 830.00 s [vector] +++ OK, passed 100 tests.
  4548. 830.00 s [vector] mut_foldrM: OK
  4549. 830.00 s [vector] +++ OK, passed 100 tests.
  4550. 830.00 s [vector] mut_foldrM': OK
  4551. 830.00 s [vector] +++ OK, passed 100 tests.
  4552. 830.00 s [vector] mut_ifoldM: OK
  4553. 830.00 s [vector] +++ OK, passed 100 tests.
  4554. 830.00 s [vector] mut_ifoldM': OK
  4555. 830.00 s [vector] +++ OK, passed 100 tests.
  4556. 830.00 s [vector] mut_ifoldrM: OK
  4557. 830.00 s [vector] +++ OK, passed 100 tests.
  4558. 830.00 s [vector] mut_ifoldrM': OK
  4559. 830.00 s [vector] +++ OK, passed 100 tests.
  4560. 830.00 s [vector] compare: OK
  4561. 830.00 s [vector] +++ OK, passed 100 tests.
  4562. 830.00 s [vector] maximum: OK
  4563. 830.00 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4564. 830.00 s [vector] minimum: OK
  4565. 830.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4566. 830.00 s [vector] minIndex: OK
  4567. 830.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4568. 830.00 s [vector] maxIndex: OK
  4569. 830.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4570. 830.00 s [vector] maximumBy: OK
  4571. 830.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4572. 830.00 s [vector] minimumBy: OK
  4573. 830.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4574. 830.00 s [vector] maximumOn: OK
  4575. 830.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4576. 830.00 s [vector] minimumOn: OK
  4577. 830.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4578. 830.00 s [vector] maxIndexBy: OK
  4579. 830.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4580. 830.00 s [vector] minIndexBy: OK
  4581. 830.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4582. 830.00 s [vector] ListFirstMaxIndexWins: OK
  4583. 830.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4584. 830.00 s [vector] FalseListFirstMaxIndexWins: OK
  4585. 830.00 s [vector] +++ OK, failed as expected. (after 1 test):
  4586. 830.00 s [vector] Exception:
  4587. 830.00 s [vector] Prelude.foldr1: empty list
  4588. 830.00 s [vector] CallStack (from HasCallStack):
  4589. 830.00 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4590. 830.00 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4591. 830.00 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4592. 830.00 s [vector] []
  4593. 830.00 s [vector] mempty: OK
  4594. 830.00 s [vector] +++ OK, passed 100 tests.
  4595. 830.00 s [vector] mappend: OK
  4596. 830.00 s [vector] +++ OK, passed 100 tests.
  4597. 830.00 s [vector] mconcat: OK (0.02s)
  4598. 830.00 s [vector] +++ OK, passed 100 tests.
  4599. 830.00 s [vector] glength: OK
  4600. 830.00 s [vector] +++ OK, passed 100 tests.
  4601. 830.00 s [vector] sum: OK
  4602. 830.00 s [vector] +++ OK, passed 100 tests.
  4603. 830.00 s [vector] product: OK
  4604. 830.00 s [vector] +++ OK, passed 100 tests.
  4605. 830.00 s [vector] enumFromN: OK
  4606. 830.00 s [vector] +++ OK, passed 100 tests.
  4607. 830.00 s [vector] enumFromThenN: OK
  4608. 830.00 s [vector] +++ OK, passed 100 tests.
  4609. 830.00 s [vector] enumFromTo: OK
  4610. 830.00 s [vector] +++ OK, passed 100 tests.
  4611. 830.00 s [vector] enumFromThenTo: OK
  4612. 830.00 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4613. 830.00 s [vector] Double
  4614. 830.00 s [vector] fromList.toList == id: OK
  4615. 830.00 s [vector] +++ OK, passed 100 tests.
  4616. 830.00 s [vector] toList.fromList == id: OK
  4617. 830.00 s [vector] +++ OK, passed 100 tests.
  4618. 830.00 s [vector] unstream.stream == id: OK
  4619. 830.00 s [vector] +++ OK, passed 100 tests.
  4620. 830.00 s [vector] stream.unstream == id: OK
  4621. 830.00 s [vector] +++ OK, passed 100 tests.
  4622. 830.00 s [vector] eq: OK
  4623. 830.00 s [vector] +++ OK, passed 100 tests.
  4624. 830.00 s [vector] length: OK
  4625. 830.00 s [vector] +++ OK, passed 100 tests.
  4626. 830.00 s [vector] null: OK
  4627. 830.00 s [vector] +++ OK, passed 100 tests.
  4628. 830.00 s [vector] index: OK
  4629. 830.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4630. 830.00 s [vector] safeIndex: OK
  4631. 830.00 s [vector] +++ OK, passed 100 tests.
  4632. 830.00 s [vector] head: OK
  4633. 830.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4634. 830.00 s [vector] last: OK
  4635. 830.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4636. 830.00 s [vector] unsafeIndex: OK
  4637. 830.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4638. 830.00 s [vector] unsafeHead: OK
  4639. 830.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4640. 830.00 s [vector] unsafeLast: OK
  4641. 830.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4642. 830.00 s [vector] slice: OK
  4643. 830.00 s [vector] +++ OK, passed 100 tests.
  4644. 830.00 s [vector] init: OK
  4645. 830.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4646. 830.00 s [vector] tail: OK
  4647. 830.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4648. 830.00 s [vector] take: OK
  4649. 830.00 s [vector] +++ OK, passed 100 tests.
  4650. 830.00 s [vector] drop: OK
  4651. 830.00 s [vector] +++ OK, passed 100 tests.
  4652. 830.00 s [vector] splitAt: OK
  4653. 830.00 s [vector] +++ OK, passed 100 tests.
  4654. 830.00 s [vector] empty: OK
  4655. 830.00 s [vector] +++ OK, passed 100 tests.
  4656. 830.00 s [vector] singleton: OK
  4657. 830.00 s [vector] +++ OK, passed 100 tests.
  4658. 830.00 s [vector] replicate: OK
  4659. 830.00 s [vector] +++ OK, passed 100 tests.
  4660. 830.00 s [vector] generate: OK
  4661. 830.00 s [vector] +++ OK, passed 100 tests.
  4662. 830.00 s [vector] iterateN: OK
  4663. 830.00 s [vector] +++ OK, passed 100 tests.
  4664. 830.00 s [vector] iterateNM: OK (0.03s)
  4665. 830.00 s [vector] +++ OK, passed 100 tests.
  4666. 830.00 s [vector] generateM: OK (0.03s)
  4667. 830.00 s [vector] +++ OK, passed 100 tests.
  4668. 830.00 s [vector] replicateM: OK (0.02s)
  4669. 830.00 s [vector] +++ OK, passed 100 tests.
  4670. 830.00 s [vector] create: OK
  4671. 830.00 s [vector] +++ OK, passed 100 tests.
  4672. 830.00 s [vector] createT: OK
  4673. 830.00 s [vector] +++ OK, passed 100 tests.
  4674. 830.00 s [vector] unfoldr: OK
  4675. 830.00 s [vector] +++ OK, passed 100 tests.
  4676. 830.00 s [vector] unfoldrN: OK
  4677. 830.00 s [vector] +++ OK, passed 100 tests.
  4678. 830.00 s [vector] unfoldrExactN: OK
  4679. 830.00 s [vector] +++ OK, passed 100 tests.
  4680. 830.00 s [vector] unfoldrM: OK (0.02s)
  4681. 830.00 s [vector] +++ OK, passed 100 tests.
  4682. 830.00 s [vector] unfoldrNM: OK (0.01s)
  4683. 830.00 s [vector] +++ OK, passed 100 tests.
  4684. 830.03 s [vector] unfoldrExactNM: OK (0.04s)
  4685. 830.04 s [vector] +++ OK, passed 100 tests.
  4686. 830.04 s [vector] constructN: OK (0.01s)
  4687. 830.05 s [vector] +++ OK, passed 100 tests.
  4688. 830.05 s [vector] constructrN: OK (0.02s)
  4689. 830.05 s [vector] +++ OK, passed 100 tests.
  4690. 830.05 s [vector] cons: OK
  4691. 830.05 s [vector] +++ OK, passed 100 tests.
  4692. 830.05 s [vector] snoc: OK
  4693. 830.05 s [vector] +++ OK, passed 100 tests.
  4694. 830.05 s [vector] append: OK
  4695. 830.05 s [vector] +++ OK, passed 100 tests.
  4696. 830.08 s [vector] concat: OK (0.02s)
  4697. 830.08 s [vector] +++ OK, passed 100 tests.
  4698. 830.08 s [vector] force: OK
  4699. 830.10 s [vector] +++ OK, passed 100 tests.
  4700. 830.10 s [vector] upd: OK
  4701. 830.10 s [vector] +++ OK, passed 100 tests.
  4702. 830.10 s [vector] accum: OK (0.02s)
  4703. 830.10 s [vector] +++ OK, passed 100 tests.
  4704. 830.11 s [vector] reverse: OK
  4705. 830.11 s [vector] +++ OK, passed 100 tests.
  4706. 830.12 s [vector] backpermute: OK
  4707. 830.13 s [vector] +++ OK, passed 100 tests.
  4708. 830.14 s [vector] map: OK
  4709. 830.14 s [vector] +++ OK, passed 100 tests.
  4710. 830.14 s [vector] imap: OK
  4711. 830.14 s [vector] +++ OK, passed 100 tests.
  4712. 830.14 s [vector] concatMap: OK
  4713. 830.14 s [vector] +++ OK, passed 100 tests.
  4714. 830.14 s [vector] mapM: OK
  4715. 830.14 s [vector] +++ OK, passed 100 tests.
  4716. 830.18 s [vector] mapM_: OK (0.04s)
  4717. 830.18 s [vector] +++ OK, passed 100 tests.
  4718. 830.18 s [vector] forM: OK
  4719. 830.18 s [vector] +++ OK, passed 100 tests.
  4720. 830.24 s [vector] forM_: OK (0.05s)
  4721. 830.24 s [vector] +++ OK, passed 100 tests.
  4722. 830.26 s [vector] imapM: OK (0.02s)
  4723. 830.26 s [vector] +++ OK, passed 100 tests.
  4724. 830.29 s [vector] imapM_: OK (0.04s)
  4725. 830.29 s [vector] +++ OK, passed 100 tests.
  4726. 830.30 s [vector] zipWith: OK
  4727. 830.30 s [vector] +++ OK, passed 100 tests.
  4728. 830.31 s [vector] zipWith3: OK (0.01s)
  4729. 830.32 s [vector] +++ OK, passed 100 tests.
  4730. 830.32 s [vector] izipWith: OK (0.01s)
  4731. 830.33 s [vector] +++ OK, passed 100 tests.
  4732. 830.34 s [vector] izipWith3: OK (0.01s)
  4733. 830.34 s [vector] +++ OK, passed 100 tests.
  4734. 830.36 s [vector] izipWithM: OK (0.01s)
  4735. 830.36 s [vector] +++ OK, passed 100 tests.
  4736. 830.39 s [vector] izipWithM_: OK (0.04s)
  4737. 830.40 s [vector] +++ OK, passed 100 tests.
  4738. 830.40 s [vector] zipWithM: OK
  4739. 830.40 s [vector] +++ OK, passed 100 tests.
  4740. 830.43 s [vector] zipWithM_: OK (0.03s)
  4741. 830.43 s [vector] +++ OK, passed 100 tests.
  4742. 830.43 s [vector] filter: OK
  4743. 830.43 s [vector] +++ OK, passed 100 tests.
  4744. 830.43 s [vector] ifilter: OK
  4745. 830.44 s [vector] +++ OK, passed 100 tests.
  4746. 830.49 s [vector] filterM: OK (0.06s)
  4747. 830.49 s [vector] +++ OK, passed 100 tests.
  4748. 830.49 s [vector] uniq: OK
  4749. 830.50 s [vector] +++ OK, passed 100 tests.
  4750. 830.51 s [vector] mapMaybe: OK
  4751. 830.51 s [vector] +++ OK, passed 100 tests.
  4752. 830.51 s [vector] imapMaybe: OK
  4753. 830.51 s [vector] +++ OK, passed 100 tests.
  4754. 830.51 s [vector] takeWhile: OK
  4755. 830.51 s [vector] +++ OK, passed 100 tests.
  4756. 830.52 s [vector] dropWhile: OK
  4757. 830.52 s [vector] +++ OK, passed 100 tests.
  4758. 830.52 s [vector] partition: OK
  4759. 830.52 s [vector] +++ OK, passed 100 tests.
  4760. 830.53 s [vector] partitionWith: OK
  4761. 830.53 s [vector] +++ OK, passed 100 tests.
  4762. 830.53 s [vector] span: OK
  4763. 830.53 s [vector] +++ OK, passed 100 tests.
  4764. 830.54 s [vector] break: OK
  4765. 830.54 s [vector] +++ OK, passed 100 tests.
  4766. 830.54 s [vector] spanR: OK
  4767. 830.54 s [vector] +++ OK, passed 100 tests.
  4768. 830.54 s [vector] breakR: OK
  4769. 830.54 s [vector] +++ OK, passed 100 tests.
  4770. 830.55 s [vector] groupBy: OK (0.01s)
  4771. 830.55 s [vector] +++ OK, passed 100 tests.
  4772. 830.55 s [vector] elem: OK
  4773. 830.55 s [vector] +++ OK, passed 100 tests.
  4774. 830.55 s [vector] notElem: OK
  4775. 830.55 s [vector] +++ OK, passed 100 tests.
  4776. 830.55 s [vector] find: OK
  4777. 830.55 s [vector] +++ OK, passed 100 tests.
  4778. 830.56 s [vector] findIndex: OK
  4779. 830.56 s [vector] +++ OK, passed 100 tests.
  4780. 830.56 s [vector] findIndexR: OK
  4781. 830.56 s [vector] +++ OK, passed 100 tests.
  4782. 830.56 s [vector] findIndices: OK
  4783. 830.56 s [vector] +++ OK, passed 100 tests.
  4784. 830.57 s [vector] elemIndex: OK
  4785. 830.57 s [vector] +++ OK, passed 100 tests.
  4786. 830.58 s [vector] elemIndices: OK
  4787. 830.58 s [vector] +++ OK, passed 100 tests.
  4788. 830.59 s [vector] foldl: OK (0.01s)
  4789. 830.59 s [vector] +++ OK, passed 100 tests.
  4790. 830.60 s [vector] foldl1: OK (0.01s)
  4791. 830.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4792. 830.62 s [vector] foldl': OK (0.01s)
  4793. 830.62 s [vector] +++ OK, passed 100 tests.
  4794. 830.62 s [vector] foldl1': OK (0.01s)
  4795. 830.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4796. 830.64 s [vector] foldr: OK
  4797. 830.64 s [vector] +++ OK, passed 100 tests.
  4798. 830.66 s [vector] foldr1: OK (0.01s)
  4799. 830.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4800. 830.66 s [vector] foldr': OK (0.01s)
  4801. 830.67 s [vector] +++ OK, passed 100 tests.
  4802. 830.67 s [vector] foldr1': OK (0.01s)
  4803. 830.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4804. 830.69 s [vector] ifoldl: OK
  4805. 830.70 s [vector] +++ OK, passed 100 tests.
  4806. 830.70 s [vector] ifoldl': OK (0.01s)
  4807. 830.70 s [vector] +++ OK, passed 100 tests.
  4808. 830.72 s [vector] ifoldr: OK (0.01s)
  4809. 830.72 s [vector] +++ OK, passed 100 tests.
  4810. 830.72 s [vector] ifoldr': OK (0.01s)
  4811. 830.73 s [vector] +++ OK, passed 100 tests.
  4812. 830.74 s [vector] ifoldM: OK (0.01s)
  4813. 830.74 s [vector] +++ OK, passed 100 tests.
  4814. 830.76 s [vector] ifoldM': OK (0.01s)
  4815. 830.76 s [vector] +++ OK, passed 100 tests.
  4816. 830.80 s [vector] ifoldM_: OK (0.04s)
  4817. 830.80 s [vector] +++ OK, passed 100 tests.
  4818. 830.82 s [vector] ifoldM'_: OK (0.04s)
  4819. 830.82 s [vector] +++ OK, passed 100 tests.
  4820. 830.83 s [vector] all: OK
  4821. 830.84 s [vector] +++ OK, passed 100 tests.
  4822. 830.85 s [vector] any: OK
  4823. 830.85 s [vector] +++ OK, passed 100 tests.
  4824. 830.86 s [vector] prescanl: OK (0.01s)
  4825. 830.86 s [vector] +++ OK, passed 100 tests.
  4826. 830.86 s [vector] prescanl': OK (0.02s)
  4827. 830.86 s [vector] +++ OK, passed 100 tests.
  4828. 830.88 s [vector] postscanl: OK (0.02s)
  4829. 830.88 s [vector] +++ OK, passed 100 tests.
  4830. 830.90 s [vector] postscanl': OK (0.02s)
  4831. 830.90 s [vector] +++ OK, passed 100 tests.
  4832. 830.90 s [vector] scanl: OK (0.01s)
  4833. 830.90 s [vector] +++ OK, passed 100 tests.
  4834. 830.92 s [vector] scanl': OK (0.01s)
  4835. 830.92 s [vector] +++ OK, passed 100 tests.
  4836. 830.93 s [vector] scanl1: OK (0.01s)
  4837. 830.93 s [vector] +++ OK, passed 100 tests.
  4838. 830.94 s [vector] scanl1': OK (0.01s)
  4839. 830.94 s [vector] +++ OK, passed 100 tests.
  4840. 830.96 s [vector] iscanl: OK (0.01s)
  4841. 830.96 s [vector] +++ OK, passed 100 tests.
  4842. 830.96 s [vector] iscanl': OK (0.01s)
  4843. 830.96 s [vector] +++ OK, passed 100 tests.
  4844. 830.97 s [vector] prescanr: OK (0.01s)
  4845. 830.97 s [vector] +++ OK, passed 100 tests.
  4846. 830.98 s [vector] prescanr': OK
  4847. 830.98 s [vector] +++ OK, passed 100 tests.
  4848. 831.00 s [vector] postscanr: OK (0.01s)
  4849. 831.00 s [vector] +++ OK, passed 100 tests.
  4850. 831.02 s [vector] postscanr': OK (0.01s)
  4851. 831.02 s [vector] +++ OK, passed 100 tests.
  4852. 831.02 s [vector] scanr: OK (0.01s)
  4853. 831.02 s [vector] +++ OK, passed 100 tests.
  4854. 831.04 s [vector] scanr': OK (0.01s)
  4855. 831.04 s [vector] +++ OK, passed 100 tests.
  4856. 831.06 s [vector] scanr1: OK (0.01s)
  4857. 831.06 s [vector] +++ OK, passed 100 tests.
  4858. 831.07 s [vector] scanr1': OK (0.02s)
  4859. 831.07 s [vector] +++ OK, passed 100 tests.
  4860. 831.08 s [vector] iscanr: OK (0.01s)
  4861. 831.08 s [vector] +++ OK, passed 100 tests.
  4862. 831.09 s [vector] iscanr': OK (0.01s)
  4863. 831.09 s [vector] +++ OK, passed 100 tests.
  4864. 831.09 s [vector] mut_read: OK
  4865. 831.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4866. 831.09 s [vector] mut_write: OK
  4867. 831.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4868. 831.09 s [vector] mut_modify: OK
  4869. 831.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4870. 831.09 s [vector] mut_generate: OK
  4871. 831.10 s [vector] +++ OK, passed 100 tests.
  4872. 831.12 s [vector] mut_generateM: OK (0.01s)
  4873. 831.12 s [vector] +++ OK, passed 100 tests.
  4874. 831.16 s [vector] mut_mapM_: OK (0.03s)
  4875. 831.16 s [vector] +++ OK, passed 100 tests.
  4876. 831.18 s [vector] mut_imapM_: OK (0.04s)
  4877. 831.18 s [vector] +++ OK, passed 100 tests.
  4878. 831.22 s [vector] mut_forM_: OK (0.03s)
  4879. 831.22 s [vector] +++ OK, passed 100 tests.
  4880. 831.26 s [vector] mut_iforM_: OK (0.05s)
  4881. 831.26 s [vector] +++ OK, passed 100 tests.
  4882. 831.28 s [vector] mut_foldr: OK (0.01s)
  4883. 831.28 s [vector] +++ OK, passed 100 tests.
  4884. 831.29 s [vector] mut_foldr': OK (0.01s)
  4885. 831.30 s [vector] +++ OK, passed 100 tests.
  4886. 831.30 s [vector] mut_foldl: OK (0.01s)
  4887. 831.30 s [vector] +++ OK, passed 100 tests.
  4888. 831.32 s [vector] mut_foldl': OK (0.01s)
  4889. 831.32 s [vector] +++ OK, passed 100 tests.
  4890. 831.32 s [vector] mut_ifoldr: OK (0.01s)
  4891. 831.32 s [vector] +++ OK, passed 100 tests.
  4892. 831.34 s [vector] mut_ifoldr': OK (0.01s)
  4893. 831.34 s [vector] +++ OK, passed 100 tests.
  4894. 831.36 s [vector] mut_ifoldl: OK (0.01s)
  4895. 831.36 s [vector] +++ OK, passed 100 tests.
  4896. 831.37 s [vector] mut_ifoldl': OK (0.01s)
  4897. 831.37 s [vector] +++ OK, passed 100 tests.
  4898. 831.37 s [vector] mut_foldM: OK (0.01s)
  4899. 831.37 s [vector] +++ OK, passed 100 tests.
  4900. 831.40 s [vector] mut_foldM': OK (0.01s)
  4901. 831.40 s [vector] +++ OK, passed 100 tests.
  4902. 831.42 s [vector] mut_foldrM: OK (0.01s)
  4903. 831.42 s [vector] +++ OK, passed 100 tests.
  4904. 831.44 s [vector] mut_foldrM': OK (0.02s)
  4905. 831.44 s [vector] +++ OK, passed 100 tests.
  4906. 831.46 s [vector] mut_ifoldM: OK (0.02s)
  4907. 831.46 s [vector] +++ OK, passed 100 tests.
  4908. 831.46 s [vector] mut_ifoldM': OK (0.01s)
  4909. 831.46 s [vector] +++ OK, passed 100 tests.
  4910. 831.48 s [vector] mut_ifoldrM: OK (0.01s)
  4911. 831.48 s [vector] +++ OK, passed 100 tests.
  4912. 831.49 s [vector] mut_ifoldrM': OK (0.02s)
  4913. 831.49 s [vector] +++ OK, passed 100 tests.
  4914. 831.49 s [vector] compare: OK
  4915. 831.49 s [vector] +++ OK, passed 100 tests.
  4916. 831.49 s [vector] maximum: OK
  4917. 831.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4918. 831.49 s [vector] minimum: OK
  4919. 831.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4920. 831.49 s [vector] minIndex: OK
  4921. 831.49 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4922. 831.49 s [vector] maxIndex: OK
  4923. 831.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4924. 831.49 s [vector] maximumBy: OK
  4925. 831.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4926. 831.49 s [vector] minimumBy: OK
  4927. 831.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4928. 831.49 s [vector] maximumOn: OK
  4929. 831.49 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4930. 831.49 s [vector] minimumOn: OK
  4931. 831.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4932. 831.50 s [vector] maxIndexBy: OK
  4933. 831.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4934. 831.50 s [vector] minIndexBy: OK
  4935. 831.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4936. 831.50 s [vector] ListFirstMaxIndexWins: OK
  4937. 831.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4938. 831.50 s [vector] FalseListFirstMaxIndexWins: OK
  4939. 831.50 s [vector] +++ OK, failed as expected. (after 1 test):
  4940. 831.50 s [vector] Exception:
  4941. 831.50 s [vector] Prelude.foldr1: empty list
  4942. 831.50 s [vector] CallStack (from HasCallStack):
  4943. 831.50 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  4944. 831.50 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  4945. 831.50 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  4946. 831.50 s [vector] []
  4947. 831.50 s [vector] mempty: OK
  4948. 831.50 s [vector] +++ OK, passed 100 tests.
  4949. 831.52 s [vector] mappend: OK
  4950. 831.52 s [vector] +++ OK, passed 100 tests.
  4951. 831.52 s [vector] mconcat: OK (0.02s)
  4952. 831.52 s [vector] +++ OK, passed 100 tests.
  4953. 831.53 s [vector] glength: OK
  4954. 831.53 s [vector] +++ OK, passed 100 tests.
  4955. 831.53 s [vector] sum: OK
  4956. 831.53 s [vector] +++ OK, passed 100 tests.
  4957. 831.53 s [vector] product: OK
  4958. 831.53 s [vector] +++ OK, passed 100 tests.
  4959. 831.53 s [vector] enumFromN: OK
  4960. 831.53 s [vector] +++ OK, passed 100 tests.
  4961. 831.53 s [vector] enumFromThenN: OK
  4962. 831.53 s [vector] +++ OK, passed 100 tests.
  4963. 831.54 s [vector] enumFromTo: OK
  4964. 831.54 s [vector] +++ OK, passed 100 tests.
  4965. 831.54 s [vector] enumFromThenTo: OK
  4966. 831.54 s [vector] +++ OK, passed 100 tests.
  4967. 831.54 s [vector] unstream
  4968. 831.54 s [vector] unstream == vunstream (exact): OK
  4969. 831.54 s [vector] +++ OK, passed 100 tests.
  4970. 831.54 s [vector] unstream == vunstream (unknown): OK
  4971. 831.54 s [vector] +++ OK, passed 100 tests.
  4972. 831.54 s [vector] unstreamR ~= vunstream (exact): OK
  4973. 831.54 s [vector] +++ OK, passed 100 tests.
  4974. 831.54 s [vector] unstreamR ~= vunstream (unknown): OK
  4975. 831.54 s [vector] +++ OK, passed 100 tests.
  4976. 831.54 s [vector] Tests.Vector.Storable
  4977. 831.54 s [vector] Data.Vector.Storable.Vector (Int)
  4978. 831.54 s [vector] fromList.toList == id: OK
  4979. 831.54 s [vector] +++ OK, passed 100 tests.
  4980. 831.54 s [vector] toList.fromList == id: OK
  4981. 831.54 s [vector] +++ OK, passed 100 tests.
  4982. 831.54 s [vector] unstream.stream == id: OK
  4983. 831.54 s [vector] +++ OK, passed 100 tests.
  4984. 831.54 s [vector] stream.unstream == id: OK
  4985. 831.54 s [vector] +++ OK, passed 100 tests.
  4986. 831.54 s [vector] eq: OK
  4987. 831.54 s [vector] +++ OK, passed 100 tests.
  4988. 831.54 s [vector] length: OK
  4989. 831.54 s [vector] +++ OK, passed 100 tests.
  4990. 831.54 s [vector] null: OK
  4991. 831.55 s [vector] +++ OK, passed 100 tests.
  4992. 831.55 s [vector] index: OK
  4993. 831.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4994. 831.55 s [vector] safeIndex: OK
  4995. 831.55 s [vector] +++ OK, passed 100 tests.
  4996. 831.55 s [vector] head: OK
  4997. 831.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4998. 831.55 s [vector] last: OK
  4999. 831.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5000. 831.55 s [vector] unsafeIndex: OK
  5001. 831.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5002. 831.55 s [vector] unsafeHead: OK
  5003. 831.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5004. 831.55 s [vector] unsafeLast: OK
  5005. 831.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5006. 831.55 s [vector] slice: OK
  5007. 831.55 s [vector] +++ OK, passed 100 tests.
  5008. 831.55 s [vector] init: OK
  5009. 831.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5010. 831.55 s [vector] tail: OK
  5011. 831.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5012. 831.55 s [vector] take: OK
  5013. 831.55 s [vector] +++ OK, passed 100 tests.
  5014. 831.55 s [vector] drop: OK
  5015. 831.55 s [vector] +++ OK, passed 100 tests.
  5016. 831.55 s [vector] splitAt: OK
  5017. 831.55 s [vector] +++ OK, passed 100 tests.
  5018. 831.55 s [vector] empty: OK
  5019. 831.55 s [vector] +++ OK, passed 100 tests.
  5020. 831.56 s [vector] singleton: OK
  5021. 831.56 s [vector] +++ OK, passed 100 tests.
  5022. 831.56 s [vector] replicate: OK
  5023. 831.56 s [vector] +++ OK, passed 100 tests.
  5024. 831.56 s [vector] generate: OK
  5025. 831.56 s [vector] +++ OK, passed 100 tests.
  5026. 831.56 s [vector] iterateN: OK
  5027. 831.56 s [vector] +++ OK, passed 100 tests.
  5028. 831.62 s [vector] iterateNM: OK (0.04s)
  5029. 831.62 s [vector] +++ OK, passed 100 tests.
  5030. 831.64 s [vector] generateM: OK (0.02s)
  5031. 831.64 s [vector] +++ OK, passed 100 tests.
  5032. 831.67 s [vector] replicateM: OK (0.04s)
  5033. 831.67 s [vector] +++ OK, passed 100 tests.
  5034. 831.67 s [vector] create: OK
  5035. 831.67 s [vector] +++ OK, passed 100 tests.
  5036. 831.67 s [vector] createT: OK
  5037. 831.67 s [vector] +++ OK, passed 100 tests.
  5038. 831.68 s [vector] unfoldr: OK
  5039. 831.68 s [vector] +++ OK, passed 100 tests.
  5040. 831.68 s [vector] unfoldrN: OK
  5041. 831.68 s [vector] +++ OK, passed 100 tests.
  5042. 831.68 s [vector] unfoldrExactN: OK
  5043. 831.68 s [vector] +++ OK, passed 100 tests.
  5044. 831.68 s [vector] unfoldrM: OK
  5045. 831.68 s [vector] +++ OK, passed 100 tests.
  5046. 831.69 s [vector] unfoldrNM: OK
  5047. 831.70 s [vector] +++ OK, passed 100 tests.
  5048. 831.71 s [vector] unfoldrExactNM: OK (0.02s)
  5049. 831.71 s [vector] +++ OK, passed 100 tests.
  5050. 831.71 s [vector] constructN: OK
  5051. 831.71 s [vector] +++ OK, passed 100 tests.
  5052. 831.71 s [vector] constructrN: OK
  5053. 831.71 s [vector] +++ OK, passed 100 tests.
  5054. 831.71 s [vector] cons: OK
  5055. 831.71 s [vector] +++ OK, passed 100 tests.
  5056. 831.71 s [vector] snoc: OK
  5057. 831.71 s [vector] +++ OK, passed 100 tests.
  5058. 831.72 s [vector] append: OK
  5059. 831.72 s [vector] +++ OK, passed 100 tests.
  5060. 831.73 s [vector] concat: OK (0.01s)
  5061. 831.73 s [vector] +++ OK, passed 100 tests.
  5062. 831.73 s [vector] force: OK
  5063. 831.73 s [vector] +++ OK, passed 100 tests.
  5064. 831.74 s [vector] upd: OK
  5065. 831.74 s [vector] +++ OK, passed 100 tests.
  5066. 831.74 s [vector] accum: OK
  5067. 831.74 s [vector] +++ OK, passed 100 tests.
  5068. 831.74 s [vector] reverse: OK
  5069. 831.74 s [vector] +++ OK, passed 100 tests.
  5070. 831.74 s [vector] backpermute: OK
  5071. 831.74 s [vector] +++ OK, passed 100 tests.
  5072. 831.74 s [vector] map: OK
  5073. 831.74 s [vector] +++ OK, passed 100 tests.
  5074. 831.75 s [vector] imap: OK
  5075. 831.75 s [vector] +++ OK, passed 100 tests.
  5076. 831.75 s [vector] concatMap: OK
  5077. 831.75 s [vector] +++ OK, passed 100 tests.
  5078. 831.75 s [vector] mapM: OK
  5079. 831.75 s [vector] +++ OK, passed 100 tests.
  5080. 831.77 s [vector] mapM_: OK (0.01s)
  5081. 831.77 s [vector] +++ OK, passed 100 tests.
  5082. 831.78 s [vector] forM: OK
  5083. 831.78 s [vector] +++ OK, passed 100 tests.
  5084. 831.79 s [vector] forM_: OK (0.02s)
  5085. 831.79 s [vector] +++ OK, passed 100 tests.
  5086. 831.80 s [vector] imapM: OK
  5087. 831.80 s [vector] +++ OK, passed 100 tests.
  5088. 831.82 s [vector] imapM_: OK (0.02s)
  5089. 831.82 s [vector] +++ OK, passed 100 tests.
  5090. 831.82 s [vector] zipWith: OK
  5091. 831.82 s [vector] +++ OK, passed 100 tests.
  5092. 831.82 s [vector] zipWith3: OK
  5093. 831.82 s [vector] +++ OK, passed 100 tests.
  5094. 831.83 s [vector] izipWith: OK
  5095. 831.83 s [vector] +++ OK, passed 100 tests.
  5096. 831.83 s [vector] izipWith3: OK
  5097. 831.84 s [vector] +++ OK, passed 100 tests.
  5098. 831.84 s [vector] izipWithM: OK
  5099. 831.84 s [vector] +++ OK, passed 100 tests.
  5100. 831.85 s [vector] izipWithM_: OK (0.01s)
  5101. 831.85 s [vector] +++ OK, passed 100 tests.
  5102. 831.86 s [vector] zipWithM: OK
  5103. 831.86 s [vector] +++ OK, passed 100 tests.
  5104. 831.87 s [vector] zipWithM_: OK (0.01s)
  5105. 831.87 s [vector] +++ OK, passed 100 tests.
  5106. 831.88 s [vector] filter: OK
  5107. 831.88 s [vector] +++ OK, passed 100 tests.
  5108. 831.88 s [vector] ifilter: OK
  5109. 831.88 s [vector] +++ OK, passed 100 tests.
  5110. 831.90 s [vector] filterM: OK (0.03s)
  5111. 831.90 s [vector] +++ OK, passed 100 tests.
  5112. 831.90 s [vector] uniq: OK
  5113. 831.90 s [vector] +++ OK, passed 100 tests.
  5114. 831.90 s [vector] mapMaybe: OK
  5115. 831.90 s [vector] +++ OK, passed 100 tests.
  5116. 831.90 s [vector] imapMaybe: OK
  5117. 831.90 s [vector] +++ OK, passed 100 tests.
  5118. 831.90 s [vector] takeWhile: OK
  5119. 831.91 s [vector] +++ OK, passed 100 tests.
  5120. 831.91 s [vector] dropWhile: OK
  5121. 831.91 s [vector] +++ OK, passed 100 tests.
  5122. 831.91 s [vector] partition: OK
  5123. 831.91 s [vector] +++ OK, passed 100 tests.
  5124. 831.91 s [vector] partitionWith: OK
  5125. 831.91 s [vector] +++ OK, passed 100 tests.
  5126. 831.91 s [vector] span: OK
  5127. 831.91 s [vector] +++ OK, passed 100 tests.
  5128. 831.91 s [vector] break: OK
  5129. 831.91 s [vector] +++ OK, passed 100 tests.
  5130. 831.92 s [vector] spanR: OK
  5131. 831.92 s [vector] +++ OK, passed 100 tests.
  5132. 831.92 s [vector] breakR: OK
  5133. 831.92 s [vector] +++ OK, passed 100 tests.
  5134. 831.92 s [vector] groupBy: OK
  5135. 831.92 s [vector] +++ OK, passed 100 tests.
  5136. 831.92 s [vector] elem: OK
  5137. 831.92 s [vector] +++ OK, passed 100 tests.
  5138. 831.92 s [vector] notElem: OK
  5139. 831.92 s [vector] +++ OK, passed 100 tests.
  5140. 831.92 s [vector] find: OK
  5141. 831.92 s [vector] +++ OK, passed 100 tests.
  5142. 831.92 s [vector] findIndex: OK
  5143. 831.92 s [vector] +++ OK, passed 100 tests.
  5144. 831.92 s [vector] findIndexR: OK
  5145. 831.92 s [vector] +++ OK, passed 100 tests.
  5146. 831.92 s [vector] findIndices: OK
  5147. 831.92 s [vector] +++ OK, passed 100 tests.
  5148. 831.92 s [vector] elemIndex: OK
  5149. 831.92 s [vector] +++ OK, passed 100 tests.
  5150. 831.92 s [vector] elemIndices: OK
  5151. 831.92 s [vector] +++ OK, passed 100 tests.
  5152. 831.92 s [vector] foldl: OK
  5153. 831.93 s [vector] +++ OK, passed 100 tests.
  5154. 831.93 s [vector] foldl1: OK
  5155. 831.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5156. 831.93 s [vector] foldl': OK
  5157. 831.93 s [vector] +++ OK, passed 100 tests.
  5158. 831.93 s [vector] foldl1': OK
  5159. 831.94 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5160. 831.94 s [vector] foldr: OK
  5161. 831.94 s [vector] +++ OK, passed 100 tests.
  5162. 831.94 s [vector] foldr1: OK
  5163. 831.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5164. 831.95 s [vector] foldr': OK
  5165. 831.96 s [vector] +++ OK, passed 100 tests.
  5166. 831.96 s [vector] foldr1': OK
  5167. 831.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5168. 831.97 s [vector] ifoldl: OK
  5169. 831.97 s [vector] +++ OK, passed 100 tests.
  5170. 831.97 s [vector] ifoldl': OK
  5171. 831.97 s [vector] +++ OK, passed 100 tests.
  5172. 831.97 s [vector] ifoldr: OK
  5173. 831.97 s [vector] +++ OK, passed 100 tests.
  5174. 831.97 s [vector] ifoldr': OK
  5175. 831.97 s [vector] +++ OK, passed 100 tests.
  5176. 831.97 s [vector] ifoldM: OK
  5177. 831.97 s [vector] +++ OK, passed 100 tests.
  5178. 831.97 s [vector] ifoldM': OK
  5179. 831.97 s [vector] +++ OK, passed 100 tests.
  5180. 832.00 s [vector] ifoldM_: OK (0.01s)
  5181. 832.00 s [vector] +++ OK, passed 100 tests.
  5182. 832.01 s [vector] ifoldM'_: OK (0.02s)
  5183. 832.01 s [vector] +++ OK, passed 100 tests.
  5184. 832.01 s [vector] all: OK
  5185. 832.01 s [vector] +++ OK, passed 100 tests.
  5186. 832.02 s [vector] any: OK
  5187. 832.02 s [vector] +++ OK, passed 100 tests.
  5188. 832.02 s [vector] prescanl: OK
  5189. 832.02 s [vector] +++ OK, passed 100 tests.
  5190. 832.02 s [vector] prescanl': OK
  5191. 832.02 s [vector] +++ OK, passed 100 tests.
  5192. 832.02 s [vector] postscanl: OK
  5193. 832.02 s [vector] +++ OK, passed 100 tests.
  5194. 832.02 s [vector] postscanl': OK
  5195. 832.02 s [vector] +++ OK, passed 100 tests.
  5196. 832.03 s [vector] scanl: OK
  5197. 832.03 s [vector] +++ OK, passed 100 tests.
  5198. 832.03 s [vector] scanl': OK
  5199. 832.03 s [vector] +++ OK, passed 100 tests.
  5200. 832.04 s [vector] scanl1: OK
  5201. 832.04 s [vector] +++ OK, passed 100 tests.
  5202. 832.04 s [vector] scanl1': OK
  5203. 832.04 s [vector] +++ OK, passed 100 tests.
  5204. 832.04 s [vector] iscanl: OK
  5205. 832.04 s [vector] +++ OK, passed 100 tests.
  5206. 832.05 s [vector] iscanl': OK
  5207. 832.05 s [vector] +++ OK, passed 100 tests.
  5208. 832.06 s [vector] prescanr: OK
  5209. 832.06 s [vector] +++ OK, passed 100 tests.
  5210. 832.06 s [vector] prescanr': OK
  5211. 832.06 s [vector] +++ OK, passed 100 tests.
  5212. 832.06 s [vector] postscanr: OK
  5213. 832.06 s [vector] +++ OK, passed 100 tests.
  5214. 832.06 s [vector] postscanr': OK
  5215. 832.06 s [vector] +++ OK, passed 100 tests.
  5216. 832.06 s [vector] scanr: OK
  5217. 832.06 s [vector] +++ OK, passed 100 tests.
  5218. 832.07 s [vector] scanr': OK
  5219. 832.07 s [vector] +++ OK, passed 100 tests.
  5220. 832.07 s [vector] scanr1: OK
  5221. 832.07 s [vector] +++ OK, passed 100 tests.
  5222. 832.07 s [vector] scanr1': OK
  5223. 832.07 s [vector] +++ OK, passed 100 tests.
  5224. 832.08 s [vector] iscanr: OK
  5225. 832.08 s [vector] +++ OK, passed 100 tests.
  5226. 832.08 s [vector] iscanr': OK
  5227. 832.08 s [vector] +++ OK, passed 100 tests.
  5228. 832.08 s [vector] mut_read: OK
  5229. 832.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5230. 832.08 s [vector] mut_write: OK
  5231. 832.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5232. 832.09 s [vector] mut_modify: OK
  5233. 832.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5234. 832.09 s [vector] mut_generate: OK
  5235. 832.10 s [vector] +++ OK, passed 100 tests.
  5236. 832.10 s [vector] mut_generateM: OK
  5237. 832.10 s [vector] +++ OK, passed 100 tests.
  5238. 832.12 s [vector] mut_mapM_: OK (0.02s)
  5239. 832.12 s [vector] +++ OK, passed 100 tests.
  5240. 832.14 s [vector] mut_imapM_: OK (0.02s)
  5241. 832.14 s [vector] +++ OK, passed 100 tests.
  5242. 832.16 s [vector] mut_forM_: OK (0.02s)
  5243. 832.16 s [vector] +++ OK, passed 100 tests.
  5244. 832.17 s [vector] mut_iforM_: OK (0.02s)
  5245. 832.17 s [vector] +++ OK, passed 100 tests.
  5246. 832.17 s [vector] mut_foldr: OK
  5247. 832.17 s [vector] +++ OK, passed 100 tests.
  5248. 832.17 s [vector] mut_foldr': OK
  5249. 832.18 s [vector] +++ OK, passed 100 tests.
  5250. 832.18 s [vector] mut_foldl: OK
  5251. 832.18 s [vector] +++ OK, passed 100 tests.
  5252. 832.18 s [vector] mut_foldl': OK
  5253. 832.19 s [vector] +++ OK, passed 100 tests.
  5254. 832.19 s [vector] mut_ifoldr: OK
  5255. 832.19 s [vector] +++ OK, passed 100 tests.
  5256. 832.19 s [vector] mut_ifoldr': OK
  5257. 832.19 s [vector] +++ OK, passed 100 tests.
  5258. 832.20 s [vector] mut_ifoldl: OK
  5259. 832.20 s [vector] +++ OK, passed 100 tests.
  5260. 832.20 s [vector] mut_ifoldl': OK
  5261. 832.20 s [vector] +++ OK, passed 100 tests.
  5262. 832.20 s [vector] mut_foldM: OK
  5263. 832.20 s [vector] +++ OK, passed 100 tests.
  5264. 832.20 s [vector] mut_foldM': OK
  5265. 832.21 s [vector] +++ OK, passed 100 tests.
  5266. 832.21 s [vector] mut_foldrM: OK
  5267. 832.21 s [vector] +++ OK, passed 100 tests.
  5268. 832.21 s [vector] mut_foldrM': OK
  5269. 832.22 s [vector] +++ OK, passed 100 tests.
  5270. 832.22 s [vector] mut_ifoldM: OK
  5271. 832.22 s [vector] +++ OK, passed 100 tests.
  5272. 832.23 s [vector] mut_ifoldM': OK
  5273. 832.23 s [vector] +++ OK, passed 100 tests.
  5274. 832.23 s [vector] mut_ifoldrM: OK
  5275. 832.24 s [vector] +++ OK, passed 100 tests.
  5276. 832.24 s [vector] mut_ifoldrM': OK
  5277. 832.24 s [vector] +++ OK, passed 100 tests.
  5278. 832.24 s [vector] compare: OK
  5279. 832.24 s [vector] +++ OK, passed 100 tests.
  5280. 832.24 s [vector] maximum: OK
  5281. 832.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5282. 832.24 s [vector] minimum: OK
  5283. 832.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5284. 832.24 s [vector] minIndex: OK
  5285. 832.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5286. 832.24 s [vector] maxIndex: OK
  5287. 832.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5288. 832.24 s [vector] maximumBy: OK
  5289. 832.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5290. 832.24 s [vector] minimumBy: OK
  5291. 832.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5292. 832.25 s [vector] maximumOn: OK
  5293. 832.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5294. 832.25 s [vector] minimumOn: OK
  5295. 832.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5296. 832.25 s [vector] maxIndexBy: OK
  5297. 832.25 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5298. 832.25 s [vector] minIndexBy: OK
  5299. 832.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5300. 832.25 s [vector] ListFirstMaxIndexWins: OK
  5301. 832.25 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5302. 832.25 s [vector] FalseListFirstMaxIndexWins: OK
  5303. 832.25 s [vector] +++ OK, failed as expected. (after 1 test):
  5304. 832.25 s [vector] Exception:
  5305. 832.25 s [vector] Prelude.foldr1: empty list
  5306. 832.25 s [vector] CallStack (from HasCallStack):
  5307. 832.25 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5308. 832.25 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5309. 832.25 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5310. 832.25 s [vector] []
  5311. 832.25 s [vector] mempty: OK
  5312. 832.25 s [vector] +++ OK, passed 100 tests.
  5313. 832.26 s [vector] mappend: OK
  5314. 832.26 s [vector] +++ OK, passed 100 tests.
  5315. 832.27 s [vector] mconcat: OK (0.02s)
  5316. 832.27 s [vector] +++ OK, passed 100 tests.
  5317. 832.27 s [vector] glength: OK
  5318. 832.27 s [vector] +++ OK, passed 100 tests.
  5319. 832.27 s [vector] sum: OK
  5320. 832.27 s [vector] +++ OK, passed 100 tests.
  5321. 832.28 s [vector] product: OK
  5322. 832.28 s [vector] +++ OK, passed 100 tests.
  5323. 832.28 s [vector] enumFromN: OK
  5324. 832.28 s [vector] +++ OK, passed 100 tests.
  5325. 832.28 s [vector] enumFromThenN: OK
  5326. 832.28 s [vector] +++ OK, passed 100 tests.
  5327. 832.28 s [vector] enumFromTo: OK
  5328. 832.28 s [vector] +++ OK, passed 100 tests.
  5329. 832.28 s [vector] enumFromThenTo: OK
  5330. 832.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5331. 832.28 s [vector] Data.Vector.Storable.Vector (Double)
  5332. 832.28 s [vector] fromList.toList == id: OK
  5333. 832.28 s [vector] +++ OK, passed 100 tests.
  5334. 832.28 s [vector] toList.fromList == id: OK
  5335. 832.28 s [vector] +++ OK, passed 100 tests.
  5336. 832.28 s [vector] unstream.stream == id: OK
  5337. 832.28 s [vector] +++ OK, passed 100 tests.
  5338. 832.28 s [vector] stream.unstream == id: OK
  5339. 832.28 s [vector] +++ OK, passed 100 tests.
  5340. 832.28 s [vector] eq: OK
  5341. 832.28 s [vector] +++ OK, passed 100 tests.
  5342. 832.28 s [vector] length: OK
  5343. 832.28 s [vector] +++ OK, passed 100 tests.
  5344. 832.28 s [vector] null: OK
  5345. 832.29 s [vector] +++ OK, passed 100 tests.
  5346. 832.29 s [vector] index: OK
  5347. 832.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5348. 832.29 s [vector] safeIndex: OK
  5349. 832.29 s [vector] +++ OK, passed 100 tests.
  5350. 832.29 s [vector] head: OK
  5351. 832.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5352. 832.29 s [vector] last: OK
  5353. 832.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5354. 832.29 s [vector] unsafeIndex: OK
  5355. 832.29 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5356. 832.29 s [vector] unsafeHead: OK
  5357. 832.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5358. 832.29 s [vector] unsafeLast: OK
  5359. 832.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5360. 832.29 s [vector] slice: OK
  5361. 832.30 s [vector] +++ OK, passed 100 tests.
  5362. 832.30 s [vector] init: OK
  5363. 832.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5364. 832.30 s [vector] tail: OK
  5365. 832.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5366. 832.30 s [vector] take: OK
  5367. 832.30 s [vector] +++ OK, passed 100 tests.
  5368. 832.30 s [vector] drop: OK
  5369. 832.30 s [vector] +++ OK, passed 100 tests.
  5370. 832.30 s [vector] splitAt: OK
  5371. 832.30 s [vector] +++ OK, passed 100 tests.
  5372. 832.30 s [vector] empty: OK
  5373. 832.30 s [vector] +++ OK, passed 100 tests.
  5374. 832.30 s [vector] singleton: OK
  5375. 832.30 s [vector] +++ OK, passed 100 tests.
  5376. 832.30 s [vector] replicate: OK
  5377. 832.30 s [vector] +++ OK, passed 100 tests.
  5378. 832.31 s [vector] generate: OK
  5379. 832.32 s [vector] +++ OK, passed 100 tests.
  5380. 832.32 s [vector] iterateN: OK
  5381. 832.32 s [vector] +++ OK, passed 100 tests.
  5382. 832.34 s [vector] iterateNM: OK (0.03s)
  5383. 832.34 s [vector] +++ OK, passed 100 tests.
  5384. 832.38 s [vector] generateM: OK (0.01s)
  5385. 832.38 s [vector] +++ OK, passed 100 tests.
  5386. 832.39 s [vector] replicateM: OK (0.02s)
  5387. 832.39 s [vector] +++ OK, passed 100 tests.
  5388. 832.39 s [vector] create: OK
  5389. 832.39 s [vector] +++ OK, passed 100 tests.
  5390. 832.39 s [vector] createT: OK
  5391. 832.39 s [vector] +++ OK, passed 100 tests.
  5392. 832.39 s [vector] unfoldr: OK
  5393. 832.39 s [vector] +++ OK, passed 100 tests.
  5394. 832.39 s [vector] unfoldrN: OK
  5395. 832.39 s [vector] +++ OK, passed 100 tests.
  5396. 832.39 s [vector] unfoldrExactN: OK
  5397. 832.39 s [vector] +++ OK, passed 100 tests.
  5398. 832.40 s [vector] unfoldrM: OK
  5399. 832.42 s [vector] +++ OK, passed 100 tests.
  5400. 832.42 s [vector] unfoldrNM: OK
  5401. 832.42 s [vector] +++ OK, passed 100 tests.
  5402. 832.46 s [vector] unfoldrExactNM: OK (0.05s)
  5403. 832.46 s [vector] +++ OK, passed 100 tests.
  5404. 832.48 s [vector] constructN: OK (0.01s)
  5405. 832.48 s [vector] +++ OK, passed 100 tests.
  5406. 832.48 s [vector] constructrN: OK (0.01s)
  5407. 832.48 s [vector] +++ OK, passed 100 tests.
  5408. 832.48 s [vector] cons: OK
  5409. 832.48 s [vector] +++ OK, passed 100 tests.
  5410. 832.48 s [vector] snoc: OK
  5411. 832.48 s [vector] +++ OK, passed 100 tests.
  5412. 832.48 s [vector] append: OK
  5413. 832.48 s [vector] +++ OK, passed 100 tests.
  5414. 832.50 s [vector] concat: OK (0.02s)
  5415. 832.50 s [vector] +++ OK, passed 100 tests.
  5416. 832.50 s [vector] force: OK
  5417. 832.50 s [vector] +++ OK, passed 100 tests.
  5418. 832.52 s [vector] upd: OK
  5419. 832.52 s [vector] +++ OK, passed 100 tests.
  5420. 832.52 s [vector] accum: OK (0.01s)
  5421. 832.52 s [vector] +++ OK, passed 100 tests.
  5422. 832.52 s [vector] reverse: OK
  5423. 832.52 s [vector] +++ OK, passed 100 tests.
  5424. 832.54 s [vector] backpermute: OK
  5425. 832.54 s [vector] +++ OK, passed 100 tests.
  5426. 832.54 s [vector] map: OK
  5427. 832.54 s [vector] +++ OK, passed 100 tests.
  5428. 832.54 s [vector] imap: OK
  5429. 832.54 s [vector] +++ OK, passed 100 tests.
  5430. 832.55 s [vector] concatMap: OK
  5431. 832.55 s [vector] +++ OK, passed 100 tests.
  5432. 832.55 s [vector] mapM: OK
  5433. 832.55 s [vector] +++ OK, passed 100 tests.
  5434. 832.59 s [vector] mapM_: OK (0.04s)
  5435. 832.59 s [vector] +++ OK, passed 100 tests.
  5436. 832.62 s [vector] forM: OK
  5437. 832.62 s [vector] +++ OK, passed 100 tests.
  5438. 832.64 s [vector] forM_: OK (0.04s)
  5439. 832.64 s [vector] +++ OK, passed 100 tests.
  5440. 832.65 s [vector] imapM: OK
  5441. 832.65 s [vector] +++ OK, passed 100 tests.
  5442. 832.69 s [vector] imapM_: OK (0.04s)
  5443. 832.70 s [vector] +++ OK, passed 100 tests.
  5444. 832.71 s [vector] zipWith: OK
  5445. 832.72 s [vector] +++ OK, passed 100 tests.
  5446. 832.72 s [vector] zipWith3: OK (0.01s)
  5447. 832.72 s [vector] +++ OK, passed 100 tests.
  5448. 832.72 s [vector] izipWith: OK
  5449. 832.72 s [vector] +++ OK, passed 100 tests.
  5450. 832.72 s [vector] izipWith3: OK (0.01s)
  5451. 832.72 s [vector] +++ OK, passed 100 tests.
  5452. 832.74 s [vector] izipWithM: OK
  5453. 832.74 s [vector] +++ OK, passed 100 tests.
  5454. 832.76 s [vector] izipWithM_: OK (0.03s)
  5455. 832.76 s [vector] +++ OK, passed 100 tests.
  5456. 832.78 s [vector] zipWithM: OK (0.01s)
  5457. 832.78 s [vector] +++ OK, passed 100 tests.
  5458. 832.81 s [vector] zipWithM_: OK (0.03s)
  5459. 832.81 s [vector] +++ OK, passed 100 tests.
  5460. 832.82 s [vector] filter: OK
  5461. 832.82 s [vector] +++ OK, passed 100 tests.
  5462. 832.82 s [vector] ifilter: OK
  5463. 832.82 s [vector] +++ OK, passed 100 tests.
  5464. 832.86 s [vector] filterM: OK (0.04s)
  5465. 832.86 s [vector] +++ OK, passed 100 tests.
  5466. 832.86 s [vector] uniq: OK
  5467. 832.87 s [vector] +++ OK, passed 100 tests.
  5468. 832.87 s [vector] mapMaybe: OK
  5469. 832.88 s [vector] +++ OK, passed 100 tests.
  5470. 832.88 s [vector] imapMaybe: OK
  5471. 832.88 s [vector] +++ OK, passed 100 tests.
  5472. 832.88 s [vector] takeWhile: OK
  5473. 832.88 s [vector] +++ OK, passed 100 tests.
  5474. 832.88 s [vector] dropWhile: OK
  5475. 832.88 s [vector] +++ OK, passed 100 tests.
  5476. 832.88 s [vector] partition: OK
  5477. 832.88 s [vector] +++ OK, passed 100 tests.
  5478. 832.89 s [vector] partitionWith: OK
  5479. 832.89 s [vector] +++ OK, passed 100 tests.
  5480. 832.89 s [vector] span: OK
  5481. 832.89 s [vector] +++ OK, passed 100 tests.
  5482. 832.90 s [vector] break: OK
  5483. 832.90 s [vector] +++ OK, passed 100 tests.
  5484. 832.90 s [vector] spanR: OK
  5485. 832.90 s [vector] +++ OK, passed 100 tests.
  5486. 832.90 s [vector] breakR: OK
  5487. 832.90 s [vector] +++ OK, passed 100 tests.
  5488. 832.91 s [vector] groupBy: OK
  5489. 832.91 s [vector] +++ OK, passed 100 tests.
  5490. 832.91 s [vector] elem: OK
  5491. 832.91 s [vector] +++ OK, passed 100 tests.
  5492. 832.91 s [vector] notElem: OK
  5493. 832.91 s [vector] +++ OK, passed 100 tests.
  5494. 832.91 s [vector] find: OK
  5495. 832.91 s [vector] +++ OK, passed 100 tests.
  5496. 832.91 s [vector] findIndex: OK
  5497. 832.91 s [vector] +++ OK, passed 100 tests.
  5498. 832.92 s [vector] findIndexR: OK
  5499. 832.92 s [vector] +++ OK, passed 100 tests.
  5500. 832.92 s [vector] findIndices: OK
  5501. 832.92 s [vector] +++ OK, passed 100 tests.
  5502. 832.92 s [vector] elemIndex: OK
  5503. 832.92 s [vector] +++ OK, passed 100 tests.
  5504. 832.92 s [vector] elemIndices: OK
  5505. 832.93 s [vector] +++ OK, passed 100 tests.
  5506. 832.94 s [vector] foldl: OK (0.01s)
  5507. 832.94 s [vector] +++ OK, passed 100 tests.
  5508. 832.98 s [vector] foldl1: OK (0.01s)
  5509. 832.98 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5510. 832.98 s [vector] foldl': OK (0.02s)
  5511. 832.98 s [vector] +++ OK, passed 100 tests.
  5512. 833.00 s [vector] foldl1': OK (0.02s)
  5513. 833.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5514. 833.02 s [vector] foldr: OK (0.02s)
  5515. 833.02 s [vector] +++ OK, passed 100 tests.
  5516. 833.02 s [vector] foldr1: OK (0.01s)
  5517. 833.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5518. 833.04 s [vector] foldr': OK (0.01s)
  5519. 833.04 s [vector] +++ OK, passed 100 tests.
  5520. 833.06 s [vector] foldr1': OK (0.01s)
  5521. 833.06 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5522. 833.06 s [vector] ifoldl: OK (0.01s)
  5523. 833.07 s [vector] +++ OK, passed 100 tests.
  5524. 833.08 s [vector] ifoldl': OK (0.01s)
  5525. 833.08 s [vector] +++ OK, passed 100 tests.
  5526. 833.10 s [vector] ifoldr: OK (0.01s)
  5527. 833.10 s [vector] +++ OK, passed 100 tests.
  5528. 833.10 s [vector] ifoldr': OK (0.01s)
  5529. 833.10 s [vector] +++ OK, passed 100 tests.
  5530. 833.12 s [vector] ifoldM: OK (0.01s)
  5531. 833.12 s [vector] +++ OK, passed 100 tests.
  5532. 833.14 s [vector] ifoldM': OK (0.02s)
  5533. 833.14 s [vector] +++ OK, passed 100 tests.
  5534. 833.18 s [vector] ifoldM_: OK (0.04s)
  5535. 833.18 s [vector] +++ OK, passed 100 tests.
  5536. 833.21 s [vector] ifoldM'_: OK (0.04s)
  5537. 833.21 s [vector] +++ OK, passed 100 tests.
  5538. 833.21 s [vector] all: OK
  5539. 833.21 s [vector] +++ OK, passed 100 tests.
  5540. 833.21 s [vector] any: OK
  5541. 833.22 s [vector] +++ OK, passed 100 tests.
  5542. 833.23 s [vector] prescanl: OK (0.01s)
  5543. 833.23 s [vector] +++ OK, passed 100 tests.
  5544. 833.24 s [vector] prescanl': OK (0.01s)
  5545. 833.24 s [vector] +++ OK, passed 100 tests.
  5546. 833.26 s [vector] postscanl: OK (0.01s)
  5547. 833.26 s [vector] +++ OK, passed 100 tests.
  5548. 833.26 s [vector] postscanl': OK (0.01s)
  5549. 833.26 s [vector] +++ OK, passed 100 tests.
  5550. 833.28 s [vector] scanl: OK (0.01s)
  5551. 833.28 s [vector] +++ OK, passed 100 tests.
  5552. 833.28 s [vector] scanl': OK (0.01s)
  5553. 833.28 s [vector] +++ OK, passed 100 tests.
  5554. 833.30 s [vector] scanl1: OK (0.01s)
  5555. 833.30 s [vector] +++ OK, passed 100 tests.
  5556. 833.31 s [vector] scanl1': OK (0.01s)
  5557. 833.31 s [vector] +++ OK, passed 100 tests.
  5558. 833.32 s [vector] iscanl: OK (0.01s)
  5559. 833.32 s [vector] +++ OK, passed 100 tests.
  5560. 833.34 s [vector] iscanl': OK (0.01s)
  5561. 833.34 s [vector] +++ OK, passed 100 tests.
  5562. 833.34 s [vector] prescanr: OK (0.01s)
  5563. 833.34 s [vector] +++ OK, passed 100 tests.
  5564. 833.36 s [vector] prescanr': OK (0.01s)
  5565. 833.36 s [vector] +++ OK, passed 100 tests.
  5566. 833.36 s [vector] postscanr: OK (0.01s)
  5567. 833.36 s [vector] +++ OK, passed 100 tests.
  5568. 833.38 s [vector] postscanr': OK (0.01s)
  5569. 833.38 s [vector] +++ OK, passed 100 tests.
  5570. 833.38 s [vector] scanr: OK (0.01s)
  5571. 833.38 s [vector] +++ OK, passed 100 tests.
  5572. 833.40 s [vector] scanr': OK (0.01s)
  5573. 833.40 s [vector] +++ OK, passed 100 tests.
  5574. 833.42 s [vector] scanr1: OK (0.01s)
  5575. 833.42 s [vector] +++ OK, passed 100 tests.
  5576. 833.43 s [vector] scanr1': OK (0.01s)
  5577. 833.43 s [vector] +++ OK, passed 100 tests.
  5578. 833.44 s [vector] iscanr: OK (0.01s)
  5579. 833.44 s [vector] +++ OK, passed 100 tests.
  5580. 833.45 s [vector] iscanr': OK (0.01s)
  5581. 833.45 s [vector] +++ OK, passed 100 tests.
  5582. 833.45 s [vector] mut_read: OK
  5583. 833.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5584. 833.45 s [vector] mut_write: OK
  5585. 833.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5586. 833.45 s [vector] mut_modify: OK
  5587. 833.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5588. 833.45 s [vector] mut_generate: OK
  5589. 833.46 s [vector] +++ OK, passed 100 tests.
  5590. 833.48 s [vector] mut_generateM: OK (0.02s)
  5591. 833.48 s [vector] +++ OK, passed 100 tests.
  5592. 833.52 s [vector] mut_mapM_: OK (0.03s)
  5593. 833.52 s [vector] +++ OK, passed 100 tests.
  5594. 833.54 s [vector] mut_imapM_: OK (0.03s)
  5595. 833.54 s [vector] +++ OK, passed 100 tests.
  5596. 833.57 s [vector] mut_forM_: OK (0.04s)
  5597. 833.57 s [vector] +++ OK, passed 100 tests.
  5598. 833.62 s [vector] mut_iforM_: OK (0.03s)
  5599. 833.62 s [vector] +++ OK, passed 100 tests.
  5600. 833.63 s [vector] mut_foldr: OK (0.01s)
  5601. 833.63 s [vector] +++ OK, passed 100 tests.
  5602. 833.64 s [vector] mut_foldr': OK (0.01s)
  5603. 833.64 s [vector] +++ OK, passed 100 tests.
  5604. 833.66 s [vector] mut_foldl: OK (0.01s)
  5605. 833.66 s [vector] +++ OK, passed 100 tests.
  5606. 833.68 s [vector] mut_foldl': OK (0.02s)
  5607. 833.68 s [vector] +++ OK, passed 100 tests.
  5608. 833.68 s [vector] mut_ifoldr: OK (0.01s)
  5609. 833.68 s [vector] +++ OK, passed 100 tests.
  5610. 833.70 s [vector] mut_ifoldr': OK (0.01s)
  5611. 833.70 s [vector] +++ OK, passed 100 tests.
  5612. 833.71 s [vector] mut_ifoldl: OK (0.01s)
  5613. 833.71 s [vector] +++ OK, passed 100 tests.
  5614. 833.72 s [vector] mut_ifoldl': OK (0.01s)
  5615. 833.72 s [vector] +++ OK, passed 100 tests.
  5616. 833.74 s [vector] mut_foldM: OK (0.02s)
  5617. 833.74 s [vector] +++ OK, passed 100 tests.
  5618. 833.76 s [vector] mut_foldM': OK (0.01s)
  5619. 833.76 s [vector] +++ OK, passed 100 tests.
  5620. 833.76 s [vector] mut_foldrM: OK (0.01s)
  5621. 833.76 s [vector] +++ OK, passed 100 tests.
  5622. 833.77 s [pandoc] Phase: fixupPhase
  5623. 833.77 s [vector] mut_foldrM': OK (0.01s)
  5624. 833.77 s [vector] +++ OK, passed 100 tests.
  5625. 833.78 s [vector] mut_ifoldM: OK
  5626. 833.78 s [vector] +++ OK, passed 100 tests.
  5627. 833.79 s [pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
  5628. 833.79 s [pandoc] shrinking /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3-ghc9.10.3.so
  5629. 833.80 s [vector] mut_ifoldM': OK (0.01s)
  5630. 833.80 s [vector] +++ OK, passed 100 tests.
  5631. 833.82 s [vector] mut_ifoldrM: OK (0.01s)
  5632. 833.82 s [vector] +++ OK, passed 100 tests.
  5633. 833.82 s [vector] mut_ifoldrM': OK (0.01s)
  5634. 833.82 s [vector] +++ OK, passed 100 tests.
  5635. 833.82 s [vector] compare: OK
  5636. 833.82 s [vector] +++ OK, passed 100 tests.
  5637. 833.83 s [vector] maximum: OK
  5638. 833.83 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5639. 833.83 s [vector] minimum: OK
  5640. 833.83 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5641. 833.83 s [vector] minIndex: OK
  5642. 833.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5643. 833.83 s [vector] maxIndex: OK
  5644. 833.83 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5645. 833.83 s [vector] maximumBy: OK
  5646. 833.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5647. 833.83 s [vector] minimumBy: OK
  5648. 833.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5649. 833.83 s [vector] maximumOn: OK
  5650. 833.83 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5651. 833.83 s [vector] minimumOn: OK
  5652. 833.83 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5653. 833.83 s [vector] maxIndexBy: OK
  5654. 833.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5655. 833.83 s [vector] minIndexBy: OK
  5656. 833.83 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5657. 833.83 s [vector] ListFirstMaxIndexWins: OK
  5658. 833.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5659. 833.84 s [vector] FalseListFirstMaxIndexWins: OK
  5660. 833.84 s [vector] +++ OK, failed as expected. (after 1 test):
  5661. 833.84 s [vector] Exception:
  5662. 833.84 s [vector] Prelude.foldr1: empty list
  5663. 833.84 s [vector] CallStack (from HasCallStack):
  5664. 833.84 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5665. 833.84 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5666. 833.84 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5667. 833.84 s [vector] []
  5668. 833.84 s [vector] mempty: OK
  5669. 833.84 s [vector] +++ OK, passed 100 tests.
  5670. 833.84 s [vector] mappend: OK
  5671. 833.84 s [vector] +++ OK, passed 100 tests.
  5672. 833.86 s [vector] mconcat: OK (0.02s)
  5673. 833.86 s [vector] +++ OK, passed 100 tests.
  5674. 833.86 s [vector] glength: OK
  5675. 833.86 s [vector] +++ OK, passed 100 tests.
  5676. 833.86 s [vector] sum: OK
  5677. 833.86 s [vector] +++ OK, passed 100 tests.
  5678. 833.86 s [vector] product: OK
  5679. 833.86 s [vector] +++ OK, passed 100 tests.
  5680. 833.86 s [vector] enumFromN: OK
  5681. 833.86 s [vector] +++ OK, passed 100 tests.
  5682. 833.86 s [vector] enumFromThenN: OK
  5683. 833.86 s [vector] +++ OK, passed 100 tests.
  5684. 833.87 s [vector] enumFromTo: OK
  5685. 833.87 s [vector] +++ OK, passed 100 tests.
  5686. 833.87 s [vector] enumFromThenTo: OK
  5687. 833.87 s [vector] +++ OK, passed 100 tests; 2 discarded.
  5688. 833.87 s [vector] unstream
  5689. 833.87 s [vector] unstream == vunstream (exact): OK
  5690. 833.87 s [vector] +++ OK, passed 100 tests.
  5691. 833.87 s [vector] unstream == vunstream (unknown): OK
  5692. 833.87 s [vector] +++ OK, passed 100 tests.
  5693. 833.87 s [vector] unstreamR ~= vunstream (exact): OK
  5694. 833.87 s [vector] +++ OK, passed 100 tests.
  5695. 833.87 s [vector] unstreamR ~= vunstream (unknown): OK
  5696. 833.87 s [vector] +++ OK, passed 100 tests.
  5697. 833.87 s [vector] Tests.Vector.Strict
  5698. 833.87 s [vector] Bool
  5699. 833.87 s [vector] fromList.toList == id: OK
  5700. 833.87 s [vector] +++ OK, passed 100 tests.
  5701. 833.87 s [vector] toList.fromList == id: OK
  5702. 833.87 s [vector] +++ OK, passed 100 tests.
  5703. 833.88 s [vector] unstream.stream == id: OK
  5704. 833.88 s [vector] +++ OK, passed 100 tests.
  5705. 833.88 s [vector] stream.unstream == id: OK
  5706. 833.88 s [vector] +++ OK, passed 100 tests.
  5707. 833.88 s [vector] eq: OK
  5708. 833.88 s [vector] +++ OK, passed 100 tests.
  5709. 833.88 s [vector] length: OK
  5710. 833.88 s [vector] +++ OK, passed 100 tests.
  5711. 833.88 s [vector] null: OK
  5712. 833.88 s [vector] +++ OK, passed 100 tests.
  5713. 833.88 s [vector] index: OK
  5714. 833.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5715. 833.88 s [vector] safeIndex: OK
  5716. 833.88 s [vector] +++ OK, passed 100 tests.
  5717. 833.88 s [vector] head: OK
  5718. 833.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5719. 833.88 s [vector] last: OK
  5720. 833.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5721. 833.88 s [vector] unsafeIndex: OK
  5722. 833.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5723. 833.88 s [vector] unsafeHead: OK
  5724. 833.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5725. 833.88 s [vector] unsafeLast: OK
  5726. 833.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5727. 833.88 s [vector] slice: OK
  5728. 833.88 s [vector] +++ OK, passed 100 tests.
  5729. 833.88 s [vector] init: OK
  5730. 833.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5731. 833.88 s [vector] tail: OK
  5732. 833.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5733. 833.88 s [vector] take: OK
  5734. 833.88 s [vector] +++ OK, passed 100 tests.
  5735. 833.88 s [vector] drop: OK
  5736. 833.88 s [vector] +++ OK, passed 100 tests.
  5737. 833.88 s [vector] splitAt: OK
  5738. 833.88 s [vector] +++ OK, passed 100 tests.
  5739. 833.88 s [vector] empty: OK
  5740. 833.88 s [vector] +++ OK, passed 100 tests.
  5741. 833.88 s [vector] singleton: OK
  5742. 833.88 s [vector] +++ OK, passed 100 tests.
  5743. 833.88 s [vector] replicate: OK
  5744. 833.88 s [vector] +++ OK, passed 100 tests.
  5745. 833.88 s [vector] generate: OK
  5746. 833.88 s [vector] +++ OK, passed 100 tests.
  5747. 833.88 s [vector] iterateN: OK
  5748. 833.90 s [vector] +++ OK, passed 100 tests.
  5749. 833.94 s [vector] iterateNM: OK (0.05s)
  5750. 833.94 s [vector] +++ OK, passed 100 tests.
  5751. 833.95 s [vector] generateM: OK (0.02s)
  5752. 833.95 s [vector] +++ OK, passed 100 tests.
  5753. 833.95 s [vector] replicateM: OK
  5754. 833.95 s [vector] +++ OK, passed 100 tests.
  5755. 833.95 s [vector] create: OK
  5756. 833.95 s [vector] +++ OK, passed 100 tests.
  5757. 833.95 s [vector] createT: OK
  5758. 833.95 s [vector] +++ OK, passed 100 tests.
  5759. 833.96 s [vector] unfoldr: OK
  5760. 833.96 s [vector] +++ OK, passed 100 tests.
  5761. 833.96 s [vector] unfoldrN: OK
  5762. 833.96 s [vector] +++ OK, passed 100 tests.
  5763. 833.96 s [vector] unfoldrExactN: OK
  5764. 833.96 s [vector] +++ OK, passed 100 tests.
  5765. 833.96 s [vector] unfoldrM: OK
  5766. 833.96 s [vector] +++ OK, passed 100 tests.
  5767. 833.98 s [vector] unfoldrNM: OK
  5768. 833.98 s [vector] +++ OK, passed 100 tests.
  5769. 834.01 s [vector] unfoldrExactNM: OK (0.05s)
  5770. 834.01 s [vector] +++ OK, passed 100 tests.
  5771. 834.01 s [vector] constructN: OK
  5772. 834.01 s [vector] +++ OK, passed 100 tests.
  5773. 834.01 s [vector] constructrN: OK
  5774. 834.01 s [vector] +++ OK, passed 100 tests.
  5775. 834.01 s [vector] cons: OK
  5776. 834.02 s [vector] +++ OK, passed 100 tests.
  5777. 834.02 s [vector] snoc: OK
  5778. 834.02 s [vector] +++ OK, passed 100 tests.
  5779. 834.02 s [vector] append: OK
  5780. 834.02 s [vector] +++ OK, passed 100 tests.
  5781. 834.02 s [vector] concat: OK
  5782. 834.02 s [vector] +++ OK, passed 100 tests.
  5783. 834.03 s [vector] force: OK
  5784. 834.03 s [vector] +++ OK, passed 100 tests.
  5785. 834.03 s [vector] upd: OK
  5786. 834.03 s [vector] +++ OK, passed 100 tests.
  5787. 834.03 s [vector] accum: OK
  5788. 834.03 s [vector] +++ OK, passed 100 tests.
  5789. 834.03 s [vector] reverse: OK
  5790. 834.03 s [vector] +++ OK, passed 100 tests.
  5791. 834.03 s [vector] backpermute: OK
  5792. 834.03 s [vector] +++ OK, passed 100 tests.
  5793. 834.03 s [vector] map: OK
  5794. 834.04 s [vector] +++ OK, passed 100 tests.
  5795. 834.04 s [vector] imap: OK
  5796. 834.04 s [vector] +++ OK, passed 100 tests.
  5797. 834.04 s [vector] concatMap: OK
  5798. 834.04 s [vector] +++ OK, passed 100 tests.
  5799. 834.04 s [vector] mapM: OK
  5800. 834.04 s [vector] +++ OK, passed 100 tests.
  5801. 834.05 s [vector] mapM_: OK (0.01s)
  5802. 834.05 s [vector] +++ OK, passed 100 tests.
  5803. 834.05 s [vector] forM: OK
  5804. 834.06 s [vector] +++ OK, passed 100 tests.
  5805. 834.06 s [vector] forM_: OK (0.01s)
  5806. 834.06 s [vector] +++ OK, passed 100 tests.
  5807. 834.07 s [vector] imapM: OK
  5808. 834.08 s [vector] +++ OK, passed 100 tests.
  5809. 834.08 s [vector] imapM_: OK (0.01s)
  5810. 834.08 s [vector] +++ OK, passed 100 tests.
  5811. 834.08 s [vector] zipWith: OK
  5812. 834.08 s [pandoc] shrinking /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-3.7.0.2-KGPTJkDqL6PHRGo9hEntgT-xml-light-ghc9.10.3.so
  5813. 834.08 s [vector] +++ OK, passed 100 tests.
  5814. 834.08 s [vector] zipWith3: OK
  5815. 834.08 s [vector] +++ OK, passed 100 tests.
  5816. 834.08 s [vector] izipWith: OK
  5817. 834.08 s [vector] +++ OK, passed 100 tests.
  5818. 834.08 s [vector] izipWith3: OK
  5819. 834.09 s [vector] +++ OK, passed 100 tests.
  5820. 834.10 s [vector] izipWithM: OK
  5821. 834.10 s [vector] +++ OK, passed 100 tests.
  5822. 834.10 s [vector] izipWithM_: OK
  5823. 834.10 s [vector] +++ OK, passed 100 tests.
  5824. 834.10 s [vector] zipWithM: OK
  5825. 834.10 s [pandoc] checking for references to /build/ in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2...
  5826. 834.10 s [vector] +++ OK, passed 100 tests.
  5827. 834.11 s [vector] zipWithM_: OK
  5828. 834.11 s [vector] +++ OK, passed 100 tests.
  5829. 834.12 s [vector] filter: OK
  5830. 834.12 s [vector] +++ OK, passed 100 tests.
  5831. 834.12 s [vector] ifilter: OK
  5832. 834.12 s [vector] +++ OK, passed 100 tests.
  5833. 834.13 s [vector] filterM: OK (0.02s)
  5834. 834.13 s [vector] +++ OK, passed 100 tests.
  5835. 834.13 s [vector] uniq: OK
  5836. 834.14 s [vector] +++ OK, passed 100 tests.
  5837. 834.14 s [vector] mapMaybe: OK
  5838. 834.14 s [vector] +++ OK, passed 100 tests.
  5839. 834.14 s [vector] imapMaybe: OK
  5840. 834.14 s [vector] +++ OK, passed 100 tests.
  5841. 834.14 s [vector] takeWhile: OK
  5842. 834.14 s [vector] +++ OK, passed 100 tests.
  5843. 834.14 s [vector] dropWhile: OK
  5844. 834.14 s [vector] +++ OK, passed 100 tests.
  5845. 834.14 s [vector] partition: OK
  5846. 834.14 s [vector] +++ OK, passed 100 tests.
  5847. 834.15 s [vector] partitionWith: OK
  5848. 834.15 s [vector] +++ OK, passed 100 tests.
  5849. 834.15 s [vector] span: OK
  5850. 834.15 s [vector] +++ OK, passed 100 tests.
  5851. 834.15 s [vector] break: OK
  5852. 834.15 s [vector] +++ OK, passed 100 tests.
  5853. 834.15 s [vector] spanR: OK
  5854. 834.15 s [vector] +++ OK, passed 100 tests.
  5855. 834.15 s [vector] breakR: OK
  5856. 834.15 s [vector] +++ OK, passed 100 tests.
  5857. 834.15 s [vector] groupBy: OK
  5858. 834.15 s [vector] +++ OK, passed 100 tests.
  5859. 834.15 s [vector] elem: OK
  5860. 834.15 s [vector] +++ OK, passed 100 tests.
  5861. 834.15 s [vector] notElem: OK
  5862. 834.15 s [vector] +++ OK, passed 100 tests.
  5863. 834.15 s [vector] find: OK
  5864. 834.15 s [vector] +++ OK, passed 100 tests.
  5865. 834.16 s [vector] findIndex: OK
  5866. 834.16 s [vector] +++ OK, passed 100 tests.
  5867. 834.16 s [vector] findIndexR: OK
  5868. 834.16 s [vector] +++ OK, passed 100 tests.
  5869. 834.16 s [vector] findIndices: OK
  5870. 834.16 s [vector] +++ OK, passed 100 tests.
  5871. 834.16 s [vector] elemIndex: OK
  5872. 834.16 s [vector] +++ OK, passed 100 tests.
  5873. 834.17 s [vector] elemIndices: OK
  5874. 834.17 s [vector] +++ OK, passed 100 tests.
  5875. 834.17 s [vector] foldl: OK
  5876. 834.17 s [vector] +++ OK, passed 100 tests.
  5877. 834.17 s [vector] foldl1: OK
  5878. 834.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5879. 834.17 s [vector] foldl': OK
  5880. 834.17 s [vector] +++ OK, passed 100 tests.
  5881. 834.17 s [vector] foldl1': OK
  5882. 834.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5883. 834.17 s [vector] foldr: OK
  5884. 834.17 s [vector] +++ OK, passed 100 tests.
  5885. 834.17 s [vector] foldr1: OK
  5886. 834.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5887. 834.17 s [vector] foldr': OK
  5888. 834.17 s [vector] +++ OK, passed 100 tests.
  5889. 834.17 s [vector] foldr1': OK
  5890. 834.17 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5891. 834.18 s [vector] ifoldl: OK
  5892. 834.18 s [vector] +++ OK, passed 100 tests.
  5893. 834.18 s [vector] ifoldl': OK
  5894. 834.18 s [vector] +++ OK, passed 100 tests.
  5895. 834.20 s [vector] ifoldr: OK
  5896. 834.20 s [vector] +++ OK, passed 100 tests.
  5897. 834.20 s [vector] ifoldr': OK
  5898. 834.20 s [vector] +++ OK, passed 100 tests.
  5899. 834.20 s [vector] ifoldM: OK
  5900. 834.20 s [vector] +++ OK, passed 100 tests.
  5901. 834.21 s [vector] ifoldM': OK
  5902. 834.21 s [vector] +++ OK, passed 100 tests.
  5903. 834.21 s [vector] ifoldM_: OK (0.01s)
  5904. 834.21 s [vector] +++ OK, passed 100 tests.
  5905. 834.21 s [vector] ifoldM'_: OK (0.01s)
  5906. 834.21 s [vector] +++ OK, passed 100 tests.
  5907. 834.21 s [vector] all: OK
  5908. 834.21 s [vector] +++ OK, passed 100 tests.
  5909. 834.21 s [vector] any: OK
  5910. 834.21 s [vector] +++ OK, passed 100 tests.
  5911. 834.21 s [vector] prescanl: OK
  5912. 834.21 s [vector] +++ OK, passed 100 tests.
  5913. 834.22 s [vector] prescanl': OK
  5914. 834.22 s [vector] +++ OK, passed 100 tests.
  5915. 834.22 s [vector] postscanl: OK
  5916. 834.22 s [vector] +++ OK, passed 100 tests.
  5917. 834.23 s [vector] postscanl': OK
  5918. 834.23 s [vector] +++ OK, passed 100 tests.
  5919. 834.23 s [vector] scanl: OK
  5920. 834.23 s [vector] +++ OK, passed 100 tests.
  5921. 834.23 s [vector] scanl': OK
  5922. 834.23 s [vector] +++ OK, passed 100 tests.
  5923. 834.24 s [vector] scanl1: OK
  5924. 834.24 s [vector] +++ OK, passed 100 tests.
  5925. 834.25 s [vector] scanl1': OK
  5926. 834.25 s [vector] +++ OK, passed 100 tests.
  5927. 834.25 s [vector] iscanl: OK
  5928. 834.25 s [vector] +++ OK, passed 100 tests.
  5929. 834.25 s [vector] iscanl': OK
  5930. 834.25 s [vector] +++ OK, passed 100 tests.
  5931. 834.25 s [vector] prescanr: OK
  5932. 834.25 s [vector] +++ OK, passed 100 tests.
  5933. 834.25 s [vector] prescanr': OK
  5934. 834.25 s [vector] +++ OK, passed 100 tests.
  5935. 834.25 s [vector] postscanr: OK
  5936. 834.25 s [vector] +++ OK, passed 100 tests.
  5937. 834.25 s [vector] postscanr': OK
  5938. 834.25 s [vector] +++ OK, passed 100 tests.
  5939. 834.25 s [vector] scanr: OK
  5940. 834.25 s [vector] +++ OK, passed 100 tests.
  5941. 834.25 s [vector] scanr': OK
  5942. 834.25 s [vector] +++ OK, passed 100 tests.
  5943. 834.25 s [vector] scanr1: OK
  5944. 834.25 s [vector] +++ OK, passed 100 tests.
  5945. 834.25 s [vector] scanr1': OK
  5946. 834.25 s [vector] +++ OK, passed 100 tests.
  5947. 834.25 s [vector] iscanr: OK
  5948. 834.25 s [vector] +++ OK, passed 100 tests.
  5949. 834.25 s [vector] iscanr': OK
  5950. 834.25 s [vector] +++ OK, passed 100 tests.
  5951. 834.25 s [vector] mut_read: OK
  5952. 834.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5953. 834.25 s [vector] mut_write: OK
  5954. 834.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5955. 834.25 s [vector] mut_modify: OK
  5956. 834.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5957. 834.26 s [vector] mut_generate: OK
  5958. 834.26 s [vector] +++ OK, passed 100 tests.
  5959. 834.28 s [vector] mut_generateM: OK
  5960. 834.28 s [vector] +++ OK, passed 100 tests.
  5961. 834.28 s [vector] mut_mapM_: OK (0.01s)
  5962. 834.28 s [vector] +++ OK, passed 100 tests.
  5963. 834.29 s [pandoc] patching script interpreter paths in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2
  5964. 834.29 s [vector] mut_imapM_: OK (0.02s)
  5965. 834.29 s [vector] +++ OK, passed 100 tests.
  5966. 834.30 s [pandoc] stripping (with command strip and flags -S -p) in /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2/lib
  5967. 834.30 s [vector] mut_forM_: OK
  5968. 834.30 s [vector] +++ OK, passed 100 tests.
  5969. 834.32 s [vector] mut_iforM_: OK (0.01s)
  5970. 834.32 s [vector] +++ OK, passed 100 tests.
  5971. 834.32 s [vector] mut_foldr: OK
  5972. 834.32 s [vector] +++ OK, passed 100 tests.
  5973. 834.33 s [vector] mut_foldr': OK
  5974. 834.33 s [vector] +++ OK, passed 100 tests.
  5975. 834.33 s [vector] mut_foldl: OK
  5976. 834.33 s [vector] +++ OK, passed 100 tests.
  5977. 834.34 s [vector] mut_foldl': OK
  5978. 834.34 s [vector] +++ OK, passed 100 tests.
  5979. 834.34 s [vector] mut_ifoldr: OK
  5980. 834.34 s [vector] +++ OK, passed 100 tests.
  5981. 834.34 s [vector] mut_ifoldr': OK
  5982. 834.34 s [vector] +++ OK, passed 100 tests.
  5983. 834.34 s [vector] mut_ifoldl: OK
  5984. 834.34 s [vector] +++ OK, passed 100 tests.
  5985. 834.35 s [vector] mut_ifoldl': OK
  5986. 834.35 s [vector] +++ OK, passed 100 tests.
  5987. 834.35 s [vector] mut_foldM: OK
  5988. 834.35 s [vector] +++ OK, passed 100 tests.
  5989. 834.35 s [vector] mut_foldM': OK
  5990. 834.36 s [vector] +++ OK, passed 100 tests.
  5991. 834.36 s [vector] mut_foldrM: OK
  5992. 834.36 s [vector] +++ OK, passed 100 tests.
  5993. 834.36 s [vector] mut_foldrM': OK
  5994. 834.36 s [vector] +++ OK, passed 100 tests.
  5995. 834.37 s [vector] mut_ifoldM: OK
  5996. 834.37 s [vector] +++ OK, passed 100 tests.
  5997. 834.38 s [vector] mut_ifoldM': OK
  5998. 834.38 s [vector] +++ OK, passed 100 tests.
  5999. 834.38 s [vector] mut_ifoldrM: OK
  6000. 834.38 s [vector] +++ OK, passed 100 tests.
  6001. 834.38 s [vector] mut_ifoldrM': OK
  6002. 834.38 s [vector] +++ OK, passed 100 tests.
  6003. 834.38 s [vector] compare: OK
  6004. 834.38 s [vector] +++ OK, passed 100 tests.
  6005. 834.38 s [vector] maximum: OK
  6006. 834.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6007. 834.38 s [vector] minimum: OK
  6008. 834.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6009. 834.38 s [vector] minIndex: OK
  6010. 834.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6011. 834.39 s [vector] maxIndex: OK
  6012. 834.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6013. 834.39 s [vector] maximumBy: OK
  6014. 834.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6015. 834.39 s [vector] minimumBy: OK
  6016. 834.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6017. 834.39 s [vector] maximumOn: OK
  6018. 834.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6019. 834.39 s [vector] minimumOn: OK
  6020. 834.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6021. 834.39 s [vector] maxIndexBy: OK
  6022. 834.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6023. 834.39 s [vector] minIndexBy: OK
  6024. 834.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6025. 834.39 s [vector] ListFirstMaxIndexWins: OK
  6026. 834.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6027. 834.39 s [vector] FalseListFirstMaxIndexWins: OK
  6028. 834.39 s [vector] +++ OK, failed as expected. (after 1 test):
  6029. 834.39 s [vector] Exception:
  6030. 834.39 s [vector] Prelude.foldr1: empty list
  6031. 834.39 s [vector] CallStack (from HasCallStack):
  6032. 834.39 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6033. 834.39 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6034. 834.39 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6035. 834.39 s [vector] []
  6036. 834.39 s [vector] zip: OK
  6037. 834.40 s [vector] +++ OK, passed 100 tests.
  6038. 834.40 s [vector] zip3: OK
  6039. 834.40 s [vector] +++ OK, passed 100 tests.
  6040. 834.40 s [vector] unzip: OK
  6041. 834.40 s [vector] +++ OK, passed 100 tests.
  6042. 834.40 s [vector] unzip3: OK
  6043. 834.40 s [vector] +++ OK, passed 100 tests.
  6044. 834.40 s [vector] indexed: OK
  6045. 834.40 s [vector] +++ OK, passed 100 tests.
  6046. 834.42 s [vector] update: OK
  6047. 834.42 s [vector] +++ OK, passed 100 tests.
  6048. 834.42 s [vector] concat: OK (0.01s)
  6049. 834.42 s [vector] +++ OK, passed 100 tests.
  6050. 834.42 s [vector] mempty: OK
  6051. 834.42 s [vector] +++ OK, passed 100 tests.
  6052. 834.43 s [vector] mappend: OK
  6053. 834.43 s [vector] +++ OK, passed 100 tests.
  6054. 834.44 s [vector] mconcat: OK (0.01s)
  6055. 834.44 s [vector] +++ OK, passed 100 tests.
  6056. 834.44 s [vector] fmap: OK
  6057. 834.44 s [vector] +++ OK, passed 100 tests.
  6058. 834.44 s [vector] return: OK
  6059. 834.44 s [vector] +++ OK, passed 100 tests.
  6060. 834.46 s [vector] bind: OK (0.02s)
  6061. 834.46 s [vector] +++ OK, passed 100 tests.
  6062. 834.46 s [vector] mzip: OK
  6063. 834.46 s [vector] +++ OK, passed 100 tests.
  6064. 834.46 s [vector] munzip: OK
  6065. 834.46 s [vector] +++ OK, passed 100 tests.
  6066. 834.46 s [vector] applicative_pure: OK
  6067. 834.46 s [vector] +++ OK, passed 100 tests.
  6068. 834.49 s [vector] applicative_appl: OK (0.03s)
  6069. 834.49 s [vector] +++ OK, passed 100 tests.
  6070. 834.49 s [vector] alternative_empty: OK
  6071. 834.49 s [vector] +++ OK, passed 100 tests.
  6072. 834.50 s [vector] alternative_or: OK
  6073. 834.50 s [vector] +++ OK, passed 100 tests.
  6074. 834.53 s [vector] sequence: OK (0.04s)
  6075. 834.53 s [vector] +++ OK, passed 100 tests.
  6076. 834.55 s [vector] sequence_: OK
  6077. 834.55 s [vector] +++ OK, passed 100 tests.
  6078. 834.55 s [vector] glength: OK
  6079. 834.55 s [vector] +++ OK, passed 100 tests.
  6080. 834.55 s [vector] and: OK
  6081. 834.55 s [vector] +++ OK, passed 100 tests.
  6082. 834.55 s [vector] or: OK
  6083. 834.55 s [vector] +++ OK, passed 100 tests.
  6084. 834.55 s [vector] Int
  6085. 834.55 s [vector] fromList.toList == id: OK
  6086. 834.55 s [vector] +++ OK, passed 100 tests.
  6087. 834.56 s [vector] toList.fromList == id: OK
  6088. 834.56 s [vector] +++ OK, passed 100 tests.
  6089. 834.56 s [vector] unstream.stream == id: OK
  6090. 834.56 s [vector] +++ OK, passed 100 tests.
  6091. 834.56 s [vector] stream.unstream == id: OK
  6092. 834.56 s [vector] +++ OK, passed 100 tests.
  6093. 834.56 s [vector] eq: OK
  6094. 834.56 s [vector] +++ OK, passed 100 tests.
  6095. 834.56 s [vector] length: OK
  6096. 834.57 s [vector] +++ OK, passed 100 tests.
  6097. 834.57 s [vector] null: OK
  6098. 834.57 s [vector] +++ OK, passed 100 tests.
  6099. 834.57 s [vector] index: OK
  6100. 834.57 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6101. 834.57 s [vector] safeIndex: OK
  6102. 834.57 s [vector] +++ OK, passed 100 tests.
  6103. 834.57 s [vector] head: OK
  6104. 834.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6105. 834.57 s [vector] last: OK
  6106. 834.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6107. 834.57 s [vector] unsafeIndex: OK
  6108. 834.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6109. 834.57 s [vector] unsafeHead: OK
  6110. 834.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6111. 834.57 s [vector] unsafeLast: OK
  6112. 834.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6113. 834.58 s [vector] slice: OK
  6114. 834.58 s [vector] +++ OK, passed 100 tests.
  6115. 834.58 s [vector] init: OK
  6116. 834.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6117. 834.58 s [vector] tail: OK
  6118. 834.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6119. 834.58 s [vector] take: OK
  6120. 834.58 s [vector] +++ OK, passed 100 tests.
  6121. 834.58 s [vector] drop: OK
  6122. 834.58 s [vector] +++ OK, passed 100 tests.
  6123. 834.58 s [vector] splitAt: OK
  6124. 834.58 s [vector] +++ OK, passed 100 tests.
  6125. 834.58 s [vector] empty: OK
  6126. 834.58 s [vector] +++ OK, passed 100 tests.
  6127. 834.58 s [vector] singleton: OK
  6128. 834.58 s [vector] +++ OK, passed 100 tests.
  6129. 834.58 s [vector] replicate: OK
  6130. 834.59 s [vector] +++ OK, passed 100 tests.
  6131. 834.92 s [vector] generate: OK
  6132. 834.92 s [vector] +++ OK, passed 100 tests.
  6133. 834.92 s [vector] iterateN: OK
  6134. 834.92 s [vector] +++ OK, passed 100 tests.
  6135. 834.92 s [vector] iterateNM: OK (0.03s)
  6136. 834.92 s [vector] +++ OK, passed 100 tests.
  6137. 834.92 s [vector] generateM: OK (0.04s)
  6138. 834.92 s [vector] +++ OK, passed 100 tests.
  6139. 834.92 s [vector] replicateM: OK (0.01s)
  6140. 834.92 s [vector] +++ OK, passed 100 tests.
  6141. 834.92 s [vector] create: OK
  6142. 834.92 s [vector] +++ OK, passed 100 tests.
  6143. 834.92 s [vector] createT: OK
  6144. 834.92 s [vector] +++ OK, passed 100 tests.
  6145. 834.92 s [vector] unfoldr: OK
  6146. 834.92 s [vector] +++ OK, passed 100 tests.
  6147. 834.92 s [vector] unfoldrN: OK
  6148. 834.92 s [vector] +++ OK, passed 100 tests.
  6149. 834.92 s [vector] unfoldrExactN: OK
  6150. 834.92 s [vector] +++ OK, passed 100 tests.
  6151. 834.92 s [vector] unfoldrM: OK
  6152. 834.92 s [vector] +++ OK, passed 100 tests.
  6153. 834.92 s [vector] unfoldrNM: OK
  6154. 834.92 s [vector] +++ OK, passed 100 tests.
  6155. 834.92 s [vector] unfoldrExactNM: OK (0.03s)
  6156. 834.92 s [vector] +++ OK, passed 100 tests.
  6157. 834.92 s [vector] constructN: OK (0.01s)
  6158. 834.92 s [vector] +++ OK, passed 100 tests.
  6159. 834.92 s [vector] constructrN: OK
  6160. 834.92 s [vector] +++ OK, passed 100 tests.
  6161. 834.92 s [vector] cons: OK
  6162. 834.92 s [vector] +++ OK, passed 100 tests.
  6163. 834.92 s [vector] snoc: OK
  6164. 834.92 s [vector] +++ OK, passed 100 tests.
  6165. 834.92 s [vector] append: OK
  6166. 834.92 s [vector] +++ OK, passed 100 tests.
  6167. 834.92 s [vector] concat: OK (0.01s)
  6168. 834.92 s [vector] +++ OK, passed 100 tests.
  6169. 834.92 s [vector] force: OK
  6170. 834.92 s [vector] +++ OK, passed 100 tests.
  6171. 834.92 s [vector] upd: OK
  6172. 834.92 s [vector] +++ OK, passed 100 tests.
  6173. 834.92 s [vector] accum: OK
  6174. 834.92 s [vector] +++ OK, passed 100 tests.
  6175. 834.92 s [vector] reverse: OK
  6176. 834.92 s [vector] +++ OK, passed 100 tests.
  6177. 834.92 s [vector] backpermute: OK
  6178. 834.92 s [vector] +++ OK, passed 100 tests.
  6179. 834.92 s [vector] map: OK
  6180. 834.92 s [vector] +++ OK, passed 100 tests.
  6181. 834.92 s [vector] imap: OK
  6182. 834.92 s [vector] +++ OK, passed 100 tests.
  6183. 834.92 s [vector] concatMap: OK
  6184. 834.92 s [vector] +++ OK, passed 100 tests.
  6185. 834.92 s [vector] mapM: OK
  6186. 834.92 s [vector] +++ OK, passed 100 tests.
  6187. 834.92 s [vector] mapM_: OK (0.02s)
  6188. 834.92 s [vector] +++ OK, passed 100 tests.
  6189. 834.92 s [vector] forM: OK
  6190. 834.92 s [vector] +++ OK, passed 100 tests.
  6191. 834.92 s [vector] forM_: OK (0.02s)
  6192. 834.92 s [vector] +++ OK, passed 100 tests.
  6193. 834.92 s [vector] imapM: OK
  6194. 834.92 s [vector] +++ OK, passed 100 tests.
  6195. 834.92 s [vector] imapM_: OK (0.02s)
  6196. 834.92 s [vector] +++ OK, passed 100 tests.
  6197. 834.92 s [vector] zipWith: OK
  6198. 834.92 s [vector] +++ OK, passed 100 tests.
  6199. 834.92 s [vector] zipWith3: OK
  6200. 834.92 s [vector] +++ OK, passed 100 tests.
  6201. 834.92 s [vector] izipWith: OK
  6202. 834.92 s [vector] +++ OK, passed 100 tests.
  6203. 834.92 s [vector] izipWith3: OK
  6204. 834.92 s [vector] +++ OK, passed 100 tests.
  6205. 834.92 s [vector] izipWithM: OK
  6206. 834.92 s [vector] +++ OK, passed 100 tests.
  6207. 834.92 s [vector] izipWithM_: OK (0.01s)
  6208. 834.92 s [vector] +++ OK, passed 100 tests.
  6209. 834.92 s [vector] zipWithM: OK
  6210. 834.92 s [vector] +++ OK, passed 100 tests.
  6211. 834.92 s [vector] zipWithM_: OK (0.01s)
  6212. 834.92 s [vector] +++ OK, passed 100 tests.
  6213. 834.92 s [vector] filter: OK
  6214. 834.92 s [vector] +++ OK, passed 100 tests.
  6215. 834.92 s [vector] ifilter: OK
  6216. 834.92 s [vector] +++ OK, passed 100 tests.
  6217. 834.92 s [vector] filterM: OK (0.02s)
  6218. 834.92 s [vector] +++ OK, passed 100 tests.
  6219. 834.92 s [vector] uniq: OK
  6220. 834.92 s [vector] +++ OK, passed 100 tests.
  6221. 834.92 s [vector] mapMaybe: OK
  6222. 834.92 s [vector] +++ OK, passed 100 tests.
  6223. 834.92 s [vector] imapMaybe: OK
  6224. 834.92 s [vector] +++ OK, passed 100 tests.
  6225. 834.92 s [vector] takeWhile: OK
  6226. 834.92 s [vector] +++ OK, passed 100 tests.
  6227. 834.92 s [vector] dropWhile: OK
  6228. 834.92 s [vector] +++ OK, passed 100 tests.
  6229. 834.92 s [vector] partition: OK
  6230. 834.92 s [vector] +++ OK, passed 100 tests.
  6231. 834.92 s [vector] partitionWith: OK
  6232. 834.92 s [vector] +++ OK, passed 100 tests.
  6233. 834.92 s [vector] span: OK
  6234. 834.92 s [vector] +++ OK, passed 100 tests.
  6235. 834.92 s [vector] break: OK
  6236. 834.92 s [vector] +++ OK, passed 100 tests.
  6237. 834.92 s [vector] spanR: OK
  6238. 834.92 s [vector] +++ OK, passed 100 tests.
  6239. 834.92 s [vector] breakR: OK
  6240. 834.92 s [vector] +++ OK, passed 100 tests.
  6241. 834.92 s [vector] groupBy: OK
  6242. 834.92 s [vector] +++ OK, passed 100 tests.
  6243. 834.92 s [vector] elem: OK
  6244. 834.92 s [vector] +++ OK, passed 100 tests.
  6245. 834.92 s [vector] notElem: OK
  6246. 834.92 s [vector] +++ OK, passed 100 tests.
  6247. 834.92 s [vector] find: OK
  6248. 834.92 s [vector] +++ OK, passed 100 tests.
  6249. 834.92 s [vector] findIndex: OK
  6250. 834.92 s [vector] +++ OK, passed 100 tests.
  6251. 834.92 s [vector] findIndexR: OK
  6252. 834.92 s [vector] +++ OK, passed 100 tests.
  6253. 834.92 s [vector] findIndices: OK
  6254. 834.92 s [vector] +++ OK, passed 100 tests.
  6255. 834.92 s [vector] elemIndex: OK
  6256. 834.92 s [vector] +++ OK, passed 100 tests.
  6257. 834.92 s [vector] elemIndices: OK
  6258. 834.92 s [vector] +++ OK, passed 100 tests.
  6259. 834.92 s [vector] foldl: OK
  6260. 834.92 s [vector] +++ OK, passed 100 tests.
  6261. 834.92 s [vector] foldl1: OK
  6262. 834.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6263. 834.93 s [vector] foldl': OK
  6264. 834.93 s [vector] +++ OK, passed 100 tests.
  6265. 834.93 s [vector] foldl1': OK
  6266. 834.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6267. 834.93 s [vector] foldr: OK
  6268. 834.93 s [vector] +++ OK, passed 100 tests.
  6269. 834.94 s [vector] foldr1: OK
  6270. 834.94 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6271. 834.94 s [vector] foldr': OK
  6272. 834.94 s [vector] +++ OK, passed 100 tests.
  6273. 834.94 s [vector] foldr1': OK
  6274. 834.94 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6275. 834.94 s [vector] ifoldl: OK
  6276. 834.94 s [vector] +++ OK, passed 100 tests.
  6277. 834.94 s [vector] ifoldl': OK
  6278. 834.94 s [vector] +++ OK, passed 100 tests.
  6279. 834.96 s [vector] ifoldr: OK
  6280. 834.96 s [vector] +++ OK, passed 100 tests.
  6281. 834.96 s [vector] ifoldr': OK
  6282. 834.96 s [vector] +++ OK, passed 100 tests.
  6283. 834.96 s [vector] ifoldM: OK
  6284. 834.96 s [vector] +++ OK, passed 100 tests.
  6285. 834.96 s [vector] ifoldM': OK
  6286. 834.98 s [vector] +++ OK, passed 100 tests.
  6287. 834.98 s [vector] ifoldM_: OK (0.02s)
  6288. 834.98 s [vector] +++ OK, passed 100 tests.
  6289. 835.00 s [vector] ifoldM'_: OK
  6290. 835.00 s [vector] +++ OK, passed 100 tests.
  6291. 835.00 s [vector] all: OK
  6292. 835.00 s [vector] +++ OK, passed 100 tests.
  6293. 835.00 s [vector] any: OK
  6294. 835.01 s [vector] +++ OK, passed 100 tests.
  6295. 835.01 s [vector] prescanl: OK
  6296. 835.01 s [vector] +++ OK, passed 100 tests.
  6297. 835.02 s [vector] prescanl': OK
  6298. 835.02 s [vector] +++ OK, passed 100 tests.
  6299. 835.02 s [vector] postscanl: OK
  6300. 835.02 s [vector] +++ OK, passed 100 tests.
  6301. 835.02 s [vector] postscanl': OK
  6302. 835.02 s [vector] +++ OK, passed 100 tests.
  6303. 835.02 s [vector] scanl: OK
  6304. 835.02 s [vector] +++ OK, passed 100 tests.
  6305. 835.02 s [vector] scanl': OK
  6306. 835.02 s [vector] +++ OK, passed 100 tests.
  6307. 835.03 s [vector] scanl1: OK
  6308. 835.03 s [vector] +++ OK, passed 100 tests.
  6309. 835.04 s [vector] scanl1': OK
  6310. 835.04 s [vector] +++ OK, passed 100 tests.
  6311. 835.04 s [vector] iscanl: OK
  6312. 835.04 s [vector] +++ OK, passed 100 tests.
  6313. 835.04 s [vector] iscanl': OK
  6314. 835.05 s [vector] +++ OK, passed 100 tests.
  6315. 835.06 s [vector] prescanr: OK
  6316. 835.06 s [vector] +++ OK, passed 100 tests.
  6317. 835.06 s [vector] prescanr': OK
  6318. 835.06 s [vector] +++ OK, passed 100 tests.
  6319. 835.06 s [vector] postscanr: OK
  6320. 835.06 s [vector] +++ OK, passed 100 tests.
  6321. 835.06 s [vector] postscanr': OK
  6322. 835.06 s [vector] +++ OK, passed 100 tests.
  6323. 835.06 s [vector] scanr: OK
  6324. 835.06 s [vector] +++ OK, passed 100 tests.
  6325. 835.07 s [vector] scanr': OK
  6326. 835.07 s [vector] +++ OK, passed 100 tests.
  6327. 835.07 s [vector] scanr1: OK
  6328. 835.07 s [vector] +++ OK, passed 100 tests.
  6329. 835.07 s [vector] scanr1': OK
  6330. 835.07 s [vector] +++ OK, passed 100 tests.
  6331. 835.07 s [vector] iscanr: OK (0.01s)
  6332. 835.07 s [vector] +++ OK, passed 100 tests.
  6333. 835.07 s [vector] iscanr': OK
  6334. 835.07 s [vector] +++ OK, passed 100 tests.
  6335. 835.07 s [vector] mut_read: OK
  6336. 835.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6337. 835.07 s [vector] mut_write: OK
  6338. 835.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6339. 835.08 s [vector] mut_modify: OK
  6340. 835.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6341. 835.08 s [vector] mut_generate: OK
  6342. 835.08 s [vector] +++ OK, passed 100 tests.
  6343. 835.10 s [vector] mut_generateM: OK
  6344. 835.10 s [vector] +++ OK, passed 100 tests.
  6345. 835.12 s [vector] mut_mapM_: OK (0.02s)
  6346. 835.12 s [vector] +++ OK, passed 100 tests.
  6347. 835.14 s [vector] mut_imapM_: OK (0.02s)
  6348. 835.14 s [vector] +++ OK, passed 100 tests.
  6349. 835.14 s [vector] mut_forM_: OK (0.02s)
  6350. 835.14 s [vector] +++ OK, passed 100 tests.
  6351. 835.16 s [vector] mut_iforM_: OK (0.02s)
  6352. 835.16 s [vector] +++ OK, passed 100 tests.
  6353. 835.16 s [vector] mut_foldr: OK
  6354. 835.16 s [vector] +++ OK, passed 100 tests.
  6355. 835.16 s [vector] mut_foldr': OK
  6356. 835.16 s [vector] +++ OK, passed 100 tests.
  6357. 835.16 s [vector] mut_foldl: OK
  6358. 835.16 s [vector] +++ OK, passed 100 tests.
  6359. 835.16 s [vector] mut_foldl': OK
  6360. 835.17 s [vector] +++ OK, passed 100 tests.
  6361. 835.17 s [vector] mut_ifoldr: OK
  6362. 835.17 s [vector] +++ OK, passed 100 tests.
  6363. 835.17 s [vector] mut_ifoldr': OK
  6364. 835.17 s [vector] +++ OK, passed 100 tests.
  6365. 835.18 s [vector] mut_ifoldl: OK
  6366. 835.18 s [vector] +++ OK, passed 100 tests.
  6367. 835.18 s [vector] mut_ifoldl': OK
  6368. 835.18 s [vector] +++ OK, passed 100 tests.
  6369. 835.18 s [vector] mut_foldM: OK
  6370. 835.18 s [vector] +++ OK, passed 100 tests.
  6371. 835.19 s [vector] mut_foldM': OK
  6372. 835.19 s [vector] +++ OK, passed 100 tests.
  6373. 835.19 s [vector] mut_foldrM: OK
  6374. 835.19 s [vector] +++ OK, passed 100 tests.
  6375. 835.19 s [vector] mut_foldrM': OK
  6376. 835.19 s [vector] +++ OK, passed 100 tests.
  6377. 835.19 s [vector] mut_ifoldM: OK
  6378. 835.20 s [vector] +++ OK, passed 100 tests.
  6379. 835.20 s [vector] mut_ifoldM': OK
  6380. 835.20 s [vector] +++ OK, passed 100 tests.
  6381. 835.20 s [vector] mut_ifoldrM: OK
  6382. 835.20 s [vector] +++ OK, passed 100 tests.
  6383. 835.20 s [vector] mut_ifoldrM': OK
  6384. 835.20 s [vector] +++ OK, passed 100 tests.
  6385. 835.20 s [vector] compare: OK
  6386. 835.20 s [vector] +++ OK, passed 100 tests.
  6387. 835.20 s [vector] maximum: OK
  6388. 835.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6389. 835.21 s [vector] minimum: OK
  6390. 835.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6391. 835.21 s [vector] minIndex: OK
  6392. 835.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6393. 835.21 s [vector] maxIndex: OK
  6394. 835.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6395. 835.21 s [vector] maximumBy: OK
  6396. 835.21 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6397. 835.21 s [vector] minimumBy: OK
  6398. 835.21 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6399. 835.21 s [vector] maximumOn: OK
  6400. 835.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6401. 835.21 s [vector] minimumOn: OK
  6402. 835.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6403. 835.21 s [vector] maxIndexBy: OK
  6404. 835.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6405. 835.21 s [vector] minIndexBy: OK
  6406. 835.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6407. 835.21 s [vector] ListFirstMaxIndexWins: OK
  6408. 835.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6409. 835.21 s [vector] FalseListFirstMaxIndexWins: OK
  6410. 835.21 s [vector] +++ OK, failed as expected. (after 1 test):
  6411. 835.21 s [vector] Exception:
  6412. 835.21 s [vector] Prelude.foldr1: empty list
  6413. 835.21 s [vector] CallStack (from HasCallStack):
  6414. 835.21 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6415. 835.21 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6416. 835.21 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6417. 835.21 s [vector] []
  6418. 835.21 s [vector] zip: OK
  6419. 835.21 s [vector] +++ OK, passed 100 tests.
  6420. 835.21 s [vector] zip3: OK
  6421. 835.21 s [vector] +++ OK, passed 100 tests.
  6422. 835.21 s [vector] unzip: OK
  6423. 835.22 s [vector] +++ OK, passed 100 tests.
  6424. 835.22 s [vector] unzip3: OK
  6425. 835.22 s [vector] +++ OK, passed 100 tests.
  6426. 835.22 s [vector] indexed: OK
  6427. 835.22 s [vector] +++ OK, passed 100 tests.
  6428. 835.22 s [vector] update: OK
  6429. 835.22 s [vector] +++ OK, passed 100 tests.
  6430. 835.23 s [vector] concat: OK (0.01s)
  6431. 835.23 s [vector] +++ OK, passed 100 tests.
  6432. 835.23 s [vector] mempty: OK
  6433. 835.23 s [vector] +++ OK, passed 100 tests.
  6434. 835.24 s [vector] mappend: OK
  6435. 835.24 s [vector] +++ OK, passed 100 tests.
  6436. 835.24 s [vector] mconcat: OK
  6437. 835.24 s [vector] +++ OK, passed 100 tests.
  6438. 835.24 s [vector] fmap: OK
  6439. 835.24 s [vector] +++ OK, passed 100 tests.
  6440. 835.24 s [vector] return: OK
  6441. 835.24 s [vector] +++ OK, passed 100 tests.
  6442. 835.26 s [vector] bind: OK (0.02s)
  6443. 835.26 s [vector] +++ OK, passed 100 tests.
  6444. 835.26 s [vector] mzip: OK
  6445. 835.26 s [vector] +++ OK, passed 100 tests.
  6446. 835.26 s [vector] munzip: OK
  6447. 835.26 s [vector] +++ OK, passed 100 tests.
  6448. 835.28 s [vector] applicative_pure: OK
  6449. 835.28 s [vector] +++ OK, passed 100 tests.
  6450. 835.30 s [vector] applicative_appl: OK (0.03s)
  6451. 835.30 s [vector] +++ OK, passed 100 tests.
  6452. 835.30 s [vector] alternative_empty: OK
  6453. 835.30 s [vector] +++ OK, passed 100 tests.
  6454. 835.30 s [vector] alternative_or: OK
  6455. 835.30 s [vector] +++ OK, passed 100 tests.
  6456. 835.34 s [vector] sequence: OK (0.03s)
  6457. 835.34 s [vector] +++ OK, passed 100 tests.
  6458. 835.34 s [vector] sequence_: OK (0.01s)
  6459. 835.34 s [vector] +++ OK, passed 100 tests.
  6460. 835.34 s [vector] glength: OK
  6461. 835.34 s [vector] +++ OK, passed 100 tests.
  6462. 835.34 s [vector] sum: OK
  6463. 835.34 s [vector] +++ OK, passed 100 tests.
  6464. 835.34 s [vector] product: OK
  6465. 835.34 s [vector] +++ OK, passed 100 tests.
  6466. 835.35 s [vector] enumFromN: OK
  6467. 835.35 s [vector] +++ OK, passed 100 tests.
  6468. 835.35 s [vector] enumFromThenN: OK
  6469. 835.35 s [vector] +++ OK, passed 100 tests.
  6470. 835.35 s [vector] enumFromTo: OK
  6471. 835.35 s [vector] +++ OK, passed 100 tests.
  6472. 835.35 s [vector] enumFromThenTo: OK
  6473. 835.35 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6474. 835.35 s [vector] unstream
  6475. 835.35 s [vector] unstream == vunstream (exact): OK
  6476. 835.35 s [vector] +++ OK, passed 100 tests.
  6477. 835.35 s [vector] unstream == vunstream (unknown): OK
  6478. 835.35 s [vector] +++ OK, passed 100 tests.
  6479. 835.35 s [vector] unstreamR ~= vunstream (exact): OK
  6480. 835.35 s [vector] +++ OK, passed 100 tests.
  6481. 835.35 s [vector] unstreamR ~= vunstream (unknown): OK
  6482. 835.35 s [vector] +++ OK, passed 100 tests.
  6483. 835.35 s [vector] Tests.Vector.Unboxed
  6484. 835.35 s [vector] ()
  6485. 835.35 s [vector] fromList.toList == id: OK
  6486. 835.35 s [vector] +++ OK, passed 100 tests.
  6487. 835.35 s [vector] toList.fromList == id: OK
  6488. 835.35 s [vector] +++ OK, passed 100 tests.
  6489. 835.35 s [vector] unstream.stream == id: OK
  6490. 835.35 s [vector] +++ OK, passed 100 tests.
  6491. 835.35 s [vector] stream.unstream == id: OK
  6492. 835.35 s [vector] +++ OK, passed 100 tests.
  6493. 835.35 s [vector] eq: OK
  6494. 835.35 s [vector] +++ OK, passed 100 tests.
  6495. 835.36 s [vector] length: OK
  6496. 835.36 s [vector] +++ OK, passed 100 tests.
  6497. 835.36 s [vector] null: OK
  6498. 835.36 s [vector] +++ OK, passed 100 tests.
  6499. 835.36 s [vector] index: OK
  6500. 835.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6501. 835.36 s [vector] safeIndex: OK
  6502. 835.36 s [vector] +++ OK, passed 100 tests.
  6503. 835.36 s [vector] head: OK
  6504. 835.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6505. 835.36 s [vector] last: OK
  6506. 835.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6507. 835.36 s [vector] unsafeIndex: OK
  6508. 835.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6509. 835.36 s [vector] unsafeHead: OK
  6510. 835.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6511. 835.36 s [vector] unsafeLast: OK
  6512. 835.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6513. 835.36 s [vector] slice: OK
  6514. 835.36 s [vector] +++ OK, passed 100 tests.
  6515. 835.36 s [vector] init: OK
  6516. 835.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6517. 835.36 s [vector] tail: OK
  6518. 835.36 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6519. 835.36 s [vector] take: OK
  6520. 835.36 s [vector] +++ OK, passed 100 tests.
  6521. 835.36 s [vector] drop: OK
  6522. 835.36 s [vector] +++ OK, passed 100 tests.
  6523. 835.36 s [vector] splitAt: OK
  6524. 835.36 s [vector] +++ OK, passed 100 tests.
  6525. 835.36 s [vector] empty: OK
  6526. 835.36 s [vector] +++ OK, passed 100 tests.
  6527. 835.36 s [vector] singleton: OK
  6528. 835.36 s [vector] +++ OK, passed 100 tests.
  6529. 835.36 s [vector] replicate: OK
  6530. 835.36 s [vector] +++ OK, passed 100 tests.
  6531. 835.38 s [vector] generate: OK
  6532. 835.38 s [vector] +++ OK, passed 100 tests.
  6533. 835.39 s [vector] iterateN: OK
  6534. 835.39 s [vector] +++ OK, passed 100 tests.
  6535. 835.44 s [vector] iterateNM: OK (0.07s)
  6536. 835.44 s [vector] +++ OK, passed 100 tests.
  6537. 835.45 s [vector] generateM: OK (0.01s)
  6538. 835.45 s [vector] +++ OK, passed 100 tests.
  6539. 835.46 s [vector] replicateM: OK (0.01s)
  6540. 835.46 s [vector] +++ OK, passed 100 tests.
  6541. 835.46 s [vector] create: OK
  6542. 835.46 s [vector] +++ OK, passed 100 tests.
  6543. 835.46 s [vector] createT: OK
  6544. 835.46 s [vector] +++ OK, passed 100 tests.
  6545. 835.46 s [vector] unfoldr: OK
  6546. 835.46 s [vector] +++ OK, passed 100 tests.
  6547. 835.48 s [vector] unfoldrN: OK
  6548. 835.48 s [vector] +++ OK, passed 100 tests.
  6549. 835.48 s [vector] unfoldrExactN: OK
  6550. 835.48 s [vector] +++ OK, passed 100 tests.
  6551. 835.48 s [vector] unfoldrM: OK
  6552. 835.48 s [vector] +++ OK, passed 100 tests.
  6553. 835.48 s [vector] unfoldrNM: OK
  6554. 835.48 s [vector] +++ OK, passed 100 tests.
  6555. 835.51 s [vector] unfoldrExactNM: OK (0.04s)
  6556. 835.51 s [vector] +++ OK, passed 100 tests.
  6557. 835.51 s [vector] constructN: OK
  6558. 835.51 s [vector] +++ OK, passed 100 tests.
  6559. 835.51 s [vector] constructrN: OK
  6560. 835.51 s [vector] +++ OK, passed 100 tests.
  6561. 835.51 s [vector] cons: OK
  6562. 835.51 s [vector] +++ OK, passed 100 tests.
  6563. 835.51 s [vector] snoc: OK
  6564. 835.51 s [vector] +++ OK, passed 100 tests.
  6565. 835.52 s [vector] append: OK
  6566. 835.52 s [vector] +++ OK, passed 100 tests.
  6567. 835.52 s [vector] concat: OK
  6568. 835.52 s [vector] +++ OK, passed 100 tests.
  6569. 835.52 s [vector] force: OK
  6570. 835.53 s [vector] +++ OK, passed 100 tests.
  6571. 835.53 s [vector] upd: OK
  6572. 835.53 s [vector] +++ OK, passed 100 tests.
  6573. 835.53 s [vector] accum: OK
  6574. 835.53 s [vector] +++ OK, passed 100 tests.
  6575. 835.53 s [vector] reverse: OK
  6576. 835.53 s [vector] +++ OK, passed 100 tests.
  6577. 835.53 s [vector] backpermute: OK
  6578. 835.53 s [vector] +++ OK, passed 100 tests.
  6579. 835.53 s [vector] map: OK
  6580. 835.53 s [vector] +++ OK, passed 100 tests.
  6581. 835.53 s [vector] imap: OK
  6582. 835.53 s [vector] +++ OK, passed 100 tests.
  6583. 835.53 s [vector] concatMap: OK
  6584. 835.54 s [vector] +++ OK, passed 100 tests.
  6585. 835.54 s [vector] mapM: OK
  6586. 835.54 s [vector] +++ OK, passed 100 tests.
  6587. 835.54 s [vector] mapM_: OK (0.01s)
  6588. 835.55 s [vector] +++ OK, passed 100 tests.
  6589. 835.55 s [vector] forM: OK
  6590. 835.56 s [vector] +++ OK, passed 100 tests.
  6591. 835.56 s [vector] forM_: OK
  6592. 835.56 s [vector] +++ OK, passed 100 tests.
  6593. 835.56 s [vector] imapM: OK
  6594. 835.56 s [vector] +++ OK, passed 100 tests.
  6595. 835.57 s [vector] imapM_: OK (0.01s)
  6596. 835.57 s [vector] +++ OK, passed 100 tests.
  6597. 835.57 s [vector] zipWith: OK
  6598. 835.57 s [vector] +++ OK, passed 100 tests.
  6599. 835.58 s [vector] zipWith3: OK
  6600. 835.58 s [vector] +++ OK, passed 100 tests.
  6601. 835.58 s [vector] izipWith: OK
  6602. 835.58 s [vector] +++ OK, passed 100 tests.
  6603. 835.59 s [vector] izipWith3: OK
  6604. 835.59 s [vector] +++ OK, passed 100 tests.
  6605. 835.59 s [vector] izipWithM: OK
  6606. 835.59 s [vector] +++ OK, passed 100 tests.
  6607. 835.59 s [vector] izipWithM_: OK
  6608. 835.59 s [vector] +++ OK, passed 100 tests.
  6609. 835.59 s [vector] zipWithM: OK
  6610. 835.60 s [vector] +++ OK, passed 100 tests.
  6611. 835.60 s [vector] zipWithM_: OK
  6612. 835.60 s [vector] +++ OK, passed 100 tests.
  6613. 835.60 s [vector] filter: OK
  6614. 835.60 s [vector] +++ OK, passed 100 tests.
  6615. 835.62 s [vector] ifilter: OK
  6616. 835.62 s [vector] +++ OK, passed 100 tests.
  6617. 835.63 s [vector] filterM: OK (0.03s)
  6618. 835.63 s [vector] +++ OK, passed 100 tests.
  6619. 835.63 s [vector] uniq: OK
  6620. 835.63 s [vector] +++ OK, passed 100 tests.
  6621. 835.63 s [vector] mapMaybe: OK
  6622. 835.63 s [vector] +++ OK, passed 100 tests.
  6623. 835.63 s [vector] imapMaybe: OK
  6624. 835.63 s [vector] +++ OK, passed 100 tests.
  6625. 835.63 s [vector] takeWhile: OK
  6626. 835.63 s [vector] +++ OK, passed 100 tests.
  6627. 835.63 s [vector] dropWhile: OK
  6628. 835.63 s [vector] +++ OK, passed 100 tests.
  6629. 835.63 s [vector] partition: OK
  6630. 835.64 s [vector] +++ OK, passed 100 tests.
  6631. 835.64 s [vector] partitionWith: OK
  6632. 835.64 s [vector] +++ OK, passed 100 tests.
  6633. 835.64 s [vector] span: OK
  6634. 835.64 s [vector] +++ OK, passed 100 tests.
  6635. 835.64 s [vector] break: OK
  6636. 835.64 s [vector] +++ OK, passed 100 tests.
  6637. 835.64 s [vector] spanR: OK
  6638. 835.64 s [vector] +++ OK, passed 100 tests.
  6639. 835.64 s [vector] breakR: OK
  6640. 835.64 s [vector] +++ OK, passed 100 tests.
  6641. 835.64 s [vector] groupBy: OK
  6642. 835.64 s [vector] +++ OK, passed 100 tests.
  6643. 835.64 s [vector] elem: OK
  6644. 835.64 s [vector] +++ OK, passed 100 tests.
  6645. 835.64 s [vector] notElem: OK
  6646. 835.64 s [vector] +++ OK, passed 100 tests.
  6647. 835.64 s [vector] find: OK
  6648. 835.64 s [vector] +++ OK, passed 100 tests.
  6649. 835.64 s [vector] findIndex: OK
  6650. 835.64 s [vector] +++ OK, passed 100 tests.
  6651. 835.64 s [vector] findIndexR: OK
  6652. 835.64 s [vector] +++ OK, passed 100 tests.
  6653. 835.64 s [vector] findIndices: OK
  6654. 835.64 s [vector] +++ OK, passed 100 tests.
  6655. 835.64 s [vector] elemIndex: OK
  6656. 835.64 s [vector] +++ OK, passed 100 tests.
  6657. 835.64 s [vector] elemIndices: OK
  6658. 835.64 s [vector] +++ OK, passed 100 tests.
  6659. 835.64 s [vector] foldl: OK
  6660. 835.64 s [vector] +++ OK, passed 100 tests.
  6661. 835.64 s [vector] foldl1: OK
  6662. 835.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6663. 835.64 s [vector] foldl': OK
  6664. 835.64 s [vector] +++ OK, passed 100 tests.
  6665. 835.64 s [vector] foldl1': OK
  6666. 835.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6667. 835.65 s [vector] foldr: OK
  6668. 835.65 s [vector] +++ OK, passed 100 tests.
  6669. 835.65 s [vector] foldr1: OK
  6670. 835.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6671. 835.65 s [vector] foldr': OK
  6672. 835.65 s [vector] +++ OK, passed 100 tests.
  6673. 835.65 s [vector] foldr1': OK
  6674. 835.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6675. 835.65 s [vector] ifoldl: OK
  6676. 835.65 s [vector] +++ OK, passed 100 tests.
  6677. 835.66 s [vector] ifoldl': OK
  6678. 835.66 s [vector] +++ OK, passed 100 tests.
  6679. 835.66 s [vector] ifoldr: OK
  6680. 835.66 s [vector] +++ OK, passed 100 tests.
  6681. 835.66 s [vector] ifoldr': OK
  6682. 835.66 s [vector] +++ OK, passed 100 tests.
  6683. 835.66 s [vector] ifoldM: OK
  6684. 835.66 s [vector] +++ OK, passed 100 tests.
  6685. 835.66 s [vector] ifoldM': OK
  6686. 835.66 s [vector] +++ OK, passed 100 tests.
  6687. 835.67 s [vector] ifoldM_: OK (0.01s)
  6688. 835.67 s [vector] +++ OK, passed 100 tests.
  6689. 835.67 s [vector] ifoldM'_: OK (0.01s)
  6690. 835.67 s [vector] +++ OK, passed 100 tests.
  6691. 835.67 s [vector] all: OK
  6692. 835.67 s [vector] +++ OK, passed 100 tests.
  6693. 835.67 s [vector] any: OK
  6694. 835.67 s [vector] +++ OK, passed 100 tests.
  6695. 835.67 s [vector] prescanl: OK
  6696. 835.67 s [vector] +++ OK, passed 100 tests.
  6697. 835.68 s [vector] prescanl': OK
  6698. 835.68 s [vector] +++ OK, passed 100 tests.
  6699. 835.68 s [vector] postscanl: OK
  6700. 835.68 s [vector] +++ OK, passed 100 tests.
  6701. 835.68 s [vector] postscanl': OK
  6702. 835.68 s [vector] +++ OK, passed 100 tests.
  6703. 835.68 s [vector] scanl: OK
  6704. 835.68 s [vector] +++ OK, passed 100 tests.
  6705. 835.68 s [vector] scanl': OK
  6706. 835.68 s [vector] +++ OK, passed 100 tests.
  6707. 835.68 s [vector] scanl1: OK
  6708. 835.68 s [vector] +++ OK, passed 100 tests.
  6709. 835.68 s [vector] scanl1': OK
  6710. 835.69 s [vector] +++ OK, passed 100 tests.
  6711. 835.69 s [vector] iscanl: OK
  6712. 835.69 s [vector] +++ OK, passed 100 tests.
  6713. 835.69 s [vector] iscanl': OK
  6714. 835.69 s [vector] +++ OK, passed 100 tests.
  6715. 835.69 s [vector] prescanr: OK
  6716. 835.69 s [vector] +++ OK, passed 100 tests.
  6717. 835.69 s [vector] prescanr': OK
  6718. 835.69 s [vector] +++ OK, passed 100 tests.
  6719. 835.69 s [vector] postscanr: OK
  6720. 835.69 s [vector] +++ OK, passed 100 tests.
  6721. 835.69 s [vector] postscanr': OK
  6722. 835.69 s [vector] +++ OK, passed 100 tests.
  6723. 835.69 s [vector] scanr: OK
  6724. 835.69 s [vector] +++ OK, passed 100 tests.
  6725. 835.70 s [vector] scanr': OK
  6726. 835.70 s [vector] +++ OK, passed 100 tests.
  6727. 835.70 s [vector] scanr1: OK
  6728. 835.70 s [vector] +++ OK, passed 100 tests.
  6729. 835.70 s [vector] scanr1': OK
  6730. 835.70 s [vector] +++ OK, passed 100 tests.
  6731. 835.70 s [vector] iscanr: OK
  6732. 835.70 s [vector] +++ OK, passed 100 tests.
  6733. 835.70 s [vector] iscanr': OK
  6734. 835.70 s [vector] +++ OK, passed 100 tests.
  6735. 835.70 s [vector] mut_read: OK
  6736. 835.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6737. 835.70 s [vector] mut_write: OK
  6738. 835.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6739. 835.70 s [vector] mut_modify: OK
  6740. 835.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6741. 835.72 s [vector] mut_generate: OK
  6742. 835.72 s [vector] +++ OK, passed 100 tests.
  6743. 835.72 s [vector] mut_generateM: OK
  6744. 835.72 s [vector] +++ OK, passed 100 tests.
  6745. 835.74 s [vector] mut_mapM_: OK (0.02s)
  6746. 835.75 s [vector] +++ OK, passed 100 tests.
  6747. 835.76 s [vector] mut_imapM_: OK (0.02s)
  6748. 835.76 s [vector] +++ OK, passed 100 tests.
  6749. 835.76 s [vector] mut_forM_: OK (0.02s)
  6750. 835.76 s [vector] +++ OK, passed 100 tests.
  6751. 835.77 s [vector] mut_iforM_: OK (0.01s)
  6752. 835.77 s [vector] +++ OK, passed 100 tests.
  6753. 835.77 s [vector] mut_foldr: OK
  6754. 835.77 s [vector] +++ OK, passed 100 tests.
  6755. 835.77 s [vector] mut_foldr': OK
  6756. 835.77 s [vector] +++ OK, passed 100 tests.
  6757. 835.77 s [vector] mut_foldl: OK
  6758. 835.77 s [vector] +++ OK, passed 100 tests.
  6759. 835.78 s [vector] mut_foldl': OK
  6760. 835.78 s [vector] +++ OK, passed 100 tests.
  6761. 835.78 s [vector] mut_ifoldr: OK
  6762. 835.78 s [vector] +++ OK, passed 100 tests.
  6763. 835.78 s [vector] mut_ifoldr': OK
  6764. 835.78 s [vector] +++ OK, passed 100 tests.
  6765. 835.78 s [vector] mut_ifoldl: OK
  6766. 835.78 s [vector] +++ OK, passed 100 tests.
  6767. 835.78 s [vector] mut_ifoldl': OK
  6768. 835.78 s [vector] +++ OK, passed 100 tests.
  6769. 835.78 s [vector] mut_foldM: OK
  6770. 835.79 s [vector] +++ OK, passed 100 tests.
  6771. 835.79 s [vector] mut_foldM': OK
  6772. 835.79 s [vector] +++ OK, passed 100 tests.
  6773. 835.79 s [vector] mut_foldrM: OK
  6774. 835.79 s [vector] +++ OK, passed 100 tests.
  6775. 835.79 s [vector] mut_foldrM': OK
  6776. 835.79 s [vector] +++ OK, passed 100 tests.
  6777. 835.79 s [vector] mut_ifoldM: OK
  6778. 835.79 s [vector] +++ OK, passed 100 tests.
  6779. 835.79 s [vector] mut_ifoldM': OK
  6780. 835.79 s [vector] +++ OK, passed 100 tests.
  6781. 835.79 s [vector] mut_ifoldrM: OK
  6782. 835.79 s [vector] +++ OK, passed 100 tests.
  6783. 835.79 s [vector] mut_ifoldrM': OK
  6784. 835.79 s [vector] +++ OK, passed 100 tests.
  6785. 835.79 s [vector] compare: OK
  6786. 835.79 s [vector] +++ OK, passed 100 tests.
  6787. 835.79 s [vector] maximum: OK
  6788. 835.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6789. 835.80 s [vector] minimum: OK
  6790. 835.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6791. 835.80 s [vector] minIndex: OK
  6792. 835.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6793. 835.80 s [vector] maxIndex: OK
  6794. 835.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6795. 835.80 s [vector] maximumBy: OK
  6796. 835.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6797. 835.80 s [vector] minimumBy: OK
  6798. 835.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6799. 835.80 s [vector] maximumOn: OK
  6800. 835.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6801. 835.80 s [vector] minimumOn: OK
  6802. 835.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6803. 835.80 s [vector] maxIndexBy: OK
  6804. 835.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6805. 835.80 s [vector] minIndexBy: OK
  6806. 835.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6807. 835.80 s [vector] ListFirstMaxIndexWins: OK
  6808. 835.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6809. 835.80 s [vector] FalseListFirstMaxIndexWins: OK
  6810. 835.80 s [vector] +++ OK, failed as expected. (after 1 test):
  6811. 835.80 s [vector] Exception:
  6812. 835.80 s [vector] Prelude.foldr1: empty list
  6813. 835.80 s [vector] CallStack (from HasCallStack):
  6814. 835.80 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6815. 835.80 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6816. 835.80 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6817. 835.80 s [vector] []
  6818. 835.80 s [vector] zip: OK
  6819. 835.80 s [vector] +++ OK, passed 100 tests.
  6820. 835.80 s [vector] zip3: OK
  6821. 835.81 s [vector] +++ OK, passed 100 tests.
  6822. 835.81 s [vector] unzip: OK
  6823. 835.81 s [vector] +++ OK, passed 100 tests.
  6824. 835.81 s [vector] unzip3: OK
  6825. 835.81 s [vector] +++ OK, passed 100 tests.
  6826. 835.81 s [vector] indexed: OK
  6827. 835.81 s [vector] +++ OK, passed 100 tests.
  6828. 835.81 s [vector] update: OK
  6829. 835.81 s [vector] +++ OK, passed 100 tests.
  6830. 835.81 s [vector] mempty: OK
  6831. 835.81 s [vector] +++ OK, passed 100 tests.
  6832. 835.81 s [vector] mappend: OK
  6833. 835.81 s [vector] +++ OK, passed 100 tests.
  6834. 835.81 s [vector] mconcat: OK (0.01s)
  6835. 835.81 s [vector] +++ OK, passed 100 tests.
  6836. 835.81 s [vector] glength: OK
  6837. 835.81 s [vector] +++ OK, passed 100 tests.
  6838. 835.82 s [vector] (Bool)
  6839. 835.82 s [vector] fromList.toList == id: OK
  6840. 835.82 s [vector] +++ OK, passed 100 tests.
  6841. 835.82 s [vector] toList.fromList == id: OK
  6842. 835.82 s [vector] +++ OK, passed 100 tests.
  6843. 835.82 s [vector] unstream.stream == id: OK
  6844. 835.82 s [vector] +++ OK, passed 100 tests.
  6845. 835.82 s [vector] stream.unstream == id: OK
  6846. 835.82 s [vector] +++ OK, passed 100 tests.
  6847. 835.82 s [vector] eq: OK
  6848. 835.82 s [vector] +++ OK, passed 100 tests.
  6849. 835.82 s [vector] length: OK
  6850. 835.82 s [vector] +++ OK, passed 100 tests.
  6851. 835.82 s [vector] null: OK
  6852. 835.82 s [vector] +++ OK, passed 100 tests.
  6853. 835.82 s [vector] index: OK
  6854. 835.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6855. 835.82 s [vector] safeIndex: OK
  6856. 835.82 s [vector] +++ OK, passed 100 tests.
  6857. 835.82 s [vector] head: OK
  6858. 835.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6859. 835.82 s [vector] last: OK
  6860. 835.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6861. 835.82 s [vector] unsafeIndex: OK
  6862. 835.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6863. 835.82 s [vector] unsafeHead: OK
  6864. 835.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6865. 835.82 s [vector] unsafeLast: OK
  6866. 835.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6867. 835.82 s [vector] slice: OK
  6868. 835.82 s [vector] +++ OK, passed 100 tests.
  6869. 835.82 s [vector] init: OK
  6870. 835.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6871. 835.82 s [vector] tail: OK
  6872. 835.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6873. 835.82 s [vector] take: OK
  6874. 835.82 s [vector] +++ OK, passed 100 tests.
  6875. 835.82 s [vector] drop: OK
  6876. 835.83 s [vector] +++ OK, passed 100 tests.
  6877. 835.83 s [vector] splitAt: OK
  6878. 835.83 s [vector] +++ OK, passed 100 tests.
  6879. 835.83 s [vector] empty: OK
  6880. 835.83 s [vector] +++ OK, passed 100 tests.
  6881. 835.83 s [vector] singleton: OK
  6882. 835.83 s [vector] +++ OK, passed 100 tests.
  6883. 835.83 s [vector] replicate: OK
  6884. 835.83 s [vector] +++ OK, passed 100 tests.
  6885. 835.83 s [vector] generate: OK
  6886. 835.83 s [vector] +++ OK, passed 100 tests.
  6887. 835.83 s [vector] iterateN: OK
  6888. 835.84 s [vector] +++ OK, passed 100 tests.
  6889. 835.90 s [vector] iterateNM: OK (0.06s)
  6890. 835.90 s [vector] +++ OK, passed 100 tests.
  6891. 835.90 s [vector] generateM: OK (0.01s)
  6892. 835.90 s [vector] +++ OK, passed 100 tests.
  6893. 835.91 s [vector] replicateM: OK (0.02s)
  6894. 835.91 s [vector] +++ OK, passed 100 tests.
  6895. 835.91 s [vector] create: OK
  6896. 835.91 s [vector] +++ OK, passed 100 tests.
  6897. 835.91 s [vector] createT: OK
  6898. 835.92 s [vector] +++ OK, passed 100 tests.
  6899. 835.92 s [vector] unfoldr: OK
  6900. 835.92 s [vector] +++ OK, passed 100 tests.
  6901. 835.92 s [vector] unfoldrN: OK
  6902. 835.92 s [vector] +++ OK, passed 100 tests.
  6903. 835.92 s [vector] unfoldrExactN: OK
  6904. 835.92 s [vector] +++ OK, passed 100 tests.
  6905. 835.92 s [vector] unfoldrM: OK
  6906. 835.92 s [vector] +++ OK, passed 100 tests.
  6907. 835.94 s [vector] unfoldrNM: OK
  6908. 835.94 s [vector] +++ OK, passed 100 tests.
  6909. 835.95 s [vector] unfoldrExactNM: OK (0.03s)
  6910. 835.95 s [vector] +++ OK, passed 100 tests.
  6911. 835.95 s [vector] constructN: OK
  6912. 835.96 s [vector] +++ OK, passed 100 tests.
  6913. 835.96 s [vector] constructrN: OK
  6914. 835.96 s [vector] +++ OK, passed 100 tests.
  6915. 835.96 s [vector] cons: OK
  6916. 835.96 s [vector] +++ OK, passed 100 tests.
  6917. 835.96 s [vector] snoc: OK
  6918. 835.96 s [vector] +++ OK, passed 100 tests.
  6919. 835.96 s [vector] append: OK
  6920. 835.96 s [vector] +++ OK, passed 100 tests.
  6921. 835.97 s [vector] concat: OK (0.01s)
  6922. 835.98 s [vector] +++ OK, passed 100 tests.
  6923. 835.98 s [vector] force: OK
  6924. 835.98 s [vector] +++ OK, passed 100 tests.
  6925. 835.98 s [vector] upd: OK
  6926. 835.98 s [vector] +++ OK, passed 100 tests.
  6927. 835.98 s [vector] accum: OK
  6928. 835.98 s [vector] +++ OK, passed 100 tests.
  6929. 835.98 s [vector] reverse: OK
  6930. 835.98 s [vector] +++ OK, passed 100 tests.
  6931. 835.98 s [vector] backpermute: OK
  6932. 835.98 s [vector] +++ OK, passed 100 tests.
  6933. 835.98 s [vector] map: OK
  6934. 835.99 s [vector] +++ OK, passed 100 tests.
  6935. 835.99 s [vector] imap: OK
  6936. 835.99 s [vector] +++ OK, passed 100 tests.
  6937. 835.99 s [vector] concatMap: OK
  6938. 835.99 s [vector] +++ OK, passed 100 tests.
  6939. 835.99 s [vector] mapM: OK
  6940. 836.00 s [vector] +++ OK, passed 100 tests.
  6941. 836.00 s [vector] mapM_: OK
  6942. 836.00 s [vector] +++ OK, passed 100 tests.
  6943. 836.00 s [vector] forM: OK
  6944. 836.01 s [vector] +++ OK, passed 100 tests.
  6945. 836.01 s [vector] forM_: OK (0.01s)
  6946. 836.01 s [vector] +++ OK, passed 100 tests.
  6947. 836.01 s [vector] imapM: OK
  6948. 836.02 s [vector] +++ OK, passed 100 tests.
  6949. 836.03 s [vector] imapM_: OK (0.01s)
  6950. 836.03 s [vector] +++ OK, passed 100 tests.
  6951. 836.03 s [vector] zipWith: OK
  6952. 836.03 s [vector] +++ OK, passed 100 tests.
  6953. 836.03 s [vector] zipWith3: OK
  6954. 836.03 s [vector] +++ OK, passed 100 tests.
  6955. 836.03 s [vector] izipWith: OK
  6956. 836.03 s [vector] +++ OK, passed 100 tests.
  6957. 836.03 s [vector] izipWith3: OK
  6958. 836.04 s [vector] +++ OK, passed 100 tests.
  6959. 836.04 s [vector] izipWithM: OK
  6960. 836.04 s [vector] +++ OK, passed 100 tests.
  6961. 836.05 s [vector] izipWithM_: OK
  6962. 836.05 s [vector] +++ OK, passed 100 tests.
  6963. 836.06 s [vector] zipWithM: OK
  6964. 836.06 s [vector] +++ OK, passed 100 tests.
  6965. 836.06 s [vector] zipWithM_: OK
  6966. 836.06 s [vector] +++ OK, passed 100 tests.
  6967. 836.06 s [vector] filter: OK
  6968. 836.06 s [vector] +++ OK, passed 100 tests.
  6969. 836.06 s [vector] ifilter: OK
  6970. 836.06 s [vector] +++ OK, passed 100 tests.
  6971. 836.08 s [vector] filterM: OK (0.02s)
  6972. 836.08 s [vector] +++ OK, passed 100 tests.
  6973. 836.08 s [vector] uniq: OK
  6974. 836.08 s [vector] +++ OK, passed 100 tests.
  6975. 836.08 s [vector] mapMaybe: OK
  6976. 836.08 s [vector] +++ OK, passed 100 tests.
  6977. 836.08 s [vector] imapMaybe: OK
  6978. 836.08 s [vector] +++ OK, passed 100 tests.
  6979. 836.08 s [vector] takeWhile: OK
  6980. 836.08 s [vector] +++ OK, passed 100 tests.
  6981. 836.08 s [vector] dropWhile: OK
  6982. 836.08 s [vector] +++ OK, passed 100 tests.
  6983. 836.08 s [vector] partition: OK
  6984. 836.09 s [vector] +++ OK, passed 100 tests.
  6985. 836.09 s [vector] partitionWith: OK
  6986. 836.09 s [vector] +++ OK, passed 100 tests.
  6987. 836.09 s [vector] span: OK
  6988. 836.09 s [vector] +++ OK, passed 100 tests.
  6989. 836.09 s [vector] break: OK
  6990. 836.09 s [vector] +++ OK, passed 100 tests.
  6991. 836.09 s [vector] spanR: OK
  6992. 836.09 s [vector] +++ OK, passed 100 tests.
  6993. 836.09 s [vector] breakR: OK
  6994. 836.09 s [vector] +++ OK, passed 100 tests.
  6995. 836.09 s [vector] groupBy: OK
  6996. 836.09 s [vector] +++ OK, passed 100 tests.
  6997. 836.09 s [vector] elem: OK
  6998. 836.09 s [vector] +++ OK, passed 100 tests.
  6999. 836.09 s [vector] notElem: OK
  7000. 836.09 s [vector] +++ OK, passed 100 tests.
  7001. 836.09 s [vector] find: OK
  7002. 836.09 s [vector] +++ OK, passed 100 tests.
  7003. 836.09 s [vector] findIndex: OK
  7004. 836.09 s [vector] +++ OK, passed 100 tests.
  7005. 836.09 s [vector] findIndexR: OK
  7006. 836.10 s [vector] +++ OK, passed 100 tests.
  7007. 836.10 s [vector] findIndices: OK
  7008. 836.10 s [vector] +++ OK, passed 100 tests.
  7009. 836.10 s [vector] elemIndex: OK
  7010. 836.10 s [vector] +++ OK, passed 100 tests.
  7011. 836.10 s [vector] elemIndices: OK
  7012. 836.10 s [vector] +++ OK, passed 100 tests.
  7013. 836.10 s [vector] foldl: OK
  7014. 836.10 s [vector] +++ OK, passed 100 tests.
  7015. 836.10 s [vector] foldl1: OK
  7016. 836.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7017. 836.10 s [vector] foldl': OK
  7018. 836.10 s [vector] +++ OK, passed 100 tests.
  7019. 836.10 s [vector] foldl1': OK
  7020. 836.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7021. 836.10 s [vector] foldr: OK
  7022. 836.11 s [vector] +++ OK, passed 100 tests.
  7023. 836.11 s [vector] foldr1: OK
  7024. 836.11 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7025. 836.11 s [vector] foldr': OK
  7026. 836.11 s [vector] +++ OK, passed 100 tests.
  7027. 836.11 s [vector] foldr1': OK
  7028. 836.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7029. 836.11 s [vector] ifoldl: OK
  7030. 836.11 s [vector] +++ OK, passed 100 tests.
  7031. 836.11 s [vector] ifoldl': OK
  7032. 836.12 s [vector] +++ OK, passed 100 tests.
  7033. 836.12 s [vector] ifoldr: OK
  7034. 836.12 s [vector] +++ OK, passed 100 tests.
  7035. 836.12 s [vector] ifoldr': OK
  7036. 836.12 s [vector] +++ OK, passed 100 tests.
  7037. 836.12 s [vector] ifoldM: OK
  7038. 836.12 s [vector] +++ OK, passed 100 tests.
  7039. 836.14 s [vector] ifoldM': OK
  7040. 836.14 s [vector] +++ OK, passed 100 tests.
  7041. 836.14 s [vector] ifoldM_: OK (0.01s)
  7042. 836.14 s [vector] +++ OK, passed 100 tests.
  7043. 836.15 s [vector] ifoldM'_: OK (0.01s)
  7044. 836.15 s [vector] +++ OK, passed 100 tests.
  7045. 836.15 s [vector] all: OK
  7046. 836.15 s [vector] +++ OK, passed 100 tests.
  7047. 836.15 s [vector] any: OK
  7048. 836.15 s [vector] +++ OK, passed 100 tests.
  7049. 836.15 s [vector] prescanl: OK
  7050. 836.15 s [vector] +++ OK, passed 100 tests.
  7051. 836.15 s [vector] prescanl': OK
  7052. 836.16 s [vector] +++ OK, passed 100 tests.
  7053. 836.16 s [vector] postscanl: OK
  7054. 836.16 s [vector] +++ OK, passed 100 tests.
  7055. 836.16 s [vector] postscanl': OK
  7056. 836.16 s [vector] +++ OK, passed 100 tests.
  7057. 836.16 s [vector] scanl: OK
  7058. 836.16 s [vector] +++ OK, passed 100 tests.
  7059. 836.16 s [vector] scanl': OK
  7060. 836.16 s [vector] +++ OK, passed 100 tests.
  7061. 836.16 s [vector] scanl1: OK
  7062. 836.17 s [vector] +++ OK, passed 100 tests.
  7063. 836.17 s [vector] scanl1': OK
  7064. 836.17 s [vector] +++ OK, passed 100 tests.
  7065. 836.17 s [vector] iscanl: OK
  7066. 836.17 s [vector] +++ OK, passed 100 tests.
  7067. 836.17 s [vector] iscanl': OK
  7068. 836.18 s [vector] +++ OK, passed 100 tests.
  7069. 836.18 s [vector] prescanr: OK
  7070. 836.18 s [vector] +++ OK, passed 100 tests.
  7071. 836.18 s [vector] prescanr': OK
  7072. 836.18 s [vector] +++ OK, passed 100 tests.
  7073. 836.18 s [vector] postscanr: OK
  7074. 836.18 s [vector] +++ OK, passed 100 tests.
  7075. 836.18 s [vector] postscanr': OK
  7076. 836.18 s [vector] +++ OK, passed 100 tests.
  7077. 836.18 s [vector] scanr: OK
  7078. 836.18 s [vector] +++ OK, passed 100 tests.
  7079. 836.18 s [vector] scanr': OK
  7080. 836.18 s [vector] +++ OK, passed 100 tests.
  7081. 836.18 s [vector] scanr1: OK
  7082. 836.18 s [vector] +++ OK, passed 100 tests.
  7083. 836.18 s [vector] scanr1': OK
  7084. 836.19 s [vector] +++ OK, passed 100 tests.
  7085. 836.19 s [vector] iscanr: OK
  7086. 836.19 s [vector] +++ OK, passed 100 tests.
  7087. 836.19 s [vector] iscanr': OK
  7088. 836.19 s [vector] +++ OK, passed 100 tests.
  7089. 836.19 s [vector] mut_read: OK
  7090. 836.19 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7091. 836.19 s [vector] mut_write: OK
  7092. 836.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7093. 836.19 s [vector] mut_modify: OK
  7094. 836.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7095. 836.20 s [vector] mut_generate: OK
  7096. 836.20 s [vector] +++ OK, passed 100 tests.
  7097. 836.20 s [vector] mut_generateM: OK
  7098. 836.20 s [vector] +++ OK, passed 100 tests.
  7099. 836.21 s [vector] mut_mapM_: OK (0.01s)
  7100. 836.21 s [vector] +++ OK, passed 100 tests.
  7101. 836.22 s [vector] mut_imapM_: OK
  7102. 836.22 s [vector] +++ OK, passed 100 tests.
  7103. 836.25 s [vector] mut_forM_: OK (0.02s)
  7104. 836.25 s [vector] +++ OK, passed 100 tests.
  7105. 836.25 s [vector] mut_iforM_: OK (0.01s)
  7106. 836.26 s [vector] +++ OK, passed 100 tests.
  7107. 836.26 s [vector] mut_foldr: OK
  7108. 836.26 s [vector] +++ OK, passed 100 tests.
  7109. 836.26 s [vector] mut_foldr': OK
  7110. 836.27 s [vector] +++ OK, passed 100 tests.
  7111. 836.27 s [vector] mut_foldl: OK
  7112. 836.27 s [vector] +++ OK, passed 100 tests.
  7113. 836.27 s [vector] mut_foldl': OK
  7114. 836.27 s [vector] +++ OK, passed 100 tests.
  7115. 836.27 s [vector] mut_ifoldr: OK
  7116. 836.27 s [vector] +++ OK, passed 100 tests.
  7117. 836.28 s [vector] mut_ifoldr': OK
  7118. 836.28 s [vector] +++ OK, passed 100 tests.
  7119. 836.28 s [vector] mut_ifoldl: OK
  7120. 836.28 s [vector] +++ OK, passed 100 tests.
  7121. 836.28 s [vector] mut_ifoldl': OK
  7122. 836.29 s [vector] +++ OK, passed 100 tests.
  7123. 836.29 s [vector] mut_foldM: OK
  7124. 836.29 s [vector] +++ OK, passed 100 tests.
  7125. 836.29 s [vector] mut_foldM': OK
  7126. 836.29 s [vector] +++ OK, passed 100 tests.
  7127. 836.29 s [vector] mut_foldrM: OK
  7128. 836.29 s [vector] +++ OK, passed 100 tests.
  7129. 836.29 s [vector] mut_foldrM': OK
  7130. 836.29 s [vector] +++ OK, passed 100 tests.
  7131. 836.29 s [vector] mut_ifoldM: OK
  7132. 836.29 s [vector] +++ OK, passed 100 tests.
  7133. 836.29 s [vector] mut_ifoldM': OK
  7134. 836.29 s [vector] +++ OK, passed 100 tests.
  7135. 836.29 s [vector] mut_ifoldrM: OK
  7136. 836.29 s [vector] +++ OK, passed 100 tests.
  7137. 836.29 s [vector] mut_ifoldrM': OK
  7138. 836.29 s [vector] +++ OK, passed 100 tests.
  7139. 836.29 s [vector] compare: OK
  7140. 836.29 s [vector] +++ OK, passed 100 tests.
  7141. 836.30 s [vector] maximum: OK
  7142. 836.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7143. 836.30 s [vector] minimum: OK
  7144. 836.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7145. 836.30 s [vector] minIndex: OK
  7146. 836.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7147. 836.31 s [vector] maxIndex: OK
  7148. 836.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7149. 836.32 s [vector] maximumBy: OK
  7150. 836.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7151. 836.32 s [vector] minimumBy: OK
  7152. 836.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7153. 836.32 s [vector] maximumOn: OK
  7154. 836.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7155. 836.32 s [vector] minimumOn: OK
  7156. 836.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7157. 836.32 s [vector] maxIndexBy: OK
  7158. 836.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7159. 836.32 s [vector] minIndexBy: OK
  7160. 836.32 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7161. 836.32 s [vector] ListFirstMaxIndexWins: OK
  7162. 836.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7163. 836.32 s [vector] FalseListFirstMaxIndexWins: OK
  7164. 836.32 s [vector] +++ OK, failed as expected. (after 1 test):
  7165. 836.32 s [vector] Exception:
  7166. 836.32 s [vector] Prelude.foldr1: empty list
  7167. 836.32 s [vector] CallStack (from HasCallStack):
  7168. 836.32 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7169. 836.32 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7170. 836.32 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7171. 836.32 s [vector] []
  7172. 836.32 s [vector] zip: OK
  7173. 836.32 s [vector] +++ OK, passed 100 tests.
  7174. 836.33 s [vector] zip3: OK
  7175. 836.33 s [vector] +++ OK, passed 100 tests.
  7176. 836.33 s [vector] unzip: OK
  7177. 836.33 s [vector] +++ OK, passed 100 tests.
  7178. 836.33 s [vector] unzip3: OK
  7179. 836.33 s [vector] +++ OK, passed 100 tests.
  7180. 836.33 s [vector] indexed: OK
  7181. 836.33 s [vector] +++ OK, passed 100 tests.
  7182. 836.33 s [vector] update: OK
  7183. 836.33 s [vector] +++ OK, passed 100 tests.
  7184. 836.33 s [vector] mempty: OK
  7185. 836.33 s [vector] +++ OK, passed 100 tests.
  7186. 836.33 s [vector] mappend: OK
  7187. 836.33 s [vector] +++ OK, passed 100 tests.
  7188. 836.33 s [vector] mconcat: OK (0.01s)
  7189. 836.33 s [vector] +++ OK, passed 100 tests.
  7190. 836.33 s [vector] glength: OK
  7191. 836.33 s [vector] +++ OK, passed 100 tests.
  7192. 836.33 s [vector] and: OK
  7193. 836.33 s [vector] +++ OK, passed 100 tests.
  7194. 836.33 s [vector] or: OK
  7195. 836.34 s [vector] +++ OK, passed 100 tests.
  7196. 836.34 s [vector] (Int)
  7197. 836.34 s [vector] fromList.toList == id: OK
  7198. 836.34 s [vector] +++ OK, passed 100 tests.
  7199. 836.34 s [vector] toList.fromList == id: OK
  7200. 836.34 s [vector] +++ OK, passed 100 tests.
  7201. 836.34 s [vector] unstream.stream == id: OK
  7202. 836.34 s [vector] +++ OK, passed 100 tests.
  7203. 836.34 s [vector] stream.unstream == id: OK
  7204. 836.34 s [vector] +++ OK, passed 100 tests.
  7205. 836.34 s [vector] eq: OK
  7206. 836.34 s [vector] +++ OK, passed 100 tests.
  7207. 836.34 s [vector] length: OK
  7208. 836.34 s [vector] +++ OK, passed 100 tests.
  7209. 836.34 s [vector] null: OK
  7210. 836.34 s [vector] +++ OK, passed 100 tests.
  7211. 836.34 s [vector] index: OK
  7212. 836.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7213. 836.34 s [vector] safeIndex: OK
  7214. 836.34 s [vector] +++ OK, passed 100 tests.
  7215. 836.34 s [vector] head: OK
  7216. 836.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7217. 836.34 s [vector] last: OK
  7218. 836.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7219. 836.34 s [vector] unsafeIndex: OK
  7220. 836.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7221. 836.34 s [vector] unsafeHead: OK
  7222. 836.34 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7223. 836.34 s [vector] unsafeLast: OK
  7224. 836.34 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7225. 836.34 s [vector] slice: OK
  7226. 836.34 s [vector] +++ OK, passed 100 tests.
  7227. 836.34 s [vector] init: OK
  7228. 836.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7229. 836.35 s [vector] tail: OK
  7230. 836.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7231. 836.35 s [vector] take: OK
  7232. 836.35 s [vector] +++ OK, passed 100 tests.
  7233. 836.35 s [vector] drop: OK
  7234. 836.35 s [vector] +++ OK, passed 100 tests.
  7235. 836.35 s [vector] splitAt: OK
  7236. 836.35 s [vector] +++ OK, passed 100 tests.
  7237. 836.35 s [vector] empty: OK
  7238. 836.35 s [vector] +++ OK, passed 100 tests.
  7239. 836.35 s [vector] singleton: OK
  7240. 836.35 s [vector] +++ OK, passed 100 tests.
  7241. 836.35 s [vector] replicate: OK
  7242. 836.35 s [vector] +++ OK, passed 100 tests.
  7243. 836.36 s [vector] generate: OK
  7244. 836.36 s [vector] +++ OK, passed 100 tests.
  7245. 836.36 s [vector] iterateN: OK
  7246. 836.36 s [vector] +++ OK, passed 100 tests.
  7247. 836.38 s [vector] iterateNM: OK (0.02s)
  7248. 836.38 s [vector] +++ OK, passed 100 tests.
  7249. 836.40 s [vector] generateM: OK (0.02s)
  7250. 836.40 s [vector] +++ OK, passed 100 tests.
  7251. 836.41 s [vector] replicateM: OK (0.02s)
  7252. 836.41 s [vector] +++ OK, passed 100 tests.
  7253. 836.41 s [vector] create: OK
  7254. 836.41 s [vector] +++ OK, passed 100 tests.
  7255. 836.41 s [vector] createT: OK
  7256. 836.41 s [vector] +++ OK, passed 100 tests.
  7257. 836.41 s [vector] unfoldr: OK
  7258. 836.41 s [vector] +++ OK, passed 100 tests.
  7259. 836.41 s [vector] unfoldrN: OK
  7260. 836.41 s [vector] +++ OK, passed 100 tests.
  7261. 836.41 s [vector] unfoldrExactN: OK
  7262. 836.41 s [vector] +++ OK, passed 100 tests.
  7263. 836.41 s [vector] unfoldrM: OK
  7264. 836.41 s [vector] +++ OK, passed 100 tests.
  7265. 836.42 s [vector] unfoldrNM: OK
  7266. 836.42 s [vector] +++ OK, passed 100 tests.
  7267. 836.44 s [vector] unfoldrExactNM: OK (0.03s)
  7268. 836.44 s [vector] +++ OK, passed 100 tests.
  7269. 836.44 s [vector] constructN: OK
  7270. 836.45 s [vector] +++ OK, passed 100 tests.
  7271. 836.45 s [vector] constructrN: OK
  7272. 836.45 s [vector] +++ OK, passed 100 tests.
  7273. 836.45 s [vector] cons: OK
  7274. 836.45 s [vector] +++ OK, passed 100 tests.
  7275. 836.45 s [vector] snoc: OK
  7276. 836.45 s [vector] +++ OK, passed 100 tests.
  7277. 836.46 s [vector] append: OK
  7278. 836.46 s [vector] +++ OK, passed 100 tests.
  7279. 836.47 s [vector] concat: OK (0.02s)
  7280. 836.47 s [vector] +++ OK, passed 100 tests.
  7281. 836.47 s [vector] force: OK
  7282. 836.47 s [vector] +++ OK, passed 100 tests.
  7283. 836.47 s [vector] upd: OK
  7284. 836.47 s [vector] +++ OK, passed 100 tests.
  7285. 836.47 s [vector] accum: OK
  7286. 836.47 s [vector] +++ OK, passed 100 tests.
  7287. 836.47 s [vector] reverse: OK
  7288. 836.47 s [vector] +++ OK, passed 100 tests.
  7289. 836.47 s [vector] backpermute: OK
  7290. 836.47 s [vector] +++ OK, passed 100 tests.
  7291. 836.48 s [vector] map: OK
  7292. 836.48 s [vector] +++ OK, passed 100 tests.
  7293. 836.48 s [vector] imap: OK
  7294. 836.48 s [vector] +++ OK, passed 100 tests.
  7295. 836.48 s [vector] concatMap: OK
  7296. 836.48 s [vector] +++ OK, passed 100 tests.
  7297. 836.50 s [vector] mapM: OK
  7298. 836.50 s [vector] +++ OK, passed 100 tests.
  7299. 836.50 s [vector] mapM_: OK (0.01s)
  7300. 836.50 s [vector] +++ OK, passed 100 tests.
  7301. 836.52 s [vector] forM: OK
  7302. 836.52 s [vector] +++ OK, passed 100 tests.
  7303. 836.52 s [vector] forM_: OK (0.02s)
  7304. 836.52 s [vector] +++ OK, passed 100 tests.
  7305. 836.54 s [vector] imapM: OK
  7306. 836.54 s [vector] +++ OK, passed 100 tests.
  7307. 836.54 s [vector] imapM_: OK (0.02s)
  7308. 836.55 s [vector] +++ OK, passed 100 tests.
  7309. 836.55 s [vector] zipWith: OK
  7310. 836.55 s [vector] +++ OK, passed 100 tests.
  7311. 836.55 s [vector] zipWith3: OK
  7312. 836.55 s [vector] +++ OK, passed 100 tests.
  7313. 836.55 s [vector] izipWith: OK
  7314. 836.55 s [vector] +++ OK, passed 100 tests.
  7315. 836.55 s [vector] izipWith3: OK
  7316. 836.55 s [vector] +++ OK, passed 100 tests.
  7317. 836.56 s [vector] izipWithM: OK
  7318. 836.56 s [vector] +++ OK, passed 100 tests.
  7319. 836.57 s [vector] izipWithM_: OK (0.01s)
  7320. 836.57 s [vector] +++ OK, passed 100 tests.
  7321. 836.58 s [vector] zipWithM: OK
  7322. 836.58 s [vector] +++ OK, passed 100 tests.
  7323. 836.59 s [vector] zipWithM_: OK (0.01s)
  7324. 836.59 s [vector] +++ OK, passed 100 tests.
  7325. 836.59 s [vector] filter: OK
  7326. 836.59 s [vector] +++ OK, passed 100 tests.
  7327. 836.60 s [vector] ifilter: OK
  7328. 836.60 s [vector] +++ OK, passed 100 tests.
  7329. 836.61 s [vector] filterM: OK (0.02s)
  7330. 836.61 s [vector] +++ OK, passed 100 tests.
  7331. 836.61 s [vector] uniq: OK
  7332. 836.61 s [vector] +++ OK, passed 100 tests.
  7333. 836.62 s [vector] mapMaybe: OK
  7334. 836.62 s [vector] +++ OK, passed 100 tests.
  7335. 836.62 s [vector] imapMaybe: OK
  7336. 836.62 s [vector] +++ OK, passed 100 tests.
  7337. 836.62 s [vector] takeWhile: OK
  7338. 836.62 s [vector] +++ OK, passed 100 tests.
  7339. 836.62 s [vector] dropWhile: OK
  7340. 836.62 s [vector] +++ OK, passed 100 tests.
  7341. 836.63 s [vector] partition: OK
  7342. 836.63 s [vector] +++ OK, passed 100 tests.
  7343. 836.63 s [vector] partitionWith: OK
  7344. 836.63 s [vector] +++ OK, passed 100 tests.
  7345. 836.63 s [vector] span: OK
  7346. 836.63 s [vector] +++ OK, passed 100 tests.
  7347. 836.63 s [vector] break: OK
  7348. 836.63 s [vector] +++ OK, passed 100 tests.
  7349. 836.63 s [vector] spanR: OK
  7350. 836.63 s [vector] +++ OK, passed 100 tests.
  7351. 836.63 s [vector] breakR: OK
  7352. 836.63 s [vector] +++ OK, passed 100 tests.
  7353. 836.63 s [vector] groupBy: OK
  7354. 836.63 s [vector] +++ OK, passed 100 tests.
  7355. 836.63 s [vector] elem: OK
  7356. 836.63 s [vector] +++ OK, passed 100 tests.
  7357. 836.63 s [vector] notElem: OK
  7358. 836.63 s [vector] +++ OK, passed 100 tests.
  7359. 836.63 s [vector] find: OK
  7360. 836.63 s [vector] +++ OK, passed 100 tests.
  7361. 836.64 s [vector] findIndex: OK
  7362. 836.64 s [vector] +++ OK, passed 100 tests.
  7363. 836.64 s [vector] findIndexR: OK
  7364. 836.64 s [vector] +++ OK, passed 100 tests.
  7365. 836.64 s [vector] findIndices: OK
  7366. 836.64 s [vector] +++ OK, passed 100 tests.
  7367. 836.64 s [vector] elemIndex: OK
  7368. 836.64 s [vector] +++ OK, passed 100 tests.
  7369. 836.64 s [vector] elemIndices: OK
  7370. 836.64 s [vector] +++ OK, passed 100 tests.
  7371. 836.64 s [vector] foldl: OK
  7372. 836.64 s [vector] +++ OK, passed 100 tests.
  7373. 836.64 s [vector] foldl1: OK
  7374. 836.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7375. 836.65 s [vector] foldl': OK
  7376. 836.65 s [vector] +++ OK, passed 100 tests.
  7377. 836.65 s [vector] foldl1': OK
  7378. 836.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7379. 836.65 s [vector] foldr: OK
  7380. 836.65 s [vector] +++ OK, passed 100 tests.
  7381. 836.66 s [vector] foldr1: OK
  7382. 836.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7383. 836.66 s [vector] foldr': OK
  7384. 836.66 s [vector] +++ OK, passed 100 tests.
  7385. 836.66 s [vector] foldr1': OK
  7386. 836.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7387. 836.66 s [vector] ifoldl: OK
  7388. 836.66 s [vector] +++ OK, passed 100 tests.
  7389. 836.67 s [vector] ifoldl': OK
  7390. 836.67 s [vector] +++ OK, passed 100 tests.
  7391. 836.67 s [vector] ifoldr: OK
  7392. 836.67 s [vector] +++ OK, passed 100 tests.
  7393. 836.67 s [vector] ifoldr': OK
  7394. 836.67 s [vector] +++ OK, passed 100 tests.
  7395. 836.67 s [vector] ifoldM: OK
  7396. 836.68 s [vector] +++ OK, passed 100 tests.
  7397. 836.68 s [vector] ifoldM': OK
  7398. 836.68 s [vector] +++ OK, passed 100 tests.
  7399. 836.70 s [vector] ifoldM_: OK (0.02s)
  7400. 836.70 s [vector] +++ OK, passed 100 tests.
  7401. 836.72 s [vector] ifoldM'_: OK (0.02s)
  7402. 836.72 s [vector] +++ OK, passed 100 tests.
  7403. 836.72 s [vector] all: OK
  7404. 836.72 s [vector] +++ OK, passed 100 tests.
  7405. 836.72 s [vector] any: OK
  7406. 836.72 s [vector] +++ OK, passed 100 tests.
  7407. 836.72 s [vector] prescanl: OK
  7408. 836.72 s [vector] +++ OK, passed 100 tests.
  7409. 836.72 s [vector] prescanl': OK
  7410. 836.72 s [vector] +++ OK, passed 100 tests.
  7411. 836.73 s [vector] postscanl: OK
  7412. 836.73 s [vector] +++ OK, passed 100 tests.
  7413. 836.73 s [vector] postscanl': OK
  7414. 836.73 s [vector] +++ OK, passed 100 tests.
  7415. 836.73 s [vector] scanl: OK
  7416. 836.73 s [vector] +++ OK, passed 100 tests.
  7417. 836.73 s [vector] scanl': OK
  7418. 836.74 s [vector] +++ OK, passed 100 tests.
  7419. 836.74 s [vector] scanl1: OK
  7420. 836.74 s [vector] +++ OK, passed 100 tests.
  7421. 836.74 s [vector] scanl1': OK
  7422. 836.74 s [vector] +++ OK, passed 100 tests.
  7423. 836.75 s [vector] iscanl: OK
  7424. 836.75 s [vector] +++ OK, passed 100 tests.
  7425. 836.75 s [vector] iscanl': OK
  7426. 836.75 s [vector] +++ OK, passed 100 tests.
  7427. 836.75 s [vector] prescanr: OK
  7428. 836.75 s [vector] +++ OK, passed 100 tests.
  7429. 836.75 s [vector] prescanr': OK
  7430. 836.75 s [vector] +++ OK, passed 100 tests.
  7431. 836.75 s [vector] postscanr: OK
  7432. 836.76 s [vector] +++ OK, passed 100 tests.
  7433. 836.76 s [vector] postscanr': OK
  7434. 836.76 s [vector] +++ OK, passed 100 tests.
  7435. 836.76 s [vector] scanr: OK
  7436. 836.76 s [vector] +++ OK, passed 100 tests.
  7437. 836.76 s [vector] scanr': OK
  7438. 836.76 s [vector] +++ OK, passed 100 tests.
  7439. 836.76 s [vector] scanr1: OK
  7440. 836.77 s [vector] +++ OK, passed 100 tests.
  7441. 836.77 s [vector] scanr1': OK
  7442. 836.77 s [vector] +++ OK, passed 100 tests.
  7443. 836.78 s [vector] iscanr: OK
  7444. 836.78 s [vector] +++ OK, passed 100 tests.
  7445. 836.78 s [vector] iscanr': OK
  7446. 836.78 s [vector] +++ OK, passed 100 tests.
  7447. 836.78 s [vector] mut_read: OK
  7448. 836.78 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7449. 836.78 s [vector] mut_write: OK
  7450. 836.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7451. 836.78 s [vector] mut_modify: OK
  7452. 836.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7453. 836.78 s [vector] mut_generate: OK
  7454. 836.78 s [vector] +++ OK, passed 100 tests.
  7455. 836.80 s [vector] mut_generateM: OK
  7456. 836.80 s [vector] +++ OK, passed 100 tests.
  7457. 836.82 s [vector] mut_mapM_: OK (0.02s)
  7458. 836.82 s [vector] +++ OK, passed 100 tests.
  7459. 836.84 s [vector] mut_imapM_: OK (0.03s)
  7460. 836.84 s [vector] +++ OK, passed 100 tests.
  7461. 836.86 s [vector] mut_forM_: OK (0.02s)
  7462. 836.86 s [vector] +++ OK, passed 100 tests.
  7463. 836.87 s [vector] mut_iforM_: OK (0.02s)
  7464. 836.88 s [vector] +++ OK, passed 100 tests.
  7465. 836.88 s [vector] mut_foldr: OK
  7466. 836.88 s [vector] +++ OK, passed 100 tests.
  7467. 836.88 s [vector] mut_foldr': OK
  7468. 836.88 s [vector] +++ OK, passed 100 tests.
  7469. 836.88 s [vector] mut_foldl: OK
  7470. 836.88 s [vector] +++ OK, passed 100 tests.
  7471. 836.88 s [vector] mut_foldl': OK
  7472. 836.88 s [vector] +++ OK, passed 100 tests.
  7473. 836.88 s [vector] mut_ifoldr: OK
  7474. 836.89 s [vector] +++ OK, passed 100 tests.
  7475. 836.89 s [vector] mut_ifoldr': OK
  7476. 836.90 s [vector] +++ OK, passed 100 tests.
  7477. 836.90 s [vector] mut_ifoldl: OK
  7478. 836.90 s [vector] +++ OK, passed 100 tests.
  7479. 836.90 s [vector] mut_ifoldl': OK
  7480. 836.90 s [vector] +++ OK, passed 100 tests.
  7481. 836.90 s [vector] mut_foldM: OK
  7482. 836.90 s [vector] +++ OK, passed 100 tests.
  7483. 836.90 s [vector] mut_foldM': OK
  7484. 836.90 s [vector] +++ OK, passed 100 tests.
  7485. 836.90 s [vector] mut_foldrM: OK
  7486. 836.90 s [vector] +++ OK, passed 100 tests.
  7487. 836.91 s [vector] mut_foldrM': OK
  7488. 836.91 s [vector] +++ OK, passed 100 tests.
  7489. 836.92 s [vector] mut_ifoldM: OK
  7490. 836.92 s [vector] +++ OK, passed 100 tests.
  7491. 836.92 s [vector] mut_ifoldM': OK
  7492. 836.92 s [vector] +++ OK, passed 100 tests.
  7493. 836.92 s [vector] mut_ifoldrM: OK
  7494. 836.92 s [vector] +++ OK, passed 100 tests.
  7495. 836.92 s [vector] mut_ifoldrM': OK
  7496. 836.92 s [vector] +++ OK, passed 100 tests.
  7497. 836.92 s [vector] compare: OK
  7498. 836.92 s [vector] +++ OK, passed 100 tests.
  7499. 836.92 s [vector] maximum: OK
  7500. 836.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7501. 836.92 s [vector] minimum: OK
  7502. 836.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7503. 836.92 s [vector] minIndex: OK
  7504. 836.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7505. 836.93 s [vector] maxIndex: OK
  7506. 836.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7507. 836.93 s [vector] maximumBy: OK
  7508. 836.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7509. 836.93 s [vector] minimumBy: OK
  7510. 836.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7511. 836.93 s [vector] maximumOn: OK
  7512. 836.93 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7513. 836.93 s [vector] minimumOn: OK
  7514. 836.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7515. 836.93 s [vector] maxIndexBy: OK
  7516. 836.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7517. 836.93 s [vector] minIndexBy: OK
  7518. 836.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7519. 836.93 s [vector] ListFirstMaxIndexWins: OK
  7520. 836.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7521. 836.93 s [vector] FalseListFirstMaxIndexWins: OK
  7522. 836.93 s [vector] +++ OK, failed as expected. (after 1 test):
  7523. 836.93 s [vector] Exception:
  7524. 836.93 s [vector] Prelude.foldr1: empty list
  7525. 836.93 s [vector] CallStack (from HasCallStack):
  7526. 836.93 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7527. 836.93 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7528. 836.93 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7529. 836.93 s [vector] []
  7530. 836.94 s [vector] zip: OK
  7531. 836.94 s [vector] +++ OK, passed 100 tests.
  7532. 836.94 s [vector] zip3: OK
  7533. 836.94 s [vector] +++ OK, passed 100 tests.
  7534. 836.94 s [vector] unzip: OK
  7535. 836.94 s [vector] +++ OK, passed 100 tests.
  7536. 836.94 s [vector] unzip3: OK
  7537. 836.94 s [vector] +++ OK, passed 100 tests.
  7538. 836.94 s [vector] indexed: OK
  7539. 836.94 s [vector] +++ OK, passed 100 tests.
  7540. 836.94 s [vector] update: OK
  7541. 836.94 s [vector] +++ OK, passed 100 tests.
  7542. 836.94 s [vector] mempty: OK
  7543. 836.94 s [vector] +++ OK, passed 100 tests.
  7544. 836.96 s [vector] mappend: OK
  7545. 836.96 s [vector] +++ OK, passed 100 tests.
  7546. 836.96 s [vector] mconcat: OK (0.01s)
  7547. 836.96 s [vector] +++ OK, passed 100 tests.
  7548. 836.96 s [vector] glength: OK
  7549. 836.96 s [vector] +++ OK, passed 100 tests.
  7550. 836.96 s [vector] sum: OK
  7551. 836.96 s [vector] +++ OK, passed 100 tests.
  7552. 836.96 s [vector] product: OK
  7553. 836.96 s [vector] +++ OK, passed 100 tests.
  7554. 836.96 s [vector] enumFromN: OK
  7555. 836.96 s [vector] +++ OK, passed 100 tests.
  7556. 836.96 s [vector] enumFromThenN: OK
  7557. 836.96 s [vector] +++ OK, passed 100 tests.
  7558. 836.96 s [vector] enumFromTo: OK
  7559. 836.96 s [vector] +++ OK, passed 100 tests.
  7560. 836.96 s [vector] enumFromThenTo: OK
  7561. 836.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7562. 836.96 s [vector] (Float)
  7563. 836.96 s [vector] fromList.toList == id: OK
  7564. 836.96 s [vector] +++ OK, passed 100 tests.
  7565. 836.97 s [vector] toList.fromList == id: OK
  7566. 836.97 s [vector] +++ OK, passed 100 tests.
  7567. 836.97 s [vector] unstream.stream == id: OK
  7568. 836.97 s [vector] +++ OK, passed 100 tests.
  7569. 836.97 s [vector] stream.unstream == id: OK
  7570. 836.97 s [vector] +++ OK, passed 100 tests.
  7571. 836.97 s [vector] eq: OK
  7572. 836.97 s [vector] +++ OK, passed 100 tests.
  7573. 836.97 s [vector] length: OK
  7574. 836.97 s [vector] +++ OK, passed 100 tests.
  7575. 836.97 s [vector] null: OK
  7576. 836.97 s [vector] +++ OK, passed 100 tests.
  7577. 836.97 s [vector] index: OK
  7578. 836.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7579. 836.97 s [vector] safeIndex: OK
  7580. 836.97 s [vector] +++ OK, passed 100 tests.
  7581. 836.97 s [vector] head: OK
  7582. 836.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7583. 836.97 s [vector] last: OK
  7584. 836.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7585. 836.97 s [vector] unsafeIndex: OK
  7586. 836.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7587. 836.98 s [vector] unsafeHead: OK
  7588. 836.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7589. 836.98 s [vector] unsafeLast: OK
  7590. 836.98 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7591. 836.98 s [vector] slice: OK
  7592. 836.98 s [vector] +++ OK, passed 100 tests.
  7593. 836.98 s [vector] init: OK
  7594. 836.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7595. 836.98 s [vector] tail: OK
  7596. 836.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7597. 836.98 s [vector] take: OK
  7598. 836.98 s [vector] +++ OK, passed 100 tests.
  7599. 836.98 s [vector] drop: OK
  7600. 836.98 s [vector] +++ OK, passed 100 tests.
  7601. 836.98 s [vector] splitAt: OK
  7602. 836.98 s [vector] +++ OK, passed 100 tests.
  7603. 836.98 s [vector] empty: OK
  7604. 836.98 s [vector] +++ OK, passed 100 tests.
  7605. 836.98 s [vector] singleton: OK
  7606. 836.98 s [vector] +++ OK, passed 100 tests.
  7607. 836.98 s [vector] replicate: OK
  7608. 836.98 s [vector] +++ OK, passed 100 tests.
  7609. 836.99 s [vector] generate: OK
  7610. 837.00 s [vector] +++ OK, passed 100 tests.
  7611. 837.00 s [vector] iterateN: OK
  7612. 837.00 s [vector] +++ OK, passed 100 tests.
  7613. 837.02 s [vector] iterateNM: OK (0.03s)
  7614. 837.02 s [vector] +++ OK, passed 100 tests.
  7615. 837.04 s [vector] generateM: OK (0.02s)
  7616. 837.04 s [vector] +++ OK, passed 100 tests.
  7617. 837.05 s [vector] replicateM: OK (0.01s)
  7618. 837.05 s [vector] +++ OK, passed 100 tests.
  7619. 837.05 s [vector] create: OK
  7620. 837.05 s [vector] +++ OK, passed 100 tests.
  7621. 837.05 s [vector] createT: OK
  7622. 837.05 s [vector] +++ OK, passed 100 tests.
  7623. 837.05 s [vector] unfoldr: OK
  7624. 837.05 s [vector] +++ OK, passed 100 tests.
  7625. 837.05 s [vector] unfoldrN: OK
  7626. 837.05 s [vector] +++ OK, passed 100 tests.
  7627. 837.05 s [vector] unfoldrExactN: OK
  7628. 837.05 s [vector] +++ OK, passed 100 tests.
  7629. 837.05 s [vector] unfoldrM: OK
  7630. 837.06 s [vector] +++ OK, passed 100 tests.
  7631. 837.06 s [vector] unfoldrNM: OK
  7632. 837.08 s [vector] +++ OK, passed 100 tests.
  7633. 837.12 s [vector] unfoldrExactNM: OK (0.05s)
  7634. 837.12 s [vector] +++ OK, passed 100 tests.
  7635. 837.12 s [vector] constructN: OK
  7636. 837.13 s [vector] +++ OK, passed 100 tests.
  7637. 837.13 s [vector] constructrN: OK
  7638. 837.13 s [vector] +++ OK, passed 100 tests.
  7639. 837.13 s [vector] cons: OK
  7640. 837.13 s [vector] +++ OK, passed 100 tests.
  7641. 837.13 s [vector] snoc: OK
  7642. 837.14 s [vector] +++ OK, passed 100 tests.
  7643. 837.14 s [vector] append: OK
  7644. 837.14 s [vector] +++ OK, passed 100 tests.
  7645. 837.16 s [vector] concat: OK (0.03s)
  7646. 837.16 s [vector] +++ OK, passed 100 tests.
  7647. 837.16 s [vector] force: OK
  7648. 837.17 s [vector] +++ OK, passed 100 tests.
  7649. 837.18 s [vector] upd: OK
  7650. 837.18 s [vector] +++ OK, passed 100 tests.
  7651. 837.19 s [vector] accum: OK (0.01s)
  7652. 837.19 s [vector] +++ OK, passed 100 tests.
  7653. 837.19 s [vector] reverse: OK
  7654. 837.19 s [vector] +++ OK, passed 100 tests.
  7655. 837.20 s [vector] backpermute: OK
  7656. 837.20 s [vector] +++ OK, passed 100 tests.
  7657. 837.20 s [vector] map: OK
  7658. 837.20 s [vector] +++ OK, passed 100 tests.
  7659. 837.21 s [vector] imap: OK
  7660. 837.22 s [vector] +++ OK, passed 100 tests.
  7661. 837.22 s [vector] concatMap: OK (0.01s)
  7662. 837.22 s [vector] +++ OK, passed 100 tests.
  7663. 837.22 s [vector] mapM: OK
  7664. 837.22 s [vector] +++ OK, passed 100 tests.
  7665. 837.26 s [vector] mapM_: OK (0.03s)
  7666. 837.26 s [vector] +++ OK, passed 100 tests.
  7667. 837.28 s [vector] forM: OK
  7668. 837.28 s [vector] +++ OK, passed 100 tests.
  7669. 837.30 s [vector] forM_: OK (0.03s)
  7670. 837.30 s [vector] +++ OK, passed 100 tests.
  7671. 837.30 s [vector] imapM: OK
  7672. 837.30 s [vector] +++ OK, passed 100 tests.
  7673. 837.34 s [vector] imapM_: OK (0.02s)
  7674. 837.34 s [vector] +++ OK, passed 100 tests.
  7675. 837.35 s [vector] zipWith: OK
  7676. 837.35 s [vector] +++ OK, passed 100 tests.
  7677. 837.36 s [vector] zipWith3: OK
  7678. 837.36 s [vector] +++ OK, passed 100 tests.
  7679. 837.36 s [vector] izipWith: OK
  7680. 837.36 s [vector] +++ OK, passed 100 tests.
  7681. 837.38 s [vector] izipWith3: OK
  7682. 837.38 s [vector] +++ OK, passed 100 tests.
  7683. 837.38 s [vector] izipWithM: OK
  7684. 837.38 s [vector] +++ OK, passed 100 tests.
  7685. 837.41 s [vector] izipWithM_: OK (0.03s)
  7686. 837.42 s [vector] +++ OK, passed 100 tests.
  7687. 837.42 s [vector] zipWithM: OK
  7688. 837.42 s [vector] +++ OK, passed 100 tests.
  7689. 837.44 s [vector] zipWithM_: OK (0.03s)
  7690. 837.44 s [vector] +++ OK, passed 100 tests.
  7691. 837.45 s [vector] filter: OK
  7692. 837.45 s [vector] +++ OK, passed 100 tests.
  7693. 837.45 s [vector] ifilter: OK
  7694. 837.46 s [vector] +++ OK, passed 100 tests.
  7695. 837.49 s [vector] filterM: OK (0.04s)
  7696. 837.49 s [vector] +++ OK, passed 100 tests.
  7697. 837.49 s [vector] uniq: OK
  7698. 837.49 s [vector] +++ OK, passed 100 tests.
  7699. 837.50 s [vector] mapMaybe: OK
  7700. 837.50 s [vector] +++ OK, passed 100 tests.
  7701. 837.50 s [vector] imapMaybe: OK
  7702. 837.50 s [vector] +++ OK, passed 100 tests.
  7703. 837.50 s [vector] takeWhile: OK
  7704. 837.50 s [vector] +++ OK, passed 100 tests.
  7705. 837.50 s [vector] dropWhile: OK
  7706. 837.50 s [vector] +++ OK, passed 100 tests.
  7707. 837.51 s [vector] partition: OK
  7708. 837.51 s [vector] +++ OK, passed 100 tests.
  7709. 837.51 s [vector] partitionWith: OK
  7710. 837.51 s [vector] +++ OK, passed 100 tests.
  7711. 837.51 s [vector] span: OK
  7712. 837.51 s [vector] +++ OK, passed 100 tests.
  7713. 837.52 s [vector] break: OK
  7714. 837.52 s [vector] +++ OK, passed 100 tests.
  7715. 837.52 s [vector] spanR: OK
  7716. 837.52 s [vector] +++ OK, passed 100 tests.
  7717. 837.52 s [vector] breakR: OK
  7718. 837.53 s [vector] +++ OK, passed 100 tests.
  7719. 837.53 s [vector] groupBy: OK
  7720. 837.53 s [vector] +++ OK, passed 100 tests.
  7721. 837.53 s [vector] elem: OK
  7722. 837.53 s [vector] +++ OK, passed 100 tests.
  7723. 837.54 s [vector] notElem: OK
  7724. 837.55 s [vector] +++ OK, passed 100 tests.
  7725. 837.56 s [vector] find: OK
  7726. 837.56 s [vector] +++ OK, passed 100 tests.
  7727. 837.56 s [vector] findIndex: OK
  7728. 837.56 s [vector] +++ OK, passed 100 tests.
  7729. 837.56 s [vector] findIndexR: OK
  7730. 837.57 s [vector] +++ OK, passed 100 tests.
  7731. 837.57 s [vector] findIndices: OK
  7732. 837.57 s [vector] +++ OK, passed 100 tests.
  7733. 837.57 s [vector] elemIndex: OK
  7734. 837.57 s [vector] +++ OK, passed 100 tests.
  7735. 837.57 s [vector] elemIndices: OK
  7736. 837.57 s [vector] +++ OK, passed 100 tests.
  7737. 837.57 s [vector] foldl: OK
  7738. 837.57 s [vector] +++ OK, passed 100 tests.
  7739. 837.58 s [vector] foldl1: OK
  7740. 837.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7741. 837.58 s [vector] foldl': OK
  7742. 837.58 s [vector] +++ OK, passed 100 tests.
  7743. 837.58 s [vector] foldl1': OK
  7744. 837.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7745. 837.58 s [vector] foldr: OK
  7746. 837.58 s [vector] +++ OK, passed 100 tests.
  7747. 837.58 s [vector] foldr1: OK
  7748. 837.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7749. 837.58 s [vector] foldr': OK
  7750. 837.59 s [vector] +++ OK, passed 100 tests.
  7751. 837.60 s [vector] foldr1': OK
  7752. 837.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7753. 837.60 s [vector] ifoldl: OK
  7754. 837.60 s [vector] +++ OK, passed 100 tests.
  7755. 837.62 s [vector] ifoldl': OK
  7756. 837.62 s [vector] +++ OK, passed 100 tests.
  7757. 837.62 s [vector] ifoldr: OK
  7758. 837.62 s [vector] +++ OK, passed 100 tests.
  7759. 837.62 s [vector] ifoldr': OK
  7760. 837.62 s [vector] +++ OK, passed 100 tests.
  7761. 837.64 s [vector] ifoldM: OK
  7762. 837.64 s [vector] +++ OK, passed 100 tests.
  7763. 837.66 s [vector] ifoldM': OK (0.01s)
  7764. 837.66 s [vector] +++ OK, passed 100 tests.
  7765. 837.70 s [vector] ifoldM_: OK (0.05s)
  7766. 837.70 s [vector] +++ OK, passed 100 tests.
  7767. 837.73 s [vector] ifoldM'_: OK (0.04s)
  7768. 837.73 s [vector] +++ OK, passed 100 tests.
  7769. 837.73 s [vector] all: OK
  7770. 837.73 s [vector] +++ OK, passed 100 tests.
  7771. 837.74 s [vector] any: OK
  7772. 837.74 s [vector] +++ OK, passed 100 tests.
  7773. 837.74 s [vector] prescanl: OK
  7774. 837.74 s [vector] +++ OK, passed 100 tests.
  7775. 837.75 s [vector] prescanl': OK
  7776. 837.75 s [vector] +++ OK, passed 100 tests.
  7777. 837.75 s [vector] postscanl: OK
  7778. 837.75 s [vector] +++ OK, passed 100 tests.
  7779. 837.77 s [vector] postscanl': OK
  7780. 837.77 s [vector] +++ OK, passed 100 tests.
  7781. 837.78 s [vector] scanl: OK
  7782. 837.78 s [vector] +++ OK, passed 100 tests.
  7783. 837.80 s [vector] scanl': OK
  7784. 837.80 s [vector] +++ OK, passed 100 tests.
  7785. 837.80 s [vector] scanl1: OK
  7786. 837.80 s [vector] +++ OK, passed 100 tests.
  7787. 837.80 s [vector] scanl1': OK
  7788. 837.80 s [vector] +++ OK, passed 100 tests.
  7789. 837.80 s [vector] iscanl: OK
  7790. 837.80 s [vector] +++ OK, passed 100 tests.
  7791. 837.81 s [vector] iscanl': OK
  7792. 837.82 s [vector] +++ OK, passed 100 tests.
  7793. 837.82 s [vector] prescanr: OK
  7794. 837.83 s [vector] +++ OK, passed 100 tests.
  7795. 837.84 s [vector] prescanr': OK
  7796. 837.84 s [vector] +++ OK, passed 100 tests.
  7797. 837.84 s [vector] postscanr: OK
  7798. 837.84 s [vector] +++ OK, passed 100 tests.
  7799. 837.84 s [vector] postscanr': OK
  7800. 837.84 s [vector] +++ OK, passed 100 tests.
  7801. 837.84 s [vector] scanr: OK
  7802. 837.84 s [vector] +++ OK, passed 100 tests.
  7803. 837.85 s [vector] scanr': OK
  7804. 837.85 s [vector] +++ OK, passed 100 tests.
  7805. 837.86 s [vector] scanr1: OK
  7806. 837.86 s [vector] +++ OK, passed 100 tests.
  7807. 837.88 s [vector] scanr1': OK
  7808. 837.88 s [vector] +++ OK, passed 100 tests.
  7809. 837.88 s [vector] iscanr: OK
  7810. 837.88 s [vector] +++ OK, passed 100 tests.
  7811. 837.89 s [vector] iscanr': OK (0.01s)
  7812. 837.89 s [vector] +++ OK, passed 100 tests.
  7813. 837.89 s [vector] mut_read: OK
  7814. 837.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7815. 837.89 s [vector] mut_write: OK
  7816. 837.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7817. 837.89 s [vector] mut_modify: OK
  7818. 837.89 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7819. 837.89 s [vector] mut_generate: OK
  7820. 837.90 s [vector] +++ OK, passed 100 tests.
  7821. 837.92 s [vector] mut_generateM: OK (0.01s)
  7822. 837.92 s [vector] +++ OK, passed 100 tests.
  7823. 837.96 s [vector] mut_mapM_: OK (0.03s)
  7824. 837.96 s [vector] +++ OK, passed 100 tests.
  7825. 837.98 s [vector] mut_imapM_: OK (0.04s)
  7826. 837.98 s [vector] +++ OK, passed 100 tests.
  7827. 838.02 s [vector] mut_forM_: OK (0.03s)
  7828. 838.02 s [vector] +++ OK, passed 100 tests.
  7829. 838.04 s [vector] mut_iforM_: OK (0.03s)
  7830. 838.04 s [vector] +++ OK, passed 100 tests.
  7831. 838.05 s [vector] mut_foldr: OK
  7832. 838.05 s [vector] +++ OK, passed 100 tests.
  7833. 838.05 s [vector] mut_foldr': OK
  7834. 838.06 s [vector] +++ OK, passed 100 tests.
  7835. 838.06 s [vector] mut_foldl: OK
  7836. 838.06 s [vector] +++ OK, passed 100 tests.
  7837. 838.06 s [vector] mut_foldl': OK
  7838. 838.07 s [vector] +++ OK, passed 100 tests.
  7839. 838.08 s [vector] mut_ifoldr: OK
  7840. 838.08 s [vector] +++ OK, passed 100 tests.
  7841. 838.09 s [vector] mut_ifoldr': OK
  7842. 838.09 s [vector] +++ OK, passed 100 tests.
  7843. 838.10 s [vector] mut_ifoldl: OK (0.01s)
  7844. 838.10 s [vector] +++ OK, passed 100 tests.
  7845. 838.10 s [vector] mut_ifoldl': OK
  7846. 838.10 s [vector] +++ OK, passed 100 tests.
  7847. 838.11 s [vector] mut_foldM: OK
  7848. 838.11 s [vector] +++ OK, passed 100 tests.
  7849. 838.12 s [vector] mut_foldM': OK
  7850. 838.12 s [vector] +++ OK, passed 100 tests.
  7851. 838.12 s [vector] mut_foldrM: OK
  7852. 838.12 s [vector] +++ OK, passed 100 tests.
  7853. 838.14 s [vector] mut_foldrM': OK
  7854. 838.14 s [vector] +++ OK, passed 100 tests.
  7855. 838.15 s [vector] mut_ifoldM: OK
  7856. 838.16 s [vector] +++ OK, passed 100 tests.
  7857. 838.16 s [vector] mut_ifoldM': OK
  7858. 838.16 s [vector] +++ OK, passed 100 tests.
  7859. 838.16 s [vector] mut_ifoldrM: OK
  7860. 838.16 s [vector] +++ OK, passed 100 tests.
  7861. 838.17 s [vector] mut_ifoldrM': OK
  7862. 838.17 s [vector] +++ OK, passed 100 tests.
  7863. 838.17 s [vector] compare: OK
  7864. 838.17 s [vector] +++ OK, passed 100 tests.
  7865. 838.17 s [vector] maximum: OK
  7866. 838.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7867. 838.17 s [vector] minimum: OK
  7868. 838.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7869. 838.17 s [vector] minIndex: OK
  7870. 838.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7871. 838.17 s [vector] maxIndex: OK
  7872. 838.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7873. 838.17 s [vector] maximumBy: OK
  7874. 838.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7875. 838.17 s [vector] minimumBy: OK
  7876. 838.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7877. 838.18 s [vector] maximumOn: OK
  7878. 838.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7879. 838.18 s [vector] minimumOn: OK
  7880. 838.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7881. 838.18 s [vector] maxIndexBy: OK
  7882. 838.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7883. 838.18 s [vector] minIndexBy: OK
  7884. 838.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7885. 838.18 s [vector] ListFirstMaxIndexWins: OK
  7886. 838.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7887. 838.18 s [vector] FalseListFirstMaxIndexWins: OK
  7888. 838.18 s [vector] +++ OK, failed as expected. (after 1 test):
  7889. 838.18 s [vector] Exception:
  7890. 838.18 s [vector] Prelude.foldr1: empty list
  7891. 838.18 s [vector] CallStack (from HasCallStack):
  7892. 838.18 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7893. 838.18 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7894. 838.18 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7895. 838.18 s [vector] []
  7896. 838.18 s [vector] zip: OK
  7897. 838.18 s [vector] +++ OK, passed 100 tests.
  7898. 838.18 s [vector] zip3: OK
  7899. 838.19 s [vector] +++ OK, passed 100 tests.
  7900. 838.19 s [vector] unzip: OK
  7901. 838.19 s [vector] +++ OK, passed 100 tests.
  7902. 838.19 s [vector] unzip3: OK
  7903. 838.19 s [vector] +++ OK, passed 100 tests.
  7904. 838.19 s [vector] indexed: OK
  7905. 838.20 s [vector] +++ OK, passed 100 tests.
  7906. 838.20 s [vector] update: OK
  7907. 838.20 s [vector] +++ OK, passed 100 tests.
  7908. 838.20 s [vector] mempty: OK
  7909. 838.20 s [vector] +++ OK, passed 100 tests.
  7910. 838.20 s [vector] mappend: OK
  7911. 838.20 s [vector] +++ OK, passed 100 tests.
  7912. 838.22 s [vector] mconcat: OK (0.02s)
  7913. 838.23 s [vector] +++ OK, passed 100 tests.
  7914. 838.23 s [vector] glength: OK
  7915. 838.23 s [vector] +++ OK, passed 100 tests.
  7916. 838.23 s [vector] sum: OK
  7917. 838.23 s [vector] +++ OK, passed 100 tests.
  7918. 838.23 s [vector] product: OK
  7919. 838.23 s [vector] +++ OK, passed 100 tests.
  7920. 838.23 s [vector] enumFromN: OK
  7921. 838.23 s [vector] +++ OK, passed 100 tests.
  7922. 838.23 s [vector] enumFromThenN: OK
  7923. 838.23 s [vector] +++ OK, passed 100 tests.
  7924. 838.23 s [vector] enumFromTo: OK
  7925. 838.23 s [vector] +++ OK, passed 100 tests.
  7926. 838.23 s [vector] enumFromThenTo: OK
  7927. 838.23 s [vector] +++ OK, passed 100 tests; 2 discarded.
  7928. 838.23 s [vector] (Double)
  7929. 838.23 s [vector] fromList.toList == id: OK
  7930. 838.23 s [vector] +++ OK, passed 100 tests.
  7931. 838.23 s [vector] toList.fromList == id: OK
  7932. 838.23 s [vector] +++ OK, passed 100 tests.
  7933. 838.23 s [vector] unstream.stream == id: OK
  7934. 838.23 s [vector] +++ OK, passed 100 tests.
  7935. 838.23 s [vector] stream.unstream == id: OK
  7936. 838.23 s [vector] +++ OK, passed 100 tests.
  7937. 838.23 s [vector] eq: OK
  7938. 838.23 s [vector] +++ OK, passed 100 tests.
  7939. 838.23 s [vector] length: OK
  7940. 838.24 s [vector] +++ OK, passed 100 tests.
  7941. 838.24 s [vector] null: OK
  7942. 838.24 s [vector] +++ OK, passed 100 tests.
  7943. 838.24 s [vector] index: OK
  7944. 838.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7945. 838.24 s [vector] safeIndex: OK
  7946. 838.24 s [vector] +++ OK, passed 100 tests.
  7947. 838.24 s [vector] head: OK
  7948. 838.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7949. 838.24 s [vector] last: OK
  7950. 838.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7951. 838.24 s [vector] unsafeIndex: OK
  7952. 838.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7953. 838.24 s [vector] unsafeHead: OK
  7954. 838.24 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7955. 838.24 s [vector] unsafeLast: OK
  7956. 838.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7957. 838.24 s [vector] slice: OK
  7958. 838.24 s [vector] +++ OK, passed 100 tests.
  7959. 838.24 s [vector] init: OK
  7960. 838.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7961. 838.24 s [vector] tail: OK
  7962. 838.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7963. 838.25 s [vector] take: OK
  7964. 838.25 s [vector] +++ OK, passed 100 tests.
  7965. 838.25 s [vector] drop: OK
  7966. 838.25 s [vector] +++ OK, passed 100 tests.
  7967. 838.25 s [vector] splitAt: OK
  7968. 838.25 s [vector] +++ OK, passed 100 tests.
  7969. 838.25 s [vector] empty: OK
  7970. 838.25 s [vector] +++ OK, passed 100 tests.
  7971. 838.25 s [vector] singleton: OK
  7972. 838.25 s [vector] +++ OK, passed 100 tests.
  7973. 838.25 s [vector] replicate: OK
  7974. 838.26 s [vector] +++ OK, passed 100 tests.
  7975. 838.26 s [vector] generate: OK
  7976. 838.26 s [vector] +++ OK, passed 100 tests.
  7977. 838.26 s [vector] iterateN: OK
  7978. 838.26 s [vector] +++ OK, passed 100 tests.
  7979. 838.29 s [vector] iterateNM: OK (0.04s)
  7980. 838.29 s [vector] +++ OK, passed 100 tests.
  7981. 838.32 s [vector] generateM: OK (0.02s)
  7982. 838.32 s [vector] +++ OK, passed 100 tests.
  7983. 838.32 s [vector] replicateM: OK
  7984. 838.32 s [vector] +++ OK, passed 100 tests.
  7985. 838.33 s [vector] create: OK
  7986. 838.33 s [vector] +++ OK, passed 100 tests.
  7987. 838.33 s [vector] createT: OK
  7988. 838.33 s [vector] +++ OK, passed 100 tests.
  7989. 838.33 s [vector] unfoldr: OK
  7990. 838.33 s [vector] +++ OK, passed 100 tests.
  7991. 838.33 s [vector] unfoldrN: OK
  7992. 838.33 s [vector] +++ OK, passed 100 tests.
  7993. 838.33 s [vector] unfoldrExactN: OK
  7994. 838.33 s [vector] +++ OK, passed 100 tests.
  7995. 838.34 s [vector] unfoldrM: OK
  7996. 838.34 s [vector] +++ OK, passed 100 tests.
  7997. 838.34 s [vector] unfoldrNM: OK
  7998. 838.34 s [vector] +++ OK, passed 100 tests.
  7999. 838.39 s [vector] unfoldrExactNM: OK (0.05s)
  8000. 838.39 s [vector] +++ OK, passed 100 tests.
  8001. 838.42 s [vector] constructN: OK (0.02s)
  8002. 838.42 s [vector] +++ OK, passed 100 tests.
  8003. 838.43 s [vector] constructrN: OK (0.01s)
  8004. 838.43 s [vector] +++ OK, passed 100 tests.
  8005. 838.43 s [vector] cons: OK
  8006. 838.43 s [vector] +++ OK, passed 100 tests.
  8007. 838.43 s [vector] snoc: OK
  8008. 838.43 s [vector] +++ OK, passed 100 tests.
  8009. 838.44 s [vector] append: OK
  8010. 838.44 s [vector] +++ OK, passed 100 tests.
  8011. 838.45 s [vector] concat: OK (0.02s)
  8012. 838.45 s [vector] +++ OK, passed 100 tests.
  8013. 838.46 s [vector] force: OK
  8014. 838.46 s [vector] +++ OK, passed 100 tests.
  8015. 838.46 s [vector] upd: OK
  8016. 838.46 s [vector] +++ OK, passed 100 tests.
  8017. 838.47 s [vector] accum: OK (0.01s)
  8018. 838.47 s [vector] +++ OK, passed 100 tests.
  8019. 838.47 s [vector] reverse: OK
  8020. 838.47 s [vector] +++ OK, passed 100 tests.
  8021. 838.48 s [vector] backpermute: OK
  8022. 838.48 s [vector] +++ OK, passed 100 tests.
  8023. 838.49 s [vector] map: OK
  8024. 838.49 s [vector] +++ OK, passed 100 tests.
  8025. 838.50 s [vector] imap: OK
  8026. 838.50 s [vector] +++ OK, passed 100 tests.
  8027. 838.50 s [vector] concatMap: OK
  8028. 838.50 s [vector] +++ OK, passed 100 tests.
  8029. 838.51 s [vector] mapM: OK
  8030. 838.52 s [vector] +++ OK, passed 100 tests.
  8031. 838.54 s [vector] mapM_: OK (0.03s)
  8032. 838.54 s [vector] +++ OK, passed 100 tests.
  8033. 838.56 s [vector] forM: OK
  8034. 838.56 s [vector] +++ OK, passed 100 tests.
  8035. 838.60 s [vector] forM_: OK (0.04s)
  8036. 838.60 s [vector] +++ OK, passed 100 tests.
  8037. 838.62 s [vector] imapM: OK (0.02s)
  8038. 838.62 s [vector] +++ OK, passed 100 tests.
  8039. 838.65 s [vector] imapM_: OK (0.04s)
  8040. 838.65 s [vector] +++ OK, passed 100 tests.
  8041. 838.65 s [vector] zipWith: OK
  8042. 838.66 s [vector] +++ OK, passed 100 tests.
  8043. 838.66 s [vector] zipWith3: OK (0.01s)
  8044. 838.66 s [vector] +++ OK, passed 100 tests.
  8045. 838.67 s [vector] izipWith: OK
  8046. 838.68 s [vector] +++ OK, passed 100 tests.
  8047. 838.69 s [vector] izipWith3: OK (0.01s)
  8048. 838.69 s [vector] +++ OK, passed 100 tests.
  8049. 838.70 s [vector] izipWithM: OK (0.01s)
  8050. 838.70 s [vector] +++ OK, passed 100 tests.
  8051. 838.73 s [vector] izipWithM_: OK (0.03s)
  8052. 838.73 s [vector] +++ OK, passed 100 tests.
  8053. 838.74 s [vector] zipWithM: OK
  8054. 838.74 s [vector] +++ OK, passed 100 tests.
  8055. 838.76 s [vector] zipWithM_: OK (0.03s)
  8056. 838.76 s [vector] +++ OK, passed 100 tests.
  8057. 838.77 s [vector] filter: OK
  8058. 838.77 s [vector] +++ OK, passed 100 tests.
  8059. 838.78 s [vector] ifilter: OK
  8060. 838.78 s [vector] +++ OK, passed 100 tests.
  8061. 838.81 s [vector] filterM: OK (0.04s)
  8062. 838.81 s [vector] +++ OK, passed 100 tests.
  8063. 838.82 s [vector] uniq: OK
  8064. 838.82 s [vector] +++ OK, passed 100 tests.
  8065. 838.83 s [vector] mapMaybe: OK
  8066. 838.83 s [vector] +++ OK, passed 100 tests.
  8067. 838.83 s [vector] imapMaybe: OK
  8068. 838.84 s [vector] +++ OK, passed 100 tests.
  8069. 838.85 s [vector] takeWhile: OK
  8070. 838.85 s [vector] +++ OK, passed 100 tests.
  8071. 838.85 s [vector] dropWhile: OK
  8072. 838.86 s [vector] +++ OK, passed 100 tests.
  8073. 838.86 s [vector] partition: OK
  8074. 838.86 s [vector] +++ OK, passed 100 tests.
  8075. 838.86 s [vector] partitionWith: OK
  8076. 838.86 s [vector] +++ OK, passed 100 tests.
  8077. 838.86 s [vector] span: OK
  8078. 838.86 s [vector] +++ OK, passed 100 tests.
  8079. 838.86 s [vector] break: OK
  8080. 838.86 s [vector] +++ OK, passed 100 tests.
  8081. 838.86 s [vector] spanR: OK
  8082. 838.87 s [vector] +++ OK, passed 100 tests.
  8083. 838.87 s [vector] breakR: OK
  8084. 838.87 s [vector] +++ OK, passed 100 tests.
  8085. 838.87 s [vector] groupBy: OK
  8086. 838.88 s [vector] +++ OK, passed 100 tests.
  8087. 838.88 s [vector] elem: OK
  8088. 838.88 s [vector] +++ OK, passed 100 tests.
  8089. 838.88 s [vector] notElem: OK
  8090. 838.88 s [vector] +++ OK, passed 100 tests.
  8091. 838.88 s [vector] find: OK
  8092. 838.88 s [vector] +++ OK, passed 100 tests.
  8093. 838.88 s [vector] findIndex: OK
  8094. 838.88 s [vector] +++ OK, passed 100 tests.
  8095. 838.88 s [vector] findIndexR: OK
  8096. 838.88 s [vector] +++ OK, passed 100 tests.
  8097. 838.88 s [vector] findIndices: OK
  8098. 838.89 s [vector] +++ OK, passed 100 tests.
  8099. 838.90 s [vector] elemIndex: OK
  8100. 838.90 s [vector] +++ OK, passed 100 tests.
  8101. 838.90 s [vector] elemIndices: OK
  8102. 838.90 s [vector] +++ OK, passed 100 tests.
  8103. 838.90 s [vector] foldl: OK (0.01s)
  8104. 838.90 s [vector] +++ OK, passed 100 tests.
  8105. 838.92 s [vector] foldl1: OK (0.01s)
  8106. 838.92 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8107. 838.92 s [vector] foldl': OK (0.01s)
  8108. 838.92 s [vector] +++ OK, passed 100 tests.
  8109. 838.93 s [vector] foldl1': OK (0.01s)
  8110. 838.93 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8111. 838.94 s [vector] foldr: OK (0.01s)
  8112. 838.94 s [vector] +++ OK, passed 100 tests.
  8113. 838.96 s [vector] foldr1: OK (0.01s)
  8114. 838.96 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8115. 838.96 s [vector] foldr': OK (0.01s)
  8116. 838.96 s [vector] +++ OK, passed 100 tests.
  8117. 838.98 s [pandoc] shrinking RPATHs of ELF executables and libraries in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
  8118. 838.98 s [vector] foldr1': OK (0.01s)
  8119. 838.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8120. 839.00 s [vector] ifoldl: OK (0.01s)
  8121. 839.00 s [vector] +++ OK, passed 100 tests.
  8122. 839.00 s [vector] ifoldl': OK (0.01s)
  8123. 839.00 s [vector] +++ OK, passed 100 tests.
  8124. 839.02 s [vector] ifoldr: OK (0.01s)
  8125. 839.02 s [vector] +++ OK, passed 100 tests.
  8126. 839.02 s [vector] ifoldr': OK (0.01s)
  8127. 839.02 s [vector] +++ OK, passed 100 tests.
  8128. 839.03 s [pandoc] checking for references to /build/ in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data...
  8129. 839.04 s [vector] ifoldM: OK (0.02s)
  8130. 839.04 s [vector] +++ OK, passed 100 tests.
  8131. 839.05 s [vector] ifoldM': OK (0.02s)
  8132. 839.05 s [vector] +++ OK, passed 100 tests.
  8133. 839.10 s [vector] ifoldM_: OK (0.02s)
  8134. 839.10 s [vector] +++ OK, passed 100 tests.
  8135. 839.11 s [pandoc] patching script interpreter paths in /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
  8136. 839.12 s [vector] ifoldM'_: OK (0.04s)
  8137. 839.12 s [vector] +++ OK, passed 100 tests.
  8138. 839.12 s [vector] all: OK
  8139. 839.12 s [vector] +++ OK, passed 100 tests.
  8140. 839.13 s [vector] any: OK
  8141. 839.13 s [vector] +++ OK, passed 100 tests.
  8142. 840.05 s [pandoc:post-build] Uploading to cachix cache "sellout": /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2 /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
  8143. 840.80 s [pandoc:post-build] Pushing 2 paths (388 are already present) using zstd to cache sellout ⏳
  8144. 840.80 s [pandoc:post-build]
  8145. 841.16 s [pandoc:post-build] Pushing /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data (918.71 KiB)
  8146. 841.24 s [pandoc:post-build] Pushing /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2 (441.74 MiB)
  8147. 845.86 s [pandoc:post-build]
  8148. 845.90 s [pandoc:post-build] All done.
  8149. 845.90 s [pandoc:post-build] Uploading to the NixCI cache: /nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2 /nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data
  8150. 845.96 s [pandoc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8151. 846.23 s [pandoc:post-build] copying 2 paths...
  8152. 846.23 s [pandoc:post-build] copying path '/nix/store/w2rhw6c0bzqn00ymcp1lcirj0kjmghml-pandoc-3.7.0.2-data' to 'https://cache.nix-ci.com'...
  8153. 846.50 s [pandoc:post-build] copying path '/nix/store/7sw50bv7p55h6yvz20z01zyzfjc28s2f-pandoc-3.7.0.2' to 'https://cache.nix-ci.com'...
  8154. 959.33 s [pandoc:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  8155. 959.62 s [pandoc:post-build] copying 1 paths...
  8156. 959.69 s [pandoc:post-build] copying path '/nix/store/b0w2wndlipmdgcg1ri7qy9im9qmq2675-pandoc-3.7.0.2.drv' to 'https://cache.nix-ci.com'...
  8157. 959.87 s Progress: 23 of 40 built (2 building), 760 of 760 downloaded from cache
  8158. 959.97 s Building /nix/store/97khgz4lrmr215dy798mkwnwd89b9kzw-pandoc-lua-engine-0.4.3.drv
  8159. 960.48 s Building /nix/store/s3jg3bgm7jkn4xv5miw4v3w05qrkza0r-pandoc-server-0.1.0.11.drv
  8160. 960.48 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 )
  8161. 960.48 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 )
  8162. 960.48 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 )
  8163. 960.48 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 )
  8164. 960.48 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 )
  8165. 960.48 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 )
  8166. 960.48 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 )
  8167. 960.48 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 )
  8168. 960.48 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 )
  8169. 960.48 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 )
  8170. 960.48 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 )
  8171. 960.48 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8172. 960.48 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8173. 960.48 s [haskell-language-server] but were not needed for compilation:
  8174. 960.48 s [haskell-language-server] - parser-combinators-1.3.0 (exposed by flag -package-id parser-combinators-1.3.0-8J13051mbtS8lMbM88xAUh)
  8175. 960.48 s [haskell-language-server] - regex-applicative-0.3.4 (exposed by flag -package-id regex-applicative-0.3.4-8kuN6xJTZ3PR3xjZLPClW)
  8176. 960.48 s [haskell-language-server]
  8177. 960.48 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 )
  8178. 960.48 s [vector] prescanl: OK (0.01s)
  8179. 960.48 s [vector] +++ OK, passed 100 tests.
  8180. 960.48 s [vector] prescanl': OK (0.01s)
  8181. 960.48 s [vector] +++ OK, passed 100 tests.
  8182. 960.48 s [vector] postscanl: OK (0.01s)
  8183. 960.48 s [vector] +++ OK, passed 100 tests.
  8184. 960.48 s [vector] postscanl': OK (0.01s)
  8185. 960.48 s [vector] +++ OK, passed 100 tests.
  8186. 960.48 s [vector] scanl: OK (0.01s)
  8187. 960.48 s [vector] +++ OK, passed 100 tests.
  8188. 960.48 s [vector] scanl': OK (0.01s)
  8189. 960.48 s [vector] +++ OK, passed 100 tests.
  8190. 960.48 s [vector] scanl1: OK (0.01s)
  8191. 960.48 s [vector] +++ OK, passed 100 tests.
  8192. 960.48 s [vector] scanl1': OK (0.02s)
  8193. 960.48 s [vector] +++ OK, passed 100 tests.
  8194. 960.48 s [vector] iscanl: OK (0.02s)
  8195. 960.48 s [vector] +++ OK, passed 100 tests.
  8196. 960.48 s [vector] iscanl': OK (0.01s)
  8197. 960.48 s [vector] +++ OK, passed 100 tests.
  8198. 960.48 s [vector] prescanr: OK (0.01s)
  8199. 960.48 s [vector] +++ OK, passed 100 tests.
  8200. 960.48 s [vector] prescanr': OK (0.01s)
  8201. 960.48 s [vector] +++ OK, passed 100 tests.
  8202. 960.48 s [vector] postscanr: OK (0.01s)
  8203. 960.48 s [vector] +++ OK, passed 100 tests.
  8204. 960.48 s [vector] postscanr': OK
  8205. 960.48 s [vector] +++ OK, passed 100 tests.
  8206. 960.48 s [vector] scanr: OK (0.01s)
  8207. 960.48 s [vector] +++ OK, passed 100 tests.
  8208. 960.48 s [vector] scanr': OK (0.01s)
  8209. 960.48 s [vector] +++ OK, passed 100 tests.
  8210. 960.48 s [vector] scanr1: OK (0.01s)
  8211. 960.48 s [vector] +++ OK, passed 100 tests.
  8212. 960.48 s [vector] scanr1': OK (0.01s)
  8213. 960.48 s [vector] +++ OK, passed 100 tests.
  8214. 960.48 s [vector] iscanr: OK (0.02s)
  8215. 960.48 s [vector] +++ OK, passed 100 tests.
  8216. 960.48 s [vector] iscanr': OK (0.01s)
  8217. 960.48 s [vector] +++ OK, passed 100 tests.
  8218. 960.48 s [vector] mut_read: OK
  8219. 960.48 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8220. 960.48 s [vector] mut_write: OK
  8221. 960.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8222. 960.48 s [vector] mut_modify: OK
  8223. 960.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8224. 960.48 s [vector] mut_generate: OK
  8225. 960.48 s [vector] +++ OK, passed 100 tests.
  8226. 960.48 s [vector] mut_generateM: OK (0.02s)
  8227. 960.48 s [vector] +++ OK, passed 100 tests.
  8228. 960.48 s [vector] mut_mapM_: OK (0.04s)
  8229. 960.48 s [vector] +++ OK, passed 100 tests.
  8230. 960.48 s [vector] mut_imapM_: OK (0.04s)
  8231. 960.48 s [vector] +++ OK, passed 100 tests.
  8232. 960.48 s [vector] mut_forM_: OK (0.04s)
  8233. 960.48 s [vector] +++ OK, passed 100 tests.
  8234. 960.48 s [vector] mut_iforM_: OK (0.06s)
  8235. 960.48 s [vector] +++ OK, passed 100 tests.
  8236. 960.48 s [vector] mut_foldr: OK
  8237. 960.48 s [vector] +++ OK, passed 100 tests.
  8238. 960.48 s [vector] mut_foldr': OK (0.01s)
  8239. 960.48 s [vector] +++ OK, passed 100 tests.
  8240. 960.48 s [vector] mut_foldl: OK (0.01s)
  8241. 960.48 s [vector] +++ OK, passed 100 tests.
  8242. 960.48 s [vector] mut_foldl': OK (0.01s)
  8243. 960.48 s [vector] +++ OK, passed 100 tests.
  8244. 960.48 s [vector] mut_ifoldr: OK (0.01s)
  8245. 960.48 s [vector] +++ OK, passed 100 tests.
  8246. 960.48 s [vector] mut_ifoldr': OK (0.01s)
  8247. 960.48 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 )
  8248. 960.48 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 )
  8249. 960.48 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 )
  8250. 960.48 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 )
  8251. 960.48 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 )
  8252. 960.48 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 )
  8253. 960.48 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 )
  8254. 960.48 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 )
  8255. 960.48 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 )
  8256. 960.48 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 )
  8257. 960.48 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 )
  8258. 960.48 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 )
  8259. 960.48 s [haskell-language-server] Preprocessing library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0...
  8260. 960.48 s [haskell-language-server] Building library 'hls-overloaded-record-dot-plugin' for haskell-language-server-2.12.0.0...
  8261. 960.48 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 )
  8262. 960.48 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 )
  8263. 960.48 s [haskell-language-server] Preprocessing library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0...
  8264. 960.48 s [haskell-language-server] Building library 'hls-pragmas-plugin' for haskell-language-server-2.12.0.0...
  8265. 960.48 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8266. 960.48 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8267. 960.48 s [haskell-language-server] but were not needed for compilation:
  8268. 960.48 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-JThhLmb5bJwLajoJSantqx)
  8269. 960.48 s [haskell-language-server] - transformers-0.6.1.1 (exposed by flag -package-id transformers-0.6.1.1-05a6)
  8270. 960.48 s [haskell-language-server]
  8271. 960.48 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 )
  8272. 960.48 s [vector] +++ OK, passed 100 tests.
  8273. 960.48 s [vector] mut_ifoldl: OK (0.01s)
  8274. 960.48 s [vector] +++ OK, passed 100 tests.
  8275. 960.48 s [vector] mut_ifoldl': OK (0.01s)
  8276. 960.48 s [vector] +++ OK, passed 100 tests.
  8277. 960.48 s [vector] mut_foldM: OK (0.01s)
  8278. 960.48 s [vector] +++ OK, passed 100 tests.
  8279. 960.48 s [vector] mut_foldM': OK (0.01s)
  8280. 960.48 s [vector] +++ OK, passed 100 tests.
  8281. 960.48 s [vector] mut_foldrM: OK (0.01s)
  8282. 960.48 s [vector] +++ OK, passed 100 tests.
  8283. 960.48 s [vector] mut_foldrM': OK (0.01s)
  8284. 960.49 s [vector] +++ OK, passed 100 tests.
  8285. 960.49 s [vector] mut_ifoldM: OK (0.01s)
  8286. 960.49 s [vector] +++ OK, passed 100 tests.
  8287. 960.49 s [vector] mut_ifoldM': OK (0.02s)
  8288. 960.49 s [vector] +++ OK, passed 100 tests.
  8289. 960.49 s [vector] mut_ifoldrM: OK (0.01s)
  8290. 960.49 s [vector] +++ OK, passed 100 tests.
  8291. 960.49 s [vector] mut_ifoldrM': OK (0.02s)
  8292. 960.49 s [vector] +++ OK, passed 100 tests.
  8293. 960.49 s [vector] compare: OK
  8294. 960.49 s [vector] +++ OK, passed 100 tests.
  8295. 960.49 s [vector] maximum: OK
  8296. 960.49 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8297. 960.49 s [vector] minimum: OK
  8298. 960.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8299. 960.49 s [vector] minIndex: OK
  8300. 960.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8301. 960.49 s [vector] maxIndex: OK
  8302. 960.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8303. 960.49 s [vector] maximumBy: OK
  8304. 960.49 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8305. 960.49 s [vector] minimumBy: OK
  8306. 960.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8307. 960.49 s [vector] maximumOn: OK
  8308. 960.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8309. 960.49 s [vector] minimumOn: OK
  8310. 960.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8311. 960.49 s [vector] maxIndexBy: OK
  8312. 960.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8313. 960.49 s [vector] minIndexBy: OK
  8314. 960.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8315. 960.49 s [vector] ListFirstMaxIndexWins: OK
  8316. 960.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8317. 960.49 s [vector] FalseListFirstMaxIndexWins: OK
  8318. 960.49 s [vector] +++ OK, failed as expected. (after 1 test):
  8319. 960.49 s [vector] Exception:
  8320. 960.49 s [vector] Prelude.foldr1: empty list
  8321. 960.49 s [vector] CallStack (from HasCallStack):
  8322. 960.49 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8323. 960.49 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8324. 960.49 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8325. 960.49 s [vector] []
  8326. 960.49 s [vector] zip: OK
  8327. 960.49 s [vector] +++ OK, passed 100 tests.
  8328. 960.49 s [vector] zip3: OK
  8329. 960.49 s [vector] +++ OK, passed 100 tests.
  8330. 960.49 s [vector] unzip: OK
  8331. 960.49 s [vector] +++ OK, passed 100 tests.
  8332. 960.49 s [vector] unzip3: OK
  8333. 960.49 s [vector] +++ OK, passed 100 tests.
  8334. 960.49 s [vector] indexed: OK
  8335. 960.49 s [vector] +++ OK, passed 100 tests.
  8336. 960.49 s [vector] update: OK
  8337. 960.49 s [vector] +++ OK, passed 100 tests.
  8338. 960.49 s [vector] mempty: OK
  8339. 960.49 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  8340. 960.49 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  8341. 960.49 s [haskell-language-server] but were not needed for compilation:
  8342. 960.49 s [haskell-language-server] - lens-aeson-1.2.3 (exposed by flag -package-id lens-aeson-1.2.3-JThhLmb5bJwLajoJSantqx)
  8343. 960.49 s [haskell-language-server] - transformers-0.6.1.1 (exposed by flag -package-id transformers-0.6.1.1-05a6)
  8344. 960.49 s [haskell-language-server]
  8345. 960.49 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 )
  8346. 960.49 s [haskell-language-server] Preprocessing executable 'ghcide-bench' for haskell-language-server-2.12.0.0...
  8347. 960.49 s [haskell-language-server] Building executable 'ghcide-bench' for haskell-language-server-2.12.0.0...
  8348. 960.49 s [haskell-language-server] [1 of 1] Compiling Main ( ghcide-bench/exe/Main.hs, dist/build/ghcide-bench/ghcide-bench-tmp/Main.dyn_o )
  8349. 960.49 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-bench/ghcide-bench
  8350. 960.49 s [haskell-language-server] Preprocessing library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0...
  8351. 960.49 s [haskell-language-server] Building library 'hls-ormolu-plugin' for haskell-language-server-2.12.0.0...
  8352. 960.49 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 )
  8353. 960.49 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 )
  8354. 960.49 s [haskell-language-server] Preprocessing library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0...
  8355. 960.49 s [haskell-language-server] Building library 'hls-explicit-fixity-plugin' for haskell-language-server-2.12.0.0...
  8356. 960.49 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 )
  8357. 960.49 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 )
  8358. 960.49 s [haskell-language-server] Preprocessing library 'hls-eval-plugin' for haskell-language-server-2.12.0.0...
  8359. 960.49 s [haskell-language-server] Building library 'hls-eval-plugin' for haskell-language-server-2.12.0.0...
  8360. 960.49 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 )
  8361. 960.49 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 )
  8362. 960.49 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 )
  8363. 960.49 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 )
  8364. 960.49 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 )
  8365. 960.49 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.o, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.dyn_o )
  8366. 960.49 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 )
  8367. 960.49 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 )
  8368. 960.49 s [vector] +++ OK, passed 100 tests.
  8369. 960.49 s [vector] mappend: OK
  8370. 960.49 s [vector] +++ OK, passed 100 tests.
  8371. 960.49 s [vector] mconcat: OK (0.03s)
  8372. 960.49 s [vector] +++ OK, passed 100 tests.
  8373. 960.49 s [vector] glength: OK
  8374. 960.49 s [vector] +++ OK, passed 100 tests.
  8375. 960.49 s [vector] sum: OK
  8376. 960.49 s [vector] +++ OK, passed 100 tests.
  8377. 960.49 s [vector] product: OK
  8378. 960.49 s [vector] +++ OK, passed 100 tests.
  8379. 960.49 s [vector] enumFromN: OK
  8380. 960.49 s [vector] +++ OK, passed 100 tests.
  8381. 960.49 s [vector] enumFromThenN: OK
  8382. 960.49 s [vector] +++ OK, passed 100 tests.
  8383. 960.49 s [vector] enumFromTo: OK
  8384. 960.49 s [vector] +++ OK, passed 100 tests.
  8385. 960.49 s [vector] enumFromThenTo: OK
  8386. 960.49 s [vector] +++ OK, passed 100 tests; 2 discarded.
  8387. 960.49 s [vector] (Int,Bool)
  8388. 960.49 s [vector] fromList.toList == id: OK
  8389. 960.49 s [vector] +++ OK, passed 100 tests.
  8390. 960.49 s [vector] toList.fromList == id: OK
  8391. 960.49 s [vector] +++ OK, passed 100 tests.
  8392. 960.49 s [vector] unstream.stream == id: OK
  8393. 960.49 s [vector] +++ OK, passed 100 tests.
  8394. 960.49 s [vector] stream.unstream == id: OK
  8395. 960.49 s [vector] +++ OK, passed 100 tests.
  8396. 960.49 s [vector] eq: OK
  8397. 960.49 s [vector] +++ OK, passed 100 tests.
  8398. 960.49 s [vector] length: OK
  8399. 960.49 s [vector] +++ OK, passed 100 tests.
  8400. 960.49 s [vector] null: OK
  8401. 960.49 s [vector] +++ OK, passed 100 tests.
  8402. 960.49 s [vector] index: OK
  8403. 960.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8404. 960.49 s [vector] safeIndex: OK
  8405. 960.49 s [vector] +++ OK, passed 100 tests.
  8406. 960.49 s [vector] head: OK
  8407. 960.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8408. 960.49 s [vector] last: OK
  8409. 960.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8410. 960.49 s [vector] unsafeIndex: OK
  8411. 960.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8412. 960.49 s [vector] unsafeHead: OK
  8413. 960.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8414. 960.49 s [vector] unsafeLast: OK
  8415. 960.49 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8416. 960.49 s [vector] slice: OK
  8417. 960.49 s [vector] +++ OK, passed 100 tests.
  8418. 960.49 s [vector] init: OK (0.01s)
  8419. 960.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8420. 960.49 s [vector] tail: OK
  8421. 960.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8422. 960.49 s [vector] take: OK
  8423. 960.49 s [vector] +++ OK, passed 100 tests.
  8424. 960.49 s [vector] drop: OK
  8425. 960.49 s [vector] +++ OK, passed 100 tests.
  8426. 960.49 s [vector] splitAt: OK
  8427. 960.49 s [vector] +++ OK, passed 100 tests.
  8428. 960.49 s [vector] empty: OK
  8429. 960.49 s [vector] +++ OK, passed 100 tests.
  8430. 960.49 s [vector] singleton: OK
  8431. 960.49 s [vector] +++ OK, passed 100 tests.
  8432. 960.49 s [vector] replicate: OK
  8433. 960.49 s [vector] +++ OK, passed 100 tests.
  8434. 960.49 s [vector] generate: OK
  8435. 960.49 s [vector] +++ OK, passed 100 tests.
  8436. 960.49 s [vector] iterateN: OK
  8437. 960.49 s [vector] +++ OK, passed 100 tests.
  8438. 960.49 s [vector] iterateNM: OK (0.03s)
  8439. 960.49 s [haskell-language-server] plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs:88:18: warning: [GHC-63394] [-Wx-partial]
  8440. 960.49 s [haskell-language-server] In the use of ‘head’
  8441. 960.49 s [haskell-language-server] (imported from Prelude, but defined in GHC.Internal.List):
  8442. 960.49 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"."
  8443. 960.49 s [haskell-language-server] |
  8444. 960.49 s [haskell-language-server] 88 | evalPrint <- head <$> runDecls ("evalPrint x = P.writeFile " <> show temp <> " (P.show x)")
  8445. 960.49 s [haskell-language-server] | ^^^^
  8446. 960.49 s [haskell-language-server]
  8447. 960.49 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 )
  8448. 960.49 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 )
  8449. 960.49 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 )
  8450. 960.49 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 )
  8451. 960.49 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 )
  8452. 960.49 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 )
  8453. 960.49 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 )
  8454. 960.49 s [haskell-language-server] [ 6 of 10] Compiling Ide.Plugin.Eval.Rules ( plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Rules.hs, dist/build/hls-eval-plugin/Ide/Plugin/Eval/Rules.p_o )
  8455. 960.49 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 )
  8456. 960.49 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 )
  8457. 960.49 s [haskell-language-server] plugins/hls-eval-plugin/src/Ide/Plugin/Eval/Code.hs:88:18: warning: [GHC-63394] [-Wx-partial]
  8458. 960.49 s [haskell-language-server] In the use of ‘head’
  8459. 960.49 s [haskell-language-server] (imported from Prelude, but defined in GHC.Internal.List):
  8460. 960.49 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"."
  8461. 960.49 s [haskell-language-server] |
  8462. 960.49 s [haskell-language-server] 88 | evalPrint <- head <$> runDecls ("evalPrint x = P.writeFile " <> show temp <> " (P.show x)")
  8463. 960.49 s [haskell-language-server] | ^^^^
  8464. 960.49 s [haskell-language-server]
  8465. 960.49 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 )
  8466. 960.49 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 )
  8467. 960.49 s [haskell-language-server] Preprocessing library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0...
  8468. 960.49 s [haskell-language-server] Building library 'hls-alternate-number-format-plugin' for haskell-language-server-2.12.0.0...
  8469. 960.49 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 )
  8470. 960.49 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 )
  8471. 960.49 s [vector] +++ OK, passed 100 tests.
  8472. 960.49 s [vector] generateM: OK (0.03s)
  8473. 960.49 s [vector] +++ OK, passed 100 tests.
  8474. 960.49 s [vector] replicateM: OK (0.01s)
  8475. 960.49 s [vector] +++ OK, passed 100 tests.
  8476. 960.49 s [vector] create: OK
  8477. 960.49 s [vector] +++ OK, passed 100 tests.
  8478. 960.49 s [vector] createT: OK
  8479. 960.49 s [vector] +++ OK, passed 100 tests.
  8480. 960.49 s [vector] unfoldr: OK
  8481. 960.49 s [vector] +++ OK, passed 100 tests.
  8482. 960.49 s [vector] unfoldrN: OK
  8483. 960.49 s [vector] +++ OK, passed 100 tests.
  8484. 960.49 s [vector] unfoldrExactN: OK
  8485. 960.49 s [vector] +++ OK, passed 100 tests.
  8486. 960.49 s [vector] unfoldrM: OK
  8487. 960.49 s [vector] +++ OK, passed 100 tests.
  8488. 960.49 s [vector] unfoldrNM: OK
  8489. 960.49 s [vector] +++ OK, passed 100 tests.
  8490. 960.49 s [vector] unfoldrExactNM: OK (0.03s)
  8491. 960.49 s [vector] +++ OK, passed 100 tests.
  8492. 960.49 s [vector] constructN: OK
  8493. 960.49 s [vector] +++ OK, passed 100 tests.
  8494. 960.49 s [vector] constructrN: OK
  8495. 960.49 s [vector] +++ OK, passed 100 tests.
  8496. 960.49 s [vector] cons: OK
  8497. 960.49 s [vector] +++ OK, passed 100 tests.
  8498. 960.49 s [vector] snoc: OK
  8499. 960.49 s [vector] +++ OK, passed 100 tests.
  8500. 960.49 s [vector] append: OK
  8501. 960.49 s [vector] +++ OK, passed 100 tests.
  8502. 960.49 s [vector] concat: OK (0.04s)
  8503. 960.49 s [vector] +++ OK, passed 100 tests.
  8504. 960.49 s [vector] force: OK
  8505. 960.49 s [vector] +++ OK, passed 100 tests.
  8506. 960.49 s [vector] upd: OK
  8507. 960.49 s [vector] +++ OK, passed 100 tests.
  8508. 960.49 s [vector] accum: OK
  8509. 960.49 s [vector] +++ OK, passed 100 tests.
  8510. 960.49 s [vector] reverse: OK
  8511. 960.49 s [vector] +++ OK, passed 100 tests.
  8512. 960.49 s [vector] backpermute: OK
  8513. 960.49 s [vector] +++ OK, passed 100 tests.
  8514. 960.49 s [vector] map: OK
  8515. 960.49 s [vector] +++ OK, passed 100 tests.
  8516. 960.49 s [vector] imap: OK
  8517. 960.49 s [vector] +++ OK, passed 100 tests.
  8518. 960.49 s [vector] concatMap: OK
  8519. 960.49 s [vector] +++ OK, passed 100 tests.
  8520. 960.49 s [vector] mapM: OK
  8521. 960.49 s [vector] +++ OK, passed 100 tests.
  8522. 960.49 s [vector] mapM_: OK (0.03s)
  8523. 960.49 s [vector] +++ OK, passed 100 tests.
  8524. 960.49 s [vector] forM: OK
  8525. 960.49 s [vector] +++ OK, passed 100 tests.
  8526. 960.49 s [vector] forM_: OK (0.03s)
  8527. 960.49 s [vector] +++ OK, passed 100 tests.
  8528. 960.49 s [vector] imapM: OK
  8529. 960.49 s [vector] +++ OK, passed 100 tests.
  8530. 960.49 s [vector] imapM_: OK (0.03s)
  8531. 960.49 s [vector] +++ OK, passed 100 tests.
  8532. 960.49 s [vector] zipWith: OK
  8533. 960.49 s [vector] +++ OK, passed 100 tests.
  8534. 960.49 s [vector] zipWith3: OK
  8535. 960.49 s [vector] +++ OK, passed 100 tests.
  8536. 960.49 s [vector] izipWith: OK
  8537. 960.49 s [vector] +++ OK, passed 100 tests.
  8538. 960.49 s [vector] izipWith3: OK
  8539. 960.49 s [vector] +++ OK, passed 100 tests.
  8540. 960.49 s [vector] izipWithM: OK
  8541. 960.49 s [vector] +++ OK, passed 100 tests.
  8542. 960.49 s [vector] izipWithM_: OK (0.02s)
  8543. 960.49 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 )
  8544. 960.49 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 )
  8545. 960.49 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 )
  8546. 960.49 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 )
  8547. 960.49 s [vector] +++ OK, passed 100 tests.
  8548. 960.49 s [vector] zipWithM: OK (0.01s)
  8549. 960.49 s [vector] +++ OK, passed 100 tests.
  8550. 960.49 s [vector] zipWithM_: OK (0.02s)
  8551. 960.49 s [vector] +++ OK, passed 100 tests.
  8552. 960.49 s [vector] filter: OK
  8553. 960.49 s [vector] +++ OK, passed 100 tests.
  8554. 960.49 s [vector] ifilter: OK
  8555. 960.49 s [vector] +++ OK, passed 100 tests.
  8556. 960.49 s [vector] filterM: OK (0.04s)
  8557. 960.49 s [vector] +++ OK, passed 100 tests.
  8558. 960.49 s [vector] uniq: OK
  8559. 960.49 s [vector] +++ OK, passed 100 tests.
  8560. 960.49 s [vector] mapMaybe: OK
  8561. 960.49 s [vector] +++ OK, passed 100 tests.
  8562. 960.49 s [vector] imapMaybe: OK
  8563. 960.49 s [vector] +++ OK, passed 100 tests.
  8564. 960.49 s [vector] takeWhile: OK
  8565. 960.49 s [vector] +++ OK, passed 100 tests.
  8566. 960.49 s [vector] dropWhile: OK
  8567. 960.49 s [vector] +++ OK, passed 100 tests.
  8568. 960.49 s [vector] partition: OK
  8569. 960.49 s [vector] +++ OK, passed 100 tests.
  8570. 960.49 s [vector] partitionWith: OK
  8571. 960.49 s [vector] +++ OK, passed 100 tests.
  8572. 960.49 s [vector] span: OK
  8573. 960.49 s [vector] +++ OK, passed 100 tests.
  8574. 960.49 s [vector] break: OK
  8575. 960.49 s [vector] +++ OK, passed 100 tests.
  8576. 960.49 s [vector] spanR: OK
  8577. 960.49 s [vector] +++ OK, passed 100 tests.
  8578. 960.49 s [vector] breakR: OK
  8579. 960.49 s [vector] +++ OK, passed 100 tests.
  8580. 960.49 s [vector] groupBy: OK
  8581. 960.49 s [vector] +++ OK, passed 100 tests.
  8582. 960.49 s [vector] elem: OK
  8583. 960.49 s [vector] +++ OK, passed 100 tests.
  8584. 960.49 s [vector] notElem: OK
  8585. 960.49 s [vector] +++ OK, passed 100 tests.
  8586. 960.49 s [vector] find: OK
  8587. 960.49 s [vector] +++ OK, passed 100 tests.
  8588. 960.49 s [vector] findIndex: OK
  8589. 960.49 s [vector] +++ OK, passed 100 tests.
  8590. 960.49 s [vector] findIndexR: OK
  8591. 960.49 s [vector] +++ OK, passed 100 tests.
  8592. 960.49 s [vector] findIndices: OK
  8593. 960.49 s [vector] +++ OK, passed 100 tests.
  8594. 960.49 s [vector] elemIndex: OK
  8595. 960.49 s [vector] +++ OK, passed 100 tests.
  8596. 960.49 s [vector] elemIndices: OK
  8597. 960.49 s [vector] +++ OK, passed 100 tests.
  8598. 960.49 s [vector] foldl: OK
  8599. 960.49 s [vector] +++ OK, passed 100 tests.
  8600. 960.49 s [vector] foldl1: OK
  8601. 960.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8602. 960.49 s [vector] foldl': OK
  8603. 960.49 s [vector] +++ OK, passed 100 tests.
  8604. 960.49 s [vector] foldl1': OK
  8605. 960.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8606. 960.49 s [vector] foldr: OK
  8607. 960.49 s [vector] +++ OK, passed 100 tests.
  8608. 960.49 s [vector] foldr1: OK
  8609. 960.49 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8610. 960.49 s [vector] foldr': OK
  8611. 960.49 s [vector] +++ OK, passed 100 tests.
  8612. 960.49 s [vector] foldr1': OK
  8613. 960.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8614. 960.49 s [vector] ifoldl: OK
  8615. 960.49 s [vector] +++ OK, passed 100 tests.
  8616. 960.49 s [vector] ifoldl': OK
  8617. 960.49 s [vector] +++ OK, passed 100 tests.
  8618. 960.49 s [vector] ifoldr: OK
  8619. 960.49 s [vector] +++ OK, passed 100 tests.
  8620. 960.49 s [vector] ifoldr': OK
  8621. 960.49 s [vector] +++ OK, passed 100 tests.
  8622. 960.49 s [vector] ifoldM: OK
  8623. 960.49 s [vector] +++ OK, passed 100 tests.
  8624. 960.49 s [vector] ifoldM': OK
  8625. 960.49 s [vector] +++ OK, passed 100 tests.
  8626. 960.49 s [vector] ifoldM_: OK (0.03s)
  8627. 960.49 s [vector] +++ OK, passed 100 tests.
  8628. 960.49 s [vector] ifoldM'_: OK (0.03s)
  8629. 960.49 s [vector] +++ OK, passed 100 tests.
  8630. 960.49 s [vector] all: OK
  8631. 960.49 s [vector] +++ OK, passed 100 tests.
  8632. 960.49 s [vector] any: OK
  8633. 960.49 s [vector] +++ OK, passed 100 tests.
  8634. 960.49 s [vector] prescanl: OK
  8635. 960.49 s [vector] +++ OK, passed 100 tests.
  8636. 960.49 s [vector] prescanl': OK
  8637. 960.50 s [vector] +++ OK, passed 100 tests.
  8638. 960.50 s [vector] postscanl: OK
  8639. 960.50 s [vector] +++ OK, passed 100 tests.
  8640. 960.50 s [vector] postscanl': OK
  8641. 960.50 s [vector] +++ OK, passed 100 tests.
  8642. 960.50 s [vector] scanl: OK
  8643. 960.50 s [vector] +++ OK, passed 100 tests.
  8644. 960.50 s [vector] scanl': OK
  8645. 960.50 s [vector] +++ OK, passed 100 tests.
  8646. 960.50 s [vector] scanl1: OK
  8647. 960.50 s [vector] +++ OK, passed 100 tests.
  8648. 960.50 s [vector] scanl1': OK
  8649. 960.50 s [vector] +++ OK, passed 100 tests.
  8650. 960.50 s [vector] iscanl: OK
  8651. 960.50 s [vector] +++ OK, passed 100 tests.
  8652. 960.50 s [vector] iscanl': OK
  8653. 960.50 s [vector] +++ OK, passed 100 tests.
  8654. 960.50 s [vector] prescanr: OK
  8655. 960.50 s [vector] +++ OK, passed 100 tests.
  8656. 960.50 s [vector] prescanr': OK
  8657. 960.50 s [vector] +++ OK, passed 100 tests.
  8658. 960.50 s [vector] postscanr: OK
  8659. 960.50 s [vector] +++ OK, passed 100 tests.
  8660. 960.50 s [vector] postscanr': OK
  8661. 960.50 s [vector] +++ OK, passed 100 tests.
  8662. 960.50 s [vector] scanr: OK
  8663. 960.50 s [vector] +++ OK, passed 100 tests.
  8664. 960.50 s [vector] scanr': OK
  8665. 960.50 s [vector] +++ OK, passed 100 tests.
  8666. 960.50 s [vector] scanr1: OK
  8667. 960.50 s [vector] +++ OK, passed 100 tests.
  8668. 960.50 s [vector] scanr1': OK
  8669. 960.50 s [vector] +++ OK, passed 100 tests.
  8670. 960.50 s [vector] iscanr: OK
  8671. 960.50 s [vector] +++ OK, passed 100 tests.
  8672. 960.50 s [vector] iscanr': OK
  8673. 960.50 s [vector] +++ OK, passed 100 tests.
  8674. 960.50 s [vector] mut_read: OK
  8675. 960.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8676. 960.50 s [vector] mut_write: OK
  8677. 960.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8678. 960.50 s [vector] mut_modify: OK
  8679. 960.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8680. 960.50 s [vector] mut_generate: OK
  8681. 960.50 s [vector] +++ OK, passed 100 tests.
  8682. 960.50 s [vector] mut_generateM: OK
  8683. 960.50 s [vector] +++ OK, passed 100 tests.
  8684. 960.50 s [vector] mut_mapM_: OK (0.03s)
  8685. 960.50 s [vector] +++ OK, passed 100 tests.
  8686. 960.50 s [vector] mut_imapM_: OK (0.03s)
  8687. 960.50 s [vector] +++ OK, passed 100 tests.
  8688. 960.50 s [vector] mut_forM_: OK (0.03s)
  8689. 960.50 s [vector] +++ OK, passed 100 tests.
  8690. 960.50 s [vector] mut_iforM_: OK (0.03s)
  8691. 960.50 s [vector] +++ OK, passed 100 tests.
  8692. 960.50 s [vector] mut_foldr: OK
  8693. 960.50 s [vector] +++ OK, passed 100 tests.
  8694. 960.50 s [vector] mut_foldr': OK
  8695. 960.50 s [vector] +++ OK, passed 100 tests.
  8696. 960.50 s [vector] mut_foldl: OK
  8697. 960.50 s [vector] +++ OK, passed 100 tests.
  8698. 960.50 s [vector] mut_foldl': OK
  8699. 960.50 s [vector] +++ OK, passed 100 tests.
  8700. 960.50 s [vector] mut_ifoldr: OK
  8701. 960.50 s [vector] +++ OK, passed 100 tests.
  8702. 960.50 s [vector] mut_ifoldr': OK
  8703. 960.50 s [vector] +++ OK, passed 100 tests.
  8704. 960.50 s [vector] mut_ifoldl: OK
  8705. 960.50 s [vector] +++ OK, passed 100 tests.
  8706. 960.50 s [vector] mut_ifoldl': OK
  8707. 960.50 s [vector] +++ OK, passed 100 tests.
  8708. 960.50 s [vector] mut_foldM: OK
  8709. 960.50 s [vector] +++ OK, passed 100 tests.
  8710. 960.50 s [vector] mut_foldM': OK
  8711. 960.50 s [vector] +++ OK, passed 100 tests.
  8712. 960.50 s [vector] mut_foldrM: OK (0.01s)
  8713. 960.50 s [vector] +++ OK, passed 100 tests.
  8714. 960.50 s [vector] mut_foldrM': OK
  8715. 960.50 s [vector] +++ OK, passed 100 tests.
  8716. 960.50 s [vector] mut_ifoldM: OK
  8717. 960.50 s [vector] +++ OK, passed 100 tests.
  8718. 960.50 s [vector] mut_ifoldM': OK
  8719. 960.50 s [vector] +++ OK, passed 100 tests.
  8720. 960.50 s [vector] mut_ifoldrM: OK
  8721. 960.50 s [vector] +++ OK, passed 100 tests.
  8722. 960.50 s [vector] mut_ifoldrM': OK
  8723. 960.50 s [vector] +++ OK, passed 100 tests.
  8724. 960.50 s [vector] compare: OK
  8725. 960.50 s [vector] +++ OK, passed 100 tests.
  8726. 960.50 s [vector] maximum: OK
  8727. 960.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8728. 960.50 s [vector] minimum: OK
  8729. 960.50 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8730. 960.50 s [vector] minIndex: OK
  8731. 960.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8732. 960.50 s [vector] maxIndex: OK
  8733. 960.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8734. 960.50 s [vector] maximumBy: OK
  8735. 960.50 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8736. 960.50 s [vector] minimumBy: OK
  8737. 960.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8738. 960.50 s [vector] maximumOn: OK
  8739. 960.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8740. 960.50 s [vector] minimumOn: OK
  8741. 960.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8742. 960.50 s [vector] maxIndexBy: OK
  8743. 960.50 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8744. 960.50 s [vector] minIndexBy: OK
  8745. 960.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8746. 960.50 s [vector] ListFirstMaxIndexWins: OK
  8747. 960.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8748. 960.50 s [vector] FalseListFirstMaxIndexWins: OK
  8749. 960.50 s [vector] +++ OK, failed as expected. (after 1 test):
  8750. 960.50 s [vector] Exception:
  8751. 960.50 s [vector] Prelude.foldr1: empty list
  8752. 960.50 s [vector] CallStack (from HasCallStack):
  8753. 960.50 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8754. 960.50 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8755. 960.50 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8756. 960.50 s [vector] []
  8757. 960.50 s [vector] zip: OK
  8758. 960.50 s [vector] +++ OK, passed 100 tests.
  8759. 960.50 s [vector] zip3: OK
  8760. 960.50 s [vector] +++ OK, passed 100 tests.
  8761. 960.50 s [vector] unzip: OK
  8762. 960.50 s [vector] +++ OK, passed 100 tests.
  8763. 960.50 s [vector] unzip3: OK
  8764. 960.50 s [vector] +++ OK, passed 100 tests.
  8765. 960.50 s [vector] indexed: OK
  8766. 960.50 s [vector] +++ OK, passed 100 tests.
  8767. 960.50 s [vector] update: OK
  8768. 960.50 s [vector] +++ OK, passed 100 tests.
  8769. 960.50 s [vector] mempty: OK
  8770. 960.50 s [vector] +++ OK, passed 100 tests.
  8771. 960.50 s [vector] mappend: OK
  8772. 960.50 s [vector] +++ OK, passed 100 tests.
  8773. 960.50 s [vector] mconcat: OK (0.05s)
  8774. 960.50 s [vector] +++ OK, passed 100 tests.
  8775. 960.50 s [vector] glength: OK
  8776. 960.50 s [vector] +++ OK, passed 100 tests.
  8777. 960.50 s [vector] (Int,Bool,Int)
  8778. 960.50 s [vector] fromList.toList == id: OK
  8779. 960.50 s [vector] +++ OK, passed 100 tests.
  8780. 960.50 s [vector] toList.fromList == id: OK
  8781. 960.50 s [vector] +++ OK, passed 100 tests.
  8782. 960.50 s [vector] unstream.stream == id: OK
  8783. 960.50 s [vector] +++ OK, passed 100 tests.
  8784. 960.50 s [vector] stream.unstream == id: OK
  8785. 960.50 s [vector] +++ OK, passed 100 tests.
  8786. 960.50 s [vector] eq: OK
  8787. 960.50 s [vector] +++ OK, passed 100 tests.
  8788. 960.50 s [vector] length: OK
  8789. 960.50 s [vector] +++ OK, passed 100 tests.
  8790. 960.50 s [vector] null: OK
  8791. 960.50 s [vector] +++ OK, passed 100 tests.
  8792. 960.50 s [vector] index: OK
  8793. 960.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8794. 960.50 s [vector] safeIndex: OK
  8795. 960.50 s [vector] +++ OK, passed 100 tests.
  8796. 960.50 s [vector] head: OK
  8797. 960.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8798. 960.50 s [vector] last: OK
  8799. 960.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8800. 960.50 s [vector] unsafeIndex: OK
  8801. 960.50 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8802. 960.50 s [vector] unsafeHead: OK
  8803. 960.50 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8804. 960.50 s [vector] unsafeLast: OK
  8805. 960.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8806. 960.50 s [vector] slice: OK
  8807. 960.50 s [vector] +++ OK, passed 100 tests.
  8808. 960.50 s [vector] init: OK
  8809. 960.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8810. 960.50 s [vector] tail: OK
  8811. 960.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8812. 960.50 s [vector] take: OK
  8813. 960.50 s [vector] +++ OK, passed 100 tests.
  8814. 960.50 s [vector] drop: OK
  8815. 960.50 s [vector] +++ OK, passed 100 tests.
  8816. 960.50 s [vector] splitAt: OK
  8817. 960.50 s [vector] +++ OK, passed 100 tests.
  8818. 960.50 s [vector] empty: OK
  8819. 960.50 s [vector] +++ OK, passed 100 tests.
  8820. 960.50 s [vector] singleton: OK
  8821. 960.50 s [vector] +++ OK, passed 100 tests.
  8822. 960.50 s [vector] replicate: OK
  8823. 960.50 s [vector] +++ OK, passed 100 tests.
  8824. 960.50 s [vector] generate: OK
  8825. 960.50 s [vector] +++ OK, passed 100 tests.
  8826. 960.50 s [vector] iterateN: OK
  8827. 960.50 s [vector] +++ OK, passed 100 tests.
  8828. 960.50 s [vector] iterateNM: OK (0.03s)
  8829. 960.50 s [vector] +++ OK, passed 100 tests.
  8830. 960.50 s [vector] generateM: OK (0.04s)
  8831. 960.50 s [vector] +++ OK, passed 100 tests.
  8832. 960.50 s [vector] replicateM: OK (0.01s)
  8833. 960.50 s [vector] +++ OK, passed 100 tests.
  8834. 960.50 s [vector] create: OK
  8835. 960.50 s [vector] +++ OK, passed 100 tests.
  8836. 960.50 s [vector] createT: OK
  8837. 960.50 s [vector] +++ OK, passed 100 tests.
  8838. 960.50 s [vector] unfoldr: OK
  8839. 960.50 s [vector] +++ OK, passed 100 tests.
  8840. 960.50 s [vector] unfoldrN: OK
  8841. 960.50 s [vector] +++ OK, passed 100 tests.
  8842. 960.50 s [vector] unfoldrExactN: OK
  8843. 960.50 s [vector] +++ OK, passed 100 tests.
  8844. 960.50 s [vector] unfoldrM: OK
  8845. 960.50 s [vector] +++ OK, passed 100 tests.
  8846. 960.50 s [vector] unfoldrNM: OK
  8847. 960.50 s [vector] +++ OK, passed 100 tests.
  8848. 960.50 s [vector] unfoldrExactNM: OK (0.06s)
  8849. 960.50 s [vector] +++ OK, passed 100 tests.
  8850. 960.50 s [vector] constructN: OK
  8851. 960.50 s [vector] +++ OK, passed 100 tests.
  8852. 960.50 s [vector] constructrN: OK (0.01s)
  8853. 960.50 s [vector] +++ OK, passed 100 tests.
  8854. 960.50 s [vector] cons: OK
  8855. 960.50 s [vector] +++ OK, passed 100 tests.
  8856. 960.50 s [vector] snoc: OK
  8857. 960.50 s [vector] +++ OK, passed 100 tests.
  8858. 960.50 s [vector] append: OK
  8859. 960.50 s [vector] +++ OK, passed 100 tests.
  8860. 960.50 s [vector] concat: OK (0.05s)
  8861. 960.50 s [vector] +++ OK, passed 100 tests.
  8862. 960.50 s [vector] force: OK
  8863. 960.50 s [vector] +++ OK, passed 100 tests.
  8864. 960.50 s [vector] upd: OK (0.02s)
  8865. 960.50 s [vector] +++ OK, passed 100 tests.
  8866. 960.50 s [vector] accum: OK (0.01s)
  8867. 960.50 s [vector] +++ OK, passed 100 tests.
  8868. 960.50 s [vector] reverse: OK
  8869. 960.50 s [vector] +++ OK, passed 100 tests.
  8870. 960.50 s [vector] backpermute: OK
  8871. 960.50 s [vector] +++ OK, passed 100 tests.
  8872. 960.50 s [vector] map: OK
  8873. 960.50 s [vector] +++ OK, passed 100 tests.
  8874. 960.50 s [vector] imap: OK
  8875. 960.50 s [vector] +++ OK, passed 100 tests.
  8876. 960.50 s [vector] concatMap: OK
  8877. 960.50 s [vector] +++ OK, passed 100 tests.
  8878. 960.50 s [vector] mapM: OK
  8879. 960.50 s [vector] +++ OK, passed 100 tests.
  8880. 960.50 s [vector] mapM_: OK (0.05s)
  8881. 960.50 s [vector] +++ OK, passed 100 tests.
  8882. 960.50 s [vector] forM: OK (0.01s)
  8883. 960.50 s [vector] +++ OK, passed 100 tests.
  8884. 960.50 s [vector] forM_: OK (0.05s)
  8885. 960.50 s [vector] +++ OK, passed 100 tests.
  8886. 960.50 s [vector] imapM: OK
  8887. 960.50 s [vector] +++ OK, passed 100 tests.
  8888. 960.50 s [vector] imapM_: OK (0.05s)
  8889. 960.50 s [vector] +++ OK, passed 100 tests.
  8890. 960.50 s [vector] zipWith: OK
  8891. 960.50 s [vector] +++ OK, passed 100 tests.
  8892. 960.50 s [vector] zipWith3: OK (0.01s)
  8893. 960.50 s [vector] +++ OK, passed 100 tests.
  8894. 960.50 s [vector] izipWith: OK (0.01s)
  8895. 960.50 s [vector] +++ OK, passed 100 tests.
  8896. 960.50 s [vector] izipWith3: OK
  8897. 960.50 s [vector] +++ OK, passed 100 tests.
  8898. 960.50 s [vector] izipWithM: OK
  8899. 960.50 s [vector] +++ OK, passed 100 tests.
  8900. 960.50 s [vector] izipWithM_: OK (0.04s)
  8901. 960.50 s [vector] +++ OK, passed 100 tests.
  8902. 960.50 s [vector] zipWithM: OK
  8903. 960.50 s [vector] +++ OK, passed 100 tests.
  8904. 960.50 s [vector] zipWithM_: OK (0.03s)
  8905. 960.50 s [vector] +++ OK, passed 100 tests.
  8906. 960.50 s [vector] filter: OK
  8907. 960.50 s [vector] +++ OK, passed 100 tests.
  8908. 960.50 s [vector] ifilter: OK
  8909. 960.50 s [vector] +++ OK, passed 100 tests.
  8910. 960.50 s [vector] filterM: OK (0.07s)
  8911. 960.50 s [vector] +++ OK, passed 100 tests.
  8912. 960.50 s [vector] uniq: OK
  8913. 960.50 s [vector] +++ OK, passed 100 tests.
  8914. 960.50 s [vector] mapMaybe: OK
  8915. 960.50 s [vector] +++ OK, passed 100 tests.
  8916. 960.50 s [vector] imapMaybe: OK
  8917. 960.50 s [vector] +++ OK, passed 100 tests.
  8918. 960.50 s [vector] takeWhile: OK
  8919. 960.50 s [vector] +++ OK, passed 100 tests.
  8920. 960.50 s [vector] dropWhile: OK
  8921. 960.50 s [vector] +++ OK, passed 100 tests.
  8922. 960.50 s [vector] partition: OK
  8923. 960.50 s [vector] +++ OK, passed 100 tests.
  8924. 960.50 s [vector] partitionWith: OK
  8925. 960.50 s [vector] +++ OK, passed 100 tests.
  8926. 960.50 s [vector] span: OK
  8927. 960.50 s [vector] +++ OK, passed 100 tests.
  8928. 960.50 s [vector] break: OK
  8929. 960.50 s [vector] +++ OK, passed 100 tests.
  8930. 960.50 s [vector] spanR: OK
  8931. 960.50 s [vector] +++ OK, passed 100 tests.
  8932. 960.50 s [vector] breakR: OK
  8933. 960.50 s [vector] +++ OK, passed 100 tests.
  8934. 960.50 s [vector] groupBy: OK
  8935. 960.50 s [vector] +++ OK, passed 100 tests.
  8936. 960.50 s [vector] elem: OK
  8937. 960.50 s [vector] +++ OK, passed 100 tests.
  8938. 960.50 s [vector] notElem: OK
  8939. 960.50 s [vector] +++ OK, passed 100 tests.
  8940. 960.50 s [vector] find: OK
  8941. 960.50 s [vector] +++ OK, passed 100 tests.
  8942. 960.50 s [vector] findIndex: OK
  8943. 960.50 s [vector] +++ OK, passed 100 tests.
  8944. 960.50 s [vector] findIndexR: OK
  8945. 960.50 s [vector] +++ OK, passed 100 tests.
  8946. 960.50 s [vector] findIndices: OK
  8947. 960.50 s [vector] +++ OK, passed 100 tests.
  8948. 960.50 s [vector] elemIndex: OK
  8949. 960.50 s [vector] +++ OK, passed 100 tests.
  8950. 960.50 s [vector] elemIndices: OK
  8951. 960.50 s [vector] +++ OK, passed 100 tests.
  8952. 960.50 s [vector] foldl: OK
  8953. 960.50 s [vector] +++ OK, passed 100 tests.
  8954. 960.50 s [vector] foldl1: OK
  8955. 960.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8956. 960.50 s [vector] foldl': OK
  8957. 960.50 s [vector] +++ OK, passed 100 tests.
  8958. 960.50 s [vector] foldl1': OK
  8959. 960.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8960. 960.50 s [vector] foldr: OK
  8961. 960.50 s [vector] +++ OK, passed 100 tests.
  8962. 960.50 s [vector] foldr1: OK
  8963. 960.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8964. 960.50 s [vector] foldr': OK
  8965. 960.50 s [vector] +++ OK, passed 100 tests.
  8966. 960.50 s [vector] foldr1': OK
  8967. 960.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8968. 960.50 s [vector] ifoldl: OK
  8969. 960.50 s [vector] +++ OK, passed 100 tests.
  8970. 960.50 s [vector] ifoldl': OK
  8971. 960.50 s [vector] +++ OK, passed 100 tests.
  8972. 960.50 s [vector] ifoldr: OK
  8973. 960.50 s [vector] +++ OK, passed 100 tests.
  8974. 960.50 s [vector] ifoldr': OK
  8975. 960.50 s [vector] +++ OK, passed 100 tests.
  8976. 960.50 s [vector] ifoldM: OK
  8977. 960.50 s [vector] +++ OK, passed 100 tests.
  8978. 960.50 s [vector] ifoldM': OK (0.01s)
  8979. 960.50 s [vector] +++ OK, passed 100 tests.
  8980. 960.50 s [vector] ifoldM_: OK (0.04s)
  8981. 960.50 s [vector] +++ OK, passed 100 tests.
  8982. 960.50 s [vector] ifoldM'_: OK (0.05s)
  8983. 960.50 s [vector] +++ OK, passed 100 tests.
  8984. 960.50 s [vector] all: OK
  8985. 960.50 s [vector] +++ OK, passed 100 tests.
  8986. 960.50 s [vector] any: OK
  8987. 960.50 s [vector] +++ OK, passed 100 tests.
  8988. 960.50 s [vector] prescanl: OK
  8989. 960.50 s [vector] +++ OK, passed 100 tests.
  8990. 960.50 s [vector] prescanl': OK
  8991. 960.50 s [vector] +++ OK, passed 100 tests.
  8992. 960.50 s [vector] postscanl: OK
  8993. 960.50 s [vector] +++ OK, passed 100 tests.
  8994. 960.50 s [vector] postscanl': OK
  8995. 960.50 s [vector] +++ OK, passed 100 tests.
  8996. 960.50 s [vector] scanl: OK
  8997. 960.50 s [vector] +++ OK, passed 100 tests.
  8998. 960.50 s [vector] scanl': OK
  8999. 960.50 s [vector] +++ OK, passed 100 tests.
  9000. 960.50 s [vector] scanl1: OK (0.01s)
  9001. 960.50 s [vector] +++ OK, passed 100 tests.
  9002. 960.50 s [vector] scanl1': OK
  9003. 960.50 s [vector] +++ OK, passed 100 tests.
  9004. 960.50 s [vector] iscanl: OK
  9005. 960.50 s [vector] +++ OK, passed 100 tests.
  9006. 960.50 s [vector] iscanl': OK (0.01s)
  9007. 960.50 s [vector] +++ OK, passed 100 tests.
  9008. 960.50 s [vector] prescanr: OK
  9009. 960.50 s [vector] +++ OK, passed 100 tests.
  9010. 960.50 s [vector] prescanr': OK
  9011. 960.50 s [vector] +++ OK, passed 100 tests.
  9012. 960.50 s [vector] postscanr: OK (0.01s)
  9013. 960.50 s [vector] +++ OK, passed 100 tests.
  9014. 960.50 s [vector] postscanr': OK
  9015. 960.50 s [vector] +++ OK, passed 100 tests.
  9016. 960.50 s [vector] scanr: OK
  9017. 960.51 s [vector] +++ OK, passed 100 tests.
  9018. 960.51 s [vector] scanr': OK
  9019. 960.51 s [vector] +++ OK, passed 100 tests.
  9020. 960.51 s [vector] scanr1: OK
  9021. 960.51 s [vector] +++ OK, passed 100 tests.
  9022. 960.51 s [vector] scanr1': OK
  9023. 960.51 s [vector] +++ OK, passed 100 tests.
  9024. 960.51 s [vector] iscanr: OK
  9025. 960.51 s [vector] +++ OK, passed 100 tests.
  9026. 960.51 s [vector] iscanr': OK
  9027. 960.51 s [vector] +++ OK, passed 100 tests.
  9028. 960.51 s [vector] mut_read: OK
  9029. 960.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9030. 960.51 s [vector] mut_write: OK
  9031. 960.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9032. 960.51 s [vector] mut_modify: OK
  9033. 960.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9034. 960.51 s [vector] mut_generate: OK
  9035. 960.51 s [vector] +++ OK, passed 100 tests.
  9036. 960.51 s [vector] mut_generateM: OK (0.03s)
  9037. 960.51 s [vector] +++ OK, passed 100 tests.
  9038. 960.51 s [vector] mut_mapM_: OK (0.05s)
  9039. 960.51 s [vector] +++ OK, passed 100 tests.
  9040. 960.51 s [vector] mut_imapM_: OK (0.05s)
  9041. 960.51 s [vector] +++ OK, passed 100 tests.
  9042. 960.51 s [vector] mut_forM_: OK (0.04s)
  9043. 960.51 s [vector] +++ OK, passed 100 tests.
  9044. 960.51 s [vector] mut_iforM_: OK (0.05s)
  9045. 960.51 s [vector] +++ OK, passed 100 tests.
  9046. 960.51 s [vector] mut_foldr: OK
  9047. 960.51 s [vector] +++ OK, passed 100 tests.
  9048. 960.51 s [vector] mut_foldr': OK
  9049. 960.51 s [vector] +++ OK, passed 100 tests.
  9050. 960.51 s [vector] mut_foldl: OK
  9051. 960.51 s [vector] +++ OK, passed 100 tests.
  9052. 960.51 s [vector] mut_foldl': OK
  9053. 960.51 s [vector] +++ OK, passed 100 tests.
  9054. 960.51 s [vector] mut_ifoldr: OK
  9055. 960.51 s [vector] +++ OK, passed 100 tests.
  9056. 960.51 s [vector] mut_ifoldr': OK
  9057. 960.51 s [vector] +++ OK, passed 100 tests.
  9058. 960.51 s [vector] mut_ifoldl: OK
  9059. 960.51 s [vector] +++ OK, passed 100 tests.
  9060. 960.51 s [vector] mut_ifoldl': OK
  9061. 960.51 s [vector] +++ OK, passed 100 tests.
  9062. 960.51 s [vector] mut_foldM: OK
  9063. 960.51 s [vector] +++ OK, passed 100 tests.
  9064. 960.51 s [vector] mut_foldM': OK
  9065. 960.51 s [vector] +++ OK, passed 100 tests.
  9066. 960.51 s [vector] mut_foldrM: OK
  9067. 960.51 s [vector] +++ OK, passed 100 tests.
  9068. 960.51 s [vector] mut_foldrM': OK
  9069. 960.51 s [vector] +++ OK, passed 100 tests.
  9070. 960.51 s [vector] mut_ifoldM: OK
  9071. 960.51 s [vector] +++ OK, passed 100 tests.
  9072. 960.51 s [vector] mut_ifoldM': OK
  9073. 960.51 s [vector] +++ OK, passed 100 tests.
  9074. 960.51 s [vector] mut_ifoldrM: OK
  9075. 960.51 s [vector] +++ OK, passed 100 tests.
  9076. 960.51 s [vector] mut_ifoldrM': OK
  9077. 960.51 s [vector] +++ OK, passed 100 tests.
  9078. 960.51 s [vector] compare: OK
  9079. 960.51 s [vector] +++ OK, passed 100 tests.
  9080. 960.51 s [vector] maximum: OK
  9081. 960.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9082. 960.51 s [vector] minimum: OK
  9083. 960.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9084. 960.51 s [vector] minIndex: OK
  9085. 960.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9086. 960.51 s [vector] maxIndex: OK
  9087. 960.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9088. 960.51 s [vector] maximumBy: OK
  9089. 960.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9090. 960.51 s [vector] minimumBy: OK
  9091. 960.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9092. 960.51 s [vector] maximumOn: OK
  9093. 960.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9094. 960.51 s [vector] minimumOn: OK
  9095. 960.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9096. 960.51 s [vector] maxIndexBy: OK
  9097. 960.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9098. 960.51 s [vector] minIndexBy: OK
  9099. 960.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9100. 960.51 s [vector] ListFirstMaxIndexWins: OK
  9101. 960.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9102. 960.51 s [vector] FalseListFirstMaxIndexWins: OK
  9103. 960.51 s [vector] +++ OK, failed as expected. (after 1 test):
  9104. 960.51 s [vector] Exception:
  9105. 960.51 s [vector] Prelude.foldr1: empty list
  9106. 960.51 s [vector] CallStack (from HasCallStack):
  9107. 960.51 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9108. 960.51 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9109. 960.51 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9110. 960.51 s [vector] []
  9111. 960.51 s [vector] zip: OK
  9112. 960.51 s [vector] +++ OK, passed 100 tests.
  9113. 960.51 s [vector] zip3: OK
  9114. 960.51 s [vector] +++ OK, passed 100 tests.
  9115. 960.51 s [vector] unzip: OK
  9116. 960.51 s [vector] +++ OK, passed 100 tests.
  9117. 960.51 s [vector] unzip3: OK (0.01s)
  9118. 960.51 s [vector] +++ OK, passed 100 tests.
  9119. 960.51 s [vector] indexed: OK
  9120. 960.51 s [vector] +++ OK, passed 100 tests.
  9121. 960.51 s [vector] update: OK
  9122. 960.51 s [vector] +++ OK, passed 100 tests.
  9123. 960.51 s [vector] mempty: OK
  9124. 960.51 s [vector] +++ OK, passed 100 tests.
  9125. 960.51 s [vector] mappend: OK
  9126. 960.51 s [vector] +++ OK, passed 100 tests.
  9127. 960.51 s [vector] mconcat: OK (0.06s)
  9128. 960.51 s [vector] +++ OK, passed 100 tests.
  9129. 960.51 s [vector] glength: OK
  9130. 960.51 s [vector] +++ OK, passed 100 tests.
  9131. 960.51 s [vector] unstream
  9132. 960.51 s [vector] unstream == vunstream (exact): OK
  9133. 960.51 s [vector] +++ OK, passed 100 tests.
  9134. 960.51 s [vector] unstream == vunstream (unknown): OK
  9135. 960.51 s [vector] +++ OK, passed 100 tests.
  9136. 960.51 s [vector] unstreamR ~= vunstream (exact): OK
  9137. 960.51 s [vector] +++ OK, passed 100 tests.
  9138. 960.51 s [vector] unstreamR ~= vunstream (unknown): OK
  9139. 960.51 s [vector] +++ OK, passed 100 tests.
  9140. 960.51 s [vector] Data.Vector.Storable.Vector Alignment
  9141. 960.51 s [vector] Aligned Double: OK
  9142. 960.51 s [vector] Aligned Int: OK
  9143. 960.51 s [vector] Regression tests
  9144. 960.51 s [vector] enumFromTo crash #188
  9145. 960.51 s [vector] Word8: OK
  9146. 960.51 s [vector] Word16: OK
  9147. 960.51 s [vector] Word32: OK
  9148. 960.51 s [vector] Word64: OK
  9149. 960.51 s [vector] Word: OK
  9150. 960.51 s [vector] Int8: OK
  9151. 960.51 s [vector] Int16: OK
  9152. 960.51 s [vector] Int32: OK
  9153. 960.51 s [vector] Int64: OK
  9154. 960.51 s [vector] Int: OK
  9155. 960.51 s [vector] Char: OK
  9156. 960.51 s [vector] Negative tests
  9157. 960.51 s [vector] slice out of bounds #257
  9158. 960.51 s [vector] Boxed
  9159. 960.51 s [vector] Negative ix: OK
  9160. 960.51 s [vector] Negative size: OK
  9161. 960.51 s [vector] Negative ix and size: OK
  9162. 960.51 s [vector] Too large ix: OK
  9163. 960.51 s [vector] Too large size: OK
  9164. 960.51 s [vector] Too large ix and size: OK
  9165. 960.51 s [vector] Overflow: OK
  9166. 960.51 s [vector] OutOfMemory: OK
  9167. 960.51 s [vector] Primitive
  9168. 960.51 s [vector] Negative ix: OK
  9169. 960.51 s [vector] Negative size: OK
  9170. 960.51 s [vector] Negative ix and size: OK
  9171. 960.51 s [vector] Too large ix: OK
  9172. 960.51 s [vector] Too large size: OK
  9173. 960.51 s [vector] Too large ix and size: OK
  9174. 960.51 s [vector] Overflow: OK
  9175. 960.51 s [vector] OutOfMemory: OK
  9176. 960.51 s [vector] Storable
  9177. 960.51 s [vector] Negative ix: OK
  9178. 960.51 s [vector] Negative size: OK
  9179. 960.51 s [vector] Negative ix and size: OK
  9180. 960.51 s [vector] Too large ix: OK
  9181. 960.51 s [vector] Too large size: OK
  9182. 960.51 s [vector] Too large ix and size: OK
  9183. 960.51 s [vector] Overflow: OK
  9184. 960.51 s [vector] OutOfMemory: OK
  9185. 960.51 s [vector] Unboxed
  9186. 960.51 s [vector] Negative ix: OK
  9187. 960.51 s [vector] Negative size: OK
  9188. 960.51 s [vector] Negative ix and size: OK
  9189. 960.51 s [vector] Too large ix: OK
  9190. 960.51 s [vector] Too large size: OK
  9191. 960.51 s [vector] Too large ix and size: OK
  9192. 960.51 s [vector] Overflow: OK
  9193. 960.51 s [vector] OutOfMemory: OK
  9194. 960.51 s [vector] take #282
  9195. 960.51 s [vector] Boxed: OK
  9196. 960.51 s [vector] Primitive: OK
  9197. 960.51 s [vector] Storable: OK
  9198. 960.51 s [vector] Unboxed: OK
  9199. 960.51 s [vector] Data.Vector
  9200. 960.51 s [vector] MonadFix: OK
  9201. 960.51 s [vector] toFromArray: OK
  9202. 960.51 s [vector] toFromArraySlice: OK
  9203. 960.51 s [vector] toFromArraySliceUnsafe: OK
  9204. 960.51 s [vector] toFromMutableArray: OK
  9205. 960.51 s [vector] Data.Vector.Mutable (Move): OK
  9206. 960.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9207. 960.51 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  9208. 960.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9209. 960.51 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  9210. 960.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9211. 960.51 s [vector] Data.Vector.Storable.Mutable (Move): OK
  9212. 960.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9213. 960.51 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.02s)
  9214. 960.51 s [vector] +++ OK, passed 100 tests.
  9215. 960.51 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  9216. 960.51 s [vector] +++ OK, passed 100 tests.
  9217. 960.51 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  9218. 960.51 s [vector] +++ OK, passed 100 tests.
  9219. 960.51 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  9220. 960.51 s [vector] +++ OK, passed 100 tests.
  9221. 960.51 s [vector]
  9222. 960.51 s [vector] All 2808 tests passed (15.05s)
  9223. 960.51 s [vector] Test suite vector-tests-O0: PASS
  9224. 960.51 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  9225. 960.51 s [vector] Test suite vector-tests-O2: RUNNING...
  9226. 960.59 s [vector] toplevel
  9227. 960.59 s [vector] Data.Vector.Fusion.Bundle
  9228. 960.59 s [vector] fromList.toList == id: OK
  9229. 960.59 s [vector] +++ OK, passed 100 tests.
  9230. 960.59 s [vector] toList.fromList == id: OK
  9231. 960.59 s [vector] +++ OK, passed 100 tests.
  9232. 960.59 s [vector] eq: OK
  9233. 960.59 s [vector] +++ OK, passed 100 tests.
  9234. 960.59 s [vector] length: OK
  9235. 960.59 s [vector] +++ OK, passed 100 tests.
  9236. 960.59 s [vector] null: OK
  9237. 960.59 s [vector] +++ OK, passed 100 tests.
  9238. 960.60 s [vector] empty: OK
  9239. 960.60 s [vector] +++ OK, passed 100 tests.
  9240. 960.60 s [vector] singleton: OK
  9241. 960.60 s [vector] +++ OK, passed 100 tests.
  9242. 960.60 s [vector] replicate: OK
  9243. 960.60 s [vector] +++ OK, passed 100 tests.
  9244. 960.60 s [vector] cons: OK
  9245. 960.60 s [vector] +++ OK, passed 100 tests.
  9246. 960.60 s [vector] snoc: OK
  9247. 960.60 s [vector] +++ OK, passed 100 tests.
  9248. 960.60 s [vector] append: OK
  9249. 960.60 s [vector] +++ OK, passed 100 tests.
  9250. 960.60 s [vector] head: OK
  9251. 960.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9252. 960.60 s [vector] last: OK
  9253. 960.60 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9254. 960.60 s [vector] index: OK
  9255. 960.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9256. 960.60 s [vector] extract: OK
  9257. 960.60 s [vector] +++ OK, passed 100 tests.
  9258. 960.60 s [vector] init: OK
  9259. 960.60 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9260. 960.60 s [vector] tail: OK
  9261. 960.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9262. 960.60 s [vector] take: OK
  9263. 960.60 s [vector] +++ OK, passed 100 tests.
  9264. 960.60 s [vector] drop: OK
  9265. 960.60 s [vector] +++ OK, passed 100 tests.
  9266. 960.61 s [vector] map: OK
  9267. 960.61 s [vector] +++ OK, passed 100 tests.
  9268. 960.61 s [vector] zipWith: OK
  9269. 960.61 s [vector] +++ OK, passed 100 tests.
  9270. 960.61 s [vector] zipWith3: OK
  9271. 960.61 s [vector] +++ OK, passed 100 tests.
  9272. 960.61 s [vector] filter: OK
  9273. 960.61 s [vector] +++ OK, passed 100 tests.
  9274. 960.61 s [vector] takeWhile: OK
  9275. 960.61 s [vector] +++ OK, passed 100 tests.
  9276. 960.61 s [vector] dropWhile: OK
  9277. 960.61 s [vector] +++ OK, passed 100 tests.
  9278. 960.61 s [vector] elem: OK
  9279. 960.61 s [vector] +++ OK, passed 100 tests.
  9280. 960.61 s [vector] notElem: OK
  9281. 960.61 s [vector] +++ OK, passed 100 tests.
  9282. 960.61 s [vector] find: OK
  9283. 960.61 s [vector] +++ OK, passed 100 tests.
  9284. 960.61 s [vector] findIndex: OK
  9285. 960.61 s [vector] +++ OK, passed 100 tests.
  9286. 960.61 s [vector] foldl: OK
  9287. 960.61 s [vector] +++ OK, passed 100 tests.
  9288. 960.61 s [vector] foldl1: OK
  9289. 960.61 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9290. 960.61 s [vector] foldl': OK
  9291. 960.61 s [vector] +++ OK, passed 100 tests.
  9292. 960.61 s [vector] foldl1': OK
  9293. 960.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9294. 960.61 s [vector] foldr: OK
  9295. 960.61 s [vector] +++ OK, passed 100 tests.
  9296. 960.61 s [vector] foldr1: OK
  9297. 960.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9298. 960.61 s [vector] prescanl: OK
  9299. 960.61 s [vector] +++ OK, passed 100 tests.
  9300. 960.61 s [vector] prescanl': OK
  9301. 960.61 s [vector] +++ OK, passed 100 tests.
  9302. 960.61 s [vector] postscanl: OK
  9303. 960.61 s [vector] +++ OK, passed 100 tests.
  9304. 960.61 s [vector] postscanl': OK
  9305. 960.61 s [vector] +++ OK, passed 100 tests.
  9306. 960.61 s [vector] scanl: OK
  9307. 960.61 s [vector] +++ OK, passed 100 tests.
  9308. 960.61 s [vector] scanl': OK
  9309. 960.61 s [vector] +++ OK, passed 100 tests.
  9310. 960.61 s [vector] scanl1: OK
  9311. 960.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9312. 960.61 s [vector] scanl1': OK
  9313. 960.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9314. 960.61 s [vector] concatMap: OK
  9315. 960.61 s [vector] +++ OK, passed 100 tests.
  9316. 960.61 s [vector] unfoldr: OK
  9317. 960.61 s [vector] +++ OK, passed 100 tests.
  9318. 960.63 s [vector] and: OK
  9319. 960.63 s [vector] +++ OK, passed 100 tests.
  9320. 960.63 s [vector] or: OK
  9321. 960.63 s [vector] +++ OK, passed 100 tests.
  9322. 960.63 s [vector] Tests.Vector.Boxed
  9323. 960.63 s [vector] Bool
  9324. 960.63 s [vector] fromList.toList == id: OK
  9325. 960.63 s [vector] +++ OK, passed 100 tests.
  9326. 960.63 s [vector] toList.fromList == id: OK
  9327. 960.63 s [vector] +++ OK, passed 100 tests.
  9328. 960.63 s [vector] unstream.stream == id: OK
  9329. 960.63 s [vector] +++ OK, passed 100 tests.
  9330. 960.63 s [vector] stream.unstream == id: OK
  9331. 960.64 s [vector] +++ OK, passed 100 tests.
  9332. 960.64 s [vector] eq: OK
  9333. 960.64 s [vector] +++ OK, passed 100 tests.
  9334. 960.64 s [vector] length: OK
  9335. 960.64 s [vector] +++ OK, passed 100 tests.
  9336. 960.64 s [vector] null: OK
  9337. 960.64 s [vector] +++ OK, passed 100 tests.
  9338. 960.64 s [vector] index: OK
  9339. 960.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9340. 960.65 s [vector] safeIndex: OK
  9341. 960.65 s [vector] +++ OK, passed 100 tests.
  9342. 960.65 s [vector] head: OK
  9343. 960.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9344. 960.65 s [vector] last: OK
  9345. 960.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9346. 960.65 s [vector] unsafeIndex: OK
  9347. 960.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9348. 960.65 s [vector] unsafeHead: OK
  9349. 960.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9350. 960.65 s [vector] unsafeLast: OK
  9351. 960.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9352. 960.65 s [vector] slice: OK
  9353. 960.65 s [vector] +++ OK, passed 100 tests.
  9354. 960.65 s [vector] init: OK
  9355. 960.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9356. 960.65 s [vector] tail: OK
  9357. 960.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9358. 960.65 s [vector] take: OK
  9359. 960.65 s [vector] +++ OK, passed 100 tests.
  9360. 960.65 s [vector] drop: OK
  9361. 960.65 s [vector] +++ OK, passed 100 tests.
  9362. 960.65 s [vector] splitAt: OK
  9363. 960.65 s [vector] +++ OK, passed 100 tests.
  9364. 960.66 s [vector] empty: OK
  9365. 960.66 s [vector] +++ OK, passed 100 tests.
  9366. 960.66 s [vector] singleton: OK
  9367. 960.66 s [vector] +++ OK, passed 100 tests.
  9368. 960.66 s [vector] replicate: OK
  9369. 960.66 s [vector] +++ OK, passed 100 tests.
  9370. 960.66 s [vector] generate: OK
  9371. 960.66 s [vector] +++ OK, passed 100 tests.
  9372. 960.66 s [vector] iterateN: OK
  9373. 960.66 s [vector] +++ OK, passed 100 tests.
  9374. 960.66 s [vector] iterateNM: OK (0.02s)
  9375. 960.66 s [vector] +++ OK, passed 100 tests.
  9376. 960.66 s [vector] generateM: OK (0.02s)
  9377. 960.66 s [vector] +++ OK, passed 100 tests.
  9378. 960.67 s [vector] replicateM: OK (0.01s)
  9379. 960.67 s [vector] +++ OK, passed 100 tests.
  9380. 960.67 s [vector] create: OK
  9381. 960.67 s [vector] +++ OK, passed 100 tests.
  9382. 960.67 s [vector] createT: OK
  9383. 960.67 s [vector] +++ OK, passed 100 tests.
  9384. 960.67 s [vector] unfoldr: OK
  9385. 960.67 s [vector] +++ OK, passed 100 tests.
  9386. 960.67 s [vector] unfoldrN: OK
  9387. 960.67 s [vector] +++ OK, passed 100 tests.
  9388. 960.67 s [vector] unfoldrExactN: OK
  9389. 960.67 s [vector] +++ OK, passed 100 tests.
  9390. 960.67 s [vector] unfoldrM: OK
  9391. 960.67 s [vector] +++ OK, passed 100 tests.
  9392. 960.67 s [vector] unfoldrNM: OK
  9393. 960.67 s [vector] +++ OK, passed 100 tests.
  9394. 960.67 s [vector] unfoldrExactNM: OK (0.02s)
  9395. 960.67 s [vector] +++ OK, passed 100 tests.
  9396. 960.67 s [vector] constructN: OK
  9397. 960.67 s [vector] +++ OK, passed 100 tests.
  9398. 960.67 s [vector] constructrN: OK
  9399. 960.67 s [vector] +++ OK, passed 100 tests.
  9400. 960.67 s [vector] cons: OK
  9401. 960.67 s [vector] +++ OK, passed 100 tests.
  9402. 960.67 s [vector] snoc: OK
  9403. 960.67 s [vector] +++ OK, passed 100 tests.
  9404. 960.67 s [vector] append: OK
  9405. 960.67 s [vector] +++ OK, passed 100 tests.
  9406. 960.67 s [vector] concat: OK
  9407. 960.67 s [vector] +++ OK, passed 100 tests.
  9408. 960.67 s [vector] force: OK
  9409. 960.67 s [vector] +++ OK, passed 100 tests.
  9410. 960.67 s [vector] upd: OK
  9411. 960.67 s [vector] +++ OK, passed 100 tests.
  9412. 960.67 s [vector] accum: OK
  9413. 960.67 s [vector] +++ OK, passed 100 tests.
  9414. 960.67 s [vector] reverse: OK
  9415. 960.67 s [vector] +++ OK, passed 100 tests.
  9416. 960.67 s [vector] backpermute: OK
  9417. 960.67 s [vector] +++ OK, passed 100 tests.
  9418. 960.67 s [vector] map: OK
  9419. 960.67 s [vector] +++ OK, passed 100 tests.
  9420. 960.67 s [vector] imap: OK
  9421. 960.67 s [vector] +++ OK, passed 100 tests.
  9422. 960.67 s [vector] concatMap: OK
  9423. 960.67 s [vector] +++ OK, passed 100 tests.
  9424. 960.67 s [vector] mapM: OK
  9425. 960.67 s [vector] +++ OK, passed 100 tests.
  9426. 960.68 s [vector] mapM_: OK
  9427. 960.68 s [vector] +++ OK, passed 100 tests.
  9428. 960.68 s [vector] forM: OK
  9429. 960.68 s [vector] +++ OK, passed 100 tests.
  9430. 960.69 s [vector] forM_: OK
  9431. 960.69 s [vector] +++ OK, passed 100 tests.
  9432. 960.70 s [vector] imapM: OK
  9433. 960.70 s [vector] +++ OK, passed 100 tests.
  9434. 960.70 s [vector] imapM_: OK
  9435. 960.70 s [vector] +++ OK, passed 100 tests.
  9436. 960.70 s [vector] zipWith: OK
  9437. 960.70 s [vector] +++ OK, passed 100 tests.
  9438. 960.70 s [vector] zipWith3: OK
  9439. 960.70 s [vector] +++ OK, passed 100 tests.
  9440. 960.70 s [vector] izipWith: OK
  9441. 960.70 s [vector] +++ OK, passed 100 tests.
  9442. 960.71 s [vector] izipWith3: OK
  9443. 960.71 s [vector] +++ OK, passed 100 tests.
  9444. 960.71 s [vector] izipWithM: OK
  9445. 960.71 s [vector] +++ OK, passed 100 tests.
  9446. 960.71 s [vector] izipWithM_: OK
  9447. 960.71 s [vector] +++ OK, passed 100 tests.
  9448. 960.72 s [vector] zipWithM: OK
  9449. 960.72 s [vector] +++ OK, passed 100 tests.
  9450. 960.73 s [vector] zipWithM_: OK
  9451. 960.73 s [vector] +++ OK, passed 100 tests.
  9452. 960.73 s [vector] filter: OK
  9453. 960.73 s [vector] +++ OK, passed 100 tests.
  9454. 960.73 s [vector] ifilter: OK
  9455. 960.73 s [vector] +++ OK, passed 100 tests.
  9456. 960.74 s [vector] filterM: OK (0.02s)
  9457. 960.74 s [vector] +++ OK, passed 100 tests.
  9458. 960.75 s [vector] uniq: OK
  9459. 960.75 s [vector] +++ OK, passed 100 tests.
  9460. 960.75 s [vector] mapMaybe: OK
  9461. 960.75 s [vector] +++ OK, passed 100 tests.
  9462. 960.75 s [vector] imapMaybe: OK
  9463. 960.75 s [vector] +++ OK, passed 100 tests.
  9464. 960.75 s [vector] takeWhile: OK
  9465. 960.75 s [vector] +++ OK, passed 100 tests.
  9466. 960.75 s [vector] dropWhile: OK
  9467. 960.75 s [vector] +++ OK, passed 100 tests.
  9468. 960.75 s [vector] partition: OK
  9469. 960.75 s [vector] +++ OK, passed 100 tests.
  9470. 960.75 s [vector] partitionWith: OK
  9471. 960.75 s [vector] +++ OK, passed 100 tests.
  9472. 960.75 s [vector] span: OK
  9473. 960.75 s [vector] +++ OK, passed 100 tests.
  9474. 960.75 s [vector] break: OK
  9475. 960.75 s [vector] +++ OK, passed 100 tests.
  9476. 960.75 s [vector] spanR: OK
  9477. 960.75 s [vector] +++ OK, passed 100 tests.
  9478. 960.75 s [vector] breakR: OK
  9479. 960.75 s [vector] +++ OK, passed 100 tests.
  9480. 960.75 s [vector] groupBy: OK
  9481. 960.75 s [vector] +++ OK, passed 100 tests.
  9482. 960.75 s [vector] elem: OK
  9483. 960.75 s [vector] +++ OK, passed 100 tests.
  9484. 960.75 s [vector] notElem: OK
  9485. 960.75 s [vector] +++ OK, passed 100 tests.
  9486. 960.75 s [vector] find: OK
  9487. 960.75 s [vector] +++ OK, passed 100 tests.
  9488. 960.76 s [vector] findIndex: OK
  9489. 960.76 s [vector] +++ OK, passed 100 tests.
  9490. 960.76 s [vector] findIndexR: OK
  9491. 960.76 s [vector] +++ OK, passed 100 tests.
  9492. 960.76 s [vector] findIndices: OK
  9493. 960.76 s [vector] +++ OK, passed 100 tests.
  9494. 960.76 s [vector] elemIndex: OK
  9495. 960.76 s [vector] +++ OK, passed 100 tests.
  9496. 960.76 s [vector] elemIndices: OK
  9497. 960.76 s [vector] +++ OK, passed 100 tests.
  9498. 960.76 s [vector] foldl: OK
  9499. 960.76 s [vector] +++ OK, passed 100 tests.
  9500. 960.76 s [vector] foldl1: OK
  9501. 960.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9502. 960.76 s [vector] foldl': OK
  9503. 960.76 s [vector] +++ OK, passed 100 tests.
  9504. 960.76 s [vector] foldl1': OK
  9505. 960.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9506. 960.76 s [vector] foldr: OK
  9507. 960.76 s [vector] +++ OK, passed 100 tests.
  9508. 960.76 s [vector] foldr1: OK
  9509. 960.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9510. 960.76 s [vector] foldr': OK
  9511. 960.76 s [vector] +++ OK, passed 100 tests.
  9512. 960.76 s [vector] foldr1': OK
  9513. 960.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9514. 960.77 s [vector] ifoldl: OK
  9515. 960.77 s [vector] +++ OK, passed 100 tests.
  9516. 960.77 s [vector] ifoldl': OK
  9517. 960.77 s [vector] +++ OK, passed 100 tests.
  9518. 960.77 s [vector] ifoldr: OK
  9519. 960.77 s [vector] +++ OK, passed 100 tests.
  9520. 960.77 s [vector] ifoldr': OK
  9521. 960.77 s [vector] +++ OK, passed 100 tests.
  9522. 960.77 s [vector] ifoldM: OK
  9523. 960.77 s [vector] +++ OK, passed 100 tests.
  9524. 960.78 s [vector] ifoldM': OK
  9525. 960.78 s [vector] +++ OK, passed 100 tests.
  9526. 960.78 s [vector] ifoldM_: OK
  9527. 960.79 s [vector] +++ OK, passed 100 tests.
  9528. 960.79 s [vector] ifoldM'_: OK
  9529. 960.79 s [vector] +++ OK, passed 100 tests.
  9530. 960.79 s [vector] all: OK
  9531. 960.79 s [vector] +++ OK, passed 100 tests.
  9532. 960.79 s [vector] any: OK
  9533. 960.79 s [vector] +++ OK, passed 100 tests.
  9534. 960.79 s [vector] prescanl: OK
  9535. 960.79 s [vector] +++ OK, passed 100 tests.
  9536. 960.79 s [vector] prescanl': OK
  9537. 960.79 s [vector] +++ OK, passed 100 tests.
  9538. 960.79 s [vector] postscanl: OK
  9539. 960.79 s [vector] +++ OK, passed 100 tests.
  9540. 960.79 s [vector] postscanl': OK
  9541. 960.79 s [vector] +++ OK, passed 100 tests.
  9542. 960.79 s [vector] scanl: OK
  9543. 960.80 s [vector] +++ OK, passed 100 tests.
  9544. 960.80 s [vector] scanl': OK
  9545. 960.80 s [vector] +++ OK, passed 100 tests.
  9546. 960.80 s [vector] scanl1: OK
  9547. 960.80 s [vector] +++ OK, passed 100 tests.
  9548. 960.80 s [vector] scanl1': OK
  9549. 960.80 s [vector] +++ OK, passed 100 tests.
  9550. 960.80 s [vector] iscanl: OK
  9551. 960.80 s [vector] +++ OK, passed 100 tests.
  9552. 960.80 s [vector] iscanl': OK
  9553. 960.80 s [vector] +++ OK, passed 100 tests.
  9554. 960.80 s [vector] prescanr: OK
  9555. 960.80 s [vector] +++ OK, passed 100 tests.
  9556. 960.80 s [vector] prescanr': OK
  9557. 960.80 s [vector] +++ OK, passed 100 tests.
  9558. 960.80 s [vector] postscanr: OK
  9559. 960.80 s [vector] +++ OK, passed 100 tests.
  9560. 960.80 s [vector] postscanr': OK
  9561. 960.80 s [vector] +++ OK, passed 100 tests.
  9562. 960.80 s [vector] scanr: OK
  9563. 960.80 s [vector] +++ OK, passed 100 tests.
  9564. 960.81 s [vector] scanr': OK
  9565. 960.81 s [vector] +++ OK, passed 100 tests.
  9566. 960.81 s [vector] scanr1: OK
  9567. 960.81 s [vector] +++ OK, passed 100 tests.
  9568. 960.81 s [vector] scanr1': OK
  9569. 960.81 s [vector] +++ OK, passed 100 tests.
  9570. 960.81 s [vector] iscanr: OK
  9571. 960.81 s [vector] +++ OK, passed 100 tests.
  9572. 960.81 s [vector] iscanr': OK
  9573. 960.81 s [vector] +++ OK, passed 100 tests.
  9574. 960.81 s [vector] mut_read: OK
  9575. 960.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9576. 960.81 s [vector] mut_write: OK
  9577. 960.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9578. 960.81 s [vector] mut_modify: OK
  9579. 960.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9580. 960.82 s [vector] mut_generate: OK
  9581. 960.82 s [vector] +++ OK, passed 100 tests.
  9582. 960.82 s [vector] mut_generateM: OK
  9583. 960.82 s [vector] +++ OK, passed 100 tests.
  9584. 960.82 s [vector] mut_mapM_: OK
  9585. 960.82 s [vector] +++ OK, passed 100 tests.
  9586. 960.83 s [vector] mut_imapM_: OK
  9587. 960.83 s [vector] +++ OK, passed 100 tests.
  9588. 960.84 s [vector] mut_forM_: OK
  9589. 960.84 s [vector] +++ OK, passed 100 tests.
  9590. 960.85 s [vector] mut_iforM_: OK
  9591. 960.85 s [vector] +++ OK, passed 100 tests.
  9592. 960.85 s [vector] mut_foldr: OK
  9593. 960.85 s [vector] +++ OK, passed 100 tests.
  9594. 960.85 s [vector] mut_foldr': OK
  9595. 960.85 s [vector] +++ OK, passed 100 tests.
  9596. 960.85 s [vector] mut_foldl: OK
  9597. 960.86 s [vector] +++ OK, passed 100 tests.
  9598. 960.86 s [vector] mut_foldl': OK
  9599. 960.86 s [vector] +++ OK, passed 100 tests.
  9600. 960.86 s [vector] mut_ifoldr: OK
  9601. 960.86 s [vector] +++ OK, passed 100 tests.
  9602. 960.86 s [vector] mut_ifoldr': OK
  9603. 960.86 s [vector] +++ OK, passed 100 tests.
  9604. 960.86 s [vector] mut_ifoldl: OK
  9605. 960.86 s [vector] +++ OK, passed 100 tests.
  9606. 960.86 s [vector] mut_ifoldl': OK
  9607. 960.86 s [vector] +++ OK, passed 100 tests.
  9608. 960.86 s [vector] mut_foldM: OK
  9609. 960.86 s [vector] +++ OK, passed 100 tests.
  9610. 960.86 s [vector] mut_foldM': OK
  9611. 960.86 s [vector] +++ OK, passed 100 tests.
  9612. 960.86 s [vector] mut_foldrM: OK
  9613. 960.86 s [vector] +++ OK, passed 100 tests.
  9614. 960.86 s [vector] mut_foldrM': OK
  9615. 960.86 s [vector] +++ OK, passed 100 tests.
  9616. 960.86 s [vector] mut_ifoldM: OK
  9617. 960.86 s [vector] +++ OK, passed 100 tests.
  9618. 960.87 s [vector] mut_ifoldM': OK
  9619. 960.87 s [vector] +++ OK, passed 100 tests.
  9620. 960.87 s [vector] mut_ifoldrM: OK
  9621. 960.87 s [vector] +++ OK, passed 100 tests.
  9622. 960.87 s [vector] mut_ifoldrM': OK
  9623. 960.87 s [vector] +++ OK, passed 100 tests.
  9624. 960.87 s [vector] compare: OK
  9625. 960.87 s [vector] +++ OK, passed 100 tests.
  9626. 960.87 s [vector] maximum: OK
  9627. 960.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9628. 960.87 s [vector] minimum: OK
  9629. 960.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9630. 960.87 s [vector] minIndex: OK
  9631. 960.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9632. 960.87 s [vector] maxIndex: OK
  9633. 960.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9634. 960.87 s [vector] maximumBy: OK
  9635. 960.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9636. 960.87 s [vector] minimumBy: OK
  9637. 960.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9638. 960.87 s [vector] maximumOn: OK
  9639. 960.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9640. 960.87 s [vector] minimumOn: OK
  9641. 960.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9642. 960.87 s [vector] maxIndexBy: OK
  9643. 960.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9644. 960.87 s [vector] minIndexBy: OK
  9645. 960.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9646. 960.87 s [vector] ListFirstMaxIndexWins: OK
  9647. 960.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9648. 960.87 s [vector] FalseListFirstMaxIndexWins: OK
  9649. 960.87 s [vector] +++ OK, failed as expected. (after 1 test):
  9650. 960.87 s [vector] Exception:
  9651. 960.87 s [vector] Prelude.foldr1: empty list
  9652. 960.87 s [vector] CallStack (from HasCallStack):
  9653. 960.87 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9654. 960.87 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9655. 960.87 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9656. 960.87 s [vector] []
  9657. 960.87 s [vector] zip: OK
  9658. 960.87 s [vector] +++ OK, passed 100 tests.
  9659. 960.87 s [vector] zip3: OK
  9660. 960.87 s [vector] +++ OK, passed 100 tests.
  9661. 960.87 s [vector] unzip: OK
  9662. 960.88 s [vector] +++ OK, passed 100 tests.
  9663. 960.88 s [vector] unzip3: OK
  9664. 960.88 s [vector] +++ OK, passed 100 tests.
  9665. 960.88 s [vector] indexed: OK
  9666. 960.88 s [vector] +++ OK, passed 100 tests.
  9667. 960.88 s [vector] update: OK
  9668. 960.88 s [vector] +++ OK, passed 100 tests.
  9669. 960.88 s [vector] concat: OK
  9670. 960.88 s [vector] +++ OK, passed 100 tests.
  9671. 960.88 s [vector] mempty: OK
  9672. 960.88 s [vector] +++ OK, passed 100 tests.
  9673. 960.88 s [vector] mappend: OK
  9674. 960.88 s [vector] +++ OK, passed 100 tests.
  9675. 960.89 s [vector] mconcat: OK
  9676. 960.89 s [vector] +++ OK, passed 100 tests.
  9677. 960.90 s [vector] fmap: OK
  9678. 960.90 s [vector] +++ OK, passed 100 tests.
  9679. 960.90 s [vector] return: OK
  9680. 960.90 s [vector] +++ OK, passed 100 tests.
  9681. 960.90 s [vector] bind: OK
  9682. 960.90 s [vector] +++ OK, passed 100 tests.
  9683. 960.90 s [vector] mzip: OK
  9684. 960.90 s [vector] +++ OK, passed 100 tests.
  9685. 960.90 s [vector] munzip: OK
  9686. 960.90 s [vector] +++ OK, passed 100 tests.
  9687. 960.90 s [vector] applicative_pure: OK
  9688. 960.90 s [vector] +++ OK, passed 100 tests.
  9689. 960.91 s [vector] applicative_appl: OK (0.01s)
  9690. 960.91 s [vector] +++ OK, passed 100 tests.
  9691. 960.91 s [vector] alternative_empty: OK
  9692. 960.91 s [vector] +++ OK, passed 100 tests.
  9693. 960.92 s [pandoc-lua-engine] Phase: setupCompilerEnvironmentPhase
  9694. 960.92 s [pandoc-lua-engine] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  9695. 960.92 s [vector] alternative_or: OK
  9696. 960.92 s [vector] +++ OK, passed 100 tests.
  9697. 960.94 s [vector] sequence: OK (0.03s)
  9698. 960.94 s [vector] +++ OK, passed 100 tests.
  9699. 960.94 s [vector] sequence_: OK
  9700. 960.94 s [vector] +++ OK, passed 100 tests.
  9701. 960.94 s [vector] glength: OK
  9702. 960.94 s [vector] +++ OK, passed 100 tests.
  9703. 960.94 s [vector] and: OK
  9704. 960.94 s [vector] +++ OK, passed 100 tests.
  9705. 960.95 s [vector] or: OK
  9706. 960.95 s [vector] +++ OK, passed 100 tests.
  9707. 960.95 s [vector] Int
  9708. 960.95 s [vector] fromList.toList == id: OK
  9709. 960.95 s [vector] +++ OK, passed 100 tests.
  9710. 960.95 s [vector] toList.fromList == id: OK
  9711. 960.95 s [vector] +++ OK, passed 100 tests.
  9712. 960.95 s [vector] unstream.stream == id: OK
  9713. 960.95 s [vector] +++ OK, passed 100 tests.
  9714. 960.95 s [vector] stream.unstream == id: OK
  9715. 960.95 s [vector] +++ OK, passed 100 tests.
  9716. 960.95 s [vector] eq: OK
  9717. 960.95 s [vector] +++ OK, passed 100 tests.
  9718. 960.95 s [vector] length: OK
  9719. 960.95 s [vector] +++ OK, passed 100 tests.
  9720. 960.95 s [vector] null: OK
  9721. 960.95 s [vector] +++ OK, passed 100 tests.
  9722. 960.95 s [vector] index: OK
  9723. 960.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9724. 960.95 s [vector] safeIndex: OK
  9725. 960.95 s [vector] +++ OK, passed 100 tests.
  9726. 960.95 s [vector] head: OK
  9727. 960.95 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9728. 960.95 s [vector] last: OK
  9729. 960.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9730. 960.95 s [vector] unsafeIndex: OK
  9731. 960.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9732. 960.95 s [vector] unsafeHead: OK
  9733. 960.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9734. 960.95 s [vector] unsafeLast: OK
  9735. 960.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9736. 960.95 s [vector] slice: OK
  9737. 960.95 s [vector] +++ OK, passed 100 tests.
  9738. 960.95 s [vector] init: OK
  9739. 960.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9740. 960.95 s [vector] tail: OK
  9741. 960.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9742. 960.95 s [vector] take: OK
  9743. 960.95 s [vector] +++ OK, passed 100 tests.
  9744. 960.95 s [vector] drop: OK
  9745. 960.95 s [vector] +++ OK, passed 100 tests.
  9746. 960.95 s [vector] splitAt: OK
  9747. 960.95 s [vector] +++ OK, passed 100 tests.
  9748. 960.95 s [vector] empty: OK
  9749. 960.95 s [vector] +++ OK, passed 100 tests.
  9750. 960.95 s [vector] singleton: OK
  9751. 960.95 s [vector] +++ OK, passed 100 tests.
  9752. 960.95 s [vector] replicate: OK
  9753. 960.95 s [vector] +++ OK, passed 100 tests.
  9754. 960.95 s [vector] generate: OK
  9755. 960.95 s [vector] +++ OK, passed 100 tests.
  9756. 960.96 s [vector] iterateN: OK
  9757. 960.96 s [vector] +++ OK, passed 100 tests.
  9758. 960.98 s [vector] iterateNM: OK (0.02s)
  9759. 960.98 s [vector] +++ OK, passed 100 tests.
  9760. 961.00 s [vector] generateM: OK (0.02s)
  9761. 961.00 s [vector] +++ OK, passed 100 tests.
  9762. 961.00 s [vector] replicateM: OK (0.01s)
  9763. 961.00 s [vector] +++ OK, passed 100 tests.
  9764. 961.00 s [vector] create: OK
  9765. 961.00 s [vector] +++ OK, passed 100 tests.
  9766. 961.01 s [vector] createT: OK
  9767. 961.01 s [vector] +++ OK, passed 100 tests.
  9768. 961.01 s [vector] unfoldr: OK
  9769. 961.01 s [vector] +++ OK, passed 100 tests.
  9770. 961.01 s [vector] unfoldrN: OK
  9771. 961.01 s [vector] +++ OK, passed 100 tests.
  9772. 961.01 s [vector] unfoldrExactN: OK
  9773. 961.01 s [vector] +++ OK, passed 100 tests.
  9774. 961.01 s [vector] unfoldrM: OK
  9775. 961.01 s [vector] +++ OK, passed 100 tests.
  9776. 961.01 s [vector] unfoldrNM: OK
  9777. 961.02 s [vector] +++ OK, passed 100 tests.
  9778. 961.03 s [vector] unfoldrExactNM: OK (0.02s)
  9779. 961.03 s [vector] +++ OK, passed 100 tests.
  9780. 961.03 s [vector] constructN: OK
  9781. 961.03 s [vector] +++ OK, passed 100 tests.
  9782. 961.03 s [vector] constructrN: OK
  9783. 961.03 s [vector] +++ OK, passed 100 tests.
  9784. 961.03 s [vector] cons: OK
  9785. 961.03 s [vector] +++ OK, passed 100 tests.
  9786. 961.04 s [vector] snoc: OK
  9787. 961.04 s [vector] +++ OK, passed 100 tests.
  9788. 961.04 s [vector] append: OK
  9789. 961.04 s [vector] +++ OK, passed 100 tests.
  9790. 961.05 s [vector] concat: OK (0.01s)
  9791. 961.05 s [vector] +++ OK, passed 100 tests.
  9792. 961.05 s [vector] force: OK
  9793. 961.05 s [vector] +++ OK, passed 100 tests.
  9794. 961.05 s [vector] upd: OK
  9795. 961.05 s [vector] +++ OK, passed 100 tests.
  9796. 961.05 s [vector] accum: OK
  9797. 961.05 s [vector] +++ OK, passed 100 tests.
  9798. 961.05 s [vector] reverse: OK
  9799. 961.05 s [vector] +++ OK, passed 100 tests.
  9800. 961.05 s [vector] backpermute: OK
  9801. 961.06 s [vector] +++ OK, passed 100 tests.
  9802. 961.06 s [vector] map: OK
  9803. 961.06 s [vector] +++ OK, passed 100 tests.
  9804. 961.06 s [vector] imap: OK
  9805. 961.06 s [vector] +++ OK, passed 100 tests.
  9806. 961.06 s [vector] concatMap: OK
  9807. 961.06 s [vector] +++ OK, passed 100 tests.
  9808. 961.06 s [vector] mapM: OK
  9809. 961.06 s [vector] +++ OK, passed 100 tests.
  9810. 961.08 s [vector] mapM_: OK (0.01s)
  9811. 961.08 s [vector] +++ OK, passed 100 tests.
  9812. 961.09 s [vector] forM: OK
  9813. 961.09 s [vector] +++ OK, passed 100 tests.
  9814. 961.09 s [vector] forM_: OK (0.01s)
  9815. 961.09 s [vector] +++ OK, passed 100 tests.
  9816. 961.09 s [vector] imapM: OK
  9817. 961.10 s [vector] +++ OK, passed 100 tests.
  9818. 961.11 s [vector] imapM_: OK (0.02s)
  9819. 961.11 s [vector] +++ OK, passed 100 tests.
  9820. 961.11 s [vector] zipWith: OK
  9821. 961.11 s [vector] +++ OK, passed 100 tests.
  9822. 961.11 s [vector] zipWith3: OK
  9823. 961.11 s [pandoc-server] Phase: setupCompilerEnvironmentPhase
  9824. 961.11 s [vector] +++ OK, passed 100 tests.
  9825. 961.12 s [vector] izipWith: OK
  9826. 961.12 s [vector] +++ OK, passed 100 tests.
  9827. 961.12 s [pandoc-server] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  9828. 961.12 s [vector] izipWith3: OK
  9829. 961.12 s [vector] +++ OK, passed 100 tests.
  9830. 961.12 s [vector] izipWithM: OK
  9831. 961.12 s [vector] +++ OK, passed 100 tests.
  9832. 961.13 s [vector] izipWithM_: OK
  9833. 961.14 s [vector] +++ OK, passed 100 tests.
  9834. 961.14 s [vector] zipWithM: OK
  9835. 961.14 s [vector] +++ OK, passed 100 tests.
  9836. 961.14 s [vector] zipWithM_: OK
  9837. 961.14 s [vector] +++ OK, passed 100 tests.
  9838. 961.14 s [vector] filter: OK
  9839. 961.14 s [vector] +++ OK, passed 100 tests.
  9840. 961.15 s [vector] ifilter: OK
  9841. 961.15 s [vector] +++ OK, passed 100 tests.
  9842. 961.17 s [vector] filterM: OK (0.02s)
  9843. 961.17 s [vector] +++ OK, passed 100 tests.
  9844. 961.17 s [vector] uniq: OK
  9845. 961.17 s [vector] +++ OK, passed 100 tests.
  9846. 961.17 s [vector] mapMaybe: OK
  9847. 961.17 s [vector] +++ OK, passed 100 tests.
  9848. 961.17 s [vector] imapMaybe: OK
  9849. 961.17 s [vector] +++ OK, passed 100 tests.
  9850. 961.17 s [vector] takeWhile: OK
  9851. 961.17 s [vector] +++ OK, passed 100 tests.
  9852. 961.18 s [vector] dropWhile: OK
  9853. 961.18 s [vector] +++ OK, passed 100 tests.
  9854. 961.18 s [vector] partition: OK
  9855. 961.18 s [vector] +++ OK, passed 100 tests.
  9856. 961.18 s [vector] partitionWith: OK
  9857. 961.18 s [vector] +++ OK, passed 100 tests.
  9858. 961.18 s [vector] span: OK
  9859. 961.18 s [vector] +++ OK, passed 100 tests.
  9860. 961.18 s [vector] break: OK
  9861. 961.18 s [vector] +++ OK, passed 100 tests.
  9862. 961.18 s [vector] spanR: OK
  9863. 961.18 s [vector] +++ OK, passed 100 tests.
  9864. 961.18 s [vector] breakR: OK
  9865. 961.18 s [vector] +++ OK, passed 100 tests.
  9866. 961.18 s [vector] groupBy: OK
  9867. 961.18 s [vector] +++ OK, passed 100 tests.
  9868. 961.18 s [vector] elem: OK
  9869. 961.18 s [vector] +++ OK, passed 100 tests.
  9870. 961.18 s [vector] notElem: OK
  9871. 961.18 s [vector] +++ OK, passed 100 tests.
  9872. 961.19 s [vector] find: OK
  9873. 961.19 s [vector] +++ OK, passed 100 tests.
  9874. 961.19 s [vector] findIndex: OK
  9875. 961.19 s [vector] +++ OK, passed 100 tests.
  9876. 961.19 s [vector] findIndexR: OK
  9877. 961.19 s [vector] +++ OK, passed 100 tests.
  9878. 961.19 s [vector] findIndices: OK
  9879. 961.19 s [vector] +++ OK, passed 100 tests.
  9880. 961.19 s [vector] elemIndex: OK
  9881. 961.19 s [vector] +++ OK, passed 100 tests.
  9882. 961.19 s [vector] elemIndices: OK
  9883. 961.19 s [vector] +++ OK, passed 100 tests.
  9884. 961.19 s [vector] foldl: OK
  9885. 961.19 s [vector] +++ OK, passed 100 tests.
  9886. 961.19 s [vector] foldl1: OK
  9887. 961.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9888. 961.19 s [vector] foldl': OK
  9889. 961.20 s [vector] +++ OK, passed 100 tests.
  9890. 961.20 s [vector] foldl1': OK
  9891. 961.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9892. 961.20 s [vector] foldr: OK
  9893. 961.20 s [vector] +++ OK, passed 100 tests.
  9894. 961.20 s [vector] foldr1: OK
  9895. 961.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9896. 961.20 s [vector] foldr': OK
  9897. 961.20 s [vector] +++ OK, passed 100 tests.
  9898. 961.21 s [vector] foldr1': OK
  9899. 961.21 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9900. 961.21 s [vector] ifoldl: OK
  9901. 961.22 s [vector] +++ OK, passed 100 tests.
  9902. 961.22 s [vector] ifoldl': OK
  9903. 961.22 s [vector] +++ OK, passed 100 tests.
  9904. 961.22 s [vector] ifoldr: OK
  9905. 961.22 s [vector] +++ OK, passed 100 tests.
  9906. 961.22 s [vector] ifoldr': OK
  9907. 961.22 s [vector] +++ OK, passed 100 tests.
  9908. 961.22 s [vector] ifoldM: OK
  9909. 961.22 s [vector] +++ OK, passed 100 tests.
  9910. 961.22 s [vector] ifoldM': OK
  9911. 961.22 s [vector] +++ OK, passed 100 tests.
  9912. 961.24 s [vector] ifoldM_: OK (0.02s)
  9913. 961.24 s [vector] +++ OK, passed 100 tests.
  9914. 961.25 s [vector] ifoldM'_: OK (0.01s)
  9915. 961.25 s [vector] +++ OK, passed 100 tests.
  9916. 961.25 s [vector] all: OK
  9917. 961.25 s [vector] +++ OK, passed 100 tests.
  9918. 961.25 s [vector] any: OK
  9919. 961.26 s [vector] +++ OK, passed 100 tests.
  9920. 961.26 s [vector] prescanl: OK
  9921. 961.26 s [vector] +++ OK, passed 100 tests.
  9922. 961.26 s [vector] prescanl': OK
  9923. 961.26 s [vector] +++ OK, passed 100 tests.
  9924. 961.26 s [vector] postscanl: OK
  9925. 961.26 s [vector] +++ OK, passed 100 tests.
  9926. 961.26 s [vector] postscanl': OK
  9927. 961.26 s [vector] +++ OK, passed 100 tests.
  9928. 961.27 s [vector] scanl: OK
  9929. 961.27 s [vector] +++ OK, passed 100 tests.
  9930. 961.27 s [vector] scanl': OK
  9931. 961.27 s [vector] +++ OK, passed 100 tests.
  9932. 961.27 s [vector] scanl1: OK
  9933. 961.27 s [vector] +++ OK, passed 100 tests.
  9934. 961.27 s [vector] scanl1': OK
  9935. 961.27 s [vector] +++ OK, passed 100 tests.
  9936. 961.28 s [vector] iscanl: OK
  9937. 961.28 s [vector] +++ OK, passed 100 tests.
  9938. 961.28 s [vector] iscanl': OK
  9939. 961.28 s [vector] +++ OK, passed 100 tests.
  9940. 961.28 s [vector] prescanr: OK
  9941. 961.28 s [vector] +++ OK, passed 100 tests.
  9942. 961.29 s [vector] prescanr': OK
  9943. 961.29 s [vector] +++ OK, passed 100 tests.
  9944. 961.29 s [vector] postscanr: OK
  9945. 961.29 s [vector] +++ OK, passed 100 tests.
  9946. 961.29 s [vector] postscanr': OK
  9947. 961.29 s [vector] +++ OK, passed 100 tests.
  9948. 961.29 s [vector] scanr: OK
  9949. 961.29 s [vector] +++ OK, passed 100 tests.
  9950. 961.30 s [vector] scanr': OK
  9951. 961.30 s [vector] +++ OK, passed 100 tests.
  9952. 961.30 s [vector] scanr1: OK
  9953. 961.30 s [vector] +++ OK, passed 100 tests.
  9954. 961.30 s [vector] scanr1': OK
  9955. 961.30 s [vector] +++ OK, passed 100 tests.
  9956. 961.30 s [vector] iscanr: OK
  9957. 961.30 s [vector] +++ OK, passed 100 tests.
  9958. 961.30 s [vector] iscanr': OK
  9959. 961.30 s [vector] +++ OK, passed 100 tests.
  9960. 961.30 s [vector] mut_read: OK
  9961. 961.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9962. 961.30 s [vector] mut_write: OK
  9963. 961.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9964. 961.31 s [vector] mut_modify: OK
  9965. 961.32 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9966. 961.32 s [vector] mut_generate: OK
  9967. 961.32 s [vector] +++ OK, passed 100 tests.
  9968. 961.32 s [vector] mut_generateM: OK
  9969. 961.32 s [vector] +++ OK, passed 100 tests.
  9970. 961.34 s [vector] mut_mapM_: OK (0.02s)
  9971. 961.34 s [vector] +++ OK, passed 100 tests.
  9972. 961.34 s [vector] mut_imapM_: OK (0.01s)
  9973. 961.35 s [vector] +++ OK, passed 100 tests.
  9974. 961.36 s [vector] mut_forM_: OK (0.02s)
  9975. 961.36 s [vector] +++ OK, passed 100 tests.
  9976. 961.38 s [vector] mut_iforM_: OK (0.02s)
  9977. 961.38 s [vector] +++ OK, passed 100 tests.
  9978. 961.38 s [vector] mut_foldr: OK
  9979. 961.38 s [vector] +++ OK, passed 100 tests.
  9980. 961.38 s [vector] mut_foldr': OK
  9981. 961.38 s [vector] +++ OK, passed 100 tests.
  9982. 961.38 s [vector] mut_foldl: OK
  9983. 961.38 s [vector] +++ OK, passed 100 tests.
  9984. 961.39 s [vector] mut_foldl': OK
  9985. 961.39 s [vector] +++ OK, passed 100 tests.
  9986. 961.39 s [vector] mut_ifoldr: OK
  9987. 961.39 s [vector] +++ OK, passed 100 tests.
  9988. 961.39 s [vector] mut_ifoldr': OK
  9989. 961.40 s [vector] +++ OK, passed 100 tests.
  9990. 961.40 s [vector] mut_ifoldl: OK
  9991. 961.40 s [vector] +++ OK, passed 100 tests.
  9992. 961.40 s [vector] mut_ifoldl': OK
  9993. 961.40 s [vector] +++ OK, passed 100 tests.
  9994. 961.40 s [vector] mut_foldM: OK
  9995. 961.40 s [vector] +++ OK, passed 100 tests.
  9996. 961.40 s [vector] mut_foldM': OK
  9997. 961.40 s [vector] +++ OK, passed 100 tests.
  9998. 961.40 s [vector] mut_foldrM: OK
  9999. 961.40 s [vector] +++ OK, passed 100 tests.
  10000. 961.41 s [vector] mut_foldrM': OK
  10001. 961.41 s [vector] +++ OK, passed 100 tests.
  10002. 961.41 s [vector] mut_ifoldM: OK
  10003. 961.41 s [vector] +++ OK, passed 100 tests.
  10004. 961.41 s [vector] mut_ifoldM': OK
  10005. 961.41 s [vector] +++ OK, passed 100 tests.
  10006. 961.42 s [vector] mut_ifoldrM: OK
  10007. 961.42 s [vector] +++ OK, passed 100 tests.
  10008. 961.42 s [vector] mut_ifoldrM': OK
  10009. 961.42 s [vector] +++ OK, passed 100 tests.
  10010. 961.42 s [vector] compare: OK
  10011. 961.42 s [vector] +++ OK, passed 100 tests.
  10012. 961.42 s [vector] maximum: OK
  10013. 961.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10014. 961.42 s [vector] minimum: OK
  10015. 961.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10016. 961.42 s [vector] minIndex: OK
  10017. 961.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10018. 961.42 s [vector] maxIndex: OK
  10019. 961.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10020. 961.42 s [vector] maximumBy: OK
  10021. 961.42 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10022. 961.42 s [vector] minimumBy: OK
  10023. 961.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10024. 961.42 s [vector] maximumOn: OK
  10025. 961.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10026. 961.42 s [vector] minimumOn: OK
  10027. 961.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10028. 961.42 s [vector] maxIndexBy: OK
  10029. 961.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10030. 961.42 s [vector] minIndexBy: OK
  10031. 961.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10032. 961.42 s [vector] ListFirstMaxIndexWins: OK
  10033. 961.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10034. 961.42 s [vector] FalseListFirstMaxIndexWins: OK
  10035. 961.43 s [vector] +++ OK, failed as expected. (after 1 test):
  10036. 961.43 s [vector] Exception:
  10037. 961.43 s [vector] Prelude.foldr1: empty list
  10038. 961.43 s [vector] CallStack (from HasCallStack):
  10039. 961.43 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10040. 961.43 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10041. 961.43 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10042. 961.43 s [vector] []
  10043. 961.43 s [vector] zip: OK
  10044. 961.43 s [vector] +++ OK, passed 100 tests.
  10045. 961.43 s [vector] zip3: OK
  10046. 961.43 s [vector] +++ OK, passed 100 tests.
  10047. 961.43 s [vector] unzip: OK
  10048. 961.43 s [vector] +++ OK, passed 100 tests.
  10049. 961.43 s [vector] unzip3: OK
  10050. 961.43 s [vector] +++ OK, passed 100 tests.
  10051. 961.43 s [vector] indexed: OK
  10052. 961.44 s [vector] +++ OK, passed 100 tests.
  10053. 961.44 s [vector] update: OK
  10054. 961.44 s [vector] +++ OK, passed 100 tests.
  10055. 961.44 s [vector] concat: OK
  10056. 961.44 s [vector] +++ OK, passed 100 tests.
  10057. 961.44 s [vector] mempty: OK
  10058. 961.44 s [vector] +++ OK, passed 100 tests.
  10059. 961.44 s [vector] mappend: OK
  10060. 961.45 s [vector] +++ OK, passed 100 tests.
  10061. 961.45 s [vector] mconcat: OK
  10062. 961.45 s [vector] +++ OK, passed 100 tests.
  10063. 961.45 s [vector] fmap: OK
  10064. 961.45 s [vector] +++ OK, passed 100 tests.
  10065. 961.45 s [vector] return: OK
  10066. 961.45 s [vector] +++ OK, passed 100 tests.
  10067. 961.46 s [vector] bind: OK (0.01s)
  10068. 961.46 s [vector] +++ OK, passed 100 tests.
  10069. 961.46 s [vector] mzip: OK
  10070. 961.46 s [vector] +++ OK, passed 100 tests.
  10071. 961.46 s [vector] munzip: OK
  10072. 961.46 s [vector] +++ OK, passed 100 tests.
  10073. 961.47 s [vector] applicative_pure: OK
  10074. 961.47 s [vector] +++ OK, passed 100 tests.
  10075. 961.47 s [pandoc-lua-engine] Phase: unpackPhase
  10076. 961.47 s [pandoc-lua-engine] unpacking source archive /nix/store/zx6z7rsf1lwrwkbcq94jg1dgi1fp9jls-pandoc-lua-engine-0.4.3.tar.gz
  10077. 961.48 s [pandoc-lua-engine] source root is pandoc-lua-engine-0.4.3
  10078. 961.49 s [vector] applicative_appl: OK (0.03s)
  10079. 961.49 s [vector] +++ OK, passed 100 tests.
  10080. 961.49 s [vector] alternative_empty: OK
  10081. 961.49 s [vector] +++ OK, passed 100 tests.
  10082. 961.49 s [pandoc-lua-engine] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-lua-engine-0.4.3/test/writer-template.out.txt"
  10083. 961.50 s [pandoc-lua-engine] Phase: patchPhase
  10084. 961.50 s [pandoc-lua-engine] Replace Cabal file with edited version from mirror://hackage/pandoc-lua-engine-0.4.3/revision/2.cabal.
  10085. 961.50 s [vector] alternative_or: OK
  10086. 961.50 s [vector] +++ OK, passed 100 tests.
  10087. 961.51 s [pandoc-lua-engine] Phase: compileBuildDriverPhase
  10088. 961.51 s [pandoc-lua-engine] setupCompileFlags: -package-db=/build/tmp.jdtoEoywKP/setup-package.conf.d -threaded
  10089. 961.52 s [vector] sequence: OK (0.02s)
  10090. 961.52 s [vector] +++ OK, passed 100 tests.
  10091. 961.53 s [vector] sequence_: OK
  10092. 961.53 s [vector] +++ OK, passed 100 tests.
  10093. 961.53 s [vector] glength: OK
  10094. 961.53 s [vector] +++ OK, passed 100 tests.
  10095. 961.53 s [vector] sum: OK
  10096. 961.53 s [vector] +++ OK, passed 100 tests.
  10097. 961.53 s [vector] product: OK
  10098. 961.53 s [vector] +++ OK, passed 100 tests.
  10099. 961.53 s [vector] enumFromN: OK
  10100. 961.53 s [vector] +++ OK, passed 100 tests.
  10101. 961.53 s [vector] enumFromThenN: OK
  10102. 961.53 s [vector] +++ OK, passed 100 tests.
  10103. 961.53 s [vector] enumFromTo: OK
  10104. 961.53 s [vector] +++ OK, passed 100 tests.
  10105. 961.53 s [vector] enumFromThenTo: OK
  10106. 961.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10107. 961.53 s [vector] unstream
  10108. 961.53 s [vector] unstream == vunstream (exact): OK
  10109. 961.53 s [vector] +++ OK, passed 100 tests.
  10110. 961.53 s [vector] unstream == vunstream (unknown): OK
  10111. 961.53 s [vector] +++ OK, passed 100 tests.
  10112. 961.53 s [vector] unstreamR ~= vunstream (exact): OK
  10113. 961.53 s [vector] +++ OK, passed 100 tests.
  10114. 961.53 s [vector] unstreamR ~= vunstream (unknown): OK
  10115. 961.53 s [vector] +++ OK, passed 100 tests.
  10116. 961.53 s [vector] Tests.Vector.Primitive
  10117. 961.53 s [vector] Int
  10118. 961.53 s [vector] fromList.toList == id: OK
  10119. 961.53 s [vector] +++ OK, passed 100 tests.
  10120. 961.53 s [vector] toList.fromList == id: OK
  10121. 961.53 s [vector] +++ OK, passed 100 tests.
  10122. 961.53 s [vector] unstream.stream == id: OK
  10123. 961.53 s [vector] +++ OK, passed 100 tests.
  10124. 961.53 s [vector] stream.unstream == id: OK
  10125. 961.53 s [vector] +++ OK, passed 100 tests.
  10126. 961.53 s [vector] eq: OK
  10127. 961.53 s [vector] +++ OK, passed 100 tests.
  10128. 961.53 s [vector] length: OK
  10129. 961.53 s [vector] +++ OK, passed 100 tests.
  10130. 961.53 s [vector] null: OK
  10131. 961.53 s [vector] +++ OK, passed 100 tests.
  10132. 961.53 s [vector] index: OK
  10133. 961.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10134. 961.53 s [vector] safeIndex: OK
  10135. 961.53 s [vector] +++ OK, passed 100 tests.
  10136. 961.53 s [vector] head: OK
  10137. 961.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10138. 961.54 s [vector] last: OK
  10139. 961.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10140. 961.54 s [vector] unsafeIndex: OK
  10141. 961.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10142. 961.54 s [vector] unsafeHead: OK
  10143. 961.54 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10144. 961.54 s [vector] unsafeLast: OK
  10145. 961.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10146. 961.54 s [vector] slice: OK
  10147. 961.54 s [vector] +++ OK, passed 100 tests.
  10148. 961.54 s [vector] init: OK
  10149. 961.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10150. 961.54 s [vector] tail: OK
  10151. 961.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10152. 961.54 s [vector] take: OK
  10153. 961.54 s [vector] +++ OK, passed 100 tests.
  10154. 961.54 s [vector] drop: OK
  10155. 961.54 s [vector] +++ OK, passed 100 tests.
  10156. 961.54 s [vector] splitAt: OK
  10157. 961.54 s [vector] +++ OK, passed 100 tests.
  10158. 961.54 s [vector] empty: OK
  10159. 961.54 s [vector] +++ OK, passed 100 tests.
  10160. 961.54 s [vector] singleton: OK
  10161. 961.54 s [vector] +++ OK, passed 100 tests.
  10162. 961.54 s [vector] replicate: OK
  10163. 961.54 s [vector] +++ OK, passed 100 tests.
  10164. 961.54 s [vector] generate: OK
  10165. 961.54 s [vector] +++ OK, passed 100 tests.
  10166. 961.54 s [vector] iterateN: OK
  10167. 961.55 s [vector] +++ OK, passed 100 tests.
  10168. 961.56 s [pandoc-lua-engine] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.jdtoEoywKP/Main.o )
  10169. 961.58 s [vector] iterateNM: OK (0.02s)
  10170. 961.58 s [vector] +++ OK, passed 100 tests.
  10171. 961.58 s [vector] generateM: OK (0.01s)
  10172. 961.58 s [vector] +++ OK, passed 100 tests.
  10173. 961.58 s [vector] replicateM: OK
  10174. 961.59 s [vector] +++ OK, passed 100 tests.
  10175. 961.59 s [vector] create: OK
  10176. 961.59 s [vector] +++ OK, passed 100 tests.
  10177. 961.59 s [vector] createT: OK
  10178. 961.59 s [vector] +++ OK, passed 100 tests.
  10179. 961.59 s [vector] unfoldr: OK
  10180. 961.59 s [vector] +++ OK, passed 100 tests.
  10181. 961.59 s [vector] unfoldrN: OK
  10182. 961.59 s [vector] +++ OK, passed 100 tests.
  10183. 961.59 s [vector] unfoldrExactN: OK
  10184. 961.59 s [vector] +++ OK, passed 100 tests.
  10185. 961.59 s [vector] unfoldrM: OK
  10186. 961.59 s [vector] +++ OK, passed 100 tests.
  10187. 961.59 s [vector] unfoldrNM: OK
  10188. 961.60 s [vector] +++ OK, passed 100 tests.
  10189. 961.61 s [vector] unfoldrExactNM: OK (0.02s)
  10190. 961.61 s [vector] +++ OK, passed 100 tests.
  10191. 961.61 s [vector] constructN: OK
  10192. 961.61 s [vector] +++ OK, passed 100 tests.
  10193. 961.61 s [vector] constructrN: OK
  10194. 961.61 s [vector] +++ OK, passed 100 tests.
  10195. 961.62 s [pandoc-lua-engine] [2 of 2] Linking Setup
  10196. 961.62 s [vector] cons: OK
  10197. 961.62 s [vector] +++ OK, passed 100 tests.
  10198. 961.62 s [vector] snoc: OK
  10199. 961.62 s [vector] +++ OK, passed 100 tests.
  10200. 961.62 s [vector] append: OK
  10201. 961.62 s [vector] +++ OK, passed 100 tests.
  10202. 961.63 s [vector] concat: OK (0.02s)
  10203. 961.63 s [vector] +++ OK, passed 100 tests.
  10204. 961.63 s [vector] force: OK
  10205. 961.63 s [vector] +++ OK, passed 100 tests.
  10206. 961.64 s [vector] upd: OK
  10207. 961.64 s [vector] +++ OK, passed 100 tests.
  10208. 961.64 s [vector] accum: OK
  10209. 961.64 s [vector] +++ OK, passed 100 tests.
  10210. 961.64 s [vector] reverse: OK
  10211. 961.64 s [vector] +++ OK, passed 100 tests.
  10212. 961.64 s [vector] backpermute: OK
  10213. 961.64 s [vector] +++ OK, passed 100 tests.
  10214. 961.64 s [vector] map: OK
  10215. 961.64 s [vector] +++ OK, passed 100 tests.
  10216. 961.65 s [vector] imap: OK
  10217. 961.65 s [vector] +++ OK, passed 100 tests.
  10218. 961.65 s [vector] concatMap: OK
  10219. 961.65 s [vector] +++ OK, passed 100 tests.
  10220. 961.65 s [vector] mapM: OK
  10221. 961.65 s [vector] +++ OK, passed 100 tests.
  10222. 961.66 s [vector] mapM_: OK
  10223. 961.66 s [vector] +++ OK, passed 100 tests.
  10224. 961.67 s [vector] forM: OK
  10225. 961.67 s [vector] +++ OK, passed 100 tests.
  10226. 961.68 s [pandoc-server] Phase: unpackPhase
  10227. 961.68 s [vector] forM_: OK (0.01s)
  10228. 961.68 s [vector] +++ OK, passed 100 tests.
  10229. 961.68 s [vector] imapM: OK
  10230. 961.68 s [vector] +++ OK, passed 100 tests.
  10231. 961.69 s [pandoc-server] unpacking source archive /nix/store/4kqsjsplqpsanrihsxp1wxshjqr4snkl-pandoc-server-0.1.0.11.tar.gz
  10232. 961.69 s [pandoc-server] source root is pandoc-server-0.1.0.11
  10233. 961.70 s [pandoc-server] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-server-0.1.0.11/src/Text/Pandoc/Server.hs"
  10234. 961.70 s [vector] imapM_: OK (0.02s)
  10235. 961.70 s [pandoc-server] Phase: patchPhase
  10236. 961.71 s [vector] +++ OK, passed 100 tests.
  10237. 961.71 s [vector] zipWith: OK
  10238. 961.71 s [vector] +++ OK, passed 100 tests.
  10239. 961.71 s [vector] zipWith3: OK
  10240. 961.71 s [vector] +++ OK, passed 100 tests.
  10241. 961.71 s [vector] izipWith: OK
  10242. 961.71 s [vector] +++ OK, passed 100 tests.
  10243. 961.71 s [vector] izipWith3: OK
  10244. 961.71 s [pandoc-server] Phase: compileBuildDriverPhase
  10245. 961.72 s [vector] +++ OK, passed 100 tests.
  10246. 961.72 s [vector] izipWithM: OK
  10247. 961.72 s [vector] +++ OK, passed 100 tests.
  10248. 961.72 s [vector] izipWithM_: OK (0.01s)
  10249. 961.73 s [vector] +++ OK, passed 100 tests.
  10250. 961.73 s [vector] zipWithM: OK
  10251. 961.73 s [vector] +++ OK, passed 100 tests.
  10252. 961.74 s [vector] zipWithM_: OK
  10253. 961.74 s [vector] +++ OK, passed 100 tests.
  10254. 961.74 s [vector] filter: OK
  10255. 961.74 s [vector] +++ OK, passed 100 tests.
  10256. 961.74 s [vector] ifilter: OK
  10257. 961.74 s [vector] +++ OK, passed 100 tests.
  10258. 961.76 s [vector] filterM: OK (0.02s)
  10259. 961.76 s [vector] +++ OK, passed 100 tests.
  10260. 961.76 s [vector] uniq: OK
  10261. 961.76 s [vector] +++ OK, passed 100 tests.
  10262. 961.76 s [vector] mapMaybe: OK
  10263. 961.76 s [vector] +++ OK, passed 100 tests.
  10264. 961.76 s [vector] imapMaybe: OK
  10265. 961.76 s [vector] +++ OK, passed 100 tests.
  10266. 961.76 s [vector] takeWhile: OK
  10267. 961.76 s [vector] +++ OK, passed 100 tests.
  10268. 961.76 s [vector] dropWhile: OK
  10269. 961.76 s [vector] +++ OK, passed 100 tests.
  10270. 961.76 s [vector] partition: OK
  10271. 961.76 s [vector] +++ OK, passed 100 tests.
  10272. 961.76 s [vector] partitionWith: OK
  10273. 961.76 s [vector] +++ OK, passed 100 tests.
  10274. 961.77 s [vector] span: OK
  10275. 961.77 s [vector] +++ OK, passed 100 tests.
  10276. 961.77 s [vector] break: OK
  10277. 961.77 s [vector] +++ OK, passed 100 tests.
  10278. 961.77 s [vector] spanR: OK
  10279. 961.77 s [vector] +++ OK, passed 100 tests.
  10280. 961.77 s [vector] breakR: OK
  10281. 961.77 s [vector] +++ OK, passed 100 tests.
  10282. 961.77 s [vector] groupBy: OK
  10283. 961.77 s [vector] +++ OK, passed 100 tests.
  10284. 961.77 s [vector] elem: OK
  10285. 961.77 s [vector] +++ OK, passed 100 tests.
  10286. 961.77 s [vector] notElem: OK
  10287. 961.77 s [vector] +++ OK, passed 100 tests.
  10288. 961.77 s [vector] find: OK
  10289. 961.77 s [vector] +++ OK, passed 100 tests.
  10290. 961.77 s [vector] findIndex: OK
  10291. 961.77 s [vector] +++ OK, passed 100 tests.
  10292. 961.77 s [vector] findIndexR: OK
  10293. 961.77 s [vector] +++ OK, passed 100 tests.
  10294. 961.77 s [vector] findIndices: OK
  10295. 961.77 s [vector] +++ OK, passed 100 tests.
  10296. 961.77 s [vector] elemIndex: OK
  10297. 961.77 s [vector] +++ OK, passed 100 tests.
  10298. 961.78 s [vector] elemIndices: OK
  10299. 961.78 s [vector] +++ OK, passed 100 tests.
  10300. 961.78 s [vector] foldl: OK
  10301. 961.78 s [vector] +++ OK, passed 100 tests.
  10302. 961.78 s [vector] foldl1: OK
  10303. 961.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10304. 961.78 s [vector] foldl': OK
  10305. 961.78 s [vector] +++ OK, passed 100 tests.
  10306. 961.78 s [vector] foldl1': OK
  10307. 961.78 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10308. 961.79 s [vector] foldr: OK
  10309. 961.79 s [vector] +++ OK, passed 100 tests.
  10310. 961.79 s [vector] foldr1: OK
  10311. 961.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10312. 961.79 s [vector] foldr': OK
  10313. 961.79 s [vector] +++ OK, passed 100 tests.
  10314. 961.80 s [vector] foldr1': OK
  10315. 961.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10316. 961.80 s [vector] ifoldl: OK
  10317. 961.80 s [vector] +++ OK, passed 100 tests.
  10318. 961.80 s [vector] ifoldl': OK
  10319. 961.80 s [vector] +++ OK, passed 100 tests.
  10320. 961.80 s [vector] ifoldr: OK
  10321. 961.80 s [vector] +++ OK, passed 100 tests.
  10322. 961.80 s [vector] ifoldr': OK
  10323. 961.80 s [vector] +++ OK, passed 100 tests.
  10324. 961.80 s [pandoc-server] setupCompileFlags: -package-db=/build/tmp.UqAv8TpUPG/setup-package.conf.d -threaded
  10325. 961.80 s [vector] ifoldM: OK
  10326. 961.81 s [vector] +++ OK, passed 100 tests.
  10327. 961.81 s [vector] ifoldM': OK
  10328. 961.82 s [vector] +++ OK, passed 100 tests.
  10329. 961.82 s [vector] ifoldM_: OK (0.02s)
  10330. 961.83 s [vector] +++ OK, passed 100 tests.
  10331. 961.84 s [vector] ifoldM'_: OK (0.01s)
  10332. 961.84 s [vector] +++ OK, passed 100 tests.
  10333. 961.84 s [vector] all: OK
  10334. 961.84 s [vector] +++ OK, passed 100 tests.
  10335. 961.84 s [vector] any: OK
  10336. 961.84 s [vector] +++ OK, passed 100 tests.
  10337. 961.84 s [vector] prescanl: OK
  10338. 961.84 s [vector] +++ OK, passed 100 tests.
  10339. 961.84 s [vector] prescanl': OK
  10340. 961.84 s [vector] +++ OK, passed 100 tests.
  10341. 961.85 s [pandoc-server] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.UqAv8TpUPG/Main.o )
  10342. 961.85 s [vector] postscanl: OK
  10343. 961.85 s [vector] +++ OK, passed 100 tests.
  10344. 961.85 s [vector] postscanl': OK
  10345. 961.85 s [vector] +++ OK, passed 100 tests.
  10346. 961.85 s [vector] scanl: OK
  10347. 961.85 s [vector] +++ OK, passed 100 tests.
  10348. 961.86 s [vector] scanl': OK
  10349. 961.86 s [vector] +++ OK, passed 100 tests.
  10350. 961.86 s [vector] scanl1: OK
  10351. 961.87 s [vector] +++ OK, passed 100 tests.
  10352. 961.87 s [vector] scanl1': OK
  10353. 961.87 s [vector] +++ OK, passed 100 tests.
  10354. 961.87 s [vector] iscanl: OK
  10355. 961.87 s [vector] +++ OK, passed 100 tests.
  10356. 961.87 s [vector] iscanl': OK
  10357. 961.87 s [vector] +++ OK, passed 100 tests.
  10358. 961.87 s [vector] prescanr: OK
  10359. 961.87 s [vector] +++ OK, passed 100 tests.
  10360. 961.87 s [vector] prescanr': OK
  10361. 961.87 s [vector] +++ OK, passed 100 tests.
  10362. 961.87 s [vector] postscanr: OK
  10363. 961.88 s [vector] +++ OK, passed 100 tests.
  10364. 961.88 s [vector] postscanr': OK
  10365. 961.88 s [vector] +++ OK, passed 100 tests.
  10366. 961.88 s [vector] scanr: OK
  10367. 961.88 s [vector] +++ OK, passed 100 tests.
  10368. 961.88 s [vector] scanr': OK
  10369. 961.88 s [vector] +++ OK, passed 100 tests.
  10370. 961.89 s [vector] scanr1: OK
  10371. 961.89 s [vector] +++ OK, passed 100 tests.
  10372. 961.89 s [vector] scanr1': OK
  10373. 961.89 s [vector] +++ OK, passed 100 tests.
  10374. 961.89 s [pandoc-server] [2 of 2] Linking Setup
  10375. 961.89 s [vector] iscanr: OK
  10376. 961.89 s [vector] +++ OK, passed 100 tests.
  10377. 961.89 s [vector] iscanr': OK
  10378. 961.90 s [vector] +++ OK, passed 100 tests.
  10379. 961.90 s [vector] mut_read: OK
  10380. 961.90 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10381. 961.90 s [vector] mut_write: OK
  10382. 961.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10383. 961.90 s [vector] mut_modify: OK
  10384. 961.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10385. 961.90 s [vector] mut_generate: OK
  10386. 961.90 s [vector] +++ OK, passed 100 tests.
  10387. 961.92 s [vector] mut_generateM: OK
  10388. 961.92 s [vector] +++ OK, passed 100 tests.
  10389. 961.94 s [vector] mut_mapM_: OK (0.02s)
  10390. 961.94 s [vector] +++ OK, passed 100 tests.
  10391. 961.94 s [vector] mut_imapM_: OK (0.01s)
  10392. 961.94 s [vector] +++ OK, passed 100 tests.
  10393. 961.96 s [vector] mut_forM_: OK (0.01s)
  10394. 961.96 s [vector] +++ OK, passed 100 tests.
  10395. 961.97 s [vector] mut_iforM_: OK
  10396. 961.97 s [vector] +++ OK, passed 100 tests.
  10397. 961.98 s [vector] mut_foldr: OK
  10398. 961.98 s [vector] +++ OK, passed 100 tests.
  10399. 961.98 s [vector] mut_foldr': OK
  10400. 961.98 s [vector] +++ OK, passed 100 tests.
  10401. 961.98 s [vector] mut_foldl: OK
  10402. 961.98 s [vector] +++ OK, passed 100 tests.
  10403. 961.98 s [vector] mut_foldl': OK
  10404. 961.98 s [vector] +++ OK, passed 100 tests.
  10405. 961.99 s [vector] mut_ifoldr: OK
  10406. 961.99 s [vector] +++ OK, passed 100 tests.
  10407. 961.99 s [vector] mut_ifoldr': OK
  10408. 961.99 s [vector] +++ OK, passed 100 tests.
  10409. 961.99 s [vector] mut_ifoldl: OK
  10410. 961.99 s [vector] +++ OK, passed 100 tests.
  10411. 961.99 s [vector] mut_ifoldl': OK
  10412. 961.99 s [vector] +++ OK, passed 100 tests.
  10413. 961.99 s [vector] mut_foldM: OK
  10414. 962.00 s [vector] +++ OK, passed 100 tests.
  10415. 962.00 s [vector] mut_foldM': OK
  10416. 962.00 s [vector] +++ OK, passed 100 tests.
  10417. 962.00 s [vector] mut_foldrM: OK
  10418. 962.00 s [vector] +++ OK, passed 100 tests.
  10419. 962.01 s [vector] mut_foldrM': OK
  10420. 962.01 s [vector] +++ OK, passed 100 tests.
  10421. 962.01 s [vector] mut_ifoldM: OK
  10422. 962.01 s [vector] +++ OK, passed 100 tests.
  10423. 962.01 s [vector] mut_ifoldM': OK
  10424. 962.01 s [vector] +++ OK, passed 100 tests.
  10425. 962.01 s [vector] mut_ifoldrM: OK
  10426. 962.01 s [vector] +++ OK, passed 100 tests.
  10427. 962.01 s [vector] mut_ifoldrM': OK
  10428. 962.01 s [vector] +++ OK, passed 100 tests.
  10429. 962.01 s [vector] compare: OK
  10430. 962.01 s [vector] +++ OK, passed 100 tests.
  10431. 962.01 s [vector] maximum: OK
  10432. 962.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10433. 962.01 s [vector] minimum: OK
  10434. 962.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10435. 962.01 s [vector] minIndex: OK
  10436. 962.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10437. 962.01 s [vector] maxIndex: OK
  10438. 962.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10439. 962.02 s [vector] maximumBy: OK
  10440. 962.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10441. 962.02 s [vector] minimumBy: OK
  10442. 962.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10443. 962.02 s [vector] maximumOn: OK
  10444. 962.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10445. 962.02 s [vector] minimumOn: OK
  10446. 962.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10447. 962.02 s [vector] maxIndexBy: OK
  10448. 962.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10449. 962.02 s [vector] minIndexBy: OK
  10450. 962.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10451. 962.02 s [vector] ListFirstMaxIndexWins: OK
  10452. 962.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10453. 962.02 s [vector] FalseListFirstMaxIndexWins: OK
  10454. 962.02 s [vector] +++ OK, failed as expected. (after 1 test):
  10455. 962.02 s [vector] Exception:
  10456. 962.02 s [vector] Prelude.foldr1: empty list
  10457. 962.02 s [vector] CallStack (from HasCallStack):
  10458. 962.02 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10459. 962.02 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10460. 962.02 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10461. 962.02 s [vector] []
  10462. 962.02 s [vector] mempty: OK
  10463. 962.02 s [vector] +++ OK, passed 100 tests.
  10464. 962.02 s [vector] mappend: OK
  10465. 962.02 s [vector] +++ OK, passed 100 tests.
  10466. 962.03 s [vector] mconcat: OK (0.01s)
  10467. 962.03 s [vector] +++ OK, passed 100 tests.
  10468. 962.03 s [vector] glength: OK
  10469. 962.03 s [vector] +++ OK, passed 100 tests.
  10470. 962.03 s [vector] sum: OK
  10471. 962.03 s [vector] +++ OK, passed 100 tests.
  10472. 962.04 s [vector] product: OK
  10473. 962.04 s [vector] +++ OK, passed 100 tests.
  10474. 962.04 s [vector] enumFromN: OK
  10475. 962.04 s [vector] +++ OK, passed 100 tests.
  10476. 962.04 s [vector] enumFromThenN: OK
  10477. 962.04 s [vector] +++ OK, passed 100 tests.
  10478. 962.04 s [vector] enumFromTo: OK
  10479. 962.04 s [vector] +++ OK, passed 100 tests.
  10480. 962.04 s [vector] enumFromThenTo: OK
  10481. 962.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10482. 962.04 s [vector] Double
  10483. 962.04 s [vector] fromList.toList == id: OK
  10484. 962.04 s [vector] +++ OK, passed 100 tests.
  10485. 962.04 s [vector] toList.fromList == id: OK
  10486. 962.04 s [vector] +++ OK, passed 100 tests.
  10487. 962.04 s [vector] unstream.stream == id: OK
  10488. 962.04 s [vector] +++ OK, passed 100 tests.
  10489. 962.04 s [vector] stream.unstream == id: OK
  10490. 962.04 s [vector] +++ OK, passed 100 tests.
  10491. 962.04 s [vector] eq: OK
  10492. 962.04 s [vector] +++ OK, passed 100 tests.
  10493. 962.04 s [vector] length: OK
  10494. 962.04 s [vector] +++ OK, passed 100 tests.
  10495. 962.04 s [vector] null: OK
  10496. 962.04 s [vector] +++ OK, passed 100 tests.
  10497. 962.04 s [vector] index: OK
  10498. 962.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10499. 962.04 s [vector] safeIndex: OK
  10500. 962.04 s [vector] +++ OK, passed 100 tests.
  10501. 962.05 s [vector] head: OK
  10502. 962.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10503. 962.05 s [vector] last: OK
  10504. 962.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10505. 962.05 s [vector] unsafeIndex: OK
  10506. 962.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10507. 962.05 s [vector] unsafeHead: OK
  10508. 962.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10509. 962.05 s [vector] unsafeLast: OK
  10510. 962.05 s [vector] +++ OK, passed 100 tests; 26 discarded.
  10511. 962.05 s [vector] slice: OK
  10512. 962.05 s [vector] +++ OK, passed 100 tests.
  10513. 962.05 s [vector] init: OK
  10514. 962.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10515. 962.05 s [vector] tail: OK
  10516. 962.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10517. 962.05 s [vector] take: OK
  10518. 962.05 s [vector] +++ OK, passed 100 tests.
  10519. 962.05 s [vector] drop: OK
  10520. 962.05 s [vector] +++ OK, passed 100 tests.
  10521. 962.05 s [vector] splitAt: OK
  10522. 962.05 s [vector] +++ OK, passed 100 tests.
  10523. 962.05 s [vector] empty: OK
  10524. 962.05 s [vector] +++ OK, passed 100 tests.
  10525. 962.05 s [vector] singleton: OK
  10526. 962.05 s [vector] +++ OK, passed 100 tests.
  10527. 962.05 s [vector] replicate: OK
  10528. 962.05 s [vector] +++ OK, passed 100 tests.
  10529. 962.06 s [vector] generate: OK
  10530. 962.06 s [vector] +++ OK, passed 100 tests.
  10531. 962.06 s [vector] iterateN: OK
  10532. 962.06 s [vector] +++ OK, passed 100 tests.
  10533. 962.08 s [vector] iterateNM: OK (0.02s)
  10534. 962.08 s [vector] +++ OK, passed 100 tests.
  10535. 962.11 s [vector] generateM: OK (0.03s)
  10536. 962.11 s [vector] +++ OK, passed 100 tests.
  10537. 962.11 s [vector] replicateM: OK
  10538. 962.11 s [vector] +++ OK, passed 100 tests.
  10539. 962.12 s [vector] create: OK
  10540. 962.12 s [vector] +++ OK, passed 100 tests.
  10541. 962.12 s [vector] createT: OK
  10542. 962.12 s [vector] +++ OK, passed 100 tests.
  10543. 962.12 s [vector] unfoldr: OK
  10544. 962.12 s [vector] +++ OK, passed 100 tests.
  10545. 962.12 s [vector] unfoldrN: OK
  10546. 962.12 s [vector] +++ OK, passed 100 tests.
  10547. 962.12 s [vector] unfoldrExactN: OK
  10548. 962.12 s [vector] +++ OK, passed 100 tests.
  10549. 962.12 s [vector] unfoldrM: OK
  10550. 962.12 s [vector] +++ OK, passed 100 tests.
  10551. 962.12 s [vector] unfoldrNM: OK
  10552. 962.12 s [vector] +++ OK, passed 100 tests.
  10553. 962.14 s [vector] unfoldrExactNM: OK (0.01s)
  10554. 962.14 s [vector] +++ OK, passed 100 tests.
  10555. 962.14 s [vector] constructN: OK
  10556. 962.14 s [vector] +++ OK, passed 100 tests.
  10557. 962.16 s [vector] constructrN: OK (0.01s)
  10558. 962.16 s [vector] +++ OK, passed 100 tests.
  10559. 962.16 s [vector] cons: OK
  10560. 962.16 s [vector] +++ OK, passed 100 tests.
  10561. 962.16 s [vector] snoc: OK
  10562. 962.16 s [vector] +++ OK, passed 100 tests.
  10563. 962.17 s [vector] append: OK
  10564. 962.17 s [vector] +++ OK, passed 100 tests.
  10565. 962.18 s [vector] concat: OK (0.02s)
  10566. 962.18 s [vector] +++ OK, passed 100 tests.
  10567. 962.19 s [vector] force: OK
  10568. 962.19 s [vector] +++ OK, passed 100 tests.
  10569. 962.20 s [vector] upd: OK
  10570. 962.20 s [vector] +++ OK, passed 100 tests.
  10571. 962.20 s [vector] accum: OK (0.01s)
  10572. 962.20 s [vector] +++ OK, passed 100 tests.
  10573. 962.20 s [vector] reverse: OK
  10574. 962.20 s [vector] +++ OK, passed 100 tests.
  10575. 962.20 s [vector] backpermute: OK
  10576. 962.20 s [vector] +++ OK, passed 100 tests.
  10577. 962.21 s [vector] map: OK
  10578. 962.21 s [vector] +++ OK, passed 100 tests.
  10579. 962.22 s [vector] imap: OK
  10580. 962.22 s [vector] +++ OK, passed 100 tests.
  10581. 962.22 s [vector] concatMap: OK
  10582. 962.22 s [vector] +++ OK, passed 100 tests.
  10583. 962.23 s [vector] mapM: OK
  10584. 962.23 s [vector] +++ OK, passed 100 tests.
  10585. 962.26 s [vector] mapM_: OK (0.03s)
  10586. 962.26 s [vector] +++ OK, passed 100 tests.
  10587. 962.26 s [vector] forM: OK
  10588. 962.26 s [vector] +++ OK, passed 100 tests.
  10589. 962.29 s [haskell-language-server] Preprocessing library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0...
  10590. 962.29 s [haskell-language-server] Building library 'hls-gadt-plugin' for haskell-language-server-2.12.0.0...
  10591. 962.30 s [vector] forM_: OK (0.03s)
  10592. 962.30 s [vector] +++ OK, passed 100 tests.
  10593. 962.30 s [vector] imapM: OK
  10594. 962.30 s [vector] +++ OK, passed 100 tests.
  10595. 962.33 s [vector] imapM_: OK (0.03s)
  10596. 962.33 s [vector] +++ OK, passed 100 tests.
  10597. 962.34 s [vector] zipWith: OK
  10598. 962.34 s [vector] +++ OK, passed 100 tests.
  10599. 962.34 s [vector] zipWith3: OK (0.01s)
  10600. 962.34 s [vector] +++ OK, passed 100 tests.
  10601. 962.36 s [vector] izipWith: OK
  10602. 962.36 s [vector] +++ OK, passed 100 tests.
  10603. 962.36 s [vector] izipWith3: OK (0.01s)
  10604. 962.36 s [vector] +++ OK, passed 100 tests.
  10605. 962.37 s [vector] izipWithM: OK
  10606. 962.37 s [vector] +++ OK, passed 100 tests.
  10607. 962.40 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 )
  10608. 962.40 s [vector] izipWithM_: OK (0.02s)
  10609. 962.40 s [vector] +++ OK, passed 100 tests.
  10610. 962.41 s [vector] zipWithM: OK
  10611. 962.41 s [vector] +++ OK, passed 100 tests.
  10612. 962.43 s [vector] zipWithM_: OK (0.03s)
  10613. 962.43 s [vector] +++ OK, passed 100 tests.
  10614. 962.44 s [vector] filter: OK
  10615. 962.44 s [vector] +++ OK, passed 100 tests.
  10616. 962.44 s [vector] ifilter: OK
  10617. 962.44 s [vector] +++ OK, passed 100 tests.
  10618. 962.48 s [vector] filterM: OK (0.04s)
  10619. 962.48 s [vector] +++ OK, passed 100 tests.
  10620. 962.48 s [vector] uniq: OK
  10621. 962.48 s [vector] +++ OK, passed 100 tests.
  10622. 962.49 s [vector] mapMaybe: OK
  10623. 962.49 s [vector] +++ OK, passed 100 tests.
  10624. 962.50 s [vector] imapMaybe: OK
  10625. 962.50 s [vector] +++ OK, passed 100 tests.
  10626. 962.50 s [vector] takeWhile: OK
  10627. 962.50 s [vector] +++ OK, passed 100 tests.
  10628. 962.50 s [vector] dropWhile: OK
  10629. 962.50 s [vector] +++ OK, passed 100 tests.
  10630. 962.50 s [vector] partition: OK
  10631. 962.50 s [vector] +++ OK, passed 100 tests.
  10632. 962.51 s [vector] partitionWith: OK
  10633. 962.51 s [vector] +++ OK, passed 100 tests.
  10634. 962.51 s [vector] span: OK
  10635. 962.51 s [vector] +++ OK, passed 100 tests.
  10636. 962.51 s [vector] break: OK
  10637. 962.51 s [vector] +++ OK, passed 100 tests.
  10638. 962.51 s [vector] spanR: OK
  10639. 962.51 s [vector] +++ OK, passed 100 tests.
  10640. 962.52 s [vector] breakR: OK
  10641. 962.52 s [vector] +++ OK, passed 100 tests.
  10642. 962.52 s [vector] groupBy: OK
  10643. 962.52 s [vector] +++ OK, passed 100 tests.
  10644. 962.52 s [vector] elem: OK
  10645. 962.52 s [vector] +++ OK, passed 100 tests.
  10646. 962.53 s [vector] notElem: OK
  10647. 962.53 s [vector] +++ OK, passed 100 tests.
  10648. 962.53 s [vector] find: OK
  10649. 962.53 s [vector] +++ OK, passed 100 tests.
  10650. 962.53 s [vector] findIndex: OK
  10651. 962.53 s [vector] +++ OK, passed 100 tests.
  10652. 962.53 s [vector] findIndexR: OK
  10653. 962.53 s [vector] +++ OK, passed 100 tests.
  10654. 962.53 s [vector] findIndices: OK
  10655. 962.53 s [vector] +++ OK, passed 100 tests.
  10656. 962.53 s [vector] elemIndex: OK
  10657. 962.53 s [vector] +++ OK, passed 100 tests.
  10658. 962.54 s [vector] elemIndices: OK
  10659. 962.54 s [vector] +++ OK, passed 100 tests.
  10660. 962.56 s [vector] foldl: OK
  10661. 962.56 s [vector] +++ OK, passed 100 tests.
  10662. 962.57 s [vector] foldl1: OK (0.01s)
  10663. 962.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10664. 962.58 s [vector] foldl': OK (0.01s)
  10665. 962.58 s [vector] +++ OK, passed 100 tests.
  10666. 962.58 s [vector] foldl1': OK (0.01s)
  10667. 962.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10668. 962.59 s [vector] foldr: OK (0.01s)
  10669. 962.59 s [vector] +++ OK, passed 100 tests.
  10670. 962.60 s [vector] foldr1: OK
  10671. 962.60 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10672. 962.62 s [vector] foldr': OK (0.01s)
  10673. 962.62 s [vector] +++ OK, passed 100 tests.
  10674. 962.62 s [vector] foldr1': OK
  10675. 962.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10676. 962.64 s [vector] ifoldl: OK (0.01s)
  10677. 962.65 s [vector] +++ OK, passed 100 tests.
  10678. 962.66 s [vector] ifoldl': OK
  10679. 962.66 s [vector] +++ OK, passed 100 tests.
  10680. 962.66 s [vector] ifoldr: OK (0.01s)
  10681. 962.66 s [vector] +++ OK, passed 100 tests.
  10682. 962.68 s [vector] ifoldr': OK (0.01s)
  10683. 962.68 s [vector] +++ OK, passed 100 tests.
  10684. 962.68 s [vector] ifoldM: OK (0.01s)
  10685. 962.68 s [vector] +++ OK, passed 100 tests.
  10686. 962.70 s [vector] ifoldM': OK (0.01s)
  10687. 962.71 s [vector] +++ OK, passed 100 tests.
  10688. 962.72 s [vector] ifoldM_: OK (0.03s)
  10689. 962.73 s [vector] +++ OK, passed 100 tests.
  10690. 962.75 s [vector] ifoldM'_: OK (0.03s)
  10691. 962.75 s [vector] +++ OK, passed 100 tests.
  10692. 962.75 s [vector] all: OK
  10693. 962.75 s [vector] +++ OK, passed 100 tests.
  10694. 962.75 s [vector] any: OK
  10695. 962.75 s [vector] +++ OK, passed 100 tests.
  10696. 962.76 s [vector] prescanl: OK
  10697. 962.76 s [vector] +++ OK, passed 100 tests.
  10698. 962.77 s [vector] prescanl': OK (0.01s)
  10699. 962.77 s [vector] +++ OK, passed 100 tests.
  10700. 962.78 s [vector] postscanl: OK
  10701. 962.78 s [vector] +++ OK, passed 100 tests.
  10702. 962.80 s [vector] postscanl': OK (0.01s)
  10703. 962.80 s [vector] +++ OK, passed 100 tests.
  10704. 962.81 s [vector] scanl: OK (0.01s)
  10705. 962.82 s [vector] +++ OK, passed 100 tests.
  10706. 962.82 s [vector] scanl': OK
  10707. 962.82 s [vector] +++ OK, passed 100 tests.
  10708. 962.82 s [vector] scanl1: OK
  10709. 962.82 s [vector] +++ OK, passed 100 tests.
  10710. 962.84 s [vector] scanl1': OK (0.01s)
  10711. 962.84 s [vector] +++ OK, passed 100 tests.
  10712. 962.86 s [vector] iscanl: OK (0.01s)
  10713. 962.86 s [vector] +++ OK, passed 100 tests.
  10714. 962.87 s [vector] iscanl': OK (0.01s)
  10715. 962.87 s [vector] +++ OK, passed 100 tests.
  10716. 962.88 s [vector] prescanr: OK (0.01s)
  10717. 962.88 s [vector] +++ OK, passed 100 tests.
  10718. 962.89 s [vector] prescanr': OK (0.01s)
  10719. 962.89 s [vector] +++ OK, passed 100 tests.
  10720. 962.90 s [vector] postscanr: OK (0.01s)
  10721. 962.90 s [vector] +++ OK, passed 100 tests.
  10722. 962.92 s [vector] postscanr': OK (0.01s)
  10723. 962.93 s [vector] +++ OK, passed 100 tests.
  10724. 962.93 s [vector] scanr: OK (0.01s)
  10725. 962.93 s [vector] +++ OK, passed 100 tests.
  10726. 962.94 s [vector] scanr': OK (0.02s)
  10727. 962.94 s [vector] +++ OK, passed 100 tests.
  10728. 962.95 s [vector] scanr1: OK
  10729. 962.95 s [vector] +++ OK, passed 100 tests.
  10730. 962.96 s [vector] scanr1': OK (0.01s)
  10731. 962.96 s [vector] +++ OK, passed 100 tests.
  10732. 962.97 s [vector] iscanr: OK (0.01s)
  10733. 962.98 s [vector] +++ OK, passed 100 tests.
  10734. 962.98 s [vector] iscanr': OK (0.01s)
  10735. 962.98 s [vector] +++ OK, passed 100 tests.
  10736. 962.98 s [vector] mut_read: OK
  10737. 962.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10738. 962.98 s [vector] mut_write: OK
  10739. 962.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10740. 962.98 s [vector] mut_modify: OK
  10741. 962.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10742. 962.98 s [vector] mut_generate: OK
  10743. 962.98 s [vector] +++ OK, passed 100 tests.
  10744. 962.98 s [pandoc-lua-engine] Phase: updateAutotoolsGnuConfigScriptsPhase
  10745. 963.00 s [pandoc-lua-engine] Phase: configurePhase
  10746. 963.00 s [pandoc-lua-engine] configureFlags: --verbose --prefix=/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3 --with-gcc=gcc --package-db=/build/tmp.jdtoEoywKP/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
  10747. 963.01 s [vector] mut_generateM: OK (0.02s)
  10748. 963.01 s [vector] +++ OK, passed 100 tests.
  10749. 963.02 s [pandoc-lua-engine] Using Parsec parser
  10750. 963.02 s [pandoc-lua-engine] Configuring pandoc-lua-engine-0.4.3...
  10751. 963.06 s [vector] mut_mapM_: OK (0.05s)
  10752. 963.06 s [vector] +++ OK, passed 100 tests.
  10753. 963.08 s [vector] mut_imapM_: OK (0.03s)
  10754. 963.08 s [vector] +++ OK, passed 100 tests.
  10755. 963.11 s [vector] mut_forM_: OK (0.03s)
  10756. 963.11 s [vector] +++ OK, passed 100 tests.
  10757. 963.14 s [vector] mut_iforM_: OK (0.02s)
  10758. 963.15 s [vector] +++ OK, passed 100 tests.
  10759. 963.16 s [pandoc-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  10760. 963.16 s [vector] mut_foldr: OK (0.01s)
  10761. 963.16 s [vector] +++ OK, passed 100 tests.
  10762. 963.17 s [pandoc-server] Phase: configurePhase
  10763. 963.17 s [pandoc-server] configureFlags: --verbose --prefix=/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11 --with-gcc=gcc --package-db=/build/tmp.UqAv8TpUPG/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
  10764. 963.18 s [vector] mut_foldr': OK (0.01s)
  10765. 963.18 s [vector] +++ OK, passed 100 tests.
  10766. 963.18 s [pandoc-server] Using Parsec parser
  10767. 963.18 s [pandoc-server] Configuring pandoc-server-0.1.0.11...
  10768. 963.18 s [vector] mut_foldl: OK (0.01s)
  10769. 963.18 s [vector] +++ OK, passed 100 tests.
  10770. 963.20 s [vector] mut_foldl': OK (0.01s)
  10771. 963.20 s [vector] +++ OK, passed 100 tests.
  10772. 963.20 s [vector] mut_ifoldr: OK (0.01s)
  10773. 963.20 s [vector] +++ OK, passed 100 tests.
  10774. 963.21 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 )
  10775. 963.22 s [vector] mut_ifoldr': OK (0.01s)
  10776. 963.22 s [vector] +++ OK, passed 100 tests.
  10777. 963.24 s [vector] mut_ifoldl: OK (0.02s)
  10778. 963.24 s [vector] +++ OK, passed 100 tests.
  10779. 963.24 s [vector] mut_ifoldl': OK (0.01s)
  10780. 963.24 s [vector] +++ OK, passed 100 tests.
  10781. 963.26 s [vector] mut_foldM: OK (0.01s)
  10782. 963.26 s [vector] +++ OK, passed 100 tests.
  10783. 963.28 s [vector] mut_foldM': OK (0.01s)
  10784. 963.28 s [vector] +++ OK, passed 100 tests.
  10785. 963.28 s [vector] mut_foldrM: OK (0.01s)
  10786. 963.28 s [vector] +++ OK, passed 100 tests.
  10787. 963.30 s [vector] mut_foldrM': OK (0.01s)
  10788. 963.30 s [vector] +++ OK, passed 100 tests.
  10789. 963.31 s [vector] mut_ifoldM: OK (0.01s)
  10790. 963.31 s [vector] +++ OK, passed 100 tests.
  10791. 963.32 s [vector] mut_ifoldM': OK (0.01s)
  10792. 963.32 s [vector] +++ OK, passed 100 tests.
  10793. 963.34 s [vector] mut_ifoldrM: OK (0.01s)
  10794. 963.34 s [vector] +++ OK, passed 100 tests.
  10795. 963.34 s [vector] mut_ifoldrM': OK (0.01s)
  10796. 963.34 s [vector] +++ OK, passed 100 tests.
  10797. 963.34 s [vector] compare: OK
  10798. 963.34 s [vector] +++ OK, passed 100 tests.
  10799. 963.34 s [vector] maximum: OK
  10800. 963.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10801. 963.34 s [vector] minimum: OK
  10802. 963.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10803. 963.34 s [vector] minIndex: OK
  10804. 963.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10805. 963.34 s [vector] maxIndex: OK
  10806. 963.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10807. 963.34 s [vector] maximumBy: OK
  10808. 963.34 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10809. 963.34 s [vector] minimumBy: OK
  10810. 963.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10811. 963.34 s [vector] maximumOn: OK
  10812. 963.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10813. 963.34 s [vector] minimumOn: OK
  10814. 963.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10815. 963.34 s [vector] maxIndexBy: OK
  10816. 963.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10817. 963.34 s [vector] minIndexBy: OK
  10818. 963.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10819. 963.34 s [vector] ListFirstMaxIndexWins: OK
  10820. 963.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10821. 963.34 s [vector] FalseListFirstMaxIndexWins: OK
  10822. 963.34 s [vector] +++ OK, failed as expected. (after 1 test):
  10823. 963.34 s [vector] Exception:
  10824. 963.34 s [vector] Prelude.foldr1: empty list
  10825. 963.34 s [vector] CallStack (from HasCallStack):
  10826. 963.35 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10827. 963.36 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10828. 963.36 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10829. 963.37 s [vector] []
  10830. 963.37 s [vector] mempty: OK
  10831. 963.37 s [vector] +++ OK, passed 100 tests.
  10832. 963.37 s [vector] mappend: OK
  10833. 963.37 s [vector] +++ OK, passed 100 tests.
  10834. 963.37 s [vector] mconcat: OK (0.02s)
  10835. 963.37 s [vector] +++ OK, passed 100 tests.
  10836. 963.37 s [vector] glength: OK
  10837. 963.37 s [vector] +++ OK, passed 100 tests.
  10838. 963.37 s [vector] sum: OK
  10839. 963.37 s [vector] +++ OK, passed 100 tests.
  10840. 963.37 s [vector] product: OK
  10841. 963.37 s [vector] +++ OK, passed 100 tests.
  10842. 963.37 s [vector] enumFromN: OK
  10843. 963.37 s [vector] +++ OK, passed 100 tests.
  10844. 963.37 s [vector] enumFromThenN: OK
  10845. 963.37 s [vector] +++ OK, passed 100 tests.
  10846. 963.37 s [vector] enumFromTo: OK
  10847. 963.37 s [vector] +++ OK, passed 100 tests.
  10848. 963.37 s [vector] enumFromThenTo: OK
  10849. 963.37 s [vector] +++ OK, passed 100 tests; 3 discarded.
  10850. 963.37 s [vector] unstream
  10851. 963.37 s [vector] unstream == vunstream (exact): OK
  10852. 963.37 s [vector] +++ OK, passed 100 tests.
  10853. 963.37 s [vector] unstream == vunstream (unknown): OK
  10854. 963.37 s [vector] +++ OK, passed 100 tests.
  10855. 963.37 s [vector] unstreamR ~= vunstream (exact): OK
  10856. 963.37 s [vector] +++ OK, passed 100 tests.
  10857. 963.37 s [vector] unstreamR ~= vunstream (unknown): OK
  10858. 963.37 s [vector] +++ OK, passed 100 tests.
  10859. 963.37 s [vector] Tests.Vector.Storable
  10860. 963.37 s [vector] Data.Vector.Storable.Vector (Int)
  10861. 963.37 s [vector] fromList.toList == id: OK
  10862. 963.37 s [vector] +++ OK, passed 100 tests.
  10863. 963.37 s [vector] toList.fromList == id: OK
  10864. 963.37 s [vector] +++ OK, passed 100 tests.
  10865. 963.37 s [vector] unstream.stream == id: OK
  10866. 963.37 s [vector] +++ OK, passed 100 tests.
  10867. 963.37 s [vector] stream.unstream == id: OK
  10868. 963.37 s [vector] +++ OK, passed 100 tests.
  10869. 963.37 s [vector] eq: OK
  10870. 963.37 s [vector] +++ OK, passed 100 tests.
  10871. 963.37 s [vector] length: OK
  10872. 963.37 s [vector] +++ OK, passed 100 tests.
  10873. 963.37 s [vector] null: OK
  10874. 963.37 s [vector] +++ OK, passed 100 tests.
  10875. 963.38 s [vector] index: OK
  10876. 963.38 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10877. 963.38 s [vector] safeIndex: OK
  10878. 963.38 s [vector] +++ OK, passed 100 tests.
  10879. 963.38 s [vector] head: OK
  10880. 963.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10881. 963.38 s [vector] last: OK
  10882. 963.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10883. 963.38 s [vector] unsafeIndex: OK
  10884. 963.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10885. 963.38 s [vector] unsafeHead: OK
  10886. 963.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10887. 963.38 s [vector] unsafeLast: OK
  10888. 963.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10889. 963.38 s [vector] slice: OK
  10890. 963.38 s [vector] +++ OK, passed 100 tests.
  10891. 963.38 s [vector] init: OK
  10892. 963.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10893. 963.38 s [vector] tail: OK
  10894. 963.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10895. 963.38 s [vector] take: OK
  10896. 963.38 s [vector] +++ OK, passed 100 tests.
  10897. 963.38 s [vector] drop: OK
  10898. 963.38 s [vector] +++ OK, passed 100 tests.
  10899. 963.38 s [vector] splitAt: OK
  10900. 963.38 s [vector] +++ OK, passed 100 tests.
  10901. 963.38 s [vector] empty: OK
  10902. 963.38 s [vector] +++ OK, passed 100 tests.
  10903. 963.38 s [vector] singleton: OK
  10904. 963.38 s [vector] +++ OK, passed 100 tests.
  10905. 963.38 s [vector] replicate: OK
  10906. 963.38 s [vector] +++ OK, passed 100 tests.
  10907. 963.39 s [vector] generate: OK
  10908. 963.39 s [vector] +++ OK, passed 100 tests.
  10909. 963.39 s [vector] iterateN: OK
  10910. 963.39 s [vector] +++ OK, passed 100 tests.
  10911. 963.42 s [vector] iterateNM: OK (0.02s)
  10912. 963.42 s [vector] +++ OK, passed 100 tests.
  10913. 963.42 s [vector] generateM: OK (0.01s)
  10914. 963.42 s [vector] +++ OK, passed 100 tests.
  10915. 963.44 s [vector] replicateM: OK (0.02s)
  10916. 963.44 s [vector] +++ OK, passed 100 tests.
  10917. 963.44 s [vector] create: OK
  10918. 963.44 s [vector] +++ OK, passed 100 tests.
  10919. 963.44 s [vector] createT: OK
  10920. 963.44 s [vector] +++ OK, passed 100 tests.
  10921. 963.44 s [vector] unfoldr: OK
  10922. 963.44 s [vector] +++ OK, passed 100 tests.
  10923. 963.44 s [vector] unfoldrN: OK
  10924. 963.44 s [vector] +++ OK, passed 100 tests.
  10925. 963.44 s [vector] unfoldrExactN: OK
  10926. 963.44 s [vector] +++ OK, passed 100 tests.
  10927. 963.44 s [vector] unfoldrM: OK
  10928. 963.44 s [vector] +++ OK, passed 100 tests.
  10929. 963.44 s [vector] unfoldrNM: OK
  10930. 963.44 s [vector] +++ OK, passed 100 tests.
  10931. 963.47 s [vector] unfoldrExactNM: OK (0.02s)
  10932. 963.47 s [vector] +++ OK, passed 100 tests.
  10933. 963.47 s [vector] constructN: OK
  10934. 963.47 s [vector] +++ OK, passed 100 tests.
  10935. 963.47 s [vector] constructrN: OK
  10936. 963.47 s [vector] +++ OK, passed 100 tests.
  10937. 963.47 s [vector] cons: OK
  10938. 963.47 s [vector] +++ OK, passed 100 tests.
  10939. 963.47 s [vector] snoc: OK
  10940. 963.47 s [vector] +++ OK, passed 100 tests.
  10941. 963.47 s [vector] append: OK
  10942. 963.48 s [vector] +++ OK, passed 100 tests.
  10943. 963.49 s [vector] concat: OK (0.01s)
  10944. 963.49 s [vector] +++ OK, passed 100 tests.
  10945. 963.49 s [vector] force: OK
  10946. 963.49 s [vector] +++ OK, passed 100 tests.
  10947. 963.49 s [vector] upd: OK
  10948. 963.49 s [vector] +++ OK, passed 100 tests.
  10949. 963.49 s [vector] accum: OK
  10950. 963.49 s [vector] +++ OK, passed 100 tests.
  10951. 963.49 s [vector] reverse: OK
  10952. 963.49 s [vector] +++ OK, passed 100 tests.
  10953. 963.49 s [vector] backpermute: OK
  10954. 963.50 s [vector] +++ OK, passed 100 tests.
  10955. 963.50 s [vector] map: OK
  10956. 963.50 s [vector] +++ OK, passed 100 tests.
  10957. 963.50 s [vector] imap: OK
  10958. 963.50 s [vector] +++ OK, passed 100 tests.
  10959. 963.50 s [vector] concatMap: OK
  10960. 963.50 s [vector] +++ OK, passed 100 tests.
  10961. 963.51 s [vector] mapM: OK
  10962. 963.53 s [vector] +++ OK, passed 100 tests.
  10963. 963.53 s [vector] mapM_: OK (0.02s)
  10964. 963.53 s [vector] +++ OK, passed 100 tests.
  10965. 963.54 s [vector] forM: OK
  10966. 963.55 s [vector] +++ OK, passed 100 tests.
  10967. 963.55 s [vector] forM_: OK (0.02s)
  10968. 963.55 s [vector] +++ OK, passed 100 tests.
  10969. 963.55 s [vector] imapM: OK
  10970. 963.56 s [vector] +++ OK, passed 100 tests.
  10971. 963.57 s [vector] imapM_: OK (0.02s)
  10972. 963.58 s [vector] +++ OK, passed 100 tests.
  10973. 963.58 s [vector] zipWith: OK
  10974. 963.58 s [vector] +++ OK, passed 100 tests.
  10975. 963.58 s [vector] zipWith3: OK
  10976. 963.58 s [vector] +++ OK, passed 100 tests.
  10977. 963.58 s [vector] izipWith: OK
  10978. 963.58 s [vector] +++ OK, passed 100 tests.
  10979. 963.58 s [vector] izipWith3: OK
  10980. 963.58 s [vector] +++ OK, passed 100 tests.
  10981. 963.58 s [vector] izipWithM: OK
  10982. 963.58 s [vector] +++ OK, passed 100 tests.
  10983. 963.60 s [vector] izipWithM_: OK (0.01s)
  10984. 963.60 s [vector] +++ OK, passed 100 tests.
  10985. 963.60 s [vector] zipWithM: OK
  10986. 963.60 s [vector] +++ OK, passed 100 tests.
  10987. 963.61 s [vector] zipWithM_: OK (0.01s)
  10988. 963.61 s [vector] +++ OK, passed 100 tests.
  10989. 963.61 s [vector] filter: OK
  10990. 963.61 s [vector] +++ OK, passed 100 tests.
  10991. 963.62 s [vector] ifilter: OK
  10992. 963.63 s [vector] +++ OK, passed 100 tests.
  10993. 963.63 s [vector] filterM: OK (0.02s)
  10994. 963.63 s [vector] +++ OK, passed 100 tests.
  10995. 963.63 s [vector] uniq: OK
  10996. 963.63 s [vector] +++ OK, passed 100 tests.
  10997. 963.64 s [vector] mapMaybe: OK
  10998. 963.64 s [vector] +++ OK, passed 100 tests.
  10999. 963.64 s [vector] imapMaybe: OK
  11000. 963.64 s [vector] +++ OK, passed 100 tests.
  11001. 963.64 s [vector] takeWhile: OK
  11002. 963.64 s [vector] +++ OK, passed 100 tests.
  11003. 963.64 s [vector] dropWhile: OK
  11004. 963.64 s [vector] +++ OK, passed 100 tests.
  11005. 963.64 s [vector] partition: OK
  11006. 963.64 s [vector] +++ OK, passed 100 tests.
  11007. 963.64 s [vector] partitionWith: OK
  11008. 963.64 s [vector] +++ OK, passed 100 tests.
  11009. 963.65 s [vector] span: OK
  11010. 963.65 s [vector] +++ OK, passed 100 tests.
  11011. 963.65 s [vector] break: OK
  11012. 963.65 s [vector] +++ OK, passed 100 tests.
  11013. 963.65 s [vector] spanR: OK
  11014. 963.65 s [vector] +++ OK, passed 100 tests.
  11015. 963.65 s [vector] breakR: OK
  11016. 963.65 s [vector] +++ OK, passed 100 tests.
  11017. 963.65 s [vector] groupBy: OK
  11018. 963.65 s [vector] +++ OK, passed 100 tests.
  11019. 963.65 s [vector] elem: OK
  11020. 963.65 s [vector] +++ OK, passed 100 tests.
  11021. 963.65 s [vector] notElem: OK
  11022. 963.65 s [vector] +++ OK, passed 100 tests.
  11023. 963.65 s [vector] find: OK
  11024. 963.65 s [vector] +++ OK, passed 100 tests.
  11025. 963.65 s [vector] findIndex: OK
  11026. 963.65 s [vector] +++ OK, passed 100 tests.
  11027. 963.65 s [vector] findIndexR: OK
  11028. 963.66 s [vector] +++ OK, passed 100 tests.
  11029. 963.66 s [vector] findIndices: OK
  11030. 963.66 s [vector] +++ OK, passed 100 tests.
  11031. 963.66 s [vector] elemIndex: OK
  11032. 963.67 s [vector] +++ OK, passed 100 tests.
  11033. 963.67 s [vector] elemIndices: OK
  11034. 963.67 s [vector] +++ OK, passed 100 tests.
  11035. 963.67 s [vector] foldl: OK
  11036. 963.68 s [vector] +++ OK, passed 100 tests.
  11037. 963.68 s [vector] foldl1: OK
  11038. 963.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11039. 963.68 s [vector] foldl': OK
  11040. 963.68 s [vector] +++ OK, passed 100 tests.
  11041. 963.68 s [vector] foldl1': OK
  11042. 963.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11043. 963.68 s [vector] foldr: OK
  11044. 963.68 s [vector] +++ OK, passed 100 tests.
  11045. 963.69 s [vector] foldr1: OK
  11046. 963.69 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11047. 963.69 s [vector] foldr': OK
  11048. 963.69 s [vector] +++ OK, passed 100 tests.
  11049. 963.69 s [vector] foldr1': OK
  11050. 963.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11051. 963.71 s [vector] ifoldl: OK
  11052. 963.71 s [vector] +++ OK, passed 100 tests.
  11053. 963.71 s [vector] ifoldl': OK
  11054. 963.71 s [vector] +++ OK, passed 100 tests.
  11055. 963.71 s [vector] ifoldr: OK
  11056. 963.71 s [vector] +++ OK, passed 100 tests.
  11057. 963.71 s [vector] ifoldr': OK
  11058. 963.71 s [vector] +++ OK, passed 100 tests.
  11059. 963.71 s [vector] ifoldM: OK
  11060. 963.71 s [vector] +++ OK, passed 100 tests.
  11061. 963.71 s [vector] ifoldM': OK
  11062. 963.71 s [vector] +++ OK, passed 100 tests.
  11063. 963.71 s [vector] ifoldM_: OK (0.01s)
  11064. 963.71 s [vector] +++ OK, passed 100 tests.
  11065. 963.72 s [vector] ifoldM'_: OK (0.02s)
  11066. 963.72 s [vector] +++ OK, passed 100 tests.
  11067. 963.72 s [vector] all: OK
  11068. 963.72 s [vector] +++ OK, passed 100 tests.
  11069. 963.72 s [vector] any: OK
  11070. 963.72 s [vector] +++ OK, passed 100 tests.
  11071. 963.72 s [vector] prescanl: OK
  11072. 963.72 s [vector] +++ OK, passed 100 tests.
  11073. 963.72 s [vector] prescanl': OK
  11074. 963.72 s [vector] +++ OK, passed 100 tests.
  11075. 963.72 s [vector] postscanl: OK
  11076. 963.72 s [vector] +++ OK, passed 100 tests.
  11077. 963.73 s [vector] postscanl': OK
  11078. 963.73 s [vector] +++ OK, passed 100 tests.
  11079. 963.73 s [vector] scanl: OK
  11080. 963.73 s [vector] +++ OK, passed 100 tests.
  11081. 963.73 s [vector] scanl': OK
  11082. 963.74 s [vector] +++ OK, passed 100 tests.
  11083. 963.74 s [vector] scanl1: OK
  11084. 963.74 s [vector] +++ OK, passed 100 tests.
  11085. 963.74 s [vector] scanl1': OK
  11086. 963.74 s [vector] +++ OK, passed 100 tests.
  11087. 963.74 s [vector] iscanl: OK
  11088. 963.74 s [vector] +++ OK, passed 100 tests.
  11089. 963.74 s [vector] iscanl': OK
  11090. 963.74 s [vector] +++ OK, passed 100 tests.
  11091. 963.75 s [vector] prescanr: OK
  11092. 963.75 s [vector] +++ OK, passed 100 tests.
  11093. 963.75 s [vector] prescanr': OK
  11094. 963.76 s [vector] +++ OK, passed 100 tests.
  11095. 963.76 s [vector] postscanr: OK
  11096. 963.76 s [vector] +++ OK, passed 100 tests.
  11097. 963.76 s [pandoc-lua-engine] Dependency aeson: using aeson-2.2.3.0
  11098. 963.76 s [pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
  11099. 963.76 s [pandoc-lua-engine] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
  11100. 963.76 s [pandoc-lua-engine] Dependency citeproc >=0.8 && <0.10: using citeproc-0.9.0.1
  11101. 963.76 s [pandoc-lua-engine] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
  11102. 963.76 s [pandoc-lua-engine] Dependency crypton >=0.30 && <1.1: using crypton-1.0.4
  11103. 963.76 s [pandoc-lua-engine] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
  11104. 963.76 s [pandoc-lua-engine] Dependency doclayout >=0.5 && <0.6: using doclayout-0.5.0.1
  11105. 963.76 s [pandoc-lua-engine] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
  11106. 963.76 s [pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
  11107. 963.76 s [pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
  11108. 963.76 s [pandoc-lua-engine] Dependency hslua-module-doclayout >=1.2 && <1.3: using
  11109. 963.76 s [pandoc-lua-engine] hslua-module-doclayout-1.2.0.1
  11110. 963.76 s [pandoc-lua-engine] Dependency hslua-module-path >=1.1 && <1.2: using hslua-module-path-1.1.1
  11111. 963.76 s [pandoc-lua-engine] Dependency hslua-module-system >=1.1 && <1.3: using hslua-module-system-1.1.3
  11112. 963.76 s [pandoc-lua-engine] Dependency hslua-module-text >=1.1 && <1.2: using hslua-module-text-1.1.1
  11113. 963.76 s [pandoc-lua-engine] Dependency hslua-module-version >=1.1 && <1.2: using
  11114. 963.76 s [pandoc-lua-engine] hslua-module-version-1.1.1
  11115. 963.76 s [pandoc-lua-engine] Dependency hslua-module-zip >=1.1.3 && <1.2: using hslua-module-zip-1.1.4
  11116. 963.76 s [pandoc-lua-engine] Dependency hslua-repl >=0.1.1 && <0.2: using hslua-repl-0.1.2
  11117. 963.76 s [pandoc-lua-engine] Dependency lpeg >=1.1 && <1.2: using lpeg-1.1.0
  11118. 963.76 s [pandoc-lua-engine] Dependency mtl >=2.2 && <2.4: using mtl-2.3.1
  11119. 963.76 s [pandoc-lua-engine] Dependency pandoc >=3.7 && <3.8: using pandoc-3.7.0.2
  11120. 963.76 s [pandoc-lua-engine] Dependency pandoc-lua-marshal >=0.3 && <0.4: using pandoc-lua-marshal-0.3.1
  11121. 963.76 s [pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
  11122. 963.76 s [pandoc-lua-engine] Dependency parsec >=3.1 && <3.2: using parsec-3.1.18.0
  11123. 963.76 s [pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
  11124. 963.76 s [pandoc-lua-engine] Dependency base >=4.12 && <5: using base-4.20.2.0
  11125. 963.76 s [pandoc-lua-engine] Dependency bytestring: using bytestring-0.12.2.0
  11126. 963.76 s [pandoc-lua-engine] Dependency data-default: using data-default-0.8.0.1
  11127. 963.76 s [pandoc-lua-engine] Dependency directory: using directory-1.3.8.5
  11128. 963.76 s [pandoc-lua-engine] Dependency exceptions >=0.8 && <0.11: using exceptions-0.10.9
  11129. 963.76 s [pandoc-lua-engine] Dependency filepath: using filepath-1.5.4.0
  11130. 963.76 s [pandoc-lua-engine] Dependency hslua >=2.3 && <2.5: using hslua-2.3.1
  11131. 963.76 s [pandoc-lua-engine] Dependency pandoc: using pandoc-3.7.0.2
  11132. 963.76 s [pandoc-lua-engine] Dependency pandoc-lua-engine: using pandoc-lua-engine-0.4.3
  11133. 963.76 s [pandoc-lua-engine] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
  11134. 963.76 s [pandoc-lua-engine] Dependency tasty: using tasty-1.5.3
  11135. 963.76 s [pandoc-lua-engine] Dependency tasty-golden: using tasty-golden-2.3.5
  11136. 963.76 s [pandoc-lua-engine] Dependency tasty-hunit: using tasty-hunit-0.10.2
  11137. 963.76 s [pandoc-lua-engine] Dependency tasty-lua >=1.1 && <1.2: using tasty-lua-1.1.2
  11138. 963.76 s [pandoc-lua-engine] Dependency text >=1.1.1 && <2.2: using text-2.1.3
  11139. 963.76 s [pandoc-lua-engine] Source component graph:
  11140. 963.76 s [pandoc-lua-engine] component lib
  11141. 963.76 s [pandoc-lua-engine] component test:test-pandoc-lua-engine dependency lib
  11142. 963.76 s [pandoc-lua-engine] Configured component graph:
  11143. 963.76 s [pandoc-lua-engine] component pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11144. 963.76 s [pandoc-lua-engine] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11145. 963.76 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11146. 963.76 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11147. 963.77 s [pandoc-lua-engine] include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
  11148. 963.77 s [pandoc-lua-engine] include containers-0.7-504a
  11149. 963.77 s [pandoc-lua-engine] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  11150. 963.77 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11151. 963.77 s [pandoc-lua-engine] include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
  11152. 963.77 s [pandoc-lua-engine] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11153. 963.77 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11154. 963.77 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11155. 963.77 s [pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
  11156. 963.77 s [pandoc-lua-engine] include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
  11157. 963.77 s [pandoc-lua-engine] include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
  11158. 963.77 s [pandoc-lua-engine] include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
  11159. 963.77 s [pandoc-lua-engine] include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
  11160. 963.77 s [pandoc-lua-engine] include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
  11161. 963.77 s [pandoc-lua-engine] include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
  11162. 963.77 s [pandoc-lua-engine] include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
  11163. 963.77 s [pandoc-lua-engine] include mtl-2.3.1-b4af
  11164. 963.77 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11165. 963.77 s [pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
  11166. 963.77 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11167. 963.77 s [pandoc-lua-engine] include parsec-3.1.18.0-b178
  11168. 963.77 s [pandoc-lua-engine] include text-2.1.3-c691
  11169. 963.77 s [pandoc-lua-engine] component pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
  11170. 963.77 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11171. 963.77 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11172. 963.77 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11173. 963.77 s [pandoc-lua-engine] include directory-1.3.8.5-c84a
  11174. 963.77 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11175. 963.77 s [pandoc-lua-engine] include filepath-1.5.4.0-e600
  11176. 963.77 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11177. 963.77 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11178. 963.77 s [pandoc-lua-engine] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11179. 963.77 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11180. 963.77 s [pandoc-lua-engine] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  11181. 963.77 s [pandoc-lua-engine] include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
  11182. 963.77 s [pandoc-lua-engine] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  11183. 963.77 s [pandoc-lua-engine] include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
  11184. 963.77 s [pandoc-lua-engine] include text-2.1.3-c691
  11185. 963.77 s [pandoc-lua-engine] Linked component graph:
  11186. 963.77 s [pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11187. 963.77 s [pandoc-lua-engine] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11188. 963.77 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11189. 963.77 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11190. 963.77 s [pandoc-lua-engine] include citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
  11191. 963.77 s [pandoc-lua-engine] include containers-0.7-504a
  11192. 963.77 s [pandoc-lua-engine] include crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  11193. 963.77 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11194. 963.77 s [pandoc-lua-engine] include doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
  11195. 963.77 s [pandoc-lua-engine] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11196. 963.77 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11197. 963.77 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11198. 963.77 s [pandoc-lua-engine] include hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
  11199. 963.77 s [pandoc-lua-engine] include hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
  11200. 963.77 s [pandoc-lua-engine] include hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
  11201. 963.77 s [pandoc-lua-engine] include hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
  11202. 963.77 s [pandoc-lua-engine] include hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
  11203. 963.77 s [pandoc-lua-engine] include hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
  11204. 963.77 s [pandoc-lua-engine] include hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
  11205. 963.77 s [pandoc-lua-engine] include lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
  11206. 963.77 s [pandoc-lua-engine] include mtl-2.3.1-b4af
  11207. 963.77 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11208. 963.77 s [pandoc-lua-engine] include pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
  11209. 963.77 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11210. 963.77 s [pandoc-lua-engine] include parsec-3.1.18.0-b178
  11211. 963.77 s [pandoc-lua-engine] include text-2.1.3-c691
  11212. 963.77 s [pandoc-lua-engine] Text.Pandoc.Lua=pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4:Text.Pandoc.Lua
  11213. 963.77 s [pandoc-lua-engine] unit pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
  11214. 963.77 s [pandoc-lua-engine] include base-4.20.2.0-64da
  11215. 963.77 s [pandoc-lua-engine] include bytestring-0.12.2.0-262e
  11216. 963.77 s [pandoc-lua-engine] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11217. 963.77 s [pandoc-lua-engine] include directory-1.3.8.5-c84a
  11218. 963.77 s [pandoc-lua-engine] include exceptions-0.10.9-1a12
  11219. 963.77 s [pandoc-lua-engine] include filepath-1.5.4.0-e600
  11220. 963.77 s [pandoc-lua-engine] include hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11221. 963.77 s [pandoc-lua-engine] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11222. 963.77 s [pandoc-lua-engine] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11223. 963.77 s [pandoc-lua-engine] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11224. 963.77 s [pandoc-lua-engine] include tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  11225. 963.77 s [pandoc-lua-engine] include tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
  11226. 963.77 s [pandoc-lua-engine] include tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  11227. 963.77 s [pandoc-lua-engine] include tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
  11228. 963.77 s [pandoc-lua-engine] include text-2.1.3-c691
  11229. 963.77 s [pandoc-lua-engine] Ready component graph:
  11230. 963.77 s [pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11231. 963.77 s [pandoc-lua-engine] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11232. 963.77 s [pandoc-lua-engine] depends base-4.20.2.0-64da
  11233. 963.77 s [pandoc-lua-engine] depends bytestring-0.12.2.0-262e
  11234. 963.77 s [pandoc-lua-engine] depends citeproc-0.9.0.1-8eZIkwGUgwZIclKUEeSqkh
  11235. 963.77 s [pandoc-lua-engine] depends containers-0.7-504a
  11236. 963.77 s [pandoc-lua-engine] depends crypton-1.0.4-1q6uwxo2tOdF6dyEFtI6Wj
  11237. 963.77 s [pandoc-lua-engine] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11238. 963.77 s [pandoc-lua-engine] depends doclayout-0.5.0.1-ETXOcBr0tml6gEsSGXL6oV
  11239. 963.77 s [pandoc-lua-engine] depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11240. 963.77 s [pandoc-lua-engine] depends exceptions-0.10.9-1a12
  11241. 963.77 s [pandoc-lua-engine] depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11242. 963.77 s [pandoc-lua-engine] depends hslua-module-doclayout-1.2.0.1-ErY6mbvHQgAEdxA7VP30qJ
  11243. 963.77 s [pandoc-lua-engine] depends hslua-module-path-1.1.1-u1nrCdvNoJBLk9wjMCk0d
  11244. 963.77 s [pandoc-lua-engine] depends hslua-module-system-1.1.3-C64Ey1CTges1ct5bp4x6FI
  11245. 963.77 s [pandoc-lua-engine] depends hslua-module-text-1.1.1-KHVA6Tk8C366LjT6lG2vsI
  11246. 963.77 s [pandoc-lua-engine] depends hslua-module-version-1.1.1-31iUzkcfJgL8o5QdosdhcV
  11247. 963.77 s [pandoc-lua-engine] depends hslua-module-zip-1.1.4-7o7wUu0Aa5uJq1MktjFd3a
  11248. 963.77 s [pandoc-lua-engine] depends hslua-repl-0.1.2-Juvw7nYrTHo9eZBtoxILD7
  11249. 963.77 s [pandoc-lua-engine] depends lpeg-1.1.0-84tlw7PTtFB7quUkAvIAre
  11250. 963.77 s [pandoc-lua-engine] depends mtl-2.3.1-b4af
  11251. 963.77 s [pandoc-lua-engine] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11252. 963.77 s [vector] postscanr': OK
  11253. 963.77 s [vector] +++ OK, passed 100 tests.
  11254. 963.77 s [vector] scanr: OK
  11255. 963.77 s [vector] +++ OK, passed 100 tests.
  11256. 963.77 s [vector] scanr': OK
  11257. 963.77 s [vector] +++ OK, passed 100 tests.
  11258. 963.77 s [vector] scanr1: OK
  11259. 963.78 s [vector] +++ OK, passed 100 tests.
  11260. 963.78 s [vector] scanr1': OK
  11261. 963.78 s [vector] +++ OK, passed 100 tests.
  11262. 963.78 s [vector] iscanr: OK
  11263. 963.78 s [vector] +++ OK, passed 100 tests.
  11264. 963.78 s [vector] iscanr': OK
  11265. 963.78 s [vector] +++ OK, passed 100 tests.
  11266. 963.78 s [vector] mut_read: OK
  11267. 963.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11268. 963.79 s [vector] mut_write: OK
  11269. 963.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11270. 963.79 s [vector] mut_modify: OK
  11271. 963.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11272. 963.80 s [vector] mut_generate: OK
  11273. 963.80 s [vector] +++ OK, passed 100 tests.
  11274. 963.80 s [vector] mut_generateM: OK (0.01s)
  11275. 963.80 s [vector] +++ OK, passed 100 tests.
  11276. 963.82 s [vector] mut_mapM_: OK (0.02s)
  11277. 963.82 s [vector] +++ OK, passed 100 tests.
  11278. 963.83 s [pandoc-lua-engine] depends pandoc-lua-marshal-0.3.1-CEai8TZ59D36cGPSocsWLC
  11279. 963.83 s [pandoc-lua-engine] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11280. 963.83 s [pandoc-lua-engine] depends parsec-3.1.18.0-b178
  11281. 963.83 s [pandoc-lua-engine] depends text-2.1.3-c691
  11282. 963.83 s [pandoc-lua-engine] definite pandoc-lua-engine-0.4.3-3LEmP89EEdjCRAN3LsL1y3-test-pandoc-lua-engine
  11283. 963.83 s [pandoc-lua-engine] depends base-4.20.2.0-64da
  11284. 963.83 s [pandoc-lua-engine] depends bytestring-0.12.2.0-262e
  11285. 963.83 s [pandoc-lua-engine] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11286. 963.83 s [pandoc-lua-engine] depends directory-1.3.8.5-c84a
  11287. 963.83 s [pandoc-lua-engine] depends exceptions-0.10.9-1a12
  11288. 963.83 s [pandoc-lua-engine] depends filepath-1.5.4.0-e600
  11289. 963.83 s [pandoc-lua-engine] depends hslua-2.3.1-2u5PxJdzmf64O4i47k1PVi
  11290. 963.83 s [pandoc-lua-engine] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11291. 963.83 s [pandoc-lua-engine] depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11292. 963.83 s [pandoc-lua-engine] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11293. 963.83 s [pandoc-lua-engine] depends tasty-1.5.3-G9Yzt8NHi59EMJ9EpY1hVQ
  11294. 963.83 s [pandoc-lua-engine] depends tasty-golden-2.3.5-3QQ0reIfFJ36gfVIlepFcf
  11295. 963.83 s [pandoc-lua-engine] depends tasty-hunit-0.10.2-A8CripGhFniB64lHINz5Kq
  11296. 963.83 s [pandoc-lua-engine] depends tasty-lua-1.1.2-1O8o765OPu9IHWrmpruNIo
  11297. 963.83 s [pandoc-lua-engine] depends text-2.1.3-c691
  11298. 963.83 s [pandoc-lua-engine] Using Cabal-3.12.1.0 compiled by ghc-9.10
  11299. 963.83 s [pandoc-lua-engine] Using compiler: ghc-9.10.3
  11300. 963.83 s [pandoc-lua-engine] Using install prefix:
  11301. 963.83 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
  11302. 963.83 s [pandoc-lua-engine] Executables installed in:
  11303. 963.83 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/bin
  11304. 963.83 s [pandoc-lua-engine] Libraries installed in:
  11305. 963.83 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  11306. 963.83 s [pandoc-lua-engine] Dynamic Libraries installed in:
  11307. 963.83 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  11308. 963.83 s [pandoc-lua-engine] Private executables installed in:
  11309. 963.83 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3
  11310. 963.83 s [pandoc-lua-engine] Data files installed in:
  11311. 963.83 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3
  11312. 963.83 s [pandoc-lua-engine] Documentation installed in:
  11313. 963.83 s [pandoc-lua-engine] /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc/share/doc/pandoc-lua-engine-0.4.3
  11314. 963.83 s [pandoc-lua-engine] Configuration files installed in:
  11315. 963.83 s [pandoc-lua-engine] /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/etc
  11316. 963.83 s [pandoc-lua-engine] No alex found
  11317. 963.83 s [pandoc-lua-engine] Using ar found on system at:
  11318. 963.83 s [pandoc-lua-engine] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  11319. 963.83 s [pandoc-lua-engine] No c2hs found
  11320. 963.83 s [pandoc-lua-engine] No cpphs found
  11321. 963.83 s [pandoc-lua-engine] No doctest found
  11322. 963.83 s [pandoc-lua-engine] Using gcc version 14.3.0 given by user at:
  11323. 963.83 s [pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  11324. 963.83 s [pandoc-lua-engine] Using ghc version 9.10.3 found on system at:
  11325. 963.83 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  11326. 963.83 s [pandoc-lua-engine] Using ghc-pkg version 9.10.3 found on system at:
  11327. 963.83 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  11328. 963.83 s [pandoc-lua-engine] No ghcjs found
  11329. 963.83 s [pandoc-lua-engine] No ghcjs-pkg found
  11330. 963.83 s [pandoc-lua-engine] No greencard found
  11331. 963.83 s [pandoc-lua-engine] Using haddock version 2.31.1 found on system at:
  11332. 963.83 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  11333. 963.83 s [pandoc-lua-engine] No happy found
  11334. 963.83 s [pandoc-lua-engine] Using haskell-suite found on system at: haskell-suite-dummy-location
  11335. 963.83 s [pandoc-lua-engine] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  11336. 963.83 s [pandoc-lua-engine] No hmake found
  11337. 963.83 s [pandoc-lua-engine] Using hpc version 0.69 found on system at:
  11338. 963.83 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  11339. 963.83 s [pandoc-lua-engine] Using hsc2hs version 0.68.10 found on system at:
  11340. 963.83 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  11341. 963.83 s [pandoc-lua-engine] Using hscolour version 1.25 found on system at:
  11342. 963.83 s [pandoc-lua-engine] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  11343. 963.83 s [pandoc-lua-engine] No jhc found
  11344. 963.83 s [pandoc-lua-engine] Using ld found on system at:
  11345. 963.83 s [pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  11346. 963.83 s [pandoc-lua-engine] No pkg-config found
  11347. 963.83 s [pandoc-lua-engine] Using runghc version 9.10.3 found on system at:
  11348. 963.83 s [pandoc-lua-engine] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  11349. 963.83 s [pandoc-lua-engine] Using strip version 2.44 found on system at:
  11350. 963.83 s [pandoc-lua-engine] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  11351. 963.83 s [pandoc-lua-engine] Using tar found on system at:
  11352. 963.83 s [pandoc-lua-engine] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  11353. 963.83 s [pandoc-lua-engine] No uhc found
  11354. 963.84 s [vector] mut_imapM_: OK (0.02s)
  11355. 963.84 s [vector] +++ OK, passed 100 tests.
  11356. 963.86 s [vector] mut_forM_: OK (0.02s)
  11357. 963.86 s [vector] +++ OK, passed 100 tests.
  11358. 963.86 s [vector] mut_iforM_: OK (0.01s)
  11359. 963.86 s [vector] +++ OK, passed 100 tests.
  11360. 963.87 s [vector] mut_foldr: OK
  11361. 963.87 s [vector] +++ OK, passed 100 tests.
  11362. 963.87 s [vector] mut_foldr': OK
  11363. 963.87 s [vector] +++ OK, passed 100 tests.
  11364. 963.87 s [vector] mut_foldl: OK
  11365. 963.87 s [vector] +++ OK, passed 100 tests.
  11366. 963.88 s [vector] mut_foldl': OK
  11367. 963.88 s [vector] +++ OK, passed 100 tests.
  11368. 963.88 s [vector] mut_ifoldr: OK
  11369. 963.88 s [vector] +++ OK, passed 100 tests.
  11370. 963.88 s [vector] mut_ifoldr': OK
  11371. 963.88 s [vector] +++ OK, passed 100 tests.
  11372. 963.89 s [vector] mut_ifoldl: OK
  11373. 963.89 s [vector] +++ OK, passed 100 tests.
  11374. 963.89 s [vector] mut_ifoldl': OK
  11375. 963.89 s [vector] +++ OK, passed 100 tests.
  11376. 963.89 s [vector] mut_foldM: OK
  11377. 963.89 s [vector] +++ OK, passed 100 tests.
  11378. 963.90 s [vector] mut_foldM': OK
  11379. 963.90 s [vector] +++ OK, passed 100 tests.
  11380. 963.90 s [vector] mut_foldrM: OK
  11381. 963.90 s [vector] +++ OK, passed 100 tests.
  11382. 963.90 s [vector] mut_foldrM': OK
  11383. 963.90 s [vector] +++ OK, passed 100 tests.
  11384. 963.90 s [vector] mut_ifoldM: OK
  11385. 963.90 s [vector] +++ OK, passed 100 tests.
  11386. 963.91 s [vector] mut_ifoldM': OK
  11387. 963.91 s [vector] +++ OK, passed 100 tests.
  11388. 963.91 s [vector] mut_ifoldrM: OK
  11389. 963.91 s [vector] +++ OK, passed 100 tests.
  11390. 963.91 s [vector] mut_ifoldrM': OK
  11391. 963.91 s [vector] +++ OK, passed 100 tests.
  11392. 963.91 s [vector] compare: OK
  11393. 963.91 s [vector] +++ OK, passed 100 tests.
  11394. 963.91 s [vector] maximum: OK
  11395. 963.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11396. 963.91 s [vector] minimum: OK
  11397. 963.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11398. 963.91 s [vector] minIndex: OK
  11399. 963.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11400. 963.91 s [vector] maxIndex: OK
  11401. 963.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11402. 963.91 s [vector] maximumBy: OK
  11403. 963.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11404. 963.91 s [vector] minimumBy: OK
  11405. 963.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11406. 963.91 s [vector] maximumOn: OK
  11407. 963.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11408. 963.91 s [vector] minimumOn: OK
  11409. 963.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11410. 963.92 s [vector] maxIndexBy: OK
  11411. 963.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11412. 963.92 s [vector] minIndexBy: OK
  11413. 963.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11414. 963.92 s [vector] ListFirstMaxIndexWins: OK
  11415. 963.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11416. 963.92 s [vector] FalseListFirstMaxIndexWins: OK
  11417. 963.92 s [vector] +++ OK, failed as expected. (after 1 test):
  11418. 963.93 s [vector] Exception:
  11419. 963.93 s [vector] Prelude.foldr1: empty list
  11420. 963.93 s [vector] CallStack (from HasCallStack):
  11421. 963.93 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11422. 963.93 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11423. 963.93 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11424. 963.93 s [vector] []
  11425. 963.93 s [vector] mempty: OK
  11426. 963.93 s [vector] +++ OK, passed 100 tests.
  11427. 963.93 s [vector] mappend: OK
  11428. 963.93 s [vector] +++ OK, passed 100 tests.
  11429. 963.93 s [vector] mconcat: OK (0.01s)
  11430. 963.93 s [vector] +++ OK, passed 100 tests.
  11431. 963.93 s [vector] glength: OK
  11432. 963.93 s [vector] +++ OK, passed 100 tests.
  11433. 963.93 s [vector] sum: OK
  11434. 963.93 s [vector] +++ OK, passed 100 tests.
  11435. 963.93 s [vector] product: OK
  11436. 963.93 s [vector] +++ OK, passed 100 tests.
  11437. 963.93 s [vector] enumFromN: OK
  11438. 963.93 s [vector] +++ OK, passed 100 tests.
  11439. 963.93 s [vector] enumFromThenN: OK
  11440. 963.94 s [vector] +++ OK, passed 100 tests.
  11441. 963.94 s [vector] enumFromTo: OK
  11442. 963.94 s [vector] +++ OK, passed 100 tests.
  11443. 963.94 s [vector] enumFromThenTo: OK
  11444. 963.94 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11445. 963.94 s [vector] Data.Vector.Storable.Vector (Double)
  11446. 963.94 s [vector] fromList.toList == id: OK
  11447. 963.94 s [vector] +++ OK, passed 100 tests.
  11448. 963.94 s [vector] toList.fromList == id: OK
  11449. 963.94 s [vector] +++ OK, passed 100 tests.
  11450. 963.94 s [vector] unstream.stream == id: OK
  11451. 963.94 s [vector] +++ OK, passed 100 tests.
  11452. 963.94 s [vector] stream.unstream == id: OK
  11453. 963.94 s [vector] +++ OK, passed 100 tests.
  11454. 963.94 s [vector] eq: OK
  11455. 963.94 s [vector] +++ OK, passed 100 tests.
  11456. 963.94 s [vector] length: OK
  11457. 963.94 s [vector] +++ OK, passed 100 tests.
  11458. 963.94 s [vector] null: OK
  11459. 963.94 s [vector] +++ OK, passed 100 tests.
  11460. 963.94 s [vector] index: OK
  11461. 963.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11462. 963.94 s [vector] safeIndex: OK
  11463. 963.94 s [vector] +++ OK, passed 100 tests.
  11464. 963.94 s [vector] head: OK
  11465. 963.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11466. 963.94 s [vector] last: OK
  11467. 963.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11468. 963.94 s [vector] unsafeIndex: OK
  11469. 963.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11470. 963.94 s [vector] unsafeHead: OK
  11471. 963.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11472. 963.95 s [vector] unsafeLast: OK
  11473. 963.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11474. 963.95 s [vector] slice: OK
  11475. 963.95 s [vector] +++ OK, passed 100 tests.
  11476. 963.95 s [vector] init: OK
  11477. 963.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11478. 963.95 s [vector] tail: OK
  11479. 963.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11480. 963.95 s [vector] take: OK
  11481. 963.95 s [vector] +++ OK, passed 100 tests.
  11482. 963.95 s [vector] drop: OK
  11483. 963.95 s [vector] +++ OK, passed 100 tests.
  11484. 963.95 s [vector] splitAt: OK
  11485. 963.95 s [vector] +++ OK, passed 100 tests.
  11486. 963.95 s [vector] empty: OK
  11487. 963.95 s [vector] +++ OK, passed 100 tests.
  11488. 963.95 s [vector] singleton: OK
  11489. 963.95 s [vector] +++ OK, passed 100 tests.
  11490. 963.95 s [vector] replicate: OK
  11491. 963.95 s [vector] +++ OK, passed 100 tests.
  11492. 963.95 s [vector] generate: OK
  11493. 963.96 s [vector] +++ OK, passed 100 tests.
  11494. 963.97 s [vector] iterateN: OK
  11495. 963.97 s [vector] +++ OK, passed 100 tests.
  11496. 963.97 s [pandoc-server] Dependency aeson >=2.0 && <2.3: using aeson-2.2.3.0
  11497. 963.97 s [pandoc-server] Dependency base >=4.12 && <5: using base-4.20.2.0
  11498. 963.97 s [pandoc-server] Dependency base64-bytestring >=0.1 && <1.3: using base64-bytestring-1.2.1.0
  11499. 963.97 s [pandoc-server] Dependency bytestring >=0.9 && <0.13: using bytestring-0.12.2.0
  11500. 963.98 s [pandoc-server] Dependency containers >=0.6.0.1 && <0.9: using containers-0.7
  11501. 963.98 s [pandoc-server] Dependency data-default >=0.4 && <0.9: using data-default-0.8.0.1
  11502. 963.98 s [pandoc-server] Dependency doctemplates >=0.11 && <0.12: using doctemplates-0.11.0.1
  11503. 963.98 s [pandoc-server] Dependency pandoc >=3.5 && <3.8: using pandoc-3.7.0.2
  11504. 963.98 s [pandoc-server] Dependency pandoc-types >=1.22 && <1.24: using pandoc-types-1.23.1
  11505. 963.98 s [pandoc-server] Dependency servant-server >=0.19 && <0.21: using servant-server-0.20.3.0
  11506. 963.98 s [pandoc-server] Dependency skylighting >=0.13 && <0.15: using skylighting-0.14.7
  11507. 963.98 s [pandoc-server] Dependency text >=1.1.1.0 && <2.2: using text-2.1.3
  11508. 963.98 s [pandoc-server] Dependency unicode-collation >=0.1.1 && <0.2: using unicode-collation-0.1.3.6
  11509. 963.98 s [pandoc-server] Dependency wai >=3.2 && <3.3: using wai-3.2.4
  11510. 963.98 s [pandoc-server] Dependency wai-cors >=0.2.7 && <0.3: using wai-cors-0.2.7
  11511. 963.98 s [pandoc-server] Source component graph: component lib
  11512. 963.98 s [pandoc-server] Configured component graph:
  11513. 963.98 s [pandoc-server] component pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  11514. 963.98 s [pandoc-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11515. 963.98 s [pandoc-server] include base-4.20.2.0-64da
  11516. 963.98 s [pandoc-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  11517. 963.98 s [pandoc-server] include bytestring-0.12.2.0-262e
  11518. 963.98 s [pandoc-server] include containers-0.7-504a
  11519. 963.98 s [pandoc-server] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11520. 963.98 s [pandoc-server] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11521. 963.98 s [pandoc-server] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11522. 963.98 s [pandoc-server] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11523. 963.98 s [pandoc-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  11524. 963.98 s [pandoc-server] include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
  11525. 963.98 s [pandoc-server] include text-2.1.3-c691
  11526. 963.98 s [pandoc-server] include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
  11527. 963.98 s [pandoc-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  11528. 963.98 s [pandoc-server] include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
  11529. 963.98 s [pandoc-server] Linked component graph:
  11530. 963.98 s [pandoc-server] unit pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  11531. 963.98 s [pandoc-server] include aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11532. 963.98 s [pandoc-server] include base-4.20.2.0-64da
  11533. 963.98 s [pandoc-server] include base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  11534. 963.98 s [pandoc-server] include bytestring-0.12.2.0-262e
  11535. 963.98 s [pandoc-server] include containers-0.7-504a
  11536. 963.98 s [pandoc-server] include data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11537. 963.98 s [pandoc-server] include doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11538. 963.98 s [pandoc-server] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11539. 963.98 s [pandoc-server] include pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11540. 963.98 s [pandoc-server] include servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  11541. 963.98 s [pandoc-server] include skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
  11542. 963.98 s [pandoc-server] include text-2.1.3-c691
  11543. 963.98 s [pandoc-server] include unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
  11544. 963.98 s [pandoc-server] include wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  11545. 963.98 s [pandoc-server] include wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
  11546. 963.98 s [pandoc-server] Text.Pandoc.Server=pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM:Text.Pandoc.Server
  11547. 963.98 s [pandoc-server] Ready component graph:
  11548. 963.98 s [pandoc-server] definite pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  11549. 963.98 s [pandoc-server] depends aeson-2.2.3.0-7E4AsQHgFKfArDQma5twwk
  11550. 963.98 s [pandoc-server] depends base-4.20.2.0-64da
  11551. 963.98 s [pandoc-server] depends base64-bytestring-1.2.1.0-3UFJK5wnOrqGGvuh3GKKrz
  11552. 963.98 s [pandoc-server] depends bytestring-0.12.2.0-262e
  11553. 963.98 s [pandoc-server] depends containers-0.7-504a
  11554. 963.98 s [pandoc-server] depends data-default-0.8.0.1-ByKaTL2K8MiLGiE7z4PwLO
  11555. 963.98 s [pandoc-server] depends doctemplates-0.11.0.1-3IxkRZEwO7j4PZOMczCd6F
  11556. 963.98 s [pandoc-server] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  11557. 963.98 s [pandoc-server] depends pandoc-types-1.23.1-EtmNVCh0eX3EXXhinUtwiG
  11558. 963.98 s [pandoc-server] depends servant-server-0.20.3.0-KfCT9L1u35cEjSigV7mnns
  11559. 963.98 s [pandoc-server] depends skylighting-0.14.7-E1NlMTbMaxi21IaCy26ZSc
  11560. 963.98 s [pandoc-server] depends text-2.1.3-c691
  11561. 963.98 s [pandoc-server] depends unicode-collation-0.1.3.6-GNgjxqiCGZCDNShq4d28XS
  11562. 963.98 s [pandoc-server] depends wai-3.2.4-5M0NL4oY5PvG2QmhR4DwS3
  11563. 963.98 s [pandoc-server] depends wai-cors-0.2.7-LUOr3sfxSGX6rgruuv5vs2
  11564. 963.98 s [pandoc-server] Using Cabal-3.12.1.0 compiled by ghc-9.10
  11565. 963.98 s [pandoc-server] Using compiler: ghc-9.10.3
  11566. 963.98 s [pandoc-server] Using install prefix:
  11567. 963.98 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  11568. 963.98 s [pandoc-server] Executables installed in:
  11569. 963.98 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/bin
  11570. 963.98 s [pandoc-server] Libraries installed in:
  11571. 963.98 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  11572. 963.98 s [pandoc-server] Dynamic Libraries installed in:
  11573. 963.98 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  11574. 963.98 s [pandoc-server] Private executables installed in:
  11575. 963.98 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11
  11576. 963.98 s [pandoc-server] Data files installed in:
  11577. 963.98 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11
  11578. 963.98 s [pandoc-server] Documentation installed in:
  11579. 963.98 s [pandoc-server] /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc/share/doc/pandoc-server-0.1.0.11
  11580. 963.98 s [pandoc-server] Configuration files installed in:
  11581. 963.98 s [pandoc-server] /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/etc
  11582. 963.98 s [pandoc-server] No alex found
  11583. 963.98 s [pandoc-server] Using ar found on system at:
  11584. 963.98 s [pandoc-server] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  11585. 963.98 s [pandoc-server] No c2hs found
  11586. 963.98 s [pandoc-server] No cpphs found
  11587. 963.98 s [pandoc-server] No doctest found
  11588. 963.98 s [pandoc-server] Using gcc version 14.3.0 given by user at:
  11589. 963.98 s [pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  11590. 963.98 s [pandoc-server] Using ghc version 9.10.3 found on system at:
  11591. 963.98 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  11592. 963.98 s [pandoc-server] Using ghc-pkg version 9.10.3 found on system at:
  11593. 963.98 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  11594. 963.98 s [pandoc-server] No ghcjs found
  11595. 963.98 s [pandoc-server] No ghcjs-pkg found
  11596. 963.98 s [pandoc-server] No greencard found
  11597. 963.98 s [pandoc-server] Using haddock version 2.31.1 found on system at:
  11598. 963.98 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  11599. 963.98 s [pandoc-server] No happy found
  11600. 963.98 s [pandoc-server] Using haskell-suite found on system at: haskell-suite-dummy-location
  11601. 963.98 s [pandoc-server] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  11602. 963.98 s [pandoc-server] No hmake found
  11603. 963.98 s [pandoc-server] Using hpc version 0.69 found on system at:
  11604. 963.98 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  11605. 963.98 s [pandoc-server] Using hsc2hs version 0.68.10 found on system at:
  11606. 963.98 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  11607. 963.98 s [pandoc-server] Using hscolour version 1.25 found on system at:
  11608. 963.98 s [pandoc-server] /nix/store/f755skyzf4jvfx3crwq9mmh3x4lsaz8i-hscolour-1.25/bin/HsColour
  11609. 963.98 s [pandoc-server] No jhc found
  11610. 963.98 s [pandoc-server] Using ld found on system at:
  11611. 963.98 s [pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  11612. 963.98 s [pandoc-server] No pkg-config found
  11613. 963.98 s [pandoc-server] Using runghc version 9.10.3 found on system at:
  11614. 963.98 s [pandoc-server] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  11615. 963.98 s [pandoc-server] Using strip version 2.44 found on system at:
  11616. 963.98 s [pandoc-server] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  11617. 963.98 s [pandoc-server] Using tar found on system at:
  11618. 963.98 s [pandoc-server] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  11619. 963.98 s [pandoc-server] No uhc found
  11620. 963.98 s [vector] iterateNM: OK (0.03s)
  11621. 963.98 s [vector] +++ OK, passed 100 tests.
  11622. 964.01 s [vector] generateM: OK (0.02s)
  11623. 964.01 s [vector] +++ OK, passed 100 tests.
  11624. 964.02 s [vector] replicateM: OK
  11625. 964.02 s [vector] +++ OK, passed 100 tests.
  11626. 964.02 s [vector] create: OK
  11627. 964.02 s [vector] +++ OK, passed 100 tests.
  11628. 964.02 s [vector] createT: OK
  11629. 964.02 s [vector] +++ OK, passed 100 tests.
  11630. 964.02 s [vector] unfoldr: OK
  11631. 964.02 s [vector] +++ OK, passed 100 tests.
  11632. 964.02 s [vector] unfoldrN: OK
  11633. 964.02 s [vector] +++ OK, passed 100 tests.
  11634. 964.02 s [vector] unfoldrExactN: OK
  11635. 964.02 s [vector] +++ OK, passed 100 tests.
  11636. 964.03 s [vector] unfoldrM: OK
  11637. 964.03 s [vector] +++ OK, passed 100 tests.
  11638. 964.03 s [vector] unfoldrNM: OK
  11639. 964.03 s [vector] +++ OK, passed 100 tests.
  11640. 964.04 s [vector] unfoldrExactNM: OK
  11641. 964.04 s [vector] +++ OK, passed 100 tests.
  11642. 964.06 s [vector] constructN: OK (0.01s)
  11643. 964.06 s [vector] +++ OK, passed 100 tests.
  11644. 964.06 s [vector] constructrN: OK
  11645. 964.07 s [vector] +++ OK, passed 100 tests.
  11646. 964.09 s [vector] cons: OK
  11647. 964.09 s [vector] +++ OK, passed 100 tests.
  11648. 964.09 s [vector] snoc: OK
  11649. 964.09 s [vector] +++ OK, passed 100 tests.
  11650. 964.09 s [vector] append: OK
  11651. 964.09 s [vector] +++ OK, passed 100 tests.
  11652. 964.09 s [vector] concat: OK (0.02s)
  11653. 964.09 s [vector] +++ OK, passed 100 tests.
  11654. 964.10 s [vector] force: OK
  11655. 964.10 s [vector] +++ OK, passed 100 tests.
  11656. 964.10 s [vector] upd: OK
  11657. 964.10 s [vector] +++ OK, passed 100 tests.
  11658. 964.11 s [vector] accum: OK (0.01s)
  11659. 964.11 s [vector] +++ OK, passed 100 tests.
  11660. 964.11 s [vector] reverse: OK
  11661. 964.11 s [vector] +++ OK, passed 100 tests.
  11662. 964.11 s [vector] backpermute: OK
  11663. 964.11 s [vector] +++ OK, passed 100 tests.
  11664. 964.11 s [vector] map: OK
  11665. 964.11 s [vector] +++ OK, passed 100 tests.
  11666. 964.12 s [vector] imap: OK
  11667. 964.12 s [vector] +++ OK, passed 100 tests.
  11668. 964.14 s [vector] concatMap: OK
  11669. 964.14 s [vector] +++ OK, passed 100 tests.
  11670. 964.15 s [vector] mapM: OK
  11671. 964.15 s [vector] +++ OK, passed 100 tests.
  11672. 964.16 s [vector] mapM_: OK (0.03s)
  11673. 964.16 s [vector] +++ OK, passed 100 tests.
  11674. 964.18 s [vector] forM: OK
  11675. 964.18 s [vector] +++ OK, passed 100 tests.
  11676. 964.20 s [vector] forM_: OK (0.03s)
  11677. 964.20 s [vector] +++ OK, passed 100 tests.
  11678. 964.20 s [vector] imapM: OK
  11679. 964.20 s [vector] +++ OK, passed 100 tests.
  11680. 964.24 s [vector] imapM_: OK (0.03s)
  11681. 964.24 s [vector] +++ OK, passed 100 tests.
  11682. 964.24 s [vector] zipWith: OK
  11683. 964.24 s [vector] +++ OK, passed 100 tests.
  11684. 964.28 s [vector] zipWith3: OK (0.01s)
  11685. 964.28 s [vector] +++ OK, passed 100 tests.
  11686. 964.29 s [vector] izipWith: OK
  11687. 964.29 s [vector] +++ OK, passed 100 tests.
  11688. 964.29 s [vector] izipWith3: OK (0.01s)
  11689. 964.29 s [vector] +++ OK, passed 100 tests.
  11690. 964.31 s [vector] izipWithM: OK (0.01s)
  11691. 964.31 s [vector] +++ OK, passed 100 tests.
  11692. 964.32 s [vector] izipWithM_: OK (0.02s)
  11693. 964.32 s [vector] +++ OK, passed 100 tests.
  11694. 964.33 s [vector] zipWithM: OK
  11695. 964.33 s [vector] +++ OK, passed 100 tests.
  11696. 964.34 s [vector] zipWithM_: OK (0.02s)
  11697. 964.34 s [vector] +++ OK, passed 100 tests.
  11698. 964.35 s [vector] filter: OK
  11699. 964.35 s [vector] +++ OK, passed 100 tests.
  11700. 964.36 s [vector] ifilter: OK
  11701. 964.36 s [vector] +++ OK, passed 100 tests.
  11702. 964.40 s [vector] filterM: OK (0.05s)
  11703. 964.40 s [vector] +++ OK, passed 100 tests.
  11704. 964.41 s [vector] uniq: OK
  11705. 964.41 s [vector] +++ OK, passed 100 tests.
  11706. 964.42 s [vector] mapMaybe: OK
  11707. 964.42 s [vector] +++ OK, passed 100 tests.
  11708. 964.42 s [vector] imapMaybe: OK
  11709. 964.42 s [vector] +++ OK, passed 100 tests.
  11710. 964.42 s [vector] takeWhile: OK
  11711. 964.42 s [vector] +++ OK, passed 100 tests.
  11712. 964.42 s [vector] dropWhile: OK
  11713. 964.42 s [vector] +++ OK, passed 100 tests.
  11714. 964.43 s [vector] partition: OK
  11715. 964.43 s [vector] +++ OK, passed 100 tests.
  11716. 964.43 s [vector] partitionWith: OK
  11717. 964.43 s [vector] +++ OK, passed 100 tests.
  11718. 964.43 s [vector] span: OK
  11719. 964.43 s [vector] +++ OK, passed 100 tests.
  11720. 964.43 s [vector] break: OK
  11721. 964.43 s [vector] +++ OK, passed 100 tests.
  11722. 964.44 s [vector] spanR: OK
  11723. 964.44 s [vector] +++ OK, passed 100 tests.
  11724. 964.44 s [vector] breakR: OK
  11725. 964.44 s [vector] +++ OK, passed 100 tests.
  11726. 964.44 s [vector] groupBy: OK
  11727. 964.44 s [vector] +++ OK, passed 100 tests.
  11728. 964.44 s [vector] elem: OK
  11729. 964.45 s [vector] +++ OK, passed 100 tests.
  11730. 964.45 s [vector] notElem: OK
  11731. 964.45 s [vector] +++ OK, passed 100 tests.
  11732. 964.45 s [vector] find: OK
  11733. 964.45 s [vector] +++ OK, passed 100 tests.
  11734. 964.45 s [vector] findIndex: OK
  11735. 964.45 s [vector] +++ OK, passed 100 tests.
  11736. 964.45 s [pandoc-lua-engine] Phase: buildPhase
  11737. 964.45 s [vector] findIndexR: OK
  11738. 964.45 s [vector] +++ OK, passed 100 tests.
  11739. 964.45 s [vector] findIndices: OK
  11740. 964.45 s [vector] +++ OK, passed 100 tests.
  11741. 964.46 s [vector] elemIndex: OK
  11742. 964.46 s [vector] +++ OK, passed 100 tests.
  11743. 964.46 s [vector] elemIndices: OK
  11744. 964.46 s [vector] +++ OK, passed 100 tests.
  11745. 964.48 s [vector] foldl: OK (0.01s)
  11746. 964.48 s [vector] +++ OK, passed 100 tests.
  11747. 964.48 s [vector] foldl1: OK (0.01s)
  11748. 964.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11749. 964.50 s [vector] foldl': OK (0.01s)
  11750. 964.50 s [vector] +++ OK, passed 100 tests.
  11751. 964.50 s [vector] foldl1': OK (0.01s)
  11752. 964.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11753. 964.52 s [vector] foldr: OK (0.01s)
  11754. 964.52 s [vector] +++ OK, passed 100 tests.
  11755. 964.52 s [vector] foldr1: OK (0.01s)
  11756. 964.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11757. 964.54 s [vector] foldr': OK (0.01s)
  11758. 964.54 s [vector] +++ OK, passed 100 tests.
  11759. 964.54 s [pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
  11760. 964.54 s [vector] foldr1': OK (0.01s)
  11761. 964.54 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11762. 964.55 s [pandoc-lua-engine] Building library for pandoc-lua-engine-0.4.3...
  11763. 964.56 s [vector] ifoldl: OK (0.01s)
  11764. 964.56 s [vector] +++ OK, passed 100 tests.
  11765. 964.57 s [vector] ifoldl': OK (0.01s)
  11766. 964.57 s [vector] +++ OK, passed 100 tests.
  11767. 964.58 s [vector] ifoldr: OK (0.01s)
  11768. 964.58 s [vector] +++ OK, passed 100 tests.
  11769. 964.60 s [vector] ifoldr': OK
  11770. 964.60 s [vector] +++ OK, passed 100 tests.
  11771. 964.61 s [vector] ifoldM: OK (0.01s)
  11772. 964.61 s [vector] +++ OK, passed 100 tests.
  11773. 964.62 s [vector] ifoldM': OK (0.01s)
  11774. 964.62 s [vector] +++ OK, passed 100 tests.
  11775. 965.19 s [pandoc-server] Phase: buildPhase
  11776. 965.19 s [vector] ifoldM_: OK (0.03s)
  11777. 965.19 s [vector] +++ OK, passed 100 tests.
  11778. 965.19 s [vector] ifoldM'_: OK (0.04s)
  11779. 965.19 s [vector] +++ OK, passed 100 tests.
  11780. 965.19 s [vector] all: OK
  11781. 965.19 s [vector] +++ OK, passed 100 tests.
  11782. 965.19 s [vector] any: OK
  11783. 965.19 s [vector] +++ OK, passed 100 tests.
  11784. 965.19 s [vector] prescanl: OK (0.01s)
  11785. 965.19 s [vector] +++ OK, passed 100 tests.
  11786. 965.19 s [vector] prescanl': OK (0.01s)
  11787. 965.20 s [vector] +++ OK, passed 100 tests.
  11788. 965.20 s [pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
  11789. 965.20 s [pandoc-server] Building library for pandoc-server-0.1.0.11...
  11790. 965.20 s [vector] postscanl: OK (0.01s)
  11791. 965.20 s [vector] +++ OK, passed 100 tests.
  11792. 965.20 s [vector] postscanl': OK
  11793. 965.20 s [vector] +++ OK, passed 100 tests.
  11794. 965.20 s [vector] scanl: OK (0.01s)
  11795. 965.20 s [vector] +++ OK, passed 100 tests.
  11796. 965.20 s [vector] scanl': OK
  11797. 965.20 s [vector] +++ OK, passed 100 tests.
  11798. 965.20 s [pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
  11799. 965.20 s [vector] scanl1: OK (0.02s)
  11800. 965.20 s [vector] +++ OK, passed 100 tests.
  11801. 965.20 s [vector] scanl1': OK (0.02s)
  11802. 965.20 s [vector] +++ OK, passed 100 tests.
  11803. 965.20 s [pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
  11804. 965.20 s [vector] iscanl: OK (0.02s)
  11805. 965.20 s [vector] +++ OK, passed 100 tests.
  11806. 965.20 s [vector] iscanl': OK (0.02s)
  11807. 965.20 s [vector] +++ OK, passed 100 tests.
  11808. 965.20 s [vector] prescanr: OK (0.02s)
  11809. 965.20 s [vector] +++ OK, passed 100 tests.
  11810. 965.20 s [vector] prescanr': OK (0.02s)
  11811. 965.20 s [vector] +++ OK, passed 100 tests.
  11812. 965.20 s [vector] postscanr: OK (0.02s)
  11813. 965.20 s [vector] +++ OK, passed 100 tests.
  11814. 965.20 s [vector] postscanr': OK
  11815. 965.20 s [vector] +++ OK, passed 100 tests.
  11816. 965.20 s [vector] scanr: OK (0.01s)
  11817. 965.20 s [vector] +++ OK, passed 100 tests.
  11818. 965.20 s [vector] scanr': OK (0.01s)
  11819. 965.20 s [vector] +++ OK, passed 100 tests.
  11820. 965.20 s [vector] scanr1: OK
  11821. 965.20 s [vector] +++ OK, passed 100 tests.
  11822. 965.20 s [vector] scanr1': OK (0.01s)
  11823. 965.20 s [vector] +++ OK, passed 100 tests.
  11824. 965.20 s [vector] iscanr: OK (0.01s)
  11825. 965.20 s [vector] +++ OK, passed 100 tests.
  11826. 965.20 s [vector] iscanr': OK (0.01s)
  11827. 965.20 s [vector] +++ OK, passed 100 tests.
  11828. 965.20 s [vector] mut_read: OK
  11829. 965.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11830. 965.20 s [vector] mut_write: OK
  11831. 965.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11832. 965.20 s [vector] mut_modify: OK
  11833. 965.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11834. 965.20 s [vector] mut_generate: OK
  11835. 965.20 s [vector] +++ OK, passed 100 tests.
  11836. 965.20 s [vector] mut_generateM: OK (0.01s)
  11837. 965.20 s [vector] +++ OK, passed 100 tests.
  11838. 965.20 s [vector] mut_mapM_: OK (0.03s)
  11839. 965.20 s [vector] +++ OK, passed 100 tests.
  11840. 965.20 s [vector] mut_imapM_: OK (0.04s)
  11841. 965.20 s [vector] +++ OK, passed 100 tests.
  11842. 965.20 s [vector] mut_forM_: OK (0.04s)
  11843. 965.20 s [vector] +++ OK, passed 100 tests.
  11844. 965.20 s [vector] mut_iforM_: OK (0.04s)
  11845. 965.20 s [vector] +++ OK, passed 100 tests.
  11846. 965.20 s [vector] mut_foldr: OK (0.01s)
  11847. 965.20 s [vector] +++ OK, passed 100 tests.
  11848. 965.20 s [vector] mut_foldr': OK (0.02s)
  11849. 965.20 s [vector] +++ OK, passed 100 tests.
  11850. 965.20 s [vector] mut_foldl: OK (0.01s)
  11851. 965.20 s [vector] +++ OK, passed 100 tests.
  11852. 965.21 s [vector] mut_foldl': OK (0.01s)
  11853. 965.21 s [vector] +++ OK, passed 100 tests.
  11854. 965.22 s [vector] mut_ifoldr: OK (0.02s)
  11855. 965.23 s [vector] +++ OK, passed 100 tests.
  11856. 965.24 s [vector] mut_ifoldr': OK (0.02s)
  11857. 965.24 s [vector] +++ OK, passed 100 tests.
  11858. 965.24 s [vector] mut_ifoldl: OK (0.01s)
  11859. 965.24 s [vector] +++ OK, passed 100 tests.
  11860. 965.26 s [vector] mut_ifoldl': OK (0.02s)
  11861. 965.26 s [vector] +++ OK, passed 100 tests.
  11862. 965.28 s [vector] mut_foldM: OK (0.02s)
  11863. 965.28 s [vector] +++ OK, passed 100 tests.
  11864. 965.30 s [vector] mut_foldM': OK (0.01s)
  11865. 965.30 s [vector] +++ OK, passed 100 tests.
  11866. 965.31 s [vector] mut_foldrM: OK (0.01s)
  11867. 965.31 s [vector] +++ OK, passed 100 tests.
  11868. 965.31 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 )
  11869. 965.32 s [vector] mut_foldrM': OK (0.01s)
  11870. 965.32 s [vector] +++ OK, passed 100 tests.
  11871. 965.33 s [vector] mut_ifoldM: OK
  11872. 965.33 s [vector] +++ OK, passed 100 tests.
  11873. 965.34 s [vector] mut_ifoldM': OK (0.01s)
  11874. 965.34 s [vector] +++ OK, passed 100 tests.
  11875. 965.34 s [vector] mut_ifoldrM: OK (0.01s)
  11876. 965.34 s [vector] +++ OK, passed 100 tests.
  11877. 965.36 s [vector] mut_ifoldrM': OK (0.01s)
  11878. 965.36 s [vector] +++ OK, passed 100 tests.
  11879. 965.36 s [vector] compare: OK
  11880. 965.36 s [vector] +++ OK, passed 100 tests.
  11881. 965.36 s [vector] maximum: OK
  11882. 965.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11883. 965.36 s [vector] minimum: OK
  11884. 965.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11885. 965.36 s [vector] minIndex: OK
  11886. 965.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11887. 965.36 s [vector] maxIndex: OK
  11888. 965.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11889. 965.36 s [vector] maximumBy: OK
  11890. 965.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11891. 965.36 s [vector] minimumBy: OK
  11892. 965.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11893. 965.36 s [vector] maximumOn: OK
  11894. 965.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11895. 965.36 s [vector] minimumOn: OK
  11896. 965.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11897. 965.37 s [vector] maxIndexBy: OK
  11898. 965.37 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11899. 965.37 s [vector] minIndexBy: OK
  11900. 965.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11901. 965.37 s [vector] ListFirstMaxIndexWins: OK
  11902. 965.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11903. 965.37 s [vector] FalseListFirstMaxIndexWins: OK
  11904. 965.37 s [vector] +++ OK, failed as expected. (after 1 test):
  11905. 965.37 s [vector] Exception:
  11906. 965.37 s [vector] Prelude.foldr1: empty list
  11907. 965.37 s [vector] CallStack (from HasCallStack):
  11908. 965.37 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11909. 965.37 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11910. 965.37 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11911. 965.37 s [vector] []
  11912. 965.37 s [vector] mempty: OK
  11913. 965.37 s [vector] +++ OK, passed 100 tests.
  11914. 965.38 s [vector] mappend: OK
  11915. 965.38 s [vector] +++ OK, passed 100 tests.
  11916. 965.39 s [vector] mconcat: OK (0.02s)
  11917. 965.39 s [vector] +++ OK, passed 100 tests.
  11918. 965.39 s [vector] glength: OK
  11919. 965.39 s [vector] +++ OK, passed 100 tests.
  11920. 965.39 s [vector] sum: OK
  11921. 965.39 s [vector] +++ OK, passed 100 tests.
  11922. 965.39 s [vector] product: OK
  11923. 965.39 s [vector] +++ OK, passed 100 tests.
  11924. 965.40 s [vector] enumFromN: OK
  11925. 965.40 s [vector] +++ OK, passed 100 tests.
  11926. 965.40 s [vector] enumFromThenN: OK
  11927. 965.40 s [vector] +++ OK, passed 100 tests.
  11928. 965.40 s [vector] enumFromTo: OK
  11929. 965.40 s [vector] +++ OK, passed 100 tests.
  11930. 965.40 s [vector] enumFromThenTo: OK
  11931. 965.40 s [vector] +++ OK, passed 100 tests; 1 discarded.
  11932. 965.40 s [vector] unstream
  11933. 965.40 s [vector] unstream == vunstream (exact): OK
  11934. 965.40 s [vector] +++ OK, passed 100 tests.
  11935. 965.40 s [vector] unstream == vunstream (unknown): OK
  11936. 965.40 s [vector] +++ OK, passed 100 tests.
  11937. 965.40 s [vector] unstreamR ~= vunstream (exact): OK
  11938. 965.40 s [vector] +++ OK, passed 100 tests.
  11939. 965.40 s [vector] unstreamR ~= vunstream (unknown): OK
  11940. 965.40 s [vector] +++ OK, passed 100 tests.
  11941. 965.40 s [vector] Tests.Vector.Strict
  11942. 965.40 s [vector] Bool
  11943. 965.40 s [vector] fromList.toList == id: OK
  11944. 965.40 s [vector] +++ OK, passed 100 tests.
  11945. 965.40 s [vector] toList.fromList == id: OK
  11946. 965.40 s [vector] +++ OK, passed 100 tests.
  11947. 965.40 s [vector] unstream.stream == id: OK
  11948. 965.40 s [vector] +++ OK, passed 100 tests.
  11949. 965.40 s [vector] stream.unstream == id: OK
  11950. 965.40 s [vector] +++ OK, passed 100 tests.
  11951. 965.40 s [vector] eq: OK
  11952. 965.40 s [vector] +++ OK, passed 100 tests.
  11953. 965.40 s [vector] length: OK
  11954. 965.40 s [vector] +++ OK, passed 100 tests.
  11955. 965.40 s [vector] null: OK
  11956. 965.40 s [vector] +++ OK, passed 100 tests.
  11957. 965.40 s [vector] index: OK
  11958. 965.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11959. 965.40 s [vector] safeIndex: OK
  11960. 965.40 s [vector] +++ OK, passed 100 tests.
  11961. 965.42 s [vector] head: OK
  11962. 965.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11963. 965.42 s [vector] last: OK
  11964. 965.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11965. 965.42 s [vector] unsafeIndex: OK
  11966. 965.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11967. 965.43 s [vector] unsafeHead: OK
  11968. 965.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11969. 965.43 s [vector] unsafeLast: OK
  11970. 965.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11971. 965.43 s [vector] slice: OK
  11972. 965.43 s [vector] +++ OK, passed 100 tests.
  11973. 965.43 s [vector] init: OK
  11974. 965.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11975. 965.43 s [vector] tail: OK
  11976. 965.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11977. 965.43 s [vector] take: OK
  11978. 965.43 s [vector] +++ OK, passed 100 tests.
  11979. 965.43 s [vector] drop: OK
  11980. 965.43 s [vector] +++ OK, passed 100 tests.
  11981. 965.43 s [vector] splitAt: OK
  11982. 965.43 s [vector] +++ OK, passed 100 tests.
  11983. 965.43 s [vector] empty: OK
  11984. 965.43 s [vector] +++ OK, passed 100 tests.
  11985. 965.43 s [vector] singleton: OK
  11986. 965.43 s [vector] +++ OK, passed 100 tests.
  11987. 965.43 s [vector] replicate: OK
  11988. 965.43 s [vector] +++ OK, passed 100 tests.
  11989. 965.43 s [vector] generate: OK
  11990. 965.43 s [vector] +++ OK, passed 100 tests.
  11991. 965.43 s [vector] iterateN: OK
  11992. 965.44 s [vector] +++ OK, passed 100 tests.
  11993. 965.44 s [pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
  11994. 965.44 s [pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
  11995. 965.44 s [pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
  11996. 965.44 s [pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
  11997. 965.44 s [pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
  11998. 965.44 s [pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
  11999. 965.44 s [pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
  12000. 965.44 s [pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
  12001. 965.44 s [pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
  12002. 965.44 s [vector] iterateNM: OK (0.02s)
  12003. 965.44 s [vector] +++ OK, passed 100 tests.
  12004. 965.44 s [vector] generateM: OK
  12005. 965.44 s [vector] +++ OK, passed 100 tests.
  12006. 965.44 s [vector] replicateM: OK
  12007. 965.44 s [vector] +++ OK, passed 100 tests.
  12008. 965.45 s [vector] create: OK
  12009. 965.45 s [vector] +++ OK, passed 100 tests.
  12010. 965.46 s [vector] createT: OK
  12011. 965.46 s [vector] +++ OK, passed 100 tests.
  12012. 965.46 s [vector] unfoldr: OK
  12013. 965.46 s [vector] +++ OK, passed 100 tests.
  12014. 965.46 s [vector] unfoldrN: OK
  12015. 965.46 s [vector] +++ OK, passed 100 tests.
  12016. 965.46 s [vector] unfoldrExactN: OK
  12017. 965.46 s [vector] +++ OK, passed 100 tests.
  12018. 965.46 s [vector] unfoldrM: OK
  12019. 965.46 s [vector] +++ OK, passed 100 tests.
  12020. 965.46 s [vector] unfoldrNM: OK
  12021. 965.46 s [vector] +++ OK, passed 100 tests.
  12022. 965.46 s [vector] unfoldrExactNM: OK
  12023. 965.46 s [vector] +++ OK, passed 100 tests.
  12024. 965.46 s [vector] constructN: OK
  12025. 965.46 s [vector] +++ OK, passed 100 tests.
  12026. 965.47 s [vector] constructrN: OK
  12027. 965.47 s [vector] +++ OK, passed 100 tests.
  12028. 965.47 s [vector] cons: OK
  12029. 965.47 s [vector] +++ OK, passed 100 tests.
  12030. 965.47 s [vector] snoc: OK
  12031. 965.47 s [vector] +++ OK, passed 100 tests.
  12032. 965.47 s [vector] append: OK
  12033. 965.47 s [vector] +++ OK, passed 100 tests.
  12034. 965.47 s [vector] concat: OK
  12035. 965.47 s [vector] +++ OK, passed 100 tests.
  12036. 965.47 s [vector] force: OK
  12037. 965.47 s [vector] +++ OK, passed 100 tests.
  12038. 965.47 s [vector] upd: OK
  12039. 965.47 s [vector] +++ OK, passed 100 tests.
  12040. 965.48 s [vector] accum: OK
  12041. 965.48 s [vector] +++ OK, passed 100 tests.
  12042. 965.48 s [vector] reverse: OK
  12043. 965.48 s [vector] +++ OK, passed 100 tests.
  12044. 965.48 s [vector] backpermute: OK
  12045. 965.48 s [vector] +++ OK, passed 100 tests.
  12046. 965.48 s [vector] map: OK
  12047. 965.48 s [vector] +++ OK, passed 100 tests.
  12048. 965.48 s [vector] imap: OK
  12049. 965.48 s [vector] +++ OK, passed 100 tests.
  12050. 965.48 s [vector] concatMap: OK
  12051. 965.48 s [vector] +++ OK, passed 100 tests.
  12052. 965.48 s [vector] mapM: OK
  12053. 965.48 s [vector] +++ OK, passed 100 tests.
  12054. 965.49 s [vector] mapM_: OK
  12055. 965.49 s [vector] +++ OK, passed 100 tests.
  12056. 965.49 s [vector] forM: OK
  12057. 965.49 s [vector] +++ OK, passed 100 tests.
  12058. 965.50 s [vector] forM_: OK
  12059. 965.50 s [vector] +++ OK, passed 100 tests.
  12060. 965.51 s [vector] imapM: OK
  12061. 965.51 s [vector] +++ OK, passed 100 tests.
  12062. 965.52 s [vector] imapM_: OK (0.01s)
  12063. 965.52 s [vector] +++ OK, passed 100 tests.
  12064. 965.52 s [vector] zipWith: OK
  12065. 965.52 s [vector] +++ OK, passed 100 tests.
  12066. 965.52 s [vector] zipWith3: OK
  12067. 965.52 s [vector] +++ OK, passed 100 tests.
  12068. 965.52 s [vector] izipWith: OK
  12069. 965.52 s [vector] +++ OK, passed 100 tests.
  12070. 965.52 s [vector] izipWith3: OK
  12071. 965.52 s [vector] +++ OK, passed 100 tests.
  12072. 965.53 s [vector] izipWithM: OK
  12073. 965.53 s [vector] +++ OK, passed 100 tests.
  12074. 965.53 s [vector] izipWithM_: OK
  12075. 965.53 s [vector] +++ OK, passed 100 tests.
  12076. 965.54 s [vector] zipWithM: OK
  12077. 965.54 s [vector] +++ OK, passed 100 tests.
  12078. 965.54 s [vector] zipWithM_: OK
  12079. 965.54 s [vector] +++ OK, passed 100 tests.
  12080. 965.55 s [vector] filter: OK
  12081. 965.55 s [vector] +++ OK, passed 100 tests.
  12082. 965.55 s [vector] ifilter: OK
  12083. 965.55 s [vector] +++ OK, passed 100 tests.
  12084. 965.56 s [vector] filterM: OK (0.02s)
  12085. 965.56 s [vector] +++ OK, passed 100 tests.
  12086. 965.56 s [vector] uniq: OK
  12087. 965.56 s [vector] +++ OK, passed 100 tests.
  12088. 965.56 s [vector] mapMaybe: OK
  12089. 965.56 s [vector] +++ OK, passed 100 tests.
  12090. 965.56 s [vector] imapMaybe: OK
  12091. 965.56 s [vector] +++ OK, passed 100 tests.
  12092. 965.56 s [vector] takeWhile: OK
  12093. 965.56 s [vector] +++ OK, passed 100 tests.
  12094. 965.56 s [vector] dropWhile: OK
  12095. 965.56 s [vector] +++ OK, passed 100 tests.
  12096. 965.56 s [vector] partition: OK
  12097. 965.56 s [vector] +++ OK, passed 100 tests.
  12098. 965.56 s [vector] partitionWith: OK
  12099. 965.56 s [vector] +++ OK, passed 100 tests.
  12100. 965.56 s [vector] span: OK
  12101. 965.56 s [vector] +++ OK, passed 100 tests.
  12102. 965.56 s [vector] break: OK
  12103. 965.56 s [vector] +++ OK, passed 100 tests.
  12104. 965.56 s [vector] spanR: OK
  12105. 965.56 s [vector] +++ OK, passed 100 tests.
  12106. 965.56 s [vector] breakR: OK
  12107. 965.57 s [vector] +++ OK, passed 100 tests.
  12108. 965.57 s [vector] groupBy: OK
  12109. 965.57 s [vector] +++ OK, passed 100 tests.
  12110. 965.57 s [vector] elem: OK
  12111. 965.57 s [vector] +++ OK, passed 100 tests.
  12112. 965.57 s [vector] notElem: OK
  12113. 965.57 s [vector] +++ OK, passed 100 tests.
  12114. 965.57 s [vector] find: OK
  12115. 965.57 s [vector] +++ OK, passed 100 tests.
  12116. 965.57 s [vector] findIndex: OK
  12117. 965.57 s [vector] +++ OK, passed 100 tests.
  12118. 965.57 s [vector] findIndexR: OK
  12119. 965.57 s [vector] +++ OK, passed 100 tests.
  12120. 965.57 s [vector] findIndices: OK
  12121. 965.57 s [vector] +++ OK, passed 100 tests.
  12122. 965.57 s [vector] elemIndex: OK
  12123. 965.57 s [vector] +++ OK, passed 100 tests.
  12124. 965.57 s [vector] elemIndices: OK
  12125. 965.57 s [vector] +++ OK, passed 100 tests.
  12126. 965.57 s [vector] foldl: OK
  12127. 965.57 s [vector] +++ OK, passed 100 tests.
  12128. 965.57 s [vector] foldl1: OK
  12129. 965.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12130. 965.57 s [vector] foldl': OK
  12131. 965.57 s [vector] +++ OK, passed 100 tests.
  12132. 965.57 s [vector] foldl1': OK
  12133. 965.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12134. 965.57 s [vector] foldr: OK
  12135. 965.57 s [vector] +++ OK, passed 100 tests.
  12136. 965.58 s [vector] foldr1: OK
  12137. 965.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12138. 965.58 s [vector] foldr': OK
  12139. 965.58 s [vector] +++ OK, passed 100 tests.
  12140. 965.58 s [vector] foldr1': OK
  12141. 965.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12142. 965.58 s [vector] ifoldl: OK
  12143. 965.58 s [vector] +++ OK, passed 100 tests.
  12144. 965.58 s [vector] ifoldl': OK
  12145. 965.58 s [vector] +++ OK, passed 100 tests.
  12146. 965.58 s [vector] ifoldr: OK
  12147. 965.58 s [vector] +++ OK, passed 100 tests.
  12148. 965.58 s [vector] ifoldr': OK
  12149. 965.58 s [vector] +++ OK, passed 100 tests.
  12150. 965.58 s [vector] ifoldM: OK
  12151. 965.58 s [vector] +++ OK, passed 100 tests.
  12152. 965.58 s [vector] ifoldM': OK
  12153. 965.59 s [vector] +++ OK, passed 100 tests.
  12154. 965.60 s [pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
  12155. 965.60 s [vector] ifoldM_: OK
  12156. 965.60 s [vector] +++ OK, passed 100 tests.
  12157. 965.61 s [vector] ifoldM'_: OK (0.01s)
  12158. 965.61 s [vector] +++ OK, passed 100 tests.
  12159. 965.61 s [vector] all: OK
  12160. 965.61 s [vector] +++ OK, passed 100 tests.
  12161. 965.61 s [vector] any: OK
  12162. 965.61 s [vector] +++ OK, passed 100 tests.
  12163. 965.61 s [vector] prescanl: OK
  12164. 965.61 s [vector] +++ OK, passed 100 tests.
  12165. 965.61 s [vector] prescanl': OK
  12166. 965.61 s [vector] +++ OK, passed 100 tests.
  12167. 965.61 s [vector] postscanl: OK
  12168. 965.61 s [vector] +++ OK, passed 100 tests.
  12169. 965.61 s [vector] postscanl': OK
  12170. 965.61 s [vector] +++ OK, passed 100 tests.
  12171. 965.61 s [vector] scanl: OK
  12172. 965.62 s [vector] +++ OK, passed 100 tests.
  12173. 965.62 s [vector] scanl': OK
  12174. 965.62 s [vector] +++ OK, passed 100 tests.
  12175. 965.62 s [vector] scanl1: OK
  12176. 965.62 s [vector] +++ OK, passed 100 tests.
  12177. 965.62 s [vector] scanl1': OK
  12178. 965.62 s [vector] +++ OK, passed 100 tests.
  12179. 965.62 s [vector] iscanl: OK
  12180. 965.62 s [vector] +++ OK, passed 100 tests.
  12181. 965.62 s [vector] iscanl': OK
  12182. 965.62 s [vector] +++ OK, passed 100 tests.
  12183. 965.62 s [vector] prescanr: OK
  12184. 965.62 s [vector] +++ OK, passed 100 tests.
  12185. 965.62 s [vector] prescanr': OK
  12186. 965.62 s [vector] +++ OK, passed 100 tests.
  12187. 965.62 s [vector] postscanr: OK
  12188. 965.62 s [vector] +++ OK, passed 100 tests.
  12189. 965.63 s [vector] postscanr': OK
  12190. 965.63 s [vector] +++ OK, passed 100 tests.
  12191. 965.63 s [vector] scanr: OK
  12192. 965.63 s [vector] +++ OK, passed 100 tests.
  12193. 965.63 s [vector] scanr': OK
  12194. 965.63 s [vector] +++ OK, passed 100 tests.
  12195. 965.63 s [vector] scanr1: OK
  12196. 965.64 s [vector] +++ OK, passed 100 tests.
  12197. 965.64 s [vector] scanr1': OK
  12198. 965.64 s [vector] +++ OK, passed 100 tests.
  12199. 965.64 s [vector] iscanr: OK
  12200. 965.64 s [vector] +++ OK, passed 100 tests.
  12201. 965.65 s [vector] iscanr': OK
  12202. 965.65 s [vector] +++ OK, passed 100 tests.
  12203. 965.65 s [vector] mut_read: OK
  12204. 965.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12205. 965.65 s [vector] mut_write: OK
  12206. 965.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12207. 965.65 s [vector] mut_modify: OK
  12208. 965.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12209. 965.65 s [vector] mut_generate: OK
  12210. 965.65 s [vector] +++ OK, passed 100 tests.
  12211. 965.65 s [vector] mut_generateM: OK
  12212. 965.65 s [vector] +++ OK, passed 100 tests.
  12213. 965.66 s [pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
  12214. 965.66 s [vector] mut_mapM_: OK (0.01s)
  12215. 965.66 s [vector] +++ OK, passed 100 tests.
  12216. 965.67 s [pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
  12217. 965.67 s [vector] mut_imapM_: OK
  12218. 965.67 s [vector] +++ OK, passed 100 tests.
  12219. 965.68 s [vector] mut_forM_: OK
  12220. 965.68 s [vector] +++ OK, passed 100 tests.
  12221. 965.68 s [vector] mut_iforM_: OK
  12222. 965.68 s [vector] +++ OK, passed 100 tests.
  12223. 965.69 s [vector] mut_foldr: OK
  12224. 965.69 s [vector] +++ OK, passed 100 tests.
  12225. 965.69 s [vector] mut_foldr': OK
  12226. 965.69 s [vector] +++ OK, passed 100 tests.
  12227. 965.69 s [vector] mut_foldl: OK
  12228. 965.69 s [vector] +++ OK, passed 100 tests.
  12229. 965.69 s [vector] mut_foldl': OK
  12230. 965.69 s [vector] +++ OK, passed 100 tests.
  12231. 965.69 s [vector] mut_ifoldr: OK
  12232. 965.69 s [vector] +++ OK, passed 100 tests.
  12233. 965.69 s [vector] mut_ifoldr': OK
  12234. 965.69 s [vector] +++ OK, passed 100 tests.
  12235. 965.70 s [vector] mut_ifoldl: OK
  12236. 965.70 s [vector] +++ OK, passed 100 tests.
  12237. 965.70 s [vector] mut_ifoldl': OK
  12238. 965.70 s [vector] +++ OK, passed 100 tests.
  12239. 965.70 s [vector] mut_foldM: OK
  12240. 965.70 s [vector] +++ OK, passed 100 tests.
  12241. 965.70 s [vector] mut_foldM': OK
  12242. 965.70 s [vector] +++ OK, passed 100 tests.
  12243. 965.70 s [vector] mut_foldrM: OK
  12244. 965.70 s [vector] +++ OK, passed 100 tests.
  12245. 965.70 s [vector] mut_foldrM': OK
  12246. 965.70 s [vector] +++ OK, passed 100 tests.
  12247. 965.70 s [vector] mut_ifoldM: OK
  12248. 965.70 s [vector] +++ OK, passed 100 tests.
  12249. 965.70 s [vector] mut_ifoldM': OK
  12250. 965.70 s [vector] +++ OK, passed 100 tests.
  12251. 965.71 s [vector] mut_ifoldrM: OK
  12252. 965.71 s [vector] +++ OK, passed 100 tests.
  12253. 965.71 s [vector] mut_ifoldrM': OK
  12254. 965.71 s [vector] +++ OK, passed 100 tests.
  12255. 965.71 s [vector] compare: OK
  12256. 965.71 s [vector] +++ OK, passed 100 tests.
  12257. 965.71 s [vector] maximum: OK
  12258. 965.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12259. 965.71 s [vector] minimum: OK
  12260. 965.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12261. 965.71 s [vector] minIndex: OK
  12262. 965.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12263. 965.71 s [vector] maxIndex: OK
  12264. 965.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12265. 965.71 s [vector] maximumBy: OK
  12266. 965.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12267. 965.71 s [vector] minimumBy: OK
  12268. 965.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12269. 965.71 s [vector] maximumOn: OK
  12270. 965.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12271. 965.71 s [vector] minimumOn: OK
  12272. 965.71 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12273. 965.71 s [vector] maxIndexBy: OK
  12274. 965.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12275. 965.71 s [vector] minIndexBy: OK
  12276. 965.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12277. 965.71 s [vector] ListFirstMaxIndexWins: OK
  12278. 965.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12279. 965.71 s [vector] FalseListFirstMaxIndexWins: OK
  12280. 965.72 s [vector] +++ OK, failed as expected. (after 1 test):
  12281. 965.72 s [vector] Exception:
  12282. 965.72 s [vector] Prelude.foldr1: empty list
  12283. 965.72 s [vector] CallStack (from HasCallStack):
  12284. 965.72 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12285. 965.72 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12286. 965.72 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12287. 965.72 s [vector] []
  12288. 965.72 s [vector] zip: OK
  12289. 965.72 s [vector] +++ OK, passed 100 tests.
  12290. 965.72 s [vector] zip3: OK
  12291. 965.72 s [vector] +++ OK, passed 100 tests.
  12292. 965.72 s [vector] unzip: OK
  12293. 965.72 s [vector] +++ OK, passed 100 tests.
  12294. 965.72 s [vector] unzip3: OK
  12295. 965.72 s [vector] +++ OK, passed 100 tests.
  12296. 965.72 s [vector] indexed: OK
  12297. 965.72 s [vector] +++ OK, passed 100 tests.
  12298. 965.73 s [vector] update: OK
  12299. 965.73 s [vector] +++ OK, passed 100 tests.
  12300. 965.73 s [vector] concat: OK
  12301. 965.73 s [vector] +++ OK, passed 100 tests.
  12302. 965.73 s [vector] mempty: OK
  12303. 965.73 s [vector] +++ OK, passed 100 tests.
  12304. 965.73 s [vector] mappend: OK
  12305. 965.73 s [vector] +++ OK, passed 100 tests.
  12306. 965.74 s [vector] mconcat: OK
  12307. 965.74 s [vector] +++ OK, passed 100 tests.
  12308. 965.74 s [vector] fmap: OK
  12309. 965.74 s [vector] +++ OK, passed 100 tests.
  12310. 965.74 s [vector] return: OK
  12311. 965.74 s [vector] +++ OK, passed 100 tests.
  12312. 965.75 s [vector] bind: OK
  12313. 965.75 s [vector] +++ OK, passed 100 tests.
  12314. 965.75 s [vector] mzip: OK
  12315. 965.75 s [vector] +++ OK, passed 100 tests.
  12316. 965.75 s [vector] munzip: OK
  12317. 965.75 s [vector] +++ OK, passed 100 tests.
  12318. 965.76 s [vector] applicative_pure: OK
  12319. 965.76 s [vector] +++ OK, passed 100 tests.
  12320. 965.77 s [vector] applicative_appl: OK (0.01s)
  12321. 965.77 s [vector] +++ OK, passed 100 tests.
  12322. 965.77 s [vector] alternative_empty: OK
  12323. 965.77 s [vector] +++ OK, passed 100 tests.
  12324. 965.78 s [vector] alternative_or: OK
  12325. 965.78 s [vector] +++ OK, passed 100 tests.
  12326. 965.79 s [vector] sequence: OK (0.02s)
  12327. 965.79 s [vector] +++ OK, passed 100 tests.
  12328. 965.79 s [vector] sequence_: OK
  12329. 965.80 s [vector] +++ OK, passed 100 tests.
  12330. 965.80 s [vector] glength: OK
  12331. 965.80 s [vector] +++ OK, passed 100 tests.
  12332. 965.80 s [vector] and: OK
  12333. 965.80 s [vector] +++ OK, passed 100 tests.
  12334. 965.80 s [vector] or: OK
  12335. 965.80 s [vector] +++ OK, passed 100 tests.
  12336. 965.80 s [vector] Int
  12337. 965.80 s [vector] fromList.toList == id: OK
  12338. 965.80 s [vector] +++ OK, passed 100 tests.
  12339. 965.80 s [vector] toList.fromList == id: OK
  12340. 965.80 s [vector] +++ OK, passed 100 tests.
  12341. 965.80 s [vector] unstream.stream == id: OK
  12342. 965.80 s [vector] +++ OK, passed 100 tests.
  12343. 965.80 s [vector] stream.unstream == id: OK
  12344. 965.80 s [vector] +++ OK, passed 100 tests.
  12345. 965.80 s [vector] eq: OK
  12346. 965.80 s [vector] +++ OK, passed 100 tests.
  12347. 965.80 s [vector] length: OK
  12348. 965.80 s [vector] +++ OK, passed 100 tests.
  12349. 965.80 s [vector] null: OK
  12350. 965.80 s [vector] +++ OK, passed 100 tests.
  12351. 965.80 s [vector] index: OK
  12352. 965.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12353. 965.80 s [vector] safeIndex: OK
  12354. 965.80 s [vector] +++ OK, passed 100 tests.
  12355. 965.80 s [vector] head: OK
  12356. 965.80 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12357. 965.80 s [vector] last: OK
  12358. 965.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12359. 965.80 s [vector] unsafeIndex: OK
  12360. 965.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12361. 965.80 s [vector] unsafeHead: OK
  12362. 965.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12363. 965.80 s [vector] unsafeLast: OK
  12364. 965.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12365. 965.80 s [vector] slice: OK
  12366. 965.80 s [vector] +++ OK, passed 100 tests.
  12367. 965.80 s [vector] init: OK
  12368. 965.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12369. 965.80 s [vector] tail: OK
  12370. 965.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12371. 965.80 s [vector] take: OK
  12372. 965.80 s [vector] +++ OK, passed 100 tests.
  12373. 965.80 s [vector] drop: OK
  12374. 965.81 s [vector] +++ OK, passed 100 tests.
  12375. 965.81 s [vector] splitAt: OK
  12376. 965.81 s [vector] +++ OK, passed 100 tests.
  12377. 965.81 s [vector] empty: OK
  12378. 965.82 s [vector] +++ OK, passed 100 tests.
  12379. 965.83 s [vector] singleton: OK
  12380. 965.83 s [vector] +++ OK, passed 100 tests.
  12381. 965.83 s [vector] replicate: OK
  12382. 965.83 s [vector] +++ OK, passed 100 tests.
  12383. 965.83 s [vector] generate: OK
  12384. 965.84 s [vector] +++ OK, passed 100 tests.
  12385. 965.84 s [vector] iterateN: OK
  12386. 965.84 s [vector] +++ OK, passed 100 tests.
  12387. 965.84 s [vector] iterateNM: OK (0.02s)
  12388. 965.84 s [vector] +++ OK, passed 100 tests.
  12389. 965.86 s [vector] generateM: OK (0.03s)
  12390. 965.86 s [vector] +++ OK, passed 100 tests.
  12391. 965.87 s [vector] replicateM: OK (0.02s)
  12392. 965.87 s [vector] +++ OK, passed 100 tests.
  12393. 965.87 s [vector] create: OK
  12394. 965.87 s [vector] +++ OK, passed 100 tests.
  12395. 965.87 s [vector] createT: OK
  12396. 965.87 s [vector] +++ OK, passed 100 tests.
  12397. 965.87 s [vector] unfoldr: OK
  12398. 965.87 s [vector] +++ OK, passed 100 tests.
  12399. 965.87 s [vector] unfoldrN: OK
  12400. 965.87 s [vector] +++ OK, passed 100 tests.
  12401. 965.87 s [vector] unfoldrExactN: OK
  12402. 965.87 s [vector] +++ OK, passed 100 tests.
  12403. 965.87 s [vector] unfoldrM: OK
  12404. 965.87 s [vector] +++ OK, passed 100 tests.
  12405. 965.87 s [vector] unfoldrNM: OK
  12406. 965.87 s [vector] +++ OK, passed 100 tests.
  12407. 965.89 s [vector] unfoldrExactNM: OK (0.02s)
  12408. 965.89 s [vector] +++ OK, passed 100 tests.
  12409. 965.89 s [vector] constructN: OK
  12410. 965.89 s [vector] +++ OK, passed 100 tests.
  12411. 965.90 s [vector] constructrN: OK
  12412. 965.90 s [vector] +++ OK, passed 100 tests.
  12413. 965.90 s [vector] cons: OK
  12414. 965.90 s [vector] +++ OK, passed 100 tests.
  12415. 965.90 s [vector] snoc: OK
  12416. 965.90 s [vector] +++ OK, passed 100 tests.
  12417. 965.91 s [vector] append: OK
  12418. 965.91 s [vector] +++ OK, passed 100 tests.
  12419. 965.91 s [vector] concat: OK (0.01s)
  12420. 965.91 s [vector] +++ OK, passed 100 tests.
  12421. 965.91 s [vector] force: OK
  12422. 965.91 s [vector] +++ OK, passed 100 tests.
  12423. 965.91 s [vector] upd: OK
  12424. 965.91 s [vector] +++ OK, passed 100 tests.
  12425. 965.91 s [vector] accum: OK
  12426. 965.91 s [vector] +++ OK, passed 100 tests.
  12427. 965.91 s [vector] reverse: OK
  12428. 965.92 s [vector] +++ OK, passed 100 tests.
  12429. 965.92 s [vector] backpermute: OK
  12430. 965.92 s [vector] +++ OK, passed 100 tests.
  12431. 965.92 s [vector] map: OK
  12432. 965.93 s [vector] +++ OK, passed 100 tests.
  12433. 965.93 s [vector] imap: OK
  12434. 965.93 s [vector] +++ OK, passed 100 tests.
  12435. 965.93 s [vector] concatMap: OK
  12436. 965.93 s [vector] +++ OK, passed 100 tests.
  12437. 965.93 s [vector] mapM: OK
  12438. 965.93 s [vector] +++ OK, passed 100 tests.
  12439. 965.94 s [vector] mapM_: OK (0.02s)
  12440. 965.94 s [vector] +++ OK, passed 100 tests.
  12441. 965.94 s [vector] forM: OK
  12442. 965.94 s [vector] +++ OK, passed 100 tests.
  12443. 965.96 s [vector] forM_: OK (0.01s)
  12444. 965.96 s [vector] +++ OK, passed 100 tests.
  12445. 965.97 s [vector] imapM: OK
  12446. 965.97 s [vector] +++ OK, passed 100 tests.
  12447. 965.97 s [vector] imapM_: OK (0.01s)
  12448. 965.98 s [vector] +++ OK, passed 100 tests.
  12449. 965.98 s [vector] zipWith: OK
  12450. 965.98 s [vector] +++ OK, passed 100 tests.
  12451. 965.98 s [vector] zipWith3: OK
  12452. 965.98 s [vector] +++ OK, passed 100 tests.
  12453. 965.98 s [vector] izipWith: OK
  12454. 965.98 s [vector] +++ OK, passed 100 tests.
  12455. 965.98 s [vector] izipWith3: OK
  12456. 965.98 s [vector] +++ OK, passed 100 tests.
  12457. 965.98 s [vector] izipWithM: OK
  12458. 965.98 s [vector] +++ OK, passed 100 tests.
  12459. 966.00 s [vector] izipWithM_: OK (0.02s)
  12460. 966.00 s [vector] +++ OK, passed 100 tests.
  12461. 966.01 s [vector] zipWithM: OK
  12462. 966.01 s [vector] +++ OK, passed 100 tests.
  12463. 966.02 s [vector] zipWithM_: OK (0.01s)
  12464. 966.02 s [vector] +++ OK, passed 100 tests.
  12465. 966.02 s [vector] filter: OK
  12466. 966.03 s [vector] +++ OK, passed 100 tests.
  12467. 966.03 s [vector] ifilter: OK
  12468. 966.03 s [vector] +++ OK, passed 100 tests.
  12469. 966.04 s [vector] filterM: OK (0.02s)
  12470. 966.04 s [vector] +++ OK, passed 100 tests.
  12471. 966.04 s [vector] uniq: OK
  12472. 966.04 s [vector] +++ OK, passed 100 tests.
  12473. 966.04 s [vector] mapMaybe: OK
  12474. 966.04 s [vector] +++ OK, passed 100 tests.
  12475. 966.04 s [vector] imapMaybe: OK
  12476. 966.04 s [vector] +++ OK, passed 100 tests.
  12477. 966.04 s [vector] takeWhile: OK
  12478. 966.04 s [vector] +++ OK, passed 100 tests.
  12479. 966.04 s [vector] dropWhile: OK
  12480. 966.04 s [vector] +++ OK, passed 100 tests.
  12481. 966.04 s [vector] partition: OK
  12482. 966.04 s [vector] +++ OK, passed 100 tests.
  12483. 966.05 s [vector] partitionWith: OK
  12484. 966.05 s [vector] +++ OK, passed 100 tests.
  12485. 966.05 s [vector] span: OK
  12486. 966.05 s [vector] +++ OK, passed 100 tests.
  12487. 966.05 s [vector] break: OK
  12488. 966.05 s [vector] +++ OK, passed 100 tests.
  12489. 966.05 s [vector] spanR: OK
  12490. 966.05 s [vector] +++ OK, passed 100 tests.
  12491. 966.05 s [vector] breakR: OK
  12492. 966.05 s [vector] +++ OK, passed 100 tests.
  12493. 966.05 s [vector] groupBy: OK
  12494. 966.05 s [vector] +++ OK, passed 100 tests.
  12495. 966.05 s [vector] elem: OK
  12496. 966.05 s [vector] +++ OK, passed 100 tests.
  12497. 966.05 s [vector] notElem: OK
  12498. 966.05 s [vector] +++ OK, passed 100 tests.
  12499. 966.05 s [vector] find: OK
  12500. 966.05 s [vector] +++ OK, passed 100 tests.
  12501. 966.05 s [vector] findIndex: OK
  12502. 966.06 s [vector] +++ OK, passed 100 tests.
  12503. 966.06 s [vector] findIndexR: OK
  12504. 966.06 s [vector] +++ OK, passed 100 tests.
  12505. 966.06 s [vector] findIndices: OK
  12506. 966.06 s [vector] +++ OK, passed 100 tests.
  12507. 966.06 s [vector] elemIndex: OK
  12508. 966.06 s [vector] +++ OK, passed 100 tests.
  12509. 966.06 s [vector] elemIndices: OK
  12510. 966.06 s [vector] +++ OK, passed 100 tests.
  12511. 966.06 s [vector] foldl: OK
  12512. 966.06 s [vector] +++ OK, passed 100 tests.
  12513. 966.07 s [vector] foldl1: OK
  12514. 966.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12515. 966.07 s [vector] foldl': OK
  12516. 966.07 s [vector] +++ OK, passed 100 tests.
  12517. 966.07 s [vector] foldl1': OK
  12518. 966.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12519. 966.08 s [vector] foldr: OK
  12520. 966.08 s [vector] +++ OK, passed 100 tests.
  12521. 966.08 s [vector] foldr1: OK
  12522. 966.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12523. 966.09 s [vector] foldr': OK
  12524. 966.09 s [vector] +++ OK, passed 100 tests.
  12525. 966.09 s [vector] foldr1': OK
  12526. 966.09 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12527. 966.09 s [vector] ifoldl: OK
  12528. 966.09 s [vector] +++ OK, passed 100 tests.
  12529. 966.09 s [vector] ifoldl': OK
  12530. 966.09 s [vector] +++ OK, passed 100 tests.
  12531. 966.10 s [vector] ifoldr: OK
  12532. 966.10 s [vector] +++ OK, passed 100 tests.
  12533. 966.10 s [vector] ifoldr': OK
  12534. 966.10 s [vector] +++ OK, passed 100 tests.
  12535. 966.10 s [vector] ifoldM: OK
  12536. 966.10 s [vector] +++ OK, passed 100 tests.
  12537. 966.10 s [vector] ifoldM': OK
  12538. 966.11 s [vector] +++ OK, passed 100 tests.
  12539. 966.14 s [vector] ifoldM_: OK (0.02s)
  12540. 966.15 s [vector] +++ OK, passed 100 tests.
  12541. 966.15 s [vector] ifoldM'_: OK (0.02s)
  12542. 966.15 s [vector] +++ OK, passed 100 tests.
  12543. 966.15 s [vector] all: OK
  12544. 966.15 s [vector] +++ OK, passed 100 tests.
  12545. 966.15 s [vector] any: OK
  12546. 966.15 s [vector] +++ OK, passed 100 tests.
  12547. 966.15 s [vector] prescanl: OK
  12548. 966.15 s [vector] +++ OK, passed 100 tests.
  12549. 966.15 s [vector] prescanl': OK
  12550. 966.16 s [vector] +++ OK, passed 100 tests.
  12551. 966.16 s [vector] postscanl: OK
  12552. 966.16 s [vector] +++ OK, passed 100 tests.
  12553. 966.16 s [vector] postscanl': OK
  12554. 966.16 s [vector] +++ OK, passed 100 tests.
  12555. 966.16 s [vector] scanl: OK
  12556. 966.16 s [vector] +++ OK, passed 100 tests.
  12557. 966.17 s [vector] scanl': OK
  12558. 966.17 s [vector] +++ OK, passed 100 tests.
  12559. 966.18 s [vector] scanl1: OK
  12560. 966.18 s [vector] +++ OK, passed 100 tests.
  12561. 966.18 s [vector] scanl1': OK
  12562. 966.18 s [vector] +++ OK, passed 100 tests.
  12563. 966.18 s [vector] iscanl: OK
  12564. 966.18 s [vector] +++ OK, passed 100 tests.
  12565. 966.18 s [vector] iscanl': OK
  12566. 966.18 s [vector] +++ OK, passed 100 tests.
  12567. 966.18 s [vector] prescanr: OK
  12568. 966.18 s [vector] +++ OK, passed 100 tests.
  12569. 966.18 s [vector] prescanr': OK
  12570. 966.18 s [vector] +++ OK, passed 100 tests.
  12571. 966.19 s [vector] postscanr: OK
  12572. 966.19 s [vector] +++ OK, passed 100 tests.
  12573. 966.19 s [vector] postscanr': OK
  12574. 966.19 s [vector] +++ OK, passed 100 tests.
  12575. 966.20 s [vector] scanr: OK
  12576. 966.20 s [vector] +++ OK, passed 100 tests.
  12577. 966.20 s [vector] scanr': OK
  12578. 966.20 s [vector] +++ OK, passed 100 tests.
  12579. 966.20 s [vector] scanr1: OK
  12580. 966.21 s [vector] +++ OK, passed 100 tests.
  12581. 966.21 s [vector] scanr1': OK
  12582. 966.21 s [vector] +++ OK, passed 100 tests.
  12583. 966.21 s [vector] iscanr: OK
  12584. 966.22 s [vector] +++ OK, passed 100 tests.
  12585. 966.22 s [vector] iscanr': OK
  12586. 966.22 s [vector] +++ OK, passed 100 tests.
  12587. 966.23 s [vector] mut_read: OK
  12588. 966.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12589. 966.23 s [vector] mut_write: OK
  12590. 966.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12591. 966.23 s [vector] mut_modify: OK
  12592. 966.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12593. 966.24 s [vector] mut_generate: OK
  12594. 966.24 s [vector] +++ OK, passed 100 tests.
  12595. 966.25 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 )
  12596. 966.26 s [vector] mut_generateM: OK (0.01s)
  12597. 966.26 s [vector] +++ OK, passed 100 tests.
  12598. 966.27 s [vector] mut_mapM_: OK (0.02s)
  12599. 966.27 s [vector] +++ OK, passed 100 tests.
  12600. 966.29 s [vector] mut_imapM_: OK (0.02s)
  12601. 966.29 s [vector] +++ OK, passed 100 tests.
  12602. 966.29 s [vector] mut_forM_: OK (0.02s)
  12603. 966.29 s [vector] +++ OK, passed 100 tests.
  12604. 966.31 s [pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
  12605. 966.31 s [pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
  12606. 966.31 s [pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
  12607. 966.31 s [vector] mut_iforM_: OK (0.02s)
  12608. 966.31 s [vector] +++ OK, passed 100 tests.
  12609. 966.31 s [vector] mut_foldr: OK
  12610. 966.31 s [vector] +++ OK, passed 100 tests.
  12611. 966.32 s [vector] mut_foldr': OK
  12612. 966.32 s [vector] +++ OK, passed 100 tests.
  12613. 966.32 s [vector] mut_foldl: OK
  12614. 966.32 s [vector] +++ OK, passed 100 tests.
  12615. 966.33 s [vector] mut_foldl': OK
  12616. 966.33 s [vector] +++ OK, passed 100 tests.
  12617. 966.33 s [vector] mut_ifoldr: OK
  12618. 966.33 s [vector] +++ OK, passed 100 tests.
  12619. 966.33 s [vector] mut_ifoldr': OK
  12620. 966.33 s [vector] +++ OK, passed 100 tests.
  12621. 966.33 s [vector] mut_ifoldl: OK
  12622. 966.33 s [vector] +++ OK, passed 100 tests.
  12623. 966.33 s [vector] mut_ifoldl': OK
  12624. 966.33 s [vector] +++ OK, passed 100 tests.
  12625. 966.33 s [vector] mut_foldM: OK
  12626. 966.34 s [vector] +++ OK, passed 100 tests.
  12627. 966.34 s [vector] mut_foldM': OK
  12628. 966.34 s [vector] +++ OK, passed 100 tests.
  12629. 966.34 s [vector] mut_foldrM: OK
  12630. 966.34 s [vector] +++ OK, passed 100 tests.
  12631. 966.34 s [vector] mut_foldrM': OK
  12632. 966.34 s [vector] +++ OK, passed 100 tests.
  12633. 966.34 s [vector] mut_ifoldM: OK
  12634. 966.35 s [vector] +++ OK, passed 100 tests.
  12635. 966.35 s [vector] mut_ifoldM': OK
  12636. 966.35 s [vector] +++ OK, passed 100 tests.
  12637. 966.35 s [vector] mut_ifoldrM: OK
  12638. 966.35 s [vector] +++ OK, passed 100 tests.
  12639. 966.35 s [vector] mut_ifoldrM': OK
  12640. 966.35 s [vector] +++ OK, passed 100 tests.
  12641. 966.35 s [vector] compare: OK
  12642. 966.35 s [vector] +++ OK, passed 100 tests.
  12643. 966.35 s [vector] maximum: OK
  12644. 966.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12645. 966.35 s [vector] minimum: OK
  12646. 966.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12647. 966.36 s [vector] minIndex: OK
  12648. 966.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12649. 966.36 s [vector] maxIndex: OK
  12650. 966.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12651. 966.36 s [vector] maximumBy: OK
  12652. 966.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12653. 966.36 s [vector] minimumBy: OK
  12654. 966.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12655. 966.36 s [vector] maximumOn: OK
  12656. 966.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12657. 966.36 s [vector] minimumOn: OK
  12658. 966.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12659. 966.36 s [vector] maxIndexBy: OK
  12660. 966.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12661. 966.36 s [vector] minIndexBy: OK
  12662. 966.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12663. 966.36 s [vector] ListFirstMaxIndexWins: OK
  12664. 966.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12665. 966.36 s [vector] FalseListFirstMaxIndexWins: OK
  12666. 966.36 s [vector] +++ OK, failed as expected. (after 1 test):
  12667. 966.36 s [vector] Exception:
  12668. 966.36 s [vector] Prelude.foldr1: empty list
  12669. 966.36 s [vector] CallStack (from HasCallStack):
  12670. 966.36 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12671. 966.36 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12672. 966.36 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12673. 966.36 s [vector] []
  12674. 966.36 s [vector] zip: OK
  12675. 966.36 s [vector] +++ OK, passed 100 tests.
  12676. 966.36 s [vector] zip3: OK
  12677. 966.36 s [vector] +++ OK, passed 100 tests.
  12678. 966.36 s [vector] unzip: OK
  12679. 966.36 s [vector] +++ OK, passed 100 tests.
  12680. 966.36 s [vector] unzip3: OK
  12681. 966.36 s [vector] +++ OK, passed 100 tests.
  12682. 966.36 s [vector] indexed: OK
  12683. 966.36 s [vector] +++ OK, passed 100 tests.
  12684. 966.36 s [vector] update: OK
  12685. 966.37 s [pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
  12686. 966.37 s [pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
  12687. 966.37 s [pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
  12688. 966.37 s [vector] +++ OK, passed 100 tests.
  12689. 966.37 s [vector] concat: OK
  12690. 966.37 s [vector] +++ OK, passed 100 tests.
  12691. 966.37 s [vector] mempty: OK
  12692. 966.37 s [vector] +++ OK, passed 100 tests.
  12693. 966.37 s [vector] mappend: OK
  12694. 966.37 s [vector] +++ OK, passed 100 tests.
  12695. 966.38 s [vector] mconcat: OK
  12696. 966.38 s [vector] +++ OK, passed 100 tests.
  12697. 966.38 s [vector] fmap: OK
  12698. 966.38 s [vector] +++ OK, passed 100 tests.
  12699. 966.39 s [vector] return: OK
  12700. 966.39 s [vector] +++ OK, passed 100 tests.
  12701. 966.40 s [vector] bind: OK (0.01s)
  12702. 966.40 s [vector] +++ OK, passed 100 tests.
  12703. 966.40 s [vector] mzip: OK
  12704. 966.40 s [vector] +++ OK, passed 100 tests.
  12705. 966.40 s [vector] munzip: OK
  12706. 966.40 s [vector] +++ OK, passed 100 tests.
  12707. 966.40 s [vector] applicative_pure: OK
  12708. 966.41 s [vector] +++ OK, passed 100 tests.
  12709. 966.42 s [vector] applicative_appl: OK (0.02s)
  12710. 966.42 s [vector] +++ OK, passed 100 tests.
  12711. 966.42 s [vector] alternative_empty: OK
  12712. 966.42 s [vector] +++ OK, passed 100 tests.
  12713. 966.43 s [vector] alternative_or: OK
  12714. 966.43 s [vector] +++ OK, passed 100 tests.
  12715. 966.45 s [vector] sequence: OK (0.02s)
  12716. 966.45 s [vector] +++ OK, passed 100 tests.
  12717. 966.46 s [vector] sequence_: OK (0.01s)
  12718. 966.46 s [vector] +++ OK, passed 100 tests.
  12719. 966.46 s [vector] glength: OK
  12720. 966.46 s [vector] +++ OK, passed 100 tests.
  12721. 966.46 s [vector] sum: OK
  12722. 966.46 s [vector] +++ OK, passed 100 tests.
  12723. 966.46 s [vector] product: OK
  12724. 966.46 s [vector] +++ OK, passed 100 tests.
  12725. 966.46 s [vector] enumFromN: OK
  12726. 966.46 s [vector] +++ OK, passed 100 tests.
  12727. 966.46 s [vector] enumFromThenN: OK
  12728. 966.46 s [vector] +++ OK, passed 100 tests.
  12729. 966.46 s [vector] enumFromTo: OK
  12730. 966.46 s [vector] +++ OK, passed 100 tests.
  12731. 966.46 s [vector] enumFromThenTo: OK
  12732. 966.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12733. 966.46 s [vector] unstream
  12734. 966.46 s [vector] unstream == vunstream (exact): OK
  12735. 966.46 s [vector] +++ OK, passed 100 tests.
  12736. 966.46 s [vector] unstream == vunstream (unknown): OK
  12737. 966.46 s [vector] +++ OK, passed 100 tests.
  12738. 966.46 s [vector] unstreamR ~= vunstream (exact): OK
  12739. 966.46 s [vector] +++ OK, passed 100 tests.
  12740. 966.46 s [vector] unstreamR ~= vunstream (unknown): OK
  12741. 966.46 s [vector] +++ OK, passed 100 tests.
  12742. 966.46 s [vector] Tests.Vector.Unboxed
  12743. 966.46 s [vector] ()
  12744. 966.46 s [vector] fromList.toList == id: OK
  12745. 966.46 s [vector] +++ OK, passed 100 tests.
  12746. 966.47 s [vector] toList.fromList == id: OK
  12747. 966.47 s [vector] +++ OK, passed 100 tests.
  12748. 966.47 s [vector] unstream.stream == id: OK
  12749. 966.47 s [vector] +++ OK, passed 100 tests.
  12750. 966.47 s [vector] stream.unstream == id: OK
  12751. 966.47 s [vector] +++ OK, passed 100 tests.
  12752. 966.47 s [vector] eq: OK
  12753. 966.47 s [vector] +++ OK, passed 100 tests.
  12754. 966.47 s [vector] length: OK
  12755. 966.47 s [vector] +++ OK, passed 100 tests.
  12756. 966.47 s [vector] null: OK
  12757. 966.47 s [vector] +++ OK, passed 100 tests.
  12758. 966.47 s [vector] index: OK
  12759. 966.47 s [vector] +++ OK, passed 100 tests; 24 discarded.
  12760. 966.47 s [vector] safeIndex: OK
  12761. 966.47 s [vector] +++ OK, passed 100 tests.
  12762. 966.47 s [vector] head: OK
  12763. 966.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12764. 966.47 s [vector] last: OK
  12765. 966.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12766. 966.47 s [vector] unsafeIndex: OK
  12767. 966.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12768. 966.47 s [vector] unsafeHead: OK
  12769. 966.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12770. 966.47 s [vector] unsafeLast: OK
  12771. 966.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12772. 966.47 s [vector] slice: OK
  12773. 966.47 s [vector] +++ OK, passed 100 tests.
  12774. 966.47 s [vector] init: OK
  12775. 966.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12776. 966.47 s [vector] tail: OK
  12777. 966.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12778. 966.47 s [vector] take: OK
  12779. 966.47 s [vector] +++ OK, passed 100 tests.
  12780. 966.47 s [vector] drop: OK
  12781. 966.47 s [vector] +++ OK, passed 100 tests.
  12782. 966.47 s [vector] splitAt: OK
  12783. 966.47 s [vector] +++ OK, passed 100 tests.
  12784. 966.47 s [vector] empty: OK
  12785. 966.47 s [vector] +++ OK, passed 100 tests.
  12786. 966.47 s [vector] singleton: OK
  12787. 966.47 s [vector] +++ OK, passed 100 tests.
  12788. 966.47 s [vector] replicate: OK
  12789. 966.47 s [vector] +++ OK, passed 100 tests.
  12790. 966.47 s [vector] generate: OK
  12791. 966.47 s [vector] +++ OK, passed 100 tests.
  12792. 966.47 s [vector] iterateN: OK
  12793. 966.47 s [vector] +++ OK, passed 100 tests.
  12794. 966.49 s [vector] iterateNM: OK (0.02s)
  12795. 966.49 s [vector] +++ OK, passed 100 tests.
  12796. 966.51 s [vector] generateM: OK (0.01s)
  12797. 966.52 s [vector] +++ OK, passed 100 tests.
  12798. 966.52 s [vector] replicateM: OK (0.01s)
  12799. 966.52 s [vector] +++ OK, passed 100 tests.
  12800. 966.52 s [vector] create: OK
  12801. 966.52 s [vector] +++ OK, passed 100 tests.
  12802. 966.52 s [vector] createT: OK
  12803. 966.52 s [vector] +++ OK, passed 100 tests.
  12804. 966.52 s [vector] unfoldr: OK
  12805. 966.52 s [vector] +++ OK, passed 100 tests.
  12806. 966.52 s [vector] unfoldrN: OK
  12807. 966.52 s [vector] +++ OK, passed 100 tests.
  12808. 966.52 s [vector] unfoldrExactN: OK
  12809. 966.52 s [vector] +++ OK, passed 100 tests.
  12810. 966.53 s [vector] unfoldrM: OK
  12811. 966.53 s [vector] +++ OK, passed 100 tests.
  12812. 966.54 s [vector] unfoldrNM: OK
  12813. 966.54 s [vector] +++ OK, passed 100 tests.
  12814. 966.56 s [vector] unfoldrExactNM: OK (0.02s)
  12815. 966.56 s [vector] +++ OK, passed 100 tests.
  12816. 966.56 s [vector] constructN: OK
  12817. 966.56 s [vector] +++ OK, passed 100 tests.
  12818. 966.56 s [vector] constructrN: OK
  12819. 966.56 s [vector] +++ OK, passed 100 tests.
  12820. 966.56 s [vector] cons: OK
  12821. 966.56 s [vector] +++ OK, passed 100 tests.
  12822. 966.56 s [vector] snoc: OK
  12823. 966.56 s [vector] +++ OK, passed 100 tests.
  12824. 966.56 s [vector] append: OK
  12825. 966.57 s [vector] +++ OK, passed 100 tests.
  12826. 966.57 s [vector] concat: OK
  12827. 966.57 s [vector] +++ OK, passed 100 tests.
  12828. 966.57 s [vector] force: OK
  12829. 966.57 s [vector] +++ OK, passed 100 tests.
  12830. 966.58 s [vector] upd: OK
  12831. 966.58 s [vector] +++ OK, passed 100 tests.
  12832. 966.58 s [vector] accum: OK
  12833. 966.58 s [vector] +++ OK, passed 100 tests.
  12834. 966.58 s [vector] reverse: OK
  12835. 966.59 s [vector] +++ OK, passed 100 tests.
  12836. 966.59 s [vector] backpermute: OK
  12837. 966.59 s [vector] +++ OK, passed 100 tests.
  12838. 966.59 s [vector] map: OK
  12839. 966.59 s [vector] +++ OK, passed 100 tests.
  12840. 966.59 s [vector] imap: OK
  12841. 966.59 s [vector] +++ OK, passed 100 tests.
  12842. 966.59 s [vector] concatMap: OK
  12843. 966.59 s [vector] +++ OK, passed 100 tests.
  12844. 966.61 s [vector] mapM: OK
  12845. 966.61 s [vector] +++ OK, passed 100 tests.
  12846. 966.61 s [vector] mapM_: OK (0.02s)
  12847. 966.61 s [vector] +++ OK, passed 100 tests.
  12848. 966.62 s [vector] forM: OK
  12849. 966.62 s [vector] +++ OK, passed 100 tests.
  12850. 966.63 s [vector] forM_: OK (0.01s)
  12851. 966.63 s [vector] +++ OK, passed 100 tests.
  12852. 966.63 s [vector] imapM: OK
  12853. 966.63 s [vector] +++ OK, passed 100 tests.
  12854. 966.64 s [vector] imapM_: OK (0.01s)
  12855. 966.64 s [vector] +++ OK, passed 100 tests.
  12856. 966.64 s [vector] zipWith: OK
  12857. 966.64 s [vector] +++ OK, passed 100 tests.
  12858. 966.64 s [vector] zipWith3: OK
  12859. 966.64 s [vector] +++ OK, passed 100 tests.
  12860. 966.65 s [vector] izipWith: OK
  12861. 966.65 s [vector] +++ OK, passed 100 tests.
  12862. 966.65 s [vector] izipWith3: OK
  12863. 966.65 s [vector] +++ OK, passed 100 tests.
  12864. 966.65 s [vector] izipWithM: OK
  12865. 966.65 s [vector] +++ OK, passed 100 tests.
  12866. 966.65 s [vector] izipWithM_: OK
  12867. 966.66 s [vector] +++ OK, passed 100 tests.
  12868. 966.66 s [vector] zipWithM: OK
  12869. 966.66 s [vector] +++ OK, passed 100 tests.
  12870. 966.66 s [vector] zipWithM_: OK
  12871. 966.66 s [vector] +++ OK, passed 100 tests.
  12872. 966.66 s [vector] filter: OK
  12873. 966.66 s [vector] +++ OK, passed 100 tests.
  12874. 966.66 s [vector] ifilter: OK
  12875. 966.66 s [vector] +++ OK, passed 100 tests.
  12876. 966.69 s [vector] filterM: OK (0.03s)
  12877. 966.69 s [vector] +++ OK, passed 100 tests.
  12878. 966.69 s [vector] uniq: OK
  12879. 966.69 s [vector] +++ OK, passed 100 tests.
  12880. 966.69 s [vector] mapMaybe: OK
  12881. 966.69 s [vector] +++ OK, passed 100 tests.
  12882. 966.69 s [vector] imapMaybe: OK
  12883. 966.69 s [vector] +++ OK, passed 100 tests.
  12884. 966.69 s [vector] takeWhile: OK
  12885. 966.69 s [vector] +++ OK, passed 100 tests.
  12886. 966.69 s [vector] dropWhile: OK
  12887. 966.69 s [vector] +++ OK, passed 100 tests.
  12888. 966.69 s [vector] partition: OK
  12889. 966.69 s [vector] +++ OK, passed 100 tests.
  12890. 966.70 s [vector] partitionWith: OK
  12891. 966.70 s [vector] +++ OK, passed 100 tests.
  12892. 966.70 s [vector] span: OK
  12893. 966.70 s [vector] +++ OK, passed 100 tests.
  12894. 966.70 s [vector] break: OK
  12895. 966.70 s [vector] +++ OK, passed 100 tests.
  12896. 966.70 s [vector] spanR: OK
  12897. 966.70 s [vector] +++ OK, passed 100 tests.
  12898. 966.70 s [vector] breakR: OK
  12899. 966.70 s [vector] +++ OK, passed 100 tests.
  12900. 966.70 s [vector] groupBy: OK
  12901. 966.70 s [vector] +++ OK, passed 100 tests.
  12902. 966.70 s [vector] elem: OK
  12903. 966.70 s [vector] +++ OK, passed 100 tests.
  12904. 966.70 s [vector] notElem: OK
  12905. 966.70 s [vector] +++ OK, passed 100 tests.
  12906. 966.70 s [vector] find: OK
  12907. 966.70 s [vector] +++ OK, passed 100 tests.
  12908. 966.70 s [vector] findIndex: OK
  12909. 966.70 s [vector] +++ OK, passed 100 tests.
  12910. 966.70 s [vector] findIndexR: OK
  12911. 966.70 s [vector] +++ OK, passed 100 tests.
  12912. 966.70 s [vector] findIndices: OK
  12913. 966.70 s [vector] +++ OK, passed 100 tests.
  12914. 966.70 s [vector] elemIndex: OK
  12915. 966.70 s [vector] +++ OK, passed 100 tests.
  12916. 966.70 s [vector] elemIndices: OK
  12917. 966.70 s [vector] +++ OK, passed 100 tests.
  12918. 966.70 s [vector] foldl: OK
  12919. 966.70 s [vector] +++ OK, passed 100 tests.
  12920. 966.70 s [vector] foldl1: OK
  12921. 966.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12922. 966.70 s [vector] foldl': OK
  12923. 966.70 s [vector] +++ OK, passed 100 tests.
  12924. 966.70 s [vector] foldl1': OK
  12925. 966.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12926. 966.70 s [vector] foldr: OK
  12927. 966.70 s [vector] +++ OK, passed 100 tests.
  12928. 966.70 s [vector] foldr1: OK
  12929. 966.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12930. 966.70 s [vector] foldr': OK
  12931. 966.70 s [vector] +++ OK, passed 100 tests.
  12932. 966.70 s [vector] foldr1': OK
  12933. 966.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12934. 966.71 s [vector] ifoldl: OK
  12935. 966.71 s [vector] +++ OK, passed 100 tests.
  12936. 966.71 s [vector] ifoldl': OK
  12937. 966.71 s [vector] +++ OK, passed 100 tests.
  12938. 966.71 s [vector] ifoldr: OK
  12939. 966.71 s [vector] +++ OK, passed 100 tests.
  12940. 966.71 s [vector] ifoldr': OK
  12941. 966.71 s [vector] +++ OK, passed 100 tests.
  12942. 966.71 s [vector] ifoldM: OK
  12943. 966.71 s [vector] +++ OK, passed 100 tests.
  12944. 966.71 s [vector] ifoldM': OK
  12945. 966.71 s [vector] +++ OK, passed 100 tests.
  12946. 966.72 s [vector] ifoldM_: OK
  12947. 966.72 s [vector] +++ OK, passed 100 tests.
  12948. 966.72 s [vector] ifoldM'_: OK
  12949. 966.72 s [vector] +++ OK, passed 100 tests.
  12950. 966.72 s [vector] all: OK
  12951. 966.72 s [vector] +++ OK, passed 100 tests.
  12952. 966.72 s [vector] any: OK
  12953. 966.72 s [vector] +++ OK, passed 100 tests.
  12954. 966.72 s [vector] prescanl: OK
  12955. 966.72 s [vector] +++ OK, passed 100 tests.
  12956. 966.72 s [vector] prescanl': OK
  12957. 966.73 s [vector] +++ OK, passed 100 tests.
  12958. 966.73 s [vector] postscanl: OK
  12959. 966.73 s [vector] +++ OK, passed 100 tests.
  12960. 966.73 s [vector] postscanl': OK
  12961. 966.73 s [vector] +++ OK, passed 100 tests.
  12962. 966.73 s [vector] scanl: OK
  12963. 966.73 s [vector] +++ OK, passed 100 tests.
  12964. 966.73 s [vector] scanl': OK
  12965. 966.73 s [vector] +++ OK, passed 100 tests.
  12966. 966.73 s [vector] scanl1: OK
  12967. 966.73 s [vector] +++ OK, passed 100 tests.
  12968. 966.73 s [vector] scanl1': OK
  12969. 966.73 s [vector] +++ OK, passed 100 tests.
  12970. 966.73 s [vector] iscanl: OK
  12971. 966.73 s [vector] +++ OK, passed 100 tests.
  12972. 966.73 s [vector] iscanl': OK
  12973. 966.73 s [vector] +++ OK, passed 100 tests.
  12974. 966.73 s [vector] prescanr: OK
  12975. 966.73 s [vector] +++ OK, passed 100 tests.
  12976. 966.73 s [vector] prescanr': OK
  12977. 966.73 s [vector] +++ OK, passed 100 tests.
  12978. 966.73 s [vector] postscanr: OK
  12979. 966.73 s [vector] +++ OK, passed 100 tests.
  12980. 966.73 s [vector] postscanr': OK
  12981. 966.73 s [vector] +++ OK, passed 100 tests.
  12982. 966.73 s [vector] scanr: OK
  12983. 966.73 s [vector] +++ OK, passed 100 tests.
  12984. 966.74 s [vector] scanr': OK
  12985. 966.74 s [vector] +++ OK, passed 100 tests.
  12986. 966.74 s [vector] scanr1: OK
  12987. 966.74 s [vector] +++ OK, passed 100 tests.
  12988. 966.74 s [vector] scanr1': OK
  12989. 966.74 s [vector] +++ OK, passed 100 tests.
  12990. 966.74 s [vector] iscanr: OK
  12991. 966.74 s [vector] +++ OK, passed 100 tests.
  12992. 966.74 s [vector] iscanr': OK
  12993. 966.75 s [vector] +++ OK, passed 100 tests.
  12994. 966.75 s [vector] mut_read: OK
  12995. 966.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12996. 966.75 s [vector] mut_write: OK
  12997. 966.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12998. 966.75 s [vector] mut_modify: OK
  12999. 966.75 s [vector] +++ OK, passed 100 tests; 25 discarded.
  13000. 966.75 s [vector] mut_generate: OK
  13001. 966.75 s [vector] +++ OK, passed 100 tests.
  13002. 966.75 s [vector] mut_generateM: OK
  13003. 966.75 s [vector] +++ OK, passed 100 tests.
  13004. 966.76 s [vector] mut_mapM_: OK
  13005. 966.76 s [vector] +++ OK, passed 100 tests.
  13006. 966.76 s [vector] mut_imapM_: OK
  13007. 966.76 s [vector] +++ OK, passed 100 tests.
  13008. 966.77 s [vector] mut_forM_: OK
  13009. 966.77 s [vector] +++ OK, passed 100 tests.
  13010. 966.78 s [vector] mut_iforM_: OK
  13011. 966.78 s [vector] +++ OK, passed 100 tests.
  13012. 966.78 s [vector] mut_foldr: OK
  13013. 966.78 s [vector] +++ OK, passed 100 tests.
  13014. 966.78 s [vector] mut_foldr': OK
  13015. 966.78 s [vector] +++ OK, passed 100 tests.
  13016. 966.78 s [vector] mut_foldl: OK
  13017. 966.78 s [vector] +++ OK, passed 100 tests.
  13018. 966.78 s [vector] mut_foldl': OK
  13019. 966.78 s [vector] +++ OK, passed 100 tests.
  13020. 966.78 s [vector] mut_ifoldr: OK
  13021. 966.78 s [vector] +++ OK, passed 100 tests.
  13022. 966.78 s [vector] mut_ifoldr': OK
  13023. 966.78 s [vector] +++ OK, passed 100 tests.
  13024. 966.79 s [vector] mut_ifoldl: OK
  13025. 966.79 s [vector] +++ OK, passed 100 tests.
  13026. 966.79 s [vector] mut_ifoldl': OK
  13027. 966.79 s [vector] +++ OK, passed 100 tests.
  13028. 966.79 s [vector] mut_foldM: OK
  13029. 966.79 s [vector] +++ OK, passed 100 tests.
  13030. 966.79 s [vector] mut_foldM': OK
  13031. 966.79 s [vector] +++ OK, passed 100 tests.
  13032. 966.79 s [vector] mut_foldrM: OK
  13033. 966.79 s [vector] +++ OK, passed 100 tests.
  13034. 966.79 s [vector] mut_foldrM': OK
  13035. 966.79 s [vector] +++ OK, passed 100 tests.
  13036. 966.79 s [vector] mut_ifoldM: OK
  13037. 966.79 s [vector] +++ OK, passed 100 tests.
  13038. 966.79 s [vector] mut_ifoldM': OK
  13039. 966.79 s [vector] +++ OK, passed 100 tests.
  13040. 966.79 s [vector] mut_ifoldrM: OK
  13041. 966.79 s [vector] +++ OK, passed 100 tests.
  13042. 966.79 s [vector] mut_ifoldrM': OK
  13043. 966.79 s [vector] +++ OK, passed 100 tests.
  13044. 966.79 s [vector] compare: OK
  13045. 966.79 s [vector] +++ OK, passed 100 tests.
  13046. 966.79 s [vector] maximum: OK
  13047. 966.79 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13048. 966.79 s [vector] minimum: OK
  13049. 966.79 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13050. 966.79 s [vector] minIndex: OK
  13051. 966.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13052. 966.79 s [vector] maxIndex: OK
  13053. 966.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13054. 966.79 s [vector] maximumBy: OK
  13055. 966.79 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13056. 966.79 s [vector] minimumBy: OK
  13057. 966.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13058. 966.79 s [vector] maximumOn: OK
  13059. 966.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13060. 966.79 s [vector] minimumOn: OK
  13061. 966.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13062. 966.79 s [vector] maxIndexBy: OK
  13063. 966.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13064. 966.79 s [vector] minIndexBy: OK
  13065. 966.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13066. 966.80 s [vector] ListFirstMaxIndexWins: OK
  13067. 966.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13068. 966.80 s [vector] FalseListFirstMaxIndexWins: OK
  13069. 966.80 s [vector] +++ OK, failed as expected. (after 1 test):
  13070. 966.80 s [vector] Exception:
  13071. 966.80 s [vector] Prelude.foldr1: empty list
  13072. 966.80 s [vector] CallStack (from HasCallStack):
  13073. 966.80 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13074. 966.80 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13075. 966.80 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13076. 966.80 s [vector] []
  13077. 966.80 s [vector] zip: OK
  13078. 966.80 s [vector] +++ OK, passed 100 tests.
  13079. 966.80 s [vector] zip3: OK
  13080. 966.80 s [vector] +++ OK, passed 100 tests.
  13081. 966.80 s [vector] unzip: OK
  13082. 966.80 s [vector] +++ OK, passed 100 tests.
  13083. 966.80 s [vector] unzip3: OK
  13084. 966.80 s [vector] +++ OK, passed 100 tests.
  13085. 966.80 s [vector] indexed: OK
  13086. 966.80 s [vector] +++ OK, passed 100 tests.
  13087. 966.80 s [vector] update: OK
  13088. 966.81 s [vector] +++ OK, passed 100 tests.
  13089. 966.81 s [vector] mempty: OK
  13090. 966.81 s [vector] +++ OK, passed 100 tests.
  13091. 966.81 s [vector] mappend: OK
  13092. 966.81 s [vector] +++ OK, passed 100 tests.
  13093. 966.81 s [vector] mconcat: OK
  13094. 966.81 s [vector] +++ OK, passed 100 tests.
  13095. 966.81 s [vector] glength: OK
  13096. 966.81 s [vector] +++ OK, passed 100 tests.
  13097. 966.81 s [vector] (Bool)
  13098. 966.81 s [vector] fromList.toList == id: OK
  13099. 966.81 s [vector] +++ OK, passed 100 tests.
  13100. 966.81 s [vector] toList.fromList == id: OK
  13101. 966.81 s [vector] +++ OK, passed 100 tests.
  13102. 966.81 s [vector] unstream.stream == id: OK
  13103. 966.81 s [vector] +++ OK, passed 100 tests.
  13104. 966.81 s [vector] stream.unstream == id: OK
  13105. 966.81 s [vector] +++ OK, passed 100 tests.
  13106. 966.81 s [vector] eq: OK
  13107. 966.81 s [vector] +++ OK, passed 100 tests.
  13108. 966.81 s [vector] length: OK
  13109. 966.82 s [vector] +++ OK, passed 100 tests.
  13110. 966.82 s [vector] null: OK
  13111. 966.82 s [vector] +++ OK, passed 100 tests.
  13112. 966.82 s [vector] index: OK
  13113. 966.82 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13114. 966.82 s [vector] safeIndex: OK
  13115. 966.82 s [vector] +++ OK, passed 100 tests.
  13116. 966.82 s [vector] head: OK
  13117. 966.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13118. 966.82 s [vector] last: OK
  13119. 966.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13120. 966.82 s [vector] unsafeIndex: OK
  13121. 966.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13122. 966.82 s [vector] unsafeHead: OK
  13123. 966.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13124. 966.82 s [vector] unsafeLast: OK
  13125. 966.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13126. 966.82 s [vector] slice: OK
  13127. 966.82 s [vector] +++ OK, passed 100 tests.
  13128. 966.82 s [vector] init: OK
  13129. 966.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13130. 966.82 s [vector] tail: OK
  13131. 966.82 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13132. 966.82 s [vector] take: OK
  13133. 966.82 s [vector] +++ OK, passed 100 tests.
  13134. 966.82 s [vector] drop: OK
  13135. 966.82 s [vector] +++ OK, passed 100 tests.
  13136. 966.82 s [vector] splitAt: OK
  13137. 966.82 s [vector] +++ OK, passed 100 tests.
  13138. 966.82 s [vector] empty: OK
  13139. 966.82 s [vector] +++ OK, passed 100 tests.
  13140. 966.82 s [vector] singleton: OK
  13141. 966.82 s [vector] +++ OK, passed 100 tests.
  13142. 966.82 s [vector] replicate: OK
  13143. 966.82 s [vector] +++ OK, passed 100 tests.
  13144. 966.83 s [vector] generate: OK
  13145. 966.83 s [vector] +++ OK, passed 100 tests.
  13146. 966.83 s [vector] iterateN: OK
  13147. 966.84 s [vector] +++ OK, passed 100 tests.
  13148. 966.85 s [vector] iterateNM: OK (0.02s)
  13149. 966.85 s [vector] +++ OK, passed 100 tests.
  13150. 966.87 s [vector] generateM: OK (0.01s)
  13151. 966.87 s [vector] +++ OK, passed 100 tests.
  13152. 966.87 s [vector] replicateM: OK
  13153. 966.87 s [vector] +++ OK, passed 100 tests.
  13154. 966.87 s [vector] create: OK
  13155. 966.87 s [vector] +++ OK, passed 100 tests.
  13156. 966.87 s [vector] createT: OK
  13157. 966.87 s [vector] +++ OK, passed 100 tests.
  13158. 966.87 s [vector] unfoldr: OK
  13159. 966.87 s [vector] +++ OK, passed 100 tests.
  13160. 966.87 s [vector] unfoldrN: OK
  13161. 966.87 s [vector] +++ OK, passed 100 tests.
  13162. 966.87 s [vector] unfoldrExactN: OK
  13163. 966.87 s [vector] +++ OK, passed 100 tests.
  13164. 966.88 s [vector] unfoldrM: OK
  13165. 966.88 s [vector] +++ OK, passed 100 tests.
  13166. 966.89 s [vector] unfoldrNM: OK
  13167. 966.89 s [vector] +++ OK, passed 100 tests.
  13168. 966.89 s [vector] unfoldrExactNM: OK
  13169. 966.89 s [vector] +++ OK, passed 100 tests.
  13170. 966.89 s [vector] constructN: OK
  13171. 966.90 s [vector] +++ OK, passed 100 tests.
  13172. 966.90 s [vector] constructrN: OK
  13173. 966.90 s [vector] +++ OK, passed 100 tests.
  13174. 966.90 s [vector] cons: OK
  13175. 966.90 s [vector] +++ OK, passed 100 tests.
  13176. 966.90 s [vector] snoc: OK
  13177. 966.90 s [vector] +++ OK, passed 100 tests.
  13178. 966.90 s [vector] append: OK
  13179. 966.90 s [vector] +++ OK, passed 100 tests.
  13180. 966.91 s [vector] concat: OK (0.02s)
  13181. 966.91 s [vector] +++ OK, passed 100 tests.
  13182. 966.91 s [vector] force: OK
  13183. 966.91 s [vector] +++ OK, passed 100 tests.
  13184. 966.91 s [vector] upd: OK
  13185. 966.92 s [vector] +++ OK, passed 100 tests.
  13186. 966.92 s [vector] accum: OK
  13187. 966.92 s [vector] +++ OK, passed 100 tests.
  13188. 966.92 s [vector] reverse: OK
  13189. 966.92 s [vector] +++ OK, passed 100 tests.
  13190. 966.92 s [vector] backpermute: OK
  13191. 966.93 s [vector] +++ OK, passed 100 tests.
  13192. 966.93 s [vector] map: OK
  13193. 966.93 s [vector] +++ OK, passed 100 tests.
  13194. 966.93 s [vector] imap: OK
  13195. 966.93 s [vector] +++ OK, passed 100 tests.
  13196. 966.93 s [vector] concatMap: OK
  13197. 966.93 s [vector] +++ OK, passed 100 tests.
  13198. 966.93 s [vector] mapM: OK
  13199. 966.93 s [vector] +++ OK, passed 100 tests.
  13200. 966.94 s [vector] mapM_: OK
  13201. 966.95 s [pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
  13202. 966.95 s [vector] +++ OK, passed 100 tests.
  13203. 966.95 s [vector] forM: OK
  13204. 966.95 s [vector] +++ OK, passed 100 tests.
  13205. 966.95 s [vector] forM_: OK
  13206. 966.95 s [vector] +++ OK, passed 100 tests.
  13207. 966.95 s [vector] imapM: OK
  13208. 966.95 s [vector] +++ OK, passed 100 tests.
  13209. 966.96 s [vector] imapM_: OK
  13210. 966.96 s [vector] +++ OK, passed 100 tests.
  13211. 966.96 s [vector] zipWith: OK
  13212. 966.96 s [vector] +++ OK, passed 100 tests.
  13213. 966.96 s [vector] zipWith3: OK
  13214. 966.96 s [vector] +++ OK, passed 100 tests.
  13215. 966.97 s [vector] izipWith: OK
  13216. 966.97 s [vector] +++ OK, passed 100 tests.
  13217. 966.97 s [vector] izipWith3: OK
  13218. 966.97 s [vector] +++ OK, passed 100 tests.
  13219. 966.97 s [vector] izipWithM: OK
  13220. 966.97 s [vector] +++ OK, passed 100 tests.
  13221. 966.98 s [vector] izipWithM_: OK
  13222. 966.98 s [vector] +++ OK, passed 100 tests.
  13223. 966.98 s [vector] zipWithM: OK
  13224. 966.98 s [vector] +++ OK, passed 100 tests.
  13225. 966.98 s [vector] zipWithM_: OK
  13226. 966.98 s [vector] +++ OK, passed 100 tests.
  13227. 966.99 s [vector] filter: OK
  13228. 966.99 s [vector] +++ OK, passed 100 tests.
  13229. 966.99 s [vector] ifilter: OK
  13230. 966.99 s [vector] +++ OK, passed 100 tests.
  13231. 967.00 s [vector] filterM: OK (0.01s)
  13232. 967.00 s [vector] +++ OK, passed 100 tests.
  13233. 967.00 s [vector] uniq: OK
  13234. 967.00 s [vector] +++ OK, passed 100 tests.
  13235. 967.01 s [vector] mapMaybe: OK
  13236. 967.01 s [vector] +++ OK, passed 100 tests.
  13237. 967.01 s [vector] imapMaybe: OK
  13238. 967.01 s [vector] +++ OK, passed 100 tests.
  13239. 967.01 s [vector] takeWhile: OK
  13240. 967.01 s [vector] +++ OK, passed 100 tests.
  13241. 967.01 s [vector] dropWhile: OK
  13242. 967.01 s [vector] +++ OK, passed 100 tests.
  13243. 967.01 s [vector] partition: OK
  13244. 967.01 s [vector] +++ OK, passed 100 tests.
  13245. 967.01 s [vector] partitionWith: OK
  13246. 967.01 s [vector] +++ OK, passed 100 tests.
  13247. 967.02 s [vector] span: OK
  13248. 967.02 s [vector] +++ OK, passed 100 tests.
  13249. 967.02 s [vector] break: OK
  13250. 967.02 s [vector] +++ OK, passed 100 tests.
  13251. 967.02 s [vector] spanR: OK
  13252. 967.02 s [vector] +++ OK, passed 100 tests.
  13253. 967.02 s [vector] breakR: OK
  13254. 967.02 s [vector] +++ OK, passed 100 tests.
  13255. 967.02 s [vector] groupBy: OK
  13256. 967.02 s [vector] +++ OK, passed 100 tests.
  13257. 967.02 s [vector] elem: OK
  13258. 967.02 s [vector] +++ OK, passed 100 tests.
  13259. 967.02 s [vector] notElem: OK
  13260. 967.02 s [vector] +++ OK, passed 100 tests.
  13261. 967.02 s [vector] find: OK
  13262. 967.02 s [vector] +++ OK, passed 100 tests.
  13263. 967.02 s [vector] findIndex: OK
  13264. 967.02 s [vector] +++ OK, passed 100 tests.
  13265. 967.02 s [vector] findIndexR: OK
  13266. 967.02 s [vector] +++ OK, passed 100 tests.
  13267. 967.02 s [vector] findIndices: OK
  13268. 967.02 s [vector] +++ OK, passed 100 tests.
  13269. 967.02 s [vector] elemIndex: OK
  13270. 967.02 s [vector] +++ OK, passed 100 tests.
  13271. 967.02 s [vector] elemIndices: OK
  13272. 967.02 s [vector] +++ OK, passed 100 tests.
  13273. 967.03 s [vector] foldl: OK
  13274. 967.03 s [vector] +++ OK, passed 100 tests.
  13275. 967.03 s [vector] foldl1: OK
  13276. 967.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13277. 967.03 s [vector] foldl': OK
  13278. 967.03 s [vector] +++ OK, passed 100 tests.
  13279. 967.04 s [vector] foldl1': OK
  13280. 967.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13281. 967.04 s [vector] foldr: OK
  13282. 967.04 s [vector] +++ OK, passed 100 tests.
  13283. 967.04 s [vector] foldr1: OK
  13284. 967.04 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13285. 967.04 s [vector] foldr': OK
  13286. 967.04 s [vector] +++ OK, passed 100 tests.
  13287. 967.04 s [vector] foldr1': OK
  13288. 967.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13289. 967.05 s [vector] ifoldl: OK
  13290. 967.05 s [vector] +++ OK, passed 100 tests.
  13291. 967.05 s [vector] ifoldl': OK
  13292. 967.05 s [vector] +++ OK, passed 100 tests.
  13293. 967.05 s [vector] ifoldr: OK
  13294. 967.05 s [vector] +++ OK, passed 100 tests.
  13295. 967.05 s [vector] ifoldr': OK
  13296. 967.05 s [vector] +++ OK, passed 100 tests.
  13297. 967.05 s [vector] ifoldM: OK
  13298. 967.05 s [vector] +++ OK, passed 100 tests.
  13299. 967.06 s [vector] ifoldM': OK
  13300. 967.06 s [vector] +++ OK, passed 100 tests.
  13301. 967.07 s [vector] ifoldM_: OK (0.01s)
  13302. 967.07 s [vector] +++ OK, passed 100 tests.
  13303. 967.07 s [vector] ifoldM'_: OK
  13304. 967.07 s [vector] +++ OK, passed 100 tests.
  13305. 967.07 s [vector] all: OK
  13306. 967.07 s [vector] +++ OK, passed 100 tests.
  13307. 967.07 s [vector] any: OK
  13308. 967.08 s [vector] +++ OK, passed 100 tests.
  13309. 967.08 s [vector] prescanl: OK
  13310. 967.08 s [vector] +++ OK, passed 100 tests.
  13311. 967.08 s [vector] prescanl': OK
  13312. 967.08 s [vector] +++ OK, passed 100 tests.
  13313. 967.08 s [vector] postscanl: OK
  13314. 967.08 s [vector] +++ OK, passed 100 tests.
  13315. 967.09 s [vector] postscanl': OK
  13316. 967.09 s [vector] +++ OK, passed 100 tests.
  13317. 967.09 s [vector] scanl: OK
  13318. 967.09 s [vector] +++ OK, passed 100 tests.
  13319. 967.09 s [vector] scanl': OK
  13320. 967.09 s [vector] +++ OK, passed 100 tests.
  13321. 967.09 s [vector] scanl1: OK
  13322. 967.09 s [vector] +++ OK, passed 100 tests.
  13323. 967.09 s [vector] scanl1': OK
  13324. 967.09 s [vector] +++ OK, passed 100 tests.
  13325. 967.09 s [vector] iscanl: OK
  13326. 967.09 s [vector] +++ OK, passed 100 tests.
  13327. 967.09 s [vector] iscanl': OK
  13328. 967.09 s [vector] +++ OK, passed 100 tests.
  13329. 967.09 s [vector] prescanr: OK
  13330. 967.09 s [vector] +++ OK, passed 100 tests.
  13331. 967.10 s [vector] prescanr': OK
  13332. 967.10 s [vector] +++ OK, passed 100 tests.
  13333. 967.10 s [vector] postscanr: OK
  13334. 967.10 s [vector] +++ OK, passed 100 tests.
  13335. 967.10 s [vector] postscanr': OK
  13336. 967.10 s [vector] +++ OK, passed 100 tests.
  13337. 967.10 s [vector] scanr: OK
  13338. 967.10 s [vector] +++ OK, passed 100 tests.
  13339. 967.10 s [vector] scanr': OK
  13340. 967.10 s [vector] +++ OK, passed 100 tests.
  13341. 967.10 s [vector] scanr1: OK
  13342. 967.10 s [vector] +++ OK, passed 100 tests.
  13343. 967.11 s [vector] scanr1': OK
  13344. 967.11 s [vector] +++ OK, passed 100 tests.
  13345. 967.11 s [vector] iscanr: OK
  13346. 967.11 s [vector] +++ OK, passed 100 tests.
  13347. 967.11 s [vector] iscanr': OK
  13348. 967.11 s [vector] +++ OK, passed 100 tests.
  13349. 967.11 s [vector] mut_read: OK
  13350. 967.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13351. 967.11 s [vector] mut_write: OK
  13352. 967.11 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13353. 967.11 s [vector] mut_modify: OK
  13354. 967.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13355. 967.11 s [vector] mut_generate: OK
  13356. 967.11 s [vector] +++ OK, passed 100 tests.
  13357. 967.12 s [vector] mut_generateM: OK
  13358. 967.13 s [vector] +++ OK, passed 100 tests.
  13359. 967.13 s [vector] mut_mapM_: OK (0.01s)
  13360. 967.13 s [vector] +++ OK, passed 100 tests.
  13361. 967.14 s [vector] mut_imapM_: OK
  13362. 967.14 s [vector] +++ OK, passed 100 tests.
  13363. 967.15 s [vector] mut_forM_: OK
  13364. 967.15 s [vector] +++ OK, passed 100 tests.
  13365. 967.16 s [vector] mut_iforM_: OK
  13366. 967.16 s [vector] +++ OK, passed 100 tests.
  13367. 967.16 s [vector] mut_foldr: OK
  13368. 967.16 s [vector] +++ OK, passed 100 tests.
  13369. 967.16 s [vector] mut_foldr': OK
  13370. 967.16 s [vector] +++ OK, passed 100 tests.
  13371. 967.16 s [vector] mut_foldl: OK
  13372. 967.17 s [vector] +++ OK, passed 100 tests.
  13373. 967.17 s [vector] mut_foldl': OK
  13374. 967.17 s [vector] +++ OK, passed 100 tests.
  13375. 967.17 s [vector] mut_ifoldr: OK
  13376. 967.17 s [vector] +++ OK, passed 100 tests.
  13377. 967.17 s [vector] mut_ifoldr': OK
  13378. 967.17 s [vector] +++ OK, passed 100 tests.
  13379. 967.17 s [vector] mut_ifoldl: OK
  13380. 967.17 s [vector] +++ OK, passed 100 tests.
  13381. 967.18 s [vector] mut_ifoldl': OK
  13382. 967.18 s [vector] +++ OK, passed 100 tests.
  13383. 967.18 s [vector] mut_foldM: OK
  13384. 967.18 s [vector] +++ OK, passed 100 tests.
  13385. 967.18 s [vector] mut_foldM': OK
  13386. 967.18 s [vector] +++ OK, passed 100 tests.
  13387. 967.18 s [vector] mut_foldrM: OK
  13388. 967.18 s [vector] +++ OK, passed 100 tests.
  13389. 967.18 s [vector] mut_foldrM': OK
  13390. 967.18 s [vector] +++ OK, passed 100 tests.
  13391. 967.18 s [vector] mut_ifoldM: OK
  13392. 967.18 s [vector] +++ OK, passed 100 tests.
  13393. 967.18 s [vector] mut_ifoldM': OK
  13394. 967.18 s [vector] +++ OK, passed 100 tests.
  13395. 967.18 s [vector] mut_ifoldrM: OK
  13396. 967.18 s [vector] +++ OK, passed 100 tests.
  13397. 967.18 s [vector] mut_ifoldrM': OK
  13398. 967.18 s [vector] +++ OK, passed 100 tests.
  13399. 967.18 s [vector] compare: OK
  13400. 967.18 s [vector] +++ OK, passed 100 tests.
  13401. 967.18 s [vector] maximum: OK
  13402. 967.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13403. 967.18 s [vector] minimum: OK
  13404. 967.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13405. 967.18 s [vector] minIndex: OK
  13406. 967.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13407. 967.18 s [vector] maxIndex: OK
  13408. 967.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13409. 967.18 s [vector] maximumBy: OK
  13410. 967.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13411. 967.19 s [vector] minimumBy: OK
  13412. 967.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13413. 967.19 s [vector] maximumOn: OK
  13414. 967.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13415. 967.19 s [vector] minimumOn: OK
  13416. 967.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13417. 967.19 s [vector] maxIndexBy: OK
  13418. 967.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13419. 967.19 s [vector] minIndexBy: OK
  13420. 967.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13421. 967.19 s [vector] ListFirstMaxIndexWins: OK
  13422. 967.19 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13423. 967.19 s [vector] FalseListFirstMaxIndexWins: OK
  13424. 967.19 s [vector] +++ OK, failed as expected. (after 1 test):
  13425. 967.19 s [vector] Exception:
  13426. 967.19 s [vector] Prelude.foldr1: empty list
  13427. 967.19 s [vector] CallStack (from HasCallStack):
  13428. 967.19 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13429. 967.19 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13430. 967.19 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13431. 967.19 s [vector] []
  13432. 967.19 s [vector] zip: OK
  13433. 967.19 s [vector] +++ OK, passed 100 tests.
  13434. 967.19 s [vector] zip3: OK
  13435. 967.19 s [vector] +++ OK, passed 100 tests.
  13436. 967.19 s [vector] unzip: OK
  13437. 967.19 s [vector] +++ OK, passed 100 tests.
  13438. 967.19 s [vector] unzip3: OK
  13439. 967.19 s [vector] +++ OK, passed 100 tests.
  13440. 967.19 s [vector] indexed: OK
  13441. 967.19 s [vector] +++ OK, passed 100 tests.
  13442. 967.19 s [vector] update: OK
  13443. 967.19 s [vector] +++ OK, passed 100 tests.
  13444. 967.19 s [vector] mempty: OK
  13445. 967.20 s [vector] +++ OK, passed 100 tests.
  13446. 967.21 s [vector] mappend: OK
  13447. 967.21 s [vector] +++ OK, passed 100 tests.
  13448. 967.21 s [vector] mconcat: OK (0.01s)
  13449. 967.21 s [vector] +++ OK, passed 100 tests.
  13450. 967.21 s [vector] glength: OK
  13451. 967.21 s [vector] +++ OK, passed 100 tests.
  13452. 967.21 s [vector] and: OK
  13453. 967.21 s [vector] +++ OK, passed 100 tests.
  13454. 967.21 s [vector] or: OK
  13455. 967.21 s [vector] +++ OK, passed 100 tests.
  13456. 967.21 s [vector] (Int)
  13457. 967.21 s [vector] fromList.toList == id: OK
  13458. 967.21 s [vector] +++ OK, passed 100 tests.
  13459. 967.21 s [vector] toList.fromList == id: OK
  13460. 967.21 s [vector] +++ OK, passed 100 tests.
  13461. 967.21 s [vector] unstream.stream == id: OK
  13462. 967.21 s [vector] +++ OK, passed 100 tests.
  13463. 967.21 s [vector] stream.unstream == id: OK
  13464. 967.21 s [vector] +++ OK, passed 100 tests.
  13465. 967.21 s [vector] eq: OK
  13466. 967.21 s [vector] +++ OK, passed 100 tests.
  13467. 967.22 s [vector] length: OK
  13468. 967.22 s [vector] +++ OK, passed 100 tests.
  13469. 967.22 s [vector] null: OK
  13470. 967.22 s [vector] +++ OK, passed 100 tests.
  13471. 967.22 s [vector] index: OK
  13472. 967.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13473. 967.22 s [vector] safeIndex: OK
  13474. 967.22 s [vector] +++ OK, passed 100 tests.
  13475. 967.22 s [vector] head: OK
  13476. 967.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13477. 967.22 s [vector] last: OK
  13478. 967.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13479. 967.22 s [vector] unsafeIndex: OK
  13480. 967.22 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13481. 967.22 s [vector] unsafeHead: OK
  13482. 967.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13483. 967.22 s [vector] unsafeLast: OK
  13484. 967.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13485. 967.22 s [vector] slice: OK
  13486. 967.22 s [vector] +++ OK, passed 100 tests.
  13487. 967.22 s [vector] init: OK
  13488. 967.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13489. 967.22 s [vector] tail: OK
  13490. 967.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13491. 967.22 s [vector] take: OK
  13492. 967.22 s [vector] +++ OK, passed 100 tests.
  13493. 967.22 s [vector] drop: OK
  13494. 967.22 s [vector] +++ OK, passed 100 tests.
  13495. 967.22 s [vector] splitAt: OK
  13496. 967.22 s [vector] +++ OK, passed 100 tests.
  13497. 967.22 s [vector] empty: OK
  13498. 967.22 s [vector] +++ OK, passed 100 tests.
  13499. 967.22 s [vector] singleton: OK
  13500. 967.23 s [vector] +++ OK, passed 100 tests.
  13501. 967.23 s [vector] replicate: OK
  13502. 967.23 s [vector] +++ OK, passed 100 tests.
  13503. 967.23 s [vector] generate: OK
  13504. 967.23 s [vector] +++ OK, passed 100 tests.
  13505. 967.23 s [vector] iterateN: OK
  13506. 967.23 s [vector] +++ OK, passed 100 tests.
  13507. 967.23 s [vector] iterateNM: OK
  13508. 967.23 s [vector] +++ OK, passed 100 tests.
  13509. 967.28 s [vector] generateM: OK (0.02s)
  13510. 967.28 s [vector] +++ OK, passed 100 tests.
  13511. 967.31 s [vector] replicateM: OK (0.04s)
  13512. 967.31 s [vector] +++ OK, passed 100 tests.
  13513. 967.31 s [vector] create: OK
  13514. 967.31 s [vector] +++ OK, passed 100 tests.
  13515. 967.31 s [vector] createT: OK
  13516. 967.31 s [vector] +++ OK, passed 100 tests.
  13517. 967.31 s [vector] unfoldr: OK
  13518. 967.31 s [vector] +++ OK, passed 100 tests.
  13519. 967.31 s [vector] unfoldrN: OK
  13520. 967.31 s [vector] +++ OK, passed 100 tests.
  13521. 967.31 s [vector] unfoldrExactN: OK
  13522. 967.31 s [vector] +++ OK, passed 100 tests.
  13523. 967.32 s [vector] unfoldrM: OK
  13524. 967.32 s [vector] +++ OK, passed 100 tests.
  13525. 967.32 s [vector] unfoldrNM: OK
  13526. 967.32 s [vector] +++ OK, passed 100 tests.
  13527. 967.33 s [vector] unfoldrExactNM: OK (0.02s)
  13528. 967.33 s [vector] +++ OK, passed 100 tests.
  13529. 967.33 s [vector] constructN: OK
  13530. 967.33 s [vector] +++ OK, passed 100 tests.
  13531. 967.34 s [vector] constructrN: OK
  13532. 967.34 s [vector] +++ OK, passed 100 tests.
  13533. 967.34 s [vector] cons: OK
  13534. 967.34 s [vector] +++ OK, passed 100 tests.
  13535. 967.35 s [vector] snoc: OK
  13536. 967.35 s [vector] +++ OK, passed 100 tests.
  13537. 967.35 s [vector] append: OK
  13538. 967.35 s [vector] +++ OK, passed 100 tests.
  13539. 967.36 s [vector] concat: OK (0.02s)
  13540. 967.36 s [vector] +++ OK, passed 100 tests.
  13541. 967.36 s [vector] force: OK
  13542. 967.36 s [vector] +++ OK, passed 100 tests.
  13543. 967.37 s [vector] upd: OK
  13544. 967.37 s [vector] +++ OK, passed 100 tests.
  13545. 967.38 s [vector] accum: OK
  13546. 967.38 s [vector] +++ OK, passed 100 tests.
  13547. 967.38 s [vector] reverse: OK
  13548. 967.38 s [vector] +++ OK, passed 100 tests.
  13549. 967.38 s [vector] backpermute: OK
  13550. 967.38 s [vector] +++ OK, passed 100 tests.
  13551. 967.38 s [vector] map: OK
  13552. 967.38 s [vector] +++ OK, passed 100 tests.
  13553. 967.38 s [vector] imap: OK
  13554. 967.38 s [vector] +++ OK, passed 100 tests.
  13555. 967.38 s [vector] concatMap: OK
  13556. 967.38 s [vector] +++ OK, passed 100 tests.
  13557. 967.38 s [vector] mapM: OK
  13558. 967.39 s [vector] +++ OK, passed 100 tests.
  13559. 967.39 s [vector] mapM_: OK (0.01s)
  13560. 967.39 s [vector] +++ OK, passed 100 tests.
  13561. 967.39 s [vector] forM: OK
  13562. 967.39 s [vector] +++ OK, passed 100 tests.
  13563. 967.41 s [vector] forM_: OK (0.01s)
  13564. 967.41 s [vector] +++ OK, passed 100 tests.
  13565. 967.42 s [vector] imapM: OK
  13566. 967.42 s [vector] +++ OK, passed 100 tests.
  13567. 967.43 s [vector] imapM_: OK (0.02s)
  13568. 967.43 s [vector] +++ OK, passed 100 tests.
  13569. 967.43 s [vector] zipWith: OK
  13570. 967.43 s [vector] +++ OK, passed 100 tests.
  13571. 967.44 s [vector] zipWith3: OK
  13572. 967.45 s [vector] +++ OK, passed 100 tests.
  13573. 967.45 s [vector] izipWith: OK
  13574. 967.45 s [vector] +++ OK, passed 100 tests.
  13575. 967.46 s [vector] izipWith3: OK
  13576. 967.46 s [vector] +++ OK, passed 100 tests.
  13577. 967.46 s [vector] izipWithM: OK
  13578. 967.46 s [vector] +++ OK, passed 100 tests.
  13579. 967.46 s [vector] izipWithM_: OK (0.01s)
  13580. 967.46 s [vector] +++ OK, passed 100 tests.
  13581. 967.46 s [vector] zipWithM: OK
  13582. 967.46 s [vector] +++ OK, passed 100 tests.
  13583. 967.47 s [vector] zipWithM_: OK (0.01s)
  13584. 967.48 s [vector] +++ OK, passed 100 tests.
  13585. 967.48 s [vector] filter: OK
  13586. 967.48 s [vector] +++ OK, passed 100 tests.
  13587. 967.48 s [vector] ifilter: OK
  13588. 967.48 s [vector] +++ OK, passed 100 tests.
  13589. 967.49 s [vector] filterM: OK (0.02s)
  13590. 967.49 s [vector] +++ OK, passed 100 tests.
  13591. 967.49 s [vector] uniq: OK
  13592. 967.49 s [vector] +++ OK, passed 100 tests.
  13593. 967.49 s [vector] mapMaybe: OK
  13594. 967.49 s [vector] +++ OK, passed 100 tests.
  13595. 967.49 s [vector] imapMaybe: OK
  13596. 967.49 s [vector] +++ OK, passed 100 tests.
  13597. 967.49 s [vector] takeWhile: OK
  13598. 967.49 s [vector] +++ OK, passed 100 tests.
  13599. 967.49 s [vector] dropWhile: OK
  13600. 967.49 s [vector] +++ OK, passed 100 tests.
  13601. 967.50 s [vector] partition: OK
  13602. 967.50 s [vector] +++ OK, passed 100 tests.
  13603. 967.50 s [vector] partitionWith: OK
  13604. 967.50 s [vector] +++ OK, passed 100 tests.
  13605. 967.50 s [vector] span: OK
  13606. 967.50 s [vector] +++ OK, passed 100 tests.
  13607. 967.51 s [vector] break: OK
  13608. 967.51 s [vector] +++ OK, passed 100 tests.
  13609. 967.51 s [vector] spanR: OK
  13610. 967.51 s [vector] +++ OK, passed 100 tests.
  13611. 967.51 s [vector] breakR: OK
  13612. 967.51 s [vector] +++ OK, passed 100 tests.
  13613. 967.51 s [vector] groupBy: OK
  13614. 967.51 s [vector] +++ OK, passed 100 tests.
  13615. 967.51 s [vector] elem: OK
  13616. 967.51 s [vector] +++ OK, passed 100 tests.
  13617. 967.52 s [vector] notElem: OK
  13618. 967.52 s [vector] +++ OK, passed 100 tests.
  13619. 967.52 s [vector] find: OK
  13620. 967.52 s [vector] +++ OK, passed 100 tests.
  13621. 967.52 s [vector] findIndex: OK
  13622. 967.53 s [vector] +++ OK, passed 100 tests.
  13623. 967.53 s [vector] findIndexR: OK
  13624. 967.53 s [vector] +++ OK, passed 100 tests.
  13625. 967.53 s [vector] findIndices: OK
  13626. 967.53 s [vector] +++ OK, passed 100 tests.
  13627. 967.53 s [vector] elemIndex: OK
  13628. 967.53 s [vector] +++ OK, passed 100 tests.
  13629. 967.53 s [vector] elemIndices: OK
  13630. 967.53 s [vector] +++ OK, passed 100 tests.
  13631. 967.53 s [vector] foldl: OK
  13632. 967.54 s [vector] +++ OK, passed 100 tests.
  13633. 967.54 s [vector] foldl1: OK
  13634. 967.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13635. 967.54 s [vector] foldl': OK
  13636. 967.54 s [vector] +++ OK, passed 100 tests.
  13637. 967.54 s [vector] foldl1': OK
  13638. 967.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13639. 967.54 s [vector] foldr: OK
  13640. 967.54 s [vector] +++ OK, passed 100 tests.
  13641. 967.54 s [vector] foldr1: OK
  13642. 967.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13643. 967.54 s [vector] foldr': OK
  13644. 967.54 s [vector] +++ OK, passed 100 tests.
  13645. 967.54 s [vector] foldr1': OK
  13646. 967.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13647. 967.55 s [vector] ifoldl: OK
  13648. 967.55 s [vector] +++ OK, passed 100 tests.
  13649. 967.55 s [vector] ifoldl': OK
  13650. 967.55 s [vector] +++ OK, passed 100 tests.
  13651. 967.55 s [vector] ifoldr: OK
  13652. 967.55 s [vector] +++ OK, passed 100 tests.
  13653. 967.56 s [vector] ifoldr': OK
  13654. 967.56 s [vector] +++ OK, passed 100 tests.
  13655. 967.56 s [vector] ifoldM: OK
  13656. 967.56 s [vector] +++ OK, passed 100 tests.
  13657. 967.56 s [vector] ifoldM': OK
  13658. 967.57 s [vector] +++ OK, passed 100 tests.
  13659. 967.57 s [vector] ifoldM_: OK (0.01s)
  13660. 967.57 s [vector] +++ OK, passed 100 tests.
  13661. 967.59 s [vector] ifoldM'_: OK (0.01s)
  13662. 967.59 s [vector] +++ OK, passed 100 tests.
  13663. 967.59 s [vector] all: OK
  13664. 967.59 s [vector] +++ OK, passed 100 tests.
  13665. 967.59 s [vector] any: OK
  13666. 967.59 s [vector] +++ OK, passed 100 tests.
  13667. 967.59 s [vector] prescanl: OK
  13668. 967.60 s [vector] +++ OK, passed 100 tests.
  13669. 967.60 s [vector] prescanl': OK
  13670. 967.61 s [vector] +++ OK, passed 100 tests.
  13671. 967.61 s [vector] postscanl: OK
  13672. 967.61 s [vector] +++ OK, passed 100 tests.
  13673. 967.61 s [vector] postscanl': OK
  13674. 967.61 s [vector] +++ OK, passed 100 tests.
  13675. 967.61 s [vector] scanl: OK
  13676. 967.61 s [vector] +++ OK, passed 100 tests.
  13677. 967.61 s [vector] scanl': OK
  13678. 967.61 s [vector] +++ OK, passed 100 tests.
  13679. 967.61 s [vector] scanl1: OK
  13680. 967.62 s [vector] +++ OK, passed 100 tests.
  13681. 967.62 s [vector] scanl1': OK
  13682. 967.62 s [vector] +++ OK, passed 100 tests.
  13683. 967.62 s [vector] iscanl: OK
  13684. 967.62 s [vector] +++ OK, passed 100 tests.
  13685. 967.62 s [vector] iscanl': OK
  13686. 967.62 s [vector] +++ OK, passed 100 tests.
  13687. 967.63 s [vector] prescanr: OK
  13688. 967.63 s [vector] +++ OK, passed 100 tests.
  13689. 967.63 s [vector] prescanr': OK
  13690. 967.63 s [vector] +++ OK, passed 100 tests.
  13691. 967.63 s [vector] postscanr: OK
  13692. 967.63 s [vector] +++ OK, passed 100 tests.
  13693. 967.63 s [vector] postscanr': OK
  13694. 967.63 s [vector] +++ OK, passed 100 tests.
  13695. 967.63 s [vector] scanr: OK
  13696. 967.63 s [vector] +++ OK, passed 100 tests.
  13697. 967.64 s [vector] scanr': OK
  13698. 967.64 s [vector] +++ OK, passed 100 tests.
  13699. 967.64 s [pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
  13700. 967.64 s [pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
  13701. 967.64 s [pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
  13702. 967.64 s [pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
  13703. 967.64 s [pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
  13704. 967.64 s [pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
  13705. 967.64 s [pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
  13706. 967.64 s [pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
  13707. 967.64 s [vector] scanr1: OK
  13708. 967.64 s [vector] +++ OK, passed 100 tests.
  13709. 967.64 s [pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
  13710. 967.64 s [pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
  13711. 967.64 s [pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
  13712. 967.65 s [vector] scanr1': OK
  13713. 967.65 s [vector] +++ OK, passed 100 tests.
  13714. 967.65 s [vector] iscanr: OK
  13715. 967.65 s [vector] +++ OK, passed 100 tests.
  13716. 967.65 s [vector] iscanr': OK
  13717. 967.65 s [vector] +++ OK, passed 100 tests.
  13718. 967.65 s [vector] mut_read: OK
  13719. 967.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13720. 967.65 s [vector] mut_write: OK
  13721. 967.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13722. 967.65 s [vector] mut_modify: OK
  13723. 967.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13724. 967.65 s [vector] mut_generate: OK
  13725. 967.65 s [vector] +++ OK, passed 100 tests.
  13726. 967.66 s [vector] mut_generateM: OK
  13727. 967.66 s [vector] +++ OK, passed 100 tests.
  13728. 967.67 s [vector] mut_mapM_: OK
  13729. 967.67 s [vector] +++ OK, passed 100 tests.
  13730. 967.69 s [vector] mut_imapM_: OK (0.01s)
  13731. 967.69 s [vector] +++ OK, passed 100 tests.
  13732. 967.72 s [vector] mut_forM_: OK (0.02s)
  13733. 967.72 s [vector] +++ OK, passed 100 tests.
  13734. 967.74 s [vector] mut_iforM_: OK (0.02s)
  13735. 967.74 s [vector] +++ OK, passed 100 tests.
  13736. 967.74 s [vector] mut_foldr: OK
  13737. 967.74 s [vector] +++ OK, passed 100 tests.
  13738. 967.74 s [vector] mut_foldr': OK
  13739. 967.75 s [vector] +++ OK, passed 100 tests.
  13740. 967.75 s [vector] mut_foldl: OK
  13741. 967.75 s [vector] +++ OK, passed 100 tests.
  13742. 967.75 s [vector] mut_foldl': OK
  13743. 967.76 s [vector] +++ OK, passed 100 tests.
  13744. 967.76 s [vector] mut_ifoldr: OK
  13745. 967.76 s [vector] +++ OK, passed 100 tests.
  13746. 967.76 s [vector] mut_ifoldr': OK
  13747. 967.76 s [vector] +++ OK, passed 100 tests.
  13748. 967.76 s [vector] mut_ifoldl: OK
  13749. 967.76 s [vector] +++ OK, passed 100 tests.
  13750. 967.77 s [vector] mut_ifoldl': OK
  13751. 967.77 s [vector] +++ OK, passed 100 tests.
  13752. 967.77 s [vector] mut_foldM: OK
  13753. 967.77 s [vector] +++ OK, passed 100 tests.
  13754. 967.77 s [vector] mut_foldM': OK
  13755. 967.77 s [vector] +++ OK, passed 100 tests.
  13756. 967.78 s [vector] mut_foldrM: OK
  13757. 967.78 s [vector] +++ OK, passed 100 tests.
  13758. 967.78 s [vector] mut_foldrM': OK
  13759. 967.78 s [vector] +++ OK, passed 100 tests.
  13760. 967.79 s [vector] mut_ifoldM: OK
  13761. 967.79 s [vector] +++ OK, passed 100 tests.
  13762. 967.79 s [vector] mut_ifoldM': OK
  13763. 967.79 s [vector] +++ OK, passed 100 tests.
  13764. 967.79 s [vector] mut_ifoldrM: OK
  13765. 967.79 s [vector] +++ OK, passed 100 tests.
  13766. 967.79 s [vector] mut_ifoldrM': OK
  13767. 967.79 s [vector] +++ OK, passed 100 tests.
  13768. 967.79 s [vector] compare: OK
  13769. 967.79 s [vector] +++ OK, passed 100 tests.
  13770. 967.79 s [vector] maximum: OK
  13771. 967.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13772. 967.79 s [vector] minimum: OK
  13773. 967.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13774. 967.79 s [vector] minIndex: OK
  13775. 967.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13776. 967.80 s [vector] maxIndex: OK
  13777. 967.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13778. 967.80 s [vector] maximumBy: OK
  13779. 967.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13780. 967.80 s [vector] minimumBy: OK
  13781. 967.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13782. 967.80 s [vector] maximumOn: OK
  13783. 967.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13784. 967.80 s [vector] minimumOn: OK
  13785. 967.80 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13786. 967.80 s [vector] maxIndexBy: OK
  13787. 967.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13788. 967.80 s [vector] minIndexBy: OK
  13789. 967.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13790. 967.80 s [vector] ListFirstMaxIndexWins: OK
  13791. 967.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13792. 967.80 s [vector] FalseListFirstMaxIndexWins: OK
  13793. 967.80 s [vector] +++ OK, failed as expected. (after 1 test):
  13794. 967.80 s [vector] Exception:
  13795. 967.80 s [vector] Prelude.foldr1: empty list
  13796. 967.80 s [vector] CallStack (from HasCallStack):
  13797. 967.80 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13798. 967.80 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13799. 967.80 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13800. 967.80 s [vector] []
  13801. 967.80 s [vector] zip: OK
  13802. 967.80 s [vector] +++ OK, passed 100 tests.
  13803. 967.80 s [vector] zip3: OK
  13804. 967.80 s [vector] +++ OK, passed 100 tests.
  13805. 967.80 s [vector] unzip: OK
  13806. 967.80 s [vector] +++ OK, passed 100 tests.
  13807. 967.80 s [vector] unzip3: OK
  13808. 967.80 s [vector] +++ OK, passed 100 tests.
  13809. 967.81 s [vector] indexed: OK
  13810. 967.81 s [vector] +++ OK, passed 100 tests.
  13811. 967.81 s [vector] update: OK
  13812. 967.81 s [vector] +++ OK, passed 100 tests.
  13813. 967.81 s [vector] mempty: OK
  13814. 967.81 s [vector] +++ OK, passed 100 tests.
  13815. 967.81 s [vector] mappend: OK
  13816. 967.81 s [vector] +++ OK, passed 100 tests.
  13817. 967.82 s [vector] mconcat: OK (0.01s)
  13818. 967.82 s [vector] +++ OK, passed 100 tests.
  13819. 967.82 s [vector] glength: OK
  13820. 967.82 s [vector] +++ OK, passed 100 tests.
  13821. 967.82 s [vector] sum: OK
  13822. 967.82 s [vector] +++ OK, passed 100 tests.
  13823. 967.82 s [vector] product: OK
  13824. 967.82 s [vector] +++ OK, passed 100 tests.
  13825. 967.82 s [vector] enumFromN: OK
  13826. 967.83 s [vector] +++ OK, passed 100 tests.
  13827. 967.83 s [vector] enumFromThenN: OK
  13828. 967.83 s [vector] +++ OK, passed 100 tests.
  13829. 967.83 s [vector] enumFromTo: OK
  13830. 967.83 s [vector] +++ OK, passed 100 tests.
  13831. 967.83 s [vector] enumFromThenTo: OK
  13832. 967.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13833. 967.83 s [vector] (Float)
  13834. 967.83 s [vector] fromList.toList == id: OK
  13835. 967.83 s [vector] +++ OK, passed 100 tests.
  13836. 967.83 s [vector] toList.fromList == id: OK
  13837. 967.83 s [vector] +++ OK, passed 100 tests.
  13838. 967.83 s [vector] unstream.stream == id: OK
  13839. 967.83 s [vector] +++ OK, passed 100 tests.
  13840. 967.83 s [vector] stream.unstream == id: OK
  13841. 967.83 s [vector] +++ OK, passed 100 tests.
  13842. 967.83 s [vector] eq: OK
  13843. 967.83 s [vector] +++ OK, passed 100 tests.
  13844. 967.84 s [vector] length: OK
  13845. 967.84 s [vector] +++ OK, passed 100 tests.
  13846. 967.84 s [vector] null: OK
  13847. 967.84 s [vector] +++ OK, passed 100 tests.
  13848. 967.84 s [vector] index: OK
  13849. 967.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13850. 967.84 s [vector] safeIndex: OK
  13851. 967.84 s [vector] +++ OK, passed 100 tests.
  13852. 967.84 s [vector] head: OK
  13853. 967.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13854. 967.84 s [vector] last: OK
  13855. 967.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13856. 967.84 s [vector] unsafeIndex: OK
  13857. 967.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13858. 967.84 s [vector] unsafeHead: OK
  13859. 967.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13860. 967.84 s [vector] unsafeLast: OK
  13861. 967.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13862. 967.84 s [vector] slice: OK
  13863. 967.84 s [vector] +++ OK, passed 100 tests.
  13864. 967.84 s [vector] init: OK
  13865. 967.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13866. 967.84 s [vector] tail: OK
  13867. 967.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13868. 967.84 s [vector] take: OK
  13869. 967.85 s [vector] +++ OK, passed 100 tests.
  13870. 967.85 s [vector] drop: OK
  13871. 967.85 s [vector] +++ OK, passed 100 tests.
  13872. 967.85 s [vector] splitAt: OK
  13873. 967.85 s [vector] +++ OK, passed 100 tests.
  13874. 967.85 s [vector] empty: OK
  13875. 967.85 s [vector] +++ OK, passed 100 tests.
  13876. 967.85 s [vector] singleton: OK
  13877. 967.85 s [vector] +++ OK, passed 100 tests.
  13878. 967.85 s [vector] replicate: OK
  13879. 967.85 s [vector] +++ OK, passed 100 tests.
  13880. 967.85 s [vector] generate: OK
  13881. 967.85 s [vector] +++ OK, passed 100 tests.
  13882. 967.85 s [vector] iterateN: OK
  13883. 967.85 s [vector] +++ OK, passed 100 tests.
  13884. 967.87 s [vector] iterateNM: OK (0.01s)
  13885. 967.87 s [vector] +++ OK, passed 100 tests.
  13886. 967.89 s [vector] generateM: OK (0.03s)
  13887. 967.89 s [vector] +++ OK, passed 100 tests.
  13888. 967.90 s [vector] replicateM: OK
  13889. 967.90 s [vector] +++ OK, passed 100 tests.
  13890. 967.90 s [vector] create: OK
  13891. 967.90 s [vector] +++ OK, passed 100 tests.
  13892. 967.90 s [vector] createT: OK
  13893. 967.90 s [vector] +++ OK, passed 100 tests.
  13894. 967.90 s [vector] unfoldr: OK
  13895. 967.90 s [vector] +++ OK, passed 100 tests.
  13896. 967.90 s [vector] unfoldrN: OK
  13897. 967.90 s [vector] +++ OK, passed 100 tests.
  13898. 967.91 s [vector] unfoldrExactN: OK
  13899. 967.91 s [vector] +++ OK, passed 100 tests.
  13900. 967.91 s [vector] unfoldrM: OK
  13901. 967.91 s [vector] +++ OK, passed 100 tests.
  13902. 967.91 s [vector] unfoldrNM: OK
  13903. 967.91 s [vector] +++ OK, passed 100 tests.
  13904. 967.93 s [vector] unfoldrExactNM: OK (0.01s)
  13905. 967.93 s [vector] +++ OK, passed 100 tests.
  13906. 967.94 s [vector] constructN: OK
  13907. 967.94 s [vector] +++ OK, passed 100 tests.
  13908. 967.94 s [vector] constructrN: OK
  13909. 967.94 s [vector] +++ OK, passed 100 tests.
  13910. 967.94 s [vector] cons: OK
  13911. 967.94 s [vector] +++ OK, passed 100 tests.
  13912. 967.94 s [vector] snoc: OK
  13913. 967.94 s [vector] +++ OK, passed 100 tests.
  13914. 967.94 s [vector] append: OK
  13915. 967.94 s [vector] +++ OK, passed 100 tests.
  13916. 967.97 s [vector] concat: OK (0.02s)
  13917. 967.97 s [vector] +++ OK, passed 100 tests.
  13918. 967.97 s [vector] force: OK
  13919. 967.97 s [vector] +++ OK, passed 100 tests.
  13920. 967.97 s [vector] upd: OK
  13921. 967.97 s [vector] +++ OK, passed 100 tests.
  13922. 967.98 s [vector] accum: OK
  13923. 967.98 s [vector] +++ OK, passed 100 tests.
  13924. 967.98 s [vector] reverse: OK
  13925. 967.98 s [vector] +++ OK, passed 100 tests.
  13926. 967.98 s [vector] backpermute: OK
  13927. 967.98 s [vector] +++ OK, passed 100 tests.
  13928. 967.99 s [vector] map: OK
  13929. 967.99 s [vector] +++ OK, passed 100 tests.
  13930. 967.99 s [vector] imap: OK
  13931. 967.99 s [vector] +++ OK, passed 100 tests.
  13932. 967.99 s [vector] concatMap: OK
  13933. 967.99 s [vector] +++ OK, passed 100 tests.
  13934. 968.00 s [vector] mapM: OK
  13935. 968.00 s [vector] +++ OK, passed 100 tests.
  13936. 968.03 s [vector] mapM_: OK (0.03s)
  13937. 968.03 s [vector] +++ OK, passed 100 tests.
  13938. 968.03 s [vector] forM: OK
  13939. 968.03 s [vector] +++ OK, passed 100 tests.
  13940. 968.06 s [vector] forM_: OK (0.03s)
  13941. 968.07 s [vector] +++ OK, passed 100 tests.
  13942. 968.07 s [vector] imapM: OK
  13943. 968.07 s [vector] +++ OK, passed 100 tests.
  13944. 968.09 s [vector] imapM_: OK (0.03s)
  13945. 968.09 s [vector] +++ OK, passed 100 tests.
  13946. 968.10 s [vector] zipWith: OK
  13947. 968.10 s [vector] +++ OK, passed 100 tests.
  13948. 968.10 s [vector] zipWith3: OK
  13949. 968.11 s [vector] +++ OK, passed 100 tests.
  13950. 968.11 s [vector] izipWith: OK
  13951. 968.11 s [vector] +++ OK, passed 100 tests.
  13952. 968.12 s [vector] izipWith3: OK
  13953. 968.12 s [vector] +++ OK, passed 100 tests.
  13954. 968.13 s [vector] izipWithM: OK
  13955. 968.13 s [vector] +++ OK, passed 100 tests.
  13956. 968.15 s [vector] izipWithM_: OK (0.02s)
  13957. 968.15 s [vector] +++ OK, passed 100 tests.
  13958. 968.15 s [vector] zipWithM: OK
  13959. 968.15 s [vector] +++ OK, passed 100 tests.
  13960. 968.17 s [vector] zipWithM_: OK (0.03s)
  13961. 968.17 s [vector] +++ OK, passed 100 tests.
  13962. 968.18 s [vector] filter: OK
  13963. 968.18 s [vector] +++ OK, passed 100 tests.
  13964. 968.19 s [pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
  13965. 968.19 s [vector] ifilter: OK
  13966. 968.19 s [vector] +++ OK, passed 100 tests.
  13967. 968.22 s [vector] filterM: OK (0.04s)
  13968. 968.22 s [vector] +++ OK, passed 100 tests.
  13969. 968.22 s [vector] uniq: OK
  13970. 968.23 s [vector] +++ OK, passed 100 tests.
  13971. 968.23 s [vector] mapMaybe: OK
  13972. 968.23 s [vector] +++ OK, passed 100 tests.
  13973. 968.23 s [vector] imapMaybe: OK
  13974. 968.23 s [vector] +++ OK, passed 100 tests.
  13975. 968.24 s [vector] takeWhile: OK
  13976. 968.24 s [vector] +++ OK, passed 100 tests.
  13977. 968.24 s [vector] dropWhile: OK
  13978. 968.24 s [vector] +++ OK, passed 100 tests.
  13979. 968.24 s [vector] partition: OK
  13980. 968.25 s [vector] +++ OK, passed 100 tests.
  13981. 968.25 s [vector] partitionWith: OK
  13982. 968.25 s [vector] +++ OK, passed 100 tests.
  13983. 968.25 s [vector] span: OK
  13984. 968.25 s [vector] +++ OK, passed 100 tests.
  13985. 968.25 s [vector] break: OK
  13986. 968.25 s [vector] +++ OK, passed 100 tests.
  13987. 968.25 s [vector] spanR: OK
  13988. 968.25 s [vector] +++ OK, passed 100 tests.
  13989. 968.25 s [vector] breakR: OK
  13990. 968.25 s [vector] +++ OK, passed 100 tests.
  13991. 968.26 s [vector] groupBy: OK
  13992. 968.26 s [vector] +++ OK, passed 100 tests.
  13993. 968.26 s [vector] elem: OK
  13994. 968.26 s [vector] +++ OK, passed 100 tests.
  13995. 968.26 s [vector] notElem: OK
  13996. 968.26 s [vector] +++ OK, passed 100 tests.
  13997. 968.26 s [vector] find: OK
  13998. 968.26 s [vector] +++ OK, passed 100 tests.
  13999. 968.26 s [vector] findIndex: OK
  14000. 968.26 s [vector] +++ OK, passed 100 tests.
  14001. 968.26 s [vector] findIndexR: OK
  14002. 968.27 s [vector] +++ OK, passed 100 tests.
  14003. 968.27 s [vector] findIndices: OK
  14004. 968.27 s [vector] +++ OK, passed 100 tests.
  14005. 968.27 s [vector] elemIndex: OK
  14006. 968.27 s [vector] +++ OK, passed 100 tests.
  14007. 968.27 s [vector] elemIndices: OK
  14008. 968.27 s [vector] +++ OK, passed 100 tests.
  14009. 968.27 s [vector] foldl: OK
  14010. 968.27 s [vector] +++ OK, passed 100 tests.
  14011. 968.28 s [vector] foldl1: OK
  14012. 968.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14013. 968.29 s [vector] foldl': OK
  14014. 968.29 s [vector] +++ OK, passed 100 tests.
  14015. 968.29 s [vector] foldl1': OK
  14016. 968.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14017. 968.30 s [vector] foldr: OK
  14018. 968.30 s [vector] +++ OK, passed 100 tests.
  14019. 968.30 s [vector] foldr1: OK
  14020. 968.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14021. 968.31 s [vector] foldr': OK
  14022. 968.31 s [vector] +++ OK, passed 100 tests.
  14023. 968.32 s [vector] foldr1': OK
  14024. 968.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14025. 968.32 s [vector] ifoldl: OK
  14026. 968.32 s [vector] +++ OK, passed 100 tests.
  14027. 968.33 s [vector] ifoldl': OK
  14028. 968.33 s [vector] +++ OK, passed 100 tests.
  14029. 968.35 s [vector] ifoldr: OK
  14030. 968.35 s [vector] +++ OK, passed 100 tests.
  14031. 968.35 s [vector] ifoldr': OK
  14032. 968.35 s [vector] +++ OK, passed 100 tests.
  14033. 968.35 s [vector] ifoldM: OK
  14034. 968.35 s [vector] +++ OK, passed 100 tests.
  14035. 968.37 s [vector] ifoldM': OK
  14036. 968.37 s [vector] +++ OK, passed 100 tests.
  14037. 968.39 s [vector] ifoldM_: OK (0.03s)
  14038. 968.40 s [vector] +++ OK, passed 100 tests.
  14039. 968.43 s [vector] ifoldM'_: OK (0.03s)
  14040. 968.43 s [vector] +++ OK, passed 100 tests.
  14041. 968.43 s [vector] all: OK
  14042. 968.43 s [vector] +++ OK, passed 100 tests.
  14043. 968.44 s [vector] any: OK
  14044. 968.44 s [vector] +++ OK, passed 100 tests.
  14045. 968.44 s [vector] prescanl: OK
  14046. 968.44 s [vector] +++ OK, passed 100 tests.
  14047. 968.44 s [vector] prescanl': OK
  14048. 968.45 s [vector] +++ OK, passed 100 tests.
  14049. 968.45 s [vector] postscanl: OK
  14050. 968.45 s [vector] +++ OK, passed 100 tests.
  14051. 968.46 s [vector] postscanl': OK
  14052. 968.46 s [vector] +++ OK, passed 100 tests.
  14053. 968.47 s [vector] scanl: OK
  14054. 968.47 s [vector] +++ OK, passed 100 tests.
  14055. 968.47 s [vector] scanl': OK
  14056. 968.47 s [vector] +++ OK, passed 100 tests.
  14057. 968.48 s [vector] scanl1: OK
  14058. 968.48 s [vector] +++ OK, passed 100 tests.
  14059. 968.48 s [vector] scanl1': OK
  14060. 968.49 s [vector] +++ OK, passed 100 tests.
  14061. 968.49 s [vector] iscanl: OK
  14062. 968.49 s [vector] +++ OK, passed 100 tests.
  14063. 968.51 s [vector] iscanl': OK
  14064. 968.51 s [vector] +++ OK, passed 100 tests.
  14065. 968.51 s [vector] prescanr: OK
  14066. 968.51 s [vector] +++ OK, passed 100 tests.
  14067. 968.51 s [vector] prescanr': OK
  14068. 968.51 s [vector] +++ OK, passed 100 tests.
  14069. 968.52 s [vector] postscanr: OK
  14070. 968.52 s [vector] +++ OK, passed 100 tests.
  14071. 968.53 s [vector] postscanr': OK
  14072. 968.53 s [vector] +++ OK, passed 100 tests.
  14073. 968.54 s [vector] scanr: OK (0.01s)
  14074. 968.55 s [vector] +++ OK, passed 100 tests.
  14075. 968.55 s [vector] scanr': OK
  14076. 968.55 s [vector] +++ OK, passed 100 tests.
  14077. 968.55 s [vector] scanr1: OK
  14078. 968.55 s [vector] +++ OK, passed 100 tests.
  14079. 968.57 s [vector] scanr1': OK
  14080. 968.57 s [vector] +++ OK, passed 100 tests.
  14081. 968.57 s [vector] iscanr: OK
  14082. 968.57 s [vector] +++ OK, passed 100 tests.
  14083. 968.57 s [vector] iscanr': OK
  14084. 968.57 s [vector] +++ OK, passed 100 tests.
  14085. 968.57 s [vector] mut_read: OK
  14086. 968.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14087. 968.58 s [vector] mut_write: OK
  14088. 968.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14089. 968.58 s [vector] mut_modify: OK
  14090. 968.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14091. 968.58 s [pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
  14092. 968.58 s [pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
  14093. 968.58 s [pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
  14094. 968.59 s [vector] mut_generate: OK
  14095. 968.61 s [vector] +++ OK, passed 100 tests.
  14096. 968.62 s [vector] mut_generateM: OK (0.02s)
  14097. 968.62 s [vector] +++ OK, passed 100 tests.
  14098. 968.62 s [vector] mut_mapM_: OK (0.03s)
  14099. 968.62 s [vector] +++ OK, passed 100 tests.
  14100. 968.65 s [vector] mut_imapM_: OK (0.02s)
  14101. 968.65 s [vector] +++ OK, passed 100 tests.
  14102. 968.69 s [vector] mut_forM_: OK (0.03s)
  14103. 968.69 s [vector] +++ OK, passed 100 tests.
  14104. 968.71 s [vector] mut_iforM_: OK (0.03s)
  14105. 968.71 s [vector] +++ OK, passed 100 tests.
  14106. 968.71 s [vector] mut_foldr: OK
  14107. 968.71 s [vector] +++ OK, passed 100 tests.
  14108. 968.72 s [vector] mut_foldr': OK
  14109. 968.72 s [vector] +++ OK, passed 100 tests.
  14110. 968.72 s [vector] mut_foldl: OK
  14111. 968.72 s [vector] +++ OK, passed 100 tests.
  14112. 968.73 s [vector] mut_foldl': OK
  14113. 968.74 s [vector] +++ OK, passed 100 tests.
  14114. 968.74 s [vector] mut_ifoldr: OK
  14115. 968.74 s [vector] +++ OK, passed 100 tests.
  14116. 968.74 s [vector] mut_ifoldr': OK
  14117. 968.74 s [vector] +++ OK, passed 100 tests.
  14118. 968.75 s [vector] mut_ifoldl: OK
  14119. 968.75 s [vector] +++ OK, passed 100 tests.
  14120. 968.76 s [vector] mut_ifoldl': OK
  14121. 968.76 s [vector] +++ OK, passed 100 tests.
  14122. 968.76 s [vector] mut_foldM: OK
  14123. 968.76 s [vector] +++ OK, passed 100 tests.
  14124. 968.77 s [vector] mut_foldM': OK
  14125. 968.78 s [vector] +++ OK, passed 100 tests.
  14126. 968.78 s [vector] mut_foldrM: OK
  14127. 968.79 s [vector] +++ OK, passed 100 tests.
  14128. 968.80 s [vector] mut_foldrM': OK
  14129. 968.80 s [vector] +++ OK, passed 100 tests.
  14130. 968.80 s [vector] mut_ifoldM: OK
  14131. 968.81 s [vector] +++ OK, passed 100 tests.
  14132. 968.81 s [pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
  14133. 968.81 s [vector] mut_ifoldM': OK
  14134. 968.81 s [vector] +++ OK, passed 100 tests.
  14135. 968.81 s [vector] mut_ifoldrM: OK
  14136. 968.81 s [vector] +++ OK, passed 100 tests.
  14137. 968.81 s [vector] mut_ifoldrM': OK
  14138. 968.81 s [vector] +++ OK, passed 100 tests.
  14139. 968.81 s [vector] compare: OK
  14140. 968.81 s [vector] +++ OK, passed 100 tests.
  14141. 968.81 s [vector] maximum: OK
  14142. 968.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14143. 968.81 s [vector] minimum: OK
  14144. 968.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14145. 968.82 s [vector] minIndex: OK
  14146. 968.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14147. 968.82 s [vector] maxIndex: OK
  14148. 968.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14149. 968.82 s [vector] maximumBy: OK
  14150. 968.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14151. 968.82 s [vector] minimumBy: OK
  14152. 968.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14153. 968.83 s [vector] maximumOn: OK
  14154. 968.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14155. 968.83 s [vector] minimumOn: OK
  14156. 968.83 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14157. 968.83 s [vector] maxIndexBy: OK
  14158. 968.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14159. 968.83 s [vector] minIndexBy: OK
  14160. 968.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14161. 968.83 s [vector] ListFirstMaxIndexWins: OK
  14162. 968.83 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14163. 968.83 s [vector] FalseListFirstMaxIndexWins: OK
  14164. 968.83 s [vector] +++ OK, failed as expected. (after 1 test):
  14165. 968.83 s [vector] Exception:
  14166. 968.83 s [vector] Prelude.foldr1: empty list
  14167. 968.83 s [vector] CallStack (from HasCallStack):
  14168. 968.83 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  14169. 968.83 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  14170. 968.83 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  14171. 968.83 s [vector] []
  14172. 968.83 s [vector] zip: OK
  14173. 968.83 s [vector] +++ OK, passed 100 tests.
  14174. 968.83 s [vector] zip3: OK
  14175. 968.84 s [vector] +++ OK, passed 100 tests.
  14176. 968.84 s [vector] unzip: OK
  14177. 968.84 s [vector] +++ OK, passed 100 tests.
  14178. 968.84 s [vector] unzip3: OK
  14179. 968.84 s [vector] +++ OK, passed 100 tests.
  14180. 968.84 s [vector] indexed: OK
  14181. 968.84 s [vector] +++ OK, passed 100 tests.
  14182. 968.84 s [vector] update: OK
  14183. 968.84 s [vector] +++ OK, passed 100 tests.
  14184. 968.84 s [vector] mempty: OK
  14185. 968.84 s [vector] +++ OK, passed 100 tests.
  14186. 968.84 s [vector] mappend: OK
  14187. 968.84 s [vector] +++ OK, passed 100 tests.
  14188. 968.86 s [vector] mconcat: OK (0.02s)
  14189. 968.86 s [vector] +++ OK, passed 100 tests.
  14190. 968.86 s [vector] glength: OK
  14191. 968.86 s [vector] +++ OK, passed 100 tests.
  14192. 968.86 s [vector] sum: OK
  14193. 968.86 s [vector] +++ OK, passed 100 tests.
  14194. 968.86 s [vector] product: OK
  14195. 968.86 s [vector] +++ OK, passed 100 tests.
  14196. 968.86 s [vector] enumFromN: OK
  14197. 968.86 s [vector] +++ OK, passed 100 tests.
  14198. 968.86 s [vector] enumFromThenN: OK
  14199. 968.86 s [vector] +++ OK, passed 100 tests.
  14200. 968.86 s [vector] enumFromTo: OK
  14201. 968.86 s [vector] +++ OK, passed 100 tests.
  14202. 968.86 s [vector] enumFromThenTo: OK
  14203. 968.86 s [vector] +++ OK, passed 100 tests; 3 discarded.
  14204. 968.86 s [vector] (Double)
  14205. 968.86 s [vector] fromList.toList == id: OK
  14206. 968.86 s [vector] +++ OK, passed 100 tests.
  14207. 968.86 s [vector] toList.fromList == id: OK
  14208. 968.86 s [vector] +++ OK, passed 100 tests.
  14209. 968.86 s [vector] unstream.stream == id: OK
  14210. 968.86 s [vector] +++ OK, passed 100 tests.
  14211. 968.87 s [vector] stream.unstream == id: OK
  14212. 968.87 s [vector] +++ OK, passed 100 tests.
  14213. 968.87 s [vector] eq: OK
  14214. 968.87 s [vector] +++ OK, passed 100 tests.
  14215. 968.87 s [vector] length: OK
  14216. 968.87 s [vector] +++ OK, passed 100 tests.
  14217. 968.87 s [vector] null: OK
  14218. 968.87 s [pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
  14219. 968.87 s [vector] +++ OK, passed 100 tests.
  14220. 968.87 s [vector] index: OK
  14221. 968.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14222. 968.87 s [vector] safeIndex: OK
  14223. 968.87 s [vector] +++ OK, passed 100 tests.
  14224. 968.87 s [vector] head: OK
  14225. 968.87 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14226. 968.87 s [vector] last: OK
  14227. 968.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14228. 968.87 s [vector] unsafeIndex: OK
  14229. 968.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14230. 968.87 s [vector] unsafeHead: OK
  14231. 968.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14232. 968.87 s [vector] unsafeLast: OK
  14233. 968.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14234. 968.87 s [vector] slice: OK
  14235. 968.87 s [vector] +++ OK, passed 100 tests.
  14236. 968.87 s [vector] init: OK
  14237. 968.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14238. 968.87 s [vector] tail: OK
  14239. 968.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14240. 968.88 s [vector] take: OK
  14241. 968.88 s [vector] +++ OK, passed 100 tests.
  14242. 968.88 s [vector] drop: OK
  14243. 968.88 s [vector] +++ OK, passed 100 tests.
  14244. 968.88 s [vector] splitAt: OK
  14245. 968.88 s [vector] +++ OK, passed 100 tests.
  14246. 968.88 s [vector] empty: OK
  14247. 968.88 s [vector] +++ OK, passed 100 tests.
  14248. 968.88 s [vector] singleton: OK
  14249. 968.88 s [vector] +++ OK, passed 100 tests.
  14250. 968.88 s [vector] replicate: OK
  14251. 968.88 s [vector] +++ OK, passed 100 tests.
  14252. 968.88 s [vector] generate: OK
  14253. 968.88 s [vector] +++ OK, passed 100 tests.
  14254. 968.89 s [vector] iterateN: OK
  14255. 968.89 s [vector] +++ OK, passed 100 tests.
  14256. 968.91 s [vector] iterateNM: OK (0.02s)
  14257. 968.92 s [vector] +++ OK, passed 100 tests.
  14258. 968.93 s [pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
  14259. 968.93 s [vector] generateM: OK (0.02s)
  14260. 968.93 s [vector] +++ OK, passed 100 tests.
  14261. 968.94 s [vector] replicateM: OK
  14262. 968.94 s [vector] +++ OK, passed 100 tests.
  14263. 968.94 s [vector] create: OK
  14264. 968.94 s [vector] +++ OK, passed 100 tests.
  14265. 968.94 s [vector] createT: OK
  14266. 968.94 s [vector] +++ OK, passed 100 tests.
  14267. 968.94 s [vector] unfoldr: OK
  14268. 968.94 s [vector] +++ OK, passed 100 tests.
  14269. 968.94 s [vector] unfoldrN: OK
  14270. 968.94 s [vector] +++ OK, passed 100 tests.
  14271. 968.94 s [vector] unfoldrExactN: OK
  14272. 968.94 s [vector] +++ OK, passed 100 tests.
  14273. 968.94 s [vector] unfoldrM: OK
  14274. 968.95 s [vector] +++ OK, passed 100 tests.
  14275. 968.95 s [vector] unfoldrNM: OK
  14276. 968.95 s [vector] +++ OK, passed 100 tests.
  14277. 968.97 s [vector] unfoldrExactNM: OK (0.02s)
  14278. 968.97 s [vector] +++ OK, passed 100 tests.
  14279. 969.00 s [vector] constructN: OK (0.02s)
  14280. 969.00 s [vector] +++ OK, passed 100 tests.
  14281. 969.01 s [vector] constructrN: OK (0.02s)
  14282. 969.01 s [vector] +++ OK, passed 100 tests.
  14283. 969.03 s [vector] cons: OK
  14284. 969.03 s [vector] +++ OK, passed 100 tests.
  14285. 969.03 s [vector] snoc: OK
  14286. 969.03 s [vector] +++ OK, passed 100 tests.
  14287. 969.03 s [vector] append: OK
  14288. 969.03 s [vector] +++ OK, passed 100 tests.
  14289. 969.03 s [vector] concat: OK (0.02s)
  14290. 969.03 s [vector] +++ OK, passed 100 tests.
  14291. 969.03 s [vector] force: OK
  14292. 969.04 s [vector] +++ OK, passed 100 tests.
  14293. 969.05 s [vector] upd: OK
  14294. 969.05 s [vector] +++ OK, passed 100 tests.
  14295. 969.05 s [vector] accum: OK (0.01s)
  14296. 969.05 s [vector] +++ OK, passed 100 tests.
  14297. 969.05 s [vector] reverse: OK
  14298. 969.05 s [vector] +++ OK, passed 100 tests.
  14299. 969.06 s [vector] backpermute: OK
  14300. 969.06 s [vector] +++ OK, passed 100 tests.
  14301. 969.07 s [vector] map: OK
  14302. 969.07 s [vector] +++ OK, passed 100 tests.
  14303. 969.08 s [vector] imap: OK
  14304. 969.08 s [vector] +++ OK, passed 100 tests.
  14305. 969.09 s [vector] concatMap: OK
  14306. 969.09 s [vector] +++ OK, passed 100 tests.
  14307. 969.09 s [vector] mapM: OK
  14308. 969.09 s [vector] +++ OK, passed 100 tests.
  14309. 969.11 s [vector] mapM_: OK (0.03s)
  14310. 969.11 s [vector] +++ OK, passed 100 tests.
  14311. 969.12 s [vector] forM: OK
  14312. 969.12 s [vector] +++ OK, passed 100 tests.
  14313. 969.15 s [vector] forM_: OK (0.03s)
  14314. 969.15 s [vector] +++ OK, passed 100 tests.
  14315. 969.16 s [vector] imapM: OK
  14316. 969.16 s [vector] +++ OK, passed 100 tests.
  14317. 969.16 s [pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
  14318. 969.19 s [vector] imapM_: OK (0.03s)
  14319. 969.19 s [vector] +++ OK, passed 100 tests.
  14320. 969.19 s [vector] zipWith: OK
  14321. 969.19 s [vector] +++ OK, passed 100 tests.
  14322. 969.21 s [vector] zipWith3: OK (0.01s)
  14323. 969.21 s [vector] +++ OK, passed 100 tests.
  14324. 969.21 s [vector] izipWith: OK
  14325. 969.21 s [vector] +++ OK, passed 100 tests.
  14326. 969.22 s [pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
  14327. 969.23 s [vector] izipWith3: OK (0.01s)
  14328. 969.23 s [vector] +++ OK, passed 100 tests.
  14329. 969.25 s [vector] izipWithM: OK (0.01s)
  14330. 969.25 s [vector] +++ OK, passed 100 tests.
  14331. 969.27 s [vector] izipWithM_: OK (0.03s)
  14332. 969.27 s [vector] +++ OK, passed 100 tests.
  14333. 969.27 s [vector] zipWithM: OK
  14334. 969.27 s [vector] +++ OK, passed 100 tests.
  14335. 969.31 s [vector] zipWithM_: OK (0.03s)
  14336. 969.31 s [vector] +++ OK, passed 100 tests.
  14337. 969.32 s [vector] filter: OK
  14338. 969.33 s [vector] +++ OK, passed 100 tests.
  14339. 969.33 s [vector] ifilter: OK
  14340. 969.33 s [vector] +++ OK, passed 100 tests.
  14341. 969.36 s [vector] filterM: OK (0.05s)
  14342. 969.37 s [vector] +++ OK, passed 100 tests.
  14343. 969.38 s [vector] uniq: OK
  14344. 969.38 s [vector] +++ OK, passed 100 tests.
  14345. 969.38 s [vector] mapMaybe: OK
  14346. 969.38 s [vector] +++ OK, passed 100 tests.
  14347. 969.38 s [vector] imapMaybe: OK
  14348. 969.38 s [vector] +++ OK, passed 100 tests.
  14349. 969.39 s [vector] takeWhile: OK
  14350. 969.39 s [vector] +++ OK, passed 100 tests.
  14351. 969.39 s [vector] dropWhile: OK
  14352. 969.39 s [vector] +++ OK, passed 100 tests.
  14353. 969.39 s [vector] partition: OK
  14354. 969.39 s [vector] +++ OK, passed 100 tests.
  14355. 969.39 s [vector] partitionWith: OK
  14356. 969.39 s [vector] +++ OK, passed 100 tests.
  14357. 969.39 s [vector] span: OK
  14358. 969.39 s [vector] +++ OK, passed 100 tests.
  14359. 969.40 s [vector] break: OK
  14360. 969.40 s [vector] +++ OK, passed 100 tests.
  14361. 969.40 s [vector] spanR: OK
  14362. 969.41 s [vector] +++ OK, passed 100 tests.
  14363. 969.41 s [vector] breakR: OK
  14364. 969.41 s [vector] +++ OK, passed 100 tests.
  14365. 969.41 s [vector] groupBy: OK
  14366. 969.41 s [vector] +++ OK, passed 100 tests.
  14367. 969.41 s [vector] elem: OK
  14368. 969.41 s [vector] +++ OK, passed 100 tests.
  14369. 969.41 s [vector] notElem: OK
  14370. 969.41 s [vector] +++ OK, passed 100 tests.
  14371. 969.41 s [vector] find: OK
  14372. 969.41 s [vector] +++ OK, passed 100 tests.
  14373. 969.41 s [vector] findIndex: OK
  14374. 969.41 s [vector] +++ OK, passed 100 tests.
  14375. 969.41 s [vector] findIndexR: OK
  14376. 969.41 s [vector] +++ OK, passed 100 tests.
  14377. 969.42 s [vector] findIndices: OK
  14378. 969.42 s [vector] +++ OK, passed 100 tests.
  14379. 969.42 s [vector] elemIndex: OK
  14380. 969.42 s [vector] +++ OK, passed 100 tests.
  14381. 969.43 s [vector] elemIndices: OK
  14382. 969.43 s [vector] +++ OK, passed 100 tests.
  14383. 969.44 s [vector] foldl: OK (0.01s)
  14384. 969.45 s [vector] +++ OK, passed 100 tests.
  14385. 969.46 s [vector] foldl1: OK (0.01s)
  14386. 969.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14387. 969.46 s [vector] foldl': OK (0.01s)
  14388. 969.46 s [vector] +++ OK, passed 100 tests.
  14389. 969.47 s [vector] foldl1': OK
  14390. 969.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14391. 969.48 s [vector] foldr: OK (0.01s)
  14392. 969.48 s [vector] +++ OK, passed 100 tests.
  14393. 969.49 s [vector] foldr1: OK (0.01s)
  14394. 969.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14395. 969.50 s [vector] foldr': OK (0.01s)
  14396. 969.50 s [vector] +++ OK, passed 100 tests.
  14397. 969.51 s [vector] foldr1': OK (0.01s)
  14398. 969.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14399. 969.53 s [vector] ifoldl: OK (0.01s)
  14400. 969.53 s [vector] +++ OK, passed 100 tests.
  14401. 969.54 s [vector] ifoldl': OK (0.01s)
  14402. 969.54 s [vector] +++ OK, passed 100 tests.
  14403. 969.55 s [vector] ifoldr: OK (0.01s)
  14404. 969.55 s [vector] +++ OK, passed 100 tests.
  14405. 969.55 s [vector] ifoldr': OK (0.01s)
  14406. 969.55 s [vector] +++ OK, passed 100 tests.
  14407. 969.57 s [vector] ifoldM: OK (0.01s)
  14408. 969.58 s [vector] +++ OK, passed 100 tests.
  14409. 969.59 s [vector] ifoldM': OK (0.01s)
  14410. 969.59 s [vector] +++ OK, passed 100 tests.
  14411. 969.61 s [vector] ifoldM_: OK (0.03s)
  14412. 969.61 s [vector] +++ OK, passed 100 tests.
  14413. 969.65 s [vector] ifoldM'_: OK (0.04s)
  14414. 969.65 s [vector] +++ OK, passed 100 tests.
  14415. 970.13 s [vector] all: OK
  14416. 970.13 s [vector] +++ OK, passed 100 tests.
  14417. 970.13 s [vector] any: OK
  14418. 970.13 s [vector] +++ OK, passed 100 tests.
  14419. 970.13 s [pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
  14420. 970.13 s [vector] prescanl: OK (0.01s)
  14421. 970.13 s [vector] +++ OK, passed 100 tests.
  14422. 970.13 s [vector] prescanl': OK (0.02s)
  14423. 970.13 s [vector] +++ OK, passed 100 tests.
  14424. 970.13 s [vector] postscanl: OK (0.02s)
  14425. 970.13 s [vector] +++ OK, passed 100 tests.
  14426. 970.13 s [vector] postscanl': OK (0.02s)
  14427. 970.13 s [vector] +++ OK, passed 100 tests.
  14428. 970.13 s [vector] scanl: OK (0.02s)
  14429. 970.13 s [vector] +++ OK, passed 100 tests.
  14430. 970.13 s [vector] scanl': OK (0.02s)
  14431. 970.13 s [vector] +++ OK, passed 100 tests.
  14432. 970.13 s [vector] scanl1: OK (0.02s)
  14433. 970.13 s [vector] +++ OK, passed 100 tests.
  14434. 970.13 s [vector] scanl1': OK (0.02s)
  14435. 970.13 s [vector] +++ OK, passed 100 tests.
  14436. 970.13 s [vector] iscanl: OK (0.02s)
  14437. 970.13 s [vector] +++ OK, passed 100 tests.
  14438. 970.13 s [vector] iscanl': OK (0.02s)
  14439. 970.13 s [vector] +++ OK, passed 100 tests.
  14440. 970.13 s [vector] prescanr: OK (0.02s)
  14441. 970.13 s [vector] +++ OK, passed 100 tests.
  14442. 970.13 s [vector] prescanr': OK (0.02s)
  14443. 970.13 s [vector] +++ OK, passed 100 tests.
  14444. 970.13 s [vector] postscanr: OK
  14445. 970.13 s [vector] +++ OK, passed 100 tests.
  14446. 970.13 s [vector] postscanr': OK (0.02s)
  14447. 970.13 s [vector] +++ OK, passed 100 tests.
  14448. 970.13 s [vector] scanr: OK
  14449. 970.13 s [vector] +++ OK, passed 100 tests.
  14450. 970.13 s [vector] scanr': OK (0.02s)
  14451. 970.13 s [vector] +++ OK, passed 100 tests.
  14452. 970.13 s [vector] scanr1: OK (0.01s)
  14453. 970.13 s [vector] +++ OK, passed 100 tests.
  14454. 970.13 s [vector] scanr1': OK (0.01s)
  14455. 970.13 s [vector] +++ OK, passed 100 tests.
  14456. 970.13 s [vector] iscanr: OK (0.01s)
  14457. 970.13 s [vector] +++ OK, passed 100 tests.
  14458. 970.13 s [vector] iscanr': OK (0.02s)
  14459. 970.13 s [vector] +++ OK, passed 100 tests.
  14460. 970.13 s [vector] mut_read: OK
  14461. 970.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14462. 970.13 s [vector] mut_write: OK
  14463. 970.13 s [vector] +++ OK, passed 100 tests; 25 discarded.
  14464. 970.13 s [vector] mut_modify: OK
  14465. 970.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14466. 970.13 s [vector] mut_generate: OK
  14467. 970.13 s [vector] +++ OK, passed 100 tests.
  14468. 970.13 s [vector] mut_generateM: OK (0.02s)
  14469. 970.13 s [vector] +++ OK, passed 100 tests.
  14470. 970.13 s [vector] mut_mapM_: OK (0.03s)
  14471. 970.13 s [vector] +++ OK, passed 100 tests.
  14472. 970.13 s [vector] mut_imapM_: OK (0.03s)
  14473. 970.13 s [vector] +++ OK, passed 100 tests.
  14474. 970.13 s [vector] mut_forM_: OK (0.03s)
  14475. 970.13 s [vector] +++ OK, passed 100 tests.
  14476. 970.13 s [vector] mut_iforM_: OK (0.03s)
  14477. 970.13 s [vector] +++ OK, passed 100 tests.
  14478. 970.15 s [vector] mut_foldr: OK (0.02s)
  14479. 970.15 s [vector] +++ OK, passed 100 tests.
  14480. 970.15 s [vector] mut_foldr': OK (0.01s)
  14481. 970.15 s [vector] +++ OK, passed 100 tests.
  14482. 970.17 s [vector] mut_foldl: OK (0.01s)
  14483. 970.18 s [vector] +++ OK, passed 100 tests.
  14484. 970.18 s [vector] mut_foldl': OK (0.01s)
  14485. 970.18 s [vector] +++ OK, passed 100 tests.
  14486. 970.20 s [vector] mut_ifoldr: OK (0.02s)
  14487. 970.20 s [vector] +++ OK, passed 100 tests.
  14488. 970.22 s [vector] mut_ifoldr': OK (0.02s)
  14489. 970.22 s [vector] +++ OK, passed 100 tests.
  14490. 970.23 s [vector] mut_ifoldl: OK
  14491. 970.24 s [vector] +++ OK, passed 100 tests.
  14492. 970.26 s [vector] mut_ifoldl': OK (0.01s)
  14493. 970.26 s [vector] +++ OK, passed 100 tests.
  14494. 970.27 s [vector] mut_foldM: OK (0.02s)
  14495. 970.27 s [vector] +++ OK, passed 100 tests.
  14496. 970.27 s [vector] mut_foldM': OK (0.01s)
  14497. 970.27 s [vector] +++ OK, passed 100 tests.
  14498. 970.28 s [pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
  14499. 970.28 s [pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
  14500. 970.29 s [vector] mut_foldrM: OK (0.01s)
  14501. 970.29 s [vector] +++ OK, passed 100 tests.
  14502. 970.31 s [vector] mut_foldrM': OK (0.01s)
  14503. 970.31 s [vector] +++ OK, passed 100 tests.
  14504. 970.31 s [vector] mut_ifoldM: OK (0.01s)
  14505. 970.32 s [vector] +++ OK, passed 100 tests.
  14506. 970.32 s [pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
  14507. 970.32 s [pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
  14508. 970.33 s [vector] mut_ifoldM': OK (0.01s)
  14509. 970.34 s [vector] +++ OK, passed 100 tests.
  14510. 970.35 s [vector] mut_ifoldrM: OK (0.01s)
  14511. 970.35 s [vector] +++ OK, passed 100 tests.
  14512. 970.35 s [vector] mut_ifoldrM': OK (0.02s)
  14513. 970.35 s [vector] +++ OK, passed 100 tests.
  14514. 970.36 s [vector] compare: OK
  14515. 970.36 s [vector] +++ OK, passed 100 tests.
  14516. 970.36 s [vector] maximum: OK
  14517. 970.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14518. 970.36 s [vector] minimum: OK
  14519. 970.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14520. 970.36 s [vector] minIndex: OK
  14521. 970.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14522. 970.36 s [vector] maxIndex: OK
  14523. 970.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14524. 970.36 s [vector] maximumBy: OK
  14525. 970.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14526. 970.36 s [vector] minimumBy: OK
  14527. 970.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14528. 970.36 s [vector] maximumOn: OK
  14529. 970.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14530. 970.36 s [vector] minimumOn: OK
  14531. 970.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14532. 970.36 s [vector] maxIndexBy: OK
  14533. 970.36 s [vector] +++ OK, passed 100 tests; 29 discarded.
  14534. 970.36 s [vector] minIndexBy: OK
  14535. 970.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14536. 970.36 s [vector] ListFirstMaxIndexWins: OK
  14537. 970.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14538. 970.37 s [vector] FalseListFirstMaxIndexWins: OK
  14539. 970.37 s [vector] +++ OK, failed as expected. (after 1 test):
  14540. 970.37 s [vector] Exception:
  14541. 970.37 s [vector] Prelude.foldr1: empty list
  14542. 970.37 s [vector] CallStack (from HasCallStack):
  14543. 970.37 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  14544. 970.37 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  14545. 970.37 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  14546. 970.37 s [vector] []
  14547. 970.37 s [vector] zip: OK
  14548. 970.37 s [vector] +++ OK, passed 100 tests.
  14549. 970.37 s [vector] zip3: OK
  14550. 970.37 s [vector] +++ OK, passed 100 tests.
  14551. 970.37 s [vector] unzip: OK
  14552. 970.37 s [vector] +++ OK, passed 100 tests.
  14553. 970.37 s [vector] unzip3: OK
  14554. 970.37 s [vector] +++ OK, passed 100 tests.
  14555. 970.38 s [vector] indexed: OK
  14556. 970.38 s [vector] +++ OK, passed 100 tests.
  14557. 970.38 s [vector] update: OK
  14558. 970.38 s [vector] +++ OK, passed 100 tests.
  14559. 970.38 s [vector] mempty: OK
  14560. 970.39 s [vector] +++ OK, passed 100 tests.
  14561. 970.39 s [vector] mappend: OK
  14562. 970.39 s [vector] +++ OK, passed 100 tests.
  14563. 970.41 s [vector] mconcat: OK (0.02s)
  14564. 970.41 s [vector] +++ OK, passed 100 tests.
  14565. 970.41 s [vector] glength: OK
  14566. 970.41 s [vector] +++ OK, passed 100 tests.
  14567. 970.41 s [vector] sum: OK
  14568. 970.41 s [vector] +++ OK, passed 100 tests.
  14569. 970.41 s [vector] product: OK
  14570. 970.41 s [vector] +++ OK, passed 100 tests.
  14571. 970.41 s [vector] enumFromN: OK
  14572. 970.41 s [vector] +++ OK, passed 100 tests.
  14573. 970.41 s [vector] enumFromThenN: OK
  14574. 970.41 s [vector] +++ OK, passed 100 tests.
  14575. 970.41 s [vector] enumFromTo: OK
  14576. 970.41 s [vector] +++ OK, passed 100 tests.
  14577. 970.41 s [vector] enumFromThenTo: OK
  14578. 970.41 s [vector] +++ OK, passed 100 tests; 3 discarded.
  14579. 970.41 s [vector] (Int,Bool)
  14580. 970.41 s [vector] fromList.toList == id: OK
  14581. 970.41 s [vector] +++ OK, passed 100 tests.
  14582. 970.41 s [vector] toList.fromList == id: OK
  14583. 970.41 s [vector] +++ OK, passed 100 tests.
  14584. 970.41 s [vector] unstream.stream == id: OK
  14585. 970.41 s [vector] +++ OK, passed 100 tests.
  14586. 970.41 s [vector] stream.unstream == id: OK
  14587. 970.41 s [vector] +++ OK, passed 100 tests.
  14588. 970.41 s [vector] eq: OK
  14589. 970.41 s [vector] +++ OK, passed 100 tests.
  14590. 970.41 s [vector] length: OK
  14591. 970.41 s [vector] +++ OK, passed 100 tests.
  14592. 970.42 s [vector] null: OK
  14593. 970.42 s [vector] +++ OK, passed 100 tests.
  14594. 970.42 s [vector] index: OK
  14595. 970.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14596. 970.42 s [vector] safeIndex: OK
  14597. 970.42 s [vector] +++ OK, passed 100 tests.
  14598. 970.42 s [vector] head: OK
  14599. 970.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14600. 970.42 s [vector] last: OK
  14601. 970.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14602. 970.42 s [vector] unsafeIndex: OK
  14603. 970.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14604. 970.42 s [vector] unsafeHead: OK
  14605. 970.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14606. 970.42 s [vector] unsafeLast: OK
  14607. 970.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14608. 970.42 s [vector] slice: OK
  14609. 970.42 s [vector] +++ OK, passed 100 tests.
  14610. 970.42 s [vector] init: OK
  14611. 970.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14612. 970.43 s [vector] tail: OK
  14613. 970.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14614. 970.43 s [vector] take: OK
  14615. 970.43 s [vector] +++ OK, passed 100 tests.
  14616. 970.43 s [vector] drop: OK
  14617. 970.43 s [vector] +++ OK, passed 100 tests.
  14618. 970.43 s [vector] splitAt: OK
  14619. 970.43 s [vector] +++ OK, passed 100 tests.
  14620. 970.43 s [vector] empty: OK
  14621. 970.43 s [vector] +++ OK, passed 100 tests.
  14622. 970.43 s [vector] singleton: OK
  14623. 970.43 s [vector] +++ OK, passed 100 tests.
  14624. 970.43 s [vector] replicate: OK
  14625. 970.43 s [vector] +++ OK, passed 100 tests.
  14626. 970.43 s [vector] generate: OK
  14627. 970.43 s [vector] +++ OK, passed 100 tests.
  14628. 970.43 s [vector] iterateN: OK
  14629. 970.43 s [vector] +++ OK, passed 100 tests.
  14630. 970.44 s [vector] iterateNM: OK
  14631. 970.44 s [vector] +++ OK, passed 100 tests.
  14632. 970.47 s [vector] generateM: OK
  14633. 970.47 s [vector] +++ OK, passed 100 tests.
  14634. 970.47 s [pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
  14635. 970.47 s [pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
  14636. 970.47 s [pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
  14637. 970.47 s [pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
  14638. 970.47 s [pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
  14639. 970.47 s [vector] replicateM: OK
  14640. 970.47 s [vector] +++ OK, passed 100 tests.
  14641. 970.47 s [vector] create: OK
  14642. 970.47 s [vector] +++ OK, passed 100 tests.
  14643. 970.47 s [vector] createT: OK
  14644. 970.47 s [vector] +++ OK, passed 100 tests.
  14645. 970.47 s [vector] unfoldr: OK
  14646. 970.47 s [vector] +++ OK, passed 100 tests.
  14647. 970.48 s [vector] unfoldrN: OK
  14648. 970.48 s [vector] +++ OK, passed 100 tests.
  14649. 970.49 s [vector] unfoldrExactN: OK
  14650. 970.49 s [vector] +++ OK, passed 100 tests.
  14651. 970.49 s [vector] unfoldrM: OK
  14652. 970.49 s [vector] +++ OK, passed 100 tests.
  14653. 970.49 s [vector] unfoldrNM: OK
  14654. 970.49 s [vector] +++ OK, passed 100 tests.
  14655. 970.50 s [vector] unfoldrExactNM: OK (0.02s)
  14656. 970.50 s [vector] +++ OK, passed 100 tests.
  14657. 970.51 s [vector] constructN: OK
  14658. 970.51 s [vector] +++ OK, passed 100 tests.
  14659. 970.51 s [vector] constructrN: OK
  14660. 970.51 s [vector] +++ OK, passed 100 tests.
  14661. 970.52 s [vector] cons: OK
  14662. 970.52 s [vector] +++ OK, passed 100 tests.
  14663. 970.52 s [vector] snoc: OK
  14664. 970.52 s [vector] +++ OK, passed 100 tests.
  14665. 970.53 s [vector] append: OK
  14666. 970.53 s [vector] +++ OK, passed 100 tests.
  14667. 970.55 s [vector] concat: OK (0.03s)
  14668. 970.55 s [vector] +++ OK, passed 100 tests.
  14669. 970.55 s [vector] force: OK
  14670. 970.55 s [vector] +++ OK, passed 100 tests.
  14671. 970.55 s [vector] upd: OK
  14672. 970.55 s [vector] +++ OK, passed 100 tests.
  14673. 970.56 s [vector] accum: OK
  14674. 970.56 s [vector] +++ OK, passed 100 tests.
  14675. 970.56 s [vector] reverse: OK
  14676. 970.57 s [vector] +++ OK, passed 100 tests.
  14677. 970.57 s [vector] backpermute: OK
  14678. 970.57 s [vector] +++ OK, passed 100 tests.
  14679. 970.57 s [vector] map: OK
  14680. 970.57 s [vector] +++ OK, passed 100 tests.
  14681. 970.57 s [vector] imap: OK
  14682. 970.57 s [vector] +++ OK, passed 100 tests.
  14683. 970.58 s [vector] concatMap: OK
  14684. 970.58 s [vector] +++ OK, passed 100 tests.
  14685. 970.58 s [vector] mapM: OK
  14686. 970.59 s [vector] +++ OK, passed 100 tests.
  14687. 970.61 s [vector] mapM_: OK (0.02s)
  14688. 970.61 s [vector] +++ OK, passed 100 tests.
  14689. 970.62 s [vector] forM: OK
  14690. 970.62 s [vector] +++ OK, passed 100 tests.
  14691. 970.63 s [vector] forM_: OK (0.03s)
  14692. 970.63 s [vector] +++ OK, passed 100 tests.
  14693. 970.65 s [vector] imapM: OK
  14694. 970.65 s [vector] +++ OK, passed 100 tests.
  14695. 970.68 s [vector] imapM_: OK (0.03s)
  14696. 970.68 s [vector] +++ OK, passed 100 tests.
  14697. 970.69 s [vector] zipWith: OK (0.01s)
  14698. 970.69 s [vector] +++ OK, passed 100 tests.
  14699. 970.69 s [vector] zipWith3: OK (0.01s)
  14700. 970.69 s [vector] +++ OK, passed 100 tests.
  14701. 970.70 s [vector] izipWith: OK
  14702. 970.70 s [vector] +++ OK, passed 100 tests.
  14703. 970.70 s [vector] izipWith3: OK
  14704. 970.70 s [vector] +++ OK, passed 100 tests.
  14705. 970.71 s [vector] izipWithM: OK
  14706. 970.71 s [vector] +++ OK, passed 100 tests.
  14707. 970.73 s [vector] izipWithM_: OK (0.02s)
  14708. 970.73 s [vector] +++ OK, passed 100 tests.
  14709. 970.73 s [vector] zipWithM: OK
  14710. 970.73 s [vector] +++ OK, passed 100 tests.
  14711. 970.76 s [vector] zipWithM_: OK (0.02s)
  14712. 970.77 s [vector] +++ OK, passed 100 tests.
  14713. 970.77 s [vector] filter: OK
  14714. 970.77 s [vector] +++ OK, passed 100 tests.
  14715. 970.77 s [vector] ifilter: OK
  14716. 970.77 s [vector] +++ OK, passed 100 tests.
  14717. 970.81 s [vector] filterM: OK (0.05s)
  14718. 970.81 s [vector] +++ OK, passed 100 tests.
  14719. 970.81 s [vector] uniq: OK
  14720. 970.81 s [vector] +++ OK, passed 100 tests.
  14721. 970.81 s [vector] mapMaybe: OK
  14722. 970.81 s [vector] +++ OK, passed 100 tests.
  14723. 970.82 s [pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
  14724. 970.82 s [vector] imapMaybe: OK
  14725. 970.82 s [vector] +++ OK, passed 100 tests.
  14726. 970.82 s [vector] takeWhile: OK
  14727. 970.82 s [vector] +++ OK, passed 100 tests.
  14728. 970.82 s [vector] dropWhile: OK
  14729. 970.82 s [vector] +++ OK, passed 100 tests.
  14730. 970.82 s [vector] partition: OK
  14731. 970.83 s [vector] +++ OK, passed 100 tests.
  14732. 970.83 s [vector] partitionWith: OK
  14733. 970.83 s [vector] +++ OK, passed 100 tests.
  14734. 970.83 s [vector] span: OK
  14735. 970.83 s [vector] +++ OK, passed 100 tests.
  14736. 970.83 s [vector] break: OK
  14737. 970.83 s [vector] +++ OK, passed 100 tests.
  14738. 970.83 s [vector] spanR: OK
  14739. 970.83 s [vector] +++ OK, passed 100 tests.
  14740. 970.83 s [vector] breakR: OK
  14741. 970.83 s [vector] +++ OK, passed 100 tests.
  14742. 970.84 s [vector] groupBy: OK
  14743. 970.84 s [vector] +++ OK, passed 100 tests.
  14744. 970.84 s [vector] elem: OK
  14745. 970.84 s [vector] +++ OK, passed 100 tests.
  14746. 970.84 s [vector] notElem: OK
  14747. 970.84 s [vector] +++ OK, passed 100 tests.
  14748. 970.84 s [vector] find: OK
  14749. 970.84 s [vector] +++ OK, passed 100 tests.
  14750. 970.84 s [vector] findIndex: OK
  14751. 970.84 s [vector] +++ OK, passed 100 tests.
  14752. 970.84 s [vector] findIndexR: OK
  14753. 970.84 s [vector] +++ OK, passed 100 tests.
  14754. 970.84 s [vector] findIndices: OK
  14755. 970.84 s [vector] +++ OK, passed 100 tests.
  14756. 970.84 s [vector] elemIndex: OK
  14757. 970.85 s [vector] +++ OK, passed 100 tests.
  14758. 970.85 s [vector] elemIndices: OK
  14759. 970.85 s [vector] +++ OK, passed 100 tests.
  14760. 970.85 s [vector] foldl: OK
  14761. 970.85 s [vector] +++ OK, passed 100 tests.
  14762. 970.86 s [vector] foldl1: OK
  14763. 970.86 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14764. 970.86 s [vector] foldl': OK
  14765. 970.86 s [vector] +++ OK, passed 100 tests.
  14766. 970.87 s [vector] foldl1': OK
  14767. 970.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14768. 970.87 s [vector] foldr: OK
  14769. 970.87 s [vector] +++ OK, passed 100 tests.
  14770. 970.87 s [vector] foldr1: OK
  14771. 970.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14772. 970.88 s [vector] foldr': OK
  14773. 970.89 s [vector] +++ OK, passed 100 tests.
  14774. 970.89 s [vector] foldr1': OK
  14775. 970.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14776. 970.89 s [vector] ifoldl: OK
  14777. 970.89 s [vector] +++ OK, passed 100 tests.
  14778. 970.89 s [vector] ifoldl': OK
  14779. 970.89 s [vector] +++ OK, passed 100 tests.
  14780. 970.90 s [vector] ifoldr: OK
  14781. 970.90 s [vector] +++ OK, passed 100 tests.
  14782. 970.91 s [vector] ifoldr': OK
  14783. 970.91 s [vector] +++ OK, passed 100 tests.
  14784. 970.91 s [vector] ifoldM: OK
  14785. 970.91 s [vector] +++ OK, passed 100 tests.
  14786. 970.92 s [vector] ifoldM': OK
  14787. 970.92 s [vector] +++ OK, passed 100 tests.
  14788. 970.96 s [vector] ifoldM_: OK (0.03s)
  14789. 970.96 s [vector] +++ OK, passed 100 tests.
  14790. 970.98 s [vector] ifoldM'_: OK (0.03s)
  14791. 970.98 s [vector] +++ OK, passed 100 tests.
  14792. 970.98 s [vector] all: OK
  14793. 970.98 s [vector] +++ OK, passed 100 tests.
  14794. 970.98 s [vector] any: OK
  14795. 970.98 s [vector] +++ OK, passed 100 tests.
  14796. 970.98 s [vector] prescanl: OK
  14797. 970.99 s [vector] +++ OK, passed 100 tests.
  14798. 970.99 s [vector] prescanl': OK
  14799. 970.99 s [vector] +++ OK, passed 100 tests.
  14800. 971.00 s [vector] postscanl: OK
  14801. 971.00 s [vector] +++ OK, passed 100 tests.
  14802. 971.00 s [vector] postscanl': OK
  14803. 971.00 s [vector] +++ OK, passed 100 tests.
  14804. 971.00 s [vector] scanl: OK
  14805. 971.01 s [vector] +++ OK, passed 100 tests.
  14806. 971.01 s [vector] scanl': OK
  14807. 971.01 s [vector] +++ OK, passed 100 tests.
  14808. 971.02 s [vector] scanl1: OK
  14809. 971.02 s [vector] +++ OK, passed 100 tests.
  14810. 971.02 s [vector] scanl1': OK
  14811. 971.02 s [vector] +++ OK, passed 100 tests.
  14812. 971.03 s [vector] iscanl: OK
  14813. 971.03 s [vector] +++ OK, passed 100 tests.
  14814. 971.03 s [vector] iscanl': OK
  14815. 971.03 s [vector] +++ OK, passed 100 tests.
  14816. 971.03 s [vector] prescanr: OK
  14817. 971.03 s [vector] +++ OK, passed 100 tests.
  14818. 971.04 s [vector] prescanr': OK
  14819. 971.04 s [vector] +++ OK, passed 100 tests.
  14820. 971.05 s [vector] postscanr: OK
  14821. 971.05 s [pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
  14822. 971.05 s [vector] +++ OK, passed 100 tests.
  14823. 971.06 s [vector] postscanr': OK
  14824. 971.06 s [vector] +++ OK, passed 100 tests.
  14825. 971.07 s [vector] scanr: OK
  14826. 971.07 s [vector] +++ OK, passed 100 tests.
  14827. 971.07 s [vector] scanr': OK
  14828. 971.07 s [vector] +++ OK, passed 100 tests.
  14829. 971.07 s [vector] scanr1: OK
  14830. 971.07 s [vector] +++ OK, passed 100 tests.
  14831. 971.07 s [vector] scanr1': OK
  14832. 971.07 s [vector] +++ OK, passed 100 tests.
  14833. 971.08 s [vector] iscanr: OK
  14834. 971.08 s [vector] +++ OK, passed 100 tests.
  14835. 971.08 s [vector] iscanr': OK
  14836. 971.08 s [vector] +++ OK, passed 100 tests.
  14837. 971.08 s [vector] mut_read: OK
  14838. 971.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14839. 971.08 s [vector] mut_write: OK
  14840. 971.08 s [pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
  14841. 971.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14842. 971.08 s [vector] mut_modify: OK
  14843. 971.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14844. 971.10 s [vector] mut_generate: OK
  14845. 971.10 s [vector] +++ OK, passed 100 tests.
  14846. 971.12 s [vector] mut_generateM: OK (0.01s)
  14847. 971.12 s [vector] +++ OK, passed 100 tests.
  14848. 971.13 s [vector] mut_mapM_: OK (0.02s)
  14849. 971.14 s [vector] +++ OK, passed 100 tests.
  14850. 971.14 s [vector] mut_imapM_: OK (0.02s)
  14851. 971.14 s [vector] +++ OK, passed 100 tests.
  14852. 971.16 s [vector] mut_forM_: OK (0.01s)
  14853. 971.16 s [vector] +++ OK, passed 100 tests.
  14854. 971.19 s [vector] mut_iforM_: OK (0.02s)
  14855. 971.19 s [vector] +++ OK, passed 100 tests.
  14856. 971.19 s [vector] mut_foldr: OK
  14857. 971.19 s [vector] +++ OK, passed 100 tests.
  14858. 971.20 s [vector] mut_foldr': OK
  14859. 971.20 s [vector] +++ OK, passed 100 tests.
  14860. 971.20 s [vector] mut_foldl: OK
  14861. 971.20 s [vector] +++ OK, passed 100 tests.
  14862. 971.20 s [vector] mut_foldl': OK
  14863. 971.20 s [vector] +++ OK, passed 100 tests.
  14864. 971.21 s [vector] mut_ifoldr: OK
  14865. 971.21 s [vector] +++ OK, passed 100 tests.
  14866. 971.21 s [vector] mut_ifoldr': OK
  14867. 971.21 s [vector] +++ OK, passed 100 tests.
  14868. 971.22 s [vector] mut_ifoldl: OK
  14869. 971.22 s [vector] +++ OK, passed 100 tests.
  14870. 971.22 s [vector] mut_ifoldl': OK
  14871. 971.22 s [vector] +++ OK, passed 100 tests.
  14872. 971.23 s [vector] mut_foldM: OK
  14873. 971.23 s [vector] +++ OK, passed 100 tests.
  14874. 971.23 s [vector] mut_foldM': OK
  14875. 971.23 s [vector] +++ OK, passed 100 tests.
  14876. 971.23 s [vector] mut_foldrM: OK
  14877. 971.23 s [vector] +++ OK, passed 100 tests.
  14878. 971.24 s [vector] mut_foldrM': OK
  14879. 971.24 s [vector] +++ OK, passed 100 tests.
  14880. 971.24 s [vector] mut_ifoldM: OK
  14881. 971.24 s [vector] +++ OK, passed 100 tests.
  14882. 971.24 s [vector] mut_ifoldM': OK
  14883. 971.25 s [vector] +++ OK, passed 100 tests.
  14884. 971.25 s [vector] mut_ifoldrM: OK
  14885. 971.25 s [vector] +++ OK, passed 100 tests.
  14886. 971.25 s [vector] mut_ifoldrM': OK
  14887. 971.25 s [vector] +++ OK, passed 100 tests.
  14888. 971.25 s [vector] compare: OK
  14889. 971.25 s [vector] +++ OK, passed 100 tests.
  14890. 971.25 s [vector] maximum: OK
  14891. 971.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14892. 971.26 s [vector] minimum: OK
  14893. 971.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14894. 971.26 s [vector] minIndex: OK
  14895. 971.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14896. 971.26 s [vector] maxIndex: OK
  14897. 971.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14898. 971.26 s [vector] maximumBy: OK
  14899. 971.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14900. 971.26 s [vector] minimumBy: OK
  14901. 971.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14902. 971.26 s [vector] maximumOn: OK
  14903. 971.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14904. 971.26 s [vector] minimumOn: OK
  14905. 971.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14906. 971.26 s [vector] maxIndexBy: OK
  14907. 971.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14908. 971.26 s [vector] minIndexBy: OK
  14909. 971.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14910. 971.26 s [vector] ListFirstMaxIndexWins: OK
  14911. 971.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14912. 971.27 s [vector] FalseListFirstMaxIndexWins: OK
  14913. 971.27 s [vector] +++ OK, failed as expected. (after 1 test):
  14914. 971.27 s [vector] Exception:
  14915. 971.27 s [vector] Prelude.foldr1: empty list
  14916. 971.27 s [vector] CallStack (from HasCallStack):
  14917. 971.27 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  14918. 971.27 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  14919. 971.27 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  14920. 971.27 s [vector] []
  14921. 971.27 s [vector] zip: OK
  14922. 971.27 s [vector] +++ OK, passed 100 tests.
  14923. 971.27 s [vector] zip3: OK
  14924. 971.27 s [vector] +++ OK, passed 100 tests.
  14925. 971.27 s [vector] unzip: OK
  14926. 971.27 s [vector] +++ OK, passed 100 tests.
  14927. 971.28 s [vector] unzip3: OK
  14928. 971.28 s [vector] +++ OK, passed 100 tests.
  14929. 971.28 s [vector] indexed: OK
  14930. 971.28 s [vector] +++ OK, passed 100 tests.
  14931. 971.28 s [vector] update: OK
  14932. 971.28 s [vector] +++ OK, passed 100 tests.
  14933. 971.29 s [vector] mempty: OK
  14934. 971.29 s [vector] +++ OK, passed 100 tests.
  14935. 971.29 s [vector] mappend: OK
  14936. 971.29 s [vector] +++ OK, passed 100 tests.
  14937. 971.33 s [vector] mconcat: OK (0.04s)
  14938. 971.33 s [vector] +++ OK, passed 100 tests.
  14939. 971.33 s [vector] glength: OK
  14940. 971.33 s [vector] +++ OK, passed 100 tests.
  14941. 971.33 s [vector] (Int,Bool,Int)
  14942. 971.33 s [vector] fromList.toList == id: OK
  14943. 971.33 s [vector] +++ OK, passed 100 tests.
  14944. 971.33 s [vector] toList.fromList == id: OK
  14945. 971.33 s [vector] +++ OK, passed 100 tests.
  14946. 971.33 s [vector] unstream.stream == id: OK
  14947. 971.33 s [vector] +++ OK, passed 100 tests.
  14948. 971.34 s [vector] stream.unstream == id: OK
  14949. 971.34 s [vector] +++ OK, passed 100 tests.
  14950. 971.34 s [vector] eq: OK
  14951. 971.34 s [vector] +++ OK, passed 100 tests.
  14952. 971.34 s [vector] length: OK
  14953. 971.34 s [vector] +++ OK, passed 100 tests.
  14954. 971.34 s [vector] null: OK
  14955. 971.34 s [vector] +++ OK, passed 100 tests.
  14956. 971.34 s [vector] index: OK
  14957. 971.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14958. 971.34 s [vector] safeIndex: OK
  14959. 971.34 s [vector] +++ OK, passed 100 tests.
  14960. 971.34 s [vector] head: OK
  14961. 971.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14962. 971.35 s [vector] last: OK
  14963. 971.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14964. 971.35 s [vector] unsafeIndex: OK
  14965. 971.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14966. 971.35 s [vector] unsafeHead: OK
  14967. 971.35 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14968. 971.35 s [vector] unsafeLast: OK
  14969. 971.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14970. 971.35 s [vector] slice: OK
  14971. 971.35 s [vector] +++ OK, passed 100 tests.
  14972. 971.35 s [vector] init: OK
  14973. 971.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14974. 971.35 s [vector] tail: OK
  14975. 971.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14976. 971.35 s [vector] take: OK
  14977. 971.35 s [vector] +++ OK, passed 100 tests.
  14978. 971.36 s [vector] drop: OK
  14979. 971.36 s [vector] +++ OK, passed 100 tests.
  14980. 971.36 s [vector] splitAt: OK
  14981. 971.36 s [vector] +++ OK, passed 100 tests.
  14982. 971.36 s [vector] empty: OK
  14983. 971.36 s [vector] +++ OK, passed 100 tests.
  14984. 971.36 s [vector] singleton: OK
  14985. 971.36 s [vector] +++ OK, passed 100 tests.
  14986. 971.36 s [vector] replicate: OK
  14987. 971.36 s [vector] +++ OK, passed 100 tests.
  14988. 971.36 s [vector] generate: OK
  14989. 971.37 s [vector] +++ OK, passed 100 tests.
  14990. 971.37 s [vector] iterateN: OK
  14991. 971.37 s [vector] +++ OK, passed 100 tests.
  14992. 971.39 s [vector] iterateNM: OK (0.03s)
  14993. 971.39 s [vector] +++ OK, passed 100 tests.
  14994. 971.45 s [vector] generateM: OK (0.05s)
  14995. 971.45 s [vector] +++ OK, passed 100 tests.
  14996. 971.45 s [vector] replicateM: OK (0.01s)
  14997. 971.45 s [vector] +++ OK, passed 100 tests.
  14998. 971.46 s [vector] create: OK
  14999. 971.46 s [vector] +++ OK, passed 100 tests.
  15000. 971.46 s [vector] createT: OK
  15001. 971.46 s [vector] +++ OK, passed 100 tests.
  15002. 971.46 s [vector] unfoldr: OK
  15003. 971.46 s [vector] +++ OK, passed 100 tests.
  15004. 971.46 s [vector] unfoldrN: OK
  15005. 971.46 s [vector] +++ OK, passed 100 tests.
  15006. 971.46 s [vector] unfoldrExactN: OK
  15007. 971.46 s [vector] +++ OK, passed 100 tests.
  15008. 971.47 s [vector] unfoldrM: OK
  15009. 971.47 s [vector] +++ OK, passed 100 tests.
  15010. 971.47 s [vector] unfoldrNM: OK
  15011. 971.47 s [vector] +++ OK, passed 100 tests.
  15012. 971.49 s [vector] unfoldrExactNM: OK (0.02s)
  15013. 971.49 s [vector] +++ OK, passed 100 tests.
  15014. 971.49 s [vector] constructN: OK
  15015. 971.49 s [vector] +++ OK, passed 100 tests.
  15016. 971.50 s [vector] constructrN: OK
  15017. 971.50 s [vector] +++ OK, passed 100 tests.
  15018. 971.50 s [vector] cons: OK
  15019. 971.50 s [vector] +++ OK, passed 100 tests.
  15020. 971.51 s [vector] snoc: OK
  15021. 971.51 s [vector] +++ OK, passed 100 tests.
  15022. 971.51 s [vector] append: OK
  15023. 971.51 s [vector] +++ OK, passed 100 tests.
  15024. 971.56 s [pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
  15025. 971.56 s [pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
  15026. 971.56 s [pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
  15027. 971.58 s [vector] concat: OK (0.07s)
  15028. 971.58 s [vector] +++ OK, passed 100 tests.
  15029. 971.58 s [vector] force: OK
  15030. 971.58 s [vector] +++ OK, passed 100 tests.
  15031. 971.58 s [vector] upd: OK
  15032. 971.59 s [vector] +++ OK, passed 100 tests.
  15033. 971.59 s [vector] accum: OK
  15034. 971.59 s [vector] +++ OK, passed 100 tests.
  15035. 971.59 s [vector] reverse: OK
  15036. 971.59 s [vector] +++ OK, passed 100 tests.
  15037. 971.60 s [vector] backpermute: OK
  15038. 971.61 s [vector] +++ OK, passed 100 tests.
  15039. 971.61 s [vector] map: OK
  15040. 971.61 s [vector] +++ OK, passed 100 tests.
  15041. 971.61 s [vector] imap: OK
  15042. 971.61 s [vector] +++ OK, passed 100 tests.
  15043. 971.62 s [vector] concatMap: OK
  15044. 971.62 s [vector] +++ OK, passed 100 tests.
  15045. 971.62 s [vector] mapM: OK
  15046. 971.63 s [vector] +++ OK, passed 100 tests.
  15047. 971.65 s [vector] mapM_: OK (0.03s)
  15048. 971.66 s [vector] +++ OK, passed 100 tests.
  15049. 971.66 s [vector] forM: OK
  15050. 971.66 s [vector] +++ OK, passed 100 tests.
  15051. 971.71 s [vector] forM_: OK (0.04s)
  15052. 971.71 s [vector] +++ OK, passed 100 tests.
  15053. 971.71 s [vector] imapM: OK
  15054. 971.72 s [vector] +++ OK, passed 100 tests.
  15055. 971.75 s [vector] imapM_: OK (0.04s)
  15056. 971.75 s [vector] +++ OK, passed 100 tests.
  15057. 971.75 s [vector] zipWith: OK
  15058. 971.75 s [vector] +++ OK, passed 100 tests.
  15059. 971.76 s [vector] zipWith3: OK
  15060. 971.76 s [vector] +++ OK, passed 100 tests.
  15061. 971.76 s [vector] izipWith: OK
  15062. 971.76 s [vector] +++ OK, passed 100 tests.
  15063. 971.77 s [vector] izipWith3: OK
  15064. 971.77 s [vector] +++ OK, passed 100 tests.
  15065. 971.78 s [vector] izipWithM: OK
  15066. 971.78 s [vector] +++ OK, passed 100 tests.
  15067. 971.81 s [vector] izipWithM_: OK (0.03s)
  15068. 971.81 s [vector] +++ OK, passed 100 tests.
  15069. 971.81 s [vector] zipWithM: OK
  15070. 971.81 s [vector] +++ OK, passed 100 tests.
  15071. 971.84 s [vector] zipWithM_: OK (0.03s)
  15072. 971.85 s [vector] +++ OK, passed 100 tests.
  15073. 971.86 s [vector] filter: OK
  15074. 971.86 s [vector] +++ OK, passed 100 tests.
  15075. 971.86 s [vector] ifilter: OK
  15076. 971.86 s [vector] +++ OK, passed 100 tests.
  15077. 971.89 s [vector] filterM: OK (0.05s)
  15078. 971.89 s [vector] +++ OK, passed 100 tests.
  15079. 971.90 s [vector] uniq: OK
  15080. 971.90 s [vector] +++ OK, passed 100 tests.
  15081. 971.90 s [vector] mapMaybe: OK
  15082. 971.90 s [vector] +++ OK, passed 100 tests.
  15083. 971.91 s [vector] imapMaybe: OK
  15084. 971.91 s [vector] +++ OK, passed 100 tests.
  15085. 971.91 s [vector] takeWhile: OK
  15086. 971.92 s [vector] +++ OK, passed 100 tests.
  15087. 971.92 s [vector] dropWhile: OK
  15088. 971.92 s [vector] +++ OK, passed 100 tests.
  15089. 971.92 s [vector] partition: OK
  15090. 971.93 s [vector] +++ OK, passed 100 tests.
  15091. 971.93 s [vector] partitionWith: OK
  15092. 971.93 s [vector] +++ OK, passed 100 tests.
  15093. 971.93 s [vector] span: OK
  15094. 971.93 s [vector] +++ OK, passed 100 tests.
  15095. 971.93 s [vector] break: OK
  15096. 971.94 s [vector] +++ OK, passed 100 tests.
  15097. 971.94 s [vector] spanR: OK
  15098. 971.94 s [vector] +++ OK, passed 100 tests.
  15099. 971.94 s [vector] breakR: OK
  15100. 971.94 s [vector] +++ OK, passed 100 tests.
  15101. 971.94 s [vector] groupBy: OK
  15102. 971.94 s [vector] +++ OK, passed 100 tests.
  15103. 971.94 s [vector] elem: OK
  15104. 971.94 s [vector] +++ OK, passed 100 tests.
  15105. 971.94 s [vector] notElem: OK
  15106. 971.94 s [vector] +++ OK, passed 100 tests.
  15107. 971.94 s [vector] find: OK
  15108. 971.94 s [vector] +++ OK, passed 100 tests.
  15109. 971.94 s [vector] findIndex: OK
  15110. 971.94 s [vector] +++ OK, passed 100 tests.
  15111. 971.94 s [vector] findIndexR: OK
  15112. 971.94 s [vector] +++ OK, passed 100 tests.
  15113. 971.94 s [vector] findIndices: OK
  15114. 971.94 s [vector] +++ OK, passed 100 tests.
  15115. 971.94 s [vector] elemIndex: OK
  15116. 971.95 s [vector] +++ OK, passed 100 tests.
  15117. 971.96 s [vector] elemIndices: OK
  15118. 971.96 s [vector] +++ OK, passed 100 tests.
  15119. 971.97 s [vector] foldl: OK
  15120. 971.97 s [vector] +++ OK, passed 100 tests.
  15121. 971.97 s [vector] foldl1: OK
  15122. 971.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15123. 971.98 s [vector] foldl': OK
  15124. 971.98 s [vector] +++ OK, passed 100 tests.
  15125. 971.98 s [vector] foldl1': OK
  15126. 971.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15127. 971.98 s [vector] foldr: OK
  15128. 971.98 s [vector] +++ OK, passed 100 tests.
  15129. 971.98 s [vector] foldr1: OK
  15130. 971.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15131. 971.98 s [vector] foldr': OK
  15132. 971.98 s [vector] +++ OK, passed 100 tests.
  15133. 971.99 s [vector] foldr1': OK
  15134. 971.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15135. 971.99 s [vector] ifoldl: OK
  15136. 971.99 s [vector] +++ OK, passed 100 tests.
  15137. 972.00 s [vector] ifoldl': OK
  15138. 972.00 s [vector] +++ OK, passed 100 tests.
  15139. 972.00 s [vector] ifoldr: OK
  15140. 972.00 s [vector] +++ OK, passed 100 tests.
  15141. 972.01 s [vector] ifoldr': OK
  15142. 972.01 s [vector] +++ OK, passed 100 tests.
  15143. 972.02 s [vector] ifoldM: OK
  15144. 972.03 s [vector] +++ OK, passed 100 tests.
  15145. 972.03 s [vector] ifoldM': OK
  15146. 972.03 s [vector] +++ OK, passed 100 tests.
  15147. 972.05 s [vector] ifoldM_: OK (0.03s)
  15148. 972.06 s [vector] +++ OK, passed 100 tests.
  15149. 972.09 s [vector] ifoldM'_: OK (0.04s)
  15150. 972.09 s [vector] +++ OK, passed 100 tests.
  15151. 972.09 s [vector] all: OK
  15152. 972.09 s [vector] +++ OK, passed 100 tests.
  15153. 972.10 s [pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
  15154. 972.10 s [pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
  15155. 972.10 s [pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
  15156. 972.10 s [vector] any: OK
  15157. 972.10 s [vector] +++ OK, passed 100 tests.
  15158. 972.10 s [vector] prescanl: OK
  15159. 972.10 s [vector] +++ OK, passed 100 tests.
  15160. 972.11 s [vector] prescanl': OK
  15161. 972.11 s [vector] +++ OK, passed 100 tests.
  15162. 972.11 s [vector] postscanl: OK
  15163. 972.12 s [vector] +++ OK, passed 100 tests.
  15164. 972.12 s [vector] postscanl': OK
  15165. 972.12 s [vector] +++ OK, passed 100 tests.
  15166. 972.13 s [vector] scanl: OK
  15167. 972.13 s [vector] +++ OK, passed 100 tests.
  15168. 972.14 s [vector] scanl': OK
  15169. 972.14 s [vector] +++ OK, passed 100 tests.
  15170. 972.14 s [vector] scanl1: OK
  15171. 972.14 s [vector] +++ OK, passed 100 tests.
  15172. 972.15 s [vector] scanl1': OK
  15173. 972.15 s [vector] +++ OK, passed 100 tests.
  15174. 972.16 s [vector] iscanl: OK
  15175. 972.16 s [vector] +++ OK, passed 100 tests.
  15176. 972.16 s [vector] iscanl': OK
  15177. 972.16 s [vector] +++ OK, passed 100 tests.
  15178. 972.17 s [vector] prescanr: OK
  15179. 972.17 s [vector] +++ OK, passed 100 tests.
  15180. 972.17 s [vector] prescanr': OK
  15181. 972.17 s [vector] +++ OK, passed 100 tests.
  15182. 972.18 s [vector] postscanr: OK
  15183. 972.18 s [vector] +++ OK, passed 100 tests.
  15184. 972.19 s [vector] postscanr': OK
  15185. 972.19 s [vector] +++ OK, passed 100 tests.
  15186. 972.19 s [vector] scanr: OK
  15187. 972.19 s [vector] +++ OK, passed 100 tests.
  15188. 972.20 s [vector] scanr': OK
  15189. 972.20 s [vector] +++ OK, passed 100 tests.
  15190. 972.21 s [vector] scanr1: OK
  15191. 972.22 s [vector] +++ OK, passed 100 tests.
  15192. 972.22 s [vector] scanr1': OK
  15193. 972.22 s [vector] +++ OK, passed 100 tests.
  15194. 972.22 s [vector] iscanr: OK
  15195. 972.22 s [vector] +++ OK, passed 100 tests.
  15196. 972.23 s [vector] iscanr': OK
  15197. 972.23 s [vector] +++ OK, passed 100 tests.
  15198. 972.23 s [vector] mut_read: OK
  15199. 972.23 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15200. 972.23 s [vector] mut_write: OK
  15201. 972.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15202. 972.23 s [vector] mut_modify: OK
  15203. 972.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15204. 972.24 s [vector] mut_generate: OK
  15205. 972.25 s [vector] +++ OK, passed 100 tests.
  15206. 972.27 s [vector] mut_generateM: OK (0.03s)
  15207. 972.27 s [vector] +++ OK, passed 100 tests.
  15208. 972.31 s [vector] mut_mapM_: OK (0.05s)
  15209. 972.32 s [vector] +++ OK, passed 100 tests.
  15210. 972.35 s [vector] mut_imapM_: OK (0.03s)
  15211. 972.36 s [vector] +++ OK, passed 100 tests.
  15212. 972.39 s [vector] mut_forM_: OK (0.04s)
  15213. 972.40 s [vector] +++ OK, passed 100 tests.
  15214. 972.41 s [pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
  15215. 972.42 s [vector] mut_iforM_: OK (0.03s)
  15216. 972.42 s [vector] +++ OK, passed 100 tests.
  15217. 972.42 s [vector] mut_foldr: OK
  15218. 972.43 s [vector] +++ OK, passed 100 tests.
  15219. 972.43 s [vector] mut_foldr': OK
  15220. 972.43 s [vector] +++ OK, passed 100 tests.
  15221. 972.43 s [vector] mut_foldl: OK
  15222. 972.43 s [vector] +++ OK, passed 100 tests.
  15223. 972.44 s [vector] mut_foldl': OK
  15224. 972.44 s [vector] +++ OK, passed 100 tests.
  15225. 972.44 s [vector] mut_ifoldr: OK
  15226. 972.45 s [vector] +++ OK, passed 100 tests.
  15227. 972.45 s [vector] mut_ifoldr': OK
  15228. 972.45 s [vector] +++ OK, passed 100 tests.
  15229. 972.45 s [vector] mut_ifoldl: OK
  15230. 972.45 s [vector] +++ OK, passed 100 tests.
  15231. 972.47 s [vector] mut_ifoldl': OK
  15232. 972.47 s [vector] +++ OK, passed 100 tests.
  15233. 972.47 s [vector] mut_foldM: OK
  15234. 972.47 s [vector] +++ OK, passed 100 tests.
  15235. 972.48 s [vector] mut_foldM': OK
  15236. 972.48 s [vector] +++ OK, passed 100 tests.
  15237. 972.48 s [vector] mut_foldrM: OK
  15238. 972.48 s [vector] +++ OK, passed 100 tests.
  15239. 972.49 s [vector] mut_foldrM': OK
  15240. 972.50 s [vector] +++ OK, passed 100 tests.
  15241. 972.51 s [vector] mut_ifoldM: OK
  15242. 972.51 s [vector] +++ OK, passed 100 tests.
  15243. 972.51 s [vector] mut_ifoldM': OK
  15244. 972.51 s [vector] +++ OK, passed 100 tests.
  15245. 972.51 s [vector] mut_ifoldrM: OK
  15246. 972.51 s [vector] +++ OK, passed 100 tests.
  15247. 972.52 s [vector] mut_ifoldrM': OK
  15248. 972.52 s [vector] +++ OK, passed 100 tests.
  15249. 972.52 s [vector] compare: OK
  15250. 972.52 s [vector] +++ OK, passed 100 tests.
  15251. 972.52 s [vector] maximum: OK
  15252. 972.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15253. 972.53 s [vector] minimum: OK
  15254. 972.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15255. 972.53 s [vector] minIndex: OK
  15256. 972.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15257. 972.53 s [vector] maxIndex: OK
  15258. 972.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15259. 972.53 s [vector] maximumBy: OK
  15260. 972.53 s [vector] +++ OK, passed 100 tests; 10 discarded.
  15261. 972.53 s [vector] minimumBy: OK
  15262. 972.53 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15263. 972.53 s [vector] maximumOn: OK
  15264. 972.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15265. 972.53 s [vector] minimumOn: OK
  15266. 972.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15267. 972.53 s [vector] maxIndexBy: OK
  15268. 972.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15269. 972.53 s [vector] minIndexBy: OK
  15270. 972.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15271. 972.53 s [vector] ListFirstMaxIndexWins: OK
  15272. 972.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15273. 972.54 s [vector] FalseListFirstMaxIndexWins: OK
  15274. 972.54 s [vector] +++ OK, failed as expected. (after 1 test):
  15275. 972.54 s [vector] Exception:
  15276. 972.54 s [vector] Prelude.foldr1: empty list
  15277. 972.55 s [vector] CallStack (from HasCallStack):
  15278. 972.55 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  15279. 972.55 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  15280. 972.55 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  15281. 972.55 s [vector] []
  15282. 972.55 s [vector] zip: OK
  15283. 972.55 s [vector] +++ OK, passed 100 tests.
  15284. 972.55 s [vector] zip3: OK
  15285. 972.55 s [vector] +++ OK, passed 100 tests.
  15286. 972.56 s [vector] unzip: OK
  15287. 972.56 s [vector] +++ OK, passed 100 tests.
  15288. 972.56 s [vector] unzip3: OK
  15289. 972.56 s [vector] +++ OK, passed 100 tests.
  15290. 972.56 s [vector] indexed: OK
  15291. 972.56 s [vector] +++ OK, passed 100 tests.
  15292. 972.56 s [vector] update: OK
  15293. 972.56 s [vector] +++ OK, passed 100 tests.
  15294. 972.56 s [vector] mempty: OK
  15295. 972.56 s [vector] +++ OK, passed 100 tests.
  15296. 972.58 s [vector] mappend: OK
  15297. 972.58 s [vector] +++ OK, passed 100 tests.
  15298. 972.61 s [vector] mconcat: OK (0.05s)
  15299. 972.61 s [vector] +++ OK, passed 100 tests.
  15300. 972.61 s [vector] glength: OK
  15301. 972.61 s [vector] +++ OK, passed 100 tests.
  15302. 972.61 s [vector] unstream
  15303. 972.62 s [vector] unstream == vunstream (exact): OK
  15304. 972.62 s [vector] +++ OK, passed 100 tests.
  15305. 972.62 s [vector] unstream == vunstream (unknown): OK
  15306. 972.62 s [vector] +++ OK, passed 100 tests.
  15307. 972.62 s [vector] unstreamR ~= vunstream (exact): OK
  15308. 972.62 s [vector] +++ OK, passed 100 tests.
  15309. 972.62 s [vector] unstreamR ~= vunstream (unknown): OK
  15310. 972.62 s [vector] +++ OK, passed 100 tests.
  15311. 972.62 s [vector] Data.Vector.Storable.Vector Alignment
  15312. 972.62 s [vector] Aligned Double: OK
  15313. 972.62 s [vector] Aligned Int: OK
  15314. 972.62 s [vector] Regression tests
  15315. 972.62 s [vector] enumFromTo crash #188
  15316. 972.62 s [vector] Word8: OK
  15317. 972.62 s [vector] Word16: OK
  15318. 972.62 s [vector] Word32: OK
  15319. 972.62 s [vector] Word64: OK
  15320. 972.62 s [vector] Word: OK
  15321. 972.62 s [vector] Int8: OK
  15322. 972.62 s [vector] Int16: OK
  15323. 972.62 s [vector] Int32: OK
  15324. 972.62 s [vector] Int64: OK
  15325. 972.62 s [vector] Int: OK
  15326. 972.62 s [vector] Char: OK
  15327. 972.62 s [vector] Negative tests
  15328. 972.62 s [vector] slice out of bounds #257
  15329. 972.62 s [vector] Boxed
  15330. 972.62 s [vector] Negative ix: OK
  15331. 972.62 s [vector] Negative size: OK
  15332. 972.63 s [vector] Negative ix and size: OK
  15333. 972.63 s [vector] Too large ix: OK
  15334. 972.63 s [vector] Too large size: OK
  15335. 972.63 s [vector] Too large ix and size: OK
  15336. 972.63 s [vector] Overflow: OK
  15337. 972.63 s [vector] OutOfMemory: OK
  15338. 972.63 s [vector] Primitive
  15339. 972.63 s [vector] Negative ix: OK
  15340. 972.63 s [vector] Negative size: OK
  15341. 972.63 s [vector] Negative ix and size: OK
  15342. 972.63 s [vector] Too large ix: OK
  15343. 972.63 s [vector] Too large size: OK
  15344. 972.63 s [vector] Too large ix and size: OK
  15345. 972.63 s [vector] Overflow: OK
  15346. 972.63 s [vector] OutOfMemory: OK
  15347. 972.63 s [vector] Storable
  15348. 972.63 s [vector] Negative ix: OK
  15349. 972.63 s [vector] Negative size: OK
  15350. 972.63 s [vector] Negative ix and size: OK
  15351. 972.63 s [vector] Too large ix: OK
  15352. 972.63 s [vector] Too large size: OK
  15353. 972.63 s [vector] Too large ix and size: OK
  15354. 972.63 s [vector] Overflow: OK
  15355. 972.63 s [vector] OutOfMemory: OK
  15356. 972.63 s [vector] Unboxed
  15357. 972.63 s [vector] Negative ix: OK
  15358. 972.63 s [vector] Negative size: OK
  15359. 972.63 s [vector] Negative ix and size: OK
  15360. 972.63 s [vector] Too large ix: OK
  15361. 972.63 s [vector] Too large size: OK
  15362. 972.63 s [vector] Too large ix and size: OK
  15363. 972.63 s [vector] Overflow: OK
  15364. 972.63 s [vector] OutOfMemory: OK
  15365. 972.63 s [vector] take #282
  15366. 972.63 s [vector] Boxed: OK
  15367. 972.63 s [vector] Primitive: OK
  15368. 972.63 s [vector] Storable: OK
  15369. 972.64 s [vector] Unboxed: OK
  15370. 972.64 s [vector] Data.Vector
  15371. 972.64 s [vector] MonadFix: OK
  15372. 972.64 s [vector] toFromArray: OK
  15373. 972.64 s [vector] toFromArraySlice: OK
  15374. 972.64 s [vector] toFromArraySliceUnsafe: OK
  15375. 972.64 s [vector] toFromMutableArray: OK
  15376. 972.64 s [vector] Data.Vector.Mutable (Move): OK
  15377. 972.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15378. 972.64 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  15379. 972.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15380. 972.64 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  15381. 972.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15382. 972.64 s [vector] Data.Vector.Storable.Mutable (Move): OK
  15383. 972.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15384. 972.68 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.02s)
  15385. 972.68 s [vector] +++ OK, passed 100 tests.
  15386. 972.68 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.02s)
  15387. 972.68 s [vector] +++ OK, passed 100 tests.
  15388. 972.69 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  15389. 972.69 s [vector] +++ OK, passed 100 tests.
  15390. 972.69 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  15391. 972.69 s [vector] +++ OK, passed 100 tests.
  15392. 972.69 s [vector]
  15393. 972.69 s [vector] All 2808 tests passed (12.19s)
  15394. 972.70 s [vector] Test suite vector-tests-O2: PASS
  15395. 972.70 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  15396. 972.70 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  15397. 972.71 s [vector] checkPhase completed in 2 minutes 25 seconds
  15398. 972.71 s [vector] Phase: haddockPhase
  15399. 972.72 s [vector] Phase: installPhase
  15400. 973.31 s [vector] Installing library in /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/vector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8
  15401. 973.61 s [pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
  15402. 973.61 s [pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
  15403. 973.61 s [pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
  15404. 973.61 s [pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
  15405. 973.61 s [pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
  15406. 973.61 s [pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
  15407. 973.61 s [pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
  15408. 973.70 s [pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
  15409. 973.70 s [pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
  15410. 973.70 s [pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
  15411. 973.70 s [pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
  15412. 973.94 s [vector] Installing internal library benchmarks-O2 in /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/vector-0.13.2.0-41h99UXZFM4nORRO6PKyq-benchmarks-O2
  15413. 974.22 s [vector] Phase: fixupPhase
  15414. 974.24 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0
  15415. 974.24 s [vector] shrinking /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHSvector-0.13.2.0-41h99UXZFM4nORRO6PKyq-benchmarks-O2-ghc9.10.2.so
  15416. 974.25 s [vector] shrinking /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHSvector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8-ghc9.10.2.so
  15417. 974.28 s [vector] checking for references to /build/ in /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0...
  15418. 974.33 s [vector] patching script interpreter paths in /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0
  15419. 974.33 s [vector] stripping (with command strip and flags -S -p) in /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0/lib
  15420. 975.39 s [haskell-language-server] Preprocessing library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0...
  15421. 975.62 s [haskell-language-server] Building library 'hls-stylish-haskell-plugin' for haskell-language-server-2.12.0.0...
  15422. 975.62 s [pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
  15423. 975.62 s [pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
  15424. 975.62 s [pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
  15425. 975.62 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 )
  15426. 975.80 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0
  15427. 976.37 s [vector:post-build] Pushing 1 paths (97 are already present) using zstd to cache sellout ⏳
  15428. 976.37 s [vector:post-build]
  15429. 976.76 s [vector:post-build] Pushing /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0 (58.31 MiB)
  15430. 979.15 s [vector:post-build]
  15431. 979.15 s [vector:post-build] All done.
  15432. 979.18 s [vector:post-build] Uploading to the NixCI cache: /nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0
  15433. 979.23 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15434. 979.25 s [vector:post-build] copying 1 paths...
  15435. 979.25 s [vector:post-build] copying path '/nix/store/y496s7a1kjrzzl7fxqz6r40gv62jm9c4-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  15436. 992.96 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15437. 993.19 s [vector:post-build] copying 1 paths...
  15438. 993.20 s [vector:post-build] copying path '/nix/store/3vrrf9np82w9g2j997xy3mkpdf8wf8m0-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  15439. 993.43 s Progress: 24 of 40 built (3 building), 760 of 760 downloaded from cache
  15440. 993.49 s Building /nix/store/j08va1x64hkc3nf9wr1ahbd24avihysk-nothunks-0.3.1.drv
  15441. 993.49 s [haskell-language-server] plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
  15442. 993.49 s [haskell-language-server] The import of ‘System.Directory’ is redundant
  15443. 993.49 s [haskell-language-server] except perhaps to import instances from ‘System.Directory’
  15444. 993.49 s [haskell-language-server] To import instances alone, use: import System.Directory()
  15445. 993.49 s [haskell-language-server] |
  15446. 993.49 s [haskell-language-server] 28 | import System.Directory
  15447. 993.49 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15448. 993.49 s [haskell-language-server]
  15449. 993.49 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 )
  15450. 993.49 s [haskell-language-server] plugins/hls-stylish-haskell-plugin/src/Ide/Plugin/StylishHaskell.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
  15451. 993.49 s [haskell-language-server] The import of ‘System.Directory’ is redundant
  15452. 993.49 s [haskell-language-server] except perhaps to import instances from ‘System.Directory’
  15453. 993.49 s [haskell-language-server] To import instances alone, use: import System.Directory()
  15454. 993.49 s [haskell-language-server] |
  15455. 993.49 s [haskell-language-server] 28 | import System.Directory
  15456. 993.49 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  15457. 993.49 s [haskell-language-server]
  15458. 993.49 s [haskell-language-server] Preprocessing library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0...
  15459. 993.49 s [haskell-language-server] Building library 'hls-module-name-plugin' for haskell-language-server-2.12.0.0...
  15460. 993.49 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 )
  15461. 993.49 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 )
  15462. 993.49 s [pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
  15463. 993.49 s [pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
  15464. 993.49 s [pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
  15465. 993.49 s [pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
  15466. 993.49 s [pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
  15467. 993.49 s [pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
  15468. 993.49 s [pandoc-lua-engine] Building test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
  15469. 993.49 s [pandoc-lua-engine] [1 of 5] Compiling Tests.Lua
  15470. 993.49 s [pandoc-lua-engine] [2 of 5] Compiling Tests.Lua.Module
  15471. 993.49 s [pandoc-lua-engine] [3 of 5] Compiling Tests.Lua.Reader
  15472. 993.49 s [pandoc-lua-engine] [4 of 5] Compiling Tests.Lua.Writer
  15473. 993.49 s [pandoc-lua-engine] [5 of 5] Compiling Main
  15474. 993.49 s [pandoc-lua-engine] [6 of 6] Linking dist/build/test-pandoc-lua-engine/test-pandoc-lua-engine
  15475. 993.49 s [pandoc-lua-engine] Phase: checkPhase
  15476. 993.49 s [pandoc-server] Phase: checkPhase
  15477. 993.49 s [pandoc-server] Package has no test suites.
  15478. 993.49 s [pandoc-server] Phase: haddockPhase
  15479. 993.49 s [pandoc-server] Preprocessing library for pandoc-server-0.1.0.11...
  15480. 993.49 s [pandoc-server] Running Haddock on library for pandoc-server-0.1.0.11...
  15481. 993.49 s [pandoc-server] Warning: The documentation for the following packages are not installed. No
  15482. 993.49 s [pandoc-server] links will be generated to these packages: attoparsec-0.14.4,
  15483. 993.49 s [pandoc-server] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
  15484. 993.49 s [pandoc-server] vector-0.13.2.0
  15485. 993.49 s [pandoc-server] [1 of 1] Compiling Text.Pandoc.Server
  15486. 993.49 s [pandoc-server] Haddock coverage:
  15487. 993.49 s [pandoc-server] 0% ( 0 / 7) in 'Text.Pandoc.Server'
  15488. 993.49 s [pandoc-server] Missing documentation for:
  15489. 993.49 s [pandoc-server] Module header
  15490. 993.49 s [pandoc-server] app (src/Text/Pandoc/Server.hs:200)
  15491. 993.49 s [pandoc-server] API (src/Text/Pandoc/Server.hs:186)
  15492. 993.49 s [pandoc-server] ServerOpts (src/Text/Pandoc/Server.hs:55)
  15493. 993.49 s [pandoc-server] Params (src/Text/Pandoc/Server.hs:125)
  15494. 993.49 s [pandoc-server] Blob (src/Text/Pandoc/Server.hs:112)
  15495. 993.49 s [pandoc-server] parseServerOptsFromArgs (src/Text/Pandoc/Server.hs:99)
  15496. 993.49 s [pandoc-server] Warning: Text.Pandoc.Server: could not find link destinations for:
  15497. 993.49 s [pandoc-server] - Text.Pandoc.App.Opt.Opt
  15498. 993.49 s [pandoc-server] - Text.Pandoc.Server.Output
  15499. 993.49 s [pandoc-server] Documentation created: dist/doc/html/pandoc-server/,
  15500. 993.49 s [pandoc-server] dist/doc/html/pandoc-server/pandoc-server.txt
  15501. 993.49 s [pandoc-server] Phase: installPhase
  15502. 993.49 s [pandoc-server] Installing library in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  15503. 993.49 s [pandoc-server] Phase: fixupPhase
  15504. 993.49 s [pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  15505. 993.49 s [pandoc-server] shrinking /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM-ghc9.10.3.so
  15506. 993.49 s [pandoc-server] checking for references to /build/ in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11...
  15507. 993.49 s [pandoc-server] patching script interpreter paths in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  15508. 993.49 s [pandoc-server] stripping (with command strip and flags -S -p) in /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11/lib
  15509. 993.49 s [pandoc-server] shrinking RPATHs of ELF executables and libraries in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
  15510. 993.49 s [pandoc-server] checking for references to /build/ in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc...
  15511. 993.49 s [pandoc-server] patching script interpreter paths in /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc
  15512. 993.63 s [pandoc-server:post-build] Uploading to cachix cache "sellout": /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  15513. 994.27 s [pandoc-server:post-build] Pushing 2 paths (469 are already present) using zstd to cache sellout ⏳
  15514. 994.27 s [pandoc-server:post-build]
  15515. 994.71 s [pandoc-server:post-build] Pushing /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc (444.75 KiB)
  15516. 994.80 s [pandoc-server:post-build] Pushing /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11 (2.86 MiB)
  15517. 995.98 s [pandoc-server:post-build]
  15518. 995.98 s [pandoc-server:post-build] All done.
  15519. 996.00 s [pandoc-server:post-build] Uploading to the NixCI cache: /nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc /nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11
  15520. 996.05 s [pandoc-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15521. 996.29 s [pandoc-server:post-build] copying 2 paths...
  15522. 996.29 s [pandoc-server:post-build] copying path '/nix/store/dqmvprrkmaw8zdxb1c9y2dr9rl9kzvvf-pandoc-server-0.1.0.11-doc' to 'https://cache.nix-ci.com'...
  15523. 996.63 s [pandoc-server:post-build] copying path '/nix/store/hnig4hrbwya67j05nggpdvixalk9i2ny-pandoc-server-0.1.0.11' to 'https://cache.nix-ci.com'...
  15524. 997.60 s [pandoc-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15525. 997.89 s [pandoc-server:post-build] copying 1 paths...
  15526. 997.89 s [pandoc-server:post-build] copying path '/nix/store/s3jg3bgm7jkn4xv5miw4v3w05qrkza0r-pandoc-server-0.1.0.11.drv' to 'https://cache.nix-ci.com'...
  15527. 998.13 s Progress: 25 of 40 built (3 building), 760 of 760 downloaded from cache
  15528. 998.13 s [haskell-language-server] Preprocessing library 'hls-rename-plugin' for haskell-language-server-2.12.0.0...
  15529. 998.18 s [haskell-language-server] Building library 'hls-rename-plugin' for haskell-language-server-2.12.0.0...
  15530. 998.18 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 )
  15531. 998.18 s [nothunks] Phase: setupCompilerEnvironmentPhase
  15532. 998.18 s [nothunks] Build with /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2.
  15533. 998.18 s [nothunks] Phase: unpackPhase
  15534. 998.18 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  15535. 998.18 s [nothunks] source root is nothunks-0.3.1
  15536. 998.18 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  15537. 998.18 s [nothunks] Phase: patchPhase
  15538. 998.18 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  15539. 998.18 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  15540. 998.18 s [nothunks] Phase: compileBuildDriverPhase
  15541. 998.18 s [nothunks] setupCompileFlags: -package-db=/build/tmp.CLWZP0167Q/setup-package.conf.d -threaded
  15542. 998.18 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.CLWZP0167Q/Main.o )
  15543. 998.18 s [nothunks] [2 of 2] Linking Setup
  15544. 998.18 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  15545. 998.18 s [nothunks] Phase: configurePhase
  15546. 998.18 s [nothunks] configureFlags: --verbose --prefix=/nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.CLWZP0167Q/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
  15547. 998.18 s [nothunks] Using Parsec parser
  15548. 998.18 s [nothunks] Configuring nothunks-0.3.1...
  15549. 998.18 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  15550. 998.18 s [nothunks] Dependency base: using base-4.20.1.0
  15551. 998.18 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  15552. 998.18 s [nothunks] Dependency containers: using containers-0.7
  15553. 998.18 s [nothunks] Dependency ghc-heap: using ghc-heap-9.10.2
  15554. 998.18 s [nothunks] Dependency stm: using stm-2.5.3.1
  15555. 998.18 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.2
  15556. 998.18 s [nothunks] Dependency time: using time-1.12.2
  15557. 998.18 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  15558. 998.18 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  15559. 998.18 s [nothunks] Dependency base: using base-4.20.1.0
  15560. 998.18 s [nothunks] Dependency containers: using containers-0.7
  15561. 998.18 s [nothunks] Dependency ghc-prim: using ghc-prim-0.12.0
  15562. 998.18 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  15563. 998.18 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  15564. 998.18 s [nothunks] Dependency random: using random-1.2.1.3
  15565. 998.18 s [nothunks] Dependency stm: using stm-2.5.3.1
  15566. 998.18 s [nothunks] Dependency tasty: using tasty-1.5.3
  15567. 998.18 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  15568. 998.18 s [nothunks] Source component graph:
  15569. 998.18 s [nothunks] component lib
  15570. 998.18 s [nothunks] component test:nothunks-test dependency lib
  15571. 998.18 s [nothunks] Configured component graph:
  15572. 998.18 s [nothunks] component nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  15573. 998.18 s [nothunks] include base-4.20.1.0-f445
  15574. 998.18 s [nothunks] include bytestring-0.12.2.0-214a
  15575. 998.18 s [nothunks] include containers-0.7-6571
  15576. 998.18 s [nothunks] include ghc-heap-9.10.2-81bc
  15577. 998.18 s [nothunks] include stm-2.5.3.1-662c
  15578. 998.18 s [nothunks] include text-2.1.2-7514
  15579. 998.18 s [nothunks] include time-1.12.2-9680
  15580. 998.18 s [nothunks] include vector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8
  15581. 998.18 s [nothunks] include wherefrom-compat-0.1.1.1-A5hZoS2B8dh8BdVuPNhecr
  15582. 998.18 s [nothunks] component nothunks-0.3.1-IRQn6pfkAzM5jiSuRrngOS-nothunks-test
  15583. 998.18 s [nothunks] include base-4.20.1.0-f445
  15584. 998.18 s [nothunks] include containers-0.7-6571
  15585. 998.18 s [nothunks] include ghc-prim-0.12.0-5d80
  15586. 998.18 s [pandoc-lua-engine] Running 1 test suites...
  15587. 998.18 s [pandoc-lua-engine] Test suite test-pandoc-lua-engine: RUNNING...
  15588. 998.18 s [pandoc-lua-engine] pandoc Lua engine
  15589. 998.18 s [pandoc-lua-engine] Lua filters
  15590. 998.18 s [pandoc-lua-engine] macro expansion via filter: OK
  15591. 998.18 s [pandoc-lua-engine] convert all plains to paras: OK
  15592. 998.18 s [pandoc-lua-engine] convert display math to inline math: OK (0.02s)
  15593. 998.18 s [pandoc-lua-engine] make hello world document: OK
  15594. 998.18 s [pandoc-lua-engine] implicit doc filter: OK
  15595. 998.18 s [pandoc-lua-engine] parse raw markdown blocks: OK
  15596. 998.18 s [pandoc-lua-engine] allow shorthand functions for quote types: OK
  15597. 998.18 s [pandoc-lua-engine] Count inlines via metatable catch-all: OK
  15598. 998.18 s [pandoc-lua-engine] Count blocks via Block-specific catch-all: OK
  15599. 998.18 s [pandoc-lua-engine] Smart constructors: OK
  15600. 998.18 s [pandoc-lua-engine] Convert header upper case: OK
  15601. 998.18 s [pandoc-lua-engine] Attribute lists are convenient to use: OK
  15602. 998.18 s [pandoc-lua-engine] Filter list of inlines: OK
  15603. 998.18 s [pandoc-lua-engine] Filter list of blocks: OK
  15604. 998.18 s [pandoc-lua-engine] Filter Meta: OK
  15605. 998.18 s [pandoc-lua-engine] Script filename is set: OK
  15606. 998.18 s [pandoc-lua-engine] Pandoc version is set: OK
  15607. 998.18 s [pandoc-lua-engine] Pandoc types version is set: OK
  15608. 998.18 s [pandoc-lua-engine] require file: OK
  15609. 998.18 s [pandoc-lua-engine] Allow singleton inline in constructors: OK
  15610. 998.18 s [pandoc-lua-engine] Elements with Attr have `attr` accessor: OK
  15611. 998.18 s [pandoc-lua-engine] module `pandoc.system` is present: OK
  15612. 998.18 s [pandoc-lua-engine] global modules
  15613. 998.18 s [pandoc-lua-engine] module 'lpeg' is loaded into a global: OK
  15614. 998.18 s [pandoc-lua-engine] module 're' is loaded into a global: OK
  15615. 998.18 s [pandoc-lua-engine] module 'lpeg' is available via `require`: OK
  15616. 998.18 s [pandoc-lua-engine] module 're' is available via `require`: OK
  15617. 998.18 s [pandoc-lua-engine] informative error messages: OK
  15618. 998.18 s [pandoc-lua-engine] Lua modules
  15619. 998.18 s [pandoc-lua-engine] pandoc: OK (0.01s)
  15620. 998.18 s [pandoc-lua-engine] +++ Success: 79 Lua tests passed
  15621. 998.18 s [pandoc-lua-engine] pandoc.List: OK
  15622. 998.18 s [pandoc-lua-engine] +++ Success: 22 Lua tests passed
  15623. 998.18 s [pandoc-lua-engine] pandoc.format: OK
  15624. 998.18 s [pandoc-lua-engine] +++ Success: 3 Lua tests passed
  15625. 998.18 s [pandoc-lua-engine] pandoc.image: OK
  15626. 998.18 s [pandoc-lua-engine] +++ Success: 6 Lua tests passed
  15627. 998.18 s [pandoc-lua-engine] pandoc.json: OK
  15628. 998.18 s [pandoc-lua-engine] +++ Success: 21 Lua tests passed
  15629. 998.18 s [pandoc-lua-engine] pandoc.log: OK
  15630. 998.18 s [pandoc-lua-engine] +++ Success: 8 Lua tests passed
  15631. 998.18 s [pandoc-lua-engine] pandoc.mediabag: OK
  15632. 998.18 s [pandoc-lua-engine] +++ Success: 9 Lua tests passed
  15633. 998.18 s [pandoc-lua-engine] pandoc.path: OK
  15634. 998.18 s [pandoc-lua-engine] +++ Success: 5 Lua tests passed
  15635. 998.18 s [pandoc-lua-engine] pandoc.structure: OK
  15636. 998.18 s [pandoc-lua-engine] +++ Success: 11 Lua tests passed
  15637. 998.18 s [pandoc-lua-engine] pandoc.template: OK (0.02s)
  15638. 998.18 s [pandoc-lua-engine] +++ Success: 16 Lua tests passed
  15639. 998.18 s [pandoc-lua-engine] pandoc.text: OK
  15640. 998.18 s [pandoc-lua-engine] +++ Success: 9 Lua tests passed
  15641. 998.18 s [pandoc-lua-engine] pandoc.types: OK
  15642. 998.18 s [pandoc-lua-engine] +++ Success: 13 Lua tests passed
  15643. 998.18 s [pandoc-lua-engine] pandoc.utils: OK
  15644. 998.18 s [pandoc-lua-engine] +++ Success: 45 Lua tests passed
  15645. 998.18 s [pandoc-lua-engine] globals: OK (0.02s)
  15646. 998.18 s [pandoc-lua-engine] +++ Success: 42 Lua tests passed
  15647. 998.18 s [pandoc-lua-engine] Custom writers
  15648. 998.18 s [pandoc-lua-engine] default testsuite: OK (0.06s)
  15649. 998.18 s [pandoc-lua-engine] tables testsuite: OK (0.03s)
  15650. 998.18 s [pandoc-lua-engine] bytestring writer: OK
  15651. 998.18 s [pandoc-lua-engine] template: OK
  15652. 998.18 s [pandoc-lua-engine] preset extensions: OK
  15653. 998.18 s [pandoc-lua-engine] modified extensions: OK
  15654. 998.18 s [pandoc-lua-engine] Custom readers
  15655. 998.18 s [pandoc-lua-engine] read binary to code block: OK
  15656. 998.18 s [pandoc-lua-engine]
  15657. 998.18 s [pandoc-lua-engine] All 48 tests passed (0.28s)
  15658. 998.18 s [pandoc-lua-engine] Test suite test-pandoc-lua-engine: PASS
  15659. 998.18 s [pandoc-lua-engine] Test suite logged to:
  15660. 998.18 s [pandoc-lua-engine] dist/test/pandoc-lua-engine-0.4.3-test-pandoc-lua-engine.log
  15661. 998.18 s [pandoc-lua-engine] 1 of 1 test suites (1 of 1 test cases) passed.
  15662. 998.18 s [pandoc-lua-engine] Phase: haddockPhase
  15663. 998.18 s [pandoc-lua-engine] Preprocessing library for pandoc-lua-engine-0.4.3...
  15664. 998.18 s [pandoc-lua-engine] Running Haddock on library for pandoc-lua-engine-0.4.3...
  15665. 998.18 s [pandoc-lua-engine] Warning: The documentation for the following packages are not installed. No
  15666. 998.18 s [pandoc-lua-engine] links will be generated to these packages: attoparsec-0.14.4,
  15667. 998.18 s [pandoc-lua-engine] attoparsec-0.14.4, libyaml-clib-0.2.5, pandoc-3.7.0.2, pandoc-3.7.0.2,
  15668. 998.18 s [pandoc-lua-engine] vector-0.13.2.0
  15669. 998.18 s [pandoc-lua-engine] [ 1 of 39] Compiling Text.Pandoc.Lua.Marshal.Chunks
  15670. 998.18 s [pandoc-lua-engine] [ 2 of 39] Compiling Text.Pandoc.Lua.Marshal.Context
  15671. 998.18 s [pandoc-lua-engine] [ 3 of 39] Compiling Text.Pandoc.Lua.Marshal.ImageSize
  15672. 998.18 s [pandoc-lua-engine] [ 4 of 39] Compiling Text.Pandoc.Lua.Marshal.LogMessage
  15673. 998.18 s [nothunks] include hedgehog-1.5-2HXL3TBppMeKyFDNvgDHq6
  15674. 998.18 s [nothunks] include nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  15675. 998.18 s [nothunks] include random-1.2.1.3-AmyB5M6i6upJCxKBwzEGRh
  15676. 998.18 s [nothunks] include stm-2.5.3.1-662c
  15677. 998.18 s [nothunks] include tasty-1.5.3-FnLG3VNSatS37qpBN0fGqj
  15678. 998.18 s [nothunks] include tasty-hedgehog-1.4.0.2-HFjUIjuNhmD6WVk1Ik6cZ
  15679. 998.18 s [nothunks] Linked component graph:
  15680. 998.18 s [nothunks] unit nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  15681. 998.18 s [nothunks] include base-4.20.1.0-f445
  15682. 998.18 s [nothunks] include bytestring-0.12.2.0-214a
  15683. 998.18 s [nothunks] include containers-0.7-6571
  15684. 998.18 s [nothunks] include ghc-heap-9.10.2-81bc
  15685. 998.18 s [nothunks] include stm-2.5.3.1-662c
  15686. 998.18 s [nothunks] include text-2.1.2-7514
  15687. 998.18 s [nothunks] include time-1.12.2-9680
  15688. 998.18 s [nothunks] include vector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8
  15689. 998.18 s [nothunks] include wherefrom-compat-0.1.1.1-A5hZoS2B8dh8BdVuPNhecr
  15690. 998.18 s [nothunks] NoThunks.Class=nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y:NoThunks.Class
  15691. 998.18 s [nothunks] unit nothunks-0.3.1-IRQn6pfkAzM5jiSuRrngOS-nothunks-test
  15692. 998.18 s [nothunks] include base-4.20.1.0-f445
  15693. 998.18 s [nothunks] include containers-0.7-6571
  15694. 998.18 s [nothunks] include ghc-prim-0.12.0-5d80
  15695. 998.18 s [nothunks] include hedgehog-1.5-2HXL3TBppMeKyFDNvgDHq6
  15696. 998.18 s [nothunks] include nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  15697. 998.18 s [nothunks] include random-1.2.1.3-AmyB5M6i6upJCxKBwzEGRh
  15698. 998.18 s [nothunks] include stm-2.5.3.1-662c
  15699. 998.18 s [nothunks] include tasty-1.5.3-FnLG3VNSatS37qpBN0fGqj
  15700. 998.18 s [nothunks] include tasty-hedgehog-1.4.0.2-HFjUIjuNhmD6WVk1Ik6cZ
  15701. 998.18 s [nothunks] Ready component graph:
  15702. 998.18 s [nothunks] definite nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  15703. 998.18 s [nothunks] depends base-4.20.1.0-f445
  15704. 998.18 s [nothunks] depends bytestring-0.12.2.0-214a
  15705. 998.18 s [nothunks] depends containers-0.7-6571
  15706. 998.18 s [nothunks] depends ghc-heap-9.10.2-81bc
  15707. 998.18 s [nothunks] depends stm-2.5.3.1-662c
  15708. 998.18 s [nothunks] depends text-2.1.2-7514
  15709. 998.18 s [nothunks] depends time-1.12.2-9680
  15710. 998.18 s [nothunks] depends vector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8
  15711. 998.18 s [nothunks] depends wherefrom-compat-0.1.1.1-A5hZoS2B8dh8BdVuPNhecr
  15712. 998.18 s [nothunks] definite nothunks-0.3.1-IRQn6pfkAzM5jiSuRrngOS-nothunks-test
  15713. 998.18 s [nothunks] depends base-4.20.1.0-f445
  15714. 998.18 s [nothunks] depends containers-0.7-6571
  15715. 998.18 s [nothunks] depends ghc-prim-0.12.0-5d80
  15716. 998.18 s [nothunks] depends hedgehog-1.5-2HXL3TBppMeKyFDNvgDHq6
  15717. 998.18 s [nothunks] depends nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  15718. 998.18 s [nothunks] depends random-1.2.1.3-AmyB5M6i6upJCxKBwzEGRh
  15719. 998.18 s [nothunks] depends stm-2.5.3.1-662c
  15720. 998.18 s [nothunks] depends tasty-1.5.3-FnLG3VNSatS37qpBN0fGqj
  15721. 998.18 s [nothunks] depends tasty-hedgehog-1.4.0.2-HFjUIjuNhmD6WVk1Ik6cZ
  15722. 998.18 s [nothunks] Using Cabal-3.12.1.0 compiled by ghc-9.10
  15723. 998.18 s [nothunks] Using compiler: ghc-9.10.2
  15724. 998.18 s [nothunks] Using install prefix:
  15725. 998.18 s [nothunks] /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1
  15726. 998.18 s [nothunks] Executables installed in:
  15727. 998.18 s [nothunks] /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/bin
  15728. 998.18 s [nothunks] Libraries installed in:
  15729. 998.18 s [nothunks] /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  15730. 998.18 s [nothunks] Dynamic Libraries installed in:
  15731. 998.18 s [nothunks] /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a
  15732. 998.18 s [nothunks] Private executables installed in:
  15733. 998.18 s [nothunks] /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.10.2-2a2a/nothunks-0.3.1
  15734. 998.18 s [nothunks] Data files installed in:
  15735. 998.18 s [nothunks] /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/share/x86_64-linux-ghc-9.10.2-2a2a/nothunks-0.3.1
  15736. 998.18 s [nothunks] Documentation installed in:
  15737. 998.18 s [nothunks] /nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  15738. 998.18 s [nothunks] Configuration files installed in:
  15739. 998.18 s [nothunks] /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/etc
  15740. 998.18 s [nothunks] No alex found
  15741. 998.18 s [nothunks] Using ar found on system at:
  15742. 998.18 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15743. 998.18 s [nothunks] No c2hs found
  15744. 998.18 s [nothunks] No cpphs found
  15745. 998.18 s [nothunks] No doctest found
  15746. 998.18 s [nothunks] Using gcc version 14.3.0 given by user at:
  15747. 998.18 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15748. 998.18 s [nothunks] Using ghc version 9.10.2 found on system at:
  15749. 998.18 s [nothunks] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc
  15750. 998.18 s [nothunks] Using ghc-pkg version 9.10.2 found on system at:
  15751. 998.18 s [nothunks] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc-pkg-9.10.2
  15752. 998.18 s [nothunks] No ghcjs found
  15753. 998.18 s [nothunks] No ghcjs-pkg found
  15754. 998.18 s [nothunks] No greencard found
  15755. 998.18 s [nothunks] Using haddock version 2.31.0 found on system at:
  15756. 998.18 s [nothunks] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/haddock-ghc-9.10.2
  15757. 998.18 s [nothunks] No happy found
  15758. 998.18 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  15759. 998.18 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15760. 998.18 s [nothunks] No hmake found
  15761. 998.18 s [pandoc-lua-engine] [ 5 of 39] Compiling Text.Pandoc.Lua.Marshal.CommonState
  15762. 998.18 s [pandoc-lua-engine] [ 6 of 39] Compiling Text.Pandoc.Lua.Marshal.PandocError
  15763. 998.18 s [pandoc-lua-engine] [ 7 of 39] Compiling Text.Pandoc.Lua.Marshal.Reference
  15764. 998.18 s [pandoc-lua-engine] [ 8 of 39] Compiling Text.Pandoc.Lua.Marshal.Sources
  15765. 998.18 s [pandoc-lua-engine] [ 9 of 39] Compiling Text.Pandoc.Lua.Module.System
  15766. 998.18 s [pandoc-lua-engine] [10 of 39] Compiling Text.Pandoc.Lua.PandocLua
  15767. 998.18 s [pandoc-lua-engine] [11 of 39] Compiling Text.Pandoc.Lua.Module.Types
  15768. 998.18 s [pandoc-lua-engine] [12 of 39] Compiling Text.Pandoc.Lua.Module.Text
  15769. 998.18 s [pandoc-lua-engine] [13 of 39] Compiling Text.Pandoc.Lua.Module.JSON
  15770. 998.18 s [pandoc-lua-engine] [14 of 39] Compiling Text.Pandoc.Lua.Module.CLI
  15771. 998.18 s [pandoc-lua-engine] [15 of 39] Compiling Text.Pandoc.Lua.Marshal.Template
  15772. 998.18 s [pandoc-lua-engine] [16 of 39] Compiling Text.Pandoc.Lua.Module.Template
  15773. 998.18 s [pandoc-lua-engine] [17 of 39] Compiling Text.Pandoc.Lua.Marshal.Format
  15774. 998.18 s [pandoc-lua-engine] [18 of 39] Compiling Text.Pandoc.Lua.Module.Format
  15775. 998.18 s [pandoc-lua-engine] [19 of 39] Compiling Text.Pandoc.Lua.Marshal.WriterOptions
  15776. 998.18 s [pandoc-lua-engine] [20 of 39] Compiling Text.Pandoc.Lua.Module.Structure
  15777. 998.18 s [pandoc-lua-engine] [21 of 39] Compiling Text.Pandoc.Lua.Module.Image
  15778. 998.18 s [pandoc-lua-engine] [22 of 39] Compiling Text.Pandoc.Lua.Marshal.ReaderOptions
  15779. 998.18 s [pandoc-lua-engine] [23 of 39] Compiling Text.Pandoc.Lua.Orphans
  15780. 998.18 s [pandoc-lua-engine] [24 of 39] Compiling Text.Pandoc.Lua.Module.MediaBag
  15781. 998.18 s [pandoc-lua-engine] [25 of 39] Compiling Text.Pandoc.Lua.Global
  15782. 998.18 s [pandoc-lua-engine] [26 of 39] Compiling Text.Pandoc.Lua.Filter
  15783. 998.18 s [pandoc-lua-engine] [27 of 39] Compiling Text.Pandoc.Lua.Module.Utils
  15784. 998.18 s [pandoc-lua-engine] [28 of 39] Compiling Text.Pandoc.Lua.SourcePos
  15785. 998.18 s [pandoc-lua-engine] [29 of 39] Compiling Text.Pandoc.Lua.Module.Log
  15786. 998.18 s [pandoc-lua-engine] [30 of 39] Compiling Text.Pandoc.Lua.Writer.Classic
  15787. 998.18 s [pandoc-lua-engine] [31 of 39] Compiling Text.Pandoc.Lua.Module.Pandoc
  15788. 998.18 s [pandoc-lua-engine] [32 of 39] Compiling Text.Pandoc.Lua.Writer.Scaffolding
  15789. 998.18 s [pandoc-lua-engine] [33 of 39] Compiling Text.Pandoc.Lua.Module.Scaffolding
  15790. 998.18 s [pandoc-lua-engine] [34 of 39] Compiling Text.Pandoc.Lua.Module
  15791. 998.18 s [pandoc-lua-engine] [35 of 39] Compiling Text.Pandoc.Lua.Init
  15792. 998.18 s [pandoc-lua-engine] [36 of 39] Compiling Text.Pandoc.Lua.Run
  15793. 998.18 s [pandoc-lua-engine] [37 of 39] Compiling Text.Pandoc.Lua.Custom
  15794. 998.18 s [pandoc-lua-engine] [38 of 39] Compiling Text.Pandoc.Lua.Engine
  15795. 998.18 s [pandoc-lua-engine] [39 of 39] Compiling Text.Pandoc.Lua
  15796. 998.18 s [pandoc-lua-engine] Haddock coverage:
  15797. 998.18 s [pandoc-lua-engine] Warning: 'Chunk' is ambiguous. It is defined
  15798. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  15799. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  15800. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15801. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15802. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
  15803. 998.18 s [pandoc-lua-engine] Warning: 'ChunkedDoc' is ambiguous. It is defined
  15804. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  15805. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Chunks’
  15806. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15807. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15808. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Chunks’
  15809. 998.18 s [pandoc-lua-engine] Warning: 'Reference' is ambiguous. It is defined
  15810. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15811. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15812. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15813. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15814. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  15815. 998.18 s [pandoc-lua-engine] Warning: 'ItemId' is ambiguous. It is defined
  15816. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15817. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15818. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15819. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15820. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  15821. 998.18 s [pandoc-lua-engine] Warning: 'Name' is ambiguous. It is defined
  15822. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15823. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15824. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15825. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15826. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  15827. 998.18 s [pandoc-lua-engine] Warning: 'Date' is ambiguous. It is defined
  15828. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15829. 998.18 s [pandoc-lua-engine] * in ‘Citeproc.Types’
  15830. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15831. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15832. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘Citeproc.Types’
  15833. 998.18 s [pandoc-lua-engine] Warning: 'Sources' is ambiguous. It is defined
  15834. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
  15835. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Sources’
  15836. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15837. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15838. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Sources’
  15839. 998.18 s [pandoc-lua-engine] Warning: 'Lua' is ambiguous. It is defined
  15840. 998.18 s [pandoc-lua-engine] * in ‘HsLua.Core.Error’
  15841. 998.18 s [pandoc-lua-engine] * in ‘HsLua.Core.Types’
  15842. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15843. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15844. 998.18 s [pandoc-lua-engine] Defaulting to the one defined in ‘HsLua.Core.Error’
  15845. 998.18 s [nothunks] Using hpc version 0.69 found on system at:
  15846. 998.18 s [nothunks] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hpc-ghc-9.10.2
  15847. 998.18 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  15848. 998.18 s [nothunks] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  15849. 998.18 s [nothunks] Using hscolour version 1.25 found on system at:
  15850. 998.18 s [nothunks] /nix/store/yhwsn20b5l3lksyl2h8a95k62xqmxg1d-hscolour-1.25/bin/HsColour
  15851. 998.18 s [nothunks] No jhc found
  15852. 998.18 s [nothunks] Using ld found on system at:
  15853. 998.18 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  15854. 998.18 s [nothunks] No pkg-config found
  15855. 998.18 s [nothunks] Using runghc version 9.10.2 found on system at:
  15856. 998.18 s [nothunks] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/runghc-9.10.2
  15857. 998.18 s [nothunks] Using strip version 2.44 found on system at:
  15858. 998.18 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15859. 998.18 s [nothunks] Using tar found on system at:
  15860. 998.18 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15861. 998.18 s [nothunks] No uhc found
  15862. 998.18 s [nothunks] Phase: buildPhase
  15863. 998.18 s [nothunks] Preprocessing library for nothunks-0.3.1...
  15864. 998.18 s [nothunks] Building library for nothunks-0.3.1...
  15865. 998.18 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  15866. 998.18 s [pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
  15867. 998.18 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
  15868. 998.18 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  15869. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15870. 998.18 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15871. 998.18 s [pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  15872. 998.18 s [pandoc-lua-engine] Warning: 'ExtensionConfig' is out of scope.
  15873. 998.18 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  15874. 998.18 s [pandoc-lua-engine] Warning: 'ExtensionsConfig' is ambiguous. It is defined
  15875. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Format’
  15876. 998.18 s [pandoc-lua-engine] * in ‘Text.Pandoc.Format’
  15877. 998.18 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15878. 998.19 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15879. 998.19 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Format’
  15880. 998.19 s [pandoc-lua-engine] Warning: 'enable' is out of scope.
  15881. 998.19 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  15882. 998.19 s [pandoc-lua-engine] Warning: 'disable' is out of scope.
  15883. 998.19 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  15884. 998.19 s [pandoc-lua-engine] Warning: 'WriterOptions' is ambiguous. It is defined
  15885. 998.19 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  15886. 998.19 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  15887. 998.19 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15888. 998.19 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15889. 998.19 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
  15890. 998.19 s [pandoc-lua-engine] Warning: 'Pandoc' is ambiguous. It is defined
  15891. 998.19 s [pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
  15892. 998.19 s [pandoc-lua-engine] * in ‘Text.Pandoc.Definition’
  15893. 998.19 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15894. 998.19 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15895. 998.19 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Definition’
  15896. 998.19 s [pandoc-lua-engine] Warning: 'Chunk' is out of scope.
  15897. 998.19 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  15898. 998.19 s [pandoc-lua-engine] Warning: 'ReaderOptions' is ambiguous. It is defined
  15899. 998.19 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  15900. 998.19 s [pandoc-lua-engine] * in ‘Text.Pandoc.Options’
  15901. 998.19 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15902. 998.19 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15903. 998.19 s [pandoc-lua-engine] Defaulting to the one defined in ‘Text.Pandoc.Options’
  15904. 998.19 s [pandoc-lua-engine] Warning: 'read' is out of scope.
  15905. 998.19 s [pandoc-lua-engine] If you qualify the identifier, haddock can try to link it anyway.
  15906. 998.19 s [pandoc-lua-engine] Warning: 'PandocLua' is ambiguous. It is defined
  15907. 998.19 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:23
  15908. 998.19 s [pandoc-lua-engine] * at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  15909. 998.19 s [pandoc-lua-engine] You may be able to disambiguate the identifier by qualifying it or
  15910. 998.19 s [pandoc-lua-engine] by specifying the type/value namespace explicitly.
  15911. 998.19 s [pandoc-lua-engine] Defaulting to the one defined at src/Text/Pandoc/Lua/PandocLua.hs:36:1
  15912. 998.19 s [pandoc-lua-engine] 100% ( 11 / 11) in 'Text.Pandoc.Lua'
  15913. 998.19 s [pandoc-lua-engine] Warning: Text.Pandoc.Lua: could not find link destinations for:
  15914. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Options.WriterOptions
  15915. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Error.PandocError
  15916. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Options.ReaderOptions
  15917. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Class.CommonState.CommonState
  15918. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Class.PandocMonad.PandocMonad
  15919. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Scripting.ScriptingEngine
  15920. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Filter.Environment.Environment
  15921. 998.19 s [pandoc-lua-engine] - Text.Pandoc.Scripting.CustomComponents
  15922. 998.59 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  15923. 999.43 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 )
  15924. 1001.84 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  15925. 1001.84 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  15926. 1001.93 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 )
  15927. 1004.01 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  15928. 1004.33 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  15929. 1005.29 s [nothunks] Phase: checkPhase
  15930. 1005.53 s [nothunks] Running 1 test suites...
  15931. 1005.54 s [nothunks] Test suite nothunks-test: RUNNING...
  15932. 1005.54 s [nothunks] Tests
  15933. 1005.54 s [nothunks] NoThunks.Class
  15934. 1005.54 s [nothunks] Sanity
  15935. 1005.54 s [nothunks] IntNotNF: OK
  15936. 1005.54 s [nothunks] ✓ <interactive> passed 1 test.
  15937. 1005.54 s [nothunks] IntIsNF: OK
  15938. 1005.54 s [nothunks] ✓ <interactive> passed 1 test.
  15939. 1005.54 s [nothunks] Pair: OK
  15940. 1005.54 s [nothunks] ✓ <interactive> passed 1 test.
  15941. 1005.54 s [nothunks] Sum: OK
  15942. 1005.54 s [nothunks] ✓ <interactive> passed 1 test.
  15943. 1005.54 s [nothunks] Fn: OK
  15944. 1005.54 s [nothunks] ✓ <interactive> passed 1 test.
  15945. 1005.54 s [nothunks] IO: OK
  15946. 1005.55 s [nothunks] ✓ <interactive> passed 1 test.
  15947. 1005.55 s [nothunks] InspectHeap
  15948. 1005.55 s [nothunks] Int: OK (0.01s)
  15949. 1005.55 s [nothunks] ✓ <interactive> passed 1000 tests.
  15950. 1005.55 s [nothunks] Just ["Int"] 51% ██████████▏·········
  15951. 1005.55 s [nothunks] Nothing 49% █████████▊··········
  15952. 1005.57 s [nothunks] IntInt: OK
  15953. 1005.59 s [nothunks] ✓ <interactive> passed 1000 tests.
  15954. 1005.59 s [nothunks] Just ["Int","Tuple2"] 37% ███████▍············
  15955. 1005.59 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  15956. 1005.59 s [nothunks] Nothing 12% ██▌·················
  15957. 1005.59 s [nothunks] SumInt: OK (0.02s)
  15958. 1005.59 s [nothunks] ✓ <interactive> passed 1000 tests.
  15959. 1005.59 s [nothunks] Just ["Either"] 32% ██████▍·············
  15960. 1005.59 s [nothunks] Just ["Int","Either"] 34% ██████▉·············
  15961. 1005.59 s [nothunks] Nothing 33% ██████▋·············
  15962. 1005.61 s [nothunks] ListInt: OK (0.02s)
  15963. 1005.61 s [nothunks] ✓ <interactive> passed 1000 tests.
  15964. 1005.61 s [nothunks] Just ["Int","List"] 24% ████▊···············
  15965. 1005.61 s [nothunks] Just ["List"] 43% ████████▌···········
  15966. 1005.61 s [nothunks] Nothing 33% ██████▋·············
  15967. 1005.63 s [nothunks] IntListInt: OK (0.02s)
  15968. 1005.63 s [nothunks] ✓ <interactive> passed 1000 tests.
  15969. 1005.63 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  15970. 1005.63 s [nothunks] Just ["Int","Tuple2"] 23% ████▋···············
  15971. 1005.63 s [nothunks] Just ["List","Tuple2"] 13% ██▌·················
  15972. 1005.63 s [nothunks] Just ["Tuple2"] 49% █████████▊··········
  15973. 1005.63 s [nothunks] Nothing 10% █▉··················
  15974. 1005.65 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  15975. 1005.65 s [nothunks] after 8 tests and 1 shrink.
  15976. 1005.65 s [nothunks] shrink path: 8:c
  15977. 1005.65 s [nothunks] Just ["Int","Seq"] 38% ███████▌············
  15978. 1005.65 s [nothunks] Nothing 50% ██████████··········
  15979. 1005.65 s [nothunks]
  15980. 1005.65 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  15981. 1005.65 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  15982. 1005.65 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  15983. 1005.65 s [nothunks] 168 ┃ -> Proxy a
  15984. 1005.65 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  15985. 1005.65 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  15986. 1005.65 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  15987. 1005.65 s [nothunks] 172 ┃ -> Property
  15988. 1005.65 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  15989. 1005.65 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  15990. 1005.65 s [nothunks] ┃ │ Wrap
  15991. 1005.65 s [nothunks] ┃ │ { unwrap =
  15992. 1005.65 s [nothunks] ┃ │ SeqEnqueue
  15993. 1005.65 s [nothunks] ┃ │ (IntValue 0)
  15994. 1005.65 s [nothunks] ┃ │ (SeqEnqueue
  15995. 1005.65 s [nothunks] ┃ │ (IntValue 0)
  15996. 1005.65 s [nothunks] ┃ │ (SeqEnqueue
  15997. 1005.65 s [nothunks] ┃ │ (IntValue 0)
  15998. 1005.65 s [nothunks] ┃ │ (SeqEnqueue
  15999. 1005.65 s [nothunks] ┃ │ (IntValue 0)
  16000. 1005.65 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  16001. 1005.65 s [nothunks] ┃ │ }
  16002. 1005.65 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  16003. 1005.65 s [nothunks] 176 ┃ fromModel m $ \a -> do
  16004. 1005.65 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  16005. 1005.65 s [nothunks] ┃ │ IsNF
  16006. 1005.65 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  16007. 1005.65 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  16008. 1005.65 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16009. 1005.65 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  16010. 1005.65 s [nothunks] ┃ │ - Just
  16011. 1005.65 s [nothunks] ┃ │ - ThunkInfo
  16012. 1005.65 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  16013. 1005.65 s [nothunks] ┃ │ + Nothing
  16014. 1005.65 s [nothunks]
  16015. 1005.65 s [nothunks] This failure can be reproduced by running:
  16016. 1005.65 s [nothunks] > recheckAt (Seed 7113420540837223723 14072295614623179539) "8:c" EXPECTED FAILURE
  16017. 1005.65 s [nothunks]
  16018. 1005.66 s [nothunks] OK (0.02s)
  16019. 1005.66 s [nothunks] ✓ <interactive> passed 1 test.
  16020. 1005.66 s [nothunks] Model
  16021. 1005.67 s [nothunks] Int: OK (0.01s)
  16022. 1005.67 s [nothunks] ✓ <interactive> passed 1000 tests.
  16023. 1005.67 s [nothunks] Just ["Int"] 48% █████████▌··········
  16024. 1005.67 s [nothunks] Nothing 52% ██████████▍·········
  16025. 1005.69 s [nothunks] IntInt: OK (0.02s)
  16026. 1005.69 s [nothunks] ✓ <interactive> passed 1000 tests.
  16027. 1005.69 s [nothunks] Just ["Int","Tuple2"] 39% ███████▋············
  16028. 1005.69 s [nothunks] Just ["Tuple2"] 48% █████████▋··········
  16029. 1005.69 s [nothunks] Nothing 13% ██▌·················
  16030. 1005.71 s [nothunks] SumInt: OK (0.01s)
  16031. 1005.71 s [nothunks] ✓ <interactive> passed 1000 tests.
  16032. 1005.71 s [nothunks] Just ["Either"] 34% ██████▋·············
  16033. 1005.71 s [nothunks] Just ["Int","Either"] 32% ██████▌·············
  16034. 1005.71 s [nothunks] Nothing 34% ██████▊·············
  16035. 1005.71 s [nothunks] ListInt: OK (0.02s)
  16036. 1005.71 s [nothunks] ✓ <interactive> passed 1000 tests.
  16037. 1005.71 s [nothunks] Just ["Int","List"] 20% ████················
  16038. 1005.71 s [nothunks] Just ["List"] 47% █████████▍··········
  16039. 1005.71 s [nothunks] Nothing 32% ██████▌·············
  16040. 1005.73 s [nothunks] IntListInt: OK (0.02s)
  16041. 1005.73 s [nothunks] ✓ <interactive> passed 1000 tests.
  16042. 1005.73 s [nothunks] Just ["Int","List","Tuple2"] 6% █···················
  16043. 1005.73 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  16044. 1005.73 s [nothunks] Just ["List","Tuple2"] 10% █▉··················
  16045. 1005.73 s [nothunks] Just ["Tuple2"] 52% ██████████▎·········
  16046. 1005.73 s [nothunks] Nothing 8% █▌··················
  16047. 1005.81 s [nothunks] SeqInt: OK (0.05s)
  16048. 1005.81 s [nothunks] ✓ <interactive> passed 1000 tests.
  16049. 1005.81 s [nothunks] Just ["Int","Seq"] 46% █████████···········
  16050. 1005.81 s [nothunks] Nothing 54% ██████████▉·········
  16051. 1005.83 s [nothunks] AllowThunksIn: OK (0.02s)
  16052. 1005.83 s [nothunks] ✓ <interactive> passed 1000 tests.
  16053. 1005.83 s [nothunks] Just ["Int","field2","Record"] 25% █████···············
  16054. 1005.83 s [nothunks] Just ["Record"] 49% █████████▋··········
  16055. 1005.83 s [nothunks] Nothing 26% █████▏··············
  16056. 1005.84 s [nothunks] Fn: OK
  16057. 1005.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  16058. 1005.84 s [nothunks] Just ["->"] 26% █████▎··············
  16059. 1005.84 s [nothunks] Nothing 74% ██████████████▋·····
  16060. 1005.85 s [nothunks] IO: OK
  16061. 1005.85 s [nothunks] ✓ <interactive> passed 1000 tests.
  16062. 1005.85 s [nothunks] Just ["IO"] 23% ████▋···············
  16063. 1005.85 s [nothunks] Nothing 77% ███████████████▎····
  16064. 1005.86 s [nothunks] ThunkFreeFn: OK (0.01s)
  16065. 1005.86 s [nothunks] ✓ <interactive> passed 1000 tests.
  16066. 1005.86 s [nothunks] Just ["->"] 27% █████▎··············
  16067. 1005.86 s [nothunks] Just ["...","->"] 34% ██████▉·············
  16068. 1005.86 s [nothunks] Nothing 39% ███████▊············
  16069. 1005.86 s [nothunks] ThunkFreeIO: OK (0.01s)
  16070. 1005.86 s [nothunks] ✓ <interactive> passed 1000 tests.
  16071. 1005.86 s [nothunks] Just ["...","IO"] 38% ███████▋············
  16072. 1005.86 s [nothunks] Just ["IO"] 24% ████▉···············
  16073. 1005.86 s [nothunks] Nothing 37% ███████▍············
  16074. 1005.86 s [nothunks] MutableVars
  16075. 1005.87 s [nothunks] IORef
  16076. 1005.87 s [nothunks] NotNF: OK
  16077. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16078. 1005.87 s [nothunks] NF: OK
  16079. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16080. 1005.87 s [nothunks] NotNFPure: OK
  16081. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16082. 1005.87 s [nothunks] NFPure: OK
  16083. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16084. 1005.87 s [nothunks] NotNFAtomically: OK
  16085. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16086. 1005.87 s [nothunks] NFAtomically: OK
  16087. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16088. 1005.87 s [nothunks] MVar
  16089. 1005.87 s [nothunks] NotNF: OK
  16090. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16091. 1005.87 s [nothunks] NF: OK
  16092. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16093. 1005.87 s [nothunks] NotNFPure: OK
  16094. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16095. 1005.87 s [nothunks] NFPure: OK
  16096. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16097. 1005.87 s [nothunks] NotNFAtomically: OK
  16098. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16099. 1005.87 s [nothunks] NFAtomically: OK
  16100. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16101. 1005.87 s [nothunks] TVar
  16102. 1005.87 s [nothunks] NotNF: OK
  16103. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16104. 1005.87 s [nothunks] NF: OK
  16105. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16106. 1005.87 s [nothunks] NotNFPure: OK
  16107. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16108. 1005.87 s [nothunks] NFPure: OK
  16109. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16110. 1005.87 s [nothunks] NotNFAtomically: OK
  16111. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16112. 1005.87 s [nothunks] NFAtomically: OK
  16113. 1005.87 s [nothunks] ✓ <interactive> passed 1 test.
  16114. 1005.87 s [nothunks]
  16115. 1005.87 s [nothunks] All 41 tests passed (0.33s)
  16116. 1005.87 s [nothunks] Test suite nothunks-test: PASS
  16117. 1005.87 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  16118. 1005.87 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  16119. 1005.87 s [nothunks] Phase: haddockPhase
  16120. 1005.89 s [pandoc-lua-engine] Documentation created: dist/doc/html/pandoc-lua-engine/,
  16121. 1005.89 s [pandoc-lua-engine] dist/doc/html/pandoc-lua-engine/pandoc-lua-engine.txt
  16122. 1005.95 s [pandoc-lua-engine] Preprocessing test suite 'test-pandoc-lua-engine' for pandoc-lua-engine-0.4.3...
  16123. 1005.96 s [pandoc-lua-engine] Phase: installPhase
  16124. 1005.99 s [nothunks] Preprocessing library for nothunks-0.3.1...
  16125. 1005.99 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  16126. 1005.99 s [nothunks] Warning: The documentation for the following packages are not installed. No
  16127. 1005.99 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  16128. 1006.10 s [pandoc-lua-engine] Installing library in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  16129. 1006.18 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  16130. 1006.59 s [nothunks] Haddock coverage:
  16131. 1006.59 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  16132. 1006.59 s [nothunks] * at src/NoThunks/Class.hs:334:48
  16133. 1006.59 s [nothunks] * at src/NoThunks/Class.hs:334:1
  16134. 1006.59 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16135. 1006.59 s [nothunks] by specifying the type/value namespace explicitly.
  16136. 1006.59 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  16137. 1006.59 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  16138. 1006.59 s [nothunks] * at src/NoThunks/Class.hs:353:25
  16139. 1006.59 s [nothunks] * at src/NoThunks/Class.hs:353:1
  16140. 1006.60 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16141. 1006.60 s [nothunks] by specifying the type/value namespace explicitly.
  16142. 1006.60 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  16143. 1006.60 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  16144. 1006.60 s [nothunks] * at src/NoThunks/Class.hs:358:47
  16145. 1006.60 s [nothunks] * at src/NoThunks/Class.hs:358:1
  16146. 1006.60 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16147. 1006.60 s [nothunks] by specifying the type/value namespace explicitly.
  16148. 1006.60 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  16149. 1006.60 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  16150. 1006.60 s [nothunks] * at src/NoThunks/Class.hs:308:27
  16151. 1006.60 s [nothunks] * at src/NoThunks/Class.hs:308:1
  16152. 1006.60 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16153. 1006.60 s [nothunks] by specifying the type/value namespace explicitly.
  16154. 1006.60 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  16155. 1006.60 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  16156. 1006.60 s [nothunks] * at src/NoThunks/Class.hs:230:18
  16157. 1006.60 s [nothunks] * at src/NoThunks/Class.hs:230:1
  16158. 1006.60 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16159. 1006.60 s [nothunks] by specifying the type/value namespace explicitly.
  16160. 1006.60 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  16161. 1006.60 s [nothunks] Warning: 'GHC' is out of scope.
  16162. 1006.60 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16163. 1006.60 s [nothunks] Warning: 'a' is out of scope.
  16164. 1006.60 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16165. 1006.60 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  16166. 1006.60 s [nothunks] Missing documentation for:
  16167. 1006.60 s [nothunks] Module header
  16168. 1006.92 s [haskell-language-server] Preprocessing library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0...
  16169. 1006.92 s [haskell-language-server] Building library 'hls-change-type-signature-plugin' for haskell-language-server-2.12.0.0...
  16170. 1006.93 s [pandoc-lua-engine] Phase: fixupPhase
  16171. 1006.94 s [pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
  16172. 1006.96 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  16173. 1006.96 s [nothunks] - Data.Vector.Vector
  16174. 1006.96 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  16175. 1006.96 s [nothunks] - NoThunks.Class.HasFields
  16176. 1006.96 s [nothunks] - NoThunks.Class.Elem
  16177. 1006.96 s [nothunks] - NoThunks.Class.GShowTypeOf
  16178. 1006.96 s [nothunks] - NoThunks.Class.GWRecordField
  16179. 1006.96 s [nothunks] - NoThunks.Class.checkContainsThunks
  16180. 1006.97 s [pandoc-lua-engine] shrinking /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/libHSpandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4-ghc9.10.3.so
  16181. 1007.02 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 )
  16182. 1007.09 s [pandoc-lua-engine] checking for references to /build/ in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3...
  16183. 1007.14 s [pandoc-lua-engine] patching script interpreter paths in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3
  16184. 1007.14 s [pandoc-lua-engine] stripping (with command strip and flags -S -p) in /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3/lib
  16185. 1007.43 s [pandoc-lua-engine] shrinking RPATHs of ELF executables and libraries in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
  16186. 1007.45 s [pandoc-lua-engine] checking for references to /build/ in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc...
  16187. 1007.47 s [pandoc-lua-engine] patching script interpreter paths in /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
  16188. 1007.72 s [pandoc-lua-engine:post-build] Uploading to cachix cache "sellout": /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
  16189. 1008.30 s [pandoc-lua-engine:post-build] Pushing 2 paths (431 are already present) using zstd to cache sellout ⏳
  16190. 1008.30 s [pandoc-lua-engine:post-build]
  16191. 1008.66 s [pandoc-lua-engine:post-build] Pushing /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc (2.68 MiB)
  16192. 1008.82 s [pandoc-lua-engine:post-build] Pushing /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 (25.42 MiB)
  16193. 1010.01 s [pandoc-lua-engine:post-build]
  16194. 1010.01 s [pandoc-lua-engine:post-build] All done.
  16195. 1010.04 s [pandoc-lua-engine:post-build] Uploading to the NixCI cache: /nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3 /nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc
  16196. 1010.14 s [pandoc-lua-engine:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16197. 1010.32 s [pandoc-lua-engine:post-build] copying 2 paths...
  16198. 1010.32 s [pandoc-lua-engine:post-build] copying path '/nix/store/wd3qb19xk64yg131cjkph4v34bwz1gmq-pandoc-lua-engine-0.4.3-doc' to 'https://cache.nix-ci.com'...
  16199. 1010.98 s [pandoc-lua-engine:post-build] copying path '/nix/store/40m6lp7v69m0xyc7ax4xpj9wakbz8gyf-pandoc-lua-engine-0.4.3' to 'https://cache.nix-ci.com'...
  16200. 1017.29 s [pandoc-lua-engine:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16201. 1017.55 s [pandoc-lua-engine:post-build] copying 1 paths...
  16202. 1017.59 s [pandoc-lua-engine:post-build] copying path '/nix/store/97khgz4lrmr215dy798mkwnwd89b9kzw-pandoc-lua-engine-0.4.3.drv' to 'https://cache.nix-ci.com'...
  16203. 1017.79 s Progress: 26 of 40 built (2 building), 760 of 760 downloaded from cache
  16204. 1017.89 s Building /nix/store/qmy7ps3m9d54gh5mmi24jf976jzhgy36-pandoc-cli-3.7.0.2.drv
  16205. 1017.89 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 )
  16206. 1017.89 s [haskell-language-server] Preprocessing library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0...
  16207. 1017.89 s [haskell-language-server] Building library 'hls-qualify-imported-names-plugin' for haskell-language-server-2.12.0.0...
  16208. 1017.89 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 )
  16209. 1017.89 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 )
  16210. 1017.89 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  16211. 1017.89 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  16212. 1017.89 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  16213. 1017.89 s [nothunks] Phase: installPhase
  16214. 1017.89 s [nothunks] Installing library in /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  16215. 1017.89 s [nothunks] Phase: fixupPhase
  16216. 1017.89 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1
  16217. 1017.89 s [nothunks] shrinking /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHSnothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y-ghc9.10.2.so
  16218. 1017.89 s [nothunks] checking for references to /build/ in /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1...
  16219. 1017.89 s [nothunks] patching script interpreter paths in /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1
  16220. 1017.89 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1/lib
  16221. 1017.89 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc
  16222. 1017.89 s [nothunks] checking for references to /build/ in /nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc...
  16223. 1017.89 s [nothunks] patching script interpreter paths in /nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc
  16224. 1017.96 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1 /nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc
  16225. 1018.45 s [nothunks:post-build] Pushing 2 paths (100 are already present) using zstd to cache sellout ⏳
  16226. 1018.45 s [nothunks:post-build]
  16227. 1018.81 s [nothunks:post-build] Pushing /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1 (2.85 MiB)
  16228. 1019.02 s [nothunks:post-build] Pushing /nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc (838.24 KiB)
  16229. 1020.58 s [nothunks:post-build]
  16230. 1020.58 s [nothunks:post-build] All done.
  16231. 1020.60 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1 /nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc
  16232. 1020.65 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16233. 1020.86 s [nothunks:post-build] copying 2 paths...
  16234. 1020.86 s [nothunks:post-build] copying path '/nix/store/imb2wcs0nzanf744gap45jxpy42vyyg4-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
  16235. 1021.79 s [nothunks:post-build] copying path '/nix/store/4k0a88pdaskpa2q4g5mmg4p4dpljmb52-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  16236. 1022.73 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16237. 1022.99 s [nothunks:post-build] copying 1 paths...
  16238. 1023.03 s [nothunks:post-build] copying path '/nix/store/j08va1x64hkc3nf9wr1ahbd24avihysk-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  16239. 1023.30 s Progress: 27 of 40 built (2 building), 760 of 760 downloaded from cache
  16240. 1023.35 s Building /nix/store/ri2p09calc82jm0z4wv62k31c3g6hzp8-unordered-containers-0.2.20.1.drv
  16241. 1023.35 s [pandoc-cli] Phase: setupCompilerEnvironmentPhase
  16242. 1023.35 s [pandoc-cli] Build with /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3.
  16243. 1023.35 s [pandoc-cli] Phase: unpackPhase
  16244. 1023.35 s [pandoc-cli] unpacking source archive /nix/store/l1s1s9sdrxfqabvc0hl1i6jbdyzaj2ci-pandoc-cli-3.7.0.2.tar.gz
  16245. 1023.35 s [pandoc-cli] source root is pandoc-cli-3.7.0.2
  16246. 1023.35 s [pandoc-cli] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "pandoc-cli-3.7.0.2/src/pandoc.hs"
  16247. 1023.35 s [pandoc-cli] Phase: patchPhase
  16248. 1023.35 s [pandoc-cli] Phase: compileBuildDriverPhase
  16249. 1023.35 s [pandoc-cli] setupCompileFlags: -package-db=/build/tmp.o5EsVgL0QG/setup-package.conf.d -threaded
  16250. 1023.35 s [pandoc-cli] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.o5EsVgL0QG/Main.o )
  16251. 1023.35 s [pandoc-cli] [2 of 2] Linking Setup
  16252. 1023.35 s [pandoc-cli] Phase: updateAutotoolsGnuConfigScriptsPhase
  16253. 1023.35 s [pandoc-cli] Phase: configurePhase
  16254. 1023.35 s [pandoc-cli] configureFlags: --verbose --prefix=/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.o5EsVgL0QG/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --disable-library-profiling --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 -fembed_data_files --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
  16255. 1023.35 s [pandoc-cli] Using Parsec parser
  16256. 1023.35 s [pandoc-cli] Configuring pandoc-cli-3.7.0.2...
  16257. 1023.35 s [pandoc-cli] Flags chosen: lua=True, nightly=False, server=True
  16258. 1023.35 s [pandoc-cli] Dependency base >=4.12 && <5: using base-4.20.2.0
  16259. 1023.35 s [pandoc-cli] Dependency hslua-cli >=1.4.1 && <1.5: using hslua-cli-1.4.3
  16260. 1023.35 s [pandoc-cli] Dependency pandoc ==3.7.0.2: using pandoc-3.7.0.2
  16261. 1023.35 s [pandoc-cli] Dependency pandoc-lua-engine >=0.4.3 && <0.5: using pandoc-lua-engine-0.4.3
  16262. 1023.35 s [pandoc-cli] Dependency pandoc-server >=0.1.0.9 && <0.2: using pandoc-server-0.1.0.11
  16263. 1023.35 s [pandoc-cli] Dependency safe: using safe-0.3.21
  16264. 1023.35 s [pandoc-cli] Dependency temporary >=1.1 && <1.4: using temporary-1.3
  16265. 1023.35 s [pandoc-cli] Dependency text: using text-2.1.3
  16266. 1023.35 s [pandoc-cli] Dependency wai-extra >=3.0.24: using wai-extra-3.1.18
  16267. 1023.35 s [pandoc-cli] Dependency warp: using warp-3.4.9
  16268. 1023.35 s [pandoc-cli] Source component graph: component exe:pandoc
  16269. 1023.35 s [pandoc-cli] Configured component graph:
  16270. 1023.35 s [pandoc-cli] component pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
  16271. 1023.35 s [pandoc-cli] include base-4.20.2.0-64da
  16272. 1023.35 s [pandoc-cli] include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
  16273. 1023.35 s [pandoc-cli] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  16274. 1023.35 s [pandoc-cli] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  16275. 1023.35 s [pandoc-cli] include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  16276. 1023.35 s [pandoc-cli] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  16277. 1023.35 s [pandoc-cli] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  16278. 1023.35 s [pandoc-cli] include text-2.1.3-c691
  16279. 1023.35 s [pandoc-cli] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  16280. 1023.35 s [pandoc-cli] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  16281. 1023.35 s [pandoc-cli] Linked component graph:
  16282. 1023.35 s [pandoc-cli] unit pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
  16283. 1023.35 s [pandoc-cli] include base-4.20.2.0-64da
  16284. 1023.35 s [pandoc-cli] include hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
  16285. 1023.35 s [pandoc-cli] include pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  16286. 1023.35 s [pandoc-cli] include pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  16287. 1023.35 s [pandoc-cli] include pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  16288. 1023.35 s [pandoc-cli] include safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  16289. 1023.35 s [pandoc-cli] include temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  16290. 1023.35 s [pandoc-cli] include text-2.1.3-c691
  16291. 1023.35 s [pandoc-cli] include wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  16292. 1023.35 s [pandoc-cli] include warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  16293. 1023.35 s [pandoc-cli] Ready component graph:
  16294. 1023.35 s [pandoc-cli] definite pandoc-cli-3.7.0.2-BdFEXtx4yoTCmeDPYT8eTr-pandoc
  16295. 1023.35 s [pandoc-cli] depends base-4.20.2.0-64da
  16296. 1023.35 s [pandoc-cli] depends hslua-cli-1.4.3-GEWVAFQbzS1ZD0qJxIIXy
  16297. 1023.35 s [pandoc-cli] depends pandoc-3.7.0.2-JiBoZy05rqH1rZpfc44nO3
  16298. 1023.35 s [pandoc-cli] depends pandoc-lua-engine-0.4.3-5WfKLRnIaWo35wgF88I2i4
  16299. 1023.35 s [pandoc-cli] depends pandoc-server-0.1.0.11-1fbeQpfbRwBC9PF9PShfbM
  16300. 1023.35 s [pandoc-cli] depends safe-0.3.21-3KkbrJIc4RVHGJea2Lg3Om
  16301. 1023.35 s [pandoc-cli] depends temporary-1.3-13ALOC7EiGuL5fcdI6Qhbr
  16302. 1023.35 s [pandoc-cli] depends text-2.1.3-c691
  16303. 1023.35 s [pandoc-cli] depends wai-extra-3.1.18-FaXDsOLfhm2AqRCck5c6OX
  16304. 1023.35 s [pandoc-cli] depends warp-3.4.9-Bcl6gvYN73A3zY8DJaUvNN
  16305. 1023.35 s [pandoc-cli] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16306. 1023.35 s [pandoc-cli] Using compiler: ghc-9.10.3
  16307. 1023.35 s [pandoc-cli] Using install prefix:
  16308. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16309. 1023.35 s [pandoc-cli] Executables installed in:
  16310. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
  16311. 1023.35 s [pandoc-cli] Libraries installed in:
  16312. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
  16313. 1023.35 s [pandoc-cli] Dynamic Libraries installed in:
  16314. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/lib/ghc-9.10.3/lib/x86_64-linux-ghc-9.10.3-05f6
  16315. 1023.35 s [pandoc-cli] Private executables installed in:
  16316. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/libexec/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
  16317. 1023.35 s [pandoc-cli] Data files installed in:
  16318. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
  16319. 1023.35 s [pandoc-cli] Documentation installed in:
  16320. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/doc/x86_64-linux-ghc-9.10.3-05f6/pandoc-cli-3.7.0.2
  16321. 1023.35 s [pandoc-cli] Configuration files installed in:
  16322. 1023.35 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/etc
  16323. 1023.35 s [pandoc-cli] No alex found
  16324. 1023.35 s [pandoc-cli] Using ar found on system at:
  16325. 1023.35 s [pandoc-cli] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16326. 1023.35 s [pandoc-cli] No c2hs found
  16327. 1023.35 s [pandoc-cli] No cpphs found
  16328. 1023.35 s [pandoc-cli] No doctest found
  16329. 1023.35 s [pandoc-cli] Using gcc version 14.3.0 given by user at:
  16330. 1023.35 s [pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16331. 1023.35 s [pandoc-cli] Using ghc version 9.10.3 found on system at:
  16332. 1023.35 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc
  16333. 1023.35 s [pandoc-cli] Using ghc-pkg version 9.10.3 found on system at:
  16334. 1023.35 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/ghc-pkg-9.10.3
  16335. 1023.35 s [pandoc-cli] No ghcjs found
  16336. 1023.35 s [pandoc-cli] No ghcjs-pkg found
  16337. 1023.35 s [pandoc-cli] No greencard found
  16338. 1023.35 s [pandoc-cli] Using haddock version 2.31.1 found on system at:
  16339. 1023.35 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/haddock-ghc-9.10.3
  16340. 1023.35 s [pandoc-cli] No happy found
  16341. 1023.35 s [pandoc-cli] Using haskell-suite found on system at: haskell-suite-dummy-location
  16342. 1023.35 s [pandoc-cli] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16343. 1023.35 s [pandoc-cli] No hmake found
  16344. 1023.35 s [pandoc-cli] Using hpc version 0.69 found on system at:
  16345. 1023.35 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hpc-ghc-9.10.3
  16346. 1023.35 s [pandoc-cli] Using hsc2hs version 0.68.10 found on system at:
  16347. 1023.35 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/hsc2hs-ghc-9.10.3
  16348. 1023.35 s [pandoc-cli] No hscolour found
  16349. 1023.35 s [pandoc-cli] No jhc found
  16350. 1023.35 s [pandoc-cli] Using ld found on system at:
  16351. 1023.35 s [pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  16352. 1023.35 s [pandoc-cli] No pkg-config found
  16353. 1023.35 s [pandoc-cli] Using runghc version 9.10.3 found on system at:
  16354. 1023.35 s [pandoc-cli] /nix/store/s9jd43rkwc2syl9cvgj6f786avy8bgzy-ghc-9.10.3/bin/runghc-9.10.3
  16355. 1023.35 s [pandoc-cli] Using strip version 2.44 found on system at:
  16356. 1023.35 s [pandoc-cli] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16357. 1023.35 s [pandoc-cli] Using tar found on system at:
  16358. 1023.35 s [pandoc-cli] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16359. 1023.35 s [pandoc-cli] No uhc found
  16360. 1023.35 s [pandoc-cli] Phase: buildPhase
  16361. 1023.35 s [pandoc-cli] Preprocessing executable 'pandoc' for pandoc-cli-3.7.0.2...
  16362. 1023.35 s [pandoc-cli] Building executable 'pandoc' for pandoc-cli-3.7.0.2...
  16363. 1023.35 s [pandoc-cli] [1 of 3] Compiling PandocCLI.Lua
  16364. 1023.35 s [pandoc-cli] [2 of 3] Compiling PandocCLI.Server
  16365. 1023.35 s [pandoc-cli] [3 of 3] Compiling Main
  16366. 1023.35 s [pandoc-cli] [4 of 4] Linking dist/build/pandoc/pandoc
  16367. 1023.47 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  16368. 1023.47 s [unordered-containers] Build with /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2.
  16369. 1023.67 s [unordered-containers] Phase: unpackPhase
  16370. 1023.67 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  16371. 1023.68 s [unordered-containers] source root is unordered-containers-0.2.20.1
  16372. 1023.68 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  16373. 1023.69 s [unordered-containers] Phase: patchPhase
  16374. 1023.70 s [unordered-containers] Phase: compileBuildDriverPhase
  16375. 1023.70 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.5PeF4UuCTW/setup-package.conf.d -threaded
  16376. 1023.75 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.5PeF4UuCTW/Main.o )
  16377. 1023.79 s [unordered-containers] [2 of 2] Linking Setup
  16378. 1024.63 s [haskell-language-server] Preprocessing library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0...
  16379. 1024.63 s [haskell-language-server] Building library 'hls-cabal-fmt-plugin' for haskell-language-server-2.12.0.0...
  16380. 1024.72 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 )
  16381. 1025.07 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  16382. 1025.08 s [unordered-containers] Phase: configurePhase
  16383. 1025.09 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.5PeF4UuCTW/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
  16384. 1025.09 s [unordered-containers] Using Parsec parser
  16385. 1025.09 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  16386. 1025.40 s [unordered-containers] Flags chosen: debug=False
  16387. 1025.68 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.20.1.0
  16388. 1025.68 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  16389. 1025.68 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  16390. 1025.68 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.22.0.0
  16391. 1025.68 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  16392. 1025.68 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  16393. 1025.68 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  16394. 1025.68 s [unordered-containers] Dependency base: using base-4.20.1.0
  16395. 1025.68 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  16396. 1025.68 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  16397. 1025.68 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  16398. 1025.68 s [unordered-containers] Dependency random: using random-1.2.1.3
  16399. 1025.68 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  16400. 1025.68 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  16401. 1025.68 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  16402. 1025.68 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  16403. 1025.68 s [unordered-containers] Source component graph:
  16404. 1025.68 s [unordered-containers] component lib
  16405. 1025.68 s [unordered-containers] component test:unordered-containers-tests dependency lib
  16406. 1025.68 s [unordered-containers] Configured component graph:
  16407. 1025.68 s [unordered-containers] component unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  16408. 1025.68 s [unordered-containers] include base-4.20.1.0-f445
  16409. 1025.68 s [unordered-containers] include deepseq-1.5.0.0-e166
  16410. 1025.68 s [unordered-containers] include hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  16411. 1025.68 s [unordered-containers] include template-haskell-2.22.0.0-58bf
  16412. 1025.68 s [unordered-containers] component unordered-containers-0.2.20.1-DAfNtMGi2aRGRnkwipJlsQ-unordered-containers-tests
  16413. 1025.68 s [unordered-containers] include ChasingBottoms-1.3.1.17-12dzvc6mexOEjJWdGPCecv
  16414. 1025.68 s [unordered-containers] include HUnit-1.6.2.0-GAuKlcZg6LzAvJUHPliCN
  16415. 1025.68 s [unordered-containers] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  16416. 1025.68 s [unordered-containers] include base-4.20.1.0-f445
  16417. 1025.68 s [unordered-containers] include containers-0.7-6571
  16418. 1025.68 s [unordered-containers] include hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  16419. 1025.68 s [unordered-containers] include nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  16420. 1025.68 s [unordered-containers] include random-1.2.1.3-AmyB5M6i6upJCxKBwzEGRh
  16421. 1025.68 s [unordered-containers] include tasty-1.5.3-FnLG3VNSatS37qpBN0fGqj
  16422. 1025.68 s [unordered-containers] include tasty-hunit-0.10.2-5wwvgYdxRqbBn6LCrFLUgQ
  16423. 1025.68 s [unordered-containers] include tasty-quickcheck-0.11.1-KPLMYbRIZP8JbSJJtRQ8LP
  16424. 1025.68 s [unordered-containers] include unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  16425. 1025.68 s [unordered-containers] Linked component graph:
  16426. 1025.68 s [unordered-containers] unit unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  16427. 1025.68 s [unordered-containers] include base-4.20.1.0-f445
  16428. 1025.68 s [unordered-containers] include deepseq-1.5.0.0-e166
  16429. 1025.68 s [unordered-containers] include hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  16430. 1025.68 s [unordered-containers] include template-haskell-2.22.0.0-58bf
  16431. 1025.68 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD:Data.HashSet.Internal
  16432. 1025.68 s [unordered-containers] unit unordered-containers-0.2.20.1-DAfNtMGi2aRGRnkwipJlsQ-unordered-containers-tests
  16433. 1025.68 s [unordered-containers] include ChasingBottoms-1.3.1.17-12dzvc6mexOEjJWdGPCecv
  16434. 1025.68 s [unordered-containers] include HUnit-1.6.2.0-GAuKlcZg6LzAvJUHPliCN
  16435. 1025.68 s [unordered-containers] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  16436. 1025.68 s [unordered-containers] include base-4.20.1.0-f445
  16437. 1025.68 s [unordered-containers] include containers-0.7-6571
  16438. 1025.68 s [unordered-containers] include hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  16439. 1025.69 s [unordered-containers] include nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  16440. 1025.69 s [unordered-containers] include random-1.2.1.3-AmyB5M6i6upJCxKBwzEGRh
  16441. 1025.69 s [unordered-containers] include tasty-1.5.3-FnLG3VNSatS37qpBN0fGqj
  16442. 1025.69 s [unordered-containers] include tasty-hunit-0.10.2-5wwvgYdxRqbBn6LCrFLUgQ
  16443. 1025.69 s [unordered-containers] include tasty-quickcheck-0.11.1-KPLMYbRIZP8JbSJJtRQ8LP
  16444. 1025.69 s [unordered-containers] include unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  16445. 1025.69 s [unordered-containers] Ready component graph:
  16446. 1025.69 s [unordered-containers] definite unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  16447. 1025.69 s [unordered-containers] depends base-4.20.1.0-f445
  16448. 1025.69 s [unordered-containers] depends deepseq-1.5.0.0-e166
  16449. 1025.69 s [unordered-containers] depends hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  16450. 1025.69 s [unordered-containers] depends template-haskell-2.22.0.0-58bf
  16451. 1025.69 s [unordered-containers] definite unordered-containers-0.2.20.1-DAfNtMGi2aRGRnkwipJlsQ-unordered-containers-tests
  16452. 1025.69 s [unordered-containers] depends ChasingBottoms-1.3.1.17-12dzvc6mexOEjJWdGPCecv
  16453. 1025.69 s [unordered-containers] depends HUnit-1.6.2.0-GAuKlcZg6LzAvJUHPliCN
  16454. 1025.69 s [unordered-containers] depends QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  16455. 1025.69 s [unordered-containers] depends base-4.20.1.0-f445
  16456. 1025.69 s [unordered-containers] depends containers-0.7-6571
  16457. 1025.69 s [unordered-containers] depends hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  16458. 1025.69 s [unordered-containers] depends nothunks-0.3.1-BOFX1WgCn2r8LRaHiS4D2y
  16459. 1025.69 s [unordered-containers] depends random-1.2.1.3-AmyB5M6i6upJCxKBwzEGRh
  16460. 1025.69 s [unordered-containers] depends tasty-1.5.3-FnLG3VNSatS37qpBN0fGqj
  16461. 1025.69 s [unordered-containers] depends tasty-hunit-0.10.2-5wwvgYdxRqbBn6LCrFLUgQ
  16462. 1025.69 s [unordered-containers] depends tasty-quickcheck-0.11.1-KPLMYbRIZP8JbSJJtRQ8LP
  16463. 1025.69 s [unordered-containers] depends unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  16464. 1025.69 s [unordered-containers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16465. 1025.69 s [unordered-containers] Using compiler: ghc-9.10.2
  16466. 1025.69 s [unordered-containers] Using install prefix:
  16467. 1025.69 s [unordered-containers] /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1
  16468. 1025.69 s [unordered-containers] Executables installed in:
  16469. 1025.69 s [unordered-containers] /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/bin
  16470. 1025.69 s [unordered-containers] Libraries installed in:
  16471. 1025.69 s [unordered-containers] /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  16472. 1025.69 s [unordered-containers] Dynamic Libraries installed in:
  16473. 1025.69 s [unordered-containers] /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a
  16474. 1025.69 s [unordered-containers] Private executables installed in:
  16475. 1025.69 s [unordered-containers] /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.10.2-2a2a/unordered-containers-0.2.20.1
  16476. 1025.69 s [unordered-containers] Data files installed in:
  16477. 1025.69 s [unordered-containers] /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.10.2-2a2a/unordered-containers-0.2.20.1
  16478. 1025.69 s [unordered-containers] Documentation installed in:
  16479. 1025.69 s [unordered-containers] /nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  16480. 1025.69 s [unordered-containers] Configuration files installed in:
  16481. 1025.69 s [unordered-containers] /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/etc
  16482. 1025.69 s [unordered-containers] No alex found
  16483. 1025.69 s [unordered-containers] Using ar found on system at:
  16484. 1025.69 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16485. 1025.69 s [unordered-containers] No c2hs found
  16486. 1025.69 s [unordered-containers] No cpphs found
  16487. 1025.69 s [unordered-containers] No doctest found
  16488. 1025.69 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  16489. 1025.69 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16490. 1025.69 s [unordered-containers] Using ghc version 9.10.2 found on system at:
  16491. 1025.69 s [unordered-containers] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc
  16492. 1025.69 s [unordered-containers] Using ghc-pkg version 9.10.2 found on system at:
  16493. 1025.69 s [unordered-containers] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc-pkg-9.10.2
  16494. 1025.69 s [unordered-containers] No ghcjs found
  16495. 1025.69 s [unordered-containers] No ghcjs-pkg found
  16496. 1025.69 s [unordered-containers] No greencard found
  16497. 1025.69 s [unordered-containers] Using haddock version 2.31.0 found on system at:
  16498. 1025.69 s [unordered-containers] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/haddock-ghc-9.10.2
  16499. 1025.69 s [unordered-containers] No happy found
  16500. 1025.69 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  16501. 1025.69 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16502. 1025.69 s [unordered-containers] No hmake found
  16503. 1025.69 s [unordered-containers] Using hpc version 0.69 found on system at:
  16504. 1025.69 s [unordered-containers] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hpc-ghc-9.10.2
  16505. 1025.69 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  16506. 1025.69 s [unordered-containers] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  16507. 1025.69 s [unordered-containers] Using hscolour version 1.25 found on system at:
  16508. 1025.69 s [unordered-containers] /nix/store/yhwsn20b5l3lksyl2h8a95k62xqmxg1d-hscolour-1.25/bin/HsColour
  16509. 1025.69 s [unordered-containers] No jhc found
  16510. 1025.69 s [unordered-containers] Using ld found on system at:
  16511. 1025.69 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  16512. 1025.69 s [unordered-containers] No pkg-config found
  16513. 1025.69 s [unordered-containers] Using runghc version 9.10.2 found on system at:
  16514. 1025.69 s [unordered-containers] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/runghc-9.10.2
  16515. 1025.69 s [unordered-containers] Using strip version 2.44 found on system at:
  16516. 1025.69 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  16517. 1025.69 s [unordered-containers] Using tar found on system at:
  16518. 1025.69 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  16519. 1025.69 s [unordered-containers] No uhc found
  16520. 1025.90 s [unordered-containers] Phase: buildPhase
  16521. 1025.95 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  16522. 1025.95 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  16523. 1026.03 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16524. 1026.03 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16525. 1026.03 s [unordered-containers] |
  16526. 1026.03 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16527. 1026.03 s [unordered-containers] | ^^^^^^^^^^
  16528. 1026.03 s [unordered-containers]
  16529. 1026.21 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 )
  16530. 1026.34 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 )
  16531. 1026.38 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16532. 1026.38 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16533. 1026.38 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16534. 1026.38 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16535. 1026.38 s [unordered-containers] |
  16536. 1026.38 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16537. 1026.38 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16538. 1026.38 s [unordered-containers]
  16539. 1026.95 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 )
  16540. 1026.95 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 )
  16541. 1032.09 s [pandoc-cli] Phase: checkPhase
  16542. 1032.09 s [pandoc-cli] Package has no test suites.
  16543. 1032.09 s [pandoc-cli] Phase: haddockPhase
  16544. 1032.48 s [pandoc-cli] Phase: installPhase
  16545. 1032.63 s [pandoc-cli] Installing executable pandoc in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
  16546. 1032.63 s [pandoc-cli] Warning: The directory
  16547. 1032.63 s [pandoc-cli] /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin is not in
  16548. 1032.63 s [pandoc-cli] the system search path.
  16549. 1033.09 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 )
  16550. 1033.17 s [haskell-language-server] Preprocessing executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0...
  16551. 1033.17 s [haskell-language-server] Building executable 'ghcide-test-preprocessor' for haskell-language-server-2.12.0.0...
  16552. 1033.27 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 )
  16553. 1033.40 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 )
  16554. 1033.54 s [haskell-language-server] [2 of 2] Linking dist/build/ghcide-test-preprocessor/ghcide-test-preprocessor
  16555. 1033.97 s [haskell-language-server] Preprocessing library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0...
  16556. 1033.97 s [haskell-language-server] Building library 'hls-call-hierarchy-plugin' for haskell-language-server-2.12.0.0...
  16557. 1034.09 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 )
  16558. 1034.95 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 )
  16559. 1034.95 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  16560. 1034.95 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 )
  16561. 1034.97 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 )
  16562. 1035.15 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16563. 1035.15 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16564. 1035.15 s [unordered-containers] |
  16565. 1035.15 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16566. 1035.15 s [unordered-containers] | ^^^^^^^^^^
  16567. 1035.15 s [unordered-containers]
  16568. 1035.39 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  16569. 1035.41 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 )
  16570. 1035.51 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16571. 1035.51 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16572. 1035.51 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16573. 1035.51 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16574. 1035.51 s [unordered-containers] |
  16575. 1035.51 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16576. 1035.51 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16577. 1035.51 s [unordered-containers]
  16578. 1035.75 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 )
  16579. 1035.93 s [pandoc-cli] Phase: fixupPhase
  16580. 1035.94 s [pandoc-cli] shrinking RPATHs of ELF executables and libraries in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16581. 1035.94 s [pandoc-cli] shrinking /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin/pandoc
  16582. 1036.14 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  16583. 1036.14 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  16584. 1036.70 s [pandoc-cli] checking for references to /build/ in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2...
  16585. 1036.83 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 )
  16586. 1036.91 s [pandoc-cli] gzipping man pages under /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/share/man/
  16587. 1036.93 s [pandoc-cli] patching script interpreter paths in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16588. 1036.93 s [pandoc-cli] stripping (with command strip and flags -S -p) in /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2/bin
  16589. 1037.25 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 )
  16590. 1037.76 s [pandoc-cli:post-build] Uploading to cachix cache "sellout": /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16591. 1038.19 s [pandoc-cli:post-build] Pushing 1 paths (30 are already present) using zstd to cache sellout ⏳
  16592. 1038.25 s [pandoc-cli:post-build]
  16593. 1038.57 s [pandoc-cli:post-build] Pushing /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2 (207.74 MiB)
  16594. 1042.22 s [pandoc-cli:post-build]
  16595. 1042.22 s [pandoc-cli:post-build] All done.
  16596. 1042.24 s [pandoc-cli:post-build] Uploading to the NixCI cache: /nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2
  16597. 1042.29 s [pandoc-cli:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16598. 1042.31 s [pandoc-cli:post-build] copying 1 paths...
  16599. 1042.31 s [pandoc-cli:post-build] copying path '/nix/store/rsk25mlpk4hvq0hfvh4134f33c2hh69l-pandoc-cli-3.7.0.2' to 'https://cache.nix-ci.com'...
  16600. 1108.23 s [pandoc-cli:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16601. 1108.52 s [pandoc-cli:post-build] copying 1 paths...
  16602. 1108.56 s [pandoc-cli:post-build] copying path '/nix/store/qmy7ps3m9d54gh5mmi24jf976jzhgy36-pandoc-cli-3.7.0.2.drv' to 'https://cache.nix-ci.com'...
  16603. 1108.78 s Progress: 28 of 40 built (2 building), 760 of 760 downloaded from cache
  16604. 1108.83 s Building /nix/store/10xzxxdy2m2dv7z9mzid70kwihb0p0z3-shellcheck-0.11.0.drv
  16605. 1108.83 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 )
  16606. 1108.83 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 )
  16607. 1108.83 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 )
  16608. 1108.83 s [haskell-language-server] Preprocessing library 'hls-class-plugin' for haskell-language-server-2.12.0.0...
  16609. 1108.83 s [haskell-language-server] Building library 'hls-class-plugin' for haskell-language-server-2.12.0.0...
  16610. 1108.83 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 )
  16611. 1108.83 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 )
  16612. 1108.83 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 )
  16613. 1108.83 s [haskell-language-server] plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs:9:1: warning: [GHC-66111] [-Wunused-imports]
  16614. 1108.83 s [haskell-language-server] The import of ‘Data.Functor.Identity’ is redundant
  16615. 1108.83 s [haskell-language-server] except perhaps to import instances from ‘Data.Functor.Identity’
  16616. 1108.83 s [haskell-language-server] To import instances alone, use: import Data.Functor.Identity()
  16617. 1108.83 s [haskell-language-server] |
  16618. 1108.83 s [haskell-language-server] 9 | import Data.Functor.Identity (Identity)
  16619. 1108.83 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16620. 1108.83 s [haskell-language-server]
  16621. 1108.83 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 )
  16622. 1108.83 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 )
  16623. 1108.83 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 )
  16624. 1108.83 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 )
  16625. 1108.83 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 )
  16626. 1108.83 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 )
  16627. 1108.83 s [haskell-language-server] plugins/hls-class-plugin/src/Ide/Plugin/Class/ExactPrint.hs:9:1: warning: [GHC-66111] [-Wunused-imports]
  16628. 1108.83 s [haskell-language-server] The import of ‘Data.Functor.Identity’ is redundant
  16629. 1108.83 s [haskell-language-server] except perhaps to import instances from ‘Data.Functor.Identity’
  16630. 1108.83 s [haskell-language-server] To import instances alone, use: import Data.Functor.Identity()
  16631. 1108.83 s [haskell-language-server] |
  16632. 1108.83 s [haskell-language-server] 9 | import Data.Functor.Identity (Identity)
  16633. 1108.83 s [haskell-language-server] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16634. 1108.83 s [haskell-language-server]
  16635. 1108.83 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 )
  16636. 1108.83 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  16637. 1108.83 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  16638. 1108.83 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  16639. 1108.83 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  16640. 1108.83 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  16641. 1108.83 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  16642. 1108.83 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16643. 1108.83 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16644. 1108.83 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 )
  16645. 1108.83 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  16646. 1108.83 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  16647. 1108.83 s [unordered-containers] In the use of ‘head’
  16648. 1108.83 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  16649. 1108.83 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"."
  16650. 1108.83 s [unordered-containers] |
  16651. 1108.83 s [unordered-containers] 93 | k = head keys
  16652. 1108.83 s [unordered-containers] | ^^^^
  16653. 1108.83 s [unordered-containers]
  16654. 1108.83 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 )
  16655. 1108.83 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  16656. 1108.83 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  16657. 1108.83 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  16658. 1108.83 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  16659. 1108.83 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  16660. 1108.83 s [unordered-containers] |
  16661. 1108.83 s [unordered-containers] 7 | import Data.Foldable (foldl')
  16662. 1108.83 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16663. 1108.83 s [unordered-containers]
  16664. 1108.83 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 )
  16665. 1108.83 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 )
  16666. 1108.83 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 )
  16667. 1108.83 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  16668. 1108.83 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  16669. 1108.83 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  16670. 1108.83 s [unordered-containers] buildPhase completed in 31 seconds
  16671. 1108.83 s [unordered-containers] Phase: checkPhase
  16672. 1108.83 s [unordered-containers] Running 1 test suites...
  16673. 1108.83 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  16674. 1108.83 s [unordered-containers] All
  16675. 1108.83 s [unordered-containers] Properties
  16676. 1108.83 s [unordered-containers] Data.HashMap.Lazy
  16677. 1108.83 s [unordered-containers] instances
  16678. 1108.83 s [unordered-containers] Eq
  16679. 1108.83 s [unordered-containers] ==: OK (0.02s)
  16680. 1108.83 s [unordered-containers] +++ OK, passed 100 tests.
  16681. 1108.83 s [unordered-containers] /=: OK
  16682. 1108.83 s [unordered-containers] +++ OK, passed 100 tests.
  16683. 1108.83 s [unordered-containers] Ord
  16684. 1108.83 s [unordered-containers] compare reflexive: OK (0.02s)
  16685. 1108.83 s [unordered-containers] +++ OK, passed 100 tests.
  16686. 1108.83 s [unordered-containers] compare transitive: OK (0.03s)
  16687. 1108.83 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 )
  16688. 1108.83 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 )
  16689. 1108.83 s [haskell-language-server] Preprocessing library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0...
  16690. 1108.83 s [haskell-language-server] Building library 'hls-cabal-gild-plugin' for haskell-language-server-2.12.0.0...
  16691. 1108.83 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 )
  16692. 1108.83 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 )
  16693. 1108.83 s [haskell-language-server] Preprocessing library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0...
  16694. 1108.83 s [haskell-language-server] Building library 'hls-signature-help-plugin' for haskell-language-server-2.12.0.0...
  16695. 1108.83 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 )
  16696. 1108.83 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 )
  16697. 1108.83 s [haskell-language-server] Preprocessing library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0...
  16698. 1108.83 s [haskell-language-server] Building library 'hls-explicit-imports-plugin' for haskell-language-server-2.12.0.0...
  16699. 1108.83 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  16700. 1108.83 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  16701. 1108.83 s [haskell-language-server] but were not needed for compilation:
  16702. 1108.83 s [haskell-language-server] - ghc-9.10.2 (exposed by flag -package-id ghc-9.10.2-2a2a)
  16703. 1108.83 s [haskell-language-server]
  16704. 1108.83 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 )
  16705. 1108.84 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  16706. 1108.84 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  16707. 1108.84 s [haskell-language-server] but were not needed for compilation:
  16708. 1108.84 s [haskell-language-server] - ghc-9.10.2 (exposed by flag -package-id ghc-9.10.2-2a2a)
  16709. 1108.84 s [haskell-language-server]
  16710. 1108.84 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 )
  16711. 1108.84 s [haskell-language-server] Preprocessing library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0...
  16712. 1108.84 s [haskell-language-server] Building library 'hls-semantic-tokens-plugin' for haskell-language-server-2.12.0.0...
  16713. 1108.84 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  16714. 1108.84 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  16715. 1108.84 s [haskell-language-server] but were not needed for compilation:
  16716. 1108.84 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-HM5UfQQASfLE3ZKcCx37h)
  16717. 1108.84 s [haskell-language-server]
  16718. 1108.84 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 )
  16719. 1108.84 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 )
  16720. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16721. 1108.84 s [unordered-containers] compare antisymmetric: OK (0.02s)
  16722. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16723. 1108.84 s [unordered-containers] Ord => Eq: OK
  16724. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16725. 1108.84 s [unordered-containers] Read/Show: OK (0.12s)
  16726. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16727. 1108.84 s [unordered-containers] Functor: OK (0.08s)
  16728. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16729. 1108.84 s [unordered-containers] Foldable: OK (0.03s)
  16730. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16731. 1108.84 s [unordered-containers] Bifoldable
  16732. 1108.84 s [unordered-containers] bifoldMap: OK (0.02s)
  16733. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16734. 1108.84 s [unordered-containers] bifoldr: OK (0.03s)
  16735. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16736. 1108.84 s [unordered-containers] bifoldl: OK (0.02s)
  16737. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16738. 1108.84 s [unordered-containers] Hashable: OK (0.03s)
  16739. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16740. 1108.84 s [unordered-containers] empty
  16741. 1108.84 s [unordered-containers] valid: OK
  16742. 1108.84 s [unordered-containers] +++ OK, passed 1 test.
  16743. 1108.84 s [unordered-containers] singleton
  16744. 1108.84 s [unordered-containers] valid: OK
  16745. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16746. 1108.84 s [unordered-containers] size: OK
  16747. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16748. 1108.84 s [unordered-containers] member: OK (0.01s)
  16749. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16750. 1108.84 s [unordered-containers] lookup: OK
  16751. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16752. 1108.84 s [unordered-containers] !?: OK (0.02s)
  16753. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16754. 1108.84 s [unordered-containers] insert
  16755. 1108.84 s [unordered-containers] model: OK (0.03s)
  16756. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16757. 1108.84 s [unordered-containers] valid: OK
  16758. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16759. 1108.84 s [unordered-containers] insertWith
  16760. 1108.84 s [unordered-containers] insertWith: OK
  16761. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16762. 1108.84 s [unordered-containers] valid: OK
  16763. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16764. 1108.84 s [unordered-containers] delete
  16765. 1108.84 s [unordered-containers] model: OK
  16766. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16767. 1108.84 s [unordered-containers] valid: OK
  16768. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16769. 1108.84 s [unordered-containers] adjust
  16770. 1108.84 s [unordered-containers] model: OK
  16771. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16772. 1108.84 s [unordered-containers] valid: OK
  16773. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16774. 1108.84 s [unordered-containers] update
  16775. 1108.84 s [unordered-containers] model: OK
  16776. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16777. 1108.84 s [unordered-containers] valid: OK
  16778. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16779. 1108.84 s [unordered-containers] alter
  16780. 1108.84 s [unordered-containers] model: OK (0.02s)
  16781. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16782. 1108.84 s [unordered-containers] valid: OK (0.01s)
  16783. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16784. 1108.84 s [unordered-containers] alterF
  16785. 1108.84 s [unordered-containers] model
  16786. 1108.84 s [unordered-containers] []: OK (0.08s)
  16787. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16788. 1108.84 s [unordered-containers] adjust: OK (0.02s)
  16789. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16790. 1108.84 s [unordered-containers] insert: OK
  16791. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16792. 1108.84 s [unordered-containers] insertWith: OK (0.02s)
  16793. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16794. 1108.84 s [unordered-containers] delete: OK
  16795. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16796. 1108.84 s [unordered-containers] lookup: OK (0.02s)
  16797. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16798. 1108.84 s [unordered-containers] valid: OK (0.03s)
  16799. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16800. 1108.84 s [unordered-containers] isSubmapOf
  16801. 1108.84 s [unordered-containers] model: OK (0.01s)
  16802. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16803. 1108.84 s [unordered-containers] m ⊆ m: OK
  16804. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16805. 1108.84 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  16806. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16807. 1108.84 s [unordered-containers] m1\m2 ⊆ m1: OK (0.03s)
  16808. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16809. 1108.84 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.02s)
  16810. 1108.84 s [unordered-containers] +++ OK, passed 100 tests; 202 discarded.
  16811. 1108.84 s [unordered-containers] delete k m ⊆ m: OK
  16812. 1108.84 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  16813. 1108.84 s [unordered-containers] m ⊈ delete k m : OK
  16814. 1108.84 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  16815. 1108.84 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.01s)
  16816. 1108.84 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  16817. 1108.84 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  16818. 1108.84 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  16819. 1108.84 s [unordered-containers] union
  16820. 1108.84 s [unordered-containers] model: OK (0.02s)
  16821. 1108.84 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 )
  16822. 1108.84 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 )
  16823. 1108.84 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 )
  16824. 1108.84 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 )
  16825. 1108.84 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 )
  16826. 1108.84 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 )
  16827. 1108.84 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  16828. 1108.84 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  16829. 1108.84 s [haskell-language-server] but were not needed for compilation:
  16830. 1108.84 s [haskell-language-server] - syb-0.7.2.4 (exposed by flag -package-id syb-0.7.2.4-HM5UfQQASfLE3ZKcCx37h)
  16831. 1108.84 s [haskell-language-server]
  16832. 1108.84 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 )
  16833. 1108.84 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 )
  16834. 1108.84 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 )
  16835. 1108.84 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 )
  16836. 1108.84 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 )
  16837. 1108.84 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 )
  16838. 1108.84 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 )
  16839. 1108.84 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 )
  16840. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16841. 1108.84 s [unordered-containers] valid: OK (0.02s)
  16842. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16843. 1108.84 s [unordered-containers] unionWith
  16844. 1108.84 s [unordered-containers] model: OK (0.03s)
  16845. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16846. 1108.84 s [unordered-containers] valid: OK (0.02s)
  16847. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16848. 1108.84 s [unordered-containers] unionWithKey
  16849. 1108.84 s [unordered-containers] model: OK (0.03s)
  16850. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16851. 1108.84 s [unordered-containers] valid: OK (0.02s)
  16852. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16853. 1108.84 s [unordered-containers] unions
  16854. 1108.84 s [unordered-containers] model: OK (0.97s)
  16855. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16856. 1108.84 s [unordered-containers] valid: OK (0.51s)
  16857. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16858. 1108.84 s [unordered-containers] difference
  16859. 1108.84 s [unordered-containers] model: OK (0.04s)
  16860. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16861. 1108.84 s [unordered-containers] valid: OK (0.02s)
  16862. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16863. 1108.84 s [unordered-containers] differenceWith
  16864. 1108.84 s [unordered-containers] model: OK (0.07s)
  16865. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16866. 1108.84 s [unordered-containers] valid: OK (0.02s)
  16867. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16868. 1108.84 s [unordered-containers] intersection
  16869. 1108.84 s [unordered-containers] model: OK (0.04s)
  16870. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16871. 1108.84 s [unordered-containers] valid: OK (0.01s)
  16872. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16873. 1108.84 s [unordered-containers] intersectionWith
  16874. 1108.84 s [unordered-containers] model: OK (0.03s)
  16875. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16876. 1108.84 s [unordered-containers] valid: OK
  16877. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16878. 1108.84 s [unordered-containers] intersectionWithKey
  16879. 1108.84 s [unordered-containers] model: OK (0.22s)
  16880. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16881. 1108.84 s [unordered-containers] valid: OK (0.01s)
  16882. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16883. 1108.84 s [unordered-containers] compose
  16884. 1108.84 s [unordered-containers] valid: OK (0.02s)
  16885. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16886. 1108.84 s [unordered-containers] map
  16887. 1108.84 s [unordered-containers] model: OK (0.12s)
  16888. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16889. 1108.84 s [unordered-containers] valid: OK
  16890. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16891. 1108.84 s [unordered-containers] traverseWithKey
  16892. 1108.84 s [unordered-containers] model: OK (0.27s)
  16893. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16894. 1108.84 s [unordered-containers] valid: OK (0.01s)
  16895. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16896. 1108.84 s [unordered-containers] mapKeys
  16897. 1108.84 s [unordered-containers] model: OK
  16898. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16899. 1108.84 s [unordered-containers] valid: OK (0.33s)
  16900. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16901. 1108.84 s [unordered-containers] foldr: OK (0.03s)
  16902. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16903. 1108.84 s [unordered-containers] foldl: OK (0.02s)
  16904. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16905. 1108.84 s [unordered-containers] foldrWithKey: OK (0.02s)
  16906. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16907. 1108.84 s [unordered-containers] foldlWithKey: OK (0.01s)
  16908. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16909. 1108.84 s [unordered-containers] foldrWithKey': OK (0.02s)
  16910. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16911. 1108.84 s [unordered-containers] foldlWithKey': OK (0.01s)
  16912. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16913. 1108.84 s [unordered-containers] foldl': OK
  16914. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16915. 1108.84 s [unordered-containers] foldr': OK (0.02s)
  16916. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16917. 1108.84 s [unordered-containers] foldMapWithKey: OK (0.02s)
  16918. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16919. 1108.84 s [unordered-containers] filter
  16920. 1108.84 s [unordered-containers] model: OK (0.05s)
  16921. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16922. 1108.84 s [unordered-containers] valid: OK (0.04s)
  16923. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16924. 1108.84 s [unordered-containers] filterWithKey
  16925. 1108.84 s [unordered-containers] model: OK (1.12s)
  16926. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16927. 1108.84 s [unordered-containers] valid: OK (0.53s)
  16928. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16929. 1108.84 s [unordered-containers] mapMaybe
  16930. 1108.84 s [unordered-containers] model: OK (0.05s)
  16931. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16932. 1108.84 s [unordered-containers] valid: OK (0.02s)
  16933. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16934. 1108.84 s [unordered-containers] mapMaybeWithKey
  16935. 1108.84 s [unordered-containers] model: OK (1.03s)
  16936. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16937. 1108.84 s [unordered-containers] valid: OK (0.43s)
  16938. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16939. 1108.84 s [unordered-containers] elems: OK (0.02s)
  16940. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16941. 1108.84 s [unordered-containers] keys: OK (0.01s)
  16942. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16943. 1108.84 s [unordered-containers] fromList
  16944. 1108.84 s [unordered-containers] model: OK (0.02s)
  16945. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16946. 1108.84 s [unordered-containers] valid: OK
  16947. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16948. 1108.84 s [unordered-containers] fromListWith
  16949. 1108.84 s [unordered-containers] model: OK (0.03s)
  16950. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16951. 1108.84 s [unordered-containers] valid: OK
  16952. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16953. 1108.84 s [unordered-containers] fromListWithKey
  16954. 1108.84 s [unordered-containers] model: OK (0.01s)
  16955. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16956. 1108.84 s [unordered-containers] valid: OK
  16957. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16958. 1108.84 s [unordered-containers] toList: OK (0.03s)
  16959. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16960. 1108.84 s [unordered-containers] Data.HashMap.Strict
  16961. 1108.84 s [unordered-containers] instances
  16962. 1108.84 s [unordered-containers] Eq
  16963. 1108.84 s [unordered-containers] ==: OK (0.04s)
  16964. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16965. 1108.84 s [unordered-containers] /=: OK (0.03s)
  16966. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16967. 1108.84 s [unordered-containers] Ord
  16968. 1108.84 s [unordered-containers] compare reflexive: OK (0.02s)
  16969. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16970. 1108.84 s [unordered-containers] compare transitive: OK (0.08s)
  16971. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16972. 1108.84 s [unordered-containers] compare antisymmetric: OK (0.05s)
  16973. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16974. 1108.84 s [unordered-containers] Ord => Eq: OK (0.04s)
  16975. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16976. 1108.84 s [unordered-containers] Read/Show: OK (0.30s)
  16977. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16978. 1108.84 s [unordered-containers] Functor: OK (0.09s)
  16979. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16980. 1108.84 s [unordered-containers] Foldable: OK (0.03s)
  16981. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16982. 1108.84 s [unordered-containers] Bifoldable
  16983. 1108.84 s [unordered-containers] bifoldMap: OK (0.03s)
  16984. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16985. 1108.84 s [unordered-containers] bifoldr: OK (0.01s)
  16986. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16987. 1108.84 s [unordered-containers] bifoldl: OK (0.03s)
  16988. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16989. 1108.84 s [unordered-containers] Hashable: OK (0.04s)
  16990. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16991. 1108.84 s [unordered-containers] empty
  16992. 1108.84 s [unordered-containers] valid: OK
  16993. 1108.84 s [unordered-containers] +++ OK, passed 1 test.
  16994. 1108.84 s [unordered-containers] singleton
  16995. 1108.84 s [unordered-containers] valid: OK
  16996. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16997. 1108.84 s [unordered-containers] size: OK (0.03s)
  16998. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  16999. 1108.84 s [unordered-containers] member: OK (0.01s)
  17000. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  17001. 1108.84 s [unordered-containers] lookup: OK (0.04s)
  17002. 1108.84 s [unordered-containers] +++ OK, passed 100 tests.
  17003. 1108.85 s [unordered-containers] !?: OK (0.02s)
  17004. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17005. 1108.85 s [unordered-containers] insert
  17006. 1108.85 s [unordered-containers] model: OK (0.03s)
  17007. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17008. 1108.85 s [unordered-containers] valid: OK (0.02s)
  17009. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17010. 1108.85 s [unordered-containers] insertWith
  17011. 1108.85 s [unordered-containers] insertWith: OK (0.02s)
  17012. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17013. 1108.85 s [unordered-containers] valid: OK (0.03s)
  17014. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17015. 1108.85 s [unordered-containers] delete
  17016. 1108.85 s [unordered-containers] model: OK (0.03s)
  17017. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17018. 1108.85 s [unordered-containers] valid: OK (0.02s)
  17019. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17020. 1108.85 s [unordered-containers] adjust
  17021. 1108.85 s [unordered-containers] model: OK (0.02s)
  17022. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17023. 1108.85 s [unordered-containers] valid: OK (0.03s)
  17024. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17025. 1108.85 s [unordered-containers] update
  17026. 1108.85 s [unordered-containers] model: OK (0.02s)
  17027. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17028. 1108.85 s [unordered-containers] valid: OK (0.02s)
  17029. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17030. 1108.85 s [unordered-containers] alter
  17031. 1108.85 s [unordered-containers] model: OK (0.02s)
  17032. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17033. 1108.85 s [unordered-containers] valid: OK (0.02s)
  17034. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17035. 1108.85 s [unordered-containers] alterF
  17036. 1108.85 s [unordered-containers] model
  17037. 1108.85 s [unordered-containers] []: OK (0.23s)
  17038. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17039. 1108.85 s [unordered-containers] adjust: OK (0.03s)
  17040. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17041. 1108.85 s [unordered-containers] insert: OK
  17042. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17043. 1108.85 s [unordered-containers] insertWith: OK (0.01s)
  17044. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17045. 1108.85 s [unordered-containers] delete: OK (0.04s)
  17046. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17047. 1108.85 s [unordered-containers] lookup: OK (0.02s)
  17048. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17049. 1108.85 s [unordered-containers] valid: OK (0.04s)
  17050. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17051. 1108.85 s [unordered-containers] isSubmapOf
  17052. 1108.85 s [unordered-containers] model: OK (0.03s)
  17053. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17054. 1108.85 s [unordered-containers] m ⊆ m: OK (0.02s)
  17055. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17056. 1108.85 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  17057. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17058. 1108.85 s [unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
  17059. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17060. 1108.85 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.04s)
  17061. 1108.85 s [unordered-containers] +++ OK, passed 100 tests; 157 discarded.
  17062. 1108.85 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  17063. 1108.85 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  17064. 1108.85 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  17065. 1108.85 s [unordered-containers] +++ OK, passed 100 tests; 20 discarded.
  17066. 1108.85 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.01s)
  17067. 1108.85 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17068. 1108.85 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.01s)
  17069. 1108.85 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  17070. 1108.85 s [unordered-containers] union
  17071. 1108.85 s [unordered-containers] model: OK (0.05s)
  17072. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17073. 1108.85 s [unordered-containers] valid: OK (0.06s)
  17074. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17075. 1108.85 s [unordered-containers] unionWith
  17076. 1108.85 s [unordered-containers] model: OK (0.07s)
  17077. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17078. 1108.85 s [unordered-containers] valid: OK (0.06s)
  17079. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17080. 1108.85 s [unordered-containers] unionWithKey
  17081. 1108.85 s [unordered-containers] model: OK (0.16s)
  17082. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17083. 1108.85 s [unordered-containers] valid: OK (0.08s)
  17084. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17085. 1108.85 s [unordered-containers] unions
  17086. 1108.85 s [unordered-containers] model: OK (0.87s)
  17087. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17088. 1108.85 s [unordered-containers] valid: OK (0.60s)
  17089. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17090. 1108.85 s [unordered-containers] difference
  17091. 1108.85 s [unordered-containers] model: OK (0.04s)
  17092. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17093. 1108.85 s [unordered-containers] valid: OK (0.03s)
  17094. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17095. 1108.85 s [unordered-containers] differenceWith
  17096. 1108.85 s [unordered-containers] model: OK (0.11s)
  17097. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17098. 1108.85 s [unordered-containers] valid: OK (0.08s)
  17099. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17100. 1108.85 s [unordered-containers] intersection
  17101. 1108.85 s [unordered-containers] model: OK (0.06s)
  17102. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17103. 1108.85 s [unordered-containers] valid: OK (0.06s)
  17104. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17105. 1108.85 s [unordered-containers] intersectionWith
  17106. 1108.85 s [unordered-containers] model: OK (0.05s)
  17107. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17108. 1108.85 s [unordered-containers] valid: OK (0.03s)
  17109. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17110. 1108.85 s [unordered-containers] intersectionWithKey
  17111. 1108.85 s [unordered-containers] model: OK (0.14s)
  17112. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17113. 1108.85 s [unordered-containers] valid: OK (0.06s)
  17114. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17115. 1108.85 s [unordered-containers] compose
  17116. 1108.85 s [unordered-containers] valid: OK (0.04s)
  17117. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17118. 1108.85 s [unordered-containers] map
  17119. 1108.85 s [unordered-containers] model: OK (0.09s)
  17120. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17121. 1108.85 s [unordered-containers] valid: OK (0.10s)
  17122. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17123. 1108.85 s [unordered-containers] traverseWithKey
  17124. 1108.85 s [unordered-containers] model: OK (0.14s)
  17125. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17126. 1108.85 s [unordered-containers] valid: OK (0.03s)
  17127. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17128. 1108.85 s [unordered-containers] mapKeys
  17129. 1108.85 s [unordered-containers] model: OK (0.01s)
  17130. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17131. 1108.85 s [unordered-containers] valid: OK (0.54s)
  17132. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17133. 1108.85 s [unordered-containers] foldr: OK
  17134. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17135. 1108.85 s [unordered-containers] foldl: OK (0.02s)
  17136. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17137. 1108.85 s [unordered-containers] foldrWithKey: OK (0.03s)
  17138. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17139. 1108.85 s [unordered-containers] foldlWithKey: OK (0.03s)
  17140. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17141. 1108.85 s [unordered-containers] foldrWithKey': OK (0.03s)
  17142. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17143. 1108.85 s [unordered-containers] foldlWithKey': OK (0.02s)
  17144. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17145. 1108.85 s [unordered-containers] foldl': OK (0.02s)
  17146. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17147. 1108.85 s [unordered-containers] foldr': OK (0.02s)
  17148. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17149. 1108.85 s [unordered-containers] foldMapWithKey: OK (0.04s)
  17150. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17151. 1108.85 s [unordered-containers] filter
  17152. 1108.85 s [unordered-containers] model: OK (0.09s)
  17153. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17154. 1108.85 s [unordered-containers] valid: OK (0.07s)
  17155. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17156. 1108.85 s [unordered-containers] filterWithKey
  17157. 1108.85 s [unordered-containers] model: OK (0.78s)
  17158. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17159. 1108.85 s [unordered-containers] valid: OK (0.57s)
  17160. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17161. 1108.85 s [unordered-containers] mapMaybe
  17162. 1108.85 s [unordered-containers] model: OK (0.11s)
  17163. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17164. 1108.85 s [unordered-containers] valid: OK (0.04s)
  17165. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17166. 1108.85 s [unordered-containers] mapMaybeWithKey
  17167. 1108.85 s [unordered-containers] model: OK (0.81s)
  17168. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17169. 1108.85 s [unordered-containers] valid: OK (0.50s)
  17170. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17171. 1108.85 s [unordered-containers] elems: OK (0.03s)
  17172. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17173. 1108.85 s [unordered-containers] keys: OK (0.04s)
  17174. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17175. 1108.85 s [unordered-containers] fromList
  17176. 1108.85 s [unordered-containers] model: OK (0.02s)
  17177. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17178. 1108.85 s [unordered-containers] valid: OK
  17179. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17180. 1108.85 s [unordered-containers] fromListWith
  17181. 1108.85 s [unordered-containers] model: OK (0.01s)
  17182. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17183. 1108.85 s [unordered-containers] valid: OK (0.02s)
  17184. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17185. 1108.85 s [unordered-containers] fromListWithKey
  17186. 1108.85 s [unordered-containers] model: OK
  17187. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17188. 1108.85 s [unordered-containers] valid: OK (0.04s)
  17189. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17190. 1108.85 s [unordered-containers] toList: OK
  17191. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17192. 1108.85 s [unordered-containers] Data.HashSet
  17193. 1108.85 s [unordered-containers] instances
  17194. 1108.85 s [unordered-containers] Eq
  17195. 1108.85 s [unordered-containers] ==: OK (0.03s)
  17196. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17197. 1108.85 s [unordered-containers] == permutations: OK (0.02s)
  17198. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17199. 1108.85 s [unordered-containers] /=: OK (0.04s)
  17200. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17201. 1108.85 s [unordered-containers] Ord
  17202. 1108.85 s [unordered-containers] compare reflexive: OK (0.01s)
  17203. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17204. 1108.85 s [unordered-containers] compare transitive: OK (0.05s)
  17205. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17206. 1108.85 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17207. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17208. 1108.85 s [unordered-containers] Ord => Eq: OK (0.02s)
  17209. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17210. 1108.85 s [unordered-containers] Read/Show: OK (0.31s)
  17211. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17212. 1108.85 s [unordered-containers] Foldable: OK (0.02s)
  17213. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17214. 1108.85 s [unordered-containers] Hashable: OK (0.03s)
  17215. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17216. 1108.85 s [unordered-containers] size: OK (0.03s)
  17217. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17218. 1108.85 s [unordered-containers] member: OK (0.03s)
  17219. 1108.85 s [unordered-containers] +++ OK, passed 100 tests.
  17220. 1108.86 s [unordered-containers] insert: OK (0.01s)
  17221. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17222. 1108.86 s [unordered-containers] delete: OK (0.02s)
  17223. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17224. 1108.86 s [unordered-containers] union: OK (0.05s)
  17225. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17226. 1108.86 s [unordered-containers] map: OK (0.52s)
  17227. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17228. 1108.86 s [unordered-containers] foldr: OK (0.02s)
  17229. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17230. 1108.86 s [unordered-containers] foldl': OK (0.01s)
  17231. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17232. 1108.86 s [unordered-containers] filter: OK (0.56s)
  17233. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17234. 1108.86 s [unordered-containers] toList: OK (0.06s)
  17235. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17236. 1108.86 s [unordered-containers] Data.HashMap.Internal.List
  17237. 1108.86 s [unordered-containers] isPermutationBy: OK (0.02s)
  17238. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17239. 1108.86 s [unordered-containers] isPermutationBy of different length: OK
  17240. 1108.86 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  17241. 1108.86 s [unordered-containers] pUnorderedCompare: OK (0.08s)
  17242. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17243. 1108.86 s [unordered-containers] modelUnorderedCompare
  17244. 1108.86 s [unordered-containers] reflexive: OK (0.02s)
  17245. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17246. 1108.86 s [unordered-containers] anti-symmetric: OK (0.02s)
  17247. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17248. 1108.86 s [unordered-containers] transitive: OK (0.03s)
  17249. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17250. 1108.86 s [unordered-containers] Regression tests
  17251. 1108.86 s [unordered-containers] issue32: OK
  17252. 1108.86 s [unordered-containers] issue39a: OK
  17253. 1108.86 s [unordered-containers] issue39b: OK
  17254. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17255. 1108.86 s [unordered-containers] issue254 lazy: OK (0.05s)
  17256. 1108.86 s [unordered-containers] issue254 strict: OK (0.05s)
  17257. 1108.86 s [unordered-containers] issue379
  17258. 1108.86 s [unordered-containers] Lazy.unionWith: OK
  17259. 1108.86 s [unordered-containers] union: OK (0.01s)
  17260. 1108.86 s [unordered-containers] Strict.unionWith: OK
  17261. 1108.86 s [unordered-containers] Strict.unionWithKey: OK
  17262. 1108.86 s [unordered-containers] issue381
  17263. 1108.86 s [unordered-containers] mapMaybe: OK
  17264. 1108.86 s [unordered-containers] mapMaybeWithKey: OK
  17265. 1108.86 s [unordered-containers] issue382: OK
  17266. 1108.86 s [unordered-containers] issue383: OK
  17267. 1108.86 s [unordered-containers] issue420: OK
  17268. 1108.86 s [unordered-containers] issue491
  17269. 1108.86 s [unordered-containers] 1: OK
  17270. 1108.86 s [unordered-containers] 2: OK
  17271. 1108.86 s [unordered-containers] 3: OK
  17272. 1108.86 s [unordered-containers] Strictness
  17273. 1108.86 s [unordered-containers] HashMap.Strict
  17274. 1108.86 s [unordered-containers] singleton is key-strict: OK (0.02s)
  17275. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17276. 1108.86 s [unordered-containers] singleton is value-strict: OK
  17277. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17278. 1108.86 s [unordered-containers] member is key-strict: OK
  17279. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17280. 1108.86 s [unordered-containers] lookup is key-strict: OK
  17281. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17282. 1108.86 s [unordered-containers] lookupDefault is key-strict: OK
  17283. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17284. 1108.86 s [unordered-containers] findWithDefault is key-strict: OK
  17285. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17286. 1108.86 s [unordered-containers] ! is key-strict: OK
  17287. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17288. 1108.86 s [unordered-containers] delete is key-strict: OK
  17289. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17290. 1108.86 s [unordered-containers] adjust is key-strict: OK
  17291. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17292. 1108.86 s [unordered-containers] adjust is value-strict: OK (0.03s)
  17293. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17294. 1108.86 s [unordered-containers] insert is key-strict: OK
  17295. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17296. 1108.86 s [unordered-containers] insert is value-strict: OK
  17297. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17298. 1108.86 s [unordered-containers] insertWith is key-strict: OK
  17299. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17300. 1108.86 s [unordered-containers] insertWith is value-strict: OK (0.01s)
  17301. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17302. 1108.86 s [unordered-containers] fromList is key-strict: OK
  17303. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17304. 1108.86 s [unordered-containers] fromList is value-strict: OK
  17305. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17306. 1108.86 s [unordered-containers] fromListWith is key-strict: OK
  17307. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17308. 1108.86 s [unordered-containers] fromListWith is value-strict: OK
  17309. 1108.86 s [unordered-containers] +++ OK, passed 100 tests.
  17310. 1108.86 s [unordered-containers]
  17311. 1108.86 s [unordered-containers] All 257 tests passed (1.44s)
  17312. 1108.86 s [unordered-containers] Test suite unordered-containers-tests: PASS
  17313. 1108.86 s [unordered-containers] Test suite logged to:
  17314. 1108.86 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  17315. 1108.86 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  17316. 1108.86 s [unordered-containers] checkPhase completed in 52 seconds
  17317. 1108.86 s [unordered-containers] Phase: haddockPhase
  17318. 1108.89 s [shellcheck] Phase: unpackPhase
  17319. 1108.89 s [shellcheck] unpacking source archive /nix/store/0y569php6xr1v629bbggizl1ba1mrf5b-ShellCheck-0.11.0.tar.gz
  17320. 1108.90 s [shellcheck] source root is ShellCheck-0.11.0
  17321. 1108.91 s [shellcheck] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "ShellCheck-0.11.0/test/shellcheck.hs"
  17322. 1108.91 s [shellcheck] Phase: patchPhase
  17323. 1108.92 s [shellcheck] Phase: updateAutotoolsGnuConfigScriptsPhase
  17324. 1108.92 s [shellcheck] Phase: configurePhase
  17325. 1108.94 s [shellcheck] no configure script, doing nothing
  17326. 1108.94 s [shellcheck] Phase: buildPhase
  17327. 1109.01 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  17328. 1109.01 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  17329. 1109.17 s [shellcheck] Phase: installPhase
  17330. 1109.19 s [shellcheck] Phase: fixupPhase
  17331. 1109.42 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
  17332. 1109.42 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  17333. 1109.42 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17334. 1109.42 s [unordered-containers] |
  17335. 1109.42 s [shellcheck] shrinking /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin/shellcheck
  17336. 1109.42 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17337. 1109.42 s [unordered-containers] | ^^^^^^^^^^
  17338. 1109.42 s [unordered-containers]
  17339. 1109.43 s [shellcheck] checking for references to /build/ in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin...
  17340. 1109.45 s [shellcheck] patching script interpreter paths in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin
  17341. 1109.45 s [shellcheck] stripping (with command strip and flags -S -p) in /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin/bin
  17342. 1109.48 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
  17343. 1109.48 s [shellcheck] checking for references to /build/ in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man...
  17344. 1109.49 s [shellcheck] gzipping man pages under /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man/share/man/
  17345. 1109.50 s [shellcheck] patching script interpreter paths in /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
  17346. 1109.51 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
  17347. 1109.51 s [shellcheck] checking for references to /build/ in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc...
  17348. 1109.51 s [shellcheck] patching script interpreter paths in /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc
  17349. 1109.52 s [shellcheck] shrinking RPATHs of ELF executables and libraries in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
  17350. 1109.52 s [shellcheck] checking for references to /build/ in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0...
  17351. 1109.53 s [shellcheck] patching script interpreter paths in /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0
  17352. 1109.60 s [shellcheck:post-build] Uploading to cachix cache "sellout": /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0 /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
  17353. 1110.12 s [shellcheck:post-build] Pushing 4 paths (26 are already present) using zstd to cache sellout ⏳
  17354. 1110.12 s [shellcheck:post-build]
  17355. 1110.48 s [shellcheck:post-build] Pushing /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0 (544.00 B)
  17356. 1110.57 s [shellcheck:post-build] Pushing /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc (21.28 KiB)
  17357. 1110.65 s [shellcheck:post-build] Pushing /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man (6.52 KiB)
  17358. 1110.65 s [shellcheck:post-build] Pushing /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin (7.53 MiB)
  17359. 1111.82 s [shellcheck:post-build]
  17360. 1111.82 s [shellcheck:post-build] All done.
  17361. 1111.84 s [shellcheck:post-build] Uploading to the NixCI cache: /nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0 /nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin /nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc /nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man
  17362. 1111.89 s [shellcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17363. 1112.14 s [shellcheck:post-build] copying 4 paths...
  17364. 1112.14 s [shellcheck:post-build] copying path '/nix/store/k11wy84pjb36rcpmz327ph29m2a1c92s-shellcheck-0.11.0-doc' to 'https://cache.nix-ci.com'...
  17365. 1112.14 s [shellcheck:post-build] copying path '/nix/store/42acbjqxrq13cwjccjnqjs6ih4s3v5cf-shellcheck-0.11.0-bin' to 'https://cache.nix-ci.com'...
  17366. 1112.14 s [shellcheck:post-build] copying path '/nix/store/wnrx5kpnb68pxkjx89wh402zzik90ykj-shellcheck-0.11.0-man' to 'https://cache.nix-ci.com'...
  17367. 1114.20 s [shellcheck:post-build] copying path '/nix/store/0lmcmi3d6zdmqm19mqr9kx9wl2gd1p6w-shellcheck-0.11.0' to 'https://cache.nix-ci.com'...
  17368. 1114.47 s [shellcheck:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17369. 1114.72 s [shellcheck:post-build] copying 1 paths...
  17370. 1114.72 s [shellcheck:post-build] copying path '/nix/store/10xzxxdy2m2dv7z9mzid70kwihb0p0z3-shellcheck-0.11.0.drv' to 'https://cache.nix-ci.com'...
  17371. 1114.94 s Progress: 29 of 40 built (2 building), 760 of 760 downloaded from cache
  17372. 1114.99 s Building /nix/store/na71b1qblfcv0x84nz68yybh61b6qjlv-bash-language-server-5.6.0.drv
  17373. 1114.99 s [haskell-language-server] Preprocessing library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0...
  17374. 1114.99 s [haskell-language-server] Building library 'hls-code-range-plugin' for haskell-language-server-2.12.0.0...
  17375. 1114.99 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 )
  17376. 1114.99 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 )
  17377. 1114.99 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  17378. 1114.99 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  17379. 1114.99 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17380. 1114.99 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17381. 1114.99 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17382. 1114.99 s [unordered-containers] |
  17383. 1114.99 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17384. 1114.99 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17385. 1114.99 s [unordered-containers]
  17386. 1114.99 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  17387. 1114.99 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  17388. 1114.99 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  17389. 1114.99 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  17390. 1114.99 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  17391. 1114.99 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  17392. 1114.99 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  17393. 1114.99 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  17394. 1114.99 s [unordered-containers] Haddock coverage:
  17395. 1114.99 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  17396. 1114.99 s [unordered-containers] Missing documentation for:
  17397. 1114.99 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  17398. 1114.99 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  17399. 1114.99 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  17400. 1114.99 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  17401. 1114.99 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  17402. 1114.99 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  17403. 1114.99 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  17404. 1114.99 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  17405. 1114.99 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  17406. 1114.99 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  17407. 1114.99 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  17408. 1114.99 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  17409. 1114.99 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  17410. 1114.99 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  17411. 1114.99 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  17412. 1114.99 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  17413. 1114.99 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  17414. 1114.99 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  17415. 1114.99 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  17416. 1114.99 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  17417. 1114.99 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  17418. 1114.99 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  17419. 1114.99 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  17420. 1114.99 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  17421. 1114.99 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  17422. 1114.99 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  17423. 1114.99 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  17424. 1114.99 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  17425. 1114.99 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  17426. 1114.99 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  17427. 1114.99 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  17428. 1114.99 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  17429. 1114.99 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  17430. 1114.99 s [unordered-containers] Missing documentation for:
  17431. 1114.99 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  17432. 1114.99 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  17433. 1114.99 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  17434. 1114.99 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  17435. 1114.99 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  17436. 1114.99 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  17437. 1114.99 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17438. 1114.99 s [unordered-containers] by specifying the type/value namespace explicitly.
  17439. 1114.99 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  17440. 1114.99 s [unordered-containers] Warning: 'at' is out of scope.
  17441. 1114.99 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17442. 1114.99 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  17443. 1114.99 s [unordered-containers] Missing documentation for:
  17444. 1114.99 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  17445. 1114.99 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  17446. 1114.99 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  17447. 1114.99 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  17448. 1114.99 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  17449. 1114.99 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  17450. 1114.99 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  17451. 1114.99 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  17452. 1114.99 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  17453. 1114.99 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  17454. 1114.99 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  17455. 1114.99 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  17456. 1114.99 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  17457. 1114.99 s [unordered-containers] Missing documentation for:
  17458. 1114.99 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  17459. 1114.99 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  17460. 1114.99 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  17461. 1114.99 s [unordered-containers] Warning: 'lookup' is out of scope.
  17462. 1114.99 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17463. 1114.99 s [unordered-containers] Warning: 'at' is out of scope.
  17464. 1114.99 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17465. 1114.99 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  17466. 1114.99 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17467. 1114.99 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17468. 1114.99 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17469. 1114.99 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17470. 1114.99 s [unordered-containers] by specifying the type/value namespace explicitly.
  17471. 1114.99 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17472. 1114.99 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  17473. 1114.99 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17474. 1114.99 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17475. 1114.99 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17476. 1114.99 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17477. 1114.99 s [unordered-containers] by specifying the type/value namespace explicitly.
  17478. 1114.99 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17479. 1114.99 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  17480. 1114.99 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  17481. 1114.99 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  17482. 1114.99 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  17483. 1114.99 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17484. 1114.99 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  17485. 1114.99 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17486. 1114.99 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  17487. 1114.99 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17488. 1114.99 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  17489. 1114.99 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17490. 1114.99 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  17491. 1114.99 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17492. 1114.99 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  17493. 1114.99 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17494. 1115.00 s [bash-language-server] Using versionCheckHook
  17495. 1115.06 s [bash-language-server] Phase: unpackPhase
  17496. 1115.07 s [bash-language-server] unpacking source archive /nix/store/lxydhrakpk9ccbjzavdgm3f3imkypnw2-source
  17497. 1115.10 s [bash-language-server] source root is source
  17498. 1115.11 s [bash-language-server] Phase: patchPhase
  17499. 1115.11 s [bash-language-server] Phase: updateAutotoolsGnuConfigScriptsPhase
  17500. 1115.12 s [bash-language-server] Phase: configurePhase
  17501. 1115.13 s [bash-language-server] no configure script, doing nothing
  17502. 1115.13 s [bash-language-server] Executing pnpmConfigHook
  17503. 1115.56 s [bash-language-server] Found 'pnpm' with version '10.28.0'
  17504. 1115.56 s [bash-language-server] Using fetcherVersion: 3
  17505. 1115.56 s [bash-language-server] Configuring pnpm store
  17506. 1115.64 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  17507. 1115.64 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  17508. 1115.69 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  17509. 1115.70 s [unordered-containers] Phase: installPhase
  17510. 1115.76 s [unordered-containers] Installing library in /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  17511. 1115.93 s [bash-language-server] /build /build/source
  17512. 1116.08 s [unordered-containers] Phase: fixupPhase
  17513. 1116.09 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1
  17514. 1116.10 s [unordered-containers] shrinking /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHSunordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD-ghc9.10.2.so
  17515. 1116.11 s [unordered-containers] checking for references to /build/ in /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1...
  17516. 1116.13 s [unordered-containers] patching script interpreter paths in /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1
  17517. 1116.13 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1/lib
  17518. 1116.22 s [bash-language-server] /build/source
  17519. 1116.24 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc
  17520. 1116.25 s [unordered-containers] checking for references to /build/ in /nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc...
  17521. 1116.27 s [unordered-containers] patching script interpreter paths in /nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc
  17522. 1116.28 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 )
  17523. 1116.39 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1 /nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc
  17524. 1116.93 s [unordered-containers:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  17525. 1116.93 s [unordered-containers:post-build]
  17526. 1117.30 s [unordered-containers:post-build] Pushing /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1 (9.33 MiB)
  17527. 1117.45 s [unordered-containers:post-build] Pushing /nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc (4.46 MiB)
  17528. 1118.51 s [unordered-containers:post-build]
  17529. 1118.51 s [unordered-containers:post-build] All done.
  17530. 1118.53 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1 /nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc
  17531. 1118.57 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17532. 1118.79 s [unordered-containers:post-build] copying 2 paths...
  17533. 1118.79 s [unordered-containers:post-build] copying path '/nix/store/zrzh54s83frh8kmff8g5ajzd9rkzykk7-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
  17534. 1119.60 s [unordered-containers:post-build] copying path '/nix/store/kanb5qwghah3vmhgc7jrs252rvc6f94r-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  17535. 1121.92 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17536. 1122.20 s [unordered-containers:post-build] copying 1 paths...
  17537. 1122.20 s [unordered-containers:post-build] copying path '/nix/store/ri2p09calc82jm0z4wv62k31c3g6hzp8-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  17538. 1122.43 s Progress: 30 of 40 built (2 building), 760 of 760 downloaded from cache
  17539. 1122.49 s Building /nix/store/hkha0wr3jw3ghsrbljbl37bwlzm8x0gy-quickcheck-instances-0.3.33.drv
  17540. 1122.49 s [bash-language-server] Installing dependencies
  17541. 1122.49 s [bash-language-server] Lockfile is up to date, resolution step is skipped
  17542. 1122.49 s [bash-language-server] Progress: resolved 1, reused 0, downloaded 0, added 0
  17543. 1122.49 s [bash-language-server] . | +416
  17544. 1122.49 s [bash-language-server] Progress: resolved 1, reused 0, downloaded 0, added 0
  17545. 1122.49 s [bash-language-server] Progress: resolved 416, reused 415, downloaded 0, added 8
  17546. 1122.49 s [bash-language-server] Progress: resolved 416, reused 416, downloaded 0, added 403
  17547. 1122.49 s [bash-language-server] Progress: resolved 416, reused 416, downloaded 0, added 416, done
  17548. 1122.49 s [bash-language-server] Done in 1s using pnpm v10.28.0
  17549. 1122.49 s [bash-language-server] Patching scripts
  17550. 1122.49 s [bash-language-server] patching script interpreter paths in node_modules/@types node_modules/@typescript-eslint node_modules/cross-spawn node_modules/eslint node_modules/eslint-config-prettier node_modules/eslint-plugin-jest node_modules/eslint-plugin-prettier node_modules/eslint-plugin-simple-import-sort node_modules/eslint-plugin-sort-class-members node_modules/jest node_modules/prettier node_modules/ts-jest node_modules/typescript node_modules/vscode-languageserver node_modules/vscode-languageserver-textdocument node_modules/.bin node_modules/.modules.yaml node_modules/.pnpm node_modules/.pnpm-workspace-state-v1.json
  17551. 1122.49 s [bash-language-server] node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17552. 1122.49 s [bash-language-server] node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17553. 1122.49 s [bash-language-server] node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17554. 1122.49 s [bash-language-server] node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17555. 1122.49 s [bash-language-server] node_modules/.bin/ts-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17556. 1122.49 s [bash-language-server] node_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17557. 1122.49 s [bash-language-server] node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17558. 1122.49 s [bash-language-server] node_modules/.bin/eslint-config-prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17559. 1122.49 s [bash-language-server] node_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17560. 1122.49 s [bash-language-server] node_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17561. 1122.49 s [bash-language-server] node_modules/.pnpm/eslint-plugin-prettier@4.2.1_eslint-config-prettier@9.1.0_eslint@8.57.1__eslint@8.57.1_prettier@2.8.8/node_modules/eslint-plugin-prettier/node_modules/.bin/eslint-config-prettier: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17562. 1122.49 s [bash-language-server] node_modules/.pnpm/exit@0.1.2/node_modules/exit/test/fixtures/create-files.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
  17563. 1122.49 s [bash-language-server] node_modules/.pnpm/eslint-plugin-jest@28.11.0_@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+p_bba564ecab3f9dda53acf7b3e4516a01/node_modules/eslint-plugin-jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17564. 1122.49 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 )
  17565. 1122.49 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 )
  17566. 1122.49 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 )
  17567. 1122.49 s [bash-language-server] node_modules/.pnpm/eslint-plugin-jest@28.11.0_@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+p_bba564ecab3f9dda53acf7b3e4516a01/node_modules/eslint-plugin-jest/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17568. 1122.49 s [bash-language-server] node_modules/.pnpm/espree@9.6.1/node_modules/espree/node_modules/.bin/acorn: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17569. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17570. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+template@7.22.5/node_modules/@babel/template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17571. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17572. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17573. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+type-utils@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/type-utils/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17574. 1122.49 s [bash-language-server] node_modules/.pnpm/esprima@4.0.1/node_modules/esprima/bin/esvalidate.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17575. 1122.49 s [bash-language-server] node_modules/.pnpm/esprima@4.0.1/node_modules/esprima/bin/esparse.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17576. 1122.49 s [bash-language-server] node_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/bin/jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17577. 1122.49 s [bash-language-server] node_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17578. 1122.49 s [bash-language-server] node_modules/.pnpm/jest@29.7.0_@types+node@18.19.86/node_modules/jest/node_modules/.bin/import-local-fixture: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17579. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+template@7.22.15/node_modules/@babel/template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17580. 1122.49 s [bash-language-server] node_modules/.pnpm/@types+babel__template@7.4.1/node_modules/@types/babel__template/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17581. 1122.49 s [bash-language-server] node_modules/.pnpm/jest-resolve@29.7.0/node_modules/jest-resolve/node_modules/.bin/resolve: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17582. 1122.49 s [bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@6.0.0/node_modules/istanbul-lib-instrument/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17583. 1122.49 s [bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@6.0.0/node_modules/istanbul-lib-instrument/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17584. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17585. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17586. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+typescript-estree@7.18.0_typescript@5.6.3/node_modules/@typescript-eslint/typescript-estree/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17587. 1122.49 s [bash-language-server] node_modules/.pnpm/jake@10.9.2/node_modules/jake/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17588. 1122.49 s [bash-language-server] node_modules/.pnpm/jake@10.9.2/node_modules/jake/bin/bash_completion.sh: interpreter directive changed from "#!/bin/bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
  17589. 1122.49 s [bash-language-server] node_modules/.pnpm/acorn-jsx@5.3.2_acorn@8.9.0/node_modules/acorn-jsx/node_modules/.bin/acorn: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17590. 1122.49 s [bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17591. 1122.49 s [bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17592. 1122.49 s [bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17593. 1122.49 s [bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17594. 1122.49 s [bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/json5: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17595. 1122.49 s [bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/ejs: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17596. 1122.49 s [bash-language-server] node_modules/.pnpm/ts-jest@29.3.2_@babel+core@7.22.6_@jest+transform@29.7.0_@jest+types@29.6.3_babel-jest@_d88d08811041576873e02318200604f4/node_modules/ts-jest/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17597. 1122.49 s [bash-language-server] node_modules/.pnpm/@eslint+eslintrc@2.1.4/node_modules/@eslint/eslintrc/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17598. 1122.49 s [bash-language-server] node_modules/.pnpm/prettier@2.8.8/node_modules/prettier/bin-prettier.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17599. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17600. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17601. 1122.49 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+parser@7.18.0_eslint@8.57.1_typescript@5.6.3/node_modules/@typescript-eslint/parser/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17602. 1122.49 s [bash-language-server] node_modules/.pnpm/json5@2.2.3/node_modules/json5/lib/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17603. 1122.49 s [bash-language-server] node_modules/.pnpm/typescript@5.6.3/node_modules/typescript/bin/tsc: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17604. 1122.49 s [bash-language-server] node_modules/.pnpm/typescript@5.6.3/node_modules/typescript/bin/tsserver: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17605. 1122.49 s [bash-language-server] node_modules/.pnpm/semver@6.3.1/node_modules/semver/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17606. 1122.49 s [bash-language-server] node_modules/.pnpm/js-yaml@4.1.0/node_modules/js-yaml/bin/js-yaml.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17607. 1122.49 s [bash-language-server] node_modules/.pnpm/update-browserslist-db@1.0.11_browserslist@4.21.9/node_modules/update-browserslist-db/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17608. 1122.49 s [bash-language-server] node_modules/.pnpm/update-browserslist-db@1.0.11_browserslist@4.21.9/node_modules/update-browserslist-db/node_modules/.bin/browserslist: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17609. 1122.49 s [bash-language-server] node_modules/.pnpm/make-dir@3.1.0/node_modules/make-dir/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17610. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+generator@7.22.5/node_modules/@babel/generator/node_modules/.bin/jsesc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17611. 1122.49 s [bash-language-server] node_modules/.pnpm/flat-cache@3.0.4/node_modules/flat-cache/node_modules/.bin/rimraf: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17612. 1122.49 s [bash-language-server] node_modules/.pnpm/vscode-languageserver@8.0.2/node_modules/vscode-languageserver/bin/installServerIntoExtension: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17613. 1122.49 s [bash-language-server] node_modules/.pnpm/jsesc@2.5.2/node_modules/jsesc/bin/jsesc: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17614. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+helper-compilation-targets@7.22.6_@babel+core@7.22.6/node_modules/@babel/helper-compilation-targets/node_modules/.bin/browserslist: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17615. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+helper-compilation-targets@7.22.6_@babel+core@7.22.6/node_modules/@babel/helper-compilation-targets/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17616. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+parser@7.22.6/node_modules/@babel/parser/bin/babel-parser.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17617. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+parser@7.23.0/node_modules/@babel/parser/bin/babel-parser.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17618. 1122.49 s [bash-language-server] node_modules/.pnpm/jest-snapshot@29.7.0/node_modules/jest-snapshot/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17619. 1122.49 s [bash-language-server] node_modules/.pnpm/browserslist@4.21.9/node_modules/browserslist/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17620. 1122.49 s [bash-language-server] node_modules/.pnpm/browserslist@4.21.9/node_modules/browserslist/node_modules/.bin/update-browserslist-db: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17621. 1122.49 s [bash-language-server] node_modules/.pnpm/acorn@8.9.0/node_modules/acorn/bin/acorn: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17622. 1122.49 s [bash-language-server] node_modules/.pnpm/editorconfig@2.0.1/node_modules/editorconfig/bin/editorconfig: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17623. 1122.49 s [bash-language-server] node_modules/.pnpm/editorconfig@2.0.1/node_modules/editorconfig/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17624. 1122.49 s [bash-language-server] node_modules/.pnpm/eslint-config-prettier@9.1.0_eslint@8.57.1/node_modules/eslint-config-prettier/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17625. 1122.49 s [bash-language-server] node_modules/.pnpm/eslint-config-prettier@9.1.0_eslint@8.57.1/node_modules/eslint-config-prettier/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17626. 1122.49 s [bash-language-server] node_modules/.pnpm/@babel+traverse@7.23.2/node_modules/@babel/traverse/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17627. 1122.49 s [bash-language-server] node_modules/.pnpm/@istanbuljs+load-nyc-config@1.1.0/node_modules/@istanbuljs/load-nyc-config/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17628. 1122.49 s [bash-language-server] node_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/bin/js-yaml.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17629. 1122.49 s [bash-language-server] node_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/node_modules/.bin/esparse: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17630. 1122.50 s [bash-language-server] node_modules/.pnpm/js-yaml@3.14.1/node_modules/js-yaml/node_modules/.bin/esvalidate: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17631. 1122.51 s [bash-language-server] node_modules/.pnpm/@types+babel__core@7.20.1/node_modules/@types/babel__core/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17632. 1122.53 s [bash-language-server] node_modules/.pnpm/eslint-plugin-simple-import-sort@12.1.1_eslint@8.57.1/node_modules/eslint-plugin-simple-import-sort/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17633. 1122.57 s [bash-language-server] node_modules/.pnpm/@babel+generator@7.23.0/node_modules/@babel/generator/node_modules/.bin/jsesc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17634. 1122.63 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  17635. 1122.63 s [bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@5.2.1/node_modules/istanbul-lib-instrument/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17636. 1122.75 s [quickcheck-instances] Build with /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2.
  17637. 1122.76 s [bash-language-server] node_modules/.pnpm/istanbul-lib-instrument@5.2.1/node_modules/istanbul-lib-instrument/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17638. 1123.20 s [bash-language-server] node_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/bin/jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17639. 1123.25 s [quickcheck-instances] Phase: unpackPhase
  17640. 1123.28 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  17641. 1123.29 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  17642. 1123.29 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  17643. 1123.30 s [quickcheck-instances] Phase: patchPhase
  17644. 1123.30 s [bash-language-server] node_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/node_modules/.bin/import-local-fixture: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17645. 1123.31 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  17646. 1123.32 s [bash-language-server] node_modules/.pnpm/jest-cli@29.7.0_@types+node@18.19.86/node_modules/jest-cli/node_modules/.bin/create-jest: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17647. 1123.33 s [quickcheck-instances] Phase: compileBuildDriverPhase
  17648. 1123.33 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.6aclWJqLJM/setup-package.conf.d -threaded
  17649. 1123.33 s [bash-language-server] node_modules/.pnpm/import-local@3.1.0/node_modules/import-local/fixtures/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17650. 1123.34 s [bash-language-server] node_modules/.pnpm/which@2.0.2/node_modules/which/bin/node-which: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17651. 1123.35 s [bash-language-server] node_modules/.pnpm/eslint-plugin-sort-class-members@1.21.0_eslint@8.57.1/node_modules/eslint-plugin-sort-class-members/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17652. 1123.36 s [bash-language-server] node_modules/.pnpm/eslint@8.57.1/node_modules/eslint/bin/eslint.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17653. 1123.37 s [bash-language-server] node_modules/.pnpm/eslint@8.57.1/node_modules/eslint/node_modules/.bin/js-yaml: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17654. 1123.38 s [bash-language-server] node_modules/.pnpm/rimraf@3.0.2/node_modules/rimraf/bin.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17655. 1123.38 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.6aclWJqLJM/Main.o )
  17656. 1123.38 s [bash-language-server] node_modules/.pnpm/semver@7.7.1/node_modules/semver/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17657. 1123.39 s [bash-language-server] node_modules/.pnpm/ejs@3.1.10/node_modules/ejs/bin/cli.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17658. 1123.40 s [bash-language-server] node_modules/.pnpm/ejs@3.1.10/node_modules/ejs/node_modules/.bin/jake: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17659. 1123.41 s [bash-language-server] node_modules/.pnpm/@eslint-community+eslint-utils@4.4.0_eslint@8.57.1/node_modules/@eslint-community/eslint-utils/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17660. 1123.42 s [quickcheck-instances] [2 of 2] Linking Setup
  17661. 1123.42 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17662. 1123.43 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/eslint: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17663. 1123.44 s [bash-language-server] node_modules/.pnpm/@typescript-eslint+eslint-plugin@7.18.0_@typescript-eslint+parser@7.18.0_eslint@8.57.1__e6014347be2ddc1aabad24015a3e65d1/node_modules/@typescript-eslint/eslint-plugin/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17664. 1123.45 s [bash-language-server] node_modules/.pnpm/ts-api-utils@1.3.0_typescript@5.6.3/node_modules/ts-api-utils/node_modules/.bin/tsc: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17665. 1123.46 s [bash-language-server] node_modules/.pnpm/ts-api-utils@1.3.0_typescript@5.6.3/node_modules/ts-api-utils/node_modules/.bin/tsserver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17666. 1123.47 s [bash-language-server] node_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/parser: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17667. 1123.47 s [bash-language-server] node_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/semver: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17668. 1123.48 s [bash-language-server] node_modules/.pnpm/@babel+core@7.22.6/node_modules/@babel/core/node_modules/.bin/json5: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17669. 1123.49 s [bash-language-server] node_modules/.pnpm/@nicolo-ribaudo+semver-v6@6.3.3/node_modules/@nicolo-ribaudo/semver-v6/bin/semver.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17670. 1123.50 s [bash-language-server] node_modules/.pnpm/create-jest@29.7.0_@types+node@18.19.86/node_modules/create-jest/bin/create-jest.js: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17671. 1123.51 s [bash-language-server] node_modules/.pnpm/resolve@1.22.2/node_modules/resolve/bin/resolve: interpreter directive changed from "#!/usr/bin/env node" to "/nix/store/qbj1w0y8ilv183jhdv2ws6dfhzph680p-nodejs-22.22.2/bin/node"
  17672. 1123.52 s [bash-language-server] node_modules/.pnpm/cross-spawn@7.0.6/node_modules/cross-spawn/node_modules/.bin/node-which: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17673. 1123.53 s [bash-language-server] Finished pnpmConfigHook
  17674. 1123.53 s [bash-language-server] Phase: buildPhase
  17675. 1123.78 s [bash-language-server]
  17676. 1123.78 s [bash-language-server] > @ compile /build/source
  17677. 1123.78 s [bash-language-server] > tsc -b server
  17678. 1123.78 s [bash-language-server]
  17679. 1124.62 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  17680. 1124.69 s [quickcheck-instances] Phase: configurePhase
  17681. 1124.69 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.6aclWJqLJM/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
  17682. 1124.69 s [quickcheck-instances] Using Parsec parser
  17683. 1124.69 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  17684. 1125.00 s [haskell-language-server] Preprocessing library for haskell-language-server-2.12.0.0...
  17685. 1125.00 s [haskell-language-server] Building library for haskell-language-server-2.12.0.0...
  17686. 1125.17 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  17687. 1125.17 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  17688. 1125.17 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  17689. 1125.17 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.20.1.0
  17690. 1125.17 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  17691. 1125.17 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  17692. 1125.17 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  17693. 1125.17 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  17694. 1125.17 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  17695. 1125.17 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  17696. 1125.17 s [quickcheck-instances] integer-logarithms-1.0.4
  17697. 1125.17 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  17698. 1125.17 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  17699. 1125.17 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  17700. 1125.17 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  17701. 1125.17 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  17702. 1125.17 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  17703. 1125.17 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
  17704. 1125.17 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  17705. 1125.17 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  17706. 1125.17 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  17707. 1125.17 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
  17708. 1125.17 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  17709. 1125.17 s [quickcheck-instances] unordered-containers-0.2.20.1
  17710. 1125.17 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  17711. 1125.17 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  17712. 1125.17 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  17713. 1125.17 s [quickcheck-instances] Dependency base: using base-4.20.1.0
  17714. 1125.17 s [quickcheck-instances] Dependency containers: using containers-0.7
  17715. 1125.17 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  17716. 1125.17 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  17717. 1125.17 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  17718. 1125.17 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  17719. 1125.17 s [quickcheck-instances] Source component graph:
  17720. 1125.17 s [quickcheck-instances] component lib
  17721. 1125.17 s [quickcheck-instances] component test:self-test dependency lib
  17722. 1125.17 s [quickcheck-instances] Configured component graph:
  17723. 1125.17 s [quickcheck-instances] component quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  17724. 1125.17 s [quickcheck-instances] include OneTuple-0.4.2-GdyCtybON5lEHtGxAjq2VY
  17725. 1125.17 s [quickcheck-instances] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  17726. 1125.17 s [quickcheck-instances] include array-0.5.8.0-cc9a
  17727. 1125.17 s [quickcheck-instances] include base-4.20.1.0-f445
  17728. 1125.17 s [quickcheck-instances] include bytestring-0.12.2.0-214a
  17729. 1125.17 s [quickcheck-instances] include case-insensitive-1.2.1.0-vU7iwxIkw6BDRoJiOKUX9
  17730. 1125.17 s [quickcheck-instances] include containers-0.7-6571
  17731. 1125.17 s [quickcheck-instances] include data-fix-0.3.4-7vq8gDUqoK2ExECpbbpYtS
  17732. 1125.17 s [quickcheck-instances] include hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  17733. 1125.17 s [quickcheck-instances] include integer-logarithms-1.0.4-6IXWlEgMT5R61ZYm1oBoaq
  17734. 1125.17 s [quickcheck-instances] include old-time-1.1.0.4-1OXvca05EDL3mQFL1inYyN
  17735. 1125.17 s [quickcheck-instances] include primitive-0.9.1.0-4qhFZr2TRbC6xzZaqaRtmm
  17736. 1125.17 s [quickcheck-instances] include scientific-0.3.8.0-cYg4biZEw2HtOP6tfA3Jr
  17737. 1125.17 s [quickcheck-instances] include splitmix-0.1.3.1-EOHiiJzHaaB56jLMn72FMK
  17738. 1125.17 s [quickcheck-instances] include strict-0.5.1-6m65N57rFfp8hWQncYEqJ6
  17739. 1125.17 s [quickcheck-instances] include tagged-0.8.9-Bgkb8aZvJy8C8ppgOn7YtS
  17740. 1125.17 s [quickcheck-instances] include text-2.1.2-7514
  17741. 1125.17 s [quickcheck-instances] include text-short-0.1.6-Fkq587X0ycd5boHvwBja79
  17742. 1125.17 s [quickcheck-instances] include these-1.2.1-L71EJMcwarX2TRBm3b6NT4
  17743. 1125.17 s [quickcheck-instances] include time-compat-1.9.8-CAJqHvHIbMyI3hyGZYYgdi
  17744. 1125.17 s [quickcheck-instances] include transformers-0.6.1.1-05a6
  17745. 1125.17 s [quickcheck-instances] include unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  17746. 1125.17 s [quickcheck-instances] include uuid-types-1.0.6-2WNDknNmevRBeLglsgsiSP
  17747. 1125.18 s [quickcheck-instances] include vector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8
  17748. 1125.18 s [quickcheck-instances] component quickcheck-instances-0.3.33-DjakwUsPN8DVKk9ECaqIm-self-test
  17749. 1125.18 s [quickcheck-instances] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  17750. 1125.18 s [quickcheck-instances] include base-4.20.1.0-f445
  17751. 1125.18 s [quickcheck-instances] include containers-0.7-6571
  17752. 1125.18 s [quickcheck-instances] include primitive-0.9.1.0-4qhFZr2TRbC6xzZaqaRtmm
  17753. 1125.18 s [quickcheck-instances] include quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  17754. 1125.18 s [quickcheck-instances] include tagged-0.8.9-Bgkb8aZvJy8C8ppgOn7YtS
  17755. 1125.18 s [quickcheck-instances] include uuid-types-1.0.6-2WNDknNmevRBeLglsgsiSP
  17756. 1125.18 s [quickcheck-instances] Linked component graph:
  17757. 1125.18 s [quickcheck-instances] unit quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  17758. 1125.18 s [quickcheck-instances] include OneTuple-0.4.2-GdyCtybON5lEHtGxAjq2VY
  17759. 1125.18 s [quickcheck-instances] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  17760. 1125.18 s [quickcheck-instances] include array-0.5.8.0-cc9a
  17761. 1125.18 s [quickcheck-instances] include base-4.20.1.0-f445
  17762. 1125.18 s [quickcheck-instances] include bytestring-0.12.2.0-214a
  17763. 1125.18 s [quickcheck-instances] include case-insensitive-1.2.1.0-vU7iwxIkw6BDRoJiOKUX9
  17764. 1125.18 s [quickcheck-instances] include containers-0.7-6571
  17765. 1125.18 s [quickcheck-instances] include data-fix-0.3.4-7vq8gDUqoK2ExECpbbpYtS
  17766. 1125.18 s [quickcheck-instances] include hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  17767. 1125.18 s [quickcheck-instances] include integer-logarithms-1.0.4-6IXWlEgMT5R61ZYm1oBoaq
  17768. 1125.18 s [quickcheck-instances] include old-time-1.1.0.4-1OXvca05EDL3mQFL1inYyN
  17769. 1125.18 s [quickcheck-instances] include primitive-0.9.1.0-4qhFZr2TRbC6xzZaqaRtmm
  17770. 1125.18 s [quickcheck-instances] include scientific-0.3.8.0-cYg4biZEw2HtOP6tfA3Jr
  17771. 1125.18 s [quickcheck-instances] include splitmix-0.1.3.1-EOHiiJzHaaB56jLMn72FMK
  17772. 1125.18 s [quickcheck-instances] include strict-0.5.1-6m65N57rFfp8hWQncYEqJ6
  17773. 1125.18 s [quickcheck-instances] include tagged-0.8.9-Bgkb8aZvJy8C8ppgOn7YtS
  17774. 1125.18 s [quickcheck-instances] include text-2.1.2-7514
  17775. 1125.18 s [quickcheck-instances] include text-short-0.1.6-Fkq587X0ycd5boHvwBja79
  17776. 1125.18 s [quickcheck-instances] include these-1.2.1-L71EJMcwarX2TRBm3b6NT4
  17777. 1125.18 s [quickcheck-instances] include time-compat-1.9.8-CAJqHvHIbMyI3hyGZYYgdi
  17778. 1125.18 s [quickcheck-instances] include transformers-0.6.1.1-05a6
  17779. 1125.18 s [quickcheck-instances] include unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  17780. 1125.18 s [quickcheck-instances] include uuid-types-1.0.6-2WNDknNmevRBeLglsgsiSP
  17781. 1125.18 s [quickcheck-instances] include vector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8
  17782. 1125.18 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp:Test.QuickCheck.Instances.Void
  17783. 1125.18 s [quickcheck-instances] unit quickcheck-instances-0.3.33-DjakwUsPN8DVKk9ECaqIm-self-test
  17784. 1125.18 s [quickcheck-instances] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  17785. 1125.18 s [quickcheck-instances] include base-4.20.1.0-f445
  17786. 1125.18 s [quickcheck-instances] include containers-0.7-6571
  17787. 1125.18 s [quickcheck-instances] include primitive-0.9.1.0-4qhFZr2TRbC6xzZaqaRtmm
  17788. 1125.18 s [quickcheck-instances] include quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  17789. 1125.18 s [quickcheck-instances] include tagged-0.8.9-Bgkb8aZvJy8C8ppgOn7YtS
  17790. 1125.18 s [quickcheck-instances] include uuid-types-1.0.6-2WNDknNmevRBeLglsgsiSP
  17791. 1125.18 s [quickcheck-instances] Ready component graph:
  17792. 1125.18 s [quickcheck-instances] definite quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  17793. 1125.18 s [quickcheck-instances] depends OneTuple-0.4.2-GdyCtybON5lEHtGxAjq2VY
  17794. 1125.18 s [quickcheck-instances] depends QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  17795. 1125.18 s [quickcheck-instances] depends array-0.5.8.0-cc9a
  17796. 1125.18 s [quickcheck-instances] depends base-4.20.1.0-f445
  17797. 1125.18 s [quickcheck-instances] depends bytestring-0.12.2.0-214a
  17798. 1125.18 s [quickcheck-instances] depends case-insensitive-1.2.1.0-vU7iwxIkw6BDRoJiOKUX9
  17799. 1125.18 s [quickcheck-instances] depends containers-0.7-6571
  17800. 1125.18 s [quickcheck-instances] depends data-fix-0.3.4-7vq8gDUqoK2ExECpbbpYtS
  17801. 1125.18 s [quickcheck-instances] depends hashable-1.5.0.0-1lC0Qtb9YfSLSjedNDS4vh
  17802. 1125.18 s [quickcheck-instances] depends integer-logarithms-1.0.4-6IXWlEgMT5R61ZYm1oBoaq
  17803. 1125.18 s [quickcheck-instances] depends old-time-1.1.0.4-1OXvca05EDL3mQFL1inYyN
  17804. 1125.18 s [quickcheck-instances] depends primitive-0.9.1.0-4qhFZr2TRbC6xzZaqaRtmm
  17805. 1125.18 s [quickcheck-instances] depends scientific-0.3.8.0-cYg4biZEw2HtOP6tfA3Jr
  17806. 1125.18 s [quickcheck-instances] depends splitmix-0.1.3.1-EOHiiJzHaaB56jLMn72FMK
  17807. 1125.18 s [quickcheck-instances] depends strict-0.5.1-6m65N57rFfp8hWQncYEqJ6
  17808. 1125.18 s [quickcheck-instances] depends tagged-0.8.9-Bgkb8aZvJy8C8ppgOn7YtS
  17809. 1125.18 s [quickcheck-instances] depends text-2.1.2-7514
  17810. 1125.18 s [quickcheck-instances] depends text-short-0.1.6-Fkq587X0ycd5boHvwBja79
  17811. 1125.18 s [quickcheck-instances] depends these-1.2.1-L71EJMcwarX2TRBm3b6NT4
  17812. 1125.18 s [quickcheck-instances] depends time-compat-1.9.8-CAJqHvHIbMyI3hyGZYYgdi
  17813. 1125.18 s [quickcheck-instances] depends transformers-0.6.1.1-05a6
  17814. 1125.18 s [quickcheck-instances] depends unordered-containers-0.2.20.1-2qcQ6fqP9tVBk9kEhjUZvD
  17815. 1125.18 s [quickcheck-instances] depends uuid-types-1.0.6-2WNDknNmevRBeLglsgsiSP
  17816. 1125.18 s [quickcheck-instances] depends vector-0.13.2.0-CEqMsjwlZUSFmpBxS1GwZ8
  17817. 1125.18 s [quickcheck-instances] definite quickcheck-instances-0.3.33-DjakwUsPN8DVKk9ECaqIm-self-test
  17818. 1125.18 s [quickcheck-instances] depends QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  17819. 1125.18 s [quickcheck-instances] depends base-4.20.1.0-f445
  17820. 1125.18 s [quickcheck-instances] depends containers-0.7-6571
  17821. 1125.18 s [quickcheck-instances] depends primitive-0.9.1.0-4qhFZr2TRbC6xzZaqaRtmm
  17822. 1125.19 s [quickcheck-instances] depends quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  17823. 1125.19 s [quickcheck-instances] depends tagged-0.8.9-Bgkb8aZvJy8C8ppgOn7YtS
  17824. 1125.19 s [quickcheck-instances] depends uuid-types-1.0.6-2WNDknNmevRBeLglsgsiSP
  17825. 1125.19 s [quickcheck-instances] Using Cabal-3.12.1.0 compiled by ghc-9.10
  17826. 1125.19 s [quickcheck-instances] Using compiler: ghc-9.10.2
  17827. 1125.19 s [quickcheck-instances] Using install prefix:
  17828. 1125.19 s [quickcheck-instances] /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33
  17829. 1125.19 s [quickcheck-instances] Executables installed in:
  17830. 1125.19 s [quickcheck-instances] /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/bin
  17831. 1125.19 s [quickcheck-instances] Libraries installed in:
  17832. 1125.19 s [quickcheck-instances] /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  17833. 1125.19 s [quickcheck-instances] Dynamic Libraries installed in:
  17834. 1125.19 s [quickcheck-instances] /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a
  17835. 1125.19 s [quickcheck-instances] Private executables installed in:
  17836. 1125.19 s [quickcheck-instances] /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.10.2-2a2a/quickcheck-instances-0.3.33
  17837. 1125.19 s [quickcheck-instances] Data files installed in:
  17838. 1125.19 s [quickcheck-instances] /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.10.2-2a2a/quickcheck-instances-0.3.33
  17839. 1125.19 s [quickcheck-instances] Documentation installed in:
  17840. 1125.19 s [quickcheck-instances] /nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  17841. 1125.19 s [quickcheck-instances] Configuration files installed in:
  17842. 1125.19 s [quickcheck-instances] /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/etc
  17843. 1125.19 s [quickcheck-instances] No alex found
  17844. 1125.19 s [quickcheck-instances] Using ar found on system at:
  17845. 1125.19 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17846. 1125.19 s [quickcheck-instances] No c2hs found
  17847. 1125.19 s [quickcheck-instances] No cpphs found
  17848. 1125.19 s [quickcheck-instances] No doctest found
  17849. 1125.19 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  17850. 1125.19 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17851. 1125.19 s [quickcheck-instances] Using ghc version 9.10.2 found on system at:
  17852. 1125.19 s [quickcheck-instances] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc
  17853. 1125.19 s [quickcheck-instances] Using ghc-pkg version 9.10.2 found on system at:
  17854. 1125.19 s [quickcheck-instances] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc-pkg-9.10.2
  17855. 1125.19 s [quickcheck-instances] No ghcjs found
  17856. 1125.19 s [quickcheck-instances] No ghcjs-pkg found
  17857. 1125.19 s [quickcheck-instances] No greencard found
  17858. 1125.19 s [quickcheck-instances] Using haddock version 2.31.0 found on system at:
  17859. 1125.19 s [quickcheck-instances] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/haddock-ghc-9.10.2
  17860. 1125.19 s [quickcheck-instances] No happy found
  17861. 1125.19 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  17862. 1125.19 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17863. 1125.19 s [quickcheck-instances] No hmake found
  17864. 1125.19 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  17865. 1125.19 s [quickcheck-instances] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hpc-ghc-9.10.2
  17866. 1125.19 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  17867. 1125.19 s [quickcheck-instances] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  17868. 1125.19 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  17869. 1125.19 s [quickcheck-instances] /nix/store/yhwsn20b5l3lksyl2h8a95k62xqmxg1d-hscolour-1.25/bin/HsColour
  17870. 1125.19 s [quickcheck-instances] No jhc found
  17871. 1125.19 s [quickcheck-instances] Using ld found on system at:
  17872. 1125.19 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  17873. 1125.19 s [quickcheck-instances] No pkg-config found
  17874. 1125.19 s [quickcheck-instances] Using runghc version 9.10.2 found on system at:
  17875. 1125.19 s [quickcheck-instances] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/runghc-9.10.2
  17876. 1125.19 s [quickcheck-instances] Using strip version 2.44 found on system at:
  17877. 1125.19 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17878. 1125.19 s [quickcheck-instances] Using tar found on system at:
  17879. 1125.19 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17880. 1125.19 s [quickcheck-instances] No uhc found
  17881. 1125.22 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  17882. 1125.22 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  17883. 1125.22 s [haskell-language-server] but were not needed for compilation:
  17884. 1125.22 s [haskell-language-server] - ghc-9.10.2 (exposed by flag -package-id ghc-9.10.2-2a2a)
  17885. 1125.22 s [haskell-language-server]
  17886. 1125.24 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.o, dist/build/HlsPlugins.dyn_o )
  17887. 1125.34 s [bash-language-server] Phase: installPhase
  17888. 1125.39 s [quickcheck-instances] Phase: buildPhase
  17889. 1125.43 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  17890. 1125.44 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  17891. 1125.56 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 )
  17892. 1125.59 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 )
  17893. 1125.61 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 )
  17894. 1125.67 s [bash-language-server] Lockfile is up to date, resolution step is skipped
  17895. 1125.69 s [bash-language-server] Already up to date
  17896. 1125.94 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 )
  17897. 1125.94 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 )
  17898. 1125.98 s [bash-language-server]
  17899. 1125.98 s [bash-language-server] devDependencies:
  17900. 1125.98 s [bash-language-server] - @types/jest 29.5.14
  17901. 1125.99 s [bash-language-server] - @types/node 18.19.86
  17902. 1125.99 s [bash-language-server] - @typescript-eslint/eslint-plugin 7.18.0
  17903. 1125.99 s [bash-language-server] - @typescript-eslint/parser 7.18.0
  17904. 1125.99 s [bash-language-server] - cross-spawn 7.0.6
  17905. 1125.99 s [bash-language-server] - eslint 8.57.1
  17906. 1125.99 s [bash-language-server] - eslint-config-prettier 9.1.0
  17907. 1125.99 s [bash-language-server] - eslint-plugin-jest 28.11.0
  17908. 1125.99 s [bash-language-server] - eslint-plugin-prettier 4.2.1
  17909. 1125.99 s [bash-language-server] - eslint-plugin-simple-import-sort 12.1.1
  17910. 1125.99 s [bash-language-server] - eslint-plugin-sort-class-members 1.21.0
  17911. 1125.99 s [bash-language-server] - jest 29.7.0
  17912. 1125.99 s [bash-language-server] - prettier 2.8.8
  17913. 1125.99 s [bash-language-server] - ts-jest 29.3.2
  17914. 1125.99 s [bash-language-server] - typescript 5.6.3
  17915. 1125.99 s [bash-language-server] - vscode-languageserver 8.0.2
  17916. 1125.99 s [bash-language-server] - vscode-languageserver-textdocument 1.0.12
  17917. 1125.99 s [bash-language-server]
  17918. 1126.16 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 )
  17919. 1126.16 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 )
  17920. 1126.16 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 )
  17921. 1126.16 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 )
  17922. 1126.21 s [bash-language-server] Phase: fixupPhase
  17923. 1126.24 s [bash-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  17924. 1126.25 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 )
  17925. 1126.25 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 )
  17926. 1126.25 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 )
  17927. 1126.25 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 )
  17928. 1126.25 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 )
  17929. 1126.25 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 )
  17930. 1126.25 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 )
  17931. 1126.25 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 )
  17932. 1126.25 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 )
  17933. 1126.25 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 )
  17934. 1126.25 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 )
  17935. 1126.33 s [bash-language-server] shrinking /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server
  17936. 1126.34 s [bash-language-server] checking for references to /build/ in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0...
  17937. 1126.46 s [bash-language-server] patching script interpreter paths in /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  17938. 1126.48 s [bash-language-server] /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/src/get-options.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/bash"
  17939. 1126.49 s [bash-language-server] /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/editorconfig: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17940. 1126.50 s [bash-language-server] /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/lib/bash-language-server/server/node_modules/.bin/installServerIntoExtension: interpreter directive changed from "#!/bin/sh" to "/nix/store/3hgg7pr65imdrifqqh3flg3arvkc2r22-bash-5.3p3/bin/sh"
  17941. 1126.65 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 )
  17942. 1126.65 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 )
  17943. 1126.65 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 )
  17944. 1126.65 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 )
  17945. 1126.65 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 )
  17946. 1126.65 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 )
  17947. 1126.73 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 )
  17948. 1126.73 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 )
  17949. 1126.78 s [bash-language-server] Phase: installCheckPhase
  17950. 1126.79 s [bash-language-server] Executing versionCheckPhase
  17951. 1126.95 s [bash-language-server] Did not find version 5.6.0 in the output of the command /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server --help
  17952. 1126.95 s [bash-language-server] Usage:
  17953. 1126.95 s [bash-language-server] bash-language-server start Start listening on stdin/stdout
  17954. 1126.95 s [bash-language-server] bash-language-server -h, --help Display this help and exit
  17955. 1126.95 s [bash-language-server] bash-language-server -v, --version Print the version and exit
  17956. 1126.95 s [bash-language-server]
  17957. 1126.95 s [bash-language-server] Environment variables:
  17958. 1126.95 s [bash-language-server] BASH_IDE_LOG_LEVEL Set the log level (default: info)
  17959. 1126.95 s [bash-language-server]
  17960. 1126.95 s [bash-language-server] Further documentation: https://github.com/bash-lsp/bash-language-server
  17961. 1126.95 s [bash-language-server] (node:1257) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
  17962. 1126.95 s [bash-language-server] (Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
  17963. 1126.95 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 )
  17964. 1127.09 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 )
  17965. 1127.10 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 )
  17966. 1127.12 s [bash-language-server] Successfully managed to find version 5.6.0 in the output of the command /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0/bin/bash-language-server --version
  17967. 1127.12 s [bash-language-server] 5.6.0
  17968. 1127.12 s [bash-language-server] (node:1268) [DEP0040] DeprecationWarning: The `punycode` module is deprecated. Please use a userland alternative instead.
  17969. 1127.12 s [bash-language-server] (Use `bash-language-server --trace-deprecation ...` to show where the warning was created)
  17970. 1127.12 s [bash-language-server] Finished versionCheckPhase
  17971. 1127.12 s [bash-language-server] no Makefile or custom installCheckPhase, doing nothing
  17972. 1127.48 s [bash-language-server:post-build] Uploading to cachix cache "sellout": /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  17973. 1128.05 s [bash-language-server:post-build] Pushing 1 paths (46 are already present) using zstd to cache sellout ⏳
  17974. 1128.05 s [bash-language-server:post-build]
  17975. 1128.41 s [bash-language-server:post-build] Pushing /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0 (5.88 MiB)
  17976. 1129.45 s [bash-language-server:post-build]
  17977. 1129.45 s [bash-language-server:post-build] All done.
  17978. 1129.47 s [bash-language-server:post-build] Uploading to the NixCI cache: /nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0
  17979. 1129.51 s [bash-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17980. 1129.52 s [bash-language-server:post-build] copying 1 paths...
  17981. 1129.52 s [bash-language-server:post-build] copying path '/nix/store/wv7hbfyvnms0157izi6l64dgfrfllqzk-bash-language-server-5.6.0' to 'https://cache.nix-ci.com'...
  17982. 1131.27 s [bash-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17983. 1131.55 s [bash-language-server:post-build] copying 1 paths...
  17984. 1131.67 s [bash-language-server:post-build] copying path '/nix/store/na71b1qblfcv0x84nz68yybh61b6qjlv-bash-language-server-5.6.0.drv' to 'https://cache.nix-ci.com'...
  17985. 1131.78 s Progress: 31 of 40 built (2 building), 760 of 760 downloaded from cache
  17986. 1131.90 s Building /nix/store/zyxicd0liv81yslrfa6dab201msi5mja-project-manager-path-for-duoids.drv
  17987. 1131.90 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 )
  17988. 1131.90 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 )
  17989. 1131.90 s [haskell-language-server] <no location info>: warning: [GHC-42258] [-Wunused-packages]
  17990. 1131.90 s [haskell-language-server] The following packages were specified via -package or -package-id flags,
  17991. 1131.90 s [haskell-language-server] but were not needed for compilation:
  17992. 1131.90 s [haskell-language-server] - ghc-9.10.2 (exposed by flag -package-id ghc-9.10.2-2a2a)
  17993. 1131.90 s [haskell-language-server]
  17994. 1131.90 s [haskell-language-server] [1 of 5] Compiling HlsPlugins ( src/HlsPlugins.hs, dist/build/HlsPlugins.p_o )
  17995. 1131.90 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 )
  17996. 1131.90 s [haskell-language-server] [3 of 5] Compiling Ide.Version ( src/Ide/Version.hs, dist/build/Ide/Version.p_o )
  17997. 1131.90 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 )
  17998. 1131.90 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 )
  17999. 1131.90 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 )
  18000. 1131.90 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 )
  18001. 1131.90 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 )
  18002. 1131.90 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 )
  18003. 1131.90 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 )
  18004. 1131.90 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 )
  18005. 1131.90 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 )
  18006. 1131.90 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 )
  18007. 1131.90 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 )
  18008. 1131.90 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 )
  18009. 1131.90 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 )
  18010. 1131.90 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 )
  18011. 1131.90 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 )
  18012. 1131.90 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 )
  18013. 1131.90 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 )
  18014. 1131.90 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 )
  18015. 1131.90 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 )
  18016. 1131.90 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 )
  18017. 1131.90 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 )
  18018. 1131.90 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 )
  18019. 1131.90 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  18020. 1131.90 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  18021. 1131.90 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  18022. 1131.90 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  18023. 1131.90 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  18024. 1131.90 s [quickcheck-instances] Phase: checkPhase
  18025. 1131.90 s [quickcheck-instances] Running 1 test suites...
  18026. 1131.90 s [quickcheck-instances] Test suite self-test: RUNNING...
  18027. 1131.90 s [quickcheck-instances] +++ OK, passed 100 tests.
  18028. 1131.90 s [quickcheck-instances] +++ OK, passed 100 tests.
  18029. 1131.90 s [quickcheck-instances] +++ OK, passed 100 tests.
  18030. 1131.90 s [quickcheck-instances] +++ OK, passed 100 tests.
  18031. 1131.90 s [quickcheck-instances] +++ OK, passed 100 tests.
  18032. 1131.90 s [quickcheck-instances] Test suite self-test: PASS
  18033. 1131.90 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  18034. 1131.90 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  18035. 1131.90 s [quickcheck-instances] Phase: haddockPhase
  18036. 1131.90 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  18037. 1131.90 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  18038. 1131.90 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  18039. 1131.90 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  18040. 1131.90 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  18041. 1131.90 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  18042. 1131.90 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  18043. 1131.90 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  18044. 1131.90 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  18045. 1131.90 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  18046. 1131.90 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  18047. 1131.90 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  18048. 1131.90 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  18049. 1131.90 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  18050. 1131.90 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  18051. 1131.90 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  18052. 1131.90 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  18053. 1131.90 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  18054. 1131.90 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  18055. 1131.90 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  18056. 1131.90 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  18057. 1131.90 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  18058. 1131.90 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  18059. 1131.90 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  18060. 1131.90 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  18061. 1131.90 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  18062. 1131.90 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  18063. 1131.90 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  18064. 1131.90 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  18065. 1131.90 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  18066. 1131.90 s [quickcheck-instances] Haddock coverage:
  18067. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  18068. 1131.90 s [quickcheck-instances] Missing documentation for:
  18069. 1131.90 s [quickcheck-instances] Module header
  18070. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  18071. 1131.90 s [quickcheck-instances] Missing documentation for:
  18072. 1131.90 s [quickcheck-instances] Module header
  18073. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  18074. 1131.90 s [quickcheck-instances] Missing documentation for:
  18075. 1131.90 s [quickcheck-instances] Module header
  18076. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  18077. 1131.90 s [quickcheck-instances] Missing documentation for:
  18078. 1131.90 s [quickcheck-instances] Module header
  18079. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  18080. 1131.90 s [quickcheck-instances] Missing documentation for:
  18081. 1131.90 s [quickcheck-instances] Module header
  18082. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  18083. 1131.90 s [quickcheck-instances] Missing documentation for:
  18084. 1131.90 s [quickcheck-instances] Module header
  18085. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  18086. 1131.90 s [quickcheck-instances] Missing documentation for:
  18087. 1131.90 s [quickcheck-instances] Module header
  18088. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18089. 1131.90 s [quickcheck-instances] Missing documentation for:
  18090. 1131.90 s [quickcheck-instances] Module header
  18091. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18092. 1131.90 s [quickcheck-instances] Missing documentation for:
  18093. 1131.90 s [quickcheck-instances] Module header
  18094. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18095. 1131.90 s [quickcheck-instances] Missing documentation for:
  18096. 1131.90 s [quickcheck-instances] Module header
  18097. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18098. 1131.90 s [quickcheck-instances] Missing documentation for:
  18099. 1131.90 s [quickcheck-instances] Module header
  18100. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18101. 1131.90 s [quickcheck-instances] Missing documentation for:
  18102. 1131.90 s [quickcheck-instances] Module header
  18103. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18104. 1131.90 s [quickcheck-instances] Missing documentation for:
  18105. 1131.90 s [quickcheck-instances] Module header
  18106. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18107. 1131.90 s [quickcheck-instances] Missing documentation for:
  18108. 1131.90 s [quickcheck-instances] Module header
  18109. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18110. 1131.90 s [quickcheck-instances] Missing documentation for:
  18111. 1131.90 s [quickcheck-instances] Module header
  18112. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18113. 1131.90 s [quickcheck-instances] Missing documentation for:
  18114. 1131.90 s [quickcheck-instances] Module header
  18115. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18116. 1131.90 s [quickcheck-instances] Missing documentation for:
  18117. 1131.90 s [quickcheck-instances] Module header
  18118. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18119. 1131.90 s [quickcheck-instances] Missing documentation for:
  18120. 1131.90 s [quickcheck-instances] Module header
  18121. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18122. 1131.90 s [quickcheck-instances] Missing documentation for:
  18123. 1131.90 s [quickcheck-instances] Module header
  18124. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18125. 1131.90 s [quickcheck-instances] Missing documentation for:
  18126. 1131.90 s [quickcheck-instances] Module header
  18127. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18128. 1131.90 s [quickcheck-instances] Missing documentation for:
  18129. 1131.90 s [quickcheck-instances] Module header
  18130. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18131. 1131.90 s [quickcheck-instances] Missing documentation for:
  18132. 1131.90 s [quickcheck-instances] Module header
  18133. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18134. 1131.90 s [quickcheck-instances] Missing documentation for:
  18135. 1131.90 s [quickcheck-instances] Module header
  18136. 1131.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18137. 1131.90 s [quickcheck-instances] Missing documentation for:
  18138. 1131.90 s [quickcheck-instances] Module header
  18139. 1131.91 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18140. 1131.97 s [project-manager-path-for-duoids] created 346 symlinks in user environment
  18141. 1132.03 s [project-manager-path-for-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids
  18142. 1132.54 s [project-manager-path-for-duoids:post-build] Pushing 1 paths (220 are already present) using zstd to cache sellout ⏳
  18143. 1132.54 s [project-manager-path-for-duoids:post-build]
  18144. 1132.89 s [project-manager-path-for-duoids:post-build] Pushing /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids (96.70 KiB)
  18145. 1134.11 s [project-manager-path-for-duoids:post-build]
  18146. 1134.11 s [project-manager-path-for-duoids:post-build] All done.
  18147. 1134.13 s [project-manager-path-for-duoids:post-build] Uploading to the NixCI cache: /nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids
  18148. 1134.17 s [project-manager-path-for-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18149. 1134.39 s [project-manager-path-for-duoids:post-build] copying 1 paths...
  18150. 1134.39 s [project-manager-path-for-duoids:post-build] copying path '/nix/store/1drjlq9sq4ss40gjq9fdih54yrj55abx-project-manager-path-for-duoids' to 'https://cache.nix-ci.com'...
  18151. 1134.66 s [project-manager-path-for-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18152. 1135.04 s [project-manager-path-for-duoids:post-build] copying 1 paths...
  18153. 1135.05 s [project-manager-path-for-duoids:post-build] copying path '/nix/store/zyxicd0liv81yslrfa6dab201msi5mja-project-manager-path-for-duoids.drv' to 'https://cache.nix-ci.com'...
  18154. 1135.28 s Progress: 32 of 40 built (2 building), 760 of 760 downloaded from cache
  18155. 1135.28 s [haskell-language-server] [4 of 5] Compiling Ide.Arguments ( src/Ide/Arguments.hs, dist/build/Ide/Arguments.p_o )
  18156. 1135.28 s [haskell-language-server] [5 of 5] Compiling Ide.Main ( src/Ide/Main.hs, dist/build/Ide/Main.p_o )
  18157. 1135.28 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18158. 1135.28 s [quickcheck-instances] - Data.Vector.Vector
  18159. 1135.28 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18160. 1135.28 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18161. 1135.29 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18162. 1135.29 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18163. 1135.29 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18164. 1135.99 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  18165. 1135.99 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18166. 1136.04 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  18167. 1136.05 s [quickcheck-instances] Phase: installPhase
  18168. 1136.10 s [quickcheck-instances] Installing library in /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  18169. 1136.52 s [quickcheck-instances] Phase: fixupPhase
  18170. 1136.54 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33
  18171. 1136.54 s [quickcheck-instances] shrinking /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHSquickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp-ghc9.10.2.so
  18172. 1136.57 s [quickcheck-instances] checking for references to /build/ in /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33...
  18173. 1136.60 s [quickcheck-instances] patching script interpreter paths in /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33
  18174. 1136.69 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33/lib
  18175. 1137.00 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc
  18176. 1137.01 s [quickcheck-instances] checking for references to /build/ in /nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc...
  18177. 1137.03 s [quickcheck-instances] patching script interpreter paths in /nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc
  18178. 1137.15 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33 /nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc
  18179. 1137.72 s [quickcheck-instances:post-build] Pushing 2 paths (132 are already present) using zstd to cache sellout ⏳
  18180. 1137.72 s [quickcheck-instances:post-build]
  18181. 1138.06 s [quickcheck-instances:post-build] Pushing /nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc (1.51 MiB)
  18182. 1138.14 s [quickcheck-instances:post-build] Pushing /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33 (5.53 MiB)
  18183. 1139.66 s [quickcheck-instances:post-build]
  18184. 1139.66 s [quickcheck-instances:post-build] All done.
  18185. 1139.68 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33 /nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc
  18186. 1139.72 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18187. 1139.94 s [quickcheck-instances:post-build] copying 2 paths...
  18188. 1139.94 s [quickcheck-instances:post-build] copying path '/nix/store/w041nlylw55dscfccgz9cglsvcwdwghh-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
  18189. 1140.34 s [quickcheck-instances:post-build] copying path '/nix/store/fbw8zz3s83cf3fjncrpvr5z6gdv57vcf-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18190. 1141.75 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18191. 1142.00 s [quickcheck-instances:post-build] copying 1 paths...
  18192. 1142.05 s [quickcheck-instances:post-build] copying path '/nix/store/hkha0wr3jw3ghsrbljbl37bwlzm8x0gy-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  18193. 1142.26 s Progress: 33 of 40 built (1 building), 760 of 760 downloaded from cache
  18194. 1142.32 s Building /nix/store/h6s1awbsya530ks0rl4yzkwq20p7vqf5-extra-1.8.1.drv
  18195. 1142.32 s [haskell-language-server] Preprocessing executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0...
  18196. 1142.32 s [haskell-language-server] Building executable 'haskell-language-server-wrapper' for haskell-language-server-2.12.0.0...
  18197. 1142.32 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 )
  18198. 1142.32 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 )
  18199. 1142.45 s [extra] Phase: setupCompilerEnvironmentPhase
  18200. 1142.45 s [extra] Build with /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2.
  18201. 1142.61 s [haskell-language-server] [3 of 3] Linking dist/build/haskell-language-server-wrapper/haskell-language-server-wrapper
  18202. 1142.63 s [extra] Phase: unpackPhase
  18203. 1142.63 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18204. 1142.64 s [extra] source root is extra-1.8.1
  18205. 1142.65 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18206. 1142.65 s [extra] Phase: patchPhase
  18207. 1142.66 s [extra] Phase: compileBuildDriverPhase
  18208. 1142.66 s [extra] setupCompileFlags: -package-db=/build/tmp.umycAR6IPP/setup-package.conf.d -threaded
  18209. 1142.70 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.umycAR6IPP/Main.o )
  18210. 1142.74 s [extra] [2 of 2] Linking Setup
  18211. 1143.90 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18212. 1143.91 s [extra] Phase: configurePhase
  18213. 1143.91 s [extra] configureFlags: --verbose --prefix=/nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.umycAR6IPP/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
  18214. 1143.92 s [extra] Using Parsec parser
  18215. 1143.92 s [extra] Configuring extra-1.8.1...
  18216. 1144.41 s [extra] Dependency base >=4.9 && <5: using base-4.20.1.0
  18217. 1144.41 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18218. 1144.41 s [extra] Dependency directory: using directory-1.3.8.5
  18219. 1144.41 s [extra] Dependency filepath: using filepath-1.5.4.0
  18220. 1144.41 s [extra] Dependency process: using process-1.6.25.0
  18221. 1144.41 s [extra] Dependency time: using time-1.12.2
  18222. 1144.41 s [extra] Dependency unix: using unix-2.8.6.0
  18223. 1144.41 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18224. 1144.41 s [extra] Dependency base >=4 && <5: using base-4.20.1.0
  18225. 1144.41 s [extra] Dependency directory: using directory-1.3.8.5
  18226. 1144.41 s [extra] Dependency extra: using extra-1.8.1
  18227. 1144.41 s [extra] Dependency filepath: using filepath-1.5.4.0
  18228. 1144.41 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18229. 1144.41 s [extra] Dependency unix: using unix-2.8.6.0
  18230. 1144.41 s [extra] Source component graph:
  18231. 1144.41 s [extra] component lib
  18232. 1144.41 s [extra] component test:extra-test dependency lib
  18233. 1144.41 s [extra] Configured component graph:
  18234. 1144.41 s [extra] component extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  18235. 1144.41 s [extra] include base-4.20.1.0-f445
  18236. 1144.41 s [extra] include clock-0.8.4-10dI8gUEoUR3VkfPc784Nm
  18237. 1144.41 s [extra] include directory-1.3.8.5-159c
  18238. 1144.41 s [extra] include filepath-1.5.4.0-8593
  18239. 1144.41 s [extra] include process-1.6.25.0-cfae
  18240. 1144.41 s [extra] include time-1.12.2-9680
  18241. 1144.41 s [extra] include unix-2.8.6.0-a0e2
  18242. 1144.41 s [extra] component extra-1.8.1-HJYTF1dj8DPGMIANI0tRur-extra-test
  18243. 1144.41 s [extra] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  18244. 1144.41 s [extra] include base-4.20.1.0-f445
  18245. 1144.41 s [extra] include directory-1.3.8.5-159c
  18246. 1144.41 s [extra] include extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  18247. 1144.41 s [extra] include filepath-1.5.4.0-8593
  18248. 1144.41 s [extra] include quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  18249. 1144.41 s [extra] include unix-2.8.6.0-a0e2
  18250. 1144.42 s [extra] Linked component graph:
  18251. 1144.42 s [extra] unit extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  18252. 1144.42 s [extra] include base-4.20.1.0-f445
  18253. 1144.42 s [extra] include clock-0.8.4-10dI8gUEoUR3VkfPc784Nm
  18254. 1144.42 s [extra] include directory-1.3.8.5-159c
  18255. 1144.42 s [extra] include filepath-1.5.4.0-8593
  18256. 1144.42 s [extra] include process-1.6.25.0-cfae
  18257. 1144.42 s [extra] include time-1.12.2-9680
  18258. 1144.42 s [extra] include unix-2.8.6.0-a0e2
  18259. 1144.42 s [extra] Control.Concurrent.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Data.Version.Extra,Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Extra,Numeric.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Numeric.Extra,System.Directory.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:System.Environment.Extra,System.IO.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:System.IO.Extra,System.Info.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:System.Info.Extra,System.Process.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:System.Process.Extra,System.Time.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:System.Time.Extra,Text.Read.Extra=extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA:Text.Read.Extra
  18260. 1144.42 s [extra] unit extra-1.8.1-HJYTF1dj8DPGMIANI0tRur-extra-test
  18261. 1144.42 s [extra] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  18262. 1144.42 s [extra] include base-4.20.1.0-f445
  18263. 1144.42 s [extra] include directory-1.3.8.5-159c
  18264. 1144.42 s [extra] include extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  18265. 1144.42 s [extra] include filepath-1.5.4.0-8593
  18266. 1144.42 s [extra] include quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  18267. 1144.42 s [extra] include unix-2.8.6.0-a0e2
  18268. 1144.42 s [extra] Ready component graph:
  18269. 1144.42 s [extra] definite extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  18270. 1144.42 s [extra] depends base-4.20.1.0-f445
  18271. 1144.42 s [extra] depends clock-0.8.4-10dI8gUEoUR3VkfPc784Nm
  18272. 1144.42 s [extra] depends directory-1.3.8.5-159c
  18273. 1144.42 s [extra] depends filepath-1.5.4.0-8593
  18274. 1144.42 s [extra] depends process-1.6.25.0-cfae
  18275. 1144.42 s [extra] depends time-1.12.2-9680
  18276. 1144.42 s [extra] depends unix-2.8.6.0-a0e2
  18277. 1144.42 s [extra] definite extra-1.8.1-HJYTF1dj8DPGMIANI0tRur-extra-test
  18278. 1144.42 s [extra] depends QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  18279. 1144.42 s [extra] depends base-4.20.1.0-f445
  18280. 1144.42 s [extra] depends directory-1.3.8.5-159c
  18281. 1144.42 s [extra] depends extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  18282. 1144.42 s [extra] depends filepath-1.5.4.0-8593
  18283. 1144.42 s [extra] depends quickcheck-instances-0.3.33-DLni85v9C7BC9bibwnbFp
  18284. 1144.42 s [extra] depends unix-2.8.6.0-a0e2
  18285. 1144.42 s [extra] Using Cabal-3.12.1.0 compiled by ghc-9.10
  18286. 1144.42 s [extra] Using compiler: ghc-9.10.2
  18287. 1144.42 s [extra] Using install prefix: /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1
  18288. 1144.42 s [extra] Executables installed in:
  18289. 1144.42 s [extra] /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/bin
  18290. 1144.42 s [extra] Libraries installed in:
  18291. 1144.42 s [extra] /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  18292. 1144.42 s [extra] Dynamic Libraries installed in:
  18293. 1144.42 s [extra] /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a
  18294. 1144.42 s [extra] Private executables installed in:
  18295. 1144.42 s [extra] /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/libexec/x86_64-linux-ghc-9.10.2-2a2a/extra-1.8.1
  18296. 1144.42 s [extra] Data files installed in:
  18297. 1144.42 s [extra] /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/share/x86_64-linux-ghc-9.10.2-2a2a/extra-1.8.1
  18298. 1144.42 s [extra] Documentation installed in:
  18299. 1144.42 s [extra] /nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc/share/doc/extra-1.8.1
  18300. 1144.42 s [extra] Configuration files installed in:
  18301. 1144.42 s [extra] /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/etc
  18302. 1144.42 s [extra] No alex found
  18303. 1144.42 s [extra] Using ar found on system at:
  18304. 1144.42 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18305. 1144.42 s [extra] No c2hs found
  18306. 1144.42 s [extra] No cpphs found
  18307. 1144.42 s [extra] No doctest found
  18308. 1144.42 s [extra] Using gcc version 14.3.0 given by user at:
  18309. 1144.42 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18310. 1144.42 s [extra] Using ghc version 9.10.2 found on system at:
  18311. 1144.42 s [extra] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc
  18312. 1144.42 s [extra] Using ghc-pkg version 9.10.2 found on system at:
  18313. 1144.42 s [extra] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc-pkg-9.10.2
  18314. 1144.42 s [extra] No ghcjs found
  18315. 1144.42 s [extra] No ghcjs-pkg found
  18316. 1144.42 s [extra] No greencard found
  18317. 1144.42 s [extra] Using haddock version 2.31.0 found on system at:
  18318. 1144.42 s [extra] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/haddock-ghc-9.10.2
  18319. 1144.42 s [extra] No happy found
  18320. 1144.42 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18321. 1144.42 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18322. 1144.42 s [extra] No hmake found
  18323. 1144.42 s [extra] Using hpc version 0.69 found on system at:
  18324. 1144.42 s [extra] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hpc-ghc-9.10.2
  18325. 1144.42 s [extra] Using hsc2hs version 0.68.10 found on system at:
  18326. 1144.42 s [extra] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  18327. 1144.42 s [extra] Using hscolour version 1.25 found on system at:
  18328. 1144.42 s [extra] /nix/store/yhwsn20b5l3lksyl2h8a95k62xqmxg1d-hscolour-1.25/bin/HsColour
  18329. 1144.42 s [extra] No jhc found
  18330. 1144.42 s [extra] Using ld found on system at:
  18331. 1144.42 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  18332. 1144.42 s [extra] No pkg-config found
  18333. 1144.42 s [extra] Using runghc version 9.10.2 found on system at:
  18334. 1144.42 s [extra] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/runghc-9.10.2
  18335. 1144.42 s [extra] Using strip version 2.44 found on system at:
  18336. 1144.42 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18337. 1144.42 s [extra] Using tar found on system at:
  18338. 1144.42 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18339. 1144.42 s [extra] No uhc found
  18340. 1144.54 s [haskell-language-server] Preprocessing executable 'haskell-language-server' for haskell-language-server-2.12.0.0...
  18341. 1144.54 s [haskell-language-server] Building executable 'haskell-language-server' for haskell-language-server-2.12.0.0...
  18342. 1144.60 s [extra] Phase: buildPhase
  18343. 1144.62 s [haskell-language-server] [1 of 1] Compiling Main ( exe/Main.hs, dist/build/haskell-language-server/haskell-language-server-tmp/Main.dyn_o )
  18344. 1144.65 s [extra] Preprocessing library for extra-1.8.1...
  18345. 1144.65 s [extra] Building library for extra-1.8.1...
  18346. 1144.88 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 )
  18347. 1144.96 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 )
  18348. 1144.96 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 )
  18349. 1144.98 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 )
  18350. 1144.98 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18351. 1144.98 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18352. 1144.98 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 )
  18353. 1145.75 s [haskell-language-server] [2 of 2] Linking dist/build/haskell-language-server/haskell-language-server
  18354. 1145.85 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 )
  18355. 1145.89 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 )
  18356. 1145.96 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 )
  18357. 1145.96 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 )
  18358. 1145.96 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 )
  18359. 1146.12 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 )
  18360. 1146.18 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 )
  18361. 1146.34 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 )
  18362. 1146.34 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 )
  18363. 1146.34 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 )
  18364. 1146.50 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 )
  18365. 1146.50 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 )
  18366. 1146.55 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 )
  18367. 1146.55 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18368. 1146.61 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 )
  18369. 1147.07 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18370. 1147.28 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18371. 1147.36 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18372. 1147.37 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18373. 1147.37 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18374. 1147.37 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18375. 1147.37 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18376. 1148.15 s [haskell-language-server] buildPhase completed in 6 minutes 54 seconds
  18377. 1148.15 s [haskell-language-server] Phase: haddockPhase
  18378. 1148.16 s [haskell-language-server] Phase: installPhase
  18379. 1148.35 s [haskell-language-server] Installing internal library hls-stan-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-L4TYyeBUNWgFZcTBT9dest-hls-stan-plugin
  18380. 1148.38 s [haskell-language-server] Installing internal library hls-explicit-record-fields-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-Kd7QKRUWYjMDPlNncGkLD2-hls-explicit-record-fields-plugin
  18381. 1148.38 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18382. 1148.42 s [haskell-language-server] Installing internal library hls-cabal-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-KalYR2baNQi2znkd43iIAI-hls-cabal-plugin
  18383. 1148.54 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18384. 1148.64 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18385. 1148.64 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18386. 1148.64 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18387. 1148.66 s [haskell-language-server] Installing internal library hls-fourmolu-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-Ji751QoOlyhC3eCtZm09Jw-hls-fourmolu-plugin
  18388. 1148.70 s [haskell-language-server] Installing internal library hls-notes-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-JBwtz5YgqlqBj6qKXEVLUp-hls-notes-plugin
  18389. 1148.74 s [haskell-language-server] Installing internal library ghcide-bench-lib in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-J910YdpwcVWHkHhHfU1dzf-ghcide-bench-lib
  18390. 1148.85 s [haskell-language-server] Installing internal library hls-refactor-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-IA24ksP3eDdGh9Qlg0QgwJ-hls-refactor-plugin
  18391. 1148.91 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18392. 1149.09 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18393. 1149.23 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18394. 1149.23 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18395. 1149.23 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18396. 1149.28 s [haskell-language-server] Installing internal library hls-overloaded-record-dot-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-Hr5xexEG8xaBIzletgpIst-hls-overloaded-record-dot-plugin
  18397. 1149.32 s [haskell-language-server] Installing internal library hls-pragmas-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-F6GzgYIp1eeHvnHR69Gpl8-hls-pragmas-plugin
  18398. 1149.36 s [haskell-language-server] Installing executable ghcide-bench in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18399. 1149.36 s [haskell-language-server] Warning: The directory
  18400. 1149.36 s [haskell-language-server] /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18401. 1149.36 s [haskell-language-server] is not in the system search path.
  18402. 1149.37 s [haskell-language-server] Installing internal library hls-ormolu-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-Da8Jwyq21wM8zO3mU4kMZC-hls-ormolu-plugin
  18403. 1149.40 s [haskell-language-server] Installing internal library hls-explicit-fixity-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-DNMIJZubcfh9GlIyV06GIq-hls-explicit-fixity-plugin
  18404. 1149.43 s [haskell-language-server] Installing internal library hls-eval-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-CujleOGhwPr145gWPtrbW-hls-eval-plugin
  18405. 1149.50 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18406. 1149.50 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18407. 1149.64 s [haskell-language-server] Installing internal library hls-alternate-number-format-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-CleWHFK0Pfh90Da9StOVBS-hls-alternate-number-format-plugin
  18408. 1149.65 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18409. 1149.65 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18410. 1149.70 s [haskell-language-server] Installing internal library hls-gadt-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-CayC0sWH9rwjx5Rtzz6qR-hls-gadt-plugin
  18411. 1149.75 s [haskell-language-server] Installing internal library hls-stylish-haskell-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-CXMeZkQL56s6ly5MdOzzUD-hls-stylish-haskell-plugin
  18412. 1149.77 s [haskell-language-server] Installing internal library hls-module-name-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-C8W1mlsQ3JpFt0o1njTgkc-hls-module-name-plugin
  18413. 1149.80 s [haskell-language-server] Installing internal library hls-rename-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-C0RFxe3uhTtLW93vmzi1HV-hls-rename-plugin
  18414. 1149.80 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18415. 1149.83 s [haskell-language-server] Installing internal library hls-change-type-signature-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-AsV4jcIMPPx34g5zDLTA8J-hls-change-type-signature-plugin
  18416. 1149.85 s [haskell-language-server] Installing internal library hls-qualify-imported-names-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-953QtenqNjt3bs4zOFsCHP-hls-qualify-imported-names-plugin
  18417. 1149.89 s [haskell-language-server] Installing internal library hls-cabal-fmt-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-8CWkCrothtb9S8dskaPg2h-hls-cabal-fmt-plugin
  18418. 1149.91 s [haskell-language-server] Installing executable ghcide-test-preprocessor in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18419. 1149.91 s [haskell-language-server] Warning: The directory
  18420. 1149.91 s [haskell-language-server] /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18421. 1149.91 s [haskell-language-server] is not in the system search path.
  18422. 1149.91 s [haskell-language-server] Installing internal library hls-call-hierarchy-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-79p3XxtIPFyCOkfM6Ulqq3-hls-call-hierarchy-plugin
  18423. 1149.97 s [haskell-language-server] Installing internal library hls-class-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-5pYiufbiM90KsrCU0y42Ef-hls-class-plugin
  18424. 1150.04 s [haskell-language-server] Installing internal library hls-cabal-gild-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-3tI4gxkPc2WEO3b71PSgIF-hls-cabal-gild-plugin
  18425. 1150.06 s [haskell-language-server] Installing internal library hls-signature-help-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-3sACiwNVELX4CIRo73pgE8-hls-signature-help-plugin
  18426. 1150.09 s [haskell-language-server] Installing internal library hls-explicit-imports-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-3XzWxY7MVBd8IYxTndipIN-hls-explicit-imports-plugin
  18427. 1150.15 s [haskell-language-server] Installing internal library hls-semantic-tokens-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-3KzG6RhXNVfJcOCkOFCWvu-hls-semantic-tokens-plugin
  18428. 1150.22 s [haskell-language-server] Installing internal library hls-code-range-plugin in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-1Frcj6iXJMy72D2euSmr0Y-hls-code-range-plugin
  18429. 1150.27 s [haskell-language-server] Installing library in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/haskell-language-server-2.12.0.0-FZOhsainwirEgYNcviEgjm
  18430. 1150.32 s [haskell-language-server] Installing executable haskell-language-server-wrapper in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18431. 1150.32 s [haskell-language-server] Warning: The directory
  18432. 1150.32 s [haskell-language-server] /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18433. 1150.32 s [haskell-language-server] is not in the system search path.
  18434. 1150.33 s [haskell-language-server] Installing executable haskell-language-server in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18435. 1150.33 s [haskell-language-server] Warning: The directory
  18436. 1150.33 s [haskell-language-server] /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  18437. 1150.33 s [haskell-language-server] is not in the system search path.
  18438. 1150.85 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  18439. 1150.85 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  18440. 1150.91 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18441. 1151.27 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18442. 1152.80 s [haskell-language-server] Phase: fixupPhase
  18443. 1152.81 s [haskell-language-server] shrinking RPATHs of ELF executables and libraries in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0
  18444. 1152.90 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-79p3XxtIPFyCOkfM6Ulqq3-hls-call-hierarchy-plugin-ghc9.10.2.so
  18445. 1152.90 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18446. 1152.90 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18447. 1152.97 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-AsV4jcIMPPx34g5zDLTA8J-hls-change-type-signature-plugin-ghc9.10.2.so
  18448. 1153.07 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-KalYR2baNQi2znkd43iIAI-hls-cabal-plugin-ghc9.10.2.so
  18449. 1153.11 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18450. 1153.15 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-8CWkCrothtb9S8dskaPg2h-hls-cabal-fmt-plugin-ghc9.10.2.so
  18451. 1153.25 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-3KzG6RhXNVfJcOCkOFCWvu-hls-semantic-tokens-plugin-ghc9.10.2.so
  18452. 1153.34 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-Da8Jwyq21wM8zO3mU4kMZC-hls-ormolu-plugin-ghc9.10.2.so
  18453. 1153.45 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-3sACiwNVELX4CIRo73pgE8-hls-signature-help-plugin-ghc9.10.2.so
  18454. 1153.55 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-3tI4gxkPc2WEO3b71PSgIF-hls-cabal-gild-plugin-ghc9.10.2.so
  18455. 1153.65 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-JBwtz5YgqlqBj6qKXEVLUp-hls-notes-plugin-ghc9.10.2.so
  18456. 1153.73 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-CXMeZkQL56s6ly5MdOzzUD-hls-stylish-haskell-plugin-ghc9.10.2.so
  18457. 1153.78 s [extra] Phase: checkPhase
  18458. 1153.82 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-C8W1mlsQ3JpFt0o1njTgkc-hls-module-name-plugin-ghc9.10.2.so
  18459. 1153.91 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-L4TYyeBUNWgFZcTBT9dest-hls-stan-plugin-ghc9.10.2.so
  18460. 1153.98 s [extra] Running 1 test suites...
  18461. 1153.98 s [extra] Test suite extra-test: RUNNING...
  18462. 1153.98 s [extra] withTempFile
  18463. 1153.98 s [extra] +++ OK, passed 100 tests.
  18464. 1153.98 s [extra] captureOutput
  18465. 1153.98 s [extra] +++ OK, passed 100 tests.
  18466. 1153.98 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18467. 1154.01 s [extra] +++ OK, passed 100 tests.
  18468. 1154.01 s [extra] \(x :: IO Int) -> join (once x) == x
  18469. 1154.02 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-C0RFxe3uhTtLW93vmzi1HV-hls-rename-plugin-ghc9.10.2.so
  18470. 1154.03 s [extra] +++ OK, passed 100 tests.
  18471. 1154.03 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18472. 1154.06 s [extra] +++ OK, passed 100 tests.
  18473. 1154.06 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18474. 1154.09 s [extra] +++ OK, passed 100 tests.
  18475. 1154.09 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18476. 1154.11 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-J910YdpwcVWHkHhHfU1dzf-ghcide-bench-lib-ghc9.10.2.so
  18477. 1154.12 s [extra] +++ OK, passed 100 tests.
  18478. 1154.12 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18479. 1154.16 s [extra] +++ OK, passed 100 tests.
  18480. 1154.16 s [extra] stringException "test" == pure "test"
  18481. 1154.16 s [extra] +++ OK, passed 100 tests.
  18482. 1154.16 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18483. 1154.16 s [extra] +++ OK, passed 100 tests.
  18484. 1154.16 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18485. 1154.16 s [extra] +++ OK, passed 100 tests.
  18486. 1154.16 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18487. 1154.16 s [extra] +++ OK, passed 100 tests.
  18488. 1154.16 s [extra] ignore (print 1) == print 1
  18489. 1154.16 s [extra] +++ OK, passed 100 tests.
  18490. 1154.16 s [extra] ignore (fail "die") == pure ()
  18491. 1154.16 s [extra] +++ OK, passed 100 tests.
  18492. 1154.16 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18493. 1154.16 s [extra] +++ OK, passed 100 tests.
  18494. 1154.16 s [extra] seq (errorIO "foo") (print 1) == print 1
  18495. 1154.16 s [extra] +++ OK, passed 100 tests.
  18496. 1154.16 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18497. 1154.16 s [extra] +++ OK, passed 100 tests.
  18498. 1154.16 s [extra] seq (assertIO False) (print 1) == print 1
  18499. 1154.16 s [extra] +++ OK, passed 100 tests.
  18500. 1154.16 s [extra] retry 1 (print "x") == print "x"
  18501. 1154.16 s [extra] +++ OK, passed 100 tests.
  18502. 1154.16 s [extra] retry 3 (fail "die") == fail "die"
  18503. 1154.16 s [extra] +++ OK, passed 100 tests.
  18504. 1154.16 s [extra] whenJust Nothing print == pure ()
  18505. 1154.16 s [extra] +++ OK, passed 100 tests.
  18506. 1154.16 s [extra] whenJust (Just 1) print == print 1
  18507. 1154.16 s [extra] +++ OK, passed 100 tests.
  18508. 1154.16 s [extra] pureIf @Maybe True 5 == Just 5
  18509. 1154.16 s [extra] +++ OK, passed 100 tests.
  18510. 1154.16 s [extra] pureIf @Maybe False 5 == Nothing
  18511. 1154.16 s [extra] +++ OK, passed 100 tests.
  18512. 1154.16 s [extra] pureIf @[] True 5 == [5]
  18513. 1154.16 s [extra] +++ OK, passed 100 tests.
  18514. 1154.16 s [extra] pureIf @[] False 5 == []
  18515. 1154.16 s [extra] +++ OK, passed 100 tests.
  18516. 1154.16 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18517. 1154.17 s [extra] +++ OK, passed 100 tests.
  18518. 1154.17 s [extra] whenMaybe False (print 1) == pure Nothing
  18519. 1154.17 s [extra] +++ OK, passed 100 tests.
  18520. 1154.17 s [extra] \(x :: Maybe ()) -> unit x == x
  18521. 1154.17 s [extra] +++ OK, passed 100 tests.
  18522. 1154.17 s [extra] guarded even 2 == [2]
  18523. 1154.17 s [extra] +++ OK, passed 100 tests.
  18524. 1154.17 s [extra] guarded odd 2 == Nothing
  18525. 1154.17 s [extra] +++ OK, passed 100 tests.
  18526. 1154.17 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18527. 1154.17 s [extra] +++ OK, passed 100 tests.
  18528. 1154.17 s [extra] guardedA (return . even) 42 == Just [42]
  18529. 1154.17 s [extra] +++ OK, passed 100 tests.
  18530. 1154.17 s [extra] guardedA (return . odd) 42 == Just []
  18531. 1154.17 s [extra] +++ OK, passed 100 tests.
  18532. 1154.17 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18533. 1154.17 s [extra] +++ OK, passed 100 tests.
  18534. 1154.17 s [extra] fold1M (\x y -> Just x) [] == undefined
  18535. 1154.17 s [extra] +++ OK, passed 100 tests.
  18536. 1154.17 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18537. 1154.17 s [extra] +++ OK, passed 100 tests.
  18538. 1154.17 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18539. 1154.17 s [extra] +++ OK, passed 100 tests.
  18540. 1154.17 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18541. 1154.17 s [extra] +++ OK, passed 100 tests.
  18542. 1154.17 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18543. 1154.17 s [extra] +++ OK, passed 100 tests.
  18544. 1154.17 s [extra] Just True ||^ undefined == Just True
  18545. 1154.17 s [extra] +++ OK, passed 100 tests.
  18546. 1154.17 s [extra] Just False ||^ Just True == Just True
  18547. 1154.17 s [extra] +++ OK, passed 100 tests.
  18548. 1154.17 s [extra] Just False ||^ Just False == Just False
  18549. 1154.17 s [extra] +++ OK, passed 100 tests.
  18550. 1154.17 s [extra] Just False &&^ undefined == Just False
  18551. 1154.17 s [extra] +++ OK, passed 100 tests.
  18552. 1154.17 s [extra] Just True &&^ Just True == Just True
  18553. 1154.17 s [extra] +++ OK, passed 100 tests.
  18554. 1154.17 s [extra] Just True &&^ Just False == Just False
  18555. 1154.17 s [extra] +++ OK, passed 100 tests.
  18556. 1154.17 s [extra] anyM Just [False,True ,undefined] == Just True
  18557. 1154.17 s [extra] +++ OK, passed 100 tests.
  18558. 1154.17 s [extra] anyM Just [False,False,undefined] == undefined
  18559. 1154.17 s [extra] +++ OK, passed 100 tests.
  18560. 1154.17 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18561. 1154.17 s [extra] +++ OK, passed 100 tests.
  18562. 1154.17 s [extra] allM Just [True,False,undefined] == Just False
  18563. 1154.17 s [extra] +++ OK, passed 100 tests.
  18564. 1154.17 s [extra] allM Just [True,True ,undefined] == undefined
  18565. 1154.17 s [extra] +++ OK, passed 100 tests.
  18566. 1154.17 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18567. 1154.17 s [extra] +++ OK, passed 100 tests.
  18568. 1154.17 s [extra] orM [Just False,Just True ,undefined] == Just True
  18569. 1154.17 s [extra] +++ OK, passed 100 tests.
  18570. 1154.17 s [extra] orM [Just False,Just False,undefined] == undefined
  18571. 1154.17 s [extra] +++ OK, passed 100 tests.
  18572. 1154.17 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18573. 1154.17 s [extra] +++ OK, passed 100 tests.
  18574. 1154.17 s [extra] andM [Just True,Just False,undefined] == Just False
  18575. 1154.17 s [extra] +++ OK, passed 100 tests.
  18576. 1154.17 s [extra] andM [Just True,Just True ,undefined] == undefined
  18577. 1154.17 s [extra] +++ OK, passed 100 tests.
  18578. 1154.17 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18579. 1154.17 s [extra] +++ OK, passed 100 tests.
  18580. 1154.17 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18581. 1154.17 s [extra] +++ OK, passed 100 tests.
  18582. 1154.17 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18583. 1154.17 s [extra] +++ OK, passed 100 tests.
  18584. 1154.17 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18585. 1154.17 s [extra] +++ OK, passed 100 tests.
  18586. 1154.17 s [extra] fromLeft 1 (Left 3) == 3
  18587. 1154.17 s [extra] +++ OK, passed 100 tests.
  18588. 1154.17 s [extra] fromLeft 1 (Right "foo") == 1
  18589. 1154.17 s [extra] +++ OK, passed 100 tests.
  18590. 1154.17 s [extra] fromRight 1 (Right 3) == 3
  18591. 1154.17 s [extra] +++ OK, passed 100 tests.
  18592. 1154.17 s [extra] fromRight 1 (Left "foo") == 1
  18593. 1154.17 s [extra] +++ OK, passed 100 tests.
  18594. 1154.17 s [extra] \x -> fromLeft' (Left x) == x
  18595. 1154.18 s [extra] +++ OK, passed 100 tests.
  18596. 1154.18 s [extra] \x -> fromLeft' (Right x) == undefined
  18597. 1154.18 s [extra] +++ OK, passed 100 tests.
  18598. 1154.18 s [extra] \x -> fromRight' (Right x) == x
  18599. 1154.18 s [extra] +++ OK, passed 100 tests.
  18600. 1154.18 s [extra] \x -> fromRight' (Left x) == undefined
  18601. 1154.18 s [extra] +++ OK, passed 100 tests.
  18602. 1154.18 s [extra] \x -> fromEither (Left x ) == x
  18603. 1154.18 s [extra] +++ OK, passed 100 tests.
  18604. 1154.18 s [extra] \x -> fromEither (Right x) == x
  18605. 1154.18 s [extra] +++ OK, passed 100 tests.
  18606. 1154.18 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18607. 1154.18 s [extra] +++ OK, passed 100 tests.
  18608. 1154.18 s [extra] \a -> maybeToEither a Nothing == Left a
  18609. 1154.18 s [extra] +++ OK, passed 100 tests.
  18610. 1154.18 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18611. 1154.18 s [extra] +++ OK, passed 100 tests.
  18612. 1154.18 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18613. 1154.18 s [extra] +++ OK, passed 100 tests.
  18614. 1154.18 s [extra] mapLeft show (Left 1) == Left "1"
  18615. 1154.18 s [extra] +++ OK, passed 100 tests.
  18616. 1154.18 s [extra] mapLeft show (Right True) == Right True
  18617. 1154.18 s [extra] +++ OK, passed 100 tests.
  18618. 1154.18 s [extra] mapRight show (Left 1) == Left 1
  18619. 1154.18 s [extra] +++ OK, passed 100 tests.
  18620. 1154.18 s [extra] mapRight show (Right True) == Right "True"
  18621. 1154.18 s [extra] +++ OK, passed 100 tests.
  18622. 1154.18 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18623. 1154.18 s [extra] +++ OK, passed 100 tests.
  18624. 1154.18 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18625. 1154.18 s [extra] +++ OK, passed 100 tests.
  18626. 1154.18 s [extra] \xs -> repeatedly line1 xs == lines xs
  18627. 1154.18 s [extra] +++ OK, passed 100 tests.
  18628. 1154.18 s [extra] disjoint [1,2,3] [4,5] == True
  18629. 1154.18 s [extra] +++ OK, passed 100 tests.
  18630. 1154.18 s [extra] disjoint [1,2,3] [4,1] == False
  18631. 1154.18 s [extra] +++ OK, passed 100 tests.
  18632. 1154.18 s [extra] disjointOrd [1,2,3] [4,5] == True
  18633. 1154.18 s [extra] +++ OK, passed 100 tests.
  18634. 1154.18 s [extra] disjointOrd [1,2,3] [4,1] == False
  18635. 1154.18 s [extra] +++ OK, passed 100 tests.
  18636. 1154.18 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18637. 1154.18 s [extra] +++ OK, passed 100 tests.
  18638. 1154.18 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18639. 1154.18 s [extra] +++ OK, passed 100 tests.
  18640. 1154.18 s [extra] anySame [1,1,2] == True
  18641. 1154.18 s [extra] +++ OK, passed 100 tests.
  18642. 1154.18 s [extra] anySame [1,2,3] == False
  18643. 1154.18 s [extra] +++ OK, passed 100 tests.
  18644. 1154.18 s [extra] anySame (1:2:1:undefined) == True
  18645. 1154.18 s [extra] +++ OK, passed 100 tests.
  18646. 1154.18 s [extra] anySame [] == False
  18647. 1154.18 s [extra] +++ OK, passed 100 tests.
  18648. 1154.18 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18649. 1154.18 s [extra] +++ OK, passed 100 tests.
  18650. 1154.18 s [extra] allSame [1,1,2] == False
  18651. 1154.18 s [extra] +++ OK, passed 100 tests.
  18652. 1154.18 s [extra] allSame [1,1,1] == True
  18653. 1154.18 s [extra] +++ OK, passed 100 tests.
  18654. 1154.18 s [extra] allSame [1] == True
  18655. 1154.18 s [extra] +++ OK, passed 100 tests.
  18656. 1154.18 s [extra] allSame [] == True
  18657. 1154.18 s [extra] +++ OK, passed 100 tests.
  18658. 1154.18 s [extra] allSame (1:1:2:undefined) == False
  18659. 1154.18 s [extra] +++ OK, passed 100 tests.
  18660. 1154.18 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18661. 1154.18 s [extra] +++ OK, passed 100 tests.
  18662. 1154.18 s [extra] headDef 1 [] == 1
  18663. 1154.18 s [extra] +++ OK, passed 100 tests.
  18664. 1154.18 s [extra] headDef 1 [2,3,4] == 2
  18665. 1154.18 s [extra] +++ OK, passed 100 tests.
  18666. 1154.18 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18667. 1154.18 s [extra] +++ OK, passed 100 tests.
  18668. 1154.18 s [extra] lastDef 1 [] == 1
  18669. 1154.18 s [extra] +++ OK, passed 100 tests.
  18670. 1154.18 s [extra] lastDef 1 [2,3,4] == 4
  18671. 1154.18 s [extra] +++ OK, passed 100 tests.
  18672. 1154.18 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18673. 1154.18 s [extra] +++ OK, passed 100 tests.
  18674. 1154.18 s [extra] [2,3,4] !? 1 == Just 3
  18675. 1154.18 s [extra] +++ OK, passed 100 tests.
  18676. 1154.18 s [extra] [2,3,4] !? (-1) == Nothing
  18677. 1154.18 s [extra] +++ OK, passed 100 tests.
  18678. 1154.18 s [extra] [] !? 0 == Nothing
  18679. 1154.18 s [extra] +++ OK, passed 100 tests.
  18680. 1154.18 s [extra] notNull [] == False
  18681. 1154.18 s [extra] +++ OK, passed 100 tests.
  18682. 1154.18 s [extra] notNull [1] == True
  18683. 1154.18 s [extra] +++ OK, passed 100 tests.
  18684. 1154.18 s [extra] \xs -> notNull xs == not (null xs)
  18685. 1154.18 s [extra] +++ OK, passed 100 tests.
  18686. 1154.18 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18687. 1154.18 s [extra] +++ OK, passed 100 tests.
  18688. 1154.18 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18689. 1154.18 s [extra] +++ OK, passed 100 tests.
  18690. 1154.18 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  18691. 1154.19 s [extra] +++ OK, passed 100 tests.
  18692. 1154.19 s [extra] unsnoc "test" == Just ("tes",'t')
  18693. 1154.19 s [extra] +++ OK, passed 100 tests.
  18694. 1154.19 s [extra] unsnoc "" == Nothing
  18695. 1154.19 s [extra] +++ OK, passed 100 tests.
  18696. 1154.19 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  18697. 1154.19 s [extra] +++ OK, passed 100 tests.
  18698. 1154.19 s [extra] cons 't' "est" == "test"
  18699. 1154.19 s [extra] +++ OK, passed 100 tests.
  18700. 1154.19 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  18701. 1154.19 s [extra] +++ OK, passed 100 tests.
  18702. 1154.19 s [extra] snoc "tes" 't' == "test"
  18703. 1154.19 s [extra] +++ OK, passed 100 tests.
  18704. 1154.19 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  18705. 1154.19 s [extra] +++ OK, passed 100 tests.
  18706. 1154.19 s [extra] enumerate == [False, True]
  18707. 1154.19 s [extra] +++ OK, passed 100 tests.
  18708. 1154.19 s [extra] takeEnd 3 "hello" == "llo"
  18709. 1154.19 s [extra] +++ OK, passed 100 tests.
  18710. 1154.19 s [extra] takeEnd 5 "bye" == "bye"
  18711. 1154.19 s [extra] +++ OK, passed 100 tests.
  18712. 1154.19 s [extra] takeEnd (-1) "bye" == ""
  18713. 1154.19 s [extra] +++ OK, passed 100 tests.
  18714. 1154.19 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  18715. 1154.19 s [extra] +++ OK, passed 100 tests.
  18716. 1154.19 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  18717. 1154.19 s [extra] +++ OK, passed 100 tests.
  18718. 1154.19 s [extra] dropEnd 3 "hello" == "he"
  18719. 1154.19 s [extra] +++ OK, passed 100 tests.
  18720. 1154.19 s [extra] dropEnd 5 "bye" == ""
  18721. 1154.19 s [extra] +++ OK, passed 100 tests.
  18722. 1154.19 s [extra] dropEnd (-1) "bye" == "bye"
  18723. 1154.19 s [extra] +++ OK, passed 100 tests.
  18724. 1154.19 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  18725. 1154.19 s [extra] +++ OK, passed 100 tests.
  18726. 1154.19 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  18727. 1154.19 s [extra] +++ OK, passed 100 tests.
  18728. 1154.19 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  18729. 1154.19 s [extra] +++ OK, passed 100 tests.
  18730. 1154.19 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  18731. 1154.19 s [extra] +++ OK, passed 100 tests.
  18732. 1154.19 s [extra] splitAtEnd 3 "he" == ("", "he")
  18733. 1154.19 s [extra] +++ OK, passed 100 tests.
  18734. 1154.19 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  18735. 1154.19 s [extra] +++ OK, passed 100 tests.
  18736. 1154.19 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  18737. 1154.19 s [extra] +++ OK, passed 100 tests.
  18738. 1154.19 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  18739. 1154.19 s [extra] +++ OK, passed 100 tests.
  18740. 1154.19 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  18741. 1154.19 s [extra] +++ OK, passed 100 tests.
  18742. 1154.19 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  18743. 1154.19 s [extra] +++ OK, passed 100 tests.
  18744. 1154.19 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  18745. 1154.19 s [extra] +++ OK, passed 100 tests.
  18746. 1154.19 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  18747. 1154.19 s [extra] +++ OK, passed 100 tests.
  18748. 1154.19 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  18749. 1154.19 s [extra] +++ OK, passed 100 tests.
  18750. 1154.19 s [extra] trim " hello " == "hello"
  18751. 1154.19 s [extra] +++ OK, passed 100 tests.
  18752. 1154.19 s [extra] trimStart " hello " == "hello "
  18753. 1154.19 s [extra] +++ OK, passed 100 tests.
  18754. 1154.19 s [extra] trimEnd " hello " == " hello"
  18755. 1154.19 s [extra] +++ OK, passed 100 tests.
  18756. 1154.19 s [extra] \s -> trim s == trimEnd (trimStart s)
  18757. 1154.19 s [extra] +++ OK, passed 100 tests.
  18758. 1154.19 s [extra] lower "This is A TEST" == "this is a test"
  18759. 1154.19 s [extra] +++ OK, passed 100 tests.
  18760. 1154.19 s [extra] lower "" == ""
  18761. 1154.19 s [extra] +++ OK, passed 100 tests.
  18762. 1154.19 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  18763. 1154.19 s [extra] +++ OK, passed 100 tests.
  18764. 1154.19 s [extra] upper "" == ""
  18765. 1154.19 s [extra] +++ OK, passed 100 tests.
  18766. 1154.19 s [extra] word1 "" == ("", "")
  18767. 1154.19 s [extra] +++ OK, passed 100 tests.
  18768. 1154.19 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  18769. 1154.19 s [extra] +++ OK, passed 100 tests.
  18770. 1154.19 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  18771. 1154.19 s [extra] +++ OK, passed 100 tests.
  18772. 1154.19 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  18773. 1154.19 s [extra] +++ OK, passed 100 tests.
  18774. 1154.19 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  18775. 1154.19 s [extra] +++ OK, passed 100 tests.
  18776. 1154.19 s [extra] line1 "" == ("", "")
  18777. 1154.19 s [extra] +++ OK, passed 100 tests.
  18778. 1154.20 s [extra] line1 "test" == ("test","")
  18779. 1154.20 s [extra] +++ OK, passed 100 tests.
  18780. 1154.20 s [extra] line1 "test\n" == ("test","")
  18781. 1154.20 s [extra] +++ OK, passed 100 tests.
  18782. 1154.20 s [extra] line1 "test\nrest" == ("test","rest")
  18783. 1154.20 s [extra] +++ OK, passed 100 tests.
  18784. 1154.20 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  18785. 1154.20 s [extra] +++ OK, passed 100 tests.
  18786. 1154.20 s [extra] escapeHTML "this is a test" == "this is a test"
  18787. 1154.20 s [extra] +++ OK, passed 100 tests.
  18788. 1154.20 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  18789. 1154.20 s [extra] +++ OK, passed 100 tests.
  18790. 1154.20 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  18791. 1154.20 s [extra] +++ OK, passed 100 tests.
  18792. 1154.20 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  18793. 1154.20 s [extra] +++ OK, passed 100 tests.
  18794. 1154.20 s [extra] escapeJSON "this is a test" == "this is a test"
  18795. 1154.20 s [extra] +++ OK, passed 100 tests.
  18796. 1154.20 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  18797. 1154.20 s [extra] +++ OK, passed 100 tests.
  18798. 1154.20 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  18799. 1154.20 s [extra] +++ OK, passed 100 tests.
  18800. 1154.20 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  18801. 1154.20 s [extra] +++ OK, passed 100 tests.
  18802. 1154.20 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  18803. 1154.20 s [extra] +++ OK, passed 100 tests.
  18804. 1154.20 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  18805. 1154.20 s [extra] +++ OK, passed 100 tests.
  18806. 1154.20 s [extra] maximumOn id [] == undefined
  18807. 1154.20 s [extra] +++ OK, passed 100 tests.
  18808. 1154.20 s [extra] maximumOn length ["test","extra","a"] == "extra"
  18809. 1154.20 s [extra] +++ OK, passed 100 tests.
  18810. 1154.20 s [extra] minimumOn id [] == undefined
  18811. 1154.20 s [extra] +++ OK, passed 100 tests.
  18812. 1154.20 s [extra] minimumOn length ["test","extra","a"] == "a"
  18813. 1154.20 s [extra] +++ OK, passed 100 tests.
  18814. 1154.20 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  18815. 1154.20 s [extra] +++ OK, passed 100 tests.
  18816. 1154.20 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  18817. 1154.20 s [extra] +++ OK, passed 100 tests.
  18818. 1154.20 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  18819. 1154.20 s [extra] +++ OK, passed 100 tests.
  18820. 1154.20 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18821. 1154.20 s [extra] +++ OK, passed 100 tests.
  18822. 1154.20 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18823. 1154.20 s [extra] +++ OK, passed 100 tests.
  18824. 1154.20 s [extra] sum' [1, 2, 3] == 6
  18825. 1154.20 s [extra] +++ OK, passed 100 tests.
  18826. 1154.20 s [extra] sumOn' read ["1", "2", "3"] == 6
  18827. 1154.20 s [extra] +++ OK, passed 100 tests.
  18828. 1154.20 s [extra] product' [1, 2, 4] == 8
  18829. 1154.20 s [extra] +++ OK, passed 100 tests.
  18830. 1154.20 s [extra] productOn' read ["1", "2", "4"] == 8
  18831. 1154.20 s [extra] +++ OK, passed 100 tests.
  18832. 1154.20 s [extra] merge "ace" "bd" == "abcde"
  18833. 1154.20 s [extra] +++ OK, passed 100 tests.
  18834. 1154.20 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  18835. 1154.21 s [extra] +++ OK, passed 100 tests.
  18836. 1154.21 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  18837. 1154.21 s [extra] +++ OK, passed 100 tests.
  18838. 1154.21 s [extra] replace "el" "e" "Hello" == "Helo"
  18839. 1154.21 s [extra] +++ OK, passed 100 tests.
  18840. 1154.21 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  18841. 1154.21 s [extra] +++ OK, passed 100 tests.
  18842. 1154.21 s [extra] replace "" "x" "" == "x"
  18843. 1154.21 s [extra] +++ OK, passed 100 tests.
  18844. 1154.21 s [extra] \xs ys -> replace xs xs ys == ys
  18845. 1154.21 s [extra] +++ OK, passed 100 tests.
  18846. 1154.21 s [extra] breakEnd isLower "youRE" == ("you","RE")
  18847. 1154.21 s [extra] +++ OK, passed 100 tests.
  18848. 1154.21 s [extra] breakEnd isLower "youre" == ("youre","")
  18849. 1154.21 s [extra] +++ OK, passed 100 tests.
  18850. 1154.21 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  18851. 1154.21 s [extra] +++ OK, passed 100 tests.
  18852. 1154.21 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  18853. 1154.21 s [extra] +++ OK, passed 100 tests.
  18854. 1154.21 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  18855. 1154.21 s [extra] +++ OK, passed 100 tests.
  18856. 1154.21 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  18857. 1154.21 s [extra] +++ OK, passed 100 tests.
  18858. 1154.21 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  18859. 1154.21 s [extra] +++ OK, passed 100 tests.
  18860. 1154.21 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  18861. 1154.21 s [extra] +++ OK, passed 100 tests.
  18862. 1154.21 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  18863. 1154.21 s [extra] +++ OK, passed 100 tests.
  18864. 1154.21 s [extra] \s -> wordsBy isSpace s == words s
  18865. 1154.21 s [extra] +++ OK, passed 100 tests.
  18866. 1154.21 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  18867. 1154.21 s [extra] +++ OK, passed 100 tests.
  18868. 1154.21 s [extra] \s -> linesBy (== '\n') s == lines s
  18869. 1154.21 s [extra] +++ OK, passed 100 tests.
  18870. 1154.21 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  18871. 1154.21 s [extra] +++ OK, passed 100 tests.
  18872. 1154.21 s [extra] firstJust id [Nothing,Just 3] == Just 3
  18873. 1154.21 s [extra] +++ OK, passed 100 tests.
  18874. 1154.21 s [extra] firstJust id [Nothing,Nothing] == Nothing
  18875. 1154.21 s [extra] +++ OK, passed 100 tests.
  18876. 1154.21 s [extra] drop1 "" == ""
  18877. 1154.21 s [extra] +++ OK, passed 100 tests.
  18878. 1154.21 s [extra] drop1 "test" == "est"
  18879. 1154.21 s [extra] +++ OK, passed 100 tests.
  18880. 1154.21 s [extra] \xs -> drop 1 xs == drop1 xs
  18881. 1154.21 s [extra] +++ OK, passed 100 tests.
  18882. 1154.21 s [extra] dropEnd1 "" == ""
  18883. 1154.21 s [extra] +++ OK, passed 100 tests.
  18884. 1154.21 s [extra] dropEnd1 "test" == "tes"
  18885. 1154.21 s [extra] +++ OK, passed 100 tests.
  18886. 1154.21 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  18887. 1154.21 s [extra] +++ OK, passed 100 tests.
  18888. 1154.21 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  18889. 1154.21 s [extra] +++ OK, passed 100 tests.
  18890. 1154.21 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  18891. 1154.22 s [extra] +++ OK, passed 100 tests.
  18892. 1154.22 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  18893. 1154.22 s [extra] +++ OK, passed 100 tests.
  18894. 1154.22 s [extra] breakOn "/" "foobar" == ("foobar", "")
  18895. 1154.22 s [extra] +++ OK, passed 100 tests.
  18896. 1154.22 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  18897. 1154.22 s [extra] +++ OK, passed 100 tests.
  18898. 1154.22 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  18899. 1154.22 s [extra] +++ OK, passed 100 tests.
  18900. 1154.22 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  18901. 1154.22 s [extra] +++ OK, passed 100 tests.
  18902. 1154.22 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  18903. 1154.23 s [extra] +++ OK, passed 100 tests.
  18904. 1154.23 s [extra] splitOn "x" "x" == ["",""]
  18905. 1154.23 s [extra] +++ OK, passed 100 tests.
  18906. 1154.23 s [extra] splitOn "x" "" == [""]
  18907. 1154.23 s [extra] +++ OK, passed 100 tests.
  18908. 1154.23 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  18909. 1154.23 s [extra] +++ OK, passed 100 tests; 18 discarded.
  18910. 1154.23 s [extra] \c x -> splitOn [c] x == split (==c) x
  18911. 1154.23 s [extra] +++ OK, passed 100 tests.
  18912. 1154.23 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  18913. 1154.23 s [extra] +++ OK, passed 100 tests.
  18914. 1154.23 s [extra] split (== 'a') "" == [""]
  18915. 1154.23 s [extra] +++ OK, passed 100 tests.
  18916. 1154.23 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  18917. 1154.23 s [extra] +++ OK, passed 100 tests.
  18918. 1154.23 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  18919. 1154.23 s [extra] +++ OK, passed 100 tests.
  18920. 1154.23 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  18921. 1154.23 s [extra] +++ OK, passed 100 tests.
  18922. 1154.23 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  18923. 1154.23 s [extra] +++ OK, passed 100 tests.
  18924. 1154.23 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  18925. 1154.23 s [extra] +++ OK, passed 100 tests.
  18926. 1154.23 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  18927. 1154.23 s [extra] +++ OK, passed 100 tests.
  18928. 1154.23 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  18929. 1154.23 s [extra] +++ OK, passed 100 tests.
  18930. 1154.23 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  18931. 1154.23 s [extra] +++ OK, passed 100 tests.
  18932. 1154.23 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  18933. 1154.23 s [extra] +++ OK, passed 100 tests.
  18934. 1154.23 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  18935. 1154.23 s [extra] +++ OK, passed 100 tests.
  18936. 1154.23 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  18937. 1154.23 s [extra] +++ OK, passed 100 tests.
  18938. 1154.23 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  18939. 1154.23 s [extra] +++ OK, passed 100 tests.
  18940. 1154.23 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-DNMIJZubcfh9GlIyV06GIq-hls-explicit-fixity-plugin-ghc9.10.2.so
  18941. 1154.23 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  18942. 1154.23 s [extra] +++ OK, passed 100 tests.
  18943. 1154.23 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  18944. 1154.23 s [extra] +++ OK, passed 100 tests.
  18945. 1154.23 s [extra] stripSuffix "" "baz" == Just "baz"
  18946. 1154.23 s [extra] +++ OK, passed 100 tests.
  18947. 1154.23 s [extra] stripSuffix "foo" "quux" == Nothing
  18948. 1154.23 s [extra] +++ OK, passed 100 tests.
  18949. 1154.23 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  18950. 1154.23 s [extra] +++ OK, passed 100 tests.
  18951. 1154.23 s [extra] stripInfix "/" "foobar" == Nothing
  18952. 1154.23 s [extra] +++ OK, passed 100 tests.
  18953. 1154.23 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  18954. 1154.23 s [extra] +++ OK, passed 100 tests.
  18955. 1154.23 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  18956. 1154.23 s [extra] +++ OK, passed 100 tests.
  18957. 1154.23 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  18958. 1154.23 s [extra] +++ OK, passed 100 tests.
  18959. 1154.23 s [extra] chunksOf 8 "" == []
  18960. 1154.23 s [extra] +++ OK, passed 100 tests.
  18961. 1154.23 s [extra] chunksOf 0 "test" == undefined
  18962. 1154.23 s [extra] +++ OK, passed 100 tests.
  18963. 1154.23 s [extra] nubSort "this is a test" == " aehist"
  18964. 1154.23 s [extra] +++ OK, passed 100 tests.
  18965. 1154.23 s [extra] \xs -> nubSort xs == nub (sort xs)
  18966. 1154.23 s [extra] +++ OK, passed 100 tests.
  18967. 1154.23 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  18968. 1154.23 s [extra] +++ OK, passed 100 tests.
  18969. 1154.23 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  18970. 1154.23 s [extra] +++ OK, passed 100 tests.
  18971. 1154.23 s [extra] nubOrd "this is a test" == "this ae"
  18972. 1154.23 s [extra] +++ OK, passed 100 tests.
  18973. 1154.23 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  18974. 1154.23 s [extra] +++ OK, passed 100 tests.
  18975. 1154.23 s [extra] \xs -> nubOrd xs == nub xs
  18976. 1154.23 s [extra] +++ OK, passed 100 tests.
  18977. 1154.23 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  18978. 1154.23 s [extra] +++ OK, passed 100 tests.
  18979. 1154.23 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  18980. 1154.23 s [extra] +++ OK, passed 100 tests.
  18981. 1154.23 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  18982. 1154.23 s [extra] +++ OK, passed 100 tests.
  18983. 1154.23 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  18984. 1154.23 s [extra] +++ OK, passed 100 tests.
  18985. 1154.23 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  18986. 1154.23 s [extra] +++ OK, passed 100 tests.
  18987. 1154.23 s [extra] comparingLength [1,2,3] [False] == GT
  18988. 1154.23 s [extra] +++ OK, passed 100 tests.
  18989. 1154.23 s [extra] comparingLength [1,2] "ab" == EQ
  18990. 1154.23 s [extra] +++ OK, passed 100 tests.
  18991. 1154.23 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  18992. 1154.23 s [extra] +++ OK, passed 100 tests.
  18993. 1154.23 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  18994. 1154.23 s [extra] +++ OK, passed 100 tests.
  18995. 1154.23 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  18996. 1154.23 s [extra] +++ OK, passed 100 tests.
  18997. 1154.23 s [extra] mwhen True "test" == "test"
  18998. 1154.23 s [extra] +++ OK, passed 100 tests.
  18999. 1154.23 s [extra] mwhen False "test" == ""
  19000. 1154.23 s [extra] +++ OK, passed 100 tests.
  19001. 1154.23 s [extra] first succ (1,"test") == (2,"test")
  19002. 1154.23 s [extra] +++ OK, passed 100 tests.
  19003. 1154.23 s [extra] second reverse (1,"test") == (1,"tset")
  19004. 1154.23 s [extra] +++ OK, passed 100 tests.
  19005. 1154.23 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  19006. 1154.24 s [extra] +++ OK, passed 100 tests.
  19007. 1154.24 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  19008. 1154.24 s [extra] +++ OK, passed 100 tests.
  19009. 1154.24 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  19010. 1154.24 s [extra] +++ OK, passed 100 tests.
  19011. 1154.24 s [extra] (succ &&& pred) 1 == (2,0)
  19012. 1154.24 s [extra] +++ OK, passed 100 tests.
  19013. 1154.24 s [extra] dupe 12 == (12, 12)
  19014. 1154.24 s [extra] +++ OK, passed 100 tests.
  19015. 1154.24 s [extra] both succ (1,2) == (2,3)
  19016. 1154.24 s [extra] +++ OK, passed 100 tests.
  19017. 1154.24 s [extra] first3 succ (1,1,1) == (2,1,1)
  19018. 1154.24 s [extra] +++ OK, passed 100 tests.
  19019. 1154.24 s [extra] second3 succ (1,1,1) == (1,2,1)
  19020. 1154.24 s [extra] +++ OK, passed 100 tests.
  19021. 1154.24 s [extra] third3 succ (1,1,1) == (1,1,2)
  19022. 1154.24 s [extra] +++ OK, passed 100 tests.
  19023. 1154.24 s [extra] \x -> readVersion (showVersion x) == x
  19024. 1154.24 s [extra] +++ OK, passed 100 tests.
  19025. 1154.24 s [extra] readVersion "hello" == undefined
  19026. 1154.24 s [extra] +++ OK, passed 100 tests.
  19027. 1154.24 s [extra] showDP 4 pi == "3.1416"
  19028. 1154.24 s [extra] +++ OK, passed 100 tests.
  19029. 1154.24 s [extra] showDP 0 pi == "3"
  19030. 1154.24 s [extra] +++ OK, passed 100 tests.
  19031. 1154.24 s [extra] showDP 2 3 == "3.00"
  19032. 1154.24 s [extra] +++ OK, passed 100 tests.
  19033. 1154.24 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  19034. 1154.24 s [extra] +++ OK, passed 100 tests.
  19035. 1154.24 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  19036. 1154.24 s [extra] +++ OK, passed 100 tests.
  19037. 1154.24 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  19038. 1154.24 s [extra] +++ OK, passed 100 tests.
  19039. 1154.24 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  19040. 1154.24 s [extra] +++ OK, passed 100 tests.
  19041. 1154.24 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  19042. 1154.24 s [extra] +++ OK, passed 100 tests.
  19043. 1154.24 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19044. 1154.24 s [extra] +++ OK, passed 100 tests.
  19045. 1154.24 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19046. 1154.24 s [extra] +++ OK, passed 100 tests.
  19047. 1154.24 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  19048. 1154.24 s [extra] +++ OK, passed 100 tests.
  19049. 1154.24 s [extra] isWindows == (os == "mingw32")
  19050. 1154.24 s [extra] +++ OK, passed 100 tests.
  19051. 1154.24 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  19052. 1154.25 s [extra] +++ OK, passed 100 tests.
  19053. 1154.25 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  19054. 1154.27 s [extra] +++ OK, passed 100 tests.
  19055. 1154.27 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  19056. 1154.28 s [extra] +++ OK, passed 100 tests.
  19057. 1154.28 s [extra] captureOutput (print 1) == pure ("1\n",())
  19058. 1154.28 s [extra] +++ OK, passed 100 tests.
  19059. 1154.28 s [extra] withTempFile doesFileExist == pure True
  19060. 1154.28 s [extra] +++ OK, passed 100 tests.
  19061. 1154.28 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  19062. 1154.28 s [extra] +++ OK, passed 100 tests.
  19063. 1154.28 s [extra] withTempFile readFile' == pure ""
  19064. 1154.28 s [extra] +++ OK, passed 100 tests.
  19065. 1154.28 s [extra] withTempDir doesDirectoryExist == pure True
  19066. 1154.28 s [extra] +++ OK, passed 100 tests.
  19067. 1154.28 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  19068. 1154.28 s [extra] +++ OK, passed 100 tests.
  19069. 1154.28 s [extra] withTempDir listFiles == pure []
  19070. 1154.28 s [extra] +++ OK, passed 100 tests.
  19071. 1154.28 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  19072. 1154.28 s [extra] +++ OK, passed 100 tests.
  19073. 1154.28 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  19074. 1154.28 s [extra] +++ OK, passed 100 tests.
  19075. 1154.28 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  19076. 1154.28 s [extra] +++ OK, passed 100 tests.
  19077. 1154.28 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  19078. 1154.28 s [extra] +++ OK, passed 100 tests.
  19079. 1154.28 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  19080. 1154.28 s [extra] +++ OK, passed 100 tests.
  19081. 1154.29 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  19082. 1154.29 s [extra] +++ OK, passed 100 tests.
  19083. 1154.29 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  19084. 1154.32 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-CleWHFK0Pfh90Da9StOVBS-hls-alternate-number-format-plugin-ghc9.10.2.so
  19085. 1154.40 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-953QtenqNjt3bs4zOFsCHP-hls-qualify-imported-names-plugin-ghc9.10.2.so
  19086. 1154.49 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-1Frcj6iXJMy72D2euSmr0Y-hls-code-range-plugin-ghc9.10.2.so
  19087. 1154.58 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-Ji751QoOlyhC3eCtZm09Jw-hls-fourmolu-plugin-ghc9.10.2.so
  19088. 1154.67 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-Hr5xexEG8xaBIzletgpIst-hls-overloaded-record-dot-plugin-ghc9.10.2.so
  19089. 1154.75 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-CujleOGhwPr145gWPtrbW-hls-eval-plugin-ghc9.10.2.so
  19090. 1154.84 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-F6GzgYIp1eeHvnHR69Gpl8-hls-pragmas-plugin-ghc9.10.2.so
  19091. 1154.93 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-5pYiufbiM90KsrCU0y42Ef-hls-class-plugin-ghc9.10.2.so
  19092. 1155.03 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-FZOhsainwirEgYNcviEgjm-ghc9.10.2.so
  19093. 1155.13 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-Kd7QKRUWYjMDPlNncGkLD2-hls-explicit-record-fields-plugin-ghc9.10.2.so
  19094. 1155.21 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-CayC0sWH9rwjx5Rtzz6qR-hls-gadt-plugin-ghc9.10.2.so
  19095. 1155.29 s [extra] +++ OK, passed 100 tests.
  19096. 1155.29 s [extra] timeout (-3) (print 1) == pure Nothing
  19097. 1155.29 s [extra] +++ OK, passed 100 tests.
  19098. 1155.29 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  19099. 1155.29 s [extra] +++ OK, passed 100 tests.
  19100. 1155.29 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  19101. 1155.31 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-3XzWxY7MVBd8IYxTndipIN-hls-explicit-imports-plugin-ghc9.10.2.so
  19102. 1155.39 s [extra] 0.10158768700000001
  19103. 1155.39 s [extra] +++ OK, passed 100 tests.
  19104. 1155.39 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  19105. 1155.40 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHShaskell-language-server-2.12.0.0-IA24ksP3eDdGh9Qlg0QgwJ-hls-refactor-plugin-ghc9.10.2.so
  19106. 1155.49 s [extra] +++ OK, passed 100 tests.
  19107. 1155.49 s [extra] showDuration 3.435 == "3.44s"
  19108. 1155.49 s [extra] +++ OK, passed 100 tests.
  19109. 1155.49 s [extra] showDuration 623.8 == "10m24s"
  19110. 1155.49 s [extra] +++ OK, passed 100 tests.
  19111. 1155.49 s [extra] showDuration 62003.8 == "17h13m"
  19112. 1155.49 s [extra] +++ OK, passed 100 tests.
  19113. 1155.49 s [extra] showDuration 1e8 == "27777h47m"
  19114. 1155.49 s [extra] +++ OK, passed 100 tests.
  19115. 1155.49 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  19116. 1155.49 s [extra] +++ OK, passed 100 tests.
  19117. 1155.49 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  19118. 1155.49 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin/.haskell-language-server-9.10.2-unwrapped
  19119. 1155.62 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin/ghcide-bench
  19120. 1155.72 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin/ghcide-test-preprocessor
  19121. 1155.73 s [haskell-language-server] shrinking /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin/haskell-language-server-wrapper
  19122. 1155.85 s [haskell-language-server] checking for references to /build/ in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0...
  19123. 1155.97 s [haskell-language-server] patching script interpreter paths in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0
  19124. 1155.98 s [haskell-language-server] /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-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"
  19125. 1155.99 s [haskell-language-server] stripping (with command strip and flags -S -p) in /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/lib /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin
  19126. 1156.49 s [extra] +++ OK, passed 100 tests.
  19127. 1156.49 s [extra] Extra export
  19128. 1156.49 s [extra] +++ OK, passed 100 tests.
  19129. 1156.49 s [extra] withTempFile
  19130. 1156.50 s [extra] ....done
  19131. 1156.50 s [extra] withTempDir
  19132. 1156.51 s [extra] ....done
  19133. 1156.51 s [extra] retry
  19134. 1156.51 s [extra] +++ OK, passed 100 tests.
  19135. 1156.51 s [extra] barrier
  19136. 1156.51 s [extra] Success (325 tests)
  19137. 1156.53 s [extra] Test suite extra-test: PASS
  19138. 1156.53 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  19139. 1156.53 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  19140. 1156.54 s [extra] Phase: haddockPhase
  19141. 1156.65 s [extra] Preprocessing library for extra-1.8.1...
  19142. 1156.65 s [extra] Running Haddock on library for extra-1.8.1...
  19143. 1156.76 s [haskell-language-server] rewriting symlink /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0/bin/haskell-language-server-9.10.2 to be relative to /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0
  19144. 1158.40 s [haskell-language-server:post-build] Uploading to cachix cache "sellout": /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0
  19145. 1159.17 s [haskell-language-server:post-build] Pushing 1 paths (577 are already present) using zstd to cache sellout ⏳
  19146. 1159.17 s [haskell-language-server:post-build]
  19147. 1159.52 s [haskell-language-server:post-build] Pushing /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0 (110.92 MiB)
  19148. 1161.55 s [haskell-language-server:post-build]
  19149. 1161.55 s [haskell-language-server:post-build] All done.
  19150. 1161.57 s [haskell-language-server:post-build] Uploading to the NixCI cache: /nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0
  19151. 1161.60 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19152. 1161.65 s [haskell-language-server:post-build] copying 1 paths...
  19153. 1161.65 s [haskell-language-server:post-build] copying path '/nix/store/66wnh7rrdirmw8lyv8q90lxj1yffaqr1-haskell-language-server-2.12.0.0' to 'https://cache.nix-ci.com'...
  19154. 1181.69 s [haskell-language-server:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19155. 1182.02 s [haskell-language-server:post-build] copying 1 paths...
  19156. 1182.02 s [haskell-language-server:post-build] copying path '/nix/store/zpgmhvhh50k5q979d4ignm3anw32q6mj-haskell-language-server-2.12.0.0.drv' to 'https://cache.nix-ci.com'...
  19157. 1182.28 s Progress: 34 of 40 built (1 building), 760 of 760 downloaded from cache
  19158. 1182.28 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  19159. 1182.28 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  19160. 1182.28 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  19161. 1182.28 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  19162. 1182.28 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  19163. 1182.28 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  19164. 1182.28 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  19165. 1182.28 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  19166. 1182.28 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  19167. 1182.28 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  19168. 1182.28 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  19169. 1182.28 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  19170. 1182.28 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  19171. 1182.28 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  19172. 1182.28 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  19173. 1182.28 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  19174. 1182.28 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  19175. 1182.28 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  19176. 1182.28 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  19177. 1182.28 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  19178. 1182.28 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  19179. 1182.28 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  19180. 1182.28 s [extra] Haddock coverage:
  19181. 1182.28 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  19182. 1182.28 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  19183. 1182.28 s [extra] Warning: 'Arrow' is out of scope.
  19184. 1182.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19185. 1182.28 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  19186. 1182.28 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  19187. 1182.28 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  19188. 1182.28 s [extra] Warning: '(:)' is out of scope.
  19189. 1182.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19190. 1182.28 s [extra] Warning: 'unzip' is ambiguous. It is defined
  19191. 1182.28 s [extra] * in ‘GHC.Internal.Data.Functor’
  19192. 1182.28 s [extra] * in ‘GHC.Internal.List’
  19193. 1182.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19194. 1182.28 s [extra] by specifying the type/value namespace explicitly.
  19195. 1182.28 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  19196. 1182.28 s [extra] Warning: 'firstJustM' is out of scope.
  19197. 1182.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19198. 1182.28 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  19199. 1182.28 s [extra] Warning: 'Version' is ambiguous. It is defined
  19200. 1182.28 s [extra] * in ‘GHC.Internal.Data.Version’
  19201. 1182.28 s [extra] * in ‘GHC.Internal.Data.Version’
  19202. 1182.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19203. 1182.28 s [extra] by specifying the type/value namespace explicitly.
  19204. 1182.28 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  19205. 1182.28 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  19206. 1182.29 s [extra] Warning: 'length' is ambiguous. It is defined
  19207. 1182.29 s [extra] * in ‘Data.List.NonEmpty’
  19208. 1182.29 s [extra] * in ‘GHC.Internal.Data.Foldable’
  19209. 1182.29 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19210. 1182.29 s [extra] by specifying the type/value namespace explicitly.
  19211. 1182.29 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Foldable’
  19212. 1182.29 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  19213. 1182.29 s [extra] Warning: 'fromJust' is out of scope.
  19214. 1182.29 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19215. 1182.29 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  19216. 1182.29 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  19217. 1182.29 s [extra] * in ‘GHC.Internal.Exception’
  19218. 1182.29 s [extra] * in ‘GHC.Internal.Exception’
  19219. 1182.29 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19220. 1182.29 s [extra] by specifying the type/value namespace explicitly.
  19221. 1182.29 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  19222. 1182.29 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  19223. 1182.29 s [extra] * in ‘GHC.Internal.IO.Exception’
  19224. 1182.29 s [extra] * in ‘GHC.Internal.IO.Exception’
  19225. 1182.29 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19226. 1182.29 s [extra] by specifying the type/value namespace explicitly.
  19227. 1182.29 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  19228. 1182.29 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  19229. 1182.29 s [extra] * in ‘GHC.Internal.Exception.Type’
  19230. 1182.29 s [extra] * in ‘GHC.Internal.Exception.Type’
  19231. 1182.29 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19232. 1182.29 s [extra] by specifying the type/value namespace explicitly.
  19233. 1182.29 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  19234. 1182.29 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19235. 1182.29 s [extra] Warning: 'partition' is out of scope.
  19236. 1182.29 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19237. 1182.29 s [extra] Warning: 'mconcatMap' is out of scope.
  19238. 1182.29 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19239. 1182.29 s [extra] Warning: 'find' is out of scope.
  19240. 1182.29 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19241. 1182.29 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19242. 1182.29 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19243. 1182.29 s [extra] Missing documentation for:
  19244. 1182.29 s [extra] Module header
  19245. 1182.29 s [extra] Warning: 'Lock' is ambiguous. It is defined
  19246. 1182.29 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  19247. 1182.29 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  19248. 1182.29 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19249. 1182.29 s [extra] by specifying the type/value namespace explicitly.
  19250. 1182.29 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  19251. 1182.29 s [extra] Warning: 'Var' is ambiguous. It is defined
  19252. 1182.29 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  19253. 1182.29 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  19254. 1182.29 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19255. 1182.29 s [extra] by specifying the type/value namespace explicitly.
  19256. 1182.29 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  19257. 1182.29 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  19258. 1182.29 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  19259. 1182.29 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  19260. 1182.29 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19261. 1182.29 s [extra] by specifying the type/value namespace explicitly.
  19262. 1182.29 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  19263. 1182.29 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19264. 1182.29 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19265. 1182.29 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19266. 1182.29 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19267. 1182.29 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19268. 1182.29 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19269. 1182.29 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19270. 1182.29 s [extra] 100% (270 /270) in 'Extra'
  19271. 1182.29 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19272. 1182.29 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  19273. 1182.29 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  19274. 1182.29 s [extra] Phase: installPhase
  19275. 1182.29 s [extra] Installing library in /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  19276. 1182.29 s [extra] Phase: fixupPhase
  19277. 1182.29 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1
  19278. 1182.29 s [extra] shrinking /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHSextra-1.8.1-Ig0K6DueSOb9S8aIPhczgA-ghc9.10.2.so
  19279. 1182.29 s [extra] checking for references to /build/ in /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1...
  19280. 1182.29 s [extra] patching script interpreter paths in /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1
  19281. 1182.29 s [extra] stripping (with command strip and flags -S -p) in /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1/lib
  19282. 1182.29 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc
  19283. 1182.29 s [extra] checking for references to /build/ in /nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc...
  19284. 1182.29 s [extra] patching script interpreter paths in /nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc
  19285. 1182.36 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1
  19286. 1182.80 s [extra:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  19287. 1182.80 s [extra:post-build]
  19288. 1183.20 s [extra:post-build] Pushing /nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc (3.00 MiB)
  19289. 1183.22 s [extra:post-build] Pushing /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1 (4.15 MiB)
  19290. 1184.95 s [extra:post-build]
  19291. 1184.95 s [extra:post-build] All done.
  19292. 1184.96 s [extra:post-build] Uploading to the NixCI cache: /nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc /nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1
  19293. 1185.00 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19294. 1185.22 s [extra:post-build] copying 2 paths...
  19295. 1185.22 s [extra:post-build] copying path '/nix/store/acwv98lscidrdb8fd8lqy9filly8yi7z-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
  19296. 1185.58 s [extra:post-build] copying path '/nix/store/whjwyvsxr7qrxcqn9zphan71bfd5k5qn-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19297. 1187.19 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19298. 1187.43 s [extra:post-build] copying 1 paths...
  19299. 1187.50 s [extra:post-build] copying path '/nix/store/h6s1awbsya530ks0rl4yzkwq20p7vqf5-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  19300. 1187.65 s Progress: 35 of 40 built, 760 of 760 downloaded from cache
  19301. 1187.70 s Building /nix/store/vzy7xgpawcp3jbxm62ay0hj20a915lj3-algebraic-graphs-0.7.drv
  19302. 1187.77 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19303. 1187.78 s [algebraic-graphs] Build with /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2.
  19304. 1187.90 s [algebraic-graphs] Phase: unpackPhase
  19305. 1187.90 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19306. 1187.91 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19307. 1187.91 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19308. 1187.92 s [algebraic-graphs] Phase: patchPhase
  19309. 1187.92 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19310. 1187.92 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19311. 1187.92 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19312. 1187.93 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19313. 1187.93 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.OK01CaNbgU/setup-package.conf.d -threaded
  19314. 1187.97 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.OK01CaNbgU/Main.o )
  19315. 1188.01 s [algebraic-graphs] [2 of 2] Linking Setup
  19316. 1189.09 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19317. 1189.10 s [algebraic-graphs] Phase: configurePhase
  19318. 1189.11 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.OK01CaNbgU/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/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/lib
  19319. 1189.11 s [algebraic-graphs] Using Parsec parser
  19320. 1189.11 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19321. 1189.53 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19322. 1189.53 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.1.0
  19323. 1189.53 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  19324. 1189.53 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  19325. 1189.53 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  19326. 1189.53 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19327. 1189.53 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19328. 1189.53 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19329. 1189.53 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.1.0
  19330. 1189.53 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  19331. 1189.53 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  19332. 1189.53 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19333. 1189.53 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19334. 1189.53 s [algebraic-graphs] inspection-testing-0.6.2
  19335. 1189.53 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  19336. 1189.53 s [algebraic-graphs] Source component graph:
  19337. 1189.53 s [algebraic-graphs] component lib
  19338. 1189.53 s [algebraic-graphs] component test:main dependency lib
  19339. 1189.53 s [algebraic-graphs] Configured component graph:
  19340. 1189.53 s [algebraic-graphs] component algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  19341. 1189.53 s [algebraic-graphs] include array-0.5.8.0-cc9a
  19342. 1189.53 s [algebraic-graphs] include base-4.20.1.0-f445
  19343. 1189.53 s [algebraic-graphs] include containers-0.7-6571
  19344. 1189.53 s [algebraic-graphs] include deepseq-1.5.0.0-e166
  19345. 1189.53 s [algebraic-graphs] include transformers-0.6.1.1-05a6
  19346. 1189.53 s [algebraic-graphs] component algebraic-graphs-0.7-e0FJ3dDTRz3V78vTkrSJc-main
  19347. 1189.53 s [algebraic-graphs] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  19348. 1189.53 s [algebraic-graphs] include algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  19349. 1189.53 s [algebraic-graphs] include array-0.5.8.0-cc9a
  19350. 1189.53 s [algebraic-graphs] include base-4.20.1.0-f445
  19351. 1189.53 s [algebraic-graphs] include containers-0.7-6571
  19352. 1189.53 s [algebraic-graphs] include deepseq-1.5.0.0-e166
  19353. 1189.53 s [algebraic-graphs] include extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  19354. 1189.53 s [algebraic-graphs] include inspection-testing-0.6.2-9ZouDw5CKBu2o2seYbQlPO
  19355. 1189.53 s [algebraic-graphs] include transformers-0.6.1.1-05a6
  19356. 1189.53 s [algebraic-graphs] Linked component graph:
  19357. 1189.53 s [algebraic-graphs] unit algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  19358. 1189.53 s [algebraic-graphs] include array-0.5.8.0-cc9a
  19359. 1189.53 s [algebraic-graphs] include base-4.20.1.0-f445
  19360. 1189.53 s [algebraic-graphs] include containers-0.7-6571
  19361. 1189.53 s [algebraic-graphs] include deepseq-1.5.0.0-e166
  19362. 1189.53 s [algebraic-graphs] include transformers-0.6.1.1-05a6
  19363. 1189.53 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y:Data.Graph.Typed
  19364. 1189.53 s [algebraic-graphs] unit algebraic-graphs-0.7-e0FJ3dDTRz3V78vTkrSJc-main
  19365. 1189.53 s [algebraic-graphs] include QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  19366. 1189.53 s [algebraic-graphs] include algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  19367. 1189.53 s [algebraic-graphs] include array-0.5.8.0-cc9a
  19368. 1189.53 s [algebraic-graphs] include base-4.20.1.0-f445
  19369. 1189.53 s [algebraic-graphs] include containers-0.7-6571
  19370. 1189.53 s [algebraic-graphs] include deepseq-1.5.0.0-e166
  19371. 1189.53 s [algebraic-graphs] include extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  19372. 1189.53 s [algebraic-graphs] include inspection-testing-0.6.2-9ZouDw5CKBu2o2seYbQlPO
  19373. 1189.53 s [algebraic-graphs] include transformers-0.6.1.1-05a6
  19374. 1189.53 s [algebraic-graphs] Ready component graph:
  19375. 1189.53 s [algebraic-graphs] definite algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  19376. 1189.53 s [algebraic-graphs] depends array-0.5.8.0-cc9a
  19377. 1189.53 s [algebraic-graphs] depends base-4.20.1.0-f445
  19378. 1189.53 s [algebraic-graphs] depends containers-0.7-6571
  19379. 1189.53 s [algebraic-graphs] depends deepseq-1.5.0.0-e166
  19380. 1189.53 s [algebraic-graphs] depends transformers-0.6.1.1-05a6
  19381. 1189.53 s [algebraic-graphs] definite algebraic-graphs-0.7-e0FJ3dDTRz3V78vTkrSJc-main
  19382. 1189.53 s [algebraic-graphs] depends QuickCheck-2.15.0.1-DUfDZpgNKaDAMZVZ6HL1Lz
  19383. 1189.53 s [algebraic-graphs] depends algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  19384. 1189.53 s [algebraic-graphs] depends array-0.5.8.0-cc9a
  19385. 1189.53 s [algebraic-graphs] depends base-4.20.1.0-f445
  19386. 1189.53 s [algebraic-graphs] depends containers-0.7-6571
  19387. 1189.53 s [algebraic-graphs] depends deepseq-1.5.0.0-e166
  19388. 1189.53 s [algebraic-graphs] depends extra-1.8.1-Ig0K6DueSOb9S8aIPhczgA
  19389. 1189.53 s [algebraic-graphs] depends inspection-testing-0.6.2-9ZouDw5CKBu2o2seYbQlPO
  19390. 1189.53 s [algebraic-graphs] depends transformers-0.6.1.1-05a6
  19391. 1189.53 s [algebraic-graphs] Using Cabal-3.12.1.0 compiled by ghc-9.10
  19392. 1189.53 s [algebraic-graphs] Using compiler: ghc-9.10.2
  19393. 1189.53 s [algebraic-graphs] Using install prefix:
  19394. 1189.53 s [algebraic-graphs] /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7
  19395. 1189.53 s [algebraic-graphs] Executables installed in:
  19396. 1189.53 s [algebraic-graphs] /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/bin
  19397. 1189.53 s [algebraic-graphs] Libraries installed in:
  19398. 1189.53 s [algebraic-graphs] /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  19399. 1189.53 s [algebraic-graphs] Dynamic Libraries installed in:
  19400. 1189.53 s [algebraic-graphs] /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a
  19401. 1189.53 s [algebraic-graphs] Private executables installed in:
  19402. 1189.53 s [algebraic-graphs] /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.2-2a2a/algebraic-graphs-0.7
  19403. 1189.53 s [algebraic-graphs] Data files installed in:
  19404. 1189.53 s [algebraic-graphs] /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.2-2a2a/algebraic-graphs-0.7
  19405. 1189.53 s [algebraic-graphs] Documentation installed in:
  19406. 1189.53 s [algebraic-graphs] /nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19407. 1189.53 s [algebraic-graphs] Configuration files installed in:
  19408. 1189.53 s [algebraic-graphs] /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/etc
  19409. 1189.53 s [algebraic-graphs] No alex found
  19410. 1189.53 s [algebraic-graphs] Using ar found on system at:
  19411. 1189.53 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  19412. 1189.53 s [algebraic-graphs] No c2hs found
  19413. 1189.53 s [algebraic-graphs] No cpphs found
  19414. 1189.53 s [algebraic-graphs] No doctest found
  19415. 1189.53 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19416. 1189.53 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  19417. 1189.53 s [algebraic-graphs] Using ghc version 9.10.2 found on system at:
  19418. 1189.53 s [algebraic-graphs] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc
  19419. 1189.53 s [algebraic-graphs] Using ghc-pkg version 9.10.2 found on system at:
  19420. 1189.53 s [algebraic-graphs] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/ghc-pkg-9.10.2
  19421. 1189.53 s [algebraic-graphs] No ghcjs found
  19422. 1189.53 s [algebraic-graphs] No ghcjs-pkg found
  19423. 1189.53 s [algebraic-graphs] No greencard found
  19424. 1189.53 s [algebraic-graphs] Using haddock version 2.31.0 found on system at:
  19425. 1189.53 s [algebraic-graphs] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/haddock-ghc-9.10.2
  19426. 1189.53 s [algebraic-graphs] No happy found
  19427. 1189.53 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19428. 1189.53 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19429. 1189.53 s [algebraic-graphs] No hmake found
  19430. 1189.53 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  19431. 1189.54 s [algebraic-graphs] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hpc-ghc-9.10.2
  19432. 1189.54 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  19433. 1189.54 s [algebraic-graphs] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  19434. 1189.54 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19435. 1189.54 s [algebraic-graphs] /nix/store/yhwsn20b5l3lksyl2h8a95k62xqmxg1d-hscolour-1.25/bin/HsColour
  19436. 1189.54 s [algebraic-graphs] No jhc found
  19437. 1189.54 s [algebraic-graphs] Using ld found on system at:
  19438. 1189.54 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  19439. 1189.54 s [algebraic-graphs] No pkg-config found
  19440. 1189.54 s [algebraic-graphs] Using runghc version 9.10.2 found on system at:
  19441. 1189.54 s [algebraic-graphs] /nix/store/8rhg4lb7hvwqxivj65njwbdw0pf1jvd7-ghc-9.10.2/bin/runghc-9.10.2
  19442. 1189.54 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19443. 1189.54 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  19444. 1189.54 s [algebraic-graphs] Using tar found on system at:
  19445. 1189.54 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  19446. 1189.54 s [algebraic-graphs] No uhc found
  19447. 1189.70 s [algebraic-graphs] Phase: buildPhase
  19448. 1189.74 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  19449. 1189.74 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  19450. 1189.82 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 )
  19451. 1190.57 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 )
  19452. 1191.07 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 )
  19453. 1191.33 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 )
  19454. 1191.33 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19455. 1192.21 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 )
  19456. 1192.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 )
  19457. 1192.83 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 )
  19458. 1193.38 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 )
  19459. 1193.38 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 )
  19460. 1193.38 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 )
  19461. 1193.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19462. 1193.38 s [algebraic-graphs] In the use of ‘head’
  19463. 1193.38 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19464. 1193.38 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"."
  19465. 1193.38 s [algebraic-graphs] |
  19466. 1193.38 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19467. 1193.38 s [algebraic-graphs] | ^^^^
  19468. 1193.38 s [algebraic-graphs]
  19469. 1193.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19470. 1193.38 s [algebraic-graphs] In the use of ‘tail’
  19471. 1193.38 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19472. 1193.38 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"."
  19473. 1193.38 s [algebraic-graphs] |
  19474. 1193.38 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19475. 1193.38 s [algebraic-graphs] | ^^^^
  19476. 1193.38 s [algebraic-graphs]
  19477. 1193.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19478. 1193.38 s [algebraic-graphs] In the use of ‘head’
  19479. 1193.38 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19480. 1193.38 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"."
  19481. 1193.38 s [algebraic-graphs] |
  19482. 1193.38 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19483. 1193.38 s [algebraic-graphs] | ^^^^
  19484. 1193.38 s [algebraic-graphs]
  19485. 1193.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19486. 1193.38 s [algebraic-graphs] In the use of ‘tail’
  19487. 1193.38 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19488. 1193.38 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"."
  19489. 1193.38 s [algebraic-graphs] |
  19490. 1193.38 s [algebraic-graphs] 397 | bnd' = tail bnd
  19491. 1193.38 s [algebraic-graphs] | ^^^^
  19492. 1193.38 s [algebraic-graphs]
  19493. 1193.38 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 )
  19494. 1193.38 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 )
  19495. 1193.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19496. 1193.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19497. 1193.38 s [algebraic-graphs] will become an error in a future GHC release.
  19498. 1193.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19499. 1193.38 s [algebraic-graphs] |
  19500. 1193.38 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19501. 1193.38 s [algebraic-graphs] | ^
  19502. 1193.38 s [algebraic-graphs]
  19503. 1193.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19504. 1193.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19505. 1193.38 s [algebraic-graphs] will become an error in a future GHC release.
  19506. 1193.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19507. 1193.38 s [algebraic-graphs] |
  19508. 1193.38 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19509. 1193.38 s [algebraic-graphs] | ^
  19510. 1193.38 s [algebraic-graphs]
  19511. 1193.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19512. 1193.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19513. 1193.38 s [algebraic-graphs] will become an error in a future GHC release.
  19514. 1193.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19515. 1193.38 s [algebraic-graphs] |
  19516. 1193.38 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19517. 1193.38 s [algebraic-graphs] | ^
  19518. 1193.38 s [algebraic-graphs]
  19519. 1193.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19520. 1193.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19521. 1193.38 s [algebraic-graphs] will become an error in a future GHC release.
  19522. 1193.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19523. 1193.38 s [algebraic-graphs] |
  19524. 1193.38 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19525. 1193.38 s [algebraic-graphs] | ^
  19526. 1193.38 s [algebraic-graphs]
  19527. 1193.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19528. 1193.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19529. 1193.38 s [algebraic-graphs] will become an error in a future GHC release.
  19530. 1193.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19531. 1193.38 s [algebraic-graphs] |
  19532. 1193.38 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19533. 1193.38 s [algebraic-graphs] | ^
  19534. 1193.38 s [algebraic-graphs]
  19535. 1193.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19536. 1193.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19537. 1193.38 s [algebraic-graphs] will become an error in a future GHC release.
  19538. 1193.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19539. 1193.38 s [algebraic-graphs] |
  19540. 1193.38 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19541. 1193.38 s [algebraic-graphs] | ^
  19542. 1193.38 s [algebraic-graphs]
  19543. 1193.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19544. 1193.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19545. 1193.38 s [algebraic-graphs] will become an error in a future GHC release.
  19546. 1193.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19547. 1193.38 s [algebraic-graphs] |
  19548. 1193.38 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19549. 1193.38 s [algebraic-graphs] | ^
  19550. 1193.38 s [algebraic-graphs]
  19551. 1193.38 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 )
  19552. 1193.49 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 )
  19553. 1193.76 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 )
  19554. 1193.76 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 )
  19555. 1193.76 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 )
  19556. 1194.11 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 )
  19557. 1194.24 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 )
  19558. 1194.39 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 )
  19559. 1194.39 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19560. 1194.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19561. 1194.39 s [algebraic-graphs] will become an error in a future GHC release.
  19562. 1194.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19563. 1194.39 s [algebraic-graphs] |
  19564. 1194.39 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19565. 1194.39 s [algebraic-graphs] | ^
  19566. 1194.39 s [algebraic-graphs]
  19567. 1194.39 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 )
  19568. 1194.39 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19569. 1194.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19570. 1194.39 s [algebraic-graphs] will become an error in a future GHC release.
  19571. 1194.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19572. 1194.39 s [algebraic-graphs] |
  19573. 1194.39 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19574. 1194.39 s [algebraic-graphs] | ^
  19575. 1194.39 s [algebraic-graphs]
  19576. 1194.39 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19577. 1194.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19578. 1194.39 s [algebraic-graphs] will become an error in a future GHC release.
  19579. 1194.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19580. 1194.39 s [algebraic-graphs] |
  19581. 1194.39 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19582. 1194.39 s [algebraic-graphs] | ^
  19583. 1194.39 s [algebraic-graphs]
  19584. 1194.39 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 )
  19585. 1194.39 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 )
  19586. 1194.39 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 )
  19587. 1194.39 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 )
  19588. 1194.39 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 )
  19589. 1194.39 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 )
  19590. 1194.41 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 )
  19591. 1194.66 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19592. 1195.45 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19593. 1195.92 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 )
  19594. 1196.22 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19595. 1196.22 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19596. 1197.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 )
  19597. 1197.34 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 )
  19598. 1197.69 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 )
  19599. 1198.25 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19600. 1198.25 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 )
  19601. 1198.39 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 )
  19602. 1198.39 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19603. 1198.39 s [algebraic-graphs] In the use of ‘head’
  19604. 1198.39 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19605. 1198.39 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"."
  19606. 1198.39 s [algebraic-graphs] |
  19607. 1198.39 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19608. 1198.39 s [algebraic-graphs] | ^^^^
  19609. 1198.39 s [algebraic-graphs]
  19610. 1198.39 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19611. 1198.39 s [algebraic-graphs] In the use of ‘tail’
  19612. 1198.39 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19613. 1198.39 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"."
  19614. 1198.39 s [algebraic-graphs] |
  19615. 1198.39 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19616. 1198.39 s [algebraic-graphs] | ^^^^
  19617. 1198.39 s [algebraic-graphs]
  19618. 1198.39 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19619. 1198.39 s [algebraic-graphs] In the use of ‘head’
  19620. 1198.39 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19621. 1198.39 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"."
  19622. 1198.39 s [algebraic-graphs] |
  19623. 1198.39 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19624. 1198.39 s [algebraic-graphs] | ^^^^
  19625. 1198.39 s [algebraic-graphs]
  19626. 1198.39 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19627. 1198.39 s [algebraic-graphs] In the use of ‘tail’
  19628. 1198.39 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19629. 1198.39 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"."
  19630. 1198.39 s [algebraic-graphs] |
  19631. 1198.39 s [algebraic-graphs] 397 | bnd' = tail bnd
  19632. 1198.39 s [algebraic-graphs] | ^^^^
  19633. 1198.39 s [algebraic-graphs]
  19634. 1198.39 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 )
  19635. 1198.39 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19636. 1198.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19637. 1198.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19638. 1198.39 s [algebraic-graphs] will become an error in a future GHC release.
  19639. 1198.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19640. 1198.39 s [algebraic-graphs] |
  19641. 1198.39 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19642. 1198.39 s [algebraic-graphs] | ^
  19643. 1198.39 s [algebraic-graphs]
  19644. 1198.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19645. 1198.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19646. 1198.39 s [algebraic-graphs] will become an error in a future GHC release.
  19647. 1198.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19648. 1198.39 s [algebraic-graphs] |
  19649. 1198.39 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19650. 1198.39 s [algebraic-graphs] | ^
  19651. 1198.39 s [algebraic-graphs]
  19652. 1198.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19653. 1198.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19654. 1198.39 s [algebraic-graphs] will become an error in a future GHC release.
  19655. 1198.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19656. 1198.39 s [algebraic-graphs] |
  19657. 1198.39 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19658. 1198.39 s [algebraic-graphs] | ^
  19659. 1198.39 s [algebraic-graphs]
  19660. 1198.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19661. 1198.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19662. 1198.39 s [algebraic-graphs] will become an error in a future GHC release.
  19663. 1198.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19664. 1198.39 s [algebraic-graphs] |
  19665. 1198.39 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19666. 1198.39 s [algebraic-graphs] | ^
  19667. 1198.39 s [algebraic-graphs]
  19668. 1198.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19669. 1198.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19670. 1198.39 s [algebraic-graphs] will become an error in a future GHC release.
  19671. 1198.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19672. 1198.39 s [algebraic-graphs] |
  19673. 1198.39 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19674. 1198.39 s [algebraic-graphs] | ^
  19675. 1198.39 s [algebraic-graphs]
  19676. 1198.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19677. 1198.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19678. 1198.39 s [algebraic-graphs] will become an error in a future GHC release.
  19679. 1198.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19680. 1198.39 s [algebraic-graphs] |
  19681. 1198.39 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19682. 1198.39 s [algebraic-graphs] | ^
  19683. 1198.39 s [algebraic-graphs]
  19684. 1198.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19685. 1198.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19686. 1198.39 s [algebraic-graphs] will become an error in a future GHC release.
  19687. 1198.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19688. 1198.39 s [algebraic-graphs] |
  19689. 1198.39 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19690. 1198.39 s [algebraic-graphs] | ^
  19691. 1198.39 s [algebraic-graphs]
  19692. 1198.39 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19693. 1198.41 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
  19694. 1198.78 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19695. 1198.78 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 )
  19696. 1198.78 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19697. 1199.18 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 )
  19698. 1199.42 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 )
  19699. 1199.55 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19700. 1199.55 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19701. 1199.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19702. 1199.55 s [algebraic-graphs] will become an error in a future GHC release.
  19703. 1199.55 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19704. 1199.55 s [algebraic-graphs] |
  19705. 1199.55 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19706. 1199.55 s [algebraic-graphs] | ^
  19707. 1199.55 s [algebraic-graphs]
  19708. 1199.55 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 )
  19709. 1199.55 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19710. 1199.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19711. 1199.55 s [algebraic-graphs] will become an error in a future GHC release.
  19712. 1199.55 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19713. 1199.55 s [algebraic-graphs] |
  19714. 1199.55 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19715. 1199.55 s [algebraic-graphs] | ^
  19716. 1199.55 s [algebraic-graphs]
  19717. 1199.55 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19718. 1199.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19719. 1199.55 s [algebraic-graphs] will become an error in a future GHC release.
  19720. 1199.55 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19721. 1199.55 s [algebraic-graphs] |
  19722. 1199.55 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19723. 1199.55 s [algebraic-graphs] | ^
  19724. 1199.55 s [algebraic-graphs]
  19725. 1199.55 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19726. 1199.55 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19727. 1199.55 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 )
  19728. 1199.61 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 )
  19729. 1199.61 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 )
  19730. 1199.61 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 )
  19731. 1199.64 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19732. 1200.50 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  19733. 1200.51 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  19734. 1200.60 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 )
  19735. 1201.48 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 )
  19736. 1203.33 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 )
  19737. 1203.44 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 )
  19738. 1203.47 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 )
  19739. 1204.71 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 )
  19740. 1204.71 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 )
  19741. 1204.71 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 )
  19742. 1207.47 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 )
  19743. 1207.58 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 )
  19744. 1207.58 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 )
  19745. 1208.01 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 )
  19746. 1208.01 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 )
  19747. 1208.01 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 )
  19748. 1208.60 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 )
  19749. 1208.64 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 )
  19750. 1208.64 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 )
  19751. 1208.64 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 )
  19752. 1208.64 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 )
  19753. 1208.64 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 )
  19754. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19755. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19756. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19757. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19758. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19759. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19760. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19761. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19762. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19763. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19764. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19765. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19766. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19767. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19768. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19769. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19770. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19771. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19772. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19773. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19774. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19775. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19776. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19777. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19778. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19779. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19780. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19781. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19782. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19783. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19784. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19785. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19786. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19787. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19788. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19789. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19790. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19791. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19792. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19793. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19794. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19795. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19796. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19797. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19798. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19799. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19800. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19801. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19802. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19803. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19804. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19805. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19806. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19807. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19808. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19809. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19810. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19811. 1208.64 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19812. 1208.64 s [algebraic-graphs] inspection testing successful
  19813. 1208.64 s [algebraic-graphs] expected successes: 58
  19814. 1208.64 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 )
  19815. 1208.64 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 )
  19816. 1208.64 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 )
  19817. 1209.25 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19818. 1209.98 s [algebraic-graphs] Phase: checkPhase
  19819. 1210.13 s [algebraic-graphs] Running 1 test suites...
  19820. 1210.13 s [algebraic-graphs] Test suite main: RUNNING...
  19821. 1215.51 s [algebraic-graphs]
  19822. 1215.51 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19823. 1215.55 s [algebraic-graphs] OK: show empty == "empty"
  19824. 1215.55 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19825. 1215.55 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19826. 1215.55 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19827. 1215.55 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19828. 1215.55 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19829. 1215.55 s [algebraic-graphs]
  19830. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19831. 1215.55 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19832. 1215.55 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19833. 1215.55 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19834. 1215.55 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19835. 1215.55 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19836. 1215.55 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19837. 1215.55 s [algebraic-graphs]
  19838. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19839. 1215.55 s [algebraic-graphs] OK: isEmpty empty == True
  19840. 1215.55 s [algebraic-graphs] OK: hasVertex x empty == False
  19841. 1215.55 s [algebraic-graphs] OK: vertexCount empty == 0
  19842. 1215.55 s [algebraic-graphs] OK: edgeCount empty == 0
  19843. 1215.55 s [algebraic-graphs]
  19844. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19845. 1215.55 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19846. 1215.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19847. 1215.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19848. 1215.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19849. 1215.55 s [algebraic-graphs]
  19850. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19851. 1215.55 s [algebraic-graphs] OK: vertices [] == empty
  19852. 1215.55 s [algebraic-graphs] OK: vertices [x] == vertex x
  19853. 1215.55 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19854. 1215.55 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19855. 1215.55 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19856. 1215.55 s [algebraic-graphs]
  19857. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  19858. 1215.55 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  19859. 1215.55 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  19860. 1215.55 s [algebraic-graphs]
  19861. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  19862. 1215.55 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  19863. 1215.55 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  19864. 1215.55 s [algebraic-graphs]
  19865. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  19866. 1215.55 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19867. 1215.55 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19868. 1215.55 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19869. 1215.55 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  19870. 1215.55 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19871. 1215.55 s [algebraic-graphs]
  19872. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  19873. 1215.55 s [algebraic-graphs] OK: isEmpty empty == True
  19874. 1215.55 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19875. 1215.55 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19876. 1215.55 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  19877. 1215.55 s [algebraic-graphs]
  19878. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  19879. 1215.55 s [algebraic-graphs] OK: hasVertex x empty == False
  19880. 1215.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19881. 1215.55 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19882. 1215.55 s [algebraic-graphs]
  19883. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  19884. 1215.55 s [algebraic-graphs] OK: hasEdge x y empty == False
  19885. 1215.55 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19886. 1215.55 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  19887. 1215.55 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19888. 1215.55 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19889. 1215.55 s [algebraic-graphs]
  19890. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  19891. 1215.55 s [algebraic-graphs] OK: vertexCount empty == 0
  19892. 1215.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19893. 1215.55 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19894. 1215.55 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19895. 1215.55 s [algebraic-graphs]
  19896. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  19897. 1215.55 s [algebraic-graphs] OK: edgeCount empty == 0
  19898. 1215.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19899. 1215.55 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  19900. 1215.55 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19901. 1215.55 s [algebraic-graphs]
  19902. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  19903. 1215.55 s [algebraic-graphs] OK: vertexList empty == []
  19904. 1215.55 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19905. 1215.55 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19906. 1215.55 s [algebraic-graphs]
  19907. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  19908. 1215.55 s [algebraic-graphs] OK: edgeList empty == []
  19909. 1215.55 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19910. 1215.55 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  19911. 1215.55 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19912. 1215.55 s [algebraic-graphs]
  19913. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  19914. 1215.55 s [algebraic-graphs] OK: adjacencyList empty == []
  19915. 1215.55 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19916. 1215.55 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  19917. 1215.55 s [algebraic-graphs]
  19918. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  19919. 1215.55 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19920. 1215.55 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19921. 1215.55 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19922. 1215.55 s [algebraic-graphs]
  19923. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  19924. 1215.55 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19925. 1215.55 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19926. 1215.55 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  19927. 1215.55 s [algebraic-graphs]
  19928. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  19929. 1215.55 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19930. 1215.55 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19931. 1215.55 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  19932. 1215.55 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  19933. 1215.55 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  19934. 1215.55 s [algebraic-graphs]
  19935. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  19936. 1215.55 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19937. 1215.55 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19938. 1215.55 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  19939. 1215.55 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  19940. 1215.55 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  19941. 1215.55 s [algebraic-graphs]
  19942. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  19943. 1215.55 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19944. 1215.55 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19945. 1215.55 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  19946. 1215.55 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19947. 1215.55 s [algebraic-graphs]
  19948. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  19949. 1215.55 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  19950. 1215.55 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19951. 1215.55 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19952. 1215.55 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  19953. 1215.55 s [algebraic-graphs]
  19954. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  19955. 1215.55 s [algebraic-graphs] OK: transpose empty == empty
  19956. 1215.55 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19957. 1215.55 s [algebraic-graphs] OK: transpose . transpose == id
  19958. 1215.55 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19959. 1215.55 s [algebraic-graphs]
  19960. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  19961. 1215.55 s [algebraic-graphs] OK: induce (const True ) x == x
  19962. 1215.55 s [algebraic-graphs] OK: induce (const False) x == empty
  19963. 1215.55 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19964. 1215.55 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19965. 1215.55 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19966. 1215.55 s [algebraic-graphs]
  19967. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  19968. 1215.55 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19969. 1215.55 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  19970. 1215.55 s [algebraic-graphs]
  19971. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  19972. 1215.55 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  19973. 1215.55 s [algebraic-graphs]
  19974. 1215.55 s [algebraic-graphs] OK: box x y ~~ box y x
  19975. 1215.55 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19976. 1215.55 s [algebraic-graphs] OK: box x empty ~~ empty
  19977. 1215.55 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19978. 1215.55 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19979. 1215.55 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19980. 1215.55 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19981. 1215.55 s [algebraic-graphs]
  19982. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  19983. 1215.55 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19984. 1215.55 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19985. 1215.55 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  19986. 1215.55 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19987. 1215.55 s [algebraic-graphs]
  19988. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  19989. 1215.55 s [algebraic-graphs] OK: topSort empty == []
  19990. 1215.55 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  19991. 1215.55 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  19992. 1215.55 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  19993. 1215.55 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  19994. 1215.55 s [algebraic-graphs]
  19995. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  19996. 1215.55 s [algebraic-graphs] OK: scc empty == empty
  19997. 1215.55 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  19998. 1215.55 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  19999. 1215.55 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  20000. 1215.55 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20001. 1215.55 s [algebraic-graphs]
  20002. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  20003. 1215.55 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  20004. 1215.55 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  20005. 1215.55 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  20006. 1215.55 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  20007. 1215.55 s [algebraic-graphs]
  20008. 1215.55 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  20009. 1215.55 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  20010. 1215.55 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  20011. 1215.55 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  20012. 1215.55 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  20013. 1215.55 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  20014. 1215.55 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  20015. 1218.32 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  20016. 1218.32 s [algebraic-graphs]
  20017. 1218.32 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  20018. 1218.32 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  20019. 1218.32 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  20020. 1218.32 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  20021. 1218.32 s [algebraic-graphs]
  20022. 1218.32 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  20023. 1218.32 s [algebraic-graphs] OK: Arbitrary
  20024. 1218.32 s [algebraic-graphs] OK: empty
  20025. 1218.32 s [algebraic-graphs] OK: vertex
  20026. 1218.32 s [algebraic-graphs] OK: vertices
  20027. 1218.32 s [algebraic-graphs] OK: union
  20028. 1218.32 s [algebraic-graphs] OK: join
  20029. 1218.32 s [algebraic-graphs] OK: transpose
  20030. 1218.32 s [algebraic-graphs] OK: box
  20031. 1218.32 s [algebraic-graphs] OK: transitiveClosure
  20032. 1218.32 s [algebraic-graphs] OK: scc
  20033. 1218.32 s [algebraic-graphs] OK: toAcyclic
  20034. 1218.32 s [algebraic-graphs] OK: toAcyclicOrd
  20035. 1218.32 s [algebraic-graphs]
  20036. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap ============
  20037. 1218.32 s [algebraic-graphs] OK: Axioms of graphs
  20038. 1218.32 s [algebraic-graphs]
  20039. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  20040. 1218.32 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  20041. 1218.32 s [algebraic-graphs]
  20042. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  20043. 1218.32 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20044. 1218.32 s [algebraic-graphs]
  20045. 1218.32 s [algebraic-graphs] OK: consistent empty == True
  20046. 1218.32 s [algebraic-graphs] OK: consistent (vertex x) == True
  20047. 1218.32 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20048. 1218.32 s [algebraic-graphs] OK: consistent (connect x y) == True
  20049. 1218.32 s [algebraic-graphs] OK: consistent (edge x y) == True
  20050. 1218.32 s [algebraic-graphs] OK: consistent (edges xs) == True
  20051. 1218.32 s [algebraic-graphs] OK: consistent (stars xs) == True
  20052. 1218.32 s [algebraic-graphs]
  20053. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  20054. 1218.32 s [algebraic-graphs] OK: show (empty ) == "empty"
  20055. 1218.32 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20056. 1218.32 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20057. 1218.32 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20058. 1218.32 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20059. 1218.32 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20060. 1218.32 s [algebraic-graphs]
  20061. 1218.32 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20062. 1218.32 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20063. 1218.32 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20064. 1218.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20065. 1218.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20066. 1218.32 s [algebraic-graphs]
  20067. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  20068. 1218.32 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20069. 1218.32 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20070. 1218.32 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20071. 1218.32 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20072. 1218.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20073. 1218.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20074. 1218.32 s [algebraic-graphs] OK: x <= x + y
  20075. 1218.32 s [algebraic-graphs] OK: x + y <= x * y
  20076. 1218.32 s [algebraic-graphs]
  20077. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  20078. 1218.32 s [algebraic-graphs] OK: isEmpty empty == True
  20079. 1218.32 s [algebraic-graphs] OK: hasVertex x empty == False
  20080. 1218.32 s [algebraic-graphs] OK: vertexCount empty == 0
  20081. 1218.32 s [algebraic-graphs] OK: edgeCount empty == 0
  20082. 1218.32 s [algebraic-graphs]
  20083. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  20084. 1218.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20085. 1218.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20086. 1218.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20087. 1218.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20088. 1218.32 s [algebraic-graphs]
  20089. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  20090. 1218.32 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20091. 1218.32 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20092. 1218.32 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20093. 1218.32 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20094. 1218.32 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20095. 1218.32 s [algebraic-graphs]
  20096. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  20097. 1218.32 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20098. 1218.32 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20099. 1218.32 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20100. 1218.32 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20101. 1218.32 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20102. 1218.32 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20103. 1218.32 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20104. 1218.32 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20105. 1218.32 s [algebraic-graphs]
  20106. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  20107. 1218.32 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20108. 1218.32 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20109. 1218.32 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20110. 1218.32 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20111. 1218.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20112. 1218.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20113. 1218.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20114. 1218.32 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20115. 1218.32 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20116. 1218.32 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20117. 1218.32 s [algebraic-graphs]
  20118. 1218.32 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  20119. 1218.32 s [algebraic-graphs] OK: vertices [] == empty
  20120. 1218.32 s [algebraic-graphs] OK: vertices [x] == vertex x
  20121. 1218.32 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20122. 1218.32 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20123. 1218.32 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20124. 1218.32 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20125. 1218.33 s [algebraic-graphs]
  20126. 1218.33 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  20127. 1218.33 s [algebraic-graphs] OK: edges [] == empty
  20128. 1218.33 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20129. 1218.33 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20130. 1218.33 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20131. 1218.33 s [algebraic-graphs]
  20132. 1218.33 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  20133. 1218.33 s [algebraic-graphs] OK: overlays [] == empty
  20134. 1218.33 s [algebraic-graphs] OK: overlays [x] == x
  20135. 1218.33 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20136. 1218.33 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20137. 1218.33 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20138. 1218.33 s [algebraic-graphs]
  20139. 1218.33 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  20140. 1218.33 s [algebraic-graphs] OK: connects [] == empty
  20141. 1218.33 s [algebraic-graphs] OK: connects [x] == x
  20142. 1218.33 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20143. 1218.33 s [algebraic-graphs] OK: connects == foldr connect empty
  20144. 1218.33 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20145. 1218.33 s [algebraic-graphs]
  20146. 1218.33 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  20147. 1218.33 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  20148. 1218.33 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  20149. 1218.33 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  20150. 1218.33 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  20151. 1218.33 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  20152. 1218.33 s [algebraic-graphs]
  20153. 1218.33 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  20154. 1218.33 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20155. 1218.33 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20156. 1218.33 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20157. 1218.33 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20158. 1218.33 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20159. 1218.33 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20160. 1218.33 s [algebraic-graphs]
  20161. 1218.33 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  20162. 1218.33 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20163. 1218.33 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20164. 1218.33 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20165. 1218.33 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20166. 1218.33 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20167. 1218.33 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20168. 1218.33 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20169. 1218.33 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20170. 1218.33 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20171. 1218.33 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20172. 1218.33 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20173. 1218.33 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20174. 1218.33 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20175. 1218.33 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20176. 1218.33 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20177. 1218.33 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20178. 1218.33 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20179. 1218.33 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20180. 1218.33 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20181. 1218.33 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20182. 1218.33 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20183. 1218.33 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20184. 1218.33 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20185. 1218.33 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20186. 1218.33 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20187. 1218.33 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20188. 1218.33 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20189. 1218.33 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20190. 1218.33 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20191. 1218.33 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20192. 1218.33 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20193. 1218.33 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20194. 1218.33 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20195. 1218.33 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20196. 1219.04 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20197. 1219.04 s [algebraic-graphs]
  20198. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  20199. 1219.04 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20200. 1219.04 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20201. 1219.04 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20202. 1219.04 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20203. 1219.04 s [algebraic-graphs]
  20204. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  20205. 1219.04 s [algebraic-graphs] OK: isEmpty empty == True
  20206. 1219.04 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20207. 1219.04 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20208. 1219.04 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20209. 1219.04 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20210. 1219.04 s [algebraic-graphs]
  20211. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  20212. 1219.04 s [algebraic-graphs] OK: hasVertex x empty == False
  20213. 1219.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20214. 1219.04 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20215. 1219.04 s [algebraic-graphs]
  20216. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  20217. 1219.04 s [algebraic-graphs] OK: hasEdge x y empty == False
  20218. 1219.04 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20219. 1219.04 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20220. 1219.04 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20221. 1219.04 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20222. 1219.04 s [algebraic-graphs]
  20223. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20224. 1219.04 s [algebraic-graphs] OK: vertexCount empty == 0
  20225. 1219.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20226. 1219.04 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20227. 1219.04 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20228. 1219.04 s [algebraic-graphs]
  20229. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20230. 1219.04 s [algebraic-graphs] OK: edgeCount empty == 0
  20231. 1219.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20232. 1219.04 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20233. 1219.04 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20234. 1219.04 s [algebraic-graphs]
  20235. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20236. 1219.04 s [algebraic-graphs] OK: vertexList empty == []
  20237. 1219.04 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20238. 1219.04 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20239. 1219.04 s [algebraic-graphs]
  20240. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20241. 1219.04 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20242. 1219.04 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20243. 1219.04 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20244. 1219.04 s [algebraic-graphs]
  20245. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20246. 1219.04 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20247. 1219.04 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20248. 1219.04 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20249. 1219.04 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20250. 1219.04 s [algebraic-graphs]
  20251. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20252. 1219.04 s [algebraic-graphs] OK: edgeList empty == []
  20253. 1219.04 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20254. 1219.04 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20255. 1219.04 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20256. 1219.04 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20257. 1219.04 s [algebraic-graphs]
  20258. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20259. 1219.04 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20260. 1219.04 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20261. 1219.04 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20262. 1219.04 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20263. 1219.04 s [algebraic-graphs]
  20264. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20265. 1219.04 s [algebraic-graphs] OK: adjacencyList empty == []
  20266. 1219.04 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20267. 1219.04 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20268. 1219.04 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20269. 1219.04 s [algebraic-graphs]
  20270. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20271. 1219.04 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20272. 1219.04 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20273. 1219.04 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20274. 1219.04 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20275. 1219.04 s [algebraic-graphs]
  20276. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20277. 1219.04 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20278. 1219.04 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20279. 1219.04 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20280. 1219.04 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20281. 1219.04 s [algebraic-graphs]
  20282. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20283. 1219.04 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20284. 1219.04 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20285. 1219.04 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20286. 1219.04 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20287. 1219.04 s [algebraic-graphs]
  20288. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20289. 1219.04 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20290. 1219.04 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20291. 1219.04 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20292. 1219.04 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20293. 1219.04 s [algebraic-graphs]
  20294. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20295. 1219.04 s [algebraic-graphs] OK: path [] == empty
  20296. 1219.04 s [algebraic-graphs] OK: path [x] == vertex x
  20297. 1219.04 s [algebraic-graphs] OK: path [x,y] == edge x y
  20298. 1219.04 s [algebraic-graphs]
  20299. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20300. 1219.04 s [algebraic-graphs] OK: circuit [] == empty
  20301. 1219.04 s [algebraic-graphs] OK: circuit [x] == edge x x
  20302. 1219.04 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20303. 1219.04 s [algebraic-graphs]
  20304. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20305. 1219.04 s [algebraic-graphs] OK: clique [] == empty
  20306. 1219.04 s [algebraic-graphs] OK: clique [x] == vertex x
  20307. 1219.04 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20308. 1219.04 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20309. 1219.04 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20310. 1219.04 s [algebraic-graphs]
  20311. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20312. 1219.04 s [algebraic-graphs] OK: biclique [] [] == empty
  20313. 1219.04 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20314. 1219.04 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20315. 1219.04 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20316. 1219.04 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20317. 1219.04 s [algebraic-graphs]
  20318. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20319. 1219.04 s [algebraic-graphs] OK: star x [] == vertex x
  20320. 1219.04 s [algebraic-graphs] OK: star x [y] == edge x y
  20321. 1219.04 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20322. 1219.04 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20323. 1219.04 s [algebraic-graphs]
  20324. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20325. 1219.04 s [algebraic-graphs] OK: stars [] == empty
  20326. 1219.04 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20327. 1219.04 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20328. 1219.04 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20329. 1219.04 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20330. 1219.04 s [algebraic-graphs] OK: stars . adjacencyList == id
  20331. 1219.04 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20332. 1219.04 s [algebraic-graphs]
  20333. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20334. 1219.04 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20335. 1219.04 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20336. 1219.04 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20337. 1219.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)]
  20338. 1219.04 s [algebraic-graphs]
  20339. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20340. 1219.04 s [algebraic-graphs] OK: forest [] == empty
  20341. 1219.04 s [algebraic-graphs] OK: forest [x] == tree x
  20342. 1219.04 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20343. 1219.04 s [algebraic-graphs] OK: forest == overlays . map tree
  20344. 1219.04 s [algebraic-graphs]
  20345. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20346. 1219.04 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20347. 1219.04 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20348. 1219.04 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20349. 1219.04 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20350. 1219.04 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20351. 1219.04 s [algebraic-graphs]
  20352. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20353. 1219.04 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20354. 1219.04 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20355. 1219.04 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20356. 1219.04 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20357. 1219.04 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20358. 1219.04 s [algebraic-graphs]
  20359. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20360. 1219.04 s [algebraic-graphs] OK: replaceVertex x x == id
  20361. 1219.04 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20362. 1219.04 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20363. 1219.04 s [algebraic-graphs]
  20364. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20365. 1219.04 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20366. 1219.04 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20367. 1219.04 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20368. 1219.04 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20369. 1219.04 s [algebraic-graphs]
  20370. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20371. 1219.04 s [algebraic-graphs] OK: transpose empty == empty
  20372. 1219.04 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20373. 1219.04 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20374. 1219.04 s [algebraic-graphs] OK: transpose . transpose == id
  20375. 1219.04 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20376. 1219.04 s [algebraic-graphs]
  20377. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20378. 1219.04 s [algebraic-graphs] OK: gmap f empty == empty
  20379. 1219.04 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20380. 1219.04 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20381. 1219.04 s [algebraic-graphs] OK: gmap id == id
  20382. 1219.04 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20383. 1219.04 s [algebraic-graphs]
  20384. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20385. 1219.04 s [algebraic-graphs] OK: induce (const True ) x == x
  20386. 1219.04 s [algebraic-graphs] OK: induce (const False) x == empty
  20387. 1219.04 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20388. 1219.04 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20389. 1219.04 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20390. 1219.04 s [algebraic-graphs]
  20391. 1219.04 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20392. 1219.04 s [algebraic-graphs] OK: compose empty x == empty
  20393. 1219.04 s [algebraic-graphs] OK: compose x empty == empty
  20394. 1219.04 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20395. 1219.04 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20396. 1219.04 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20397. 1219.04 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20398. 1219.25 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20399. 1219.25 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20400. 1219.25 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20401. 1219.25 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20402. 1219.25 s [algebraic-graphs]
  20403. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20404. 1219.25 s [algebraic-graphs] OK: closure empty == empty
  20405. 1219.25 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20406. 1219.25 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20407. 1219.25 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20408. 1219.25 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20409. 1219.25 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20410. 1219.25 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20411. 1219.25 s [algebraic-graphs] OK: closure . closure == closure
  20412. 1219.25 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20413. 1219.25 s [algebraic-graphs]
  20414. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20415. 1219.25 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20416. 1219.25 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20417. 1219.25 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20418. 1219.25 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20419. 1219.25 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20420. 1219.25 s [algebraic-graphs]
  20421. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20422. 1219.25 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20423. 1219.25 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20424. 1219.25 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20425. 1219.25 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20426. 1219.25 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20427. 1219.25 s [algebraic-graphs]
  20428. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20429. 1219.25 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20430. 1219.25 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20431. 1219.25 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20432. 1219.25 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20433. 1219.25 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20434. 1219.25 s [algebraic-graphs]
  20435. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20436. 1219.25 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20437. 1219.25 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20438. 1219.25 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20439. 1219.25 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20440. 1219.25 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20441. 1219.25 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20442. 1219.25 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20443. 1219.25 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20444. 1219.25 s [algebraic-graphs] OK: bfsForest x [] == []
  20445. 1219.25 s [algebraic-graphs] OK: bfsForest empty vs == []
  20446. 1219.25 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20447. 1219.25 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20448. 1219.25 s [algebraic-graphs]
  20449. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20450. 1219.25 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20451. 1219.25 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20452. 1219.25 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20453. 1219.25 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20454. 1219.25 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20455. 1219.25 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20456. 1219.25 s [algebraic-graphs] OK: bfs empty vs == []
  20457. 1219.25 s [algebraic-graphs] OK: bfs x [] == []
  20458. 1219.25 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20459. 1219.25 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20460. 1219.25 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20461. 1219.25 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20462. 1219.25 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20463. 1219.25 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20464. 1219.25 s [algebraic-graphs]
  20465. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20466. 1219.25 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20467. 1219.25 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20468. 1219.25 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20469. 1219.25 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20470. 1219.25 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20471. 1219.25 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20472. 1219.25 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20473. 1219.25 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20474. 1219.25 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20475. 1219.25 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20476. 1219.25 s [algebraic-graphs]
  20477. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20478. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20479. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20480. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20481. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20482. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20483. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20484. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20485. 1219.25 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20486. 1219.25 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20487. 1219.25 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20488. 1219.25 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20489. 1219.25 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20490. 1219.25 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20491. 1219.25 s [algebraic-graphs]
  20492. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20493. 1219.25 s [algebraic-graphs] OK: dfs empty vs == []
  20494. 1219.25 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20495. 1219.25 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20496. 1219.25 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20497. 1219.25 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20498. 1219.25 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20499. 1219.25 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20500. 1219.25 s [algebraic-graphs] OK: dfs x [] == []
  20501. 1219.25 s [algebraic-graphs]
  20502. 1219.25 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20503. 1219.25 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20504. 1219.25 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20505. 1219.25 s [algebraic-graphs]
  20506. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20507. 1219.25 s [algebraic-graphs] OK: reachable empty x == []
  20508. 1219.25 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20509. 1219.25 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20510. 1219.25 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20511. 1219.25 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20512. 1219.25 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20513. 1219.25 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20514. 1219.25 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20515. 1219.25 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20516. 1219.25 s [algebraic-graphs]
  20517. 1219.25 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20518. 1219.25 s [algebraic-graphs]
  20519. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20520. 1219.25 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20521. 1219.25 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20522. 1219.25 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20523. 1219.25 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20524. 1219.25 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20525. 1219.25 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20526. 1219.25 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20527. 1219.25 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20528. 1219.25 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20529. 1219.25 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20530. 1219.25 s [algebraic-graphs]
  20531. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20532. 1219.25 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20533. 1219.25 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20534. 1219.25 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20535. 1219.25 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20536. 1219.25 s [algebraic-graphs]
  20537. 1219.25 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20538. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20539. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20540. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20541. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20542. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20543. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20544. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20545. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20546. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20547. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20548. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20549. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20550. 1219.25 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20551. 1223.11 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20552. 1223.11 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20553. 1223.24 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20554. 1223.24 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20555. 1223.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20556. 1223.24 s [algebraic-graphs]
  20557. 1223.24 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20558. 1223.24 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20559. 1223.24 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20560. 1223.24 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20561. 1223.24 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20562. 1223.24 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20563. 1223.24 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20564. 1223.24 s [algebraic-graphs]
  20565. 1223.24 s [algebraic-graphs] ============ AdjacencyMap ============
  20566. 1223.24 s [algebraic-graphs] OK: Axioms of graphs
  20567. 1223.24 s [algebraic-graphs]
  20568. 1223.24 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20569. 1223.24 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20570. 1223.24 s [algebraic-graphs]
  20571. 1223.24 s [algebraic-graphs] OK: consistent empty == True
  20572. 1223.24 s [algebraic-graphs] OK: consistent (vertex x) == True
  20573. 1223.24 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20574. 1223.24 s [algebraic-graphs] OK: consistent (connect x y) == True
  20575. 1223.24 s [algebraic-graphs] OK: consistent (edge x y) == True
  20576. 1223.24 s [algebraic-graphs] OK: consistent (edges xs) == True
  20577. 1223.24 s [algebraic-graphs] OK: consistent (stars xs) == True
  20578. 1223.24 s [algebraic-graphs]
  20579. 1223.24 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20580. 1223.24 s [algebraic-graphs] OK: show (empty ) == "empty"
  20581. 1223.24 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20582. 1223.24 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20583. 1223.24 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20584. 1223.24 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20585. 1223.24 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20586. 1223.24 s [algebraic-graphs]
  20587. 1223.24 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20588. 1223.24 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20589. 1223.24 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20590. 1223.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20591. 1223.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20592. 1223.24 s [algebraic-graphs]
  20593. 1223.24 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20594. 1223.24 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20595. 1223.24 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20596. 1223.24 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20597. 1223.24 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20598. 1223.24 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20599. 1223.24 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20600. 1223.24 s [algebraic-graphs] OK: x <= x + y
  20601. 1223.24 s [algebraic-graphs] OK: x + y <= x * y
  20602. 1223.24 s [algebraic-graphs]
  20603. 1223.24 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20604. 1223.24 s [algebraic-graphs] OK: isEmpty empty == True
  20605. 1223.24 s [algebraic-graphs] OK: hasVertex x empty == False
  20606. 1223.24 s [algebraic-graphs] OK: vertexCount empty == 0
  20607. 1223.24 s [algebraic-graphs] OK: edgeCount empty == 0
  20608. 1223.24 s [algebraic-graphs]
  20609. 1223.24 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20610. 1223.24 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20611. 1223.24 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20612. 1223.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20613. 1223.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20614. 1223.24 s [algebraic-graphs]
  20615. 1223.24 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20616. 1223.24 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20617. 1223.24 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20618. 1223.24 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20619. 1223.24 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20620. 1223.24 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20621. 1223.24 s [algebraic-graphs]
  20622. 1223.24 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20623. 1223.25 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20624. 1223.25 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20625. 1223.25 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20626. 1223.25 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20627. 1223.25 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20628. 1223.25 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20629. 1223.25 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20630. 1223.25 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20631. 1223.25 s [algebraic-graphs]
  20632. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20633. 1223.25 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20634. 1223.25 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20635. 1223.25 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20636. 1223.25 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20637. 1223.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20638. 1223.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20639. 1223.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20640. 1223.25 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20641. 1223.25 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20642. 1223.25 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20643. 1223.25 s [algebraic-graphs]
  20644. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20645. 1223.25 s [algebraic-graphs] OK: vertices [] == empty
  20646. 1223.25 s [algebraic-graphs] OK: vertices [x] == vertex x
  20647. 1223.25 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20648. 1223.25 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20649. 1223.25 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20650. 1223.25 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20651. 1223.25 s [algebraic-graphs]
  20652. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20653. 1223.25 s [algebraic-graphs] OK: edges [] == empty
  20654. 1223.25 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20655. 1223.25 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20656. 1223.25 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20657. 1223.25 s [algebraic-graphs]
  20658. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20659. 1223.25 s [algebraic-graphs] OK: overlays [] == empty
  20660. 1223.25 s [algebraic-graphs] OK: overlays [x] == x
  20661. 1223.25 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20662. 1223.25 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20663. 1223.25 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20664. 1223.25 s [algebraic-graphs]
  20665. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20666. 1223.25 s [algebraic-graphs] OK: connects [] == empty
  20667. 1223.25 s [algebraic-graphs] OK: connects [x] == x
  20668. 1223.25 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20669. 1223.25 s [algebraic-graphs] OK: connects == foldr connect empty
  20670. 1223.25 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20671. 1223.25 s [algebraic-graphs]
  20672. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20673. 1223.25 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20674. 1223.25 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20675. 1223.25 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20676. 1223.25 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20677. 1223.25 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20678. 1223.25 s [algebraic-graphs]
  20679. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20680. 1223.25 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20681. 1223.25 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20682. 1223.25 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20683. 1223.25 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20684. 1223.25 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20685. 1223.25 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20686. 1223.25 s [algebraic-graphs]
  20687. 1223.25 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20688. 1223.25 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20689. 1223.25 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20690. 1223.25 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20691. 1223.25 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20692. 1223.25 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20693. 1223.25 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20694. 1223.25 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20695. 1223.25 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20696. 1223.25 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20697. 1223.25 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20698. 1223.25 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20699. 1223.25 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20700. 1223.25 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20701. 1223.25 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20702. 1223.25 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20703. 1223.25 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20704. 1223.25 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20705. 1223.25 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20706. 1223.25 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20707. 1223.25 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20708. 1223.25 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20709. 1223.25 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20710. 1223.25 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20711. 1223.25 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20712. 1223.25 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20713. 1223.25 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20714. 1223.25 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20715. 1223.25 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20716. 1223.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20717. 1223.25 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20718. 1223.25 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20719. 1223.25 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20720. 1223.25 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20721. 1224.60 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20722. 1224.60 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20723. 1224.60 s [algebraic-graphs]
  20724. 1224.60 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20725. 1224.60 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20726. 1224.60 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20727. 1224.60 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20728. 1224.60 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20729. 1224.60 s [algebraic-graphs]
  20730. 1224.60 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20731. 1224.60 s [algebraic-graphs] OK: isEmpty empty == True
  20732. 1224.61 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20733. 1224.61 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20734. 1224.61 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20735. 1224.61 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20736. 1224.61 s [algebraic-graphs]
  20737. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20738. 1224.61 s [algebraic-graphs] OK: hasVertex x empty == False
  20739. 1224.61 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20740. 1224.61 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20741. 1224.61 s [algebraic-graphs]
  20742. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20743. 1224.61 s [algebraic-graphs] OK: hasEdge x y empty == False
  20744. 1224.61 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20745. 1224.61 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20746. 1224.61 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20747. 1224.61 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20748. 1224.61 s [algebraic-graphs]
  20749. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20750. 1224.61 s [algebraic-graphs] OK: vertexCount empty == 0
  20751. 1224.61 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20752. 1224.61 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20753. 1224.61 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20754. 1224.61 s [algebraic-graphs]
  20755. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20756. 1224.61 s [algebraic-graphs] OK: edgeCount empty == 0
  20757. 1224.61 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20758. 1224.61 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20759. 1224.61 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20760. 1224.61 s [algebraic-graphs]
  20761. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20762. 1224.61 s [algebraic-graphs] OK: vertexList empty == []
  20763. 1224.61 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20764. 1224.61 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20765. 1224.61 s [algebraic-graphs]
  20766. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20767. 1224.61 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20768. 1224.61 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20769. 1224.61 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20770. 1224.61 s [algebraic-graphs]
  20771. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20772. 1224.61 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20773. 1224.61 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20774. 1224.61 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20775. 1224.61 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20776. 1224.61 s [algebraic-graphs]
  20777. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20778. 1224.61 s [algebraic-graphs] OK: edgeList empty == []
  20779. 1224.61 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20780. 1224.61 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20781. 1224.61 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20782. 1224.61 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20783. 1224.61 s [algebraic-graphs]
  20784. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20785. 1224.61 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20786. 1224.61 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20787. 1224.61 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20788. 1224.61 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20789. 1224.61 s [algebraic-graphs]
  20790. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20791. 1224.61 s [algebraic-graphs] OK: adjacencyList empty == []
  20792. 1224.61 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20793. 1224.61 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20794. 1224.61 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20795. 1224.61 s [algebraic-graphs]
  20796. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20797. 1224.61 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20798. 1224.61 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20799. 1224.61 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20800. 1224.61 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20801. 1224.61 s [algebraic-graphs]
  20802. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20803. 1224.61 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20804. 1224.61 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20805. 1224.61 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20806. 1224.61 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20807. 1224.61 s [algebraic-graphs]
  20808. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20809. 1224.61 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20810. 1224.61 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20811. 1224.61 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20812. 1224.61 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20813. 1224.61 s [algebraic-graphs]
  20814. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20815. 1224.61 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20816. 1224.61 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20817. 1224.61 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20818. 1224.61 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20819. 1224.61 s [algebraic-graphs]
  20820. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20821. 1224.61 s [algebraic-graphs] OK: path [] == empty
  20822. 1224.61 s [algebraic-graphs] OK: path [x] == vertex x
  20823. 1224.61 s [algebraic-graphs] OK: path [x,y] == edge x y
  20824. 1224.61 s [algebraic-graphs]
  20825. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20826. 1224.61 s [algebraic-graphs] OK: circuit [] == empty
  20827. 1224.61 s [algebraic-graphs] OK: circuit [x] == edge x x
  20828. 1224.61 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20829. 1224.61 s [algebraic-graphs]
  20830. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20831. 1224.61 s [algebraic-graphs] OK: clique [] == empty
  20832. 1224.61 s [algebraic-graphs] OK: clique [x] == vertex x
  20833. 1224.61 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20834. 1224.61 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20835. 1224.61 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20836. 1224.61 s [algebraic-graphs]
  20837. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20838. 1224.61 s [algebraic-graphs] OK: biclique [] [] == empty
  20839. 1224.61 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20840. 1224.61 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20841. 1224.61 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20842. 1224.61 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20843. 1224.61 s [algebraic-graphs]
  20844. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20845. 1224.61 s [algebraic-graphs] OK: star x [] == vertex x
  20846. 1224.61 s [algebraic-graphs] OK: star x [y] == edge x y
  20847. 1224.61 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20848. 1224.61 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20849. 1224.61 s [algebraic-graphs]
  20850. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20851. 1224.61 s [algebraic-graphs] OK: stars [] == empty
  20852. 1224.61 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20853. 1224.61 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20854. 1224.61 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20855. 1224.61 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20856. 1224.61 s [algebraic-graphs] OK: stars . adjacencyList == id
  20857. 1224.61 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20858. 1224.61 s [algebraic-graphs]
  20859. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  20860. 1224.61 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20861. 1224.61 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20862. 1224.61 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20863. 1224.61 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20864. 1224.61 s [algebraic-graphs]
  20865. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  20866. 1224.61 s [algebraic-graphs] OK: forest [] == empty
  20867. 1224.61 s [algebraic-graphs] OK: forest [x] == tree x
  20868. 1224.61 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20869. 1224.61 s [algebraic-graphs] OK: forest == overlays . map tree
  20870. 1224.61 s [algebraic-graphs]
  20871. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  20872. 1224.61 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20873. 1224.61 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20874. 1224.61 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20875. 1224.61 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20876. 1224.61 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20877. 1224.61 s [algebraic-graphs]
  20878. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  20879. 1224.61 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20880. 1224.61 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20881. 1224.61 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20882. 1224.61 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20883. 1224.61 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20884. 1224.61 s [algebraic-graphs]
  20885. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  20886. 1224.61 s [algebraic-graphs] OK: replaceVertex x x == id
  20887. 1224.61 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20888. 1224.61 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20889. 1224.61 s [algebraic-graphs]
  20890. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  20891. 1224.61 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20892. 1224.61 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20893. 1224.61 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20894. 1224.61 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20895. 1224.61 s [algebraic-graphs]
  20896. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  20897. 1224.61 s [algebraic-graphs] OK: transpose empty == empty
  20898. 1224.61 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20899. 1224.61 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20900. 1224.61 s [algebraic-graphs] OK: transpose . transpose == id
  20901. 1224.61 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20902. 1224.61 s [algebraic-graphs]
  20903. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  20904. 1224.61 s [algebraic-graphs] OK: gmap f empty == empty
  20905. 1224.61 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20906. 1224.61 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20907. 1224.61 s [algebraic-graphs] OK: gmap id == id
  20908. 1224.61 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20909. 1224.61 s [algebraic-graphs]
  20910. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  20911. 1224.61 s [algebraic-graphs] OK: induce (const True ) x == x
  20912. 1224.61 s [algebraic-graphs] OK: induce (const False) x == empty
  20913. 1224.61 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20914. 1224.61 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20915. 1224.61 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20916. 1224.61 s [algebraic-graphs]
  20917. 1224.61 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  20918. 1224.61 s [algebraic-graphs] OK: compose empty x == empty
  20919. 1224.61 s [algebraic-graphs] OK: compose x empty == empty
  20920. 1224.61 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20921. 1224.61 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20922. 1224.61 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20923. 1224.61 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20924. 1226.48 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20925. 1226.48 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20926. 1226.48 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20927. 1226.48 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20928. 1226.48 s [algebraic-graphs]
  20929. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  20930. 1226.48 s [algebraic-graphs] OK: closure empty == empty
  20931. 1226.48 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20932. 1226.48 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20933. 1226.48 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20934. 1226.48 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20935. 1226.48 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20936. 1226.48 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20937. 1226.48 s [algebraic-graphs] OK: closure . closure == closure
  20938. 1226.48 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20939. 1226.48 s [algebraic-graphs]
  20940. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  20941. 1226.48 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20942. 1226.48 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20943. 1226.48 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20944. 1226.48 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20945. 1226.48 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20946. 1226.48 s [algebraic-graphs]
  20947. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  20948. 1226.48 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20949. 1226.48 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20950. 1226.48 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20951. 1226.48 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20952. 1226.48 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20953. 1226.48 s [algebraic-graphs]
  20954. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  20955. 1226.48 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20956. 1226.48 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20957. 1226.48 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20958. 1226.48 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20959. 1226.48 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20960. 1226.48 s [algebraic-graphs]
  20961. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.box ============
  20962. 1226.48 s [algebraic-graphs] OK: box x y ~~ box y x
  20963. 1226.48 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20964. 1226.48 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20965. 1226.48 s [algebraic-graphs] OK: box x empty ~~ empty
  20966. 1226.48 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20967. 1226.48 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20968. 1226.48 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20969. 1226.48 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20970. 1226.48 s [algebraic-graphs]
  20971. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  20972. 1226.48 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20973. 1226.48 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20974. 1226.48 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20975. 1226.48 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20976. 1226.48 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20977. 1226.48 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20978. 1226.48 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20979. 1226.48 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20980. 1226.48 s [algebraic-graphs] OK: bfsForest x [] == []
  20981. 1226.48 s [algebraic-graphs] OK: bfsForest empty vs == []
  20982. 1226.48 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20983. 1226.48 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20984. 1226.48 s [algebraic-graphs]
  20985. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  20986. 1226.48 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20987. 1226.48 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20988. 1226.48 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20989. 1226.48 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20990. 1226.48 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20991. 1226.48 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20992. 1226.48 s [algebraic-graphs] OK: bfs empty vs == []
  20993. 1226.48 s [algebraic-graphs] OK: bfs x [] == []
  20994. 1226.48 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20995. 1226.48 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20996. 1226.48 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20997. 1226.48 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20998. 1226.48 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20999. 1226.48 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  21000. 1226.48 s [algebraic-graphs]
  21001. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  21002. 1226.48 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  21003. 1226.48 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  21004. 1226.48 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  21005. 1226.48 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  21006. 1226.48 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  21007. 1226.48 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  21008. 1226.48 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  21009. 1226.48 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  21010. 1226.48 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  21011. 1226.48 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  21012. 1226.48 s [algebraic-graphs]
  21013. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  21014. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  21015. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  21016. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  21017. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  21018. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  21019. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  21020. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  21021. 1226.48 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  21022. 1226.48 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  21023. 1226.48 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  21024. 1226.48 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  21025. 1226.48 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21026. 1226.48 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  21027. 1226.48 s [algebraic-graphs]
  21028. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21029. 1226.48 s [algebraic-graphs] OK: dfs empty vs == []
  21030. 1226.48 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  21031. 1226.48 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  21032. 1226.48 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  21033. 1226.48 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  21034. 1226.48 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  21035. 1226.48 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  21036. 1226.48 s [algebraic-graphs] OK: dfs x [] == []
  21037. 1226.48 s [algebraic-graphs]
  21038. 1226.48 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  21039. 1226.48 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  21040. 1226.48 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  21041. 1226.48 s [algebraic-graphs]
  21042. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21043. 1226.48 s [algebraic-graphs] OK: reachable empty x == []
  21044. 1226.48 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  21045. 1226.48 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  21046. 1226.48 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  21047. 1226.48 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  21048. 1226.48 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  21049. 1226.48 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  21050. 1226.48 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  21051. 1226.48 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  21052. 1226.48 s [algebraic-graphs]
  21053. 1226.48 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  21054. 1226.48 s [algebraic-graphs]
  21055. 1226.48 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  21056. 1226.48 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  21057. 1226.49 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  21058. 1226.49 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  21059. 1226.49 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  21060. 1226.49 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  21061. 1226.49 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  21062. 1226.49 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  21063. 1226.49 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  21064. 1226.49 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  21065. 1226.49 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  21066. 1226.49 s [algebraic-graphs]
  21067. 1226.49 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  21068. 1226.49 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  21069. 1226.49 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  21070. 1226.49 s [algebraic-graphs] OK: isAcyclic . circuit == null
  21071. 1226.49 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  21072. 1226.49 s [algebraic-graphs]
  21073. 1226.49 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  21074. 1226.49 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  21075. 1226.49 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  21076. 1226.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  21077. 1226.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  21078. 1226.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  21079. 1226.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  21080. 1226.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  21081. 1230.96 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  21082. 1230.96 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  21083. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  21084. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  21085. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  21086. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  21087. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  21088. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  21089. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  21090. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  21091. 1231.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  21092. 1231.10 s [algebraic-graphs]
  21093. 1231.10 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  21094. 1231.10 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  21095. 1231.10 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  21096. 1231.10 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  21097. 1231.10 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  21098. 1231.10 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  21099. 1231.10 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  21100. 1231.10 s [algebraic-graphs]
  21101. 1231.10 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  21102. 1231.10 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21103. 1231.10 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21104. 1231.10 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21105. 1231.10 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21106. 1231.10 s [algebraic-graphs]
  21107. 1231.10 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  21108. 1231.10 s [algebraic-graphs] OK: scc empty == empty
  21109. 1231.10 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  21110. 1231.10 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  21111. 1231.10 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  21112. 1231.10 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  21113. 1231.10 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  21114. 1231.10 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  21115. 1231.10 s [algebraic-graphs] OK: isAcyclic . scc == const True
  21116. 1231.10 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  21117. 1231.10 s [algebraic-graphs] OK: scc g == KL.scc g
  21118. 1231.10 s [algebraic-graphs]
  21119. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  21120. 1231.10 s [algebraic-graphs] OK: 0 == rightVertex 0
  21121. 1231.10 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  21122. 1231.10 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  21123. 1231.10 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  21124. 1231.10 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  21125. 1231.10 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  21126. 1231.10 s [algebraic-graphs]
  21127. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  21128. 1231.10 s [algebraic-graphs] OK: show empty == "empty"
  21129. 1231.10 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  21130. 1231.10 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  21131. 1231.10 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  21132. 1231.10 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  21133. 1231.10 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  21134. 1231.10 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  21135. 1231.10 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  21136. 1231.10 s [algebraic-graphs]
  21137. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  21138. 1231.10 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  21139. 1231.10 s [algebraic-graphs]
  21140. 1231.10 s [algebraic-graphs] OK: x + y == y + x
  21141. 1231.10 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  21142. 1231.10 s [algebraic-graphs] OK: x * empty == x
  21143. 1231.10 s [algebraic-graphs] OK: empty * x == x
  21144. 1231.10 s [algebraic-graphs] OK: x * y == y * x
  21145. 1231.10 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  21146. 1231.10 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  21147. 1231.10 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  21148. 1231.10 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  21149. 1231.10 s [algebraic-graphs] OK: x + empty == x
  21150. 1231.10 s [algebraic-graphs] OK: empty + x == x
  21151. 1231.10 s [algebraic-graphs] OK: x + x == x
  21152. 1231.10 s [algebraic-graphs] OK: x * y + x + y == x * y
  21153. 1231.10 s [algebraic-graphs] OK: x * x * x == x * x
  21154. 1231.10 s [algebraic-graphs]
  21155. 1231.10 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  21156. 1231.10 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  21157. 1231.10 s [algebraic-graphs]
  21158. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  21159. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21160. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21161. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21162. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21163. 1231.10 s [algebraic-graphs]
  21164. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  21165. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21166. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21167. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21168. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21169. 1231.10 s [algebraic-graphs]
  21170. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  21171. 1231.10 s [algebraic-graphs] OK: isEmpty empty == True
  21172. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21173. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21174. 1231.10 s [algebraic-graphs] OK: hasVertex x empty == False
  21175. 1231.10 s [algebraic-graphs]
  21176. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  21177. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21178. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21179. 1231.10 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21180. 1231.10 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21181. 1231.10 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  21182. 1231.10 s [algebraic-graphs]
  21183. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  21184. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21185. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21186. 1231.10 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21187. 1231.10 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21188. 1231.10 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  21189. 1231.10 s [algebraic-graphs]
  21190. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  21191. 1231.10 s [algebraic-graphs] OK: vertex . Left == leftVertex
  21192. 1231.10 s [algebraic-graphs] OK: vertex . Right == rightVertex
  21193. 1231.10 s [algebraic-graphs]
  21194. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  21195. 1231.10 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  21196. 1231.10 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21197. 1231.10 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21198. 1231.10 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21199. 1231.10 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  21200. 1231.10 s [algebraic-graphs]
  21201. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  21202. 1231.10 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21203. 1231.10 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21204. 1231.10 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21205. 1231.10 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21206. 1231.10 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21207. 1231.10 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21208. 1231.10 s [algebraic-graphs]
  21209. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  21210. 1231.10 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  21211. 1231.10 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  21212. 1231.10 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  21213. 1231.10 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  21214. 1231.10 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  21215. 1231.10 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21216. 1231.10 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21217. 1231.10 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21218. 1231.10 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21219. 1231.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21220. 1231.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  21221. 1231.10 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21222. 1231.10 s [algebraic-graphs]
  21223. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21224. 1231.10 s [algebraic-graphs] OK: vertices [] [] == empty
  21225. 1231.10 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21226. 1231.10 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21227. 1231.10 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21228. 1231.10 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21229. 1231.10 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21230. 1231.10 s [algebraic-graphs]
  21231. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21232. 1231.10 s [algebraic-graphs] OK: edges [] == empty
  21233. 1231.10 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21234. 1231.10 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21235. 1231.10 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21236. 1231.10 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21237. 1231.10 s [algebraic-graphs]
  21238. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21239. 1231.10 s [algebraic-graphs] OK: overlays [] == empty
  21240. 1231.10 s [algebraic-graphs] OK: overlays [x] == x
  21241. 1231.10 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21242. 1231.10 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21243. 1231.10 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21244. 1231.10 s [algebraic-graphs]
  21245. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21246. 1231.10 s [algebraic-graphs] OK: connects [] == empty
  21247. 1231.10 s [algebraic-graphs] OK: connects [x] == x
  21248. 1231.10 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21249. 1231.10 s [algebraic-graphs] OK: connects == foldr connect empty
  21250. 1231.10 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21251. 1231.10 s [algebraic-graphs]
  21252. 1231.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21253. 1232.05 s [algebraic-graphs] OK: swap empty == empty
  21254. 1232.05 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21255. 1232.05 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21256. 1232.05 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21257. 1232.05 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21258. 1232.05 s [algebraic-graphs] OK: swap . swap == id
  21259. 1232.05 s [algebraic-graphs]
  21260. 1232.05 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21261. 1232.05 s [algebraic-graphs] OK: toBipartite empty == empty
  21262. 1232.06 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21263. 1232.06 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21264. 1232.06 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21265. 1232.06 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21266. 1232.06 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21267. 1232.06 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21268. 1232.06 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21269. 1232.06 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21270. 1232.06 s [algebraic-graphs]
  21271. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21272. 1232.06 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21273. 1232.06 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21274. 1232.06 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21275. 1232.06 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21276. 1232.06 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21277. 1232.06 s [algebraic-graphs]
  21278. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21279. 1232.06 s [algebraic-graphs] OK: fromBipartite empty == empty
  21280. 1232.06 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21281. 1232.06 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21282. 1232.06 s [algebraic-graphs]
  21283. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21284. 1232.06 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21285. 1232.06 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21286. 1232.06 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21287. 1232.06 s [algebraic-graphs]
  21288. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21289. 1232.06 s [algebraic-graphs] OK: isEmpty empty == True
  21290. 1232.06 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21291. 1232.06 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21292. 1232.06 s [algebraic-graphs] OK: isEmpty == (==) empty
  21293. 1232.06 s [algebraic-graphs]
  21294. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21295. 1232.06 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21296. 1232.06 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21297. 1232.06 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21298. 1232.06 s [algebraic-graphs]
  21299. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21300. 1232.06 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21301. 1232.06 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21302. 1232.06 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21303. 1232.06 s [algebraic-graphs]
  21304. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21305. 1232.06 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21306. 1232.06 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21307. 1232.06 s [algebraic-graphs]
  21308. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21309. 1232.06 s [algebraic-graphs] OK: hasEdge x y empty == False
  21310. 1232.06 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21311. 1232.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21312. 1232.06 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21313. 1232.06 s [algebraic-graphs]
  21314. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21315. 1232.06 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21316. 1232.06 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21317. 1232.06 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21318. 1232.06 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21319. 1232.06 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21320. 1232.06 s [algebraic-graphs]
  21321. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21322. 1232.06 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21323. 1232.06 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21324. 1232.06 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21325. 1232.06 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21326. 1232.06 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21327. 1232.06 s [algebraic-graphs]
  21328. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21329. 1232.06 s [algebraic-graphs] OK: vertexCount empty == 0
  21330. 1232.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21331. 1232.06 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21332. 1232.06 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21333. 1232.06 s [algebraic-graphs]
  21334. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21335. 1232.06 s [algebraic-graphs] OK: edgeCount empty == 0
  21336. 1232.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21337. 1232.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21338. 1232.06 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21339. 1232.06 s [algebraic-graphs]
  21340. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21341. 1232.06 s [algebraic-graphs] OK: leftVertexList empty == []
  21342. 1232.06 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21343. 1232.06 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21344. 1232.06 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21345. 1232.06 s [algebraic-graphs]
  21346. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21347. 1232.06 s [algebraic-graphs] OK: rightVertexList empty == []
  21348. 1232.06 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21349. 1232.06 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21350. 1232.06 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21351. 1232.06 s [algebraic-graphs]
  21352. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21353. 1232.06 s [algebraic-graphs] OK: vertexList empty == []
  21354. 1232.06 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21355. 1232.06 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21356. 1232.06 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21357. 1232.06 s [algebraic-graphs]
  21358. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21359. 1232.06 s [algebraic-graphs] OK: edgeList empty == []
  21360. 1232.06 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21361. 1232.06 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21362. 1232.06 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21363. 1232.06 s [algebraic-graphs]
  21364. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21365. 1232.06 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21366. 1232.06 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21367. 1232.06 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21368. 1232.06 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21369. 1232.06 s [algebraic-graphs]
  21370. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21371. 1232.06 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21372. 1232.06 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21373. 1232.06 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21374. 1232.06 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21375. 1232.06 s [algebraic-graphs]
  21376. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21377. 1232.06 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21378. 1232.06 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21379. 1232.06 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21380. 1232.06 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21381. 1232.06 s [algebraic-graphs]
  21382. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21383. 1232.06 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21384. 1232.06 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21385. 1232.06 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21386. 1232.06 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21387. 1232.06 s [algebraic-graphs]
  21388. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21389. 1232.06 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21390. 1232.06 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21391. 1232.06 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21392. 1232.06 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21393. 1232.06 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21394. 1232.06 s [algebraic-graphs]
  21395. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21396. 1232.06 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21397. 1232.06 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21398. 1232.06 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21399. 1232.06 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21400. 1232.06 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21401. 1232.06 s [algebraic-graphs]
  21402. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21403. 1232.06 s [algebraic-graphs] OK: evenList [] == Nil
  21404. 1232.06 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21405. 1232.06 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21406. 1232.06 s [algebraic-graphs]
  21407. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21408. 1232.06 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21409. 1232.06 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21410. 1232.06 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21411. 1232.06 s [algebraic-graphs]
  21412. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21413. 1232.06 s [algebraic-graphs] OK: path Nil == empty
  21414. 1232.06 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21415. 1232.06 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21416. 1232.06 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21417. 1232.06 s [algebraic-graphs]
  21418. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21419. 1232.06 s [algebraic-graphs] OK: circuit [] == empty
  21420. 1232.06 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21421. 1232.06 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21422. 1232.06 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21423. 1232.06 s [algebraic-graphs]
  21424. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21425. 1232.06 s [algebraic-graphs] OK: biclique [] [] == empty
  21426. 1232.06 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21427. 1232.06 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21428. 1232.06 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21429. 1232.06 s [algebraic-graphs]
  21430. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21431. 1232.06 s [algebraic-graphs] OK: star x [] == leftVertex x
  21432. 1232.06 s [algebraic-graphs] OK: star x [y] == edge x y
  21433. 1232.06 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21434. 1232.06 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21435. 1232.06 s [algebraic-graphs]
  21436. 1232.06 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21437. 1232.06 s [algebraic-graphs] OK: stars [] == empty
  21438. 1232.06 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21439. 1232.06 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21440. 1232.06 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21441. 1240.97 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21442. 1241.09 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21443. 1241.09 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21444. 1241.09 s [algebraic-graphs]
  21445. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21446. 1241.09 s [algebraic-graphs] OK: mesh xs [] == empty
  21447. 1241.09 s [algebraic-graphs] OK: mesh [] ys == empty
  21448. 1241.09 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21449. 1241.09 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21450. 1241.09 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21451. 1241.09 s [algebraic-graphs]
  21452. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21453. 1241.09 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21454. 1241.09 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21455. 1241.09 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21456. 1241.09 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21457. 1241.09 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21458. 1241.09 s [algebraic-graphs]
  21459. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21460. 1241.09 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21461. 1241.09 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21462. 1241.09 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21463. 1241.09 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21464. 1241.09 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21465. 1241.09 s [algebraic-graphs]
  21466. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21467. 1241.09 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21468. 1241.09 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21469. 1241.09 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21470. 1241.09 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21471. 1241.09 s [algebraic-graphs]
  21472. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21473. 1241.09 s [algebraic-graphs] OK: bimap f g empty == empty
  21474. 1241.09 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21475. 1241.09 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21476. 1241.09 s [algebraic-graphs] OK: bimap id id == id
  21477. 1241.09 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21478. 1241.09 s [algebraic-graphs]
  21479. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21480. 1241.09 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21481. 1241.09 s [algebraic-graphs]
  21482. 1241.09 s [algebraic-graphs] OK: box x y ~~ box y x
  21483. 1241.09 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21484. 1241.09 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21485. 1241.09 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21486. 1241.09 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21487. 1241.09 s [algebraic-graphs] OK: box x empty ~~ empty
  21488. 1241.09 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21489. 1241.09 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21490. 1241.09 s [algebraic-graphs]
  21491. 1241.09 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21492. 1241.09 s [algebraic-graphs]
  21493. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21494. 1241.09 s [algebraic-graphs] OK: consistent empty == True
  21495. 1241.09 s [algebraic-graphs] OK: consistent (vertex x) == True
  21496. 1241.09 s [algebraic-graphs] OK: consistent (edge x y) == True
  21497. 1241.09 s [algebraic-graphs] OK: consistent (edges x) == True
  21498. 1241.09 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21499. 1241.09 s [algebraic-graphs] OK: consistent (swap x) == True
  21500. 1241.09 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21501. 1241.09 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21502. 1241.09 s [algebraic-graphs]
  21503. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21504. 1241.09 s [algebraic-graphs] OK: detectParts empty == Right empty
  21505. 1241.09 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21506. 1241.09 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21507. 1241.09 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21508. 1241.09 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21509. 1241.09 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21510. 1241.09 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21511. 1241.09 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21512. 1241.09 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21513. 1241.09 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21514. 1241.09 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21515. 1241.09 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21516. 1241.09 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21517. 1241.09 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21518. 1241.09 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21519. 1241.09 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21520. 1241.09 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21521. 1241.09 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21522. 1241.09 s [algebraic-graphs]
  21523. 1241.09 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21524. 1241.09 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21525. 1241.09 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21526. 1241.09 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21527. 1241.09 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21528. 1241.09 s [algebraic-graphs]
  21529. 1241.09 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21530. 1241.09 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21531. 1241.09 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21532. 1241.09 s [algebraic-graphs]
  21533. 1241.09 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21534. 1241.09 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21535. 1241.09 s [algebraic-graphs]
  21536. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21537. 1241.09 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21538. 1241.09 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21539. 1241.09 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21540. 1241.09 s [algebraic-graphs]
  21541. 1241.09 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21542. 1241.09 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21543. 1241.09 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21544. 1241.10 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21545. 1241.10 s [algebraic-graphs]
  21546. 1241.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21547. 1241.10 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21548. 1241.10 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21549. 1241.10 s [algebraic-graphs]
  21550. 1241.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21551. 1241.10 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21552. 1241.10 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21553. 1241.10 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21554. 1241.10 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21555. 1241.10 s [algebraic-graphs]
  21556. 1241.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21557. 1241.10 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21558. 1241.10 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21559. 1241.10 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21560. 1241.10 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21561. 1241.10 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21562. 1241.10 s [algebraic-graphs]
  21563. 1241.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21564. 1241.10 s [algebraic-graphs] OK: maxMatching empty == matching []
  21565. 1241.10 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21566. 1241.10 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21567. 1241.10 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21568. 1241.10 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21569. 1241.10 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21570. 1241.10 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21571. 1241.10 s [algebraic-graphs]
  21572. 1241.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21573. 1241.10 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21574. 1241.10 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21575. 1241.10 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21576. 1241.10 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21577. 1241.10 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21578. 1241.10 s [algebraic-graphs]
  21579. 1241.10 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21580. 1241.10 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21581. 1242.77 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21582. 1242.77 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21583. 1242.77 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21584. 1242.77 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21585. 1242.77 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21586. 1242.77 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21587. 1242.77 s [algebraic-graphs]
  21588. 1242.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21589. 1242.77 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21590. 1242.77 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21591. 1242.77 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21592. 1242.77 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21593. 1242.77 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21594. 1242.77 s [algebraic-graphs]
  21595. 1242.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21596. 1242.77 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21597. 1242.77 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21598. 1242.77 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21599. 1242.77 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21600. 1242.77 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21601. 1242.77 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21602. 1242.77 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21603. 1242.77 s [algebraic-graphs]
  21604. 1242.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21605. 1242.77 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21606. 1242.77 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21607. 1242.77 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21608. 1242.77 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21609. 1242.77 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21610. 1242.78 s [algebraic-graphs]
  21611. 1242.78 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21612. 1242.78 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21613. 1242.78 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21614. 1242.78 s [algebraic-graphs]
  21615. 1242.78 s [algebraic-graphs] ============ Export.Eq ============
  21616. 1242.78 s [algebraic-graphs] OK: mempty /= literal ""
  21617. 1242.78 s [algebraic-graphs]
  21618. 1242.78 s [algebraic-graphs] ============ Export.Ord ============
  21619. 1242.78 s [algebraic-graphs] OK: mempty < literal ""
  21620. 1242.78 s [algebraic-graphs]
  21621. 1242.78 s [algebraic-graphs] ============ Export.isEmpty ============
  21622. 1242.78 s [algebraic-graphs] OK: isEmpty mempty == True
  21623. 1242.78 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21624. 1242.78 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21625. 1242.78 s [algebraic-graphs]
  21626. 1242.78 s [algebraic-graphs] ============ Export.literal ============
  21627. 1242.78 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21628. 1242.78 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21629. 1242.78 s [algebraic-graphs] OK: render . literal == id
  21630. 1242.78 s [algebraic-graphs]
  21631. 1242.78 s [algebraic-graphs] ============ Export.render ============
  21632. 1242.78 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21633. 1242.78 s [algebraic-graphs] OK: render mempty == mempty
  21634. 1242.78 s [algebraic-graphs]
  21635. 1242.78 s [algebraic-graphs] ============ Export.<+> ============
  21636. 1242.78 s [algebraic-graphs] OK: x <+> mempty == x
  21637. 1242.78 s [algebraic-graphs] OK: mempty <+> x == x
  21638. 1242.78 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21639. 1242.78 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21640. 1242.78 s [algebraic-graphs]
  21641. 1242.78 s [algebraic-graphs] ============ Export.brackets ============
  21642. 1242.78 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21643. 1242.78 s [algebraic-graphs] OK: brackets mempty == "[]"
  21644. 1242.78 s [algebraic-graphs]
  21645. 1242.78 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21646. 1242.78 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21647. 1242.78 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21648. 1242.78 s [algebraic-graphs]
  21649. 1242.78 s [algebraic-graphs] ============ Export.indent ============
  21650. 1242.78 s [algebraic-graphs] OK: indent 0 == id
  21651. 1242.78 s [algebraic-graphs] OK: indent 1 mempty == " "
  21652. 1242.78 s [algebraic-graphs]
  21653. 1242.78 s [algebraic-graphs] ============ Export.unlines ============
  21654. 1242.78 s [algebraic-graphs] OK: unlines [] == mempty
  21655. 1242.78 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21656. 1242.78 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21657. 1242.78 s [algebraic-graphs]
  21658. 1242.78 s [algebraic-graphs] ============ Export.export ============
  21659. 1242.78 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21660. 1242.78 s [algebraic-graphs]
  21661. 1242.78 s [algebraic-graphs] ============ Export.Dot.export ============
  21662. 1242.78 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21663. 1242.78 s [algebraic-graphs]
  21664. 1242.78 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21665. 1242.78 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21666. 1242.78 s [algebraic-graphs]
  21667. 1242.78 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21668. 1242.78 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21669. 1242.78 s [algebraic-graphs]
  21670. 1242.78 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21671. 1242.78 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21672. 1242.78 s [algebraic-graphs]
  21673. 1242.78 s [algebraic-graphs] ============ Graph ============
  21674. 1242.78 s [algebraic-graphs] OK: Axioms of graphs
  21675. 1242.78 s [algebraic-graphs] OK: Theorems of graphs
  21676. 1242.78 s [algebraic-graphs]
  21677. 1242.78 s [algebraic-graphs] ============ Graph.Ord ============
  21678. 1242.78 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21679. 1242.78 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21680. 1242.78 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21681. 1242.78 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21682. 1242.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21683. 1242.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21684. 1242.78 s [algebraic-graphs] OK: x <= x + y
  21685. 1242.78 s [algebraic-graphs] OK: x + y <= x * y
  21686. 1242.78 s [algebraic-graphs]
  21687. 1242.78 s [algebraic-graphs] ============ Graph.empty ============
  21688. 1242.78 s [algebraic-graphs] OK: isEmpty empty == True
  21689. 1242.78 s [algebraic-graphs] OK: hasVertex x empty == False
  21690. 1242.78 s [algebraic-graphs] OK: vertexCount empty == 0
  21691. 1242.78 s [algebraic-graphs] OK: edgeCount empty == 0
  21692. 1242.78 s [algebraic-graphs]
  21693. 1242.78 s [algebraic-graphs] ============ Graph.vertex ============
  21694. 1242.78 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21695. 1242.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21696. 1242.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21697. 1242.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21698. 1242.78 s [algebraic-graphs]
  21699. 1242.78 s [algebraic-graphs] ============ Graph.edge ============
  21700. 1242.78 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21701. 1242.78 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21702. 1242.78 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21703. 1242.78 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21704. 1242.78 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21705. 1242.78 s [algebraic-graphs]
  21706. 1242.78 s [algebraic-graphs] ============ Graph.overlay ============
  21707. 1242.78 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21708. 1242.78 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21709. 1242.78 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21710. 1242.78 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21711. 1242.78 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21712. 1242.78 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21713. 1242.78 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21714. 1242.78 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21715. 1242.78 s [algebraic-graphs]
  21716. 1242.78 s [algebraic-graphs] ============ Graph.connect ============
  21717. 1242.78 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21718. 1242.78 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21719. 1242.78 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21720. 1242.78 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21721. 1242.78 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21722. 1242.78 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21723. 1242.78 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21724. 1242.78 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21725. 1242.78 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21726. 1242.78 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21727. 1242.78 s [algebraic-graphs]
  21728. 1242.78 s [algebraic-graphs] ============ Graph.vertices ============
  21729. 1242.78 s [algebraic-graphs] OK: vertices [] == empty
  21730. 1242.78 s [algebraic-graphs] OK: vertices [x] == vertex x
  21731. 1242.78 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21732. 1242.78 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21733. 1242.78 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21734. 1242.78 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21735. 1242.78 s [algebraic-graphs]
  21736. 1242.78 s [algebraic-graphs] ============ Graph.edges ============
  21737. 1242.78 s [algebraic-graphs] OK: edges [] == empty
  21738. 1242.78 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21739. 1242.78 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21740. 1242.78 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21741. 1242.78 s [algebraic-graphs]
  21742. 1242.78 s [algebraic-graphs] ============ Graph.overlays ============
  21743. 1242.78 s [algebraic-graphs] OK: overlays [] == empty
  21744. 1242.78 s [algebraic-graphs] OK: overlays [x] == x
  21745. 1242.78 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21746. 1242.78 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21747. 1242.78 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21748. 1242.78 s [algebraic-graphs]
  21749. 1242.78 s [algebraic-graphs] ============ Graph.connects ============
  21750. 1242.78 s [algebraic-graphs] OK: connects [] == empty
  21751. 1242.78 s [algebraic-graphs] OK: connects [x] == x
  21752. 1242.78 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21753. 1242.78 s [algebraic-graphs] OK: connects == foldr connect empty
  21754. 1242.78 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21755. 1242.78 s [algebraic-graphs]
  21756. 1242.78 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21757. 1242.78 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21758. 1242.78 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21759. 1242.78 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21760. 1242.78 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21761. 1242.78 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21762. 1242.78 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21763. 1242.78 s [algebraic-graphs]
  21764. 1242.78 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21765. 1242.78 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21766. 1242.78 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21767. 1242.78 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21768. 1242.78 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21769. 1242.78 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21770. 1242.78 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21771. 1242.78 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21772. 1242.78 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21773. 1242.78 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21774. 1243.39 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21775. 1243.39 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21776. 1243.39 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21777. 1243.39 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21778. 1243.39 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21779. 1243.39 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21780. 1243.39 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21781. 1243.39 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21782. 1243.39 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21783. 1243.39 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21784. 1243.39 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21785. 1243.39 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21786. 1243.39 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21787. 1243.39 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21788. 1243.39 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21789. 1243.39 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21790. 1243.39 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21791. 1243.39 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21792. 1243.39 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21793. 1243.39 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21794. 1243.39 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21795. 1243.39 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21796. 1243.39 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21797. 1243.39 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21798. 1243.39 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21799. 1243.39 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21800. 1243.39 s [algebraic-graphs]
  21801. 1243.39 s [algebraic-graphs] ============ Graph.foldg ============
  21802. 1243.39 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21803. 1243.39 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21804. 1243.39 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21805. 1243.39 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21806. 1243.39 s [algebraic-graphs]
  21807. 1243.39 s [algebraic-graphs] ============ Graph.isEmpty ============
  21808. 1243.39 s [algebraic-graphs] OK: isEmpty empty == True
  21809. 1243.39 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21810. 1243.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21811. 1243.39 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21812. 1243.39 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21813. 1243.39 s [algebraic-graphs]
  21814. 1243.39 s [algebraic-graphs] ============ Graph.hasVertex ============
  21815. 1243.39 s [algebraic-graphs] OK: hasVertex x empty == False
  21816. 1243.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21817. 1243.39 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21818. 1243.39 s [algebraic-graphs]
  21819. 1243.39 s [algebraic-graphs] ============ Graph.hasEdge ============
  21820. 1243.39 s [algebraic-graphs] OK: hasEdge x y empty == False
  21821. 1243.39 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21822. 1243.39 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21823. 1243.39 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21824. 1243.39 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21825. 1243.39 s [algebraic-graphs]
  21826. 1243.39 s [algebraic-graphs] ============ Graph.vertexCount ============
  21827. 1243.39 s [algebraic-graphs] OK: vertexCount empty == 0
  21828. 1243.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21829. 1243.39 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21830. 1243.40 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21831. 1243.40 s [algebraic-graphs]
  21832. 1243.40 s [algebraic-graphs] ============ Graph.edgeCount ============
  21833. 1243.40 s [algebraic-graphs] OK: edgeCount empty == 0
  21834. 1243.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21835. 1243.40 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21836. 1243.40 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21837. 1243.40 s [algebraic-graphs]
  21838. 1243.40 s [algebraic-graphs] ============ Graph.vertexList ============
  21839. 1243.40 s [algebraic-graphs] OK: vertexList empty == []
  21840. 1243.40 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21841. 1243.40 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21842. 1243.40 s [algebraic-graphs]
  21843. 1243.40 s [algebraic-graphs] ============ Graph.vertexSet ============
  21844. 1243.40 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21845. 1243.40 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21846. 1243.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21847. 1243.40 s [algebraic-graphs]
  21848. 1243.40 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21849. 1243.40 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21850. 1243.40 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21851. 1243.40 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21852. 1243.40 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21853. 1243.40 s [algebraic-graphs]
  21854. 1243.40 s [algebraic-graphs] ============ Graph.edgeList ============
  21855. 1243.40 s [algebraic-graphs] OK: edgeList empty == []
  21856. 1243.40 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21857. 1243.40 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21858. 1243.40 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21859. 1243.40 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21860. 1243.40 s [algebraic-graphs]
  21861. 1243.40 s [algebraic-graphs] ============ Graph.edgeSet ============
  21862. 1243.40 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21863. 1243.40 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21864. 1243.40 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21865. 1243.40 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21866. 1243.40 s [algebraic-graphs]
  21867. 1243.40 s [algebraic-graphs] ============ Graph.adjacencyList ============
  21868. 1243.40 s [algebraic-graphs] OK: adjacencyList empty == []
  21869. 1243.40 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21870. 1243.40 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21871. 1243.40 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21872. 1243.40 s [algebraic-graphs]
  21873. 1243.40 s [algebraic-graphs] ============ Graph.preSet ============
  21874. 1243.40 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21875. 1243.40 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21876. 1243.40 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21877. 1243.40 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21878. 1243.40 s [algebraic-graphs]
  21879. 1243.40 s [algebraic-graphs] ============ Graph.preIntSet ============
  21880. 1243.40 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21881. 1243.40 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21882. 1243.40 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21883. 1243.40 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21884. 1243.40 s [algebraic-graphs]
  21885. 1243.40 s [algebraic-graphs] ============ Graph.postSet ============
  21886. 1243.40 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21887. 1243.40 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21888. 1243.40 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21889. 1243.40 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21890. 1243.40 s [algebraic-graphs]
  21891. 1243.40 s [algebraic-graphs] ============ Graph.postIntSet ============
  21892. 1243.40 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21893. 1243.40 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21894. 1243.40 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21895. 1243.40 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21896. 1243.40 s [algebraic-graphs]
  21897. 1243.40 s [algebraic-graphs] ============ Graph.size ============
  21898. 1243.40 s [algebraic-graphs] OK: size empty == 1
  21899. 1243.40 s [algebraic-graphs] OK: size (vertex x) == 1
  21900. 1243.40 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  21901. 1243.40 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  21902. 1243.40 s [algebraic-graphs] OK: size x >= 1
  21903. 1243.40 s [algebraic-graphs] OK: size x >= vertexCount x
  21904. 1243.40 s [algebraic-graphs]
  21905. 1243.40 s [algebraic-graphs] ============ Graph.path ============
  21906. 1243.40 s [algebraic-graphs] OK: path [] == empty
  21907. 1243.40 s [algebraic-graphs] OK: path [x] == vertex x
  21908. 1243.40 s [algebraic-graphs] OK: path [x,y] == edge x y
  21909. 1243.40 s [algebraic-graphs]
  21910. 1243.40 s [algebraic-graphs] ============ Graph.circuit ============
  21911. 1243.40 s [algebraic-graphs] OK: circuit [] == empty
  21912. 1243.40 s [algebraic-graphs] OK: circuit [x] == edge x x
  21913. 1243.40 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21914. 1243.40 s [algebraic-graphs]
  21915. 1243.40 s [algebraic-graphs] ============ Graph.clique ============
  21916. 1243.40 s [algebraic-graphs] OK: clique [] == empty
  21917. 1243.40 s [algebraic-graphs] OK: clique [x] == vertex x
  21918. 1243.40 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21919. 1243.40 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21920. 1243.40 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21921. 1243.40 s [algebraic-graphs]
  21922. 1243.40 s [algebraic-graphs] ============ Graph.biclique ============
  21923. 1243.40 s [algebraic-graphs] OK: biclique [] [] == empty
  21924. 1243.40 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21925. 1243.40 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21926. 1243.40 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21927. 1243.40 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21928. 1243.40 s [algebraic-graphs]
  21929. 1243.40 s [algebraic-graphs] ============ Graph.star ============
  21930. 1243.40 s [algebraic-graphs] OK: star x [] == vertex x
  21931. 1243.40 s [algebraic-graphs] OK: star x [y] == edge x y
  21932. 1243.40 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21933. 1243.40 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21934. 1243.40 s [algebraic-graphs]
  21935. 1243.40 s [algebraic-graphs] ============ Graph.stars ============
  21936. 1243.40 s [algebraic-graphs] OK: stars [] == empty
  21937. 1243.40 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21938. 1243.40 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21939. 1243.40 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21940. 1243.40 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21941. 1243.40 s [algebraic-graphs] OK: stars . adjacencyList == id
  21942. 1243.40 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21943. 1243.40 s [algebraic-graphs]
  21944. 1243.40 s [algebraic-graphs] ============ Graph.tree ============
  21945. 1243.40 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21946. 1243.40 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21947. 1243.40 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21948. 1243.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)]
  21949. 1243.40 s [algebraic-graphs]
  21950. 1243.40 s [algebraic-graphs] ============ Graph.forest ============
  21951. 1243.40 s [algebraic-graphs] OK: forest [] == empty
  21952. 1243.40 s [algebraic-graphs] OK: forest [x] == tree x
  21953. 1243.40 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21954. 1243.40 s [algebraic-graphs] OK: forest == overlays . map tree
  21955. 1243.40 s [algebraic-graphs]
  21956. 1243.40 s [algebraic-graphs] ============ Graph.removeVertex ============
  21957. 1246.27 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21958. 1246.27 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21959. 1246.27 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21960. 1246.39 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21961. 1246.39 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21962. 1246.39 s [algebraic-graphs]
  21963. 1246.39 s [algebraic-graphs] ============ Graph.removeEdge ============
  21964. 1246.39 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21965. 1246.39 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21966. 1246.39 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21967. 1246.39 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21968. 1246.39 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21969. 1246.39 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  21970. 1246.39 s [algebraic-graphs]
  21971. 1246.39 s [algebraic-graphs] ============ Graph.replaceVertex ============
  21972. 1246.39 s [algebraic-graphs] OK: replaceVertex x x == id
  21973. 1246.39 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21974. 1246.39 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21975. 1246.39 s [algebraic-graphs]
  21976. 1246.39 s [algebraic-graphs] ============ Graph.mergeVertices ============
  21977. 1246.39 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21978. 1246.39 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21979. 1246.39 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21980. 1246.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21981. 1246.39 s [algebraic-graphs]
  21982. 1246.39 s [algebraic-graphs] ============ Graph.transpose ============
  21983. 1246.39 s [algebraic-graphs] OK: transpose empty == empty
  21984. 1246.39 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21985. 1246.39 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21986. 1246.39 s [algebraic-graphs] OK: transpose . transpose == id
  21987. 1246.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21988. 1246.39 s [algebraic-graphs]
  21989. 1246.39 s [algebraic-graphs] ============ Graph.gmap ============
  21990. 1246.39 s [algebraic-graphs] OK: gmap f empty == empty
  21991. 1246.39 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21992. 1246.39 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21993. 1246.39 s [algebraic-graphs] OK: gmap id == id
  21994. 1246.39 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21995. 1246.39 s [algebraic-graphs]
  21996. 1246.39 s [algebraic-graphs] ============ Graph.induce ============
  21997. 1246.39 s [algebraic-graphs] OK: induce (const True ) x == x
  21998. 1246.39 s [algebraic-graphs] OK: induce (const False) x == empty
  21999. 1246.39 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22000. 1246.39 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22001. 1246.39 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22002. 1246.39 s [algebraic-graphs]
  22003. 1246.39 s [algebraic-graphs] ============ Graph.induceJust ============
  22004. 1246.39 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22005. 1246.39 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22006. 1246.39 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22007. 1246.39 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22008. 1246.39 s [algebraic-graphs]
  22009. 1246.39 s [algebraic-graphs] ============ Graph.compose ============
  22010. 1246.39 s [algebraic-graphs] OK: compose empty x == empty
  22011. 1246.39 s [algebraic-graphs] OK: compose x empty == empty
  22012. 1246.39 s [algebraic-graphs] OK: compose (vertex x) y == empty
  22013. 1246.39 s [algebraic-graphs] OK: compose x (vertex y) == empty
  22014. 1246.39 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  22015. 1246.39 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  22016. 1246.39 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  22017. 1246.39 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  22018. 1246.39 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  22019. 1246.39 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  22020. 1246.39 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  22021. 1246.39 s [algebraic-graphs]
  22022. 1246.39 s [algebraic-graphs] ============ Graph.(===) ============
  22023. 1246.39 s [algebraic-graphs] OK: x === x == True
  22024. 1246.39 s [algebraic-graphs] OK: x === x + empty == False
  22025. 1246.39 s [algebraic-graphs] OK: x + y === x + y == True
  22026. 1246.39 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22027. 1246.39 s [algebraic-graphs] OK: x + y === x * y == False
  22028. 1246.39 s [algebraic-graphs]
  22029. 1246.39 s [algebraic-graphs] ============ Graph.mesh ============
  22030. 1246.39 s [algebraic-graphs] OK: mesh xs [] == empty
  22031. 1246.39 s [algebraic-graphs] OK: mesh [] ys == empty
  22032. 1246.39 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  22033. 1246.39 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  22034. 1246.39 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  22035. 1246.39 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22036. 1246.39 s [algebraic-graphs]
  22037. 1246.39 s [algebraic-graphs] ============ Graph.torus ============
  22038. 1246.39 s [algebraic-graphs] OK: torus xs [] == empty
  22039. 1246.39 s [algebraic-graphs] OK: torus [] ys == empty
  22040. 1246.39 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  22041. 1246.39 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  22042. 1246.39 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  22043. 1246.39 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  22044. 1246.39 s [algebraic-graphs]
  22045. 1246.39 s [algebraic-graphs] ============ Graph.deBruijn ============
  22046. 1246.39 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  22047. 1246.39 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  22048. 1246.39 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  22049. 1246.39 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  22050. 1246.39 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  22051. 1246.39 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  22052. 1246.39 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  22053. 1246.39 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  22054. 1246.39 s [algebraic-graphs]
  22055. 1246.39 s [algebraic-graphs] ============ Graph.splitVertex ============
  22056. 1246.39 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  22057. 1246.39 s [algebraic-graphs] OK: splitVertex x [x] == id
  22058. 1246.39 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  22059. 1246.39 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22060. 1246.39 s [algebraic-graphs]
  22061. 1246.39 s [algebraic-graphs] ============ Graph.bind ============
  22062. 1246.39 s [algebraic-graphs] OK: bind empty f == empty
  22063. 1246.39 s [algebraic-graphs] OK: bind (vertex x) f == f x
  22064. 1246.39 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  22065. 1246.39 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  22066. 1246.39 s [algebraic-graphs] OK: bind x (const empty) == empty
  22067. 1246.39 s [algebraic-graphs] OK: bind x vertex == x
  22068. 1246.39 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  22069. 1246.39 s [algebraic-graphs]
  22070. 1246.39 s [algebraic-graphs] ============ Graph.simplify ============
  22071. 1246.39 s [algebraic-graphs] OK: simplify == id
  22072. 1246.39 s [algebraic-graphs] OK: size (simplify x) <= size x
  22073. 1246.39 s [algebraic-graphs]
  22074. 1246.39 s [algebraic-graphs] ============ Graph.box ============
  22075. 1246.39 s [algebraic-graphs] OK: box x y ~~ box y x
  22076. 1246.39 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22077. 1246.39 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22078. 1246.39 s [algebraic-graphs] OK: box x empty ~~ empty
  22079. 1246.39 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22080. 1246.39 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22081. 1246.39 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22082. 1246.39 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22083. 1246.39 s [algebraic-graphs]
  22084. 1246.39 s [algebraic-graphs] ============ Graph.sparsify ============
  22085. 1246.39 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22086. 1246.39 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22087. 1246.39 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22088. 1246.39 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22089. 1246.39 s [algebraic-graphs]
  22090. 1246.39 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  22091. 1246.39 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22092. 1246.39 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22093. 1246.39 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22094. 1246.39 s [algebraic-graphs]
  22095. 1246.39 s [algebraic-graphs] ============ Graph.context ============
  22096. 1246.39 s [algebraic-graphs] OK: context (const False) x == Nothing
  22097. 1246.39 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  22098. 1246.39 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  22099. 1246.39 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  22100. 1246.39 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  22101. 1246.39 s [algebraic-graphs]
  22102. 1246.39 s [algebraic-graphs] ============ Graph.buildg ============
  22103. 1246.39 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  22104. 1246.39 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  22105. 1246.39 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
  22106. 1246.39 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
  22107. 1246.39 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  22108. 1246.39 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  22109. 1246.39 s [algebraic-graphs]
  22110. 1246.39 s [algebraic-graphs] ============ Internal.List ============
  22111. 1246.39 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  22112. 1246.39 s [algebraic-graphs]
  22113. 1246.39 s [algebraic-graphs] ============ Graph.Label ============
  22114. 1246.39 s [algebraic-graphs]
  22115. 1246.39 s [algebraic-graphs] ============ Any: instances ============
  22116. 1246.39 s [algebraic-graphs] OK: Semiring
  22117. 1246.39 s [algebraic-graphs] OK: StarSemiring
  22118. 1246.39 s [algebraic-graphs] OK: Dioid
  22119. 1246.39 s [algebraic-graphs]
  22120. 1246.39 s [algebraic-graphs] ============ Distance Int: instances ============
  22121. 1246.39 s [algebraic-graphs] OK: Semiring
  22122. 1246.40 s [algebraic-graphs] OK: StarSemiring
  22123. 1246.40 s [algebraic-graphs] OK: Dioid
  22124. 1246.40 s [algebraic-graphs]
  22125. 1246.40 s [algebraic-graphs] ============ Capacity Int: instances ============
  22126. 1246.40 s [algebraic-graphs] OK: Semiring
  22127. 1246.40 s [algebraic-graphs] OK: StarSemiring
  22128. 1246.40 s [algebraic-graphs] OK: Dioid
  22129. 1246.40 s [algebraic-graphs]
  22130. 1246.40 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  22131. 1246.40 s [algebraic-graphs] OK: LeftNearRing
  22132. 1246.40 s [algebraic-graphs]
  22133. 1246.40 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  22134. 1246.40 s [algebraic-graphs] OK: Semiring
  22135. 1246.40 s [algebraic-graphs] OK: Dioid
  22136. 1246.40 s [algebraic-graphs]
  22137. 1246.40 s [algebraic-graphs] ============ Count Int: instances ============
  22138. 1246.40 s [algebraic-graphs] OK: Semiring
  22139. 1246.40 s [algebraic-graphs] OK: StarSemiring
  22140. 1246.40 s [algebraic-graphs]
  22141. 1246.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  22142. 1246.40 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  22143. 1246.40 s [algebraic-graphs] OK: empty
  22144. 1246.40 s [algebraic-graphs] OK: vertex
  22145. 1246.40 s [algebraic-graphs] OK: edge
  22146. 1246.40 s [algebraic-graphs] OK: overlay
  22147. 1246.40 s [algebraic-graphs] OK: connect
  22148. 1246.40 s [algebraic-graphs] OK: vertices
  22149. 1246.40 s [algebraic-graphs] OK: edges
  22150. 1246.40 s [algebraic-graphs] OK: overlays
  22151. 1246.40 s [algebraic-graphs] OK: fromAdjacencyMaps
  22152. 1246.40 s [algebraic-graphs] OK: removeVertex
  22153. 1246.40 s [algebraic-graphs] OK: removeEdge
  22154. 1246.40 s [algebraic-graphs] OK: replaceVertex
  22155. 1246.40 s [algebraic-graphs] OK: replaceEdge
  22156. 1246.40 s [algebraic-graphs] OK: transpose
  22157. 1246.40 s [algebraic-graphs] OK: gmap
  22158. 1246.40 s [algebraic-graphs] OK: emap
  22159. 1246.40 s [algebraic-graphs] OK: induce
  22160. 1246.40 s [algebraic-graphs] OK: closure
  22161. 1246.40 s [algebraic-graphs] OK: reflexiveClosure
  22162. 1246.40 s [algebraic-graphs] OK: symmetricClosure
  22163. 1246.40 s [algebraic-graphs] OK: transitiveClosure
  22164. 1246.40 s [algebraic-graphs]
  22165. 1246.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  22166. 1246.40 s [algebraic-graphs] OK: isEmpty empty == True
  22167. 1246.40 s [algebraic-graphs] OK: hasVertex x empty == False
  22168. 1246.40 s [algebraic-graphs] OK: vertexCount empty == 0
  22169. 1246.40 s [algebraic-graphs] OK: edgeCount empty == 0
  22170. 1246.40 s [algebraic-graphs]
  22171. 1246.40 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  22172. 1246.40 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22173. 1246.40 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22174. 1246.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22175. 1246.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22176. 1246.40 s [algebraic-graphs]
  22177. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  22178. 1248.41 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22179. 1248.41 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22180. 1248.41 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22181. 1248.41 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22182. 1248.41 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22183. 1248.41 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22184. 1248.41 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22185. 1248.41 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22186. 1248.41 s [algebraic-graphs]
  22187. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  22188. 1248.41 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22189. 1248.41 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22190. 1248.41 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22191. 1248.41 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22192. 1248.41 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22193. 1248.41 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22194. 1248.41 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22195. 1248.41 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22196. 1248.41 s [algebraic-graphs]
  22197. 1248.41 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22198. 1248.41 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22199. 1248.41 s [algebraic-graphs]
  22200. 1248.41 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22201. 1248.41 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22202. 1248.41 s [algebraic-graphs]
  22203. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  22204. 1248.41 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22205. 1248.41 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22206. 1248.41 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22207. 1248.41 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22208. 1248.41 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22209. 1248.41 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22210. 1248.41 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22211. 1248.41 s [algebraic-graphs]
  22212. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  22213. 1248.41 s [algebraic-graphs] OK: vertices [] == empty
  22214. 1248.41 s [algebraic-graphs] OK: vertices [x] == vertex x
  22215. 1248.41 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22216. 1248.41 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22217. 1248.41 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22218. 1248.41 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22219. 1248.41 s [algebraic-graphs]
  22220. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  22221. 1248.41 s [algebraic-graphs] OK: edges [] == empty
  22222. 1248.41 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22223. 1248.41 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22224. 1248.41 s [algebraic-graphs]
  22225. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22226. 1248.41 s [algebraic-graphs] OK: overlays [] == empty
  22227. 1248.41 s [algebraic-graphs] OK: overlays [x] == x
  22228. 1248.41 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22229. 1248.41 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22230. 1248.41 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22231. 1248.41 s [algebraic-graphs]
  22232. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22233. 1248.41 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22234. 1248.41 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22235. 1248.41 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22236. 1248.41 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22237. 1248.41 s [algebraic-graphs]
  22238. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22239. 1248.41 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22240. 1248.41 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22241. 1248.41 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22242. 1248.41 s [algebraic-graphs]
  22243. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22244. 1248.41 s [algebraic-graphs] OK: isEmpty empty == True
  22245. 1248.41 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22246. 1248.41 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22247. 1248.41 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22248. 1248.41 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22249. 1248.41 s [algebraic-graphs]
  22250. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22251. 1248.41 s [algebraic-graphs] OK: hasVertex x empty == False
  22252. 1248.41 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22253. 1248.41 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22254. 1248.41 s [algebraic-graphs]
  22255. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22256. 1248.41 s [algebraic-graphs] OK: hasEdge x y empty == False
  22257. 1248.41 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22258. 1248.41 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22259. 1248.41 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22260. 1248.41 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22261. 1248.41 s [algebraic-graphs]
  22262. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22263. 1248.41 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22264. 1248.41 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22265. 1248.41 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22266. 1248.41 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22267. 1248.41 s [algebraic-graphs]
  22268. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22269. 1248.41 s [algebraic-graphs] OK: vertexCount empty == 0
  22270. 1248.41 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22271. 1248.41 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22272. 1248.41 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22273. 1248.41 s [algebraic-graphs]
  22274. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22275. 1248.41 s [algebraic-graphs] OK: edgeCount empty == 0
  22276. 1248.41 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22277. 1248.41 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22278. 1248.41 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22279. 1248.41 s [algebraic-graphs]
  22280. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22281. 1248.41 s [algebraic-graphs] OK: vertexList empty == []
  22282. 1248.41 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22283. 1248.41 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22284. 1248.41 s [algebraic-graphs]
  22285. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22286. 1248.41 s [algebraic-graphs] OK: edgeList empty == []
  22287. 1248.41 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22288. 1248.41 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22289. 1248.41 s [algebraic-graphs]
  22290. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22291. 1248.41 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22292. 1248.41 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22293. 1248.41 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22294. 1248.41 s [algebraic-graphs]
  22295. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22296. 1248.41 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22297. 1248.41 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22298. 1248.41 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22299. 1248.41 s [algebraic-graphs]
  22300. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22301. 1248.41 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22302. 1248.41 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22303. 1248.41 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22304. 1248.41 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22305. 1248.41 s [algebraic-graphs]
  22306. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22307. 1248.41 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22308. 1248.41 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22309. 1248.41 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22310. 1248.41 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22311. 1248.41 s [algebraic-graphs]
  22312. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22313. 1248.41 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22314. 1248.41 s [algebraic-graphs]
  22315. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22316. 1248.41 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22317. 1248.41 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22318. 1248.41 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22319. 1248.41 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22320. 1248.41 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22321. 1248.41 s [algebraic-graphs]
  22322. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22323. 1248.41 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22324. 1248.41 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22325. 1248.41 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22326. 1248.41 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22327. 1248.41 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22328. 1248.41 s [algebraic-graphs]
  22329. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22330. 1248.41 s [algebraic-graphs] OK: replaceVertex x x == id
  22331. 1248.41 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22332. 1248.41 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22333. 1248.41 s [algebraic-graphs]
  22334. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22335. 1248.41 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22336. 1248.41 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22337. 1248.41 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22338. 1248.41 s [algebraic-graphs]
  22339. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22340. 1248.41 s [algebraic-graphs] OK: transpose empty == empty
  22341. 1248.41 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22342. 1248.41 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22343. 1248.41 s [algebraic-graphs] OK: transpose . transpose == id
  22344. 1248.41 s [algebraic-graphs]
  22345. 1248.41 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22346. 1248.41 s [algebraic-graphs] OK: gmap f empty == empty
  22347. 1248.41 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22348. 1248.41 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22349. 1248.41 s [algebraic-graphs] OK: gmap id == id
  22350. 1248.42 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22351. 1248.42 s [algebraic-graphs]
  22352. 1248.42 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22353. 1248.42 s [algebraic-graphs] OK: emap h empty == empty
  22354. 1248.42 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22355. 1248.42 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22356. 1248.42 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22357. 1248.42 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22358. 1248.42 s [algebraic-graphs] OK: emap id == id
  22359. 1248.42 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22360. 1248.42 s [algebraic-graphs]
  22361. 1248.42 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22362. 1248.42 s [algebraic-graphs] OK: induce (const True ) x == x
  22363. 1248.42 s [algebraic-graphs] OK: induce (const False) x == empty
  22364. 1248.42 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22365. 1248.42 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22366. 1248.42 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22367. 1248.42 s [algebraic-graphs]
  22368. 1248.42 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22369. 1249.49 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22370. 1249.49 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22371. 1249.49 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22372. 1249.49 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22373. 1249.49 s [algebraic-graphs]
  22374. 1249.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22375. 1249.49 s [algebraic-graphs] OK: closure empty == empty
  22376. 1249.49 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22377. 1249.49 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22378. 1249.49 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22379. 1249.49 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22380. 1249.49 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22381. 1249.49 s [algebraic-graphs] OK: closure . closure == closure
  22382. 1249.49 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22383. 1249.49 s [algebraic-graphs]
  22384. 1249.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22385. 1249.49 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22386. 1249.49 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22387. 1249.49 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22388. 1249.49 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22389. 1249.49 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22390. 1249.49 s [algebraic-graphs]
  22391. 1249.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22392. 1249.49 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22393. 1249.49 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22394. 1249.49 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22395. 1249.49 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22396. 1249.49 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22397. 1249.49 s [algebraic-graphs]
  22398. 1249.49 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22399. 1249.49 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22400. 1249.49 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22401. 1249.49 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22402. 1249.49 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22403. 1249.49 s [algebraic-graphs]
  22404. 1249.49 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22405. 1249.49 s [algebraic-graphs] OK: isEmpty empty == True
  22406. 1249.49 s [algebraic-graphs] OK: hasVertex x empty == False
  22407. 1249.49 s [algebraic-graphs] OK: vertexCount empty == 0
  22408. 1249.49 s [algebraic-graphs] OK: edgeCount empty == 0
  22409. 1249.49 s [algebraic-graphs]
  22410. 1249.49 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22411. 1249.49 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22412. 1249.49 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22413. 1249.49 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22414. 1249.49 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22415. 1249.49 s [algebraic-graphs]
  22416. 1249.49 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22417. 1249.49 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22418. 1249.49 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22419. 1249.49 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22420. 1249.49 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22421. 1249.49 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22422. 1249.49 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22423. 1249.49 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22424. 1249.49 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22425. 1249.49 s [algebraic-graphs]
  22426. 1249.49 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22427. 1249.49 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22428. 1249.49 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22429. 1249.49 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22430. 1249.49 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22431. 1249.49 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22432. 1249.49 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22433. 1249.49 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22434. 1249.49 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22435. 1249.49 s [algebraic-graphs]
  22436. 1249.49 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22437. 1249.49 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22438. 1249.49 s [algebraic-graphs]
  22439. 1249.49 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22440. 1249.49 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22441. 1249.49 s [algebraic-graphs]
  22442. 1249.49 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22443. 1249.49 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22444. 1249.49 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22445. 1249.49 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22446. 1249.49 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22447. 1249.49 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22448. 1249.49 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22449. 1249.49 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22450. 1249.49 s [algebraic-graphs]
  22451. 1249.49 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22452. 1249.49 s [algebraic-graphs] OK: vertices [] == empty
  22453. 1249.49 s [algebraic-graphs] OK: vertices [x] == vertex x
  22454. 1249.49 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22455. 1249.49 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22456. 1249.49 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22457. 1249.49 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22458. 1249.49 s [algebraic-graphs]
  22459. 1249.49 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22460. 1249.49 s [algebraic-graphs] OK: edges [] == empty
  22461. 1249.49 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22462. 1249.49 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22463. 1249.50 s [algebraic-graphs]
  22464. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22465. 1249.50 s [algebraic-graphs] OK: overlays [] == empty
  22466. 1249.50 s [algebraic-graphs] OK: overlays [x] == x
  22467. 1249.50 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22468. 1249.50 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22469. 1249.50 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22470. 1249.50 s [algebraic-graphs]
  22471. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22472. 1249.50 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22473. 1249.50 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22474. 1249.50 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22475. 1249.50 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22476. 1249.50 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22477. 1249.50 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22478. 1249.50 s [algebraic-graphs]
  22479. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22480. 1249.50 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22481. 1249.50 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22482. 1249.50 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22483. 1249.50 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22484. 1249.50 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22485. 1249.50 s [algebraic-graphs]
  22486. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22487. 1249.50 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22488. 1249.50 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22489. 1249.50 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22490. 1249.50 s [algebraic-graphs]
  22491. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22492. 1249.50 s [algebraic-graphs] OK: isEmpty empty == True
  22493. 1249.50 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22494. 1249.50 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22495. 1249.50 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22496. 1249.50 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22497. 1249.50 s [algebraic-graphs]
  22498. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22499. 1249.50 s [algebraic-graphs] OK: size empty == 1
  22500. 1249.50 s [algebraic-graphs] OK: size (vertex x) == 1
  22501. 1249.50 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22502. 1249.50 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22503. 1249.50 s [algebraic-graphs] OK: size x >= 1
  22504. 1249.50 s [algebraic-graphs] OK: size x >= vertexCount x
  22505. 1249.50 s [algebraic-graphs]
  22506. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22507. 1249.50 s [algebraic-graphs] OK: hasVertex x empty == False
  22508. 1249.50 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22509. 1249.50 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22510. 1249.50 s [algebraic-graphs]
  22511. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22512. 1249.50 s [algebraic-graphs] OK: hasEdge x y empty == False
  22513. 1249.50 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22514. 1249.50 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22515. 1249.50 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22516. 1249.50 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22517. 1249.50 s [algebraic-graphs]
  22518. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22519. 1249.50 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22520. 1249.50 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22521. 1249.50 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22522. 1249.50 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22523. 1249.50 s [algebraic-graphs]
  22524. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22525. 1249.50 s [algebraic-graphs] OK: vertexCount empty == 0
  22526. 1249.50 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22527. 1249.50 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22528. 1249.50 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22529. 1249.50 s [algebraic-graphs]
  22530. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22531. 1249.50 s [algebraic-graphs] OK: edgeCount empty == 0
  22532. 1249.50 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22533. 1249.50 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22534. 1249.50 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22535. 1249.50 s [algebraic-graphs]
  22536. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22537. 1249.50 s [algebraic-graphs] OK: vertexList empty == []
  22538. 1249.50 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22539. 1249.50 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22540. 1249.50 s [algebraic-graphs]
  22541. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22542. 1249.50 s [algebraic-graphs] OK: edgeList empty == []
  22543. 1249.50 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22544. 1249.50 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22545. 1249.50 s [algebraic-graphs]
  22546. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22547. 1249.50 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22548. 1249.50 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22549. 1249.50 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22550. 1249.50 s [algebraic-graphs]
  22551. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22552. 1249.50 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22553. 1249.50 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22554. 1249.50 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22555. 1249.50 s [algebraic-graphs]
  22556. 1249.50 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22557. 1249.50 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22558. 1249.50 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22559. 1251.84 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22560. 1251.96 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22561. 1251.96 s [algebraic-graphs]
  22562. 1251.96 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22563. 1251.96 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22564. 1251.96 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22565. 1251.96 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22566. 1251.96 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22567. 1251.96 s [algebraic-graphs]
  22568. 1251.96 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22569. 1251.96 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22570. 1251.96 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22571. 1251.96 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22572. 1251.97 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22573. 1251.97 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22574. 1251.97 s [algebraic-graphs]
  22575. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22576. 1251.97 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22577. 1251.97 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22578. 1251.97 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22579. 1251.97 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22580. 1251.97 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22581. 1251.97 s [algebraic-graphs]
  22582. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22583. 1251.97 s [algebraic-graphs] OK: replaceVertex x x == id
  22584. 1251.97 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22585. 1251.97 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22586. 1251.97 s [algebraic-graphs]
  22587. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22588. 1251.97 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22589. 1251.97 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22590. 1251.97 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22591. 1251.97 s [algebraic-graphs]
  22592. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22593. 1251.97 s [algebraic-graphs] OK: transpose empty == empty
  22594. 1251.97 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22595. 1251.97 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22596. 1251.97 s [algebraic-graphs] OK: transpose . transpose == id
  22597. 1251.97 s [algebraic-graphs]
  22598. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22599. 1251.97 s [algebraic-graphs] OK: fmap f empty == empty
  22600. 1251.97 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22601. 1251.97 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22602. 1251.97 s [algebraic-graphs] OK: fmap id == id
  22603. 1251.97 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22604. 1251.97 s [algebraic-graphs]
  22605. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22606. 1251.97 s [algebraic-graphs] OK: emap h empty == empty
  22607. 1251.97 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22608. 1251.97 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22609. 1251.97 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22610. 1251.97 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22611. 1251.97 s [algebraic-graphs] OK: emap id == id
  22612. 1251.97 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22613. 1251.97 s [algebraic-graphs]
  22614. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22615. 1251.97 s [algebraic-graphs] OK: induce (const True ) x == x
  22616. 1251.97 s [algebraic-graphs] OK: induce (const False) x == empty
  22617. 1251.97 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22618. 1251.97 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22619. 1251.97 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22620. 1251.97 s [algebraic-graphs]
  22621. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22622. 1251.97 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22623. 1251.97 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22624. 1251.97 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22625. 1251.97 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22626. 1251.97 s [algebraic-graphs]
  22627. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22628. 1251.97 s [algebraic-graphs] OK: closure empty == empty
  22629. 1251.97 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22630. 1251.97 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22631. 1251.97 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22632. 1251.97 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22633. 1251.97 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22634. 1251.97 s [algebraic-graphs] OK: closure . closure == closure
  22635. 1251.97 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22636. 1251.97 s [algebraic-graphs]
  22637. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22638. 1251.97 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22639. 1251.97 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22640. 1251.97 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22641. 1251.97 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22642. 1251.97 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22643. 1251.97 s [algebraic-graphs]
  22644. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22645. 1251.97 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22646. 1251.97 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22647. 1251.97 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22648. 1251.97 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22649. 1251.97 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22650. 1251.97 s [algebraic-graphs]
  22651. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22652. 1251.97 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22653. 1251.97 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22654. 1251.97 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22655. 1251.97 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22656. 1251.97 s [algebraic-graphs]
  22657. 1251.97 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22658. 1251.97 s [algebraic-graphs] OK: context (const False) x == Nothing
  22659. 1251.97 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22660. 1251.97 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22661. 1251.97 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22662. 1251.97 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22663. 1251.97 s [algebraic-graphs]
  22664. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22665. 1251.97 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22666. 1251.97 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22667. 1251.97 s [algebraic-graphs]
  22668. 1251.97 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22669. 1251.97 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22670. 1251.97 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22671. 1251.97 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22672. 1251.97 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22673. 1251.97 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22674. 1251.97 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22675. 1251.97 s [algebraic-graphs] OK: x <= x + y
  22676. 1251.97 s [algebraic-graphs] OK: x + y <= x * y
  22677. 1251.97 s [algebraic-graphs]
  22678. 1251.97 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22679. 1251.97 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22680. 1251.97 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22681. 1251.97 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22682. 1251.97 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22683. 1251.97 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22684. 1251.97 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22685. 1251.97 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22686. 1251.97 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22687. 1251.97 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22688. 1251.97 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22689. 1251.97 s [algebraic-graphs]
  22690. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22691. 1251.97 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22692. 1251.97 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22693. 1251.97 s [algebraic-graphs]
  22694. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22695. 1251.97 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22696. 1251.97 s [algebraic-graphs]
  22697. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22698. 1251.97 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22699. 1251.97 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22700. 1251.97 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22701. 1251.97 s [algebraic-graphs]
  22702. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22703. 1251.97 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22704. 1251.97 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22705. 1251.97 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22706. 1251.97 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22707. 1251.97 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22708. 1251.97 s [algebraic-graphs]
  22709. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22710. 1251.97 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22711. 1251.97 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22712. 1251.97 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22713. 1251.97 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22714. 1251.97 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22715. 1251.97 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22716. 1251.97 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22717. 1251.97 s [algebraic-graphs]
  22718. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22719. 1251.97 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22720. 1251.97 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22721. 1251.97 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22722. 1251.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22723. 1251.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22724. 1251.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22725. 1251.97 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22726. 1251.97 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22727. 1251.97 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22728. 1251.97 s [algebraic-graphs]
  22729. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22730. 1251.97 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22731. 1251.97 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22732. 1251.97 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22733. 1251.97 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22734. 1251.97 s [algebraic-graphs]
  22735. 1251.97 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22736. 1251.97 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22737. 1251.97 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22738. 1251.97 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22739. 1251.97 s [algebraic-graphs]
  22740. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22741. 1254.59 s [algebraic-graphs] OK: overlays1 [x] == x
  22742. 1254.59 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22743. 1254.59 s [algebraic-graphs]
  22744. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22745. 1254.59 s [algebraic-graphs] OK: connects1 [x] == x
  22746. 1254.59 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22747. 1254.59 s [algebraic-graphs]
  22748. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22749. 1254.59 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22750. 1254.59 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22751. 1254.59 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22752. 1254.59 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22753. 1254.59 s [algebraic-graphs]
  22754. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22755. 1254.59 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22756. 1254.59 s [algebraic-graphs]
  22757. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22758. 1254.59 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22759. 1254.59 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22760. 1254.59 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22761. 1254.59 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22762. 1254.59 s [algebraic-graphs]
  22763. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22764. 1254.59 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22765. 1254.59 s [algebraic-graphs] OK: vertexCount x >= 1
  22766. 1254.59 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22767. 1254.59 s [algebraic-graphs]
  22768. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22769. 1254.59 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22770. 1254.59 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22771. 1254.59 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22772. 1254.59 s [algebraic-graphs]
  22773. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22774. 1254.59 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22775. 1254.59 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22776. 1254.59 s [algebraic-graphs]
  22777. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22778. 1254.59 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22779. 1254.59 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22780. 1254.59 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22781. 1254.59 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22782. 1254.59 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22783. 1254.59 s [algebraic-graphs]
  22784. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22785. 1254.59 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22786. 1254.59 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22787. 1254.59 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22788. 1254.59 s [algebraic-graphs]
  22789. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22790. 1254.59 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22791. 1254.59 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22792. 1254.59 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22793. 1254.59 s [algebraic-graphs]
  22794. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22795. 1254.59 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22796. 1254.59 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22797. 1254.59 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22798. 1254.59 s [algebraic-graphs]
  22799. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22800. 1254.59 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22801. 1254.59 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22802. 1254.59 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22803. 1254.59 s [algebraic-graphs]
  22804. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22805. 1254.59 s [algebraic-graphs] OK: path1 [x] == vertex x
  22806. 1254.59 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22807. 1254.59 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22808. 1254.59 s [algebraic-graphs]
  22809. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22810. 1254.59 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22811. 1254.59 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22812. 1254.59 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22813. 1254.59 s [algebraic-graphs]
  22814. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22815. 1254.59 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22816. 1254.59 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22817. 1254.59 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22818. 1254.59 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22819. 1254.59 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22820. 1254.59 s [algebraic-graphs]
  22821. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22822. 1254.59 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22823. 1254.59 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22824. 1254.59 s [algebraic-graphs]
  22825. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22826. 1254.59 s [algebraic-graphs] OK: star x [] == vertex x
  22827. 1254.59 s [algebraic-graphs] OK: star x [y] == edge x y
  22828. 1254.59 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22829. 1254.59 s [algebraic-graphs]
  22830. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22831. 1254.59 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22832. 1254.59 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22833. 1254.59 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22834. 1254.59 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22835. 1254.59 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22836. 1254.59 s [algebraic-graphs]
  22837. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22838. 1254.59 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22839. 1254.59 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22840. 1254.59 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22841. 1254.59 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22842. 1254.59 s [algebraic-graphs]
  22843. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22844. 1254.59 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22845. 1254.59 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22846. 1254.59 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22847. 1254.59 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22848. 1254.59 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22849. 1254.59 s [algebraic-graphs]
  22850. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  22851. 1254.59 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22852. 1254.59 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22853. 1254.59 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22854. 1254.59 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22855. 1254.59 s [algebraic-graphs]
  22856. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  22857. 1254.59 s [algebraic-graphs] OK: replaceVertex x x == id
  22858. 1254.59 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22859. 1254.59 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22860. 1254.59 s [algebraic-graphs]
  22861. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  22862. 1254.59 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22863. 1254.59 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22864. 1254.59 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22865. 1254.59 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22866. 1254.59 s [algebraic-graphs]
  22867. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  22868. 1254.59 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22869. 1254.59 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22870. 1254.59 s [algebraic-graphs] OK: transpose . transpose == id
  22871. 1254.59 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22872. 1254.59 s [algebraic-graphs]
  22873. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  22874. 1254.59 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22875. 1254.59 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22876. 1254.59 s [algebraic-graphs] OK: gmap id == id
  22877. 1254.59 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22878. 1254.59 s [algebraic-graphs]
  22879. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  22880. 1254.59 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22881. 1254.59 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22882. 1254.59 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22883. 1254.59 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22884. 1254.59 s [algebraic-graphs]
  22885. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  22886. 1254.59 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22887. 1254.59 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22888. 1254.59 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  22889. 1254.59 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  22890. 1254.59 s [algebraic-graphs]
  22891. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  22892. 1254.59 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  22893. 1254.59 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  22894. 1254.59 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22895. 1254.59 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  22896. 1254.59 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22897. 1254.59 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22898. 1254.59 s [algebraic-graphs] OK: closure . closure == closure
  22899. 1254.59 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22900. 1254.59 s [algebraic-graphs]
  22901. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  22902. 1254.59 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  22903. 1254.59 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  22904. 1254.59 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22905. 1254.59 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22906. 1254.59 s [algebraic-graphs]
  22907. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  22908. 1254.59 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22909. 1254.59 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  22910. 1254.59 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22911. 1254.59 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22912. 1254.59 s [algebraic-graphs]
  22913. 1254.59 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  22914. 1254.59 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22915. 1254.59 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  22916. 1254.59 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  22917. 1254.59 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22918. 1254.59 s [algebraic-graphs]
  22919. 1254.59 s [algebraic-graphs] ============ NonEmpty.Graph.============
  22920. 1254.59 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22921. 1254.59 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22922. 1254.59 s [algebraic-graphs]
  22923. 1254.59 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  22924. 1254.59 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22925. 1254.59 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22926. 1254.59 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22927. 1254.59 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22928. 1254.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22929. 1254.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22930. 1254.59 s [algebraic-graphs] OK: x <= x + y
  22931. 1254.59 s [algebraic-graphs] OK: x + y <= x * y
  22932. 1254.59 s [algebraic-graphs]
  22933. 1254.59 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  22934. 1254.59 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22935. 1254.59 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  22936. 1254.59 s [algebraic-graphs] OK: fmap id == id
  22937. 1254.59 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22938. 1254.59 s [algebraic-graphs]
  22939. 1254.59 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  22940. 1254.59 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  22941. 1255.95 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  22942. 1255.95 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  22943. 1255.95 s [algebraic-graphs] OK: (x >>= vertex) == x
  22944. 1255.95 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  22945. 1255.95 s [algebraic-graphs]
  22946. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  22947. 1255.95 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22948. 1255.95 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  22949. 1255.95 s [algebraic-graphs]
  22950. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  22951. 1255.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22952. 1255.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22953. 1255.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22954. 1255.95 s [algebraic-graphs] OK: size (vertex x) == 1
  22955. 1255.95 s [algebraic-graphs]
  22956. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  22957. 1255.95 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22958. 1255.95 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22959. 1255.95 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22960. 1255.95 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22961. 1255.95 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22962. 1255.95 s [algebraic-graphs]
  22963. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  22964. 1255.95 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22965. 1255.95 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22966. 1255.95 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22967. 1255.95 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22968. 1255.95 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22969. 1255.95 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22970. 1255.95 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22971. 1255.95 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22972. 1255.95 s [algebraic-graphs]
  22973. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  22974. 1255.95 s [algebraic-graphs] OK: overlay1 empty x == x
  22975. 1255.95 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  22976. 1255.95 s [algebraic-graphs]
  22977. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  22978. 1255.95 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22979. 1255.95 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22980. 1255.95 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22981. 1255.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22982. 1255.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22983. 1255.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22984. 1255.95 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22985. 1255.95 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22986. 1255.95 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22987. 1255.95 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22988. 1255.95 s [algebraic-graphs]
  22989. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  22990. 1255.95 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22991. 1255.95 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22992. 1255.95 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22993. 1255.95 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22994. 1255.95 s [algebraic-graphs]
  22995. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  22996. 1255.95 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22997. 1255.95 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22998. 1255.95 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22999. 1255.95 s [algebraic-graphs]
  23000. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  23001. 1255.95 s [algebraic-graphs] OK: overlays1 [x] == x
  23002. 1255.95 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23003. 1255.95 s [algebraic-graphs]
  23004. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  23005. 1255.95 s [algebraic-graphs] OK: connects1 [x] == x
  23006. 1255.95 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23007. 1255.95 s [algebraic-graphs]
  23008. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  23009. 1255.95 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  23010. 1255.95 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  23011. 1255.95 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  23012. 1255.95 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  23013. 1255.95 s [algebraic-graphs]
  23014. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  23015. 1255.95 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23016. 1255.95 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23017. 1255.95 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23018. 1255.95 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23019. 1255.95 s [algebraic-graphs]
  23020. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  23021. 1255.95 s [algebraic-graphs] OK: x === x == True
  23022. 1255.95 s [algebraic-graphs] OK: x + y === x + y == True
  23023. 1255.95 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  23024. 1255.95 s [algebraic-graphs] OK: x + y === x * y == False
  23025. 1255.95 s [algebraic-graphs]
  23026. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  23027. 1255.95 s [algebraic-graphs] OK: size (vertex x) == 1
  23028. 1255.95 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23029. 1255.95 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23030. 1255.95 s [algebraic-graphs] OK: size x >= 1
  23031. 1255.95 s [algebraic-graphs] OK: size x >= vertexCount x
  23032. 1255.95 s [algebraic-graphs]
  23033. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  23034. 1255.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23035. 1255.95 s [algebraic-graphs]
  23036. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  23037. 1255.95 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23038. 1255.95 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23039. 1255.95 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23040. 1255.95 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23041. 1255.95 s [algebraic-graphs]
  23042. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  23043. 1255.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23044. 1255.95 s [algebraic-graphs] OK: vertexCount x >= 1
  23045. 1255.95 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23046. 1255.95 s [algebraic-graphs]
  23047. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  23048. 1255.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23049. 1255.95 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23050. 1255.95 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23051. 1255.95 s [algebraic-graphs]
  23052. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  23053. 1255.95 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23054. 1255.95 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23055. 1255.95 s [algebraic-graphs]
  23056. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  23057. 1255.95 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23058. 1255.95 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23059. 1255.95 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23060. 1255.95 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23061. 1255.95 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23062. 1255.95 s [algebraic-graphs]
  23063. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  23064. 1255.95 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23065. 1255.95 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23066. 1255.95 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23067. 1255.95 s [algebraic-graphs]
  23068. 1255.95 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  23069. 1255.95 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23070. 1255.95 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23071. 1255.95 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23072. 1255.95 s [algebraic-graphs]
  23073. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  23074. 1255.96 s [algebraic-graphs] OK: path1 [x] == vertex x
  23075. 1255.96 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23076. 1255.96 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23077. 1255.96 s [algebraic-graphs]
  23078. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  23079. 1255.96 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23080. 1255.96 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23081. 1255.96 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23082. 1255.96 s [algebraic-graphs]
  23083. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  23084. 1255.96 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23085. 1255.96 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23086. 1255.96 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23087. 1255.96 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23088. 1255.96 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23089. 1255.96 s [algebraic-graphs]
  23090. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  23091. 1255.96 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23092. 1255.96 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23093. 1255.96 s [algebraic-graphs]
  23094. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  23095. 1255.96 s [algebraic-graphs] OK: star x [] == vertex x
  23096. 1255.96 s [algebraic-graphs] OK: star x [y] == edge x y
  23097. 1255.96 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23098. 1255.96 s [algebraic-graphs]
  23099. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  23100. 1255.96 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23101. 1255.96 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23102. 1255.96 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23103. 1255.96 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23104. 1255.96 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23105. 1255.96 s [algebraic-graphs]
  23106. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  23107. 1255.96 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23108. 1255.96 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23109. 1255.96 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23110. 1255.96 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23111. 1255.96 s [algebraic-graphs]
  23112. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  23113. 1255.96 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  23114. 1255.96 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  23115. 1255.96 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  23116. 1255.96 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  23117. 1255.96 s [algebraic-graphs]
  23118. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  23119. 1255.96 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  23120. 1255.96 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  23121. 1255.96 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  23122. 1255.96 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  23123. 1255.96 s [algebraic-graphs]
  23124. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  23125. 1255.96 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23126. 1255.96 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23127. 1255.96 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23128. 1255.96 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23129. 1255.96 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23130. 1255.96 s [algebraic-graphs]
  23131. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  23132. 1255.96 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23133. 1255.96 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23134. 1255.96 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23135. 1255.96 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23136. 1255.96 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  23137. 1255.96 s [algebraic-graphs]
  23138. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  23139. 1255.96 s [algebraic-graphs] OK: replaceVertex x x == id
  23140. 1255.96 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23141. 1255.96 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23142. 1255.96 s [algebraic-graphs]
  23143. 1255.96 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  23144. 1255.96 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23145. 1261.47 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23146. 1261.47 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23147. 1261.54 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23148. 1261.54 s [algebraic-graphs]
  23149. 1261.54 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  23150. 1261.54 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  23151. 1261.54 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  23152. 1261.54 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  23153. 1261.54 s [algebraic-graphs]
  23154. 1261.54 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  23155. 1261.54 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23156. 1261.54 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23157. 1261.54 s [algebraic-graphs] OK: transpose . transpose == id
  23158. 1261.54 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23159. 1261.54 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23160. 1261.54 s [algebraic-graphs]
  23161. 1261.54 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  23162. 1261.54 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23163. 1261.55 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23164. 1261.55 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23165. 1261.55 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23166. 1261.55 s [algebraic-graphs]
  23167. 1261.55 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  23168. 1261.55 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23169. 1261.55 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23170. 1261.55 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  23171. 1261.55 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  23172. 1261.55 s [algebraic-graphs]
  23173. 1261.55 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  23174. 1261.55 s [algebraic-graphs] OK: simplify == id
  23175. 1261.55 s [algebraic-graphs] OK: size (simplify x) <= size x
  23176. 1261.55 s [algebraic-graphs] OK: simplify 1 === 1
  23177. 1261.55 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  23178. 1261.55 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  23179. 1261.55 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  23180. 1261.55 s [algebraic-graphs]
  23181. 1261.55 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  23182. 1261.55 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  23183. 1261.55 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  23184. 1261.55 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  23185. 1261.55 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  23186. 1261.55 s [algebraic-graphs]
  23187. 1261.55 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  23188. 1261.55 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  23189. 1261.55 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  23190. 1261.55 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  23191. 1261.55 s [algebraic-graphs]
  23192. 1261.55 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  23193. 1261.55 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  23194. 1261.55 s [algebraic-graphs] OK: box x y ~~ box y x
  23195. 1261.55 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  23196. 1261.55 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  23197. 1261.55 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  23198. 1261.55 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23199. 1261.55 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  23200. 1261.55 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  23201. 1261.55 s [algebraic-graphs]
  23202. 1261.55 s [algebraic-graphs] ============ Relation ============
  23203. 1261.55 s [algebraic-graphs] OK: Axioms of graphs
  23204. 1261.55 s [algebraic-graphs]
  23205. 1261.55 s [algebraic-graphs] ============ Relation.consistent ============
  23206. 1261.55 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23207. 1261.55 s [algebraic-graphs]
  23208. 1261.55 s [algebraic-graphs] OK: consistent empty == True
  23209. 1261.55 s [algebraic-graphs] OK: consistent (vertex x) == True
  23210. 1261.55 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23211. 1261.55 s [algebraic-graphs] OK: consistent (connect x y) == True
  23212. 1261.55 s [algebraic-graphs] OK: consistent (edge x y) == True
  23213. 1261.55 s [algebraic-graphs] OK: consistent (edges xs) == True
  23214. 1261.55 s [algebraic-graphs] OK: consistent (stars xs) == True
  23215. 1261.55 s [algebraic-graphs]
  23216. 1261.55 s [algebraic-graphs] ============ Relation.Show ============
  23217. 1261.55 s [algebraic-graphs] OK: show (empty ) == "empty"
  23218. 1261.55 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23219. 1261.55 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23220. 1261.55 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23221. 1261.55 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23222. 1261.55 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23223. 1261.55 s [algebraic-graphs]
  23224. 1261.55 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23225. 1261.55 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23226. 1261.55 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23227. 1261.55 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23228. 1261.55 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23229. 1261.55 s [algebraic-graphs]
  23230. 1261.55 s [algebraic-graphs] ============ Relation.Ord ============
  23231. 1261.55 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23232. 1261.55 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23233. 1261.55 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23234. 1261.55 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23235. 1261.55 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23236. 1261.55 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23237. 1261.55 s [algebraic-graphs] OK: x <= x + y
  23238. 1261.55 s [algebraic-graphs] OK: x + y <= x * y
  23239. 1261.55 s [algebraic-graphs]
  23240. 1261.55 s [algebraic-graphs] ============ Relation.empty ============
  23241. 1261.55 s [algebraic-graphs] OK: isEmpty empty == True
  23242. 1261.55 s [algebraic-graphs] OK: hasVertex x empty == False
  23243. 1261.55 s [algebraic-graphs] OK: vertexCount empty == 0
  23244. 1261.55 s [algebraic-graphs] OK: edgeCount empty == 0
  23245. 1261.55 s [algebraic-graphs]
  23246. 1261.55 s [algebraic-graphs] ============ Relation.vertex ============
  23247. 1261.55 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23248. 1261.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23249. 1261.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23250. 1261.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23251. 1261.55 s [algebraic-graphs]
  23252. 1261.55 s [algebraic-graphs] ============ Relation.edge ============
  23253. 1261.55 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23254. 1261.55 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23255. 1261.55 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23256. 1261.55 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23257. 1261.55 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23258. 1261.55 s [algebraic-graphs]
  23259. 1261.55 s [algebraic-graphs] ============ Relation.overlay ============
  23260. 1261.55 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23261. 1261.55 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23262. 1261.55 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23263. 1261.55 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23264. 1261.55 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23265. 1261.55 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23266. 1261.55 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23267. 1261.55 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23268. 1261.55 s [algebraic-graphs]
  23269. 1261.55 s [algebraic-graphs] ============ Relation.connect ============
  23270. 1261.55 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23271. 1261.55 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23272. 1261.55 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23273. 1261.55 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23274. 1261.55 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23275. 1261.55 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23276. 1261.55 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23277. 1261.55 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23278. 1261.55 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23279. 1261.55 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23280. 1261.55 s [algebraic-graphs]
  23281. 1261.55 s [algebraic-graphs] ============ Relation.vertices ============
  23282. 1261.55 s [algebraic-graphs] OK: vertices [] == empty
  23283. 1261.55 s [algebraic-graphs] OK: vertices [x] == vertex x
  23284. 1261.55 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23285. 1261.55 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23286. 1261.55 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23287. 1261.55 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23288. 1261.55 s [algebraic-graphs]
  23289. 1261.55 s [algebraic-graphs] ============ Relation.edges ============
  23290. 1261.55 s [algebraic-graphs] OK: edges [] == empty
  23291. 1261.55 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23292. 1261.55 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23293. 1261.55 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23294. 1261.55 s [algebraic-graphs]
  23295. 1261.55 s [algebraic-graphs] ============ Relation.overlays ============
  23296. 1261.55 s [algebraic-graphs] OK: overlays [] == empty
  23297. 1261.55 s [algebraic-graphs] OK: overlays [x] == x
  23298. 1261.55 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23299. 1261.55 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23300. 1261.55 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23301. 1261.55 s [algebraic-graphs]
  23302. 1261.55 s [algebraic-graphs] ============ Relation.connects ============
  23303. 1261.55 s [algebraic-graphs] OK: connects [] == empty
  23304. 1261.55 s [algebraic-graphs] OK: connects [x] == x
  23305. 1261.55 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23306. 1261.55 s [algebraic-graphs] OK: connects == foldr connect empty
  23307. 1261.55 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23308. 1261.55 s [algebraic-graphs]
  23309. 1261.55 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23310. 1261.55 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23311. 1261.55 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23312. 1261.55 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23313. 1261.55 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23314. 1261.55 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23315. 1261.55 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23316. 1261.55 s [algebraic-graphs]
  23317. 1261.55 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23318. 1261.55 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23319. 1261.55 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23320. 1261.55 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23321. 1261.55 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23322. 1261.55 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23323. 1261.55 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23324. 1261.55 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23325. 1261.55 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23326. 1261.55 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23327. 1261.55 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23328. 1261.55 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23329. 1261.55 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23330. 1261.55 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23331. 1261.55 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23332. 1261.55 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23333. 1261.55 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23334. 1261.55 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23335. 1264.37 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23336. 1264.37 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23337. 1264.37 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23338. 1264.37 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23339. 1264.37 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23340. 1264.37 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23341. 1264.37 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23342. 1264.38 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23343. 1264.38 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23344. 1264.38 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23345. 1264.38 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23346. 1264.38 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23347. 1264.38 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23348. 1264.38 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23349. 1264.38 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23350. 1264.38 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23351. 1264.38 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23352. 1264.38 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23353. 1264.38 s [algebraic-graphs]
  23354. 1264.38 s [algebraic-graphs] ============ Relation.foldg ============
  23355. 1264.38 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23356. 1264.38 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23357. 1264.38 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23358. 1264.38 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23359. 1264.38 s [algebraic-graphs]
  23360. 1264.38 s [algebraic-graphs] ============ Relation.isEmpty ============
  23361. 1264.38 s [algebraic-graphs] OK: isEmpty empty == True
  23362. 1264.38 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23363. 1264.38 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23364. 1264.38 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23365. 1264.38 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23366. 1264.38 s [algebraic-graphs]
  23367. 1264.38 s [algebraic-graphs] ============ Relation.hasVertex ============
  23368. 1264.38 s [algebraic-graphs] OK: hasVertex x empty == False
  23369. 1264.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23370. 1264.38 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23371. 1264.38 s [algebraic-graphs]
  23372. 1264.38 s [algebraic-graphs] ============ Relation.hasEdge ============
  23373. 1264.38 s [algebraic-graphs] OK: hasEdge x y empty == False
  23374. 1264.38 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23375. 1264.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23376. 1264.38 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23377. 1264.38 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23378. 1264.38 s [algebraic-graphs]
  23379. 1264.38 s [algebraic-graphs] ============ Relation.vertexCount ============
  23380. 1264.38 s [algebraic-graphs] OK: vertexCount empty == 0
  23381. 1264.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23382. 1264.38 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23383. 1264.38 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23384. 1264.38 s [algebraic-graphs]
  23385. 1264.38 s [algebraic-graphs] ============ Relation.edgeCount ============
  23386. 1264.38 s [algebraic-graphs] OK: edgeCount empty == 0
  23387. 1264.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23388. 1264.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23389. 1264.38 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23390. 1264.38 s [algebraic-graphs]
  23391. 1264.38 s [algebraic-graphs] ============ Relation.vertexList ============
  23392. 1264.38 s [algebraic-graphs] OK: vertexList empty == []
  23393. 1264.38 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23394. 1264.38 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23395. 1264.38 s [algebraic-graphs]
  23396. 1264.38 s [algebraic-graphs] ============ Relation.vertexSet ============
  23397. 1264.38 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23398. 1264.38 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23399. 1264.38 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23400. 1264.38 s [algebraic-graphs]
  23401. 1264.38 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23402. 1264.38 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23403. 1264.38 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23404. 1264.38 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23405. 1264.38 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23406. 1264.38 s [algebraic-graphs]
  23407. 1264.38 s [algebraic-graphs] ============ Relation.edgeList ============
  23408. 1264.38 s [algebraic-graphs] OK: edgeList empty == []
  23409. 1264.38 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23410. 1264.38 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23411. 1264.38 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23412. 1264.38 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23413. 1264.38 s [algebraic-graphs]
  23414. 1264.38 s [algebraic-graphs] ============ Relation.edgeSet ============
  23415. 1264.38 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23416. 1264.38 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23417. 1264.38 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23418. 1264.38 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23419. 1264.38 s [algebraic-graphs]
  23420. 1264.38 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23421. 1264.38 s [algebraic-graphs] OK: adjacencyList empty == []
  23422. 1264.38 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23423. 1264.38 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23424. 1264.38 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23425. 1264.38 s [algebraic-graphs]
  23426. 1264.38 s [algebraic-graphs] ============ Relation.preSet ============
  23427. 1264.38 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23428. 1264.38 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23429. 1264.38 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23430. 1264.38 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23431. 1264.38 s [algebraic-graphs]
  23432. 1264.38 s [algebraic-graphs] ============ Relation.preIntSet ============
  23433. 1264.38 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23434. 1264.38 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23435. 1264.38 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23436. 1264.38 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23437. 1264.38 s [algebraic-graphs]
  23438. 1264.38 s [algebraic-graphs] ============ Relation.postSet ============
  23439. 1264.38 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23440. 1264.38 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23441. 1264.38 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23442. 1264.38 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23443. 1264.38 s [algebraic-graphs]
  23444. 1264.38 s [algebraic-graphs] ============ Relation.postIntSet ============
  23445. 1264.38 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23446. 1264.38 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23447. 1264.38 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23448. 1264.38 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23449. 1264.38 s [algebraic-graphs]
  23450. 1264.38 s [algebraic-graphs] ============ Relation.path ============
  23451. 1264.38 s [algebraic-graphs] OK: path [] == empty
  23452. 1264.38 s [algebraic-graphs] OK: path [x] == vertex x
  23453. 1264.38 s [algebraic-graphs] OK: path [x,y] == edge x y
  23454. 1264.38 s [algebraic-graphs]
  23455. 1264.38 s [algebraic-graphs] ============ Relation.circuit ============
  23456. 1264.38 s [algebraic-graphs] OK: circuit [] == empty
  23457. 1264.38 s [algebraic-graphs] OK: circuit [x] == edge x x
  23458. 1264.38 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23459. 1264.38 s [algebraic-graphs]
  23460. 1264.38 s [algebraic-graphs] ============ Relation.clique ============
  23461. 1264.38 s [algebraic-graphs] OK: clique [] == empty
  23462. 1264.38 s [algebraic-graphs] OK: clique [x] == vertex x
  23463. 1264.38 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23464. 1264.38 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23465. 1264.38 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23466. 1264.38 s [algebraic-graphs]
  23467. 1264.38 s [algebraic-graphs] ============ Relation.biclique ============
  23468. 1264.38 s [algebraic-graphs] OK: biclique [] [] == empty
  23469. 1264.38 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23470. 1264.38 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23471. 1264.38 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23472. 1264.38 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23473. 1264.38 s [algebraic-graphs]
  23474. 1264.38 s [algebraic-graphs] ============ Relation.star ============
  23475. 1264.38 s [algebraic-graphs] OK: star x [] == vertex x
  23476. 1264.38 s [algebraic-graphs] OK: star x [y] == edge x y
  23477. 1264.38 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23478. 1264.38 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23479. 1264.38 s [algebraic-graphs]
  23480. 1264.38 s [algebraic-graphs] ============ Relation.stars ============
  23481. 1264.38 s [algebraic-graphs] OK: stars [] == empty
  23482. 1264.38 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23483. 1264.38 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23484. 1264.38 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23485. 1264.38 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23486. 1264.38 s [algebraic-graphs] OK: stars . adjacencyList == id
  23487. 1264.38 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23488. 1264.38 s [algebraic-graphs]
  23489. 1264.38 s [algebraic-graphs] ============ Relation.tree ============
  23490. 1264.38 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23491. 1264.38 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23492. 1264.38 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23493. 1264.38 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23494. 1264.38 s [algebraic-graphs]
  23495. 1264.38 s [algebraic-graphs] ============ Relation.forest ============
  23496. 1264.38 s [algebraic-graphs] OK: forest [] == empty
  23497. 1264.38 s [algebraic-graphs] OK: forest [x] == tree x
  23498. 1264.38 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23499. 1264.38 s [algebraic-graphs] OK: forest == overlays . map tree
  23500. 1264.38 s [algebraic-graphs]
  23501. 1264.38 s [algebraic-graphs] ============ Relation.removeVertex ============
  23502. 1264.38 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23503. 1264.38 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23504. 1264.38 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23505. 1264.38 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23506. 1264.38 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23507. 1264.38 s [algebraic-graphs]
  23508. 1264.38 s [algebraic-graphs] ============ Relation.removeEdge ============
  23509. 1264.38 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23510. 1264.38 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23511. 1264.38 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23512. 1264.38 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23513. 1264.38 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23514. 1264.38 s [algebraic-graphs]
  23515. 1264.38 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23516. 1264.38 s [algebraic-graphs] OK: replaceVertex x x == id
  23517. 1264.38 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23518. 1264.38 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23519. 1264.38 s [algebraic-graphs]
  23520. 1264.38 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23521. 1264.38 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23522. 1282.05 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23523. 1282.05 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23524. 1282.08 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23525. 1282.08 s [algebraic-graphs]
  23526. 1282.08 s [algebraic-graphs] ============ Relation.transpose ============
  23527. 1282.08 s [algebraic-graphs] OK: transpose empty == empty
  23528. 1282.08 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23529. 1282.08 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23530. 1282.08 s [algebraic-graphs] OK: transpose . transpose == id
  23531. 1282.08 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23532. 1282.08 s [algebraic-graphs]
  23533. 1282.08 s [algebraic-graphs] ============ Relation.gmap ============
  23534. 1282.08 s [algebraic-graphs] OK: gmap f empty == empty
  23535. 1282.08 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23536. 1282.08 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23537. 1282.08 s [algebraic-graphs] OK: gmap id == id
  23538. 1282.08 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23539. 1282.08 s [algebraic-graphs]
  23540. 1282.08 s [algebraic-graphs] ============ Relation.induce ============
  23541. 1282.08 s [algebraic-graphs] OK: induce (const True ) x == x
  23542. 1282.08 s [algebraic-graphs] OK: induce (const False) x == empty
  23543. 1282.08 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23544. 1282.08 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23545. 1282.08 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23546. 1282.08 s [algebraic-graphs]
  23547. 1282.08 s [algebraic-graphs] ============ Relation.compose ============
  23548. 1282.08 s [algebraic-graphs] OK: compose empty x == empty
  23549. 1282.08 s [algebraic-graphs] OK: compose x empty == empty
  23550. 1282.08 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23551. 1282.08 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23552. 1282.08 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23553. 1282.08 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23554. 1282.08 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23555. 1282.08 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23556. 1282.08 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23557. 1282.08 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23558. 1282.08 s [algebraic-graphs]
  23559. 1282.08 s [algebraic-graphs] ============ Relation.closure ============
  23560. 1282.08 s [algebraic-graphs] OK: closure empty == empty
  23561. 1282.08 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23562. 1282.08 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23563. 1282.08 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23564. 1282.08 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23565. 1282.08 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23566. 1282.08 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23567. 1282.08 s [algebraic-graphs] OK: closure . closure == closure
  23568. 1282.08 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23569. 1282.08 s [algebraic-graphs]
  23570. 1282.08 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23571. 1282.08 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23572. 1282.08 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23573. 1282.08 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23574. 1282.08 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23575. 1282.08 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23576. 1282.08 s [algebraic-graphs]
  23577. 1282.08 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23578. 1282.08 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23579. 1282.08 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23580. 1282.08 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23581. 1282.08 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23582. 1282.08 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23583. 1282.08 s [algebraic-graphs]
  23584. 1282.08 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23585. 1282.08 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23586. 1282.08 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23587. 1282.08 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23588. 1282.08 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23589. 1282.08 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23590. 1282.08 s [algebraic-graphs]
  23591. 1282.08 s [algebraic-graphs] ============ Relation.induceJust ============
  23592. 1282.08 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23593. 1282.08 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23594. 1282.08 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23595. 1282.08 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23596. 1282.08 s [algebraic-graphs]
  23597. 1282.08 s [algebraic-graphs] ============ ReflexiveRelation ============
  23598. 1282.08 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23599. 1282.08 s [algebraic-graphs]
  23600. 1282.08 s [algebraic-graphs] ============ TransitiveRelation ============
  23601. 1282.08 s [algebraic-graphs] OK: Axioms of transitive graphs
  23602. 1282.08 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23603. 1282.08 s [algebraic-graphs]
  23604. 1282.08 s [algebraic-graphs] ============ PreorderRelation ============
  23605. 1282.08 s [algebraic-graphs] OK: Axioms of preorder graphs
  23606. 1282.08 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23607. 1282.08 s [algebraic-graphs]
  23608. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation ============
  23609. 1282.08 s [algebraic-graphs] OK: Axioms of undirected graphs
  23610. 1282.08 s [algebraic-graphs]
  23611. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23612. 1282.08 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23613. 1282.08 s [algebraic-graphs]
  23614. 1282.08 s [algebraic-graphs] OK: consistent empty == True
  23615. 1282.08 s [algebraic-graphs] OK: consistent (vertex x) == True
  23616. 1282.08 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23617. 1282.08 s [algebraic-graphs] OK: consistent (connect x y) == True
  23618. 1282.08 s [algebraic-graphs] OK: consistent (edge x y) == True
  23619. 1282.08 s [algebraic-graphs] OK: consistent (edges xs) == True
  23620. 1282.08 s [algebraic-graphs] OK: consistent (stars xs) == True
  23621. 1282.08 s [algebraic-graphs]
  23622. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23623. 1282.08 s [algebraic-graphs] OK: show (empty ) == "empty"
  23624. 1282.08 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23625. 1282.08 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23626. 1282.08 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23627. 1282.08 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23628. 1282.08 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23629. 1282.08 s [algebraic-graphs]
  23630. 1282.08 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23631. 1282.08 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23632. 1282.08 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23633. 1282.08 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23634. 1282.08 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23635. 1282.08 s [algebraic-graphs]
  23636. 1282.08 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23637. 1282.08 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23638. 1282.08 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23639. 1282.08 s [algebraic-graphs]
  23640. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23641. 1282.08 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23642. 1282.08 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23643. 1282.08 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23644. 1282.08 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23645. 1282.08 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23646. 1282.08 s [algebraic-graphs]
  23647. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23648. 1282.08 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23649. 1282.08 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23650. 1282.08 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23651. 1282.08 s [algebraic-graphs]
  23652. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23653. 1282.08 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23654. 1282.08 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23655. 1282.08 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23656. 1282.08 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23657. 1282.08 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23658. 1282.08 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23659. 1282.08 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23660. 1282.08 s [algebraic-graphs] OK: x <= x + y
  23661. 1282.08 s [algebraic-graphs] OK: x + y <= x * y
  23662. 1282.08 s [algebraic-graphs]
  23663. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23664. 1282.08 s [algebraic-graphs] OK: isEmpty empty == True
  23665. 1282.08 s [algebraic-graphs] OK: hasVertex x empty == False
  23666. 1282.08 s [algebraic-graphs] OK: vertexCount empty == 0
  23667. 1282.08 s [algebraic-graphs] OK: edgeCount empty == 0
  23668. 1282.08 s [algebraic-graphs]
  23669. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23670. 1282.08 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23671. 1282.08 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23672. 1282.08 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23673. 1282.08 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23674. 1282.08 s [algebraic-graphs]
  23675. 1282.08 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23676. 1282.08 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23677. 1282.08 s [algebraic-graphs] OK: edge x y == edge y x
  23678. 1282.09 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23679. 1282.09 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23680. 1282.09 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23681. 1282.09 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23682. 1282.09 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23683. 1282.09 s [algebraic-graphs]
  23684. 1282.09 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23685. 1282.09 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23686. 1282.09 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23687. 1282.09 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23688. 1282.09 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23689. 1282.09 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23690. 1282.09 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23691. 1282.09 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23692. 1282.09 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23693. 1282.09 s [algebraic-graphs]
  23694. 1282.09 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23695. 1282.09 s [algebraic-graphs] OK: connect x y == connect y x
  23696. 1282.09 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23697. 1282.09 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23698. 1282.09 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23699. 1282.09 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23700. 1282.09 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23701. 1282.09 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23702. 1282.09 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23703. 1282.09 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23704. 1282.09 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23705. 1282.09 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23706. 1282.09 s [algebraic-graphs]
  23707. 1282.09 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23708. 1282.09 s [algebraic-graphs] OK: vertices [] == empty
  23709. 1282.09 s [algebraic-graphs] OK: vertices [x] == vertex x
  23710. 1282.09 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23711. 1282.09 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23712. 1282.09 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23713. 1282.09 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23714. 1282.09 s [algebraic-graphs]
  23715. 1282.09 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23716. 1282.09 s [algebraic-graphs] OK: edges [] == empty
  23717. 1282.09 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23718. 1282.09 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23719. 1282.09 s [algebraic-graphs]
  23720. 1282.09 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23721. 1282.09 s [algebraic-graphs] OK: overlays [] == empty
  23722. 1291.76 s [algebraic-graphs] OK: overlays [x] == x
  23723. 1291.81 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23724. 1291.81 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23725. 1291.81 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23726. 1291.81 s [algebraic-graphs]
  23727. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23728. 1291.81 s [algebraic-graphs] OK: connects [] == empty
  23729. 1291.81 s [algebraic-graphs] OK: connects [x] == x
  23730. 1291.81 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23731. 1291.81 s [algebraic-graphs] OK: connects == foldr connect empty
  23732. 1291.81 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23733. 1291.81 s [algebraic-graphs] OK: connects == connects . reverse
  23734. 1291.81 s [algebraic-graphs]
  23735. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23736. 1291.81 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23737. 1291.81 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23738. 1291.81 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23739. 1291.81 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23740. 1291.81 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23741. 1291.81 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23742. 1291.81 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23743. 1291.81 s [algebraic-graphs]
  23744. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23745. 1291.81 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23746. 1291.81 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23747. 1291.81 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23748. 1291.81 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23749. 1291.81 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23750. 1291.81 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23751. 1291.81 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23752. 1291.81 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23753. 1291.81 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23754. 1291.81 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23755. 1291.81 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23756. 1291.81 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23757. 1291.81 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23758. 1291.81 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23759. 1291.81 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23760. 1291.81 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23761. 1291.81 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23762. 1291.81 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23763. 1291.81 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23764. 1291.81 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23765. 1291.81 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23766. 1291.81 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23767. 1291.81 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23768. 1291.81 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23769. 1291.81 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23770. 1291.81 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23771. 1291.81 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23772. 1291.81 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23773. 1291.81 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23774. 1291.81 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23775. 1291.81 s [algebraic-graphs]
  23776. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23777. 1291.81 s [algebraic-graphs] OK: isEmpty empty == True
  23778. 1291.81 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23779. 1291.81 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23780. 1291.81 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23781. 1291.81 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23782. 1291.81 s [algebraic-graphs]
  23783. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23784. 1291.81 s [algebraic-graphs] OK: hasVertex x empty == False
  23785. 1291.81 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23786. 1291.81 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23787. 1291.81 s [algebraic-graphs]
  23788. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23789. 1291.81 s [algebraic-graphs] OK: hasEdge x y empty == False
  23790. 1291.81 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23791. 1291.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23792. 1291.81 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23793. 1291.81 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23794. 1291.81 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23795. 1291.81 s [algebraic-graphs]
  23796. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23797. 1291.81 s [algebraic-graphs] OK: vertexCount empty == 0
  23798. 1291.81 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23799. 1291.81 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23800. 1291.81 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23801. 1291.81 s [algebraic-graphs]
  23802. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23803. 1291.81 s [algebraic-graphs] OK: edgeCount empty == 0
  23804. 1291.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23805. 1291.81 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23806. 1291.81 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23807. 1291.81 s [algebraic-graphs]
  23808. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23809. 1291.81 s [algebraic-graphs] OK: vertexList empty == []
  23810. 1291.81 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23811. 1291.81 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23812. 1291.81 s [algebraic-graphs]
  23813. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23814. 1291.81 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23815. 1291.81 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23816. 1291.81 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23817. 1291.81 s [algebraic-graphs]
  23818. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23819. 1291.81 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23820. 1291.81 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23821. 1291.81 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23822. 1291.81 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23823. 1291.81 s [algebraic-graphs]
  23824. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23825. 1291.81 s [algebraic-graphs] OK: edgeList empty == []
  23826. 1291.81 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23827. 1291.81 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23828. 1291.81 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23829. 1291.81 s [algebraic-graphs]
  23830. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23831. 1291.81 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23832. 1291.81 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23833. 1291.81 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23834. 1291.81 s [algebraic-graphs]
  23835. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23836. 1291.81 s [algebraic-graphs] OK: adjacencyList empty == []
  23837. 1291.81 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23838. 1291.81 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23839. 1291.81 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23840. 1291.81 s [algebraic-graphs]
  23841. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23842. 1291.81 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23843. 1291.81 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23844. 1291.81 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23845. 1291.81 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23846. 1291.81 s [algebraic-graphs]
  23847. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23848. 1291.81 s [algebraic-graphs] OK: path [] == empty
  23849. 1291.81 s [algebraic-graphs] OK: path [x] == vertex x
  23850. 1291.81 s [algebraic-graphs] OK: path [x,y] == edge x y
  23851. 1291.81 s [algebraic-graphs] OK: path == path . reverse
  23852. 1291.81 s [algebraic-graphs]
  23853. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  23854. 1291.81 s [algebraic-graphs] OK: circuit [] == empty
  23855. 1291.81 s [algebraic-graphs] OK: circuit [x] == edge x x
  23856. 1291.81 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23857. 1291.81 s [algebraic-graphs] OK: circuit == circuit . reverse
  23858. 1291.81 s [algebraic-graphs]
  23859. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  23860. 1291.81 s [algebraic-graphs] OK: clique [] == empty
  23861. 1291.81 s [algebraic-graphs] OK: clique [x] == vertex x
  23862. 1291.81 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23863. 1291.81 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23864. 1291.81 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23865. 1291.81 s [algebraic-graphs] OK: clique == clique . reverse
  23866. 1291.81 s [algebraic-graphs]
  23867. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  23868. 1291.81 s [algebraic-graphs] OK: biclique [] [] == empty
  23869. 1291.81 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23870. 1291.81 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23871. 1291.81 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23872. 1291.81 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23873. 1291.81 s [algebraic-graphs]
  23874. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  23875. 1291.81 s [algebraic-graphs] OK: star x [] == vertex x
  23876. 1291.81 s [algebraic-graphs] OK: star x [y] == edge x y
  23877. 1291.81 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23878. 1291.81 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23879. 1291.81 s [algebraic-graphs]
  23880. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  23881. 1291.81 s [algebraic-graphs] OK: stars [] == empty
  23882. 1291.81 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23883. 1291.81 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23884. 1291.81 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23885. 1291.81 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23886. 1291.81 s [algebraic-graphs] OK: stars . adjacencyList == id
  23887. 1291.81 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23888. 1291.81 s [algebraic-graphs]
  23889. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  23890. 1291.81 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23891. 1291.81 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23892. 1291.81 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23893. 1291.81 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23894. 1291.81 s [algebraic-graphs]
  23895. 1291.81 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  23896. 1291.81 s [algebraic-graphs] OK: forest [] == empty
  23897. 1297.92 s [algebraic-graphs] OK: forest [x] == tree x
  23898. 1297.92 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23899. 1297.97 s [algebraic-graphs] OK: forest == overlays . map tree
  23900. 1297.97 s [algebraic-graphs]
  23901. 1297.97 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  23902. 1297.97 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23903. 1297.97 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23904. 1297.97 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23905. 1297.97 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23906. 1297.97 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23907. 1297.97 s [algebraic-graphs]
  23908. 1297.97 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  23909. 1297.97 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23910. 1297.97 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23911. 1297.97 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23912. 1297.97 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23913. 1297.97 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23914. 1297.97 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23915. 1297.97 s [algebraic-graphs]
  23916. 1297.97 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  23917. 1297.97 s [algebraic-graphs] OK: replaceVertex x x == id
  23918. 1297.97 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23919. 1297.97 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23920. 1297.97 s [algebraic-graphs]
  23921. 1297.97 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  23922. 1297.97 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23923. 1297.97 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23924. 1297.97 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23925. 1297.97 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23926. 1297.97 s [algebraic-graphs]
  23927. 1297.97 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  23928. 1297.97 s [algebraic-graphs] OK: gmap f empty == empty
  23929. 1297.97 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23930. 1297.97 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23931. 1297.97 s [algebraic-graphs] OK: gmap id == id
  23932. 1297.97 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23933. 1297.97 s [algebraic-graphs]
  23934. 1297.97 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  23935. 1297.97 s [algebraic-graphs] OK: induce (const True ) x == x
  23936. 1297.97 s [algebraic-graphs] OK: induce (const False) x == empty
  23937. 1297.97 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23938. 1297.97 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23939. 1297.97 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23940. 1297.97 s [algebraic-graphs]
  23941. 1297.97 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  23942. 1297.97 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23943. 1297.97 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23944. 1297.97 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23945. 1297.97 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23946. 1297.97 s [algebraic-graphs]
  23947. 1297.97 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  23948. 1297.97 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  23949. 1297.97 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  23950. 1297.97 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  23951. 1297.97 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  23952. 1297.97 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  23953. 1297.97 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  23954. 1297.97 s [algebraic-graphs]
  23955. 1297.97 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  23956. 1297.97 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  23957. 1297.97 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  23958. 1297.97 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  23959. 1297.97 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  23960. 1297.97 s [algebraic-graphs]
  23961. 1297.97 s [algebraic-graphs] ============ Typed ============
  23962. 1297.97 s [algebraic-graphs]
  23963. 1297.97 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  23964. 1297.97 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23965. 1297.97 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23966. 1297.97 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  23967. 1297.97 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23968. 1297.97 s [algebraic-graphs]
  23969. 1297.97 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  23970. 1297.97 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23971. 1297.97 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23972. 1297.97 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  23973. 1297.97 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23974. 1297.97 s [algebraic-graphs]
  23975. 1297.97 s [algebraic-graphs] ============ Typed.dfsForest ============
  23976. 1297.97 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  23977. 1297.97 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  23978. 1297.97 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  23979. 1297.97 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  23980. 1297.97 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  23981. 1297.97 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  23982. 1297.97 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  23983. 1297.97 s [algebraic-graphs]
  23984. 1297.97 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  23985. 1297.97 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  23986. 1297.97 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  23987. 1297.97 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  23988. 1297.97 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  23989. 1297.97 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  23990. 1297.97 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  23991. 1297.97 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  23992. 1297.97 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  23993. 1297.97 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  23994. 1297.97 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  23995. 1297.97 s [algebraic-graphs]
  23996. 1297.97 s [algebraic-graphs] ============ Typed.dfs ============
  23997. 1297.97 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  23998. 1297.97 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  23999. 1297.97 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  24000. 1297.97 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  24001. 1297.97 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  24002. 1297.97 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  24003. 1297.97 s [algebraic-graphs] OK: dfs % x $ [] == []
  24004. 1297.97 s [algebraic-graphs]
  24005. 1297.97 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  24006. 1297.97 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  24007. 1297.97 s [algebraic-graphs]
  24008. 1297.97 s [algebraic-graphs] ============ Typed.topSort ============
  24009. 1297.97 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  24010. 1297.97 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  24011. 1297.97 s [algebraic-graphs]
  24012. 1297.97 s [algebraic-graphs] ============ Graph.Undirected ============
  24013. 1297.97 s [algebraic-graphs] OK: Axioms of undirected graphs
  24014. 1297.97 s [algebraic-graphs]
  24015. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  24016. 1297.97 s [algebraic-graphs] OK: show (empty ) == "empty"
  24017. 1297.97 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  24018. 1297.97 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  24019. 1297.97 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  24020. 1297.97 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  24021. 1297.97 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  24022. 1297.97 s [algebraic-graphs]
  24023. 1297.97 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  24024. 1297.97 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  24025. 1297.97 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  24026. 1297.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  24027. 1297.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24028. 1297.97 s [algebraic-graphs]
  24029. 1297.97 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24030. 1297.97 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24031. 1297.97 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24032. 1297.97 s [algebraic-graphs]
  24033. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  24034. 1297.97 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  24035. 1297.97 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24036. 1297.97 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  24037. 1297.97 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  24038. 1297.97 s [algebraic-graphs]
  24039. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  24040. 1297.97 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  24041. 1297.97 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24042. 1297.97 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  24043. 1297.97 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  24044. 1297.97 s [algebraic-graphs]
  24045. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  24046. 1297.97 s [algebraic-graphs] OK: complement empty == empty
  24047. 1297.97 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  24048. 1297.97 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  24049. 1297.97 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  24050. 1297.97 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  24051. 1297.97 s [algebraic-graphs] OK: complement . complement == id
  24052. 1297.97 s [algebraic-graphs]
  24053. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  24054. 1297.97 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24055. 1297.97 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24056. 1297.97 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24057. 1297.97 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24058. 1297.97 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24059. 1297.97 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24060. 1297.97 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24061. 1297.97 s [algebraic-graphs] OK: x <= x + y
  24062. 1297.97 s [algebraic-graphs] OK: x + y <= x * y
  24063. 1297.97 s [algebraic-graphs]
  24064. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  24065. 1297.97 s [algebraic-graphs] OK: isEmpty empty == True
  24066. 1297.97 s [algebraic-graphs] OK: hasVertex x empty == False
  24067. 1297.97 s [algebraic-graphs] OK: vertexCount empty == 0
  24068. 1297.97 s [algebraic-graphs] OK: edgeCount empty == 0
  24069. 1297.97 s [algebraic-graphs]
  24070. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  24071. 1297.97 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24072. 1297.97 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24073. 1297.97 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24074. 1297.97 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24075. 1297.97 s [algebraic-graphs]
  24076. 1297.97 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  24077. 1297.97 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24078. 1297.97 s [algebraic-graphs] OK: edge x y == edge y x
  24079. 1305.06 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24080. 1305.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24081. 1305.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24082. 1305.10 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24083. 1305.10 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24084. 1305.10 s [algebraic-graphs]
  24085. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  24086. 1305.10 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24087. 1305.10 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24088. 1305.10 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24089. 1305.10 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24090. 1305.10 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24091. 1305.10 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24092. 1305.10 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24093. 1305.10 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24094. 1305.10 s [algebraic-graphs]
  24095. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  24096. 1305.10 s [algebraic-graphs] OK: connect x y == connect y x
  24097. 1305.10 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24098. 1305.10 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24099. 1305.10 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24100. 1305.10 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24101. 1305.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24102. 1305.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24103. 1305.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24104. 1305.10 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24105. 1305.10 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24106. 1305.10 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24107. 1305.10 s [algebraic-graphs]
  24108. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  24109. 1305.10 s [algebraic-graphs] OK: vertices [] == empty
  24110. 1305.10 s [algebraic-graphs] OK: vertices [x] == vertex x
  24111. 1305.10 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24112. 1305.10 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24113. 1305.10 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24114. 1305.10 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24115. 1305.10 s [algebraic-graphs]
  24116. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  24117. 1305.10 s [algebraic-graphs] OK: edges [] == empty
  24118. 1305.10 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24119. 1305.10 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24120. 1305.10 s [algebraic-graphs]
  24121. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  24122. 1305.10 s [algebraic-graphs] OK: overlays [] == empty
  24123. 1305.10 s [algebraic-graphs] OK: overlays [x] == x
  24124. 1305.10 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24125. 1305.10 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24126. 1305.10 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24127. 1305.10 s [algebraic-graphs]
  24128. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  24129. 1305.10 s [algebraic-graphs] OK: connects [] == empty
  24130. 1305.10 s [algebraic-graphs] OK: connects [x] == x
  24131. 1305.10 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24132. 1305.10 s [algebraic-graphs] OK: connects == foldr connect empty
  24133. 1305.10 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24134. 1305.10 s [algebraic-graphs] OK: connects == connects . reverse
  24135. 1305.10 s [algebraic-graphs]
  24136. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  24137. 1305.10 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24138. 1305.10 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24139. 1305.10 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24140. 1305.10 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24141. 1305.10 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24142. 1305.10 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24143. 1305.10 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24144. 1305.10 s [algebraic-graphs]
  24145. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.path ============
  24146. 1305.10 s [algebraic-graphs] OK: path [] == empty
  24147. 1305.10 s [algebraic-graphs] OK: path [x] == vertex x
  24148. 1305.10 s [algebraic-graphs] OK: path [x,y] == edge x y
  24149. 1305.10 s [algebraic-graphs] OK: path == path . reverse
  24150. 1305.10 s [algebraic-graphs]
  24151. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  24152. 1305.10 s [algebraic-graphs] OK: circuit [] == empty
  24153. 1305.10 s [algebraic-graphs] OK: circuit [x] == edge x x
  24154. 1305.10 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24155. 1305.10 s [algebraic-graphs] OK: circuit == circuit . reverse
  24156. 1305.10 s [algebraic-graphs]
  24157. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  24158. 1305.10 s [algebraic-graphs] OK: clique [] == empty
  24159. 1305.10 s [algebraic-graphs] OK: clique [x] == vertex x
  24160. 1305.10 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24161. 1305.10 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24162. 1305.10 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24163. 1305.10 s [algebraic-graphs] OK: clique == clique . reverse
  24164. 1305.10 s [algebraic-graphs]
  24165. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  24166. 1305.10 s [algebraic-graphs] OK: biclique [] [] == empty
  24167. 1305.10 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24168. 1305.10 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24169. 1305.10 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24170. 1305.10 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24171. 1305.10 s [algebraic-graphs]
  24172. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.star ============
  24173. 1305.10 s [algebraic-graphs] OK: star x [] == vertex x
  24174. 1305.10 s [algebraic-graphs] OK: star x [y] == edge x y
  24175. 1305.10 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24176. 1305.10 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24177. 1305.10 s [algebraic-graphs]
  24178. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  24179. 1305.10 s [algebraic-graphs] OK: stars [] == empty
  24180. 1305.10 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24181. 1305.10 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24182. 1305.10 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24183. 1305.10 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24184. 1305.10 s [algebraic-graphs] OK: stars . adjacencyList == id
  24185. 1305.10 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24186. 1305.10 s [algebraic-graphs]
  24187. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  24188. 1305.10 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24189. 1305.10 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24190. 1305.10 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24191. 1305.10 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24192. 1305.10 s [algebraic-graphs]
  24193. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  24194. 1305.10 s [algebraic-graphs] OK: forest [] == empty
  24195. 1305.10 s [algebraic-graphs] OK: forest [x] == tree x
  24196. 1305.10 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24197. 1305.10 s [algebraic-graphs] OK: forest == overlays . map tree
  24198. 1305.10 s [algebraic-graphs]
  24199. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24200. 1305.10 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24201. 1305.10 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24202. 1305.10 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24203. 1305.10 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24204. 1305.10 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24205. 1305.10 s [algebraic-graphs]
  24206. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24207. 1305.10 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24208. 1305.10 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24209. 1305.10 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24210. 1305.10 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24211. 1305.10 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24212. 1305.10 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24213. 1305.10 s [algebraic-graphs]
  24214. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24215. 1305.10 s [algebraic-graphs] OK: replaceVertex x x == id
  24216. 1305.10 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24217. 1305.10 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24218. 1305.10 s [algebraic-graphs]
  24219. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24220. 1305.10 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24221. 1305.10 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24222. 1305.10 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24223. 1305.10 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24224. 1305.10 s [algebraic-graphs]
  24225. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24226. 1305.10 s [algebraic-graphs] OK: gmap f empty == empty
  24227. 1305.10 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24228. 1305.10 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24229. 1305.10 s [algebraic-graphs] OK: gmap id == id
  24230. 1305.10 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24231. 1305.10 s [algebraic-graphs]
  24232. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24233. 1305.10 s [algebraic-graphs] OK: induce (const True ) x == x
  24234. 1305.10 s [algebraic-graphs] OK: induce (const False) x == empty
  24235. 1305.10 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24236. 1305.10 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24237. 1305.10 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24238. 1305.10 s [algebraic-graphs]
  24239. 1305.10 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24240. 1305.10 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24241. 1305.10 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24242. 1305.10 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24243. 1305.10 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24244. 1305.10 s [algebraic-graphs] Test suite main: PASS
  24245. 1305.10 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24246. 1305.10 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24247. 1305.10 s [algebraic-graphs] checkPhase completed in 1 minutes 35 seconds
  24248. 1305.10 s [algebraic-graphs] Phase: haddockPhase
  24249. 1305.16 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  24250. 1305.17 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  24251. 1305.28 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  24252. 1305.48 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  24253. 1305.53 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  24254. 1305.61 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  24255. 1305.64 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  24256. 1305.74 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  24257. 1305.77 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  24258. 1305.89 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  24259. 1305.95 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  24260. 1306.11 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  24261. 1306.15 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  24262. 1306.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  24263. 1306.22 s [algebraic-graphs] In the use of ‘head’
  24264. 1306.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24265. 1306.22 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"."
  24266. 1306.22 s [algebraic-graphs] |
  24267. 1306.22 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  24268. 1306.22 s [algebraic-graphs] | ^^^^
  24269. 1306.22 s [algebraic-graphs]
  24270. 1306.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  24271. 1306.22 s [algebraic-graphs] In the use of ‘tail’
  24272. 1306.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24273. 1306.22 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"."
  24274. 1306.22 s [algebraic-graphs] |
  24275. 1306.22 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  24276. 1306.22 s [algebraic-graphs] | ^^^^
  24277. 1306.22 s [algebraic-graphs]
  24278. 1306.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  24279. 1306.22 s [algebraic-graphs] In the use of ‘head’
  24280. 1306.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24281. 1306.22 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"."
  24282. 1306.22 s [algebraic-graphs] |
  24283. 1306.22 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  24284. 1306.22 s [algebraic-graphs] | ^^^^
  24285. 1306.22 s [algebraic-graphs]
  24286. 1306.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  24287. 1306.22 s [algebraic-graphs] In the use of ‘tail’
  24288. 1306.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24289. 1306.22 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"."
  24290. 1306.22 s [algebraic-graphs] |
  24291. 1306.22 s [algebraic-graphs] 397 | bnd' = tail bnd
  24292. 1306.22 s [algebraic-graphs] | ^^^^
  24293. 1306.22 s [algebraic-graphs]
  24294. 1306.22 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  24295. 1306.25 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  24296. 1306.35 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24297. 1306.35 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24298. 1306.35 s [algebraic-graphs] will become an error in a future GHC release.
  24299. 1306.35 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24300. 1306.35 s [algebraic-graphs] |
  24301. 1306.35 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24302. 1306.35 s [algebraic-graphs] | ^
  24303. 1306.35 s [algebraic-graphs]
  24304. 1306.35 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24305. 1306.35 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24306. 1306.35 s [algebraic-graphs] will become an error in a future GHC release.
  24307. 1306.35 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24308. 1306.35 s [algebraic-graphs] |
  24309. 1306.35 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24310. 1306.35 s [algebraic-graphs] | ^
  24311. 1306.35 s [algebraic-graphs]
  24312. 1306.35 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24313. 1306.35 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24314. 1306.35 s [algebraic-graphs] will become an error in a future GHC release.
  24315. 1306.35 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24316. 1306.35 s [algebraic-graphs] |
  24317. 1306.35 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24318. 1306.35 s [algebraic-graphs] | ^
  24319. 1306.35 s [algebraic-graphs]
  24320. 1306.35 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24321. 1306.35 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24322. 1306.35 s [algebraic-graphs] will become an error in a future GHC release.
  24323. 1306.35 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24324. 1306.35 s [algebraic-graphs] |
  24325. 1306.36 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24326. 1306.36 s [algebraic-graphs] | ^
  24327. 1306.36 s [algebraic-graphs]
  24328. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24329. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24330. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  24331. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24332. 1306.36 s [algebraic-graphs] |
  24333. 1306.36 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24334. 1306.36 s [algebraic-graphs] | ^
  24335. 1306.36 s [algebraic-graphs]
  24336. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24337. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24338. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  24339. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24340. 1306.36 s [algebraic-graphs] |
  24341. 1306.36 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24342. 1306.36 s [algebraic-graphs] | ^
  24343. 1306.36 s [algebraic-graphs]
  24344. 1306.36 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24345. 1306.36 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24346. 1306.36 s [algebraic-graphs] will become an error in a future GHC release.
  24347. 1306.36 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24348. 1306.36 s [algebraic-graphs] |
  24349. 1306.36 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24350. 1306.36 s [algebraic-graphs] | ^
  24351. 1306.36 s [algebraic-graphs]
  24352. 1306.36 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  24353. 1306.42 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  24354. 1306.46 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  24355. 1306.59 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  24356. 1306.67 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  24357. 1306.73 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  24358. 1306.74 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  24359. 1306.75 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  24360. 1306.77 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24361. 1306.77 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24362. 1306.77 s [algebraic-graphs] will become an error in a future GHC release.
  24363. 1306.77 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24364. 1306.77 s [algebraic-graphs] |
  24365. 1306.77 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24366. 1306.77 s [algebraic-graphs] | ^
  24367. 1306.77 s [algebraic-graphs]
  24368. 1306.77 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  24369. 1306.78 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24370. 1306.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24371. 1306.78 s [algebraic-graphs] will become an error in a future GHC release.
  24372. 1306.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24373. 1306.78 s [algebraic-graphs] |
  24374. 1306.78 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24375. 1306.78 s [algebraic-graphs] | ^
  24376. 1306.78 s [algebraic-graphs]
  24377. 1306.78 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24378. 1306.78 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24379. 1306.78 s [algebraic-graphs] will become an error in a future GHC release.
  24380. 1306.78 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24381. 1306.78 s [algebraic-graphs] |
  24382. 1306.78 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24383. 1306.78 s [algebraic-graphs] | ^
  24384. 1306.78 s [algebraic-graphs]
  24385. 1306.78 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  24386. 1306.88 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  24387. 1306.91 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  24388. 1306.92 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  24389. 1306.93 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  24390. 1306.94 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  24391. 1306.95 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  24392. 1306.96 s [algebraic-graphs] Haddock coverage:
  24393. 1306.97 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24394. 1306.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24395. 1306.97 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24396. 1306.97 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24397. 1306.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24398. 1306.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24399. 1306.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24400. 1306.98 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24401. 1306.99 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24402. 1306.99 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24403. 1306.99 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  24404. 1306.99 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  24405. 1306.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24406. 1306.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24407. 1306.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24408. 1307.00 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24409. 1307.01 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24410. 1307.01 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24411. 1307.01 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24412. 1307.01 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24413. 1307.01 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24414. 1307.01 s [algebraic-graphs] Missing documentation for:
  24415. 1307.01 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24416. 1307.01 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  24417. 1307.01 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  24418. 1307.01 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  24419. 1307.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24420. 1307.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24421. 1307.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  24422. 1307.01 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24423. 1307.01 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24424. 1307.01 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24425. 1307.01 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24426. 1307.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  24427. 1307.01 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  24428. 1307.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24429. 1307.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24430. 1307.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  24431. 1307.02 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24432. 1307.02 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24433. 1307.02 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24434. 1307.02 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24435. 1307.02 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24436. 1307.02 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  24437. 1307.03 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24438. 1307.04 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24439. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24440. 1307.04 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24441. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24442. 1307.04 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24443. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24444. 1307.04 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24445. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24446. 1307.04 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24447. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24448. 1307.04 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24449. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24450. 1307.04 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24451. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24452. 1307.04 s [algebraic-graphs] Warning: 'box' is out of scope.
  24453. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24454. 1307.04 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24455. 1307.04 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24456. 1307.05 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24457. 1307.05 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24458. 1307.05 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24459. 1307.05 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24460. 1307.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24461. 1307.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24462. 1307.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24463. 1307.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24464. 1307.05 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24465. 1307.05 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24466. 1307.06 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  24467. 1307.06 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24468. 1307.06 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  24469. 1307.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24470. 1307.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24471. 1307.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24472. 1307.06 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24473. 1307.07 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24474. 1307.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24475. 1307.07 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  24476. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  24477. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24478. 1307.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24479. 1307.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24480. 1307.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24481. 1307.07 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24482. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24483. 1307.07 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24484. 1307.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24485. 1307.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24486. 1307.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24487. 1307.07 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24488. 1307.07 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  24489. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  24490. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  24491. 1307.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24492. 1307.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24493. 1307.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  24494. 1307.07 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  24495. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  24496. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  24497. 1307.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24498. 1307.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24499. 1307.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  24500. 1307.07 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  24501. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  24502. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  24503. 1307.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24504. 1307.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24505. 1307.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  24506. 1307.07 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  24507. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  24508. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  24509. 1307.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24510. 1307.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24511. 1307.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  24512. 1307.07 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  24513. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  24514. 1307.07 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  24515. 1307.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24516. 1307.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24517. 1307.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  24518. 1307.08 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24519. 1307.08 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  24520. 1307.08 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  24521. 1307.08 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24522. 1307.08 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24523. 1307.08 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24524. 1307.08 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24525. 1307.08 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24526. 1307.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24527. 1307.08 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24528. 1307.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24529. 1307.08 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24530. 1307.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24531. 1307.08 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24532. 1307.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24533. 1307.09 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24534. 1307.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24535. 1307.09 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24536. 1307.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24537. 1307.09 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24538. 1307.10 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24539. 1307.10 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24540. 1307.10 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24541. 1307.10 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24542. 1307.10 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24543. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24544. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24545. 1307.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24546. 1307.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24547. 1307.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24548. 1307.10 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24549. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  24550. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24551. 1307.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24552. 1307.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24553. 1307.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24554. 1307.10 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24555. 1307.10 s [algebraic-graphs] Missing documentation for:
  24556. 1307.10 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24557. 1307.10 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24558. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24559. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24560. 1307.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24561. 1307.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24562. 1307.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24563. 1307.10 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24564. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  24565. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24566. 1307.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24567. 1307.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24568. 1307.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24569. 1307.10 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24570. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  24571. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24572. 1307.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24573. 1307.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24574. 1307.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24575. 1307.10 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24576. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  24577. 1307.10 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24578. 1307.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24579. 1307.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24580. 1307.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24581. 1307.11 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24582. 1307.11 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  24583. 1307.11 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24584. 1307.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24585. 1307.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24586. 1307.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24587. 1307.11 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24588. 1307.11 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  24589. 1307.11 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  24590. 1307.11 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  24591. 1307.11 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24592. 1307.11 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24593. 1307.11 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  24594. 1307.12 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24595. 1307.12 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  24596. 1307.12 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  24597. 1307.12 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  24598. 1307.12 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24599. 1307.12 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24600. 1307.12 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  24601. 1307.12 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24602. 1307.13 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24603. 1307.13 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24604. 1307.13 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24605. 1307.13 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24606. 1307.13 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24607. 1307.13 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24608. 1307.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24609. 1307.13 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24610. 1307.14 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24611. 1307.14 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  24612. 1307.14 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24613. 1307.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24614. 1307.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24615. 1307.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24616. 1307.14 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24617. 1307.14 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  24618. 1307.14 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24619. 1307.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24620. 1307.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24621. 1307.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24622. 1307.14 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24623. 1307.14 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24624. 1307.14 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24625. 1307.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24626. 1307.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24627. 1307.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24628. 1307.15 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24629. 1307.16 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24630. 1307.16 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24631. 1307.17 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24632. 1307.17 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24633. 1307.17 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24634. 1307.17 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24635. 1307.17 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24636. 1307.17 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24637. 1307.17 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24638. 1307.17 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  24639. 1307.17 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  24640. 1307.17 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24641. 1307.17 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24642. 1307.17 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24643. 1307.17 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24644. 1307.18 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24645. 1307.18 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24646. 1307.18 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  24647. 1307.18 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  24648. 1307.18 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24649. 1307.18 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24650. 1307.18 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  24651. 1307.18 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24652. 1307.18 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  24653. 1307.18 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24654. 1307.18 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24655. 1307.18 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24656. 1307.18 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  24657. 1307.19 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  24658. 1307.19 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  24659. 1307.19 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  24660. 1307.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24661. 1307.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24662. 1307.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  24663. 1307.19 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24664. 1307.19 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24665. 1307.19 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24666. 1307.20 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  24667. 1307.20 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  24668. 1307.20 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  24669. 1307.20 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24670. 1307.20 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24671. 1307.20 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  24672. 1307.20 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24673. 1307.20 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  24674. 1307.20 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  24675. 1307.20 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  24676. 1307.20 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24677. 1307.20 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24678. 1307.20 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  24679. 1307.20 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24680. 1307.20 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24681. 1307.20 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24682. 1307.27 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24683. 1307.27 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24684. 1307.27 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24685. 1307.27 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24686. 1307.27 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24687. 1307.27 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24688. 1307.27 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24689. 1307.28 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24690. 1307.28 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  24691. 1307.28 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  24692. 1307.28 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24693. 1307.28 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24694. 1307.28 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24695. 1307.28 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24696. 1307.28 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24697. 1307.28 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24698. 1307.28 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24699. 1307.28 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  24700. 1307.28 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  24701. 1307.28 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24702. 1307.28 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24703. 1307.28 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24704. 1307.28 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24705. 1307.28 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24706. 1307.28 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24707. 1307.28 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24708. 1307.28 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  24709. 1307.28 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  24710. 1307.28 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24711. 1307.28 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24712. 1307.28 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24713. 1307.28 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24714. 1307.28 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24715. 1307.28 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24716. 1307.28 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24717. 1307.28 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24718. 1307.28 s [algebraic-graphs] Missing documentation for:
  24719. 1307.28 s [algebraic-graphs] Module header
  24720. 1307.28 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24721. 1307.28 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  24722. 1307.28 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  24723. 1307.28 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  24724. 1307.28 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  24725. 1307.28 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  24726. 1307.28 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  24727. 1307.28 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  24728. 1307.28 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  24729. 1307.28 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  24730. 1307.28 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24731. 1307.28 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24732. 1307.28 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  24733. 1307.28 s [algebraic-graphs] Warning: 'array' is out of scope.
  24734. 1307.28 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24735. 1307.29 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24736. 1307.29 s [algebraic-graphs] Missing documentation for:
  24737. 1307.29 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  24738. 1307.41 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  24739. 1307.41 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  24740. 1307.41 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24741. 1307.41 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24742. 1307.41 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  24743. 1307.41 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  24744. 1307.41 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24745. 1307.41 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24746. 1307.42 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  24747. 1307.42 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  24748. 1307.42 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  24749. 1307.42 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  24750. 1307.42 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24751. 1307.42 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24752. 1307.43 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  24753. 1307.43 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  24754. 1307.43 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  24755. 1307.43 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  24756. 1307.43 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  24757. 1307.43 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  24758. 1307.44 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  24759. 1307.44 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  24760. 1307.44 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  24761. 1307.44 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  24762. 1307.44 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  24763. 1307.44 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24764. 1307.45 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  24765. 1307.45 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24766. 1307.45 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24767. 1307.45 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24768. 1307.45 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24769. 1307.45 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24770. 1307.45 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24771. 1307.45 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24772. 1307.45 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24773. 1307.45 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24774. 1307.45 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  24775. 1307.45 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24776. 1307.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24777. 1307.46 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  24778. 1307.46 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24779. 1307.46 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24780. 1307.46 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  24781. 1307.46 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24782. 1307.46 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  24783. 1307.46 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24784. 1307.46 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  24785. 1307.46 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24786. 1307.47 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24787. 1307.47 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24788. 1307.47 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  24789. 1307.47 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24790. 1307.47 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  24791. 1307.47 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  24792. 1307.47 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24793. 1307.48 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  24794. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  24795. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  24796. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  24797. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  24798. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  24799. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24800. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24801. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24802. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24803. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24804. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24805. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24806. 1307.48 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24807. 1307.48 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24808. 1307.48 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24809. 1307.48 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24810. 1307.48 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24811. 1307.48 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  24812. 1307.48 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24813. 1307.48 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  24814. 1307.48 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24815. 1307.48 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  24816. 1307.48 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24817. 1307.48 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  24818. 1307.48 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24819. 1311.55 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  24820. 1311.71 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24821. 1311.71 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  24822. 1311.71 s [algebraic-graphs] Phase: installPhase
  24823. 1311.71 s [algebraic-graphs] Installing library in /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/algebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y
  24824. 1312.24 s [algebraic-graphs] Phase: fixupPhase
  24825. 1312.25 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7
  24826. 1312.27 s [algebraic-graphs] shrinking /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-2a2a/libHSalgebraic-graphs-0.7-2cnKxGDkN2wAK5xC8AtO3Y-ghc9.10.2.so
  24827. 1312.27 s [algebraic-graphs] checking for references to /build/ in /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7...
  24828. 1312.31 s [algebraic-graphs] patching script interpreter paths in /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7
  24829. 1312.31 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/lib
  24830. 1312.56 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc
  24831. 1312.58 s [algebraic-graphs] checking for references to /build/ in /nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc...
  24832. 1312.61 s [algebraic-graphs] patching script interpreter paths in /nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc
  24833. 1312.75 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7
  24834. 1313.28 s [algebraic-graphs:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  24835. 1313.28 s [algebraic-graphs:post-build]
  24836. 1313.64 s [algebraic-graphs:post-build] Pushing /nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc (10.41 MiB)
  24837. 1313.81 s [algebraic-graphs:post-build] Pushing /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7 (25.12 MiB)
  24838. 1315.02 s [algebraic-graphs:post-build]
  24839. 1315.02 s [algebraic-graphs:post-build] All done.
  24840. 1315.04 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7
  24841. 1315.08 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24842. 1315.09 s [algebraic-graphs:post-build] copying 2 paths...
  24843. 1315.09 s [algebraic-graphs:post-build] copying path '/nix/store/fi02f57m63sblrbp3bdby0bsch31gbxw-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24844. 1316.26 s [algebraic-graphs:post-build] copying path '/nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24845. 1321.80 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24846. 1322.08 s [algebraic-graphs:post-build] copying 1 paths...
  24847. 1322.12 s [algebraic-graphs:post-build] copying path '/nix/store/vzy7xgpawcp3jbxm62ay0hj20a915lj3-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  24848. 1322.32 s Progress: 36 of 40 built, 760 of 760 downloaded from cache
  24849. 1322.38 s Building /nix/store/7nxkmgxi1csw6vfqpvkm09wikn5r0pnh-ghc-9.10.2-with-packages.drv
  24850. 1322.43 s [ghc-9.10.2-with-packages] /nix/store/232s66j2s7bd7k2arsdzgsd4sa6m2mgw-doctest-0.24.2/nix-support:
  24851. 1322.44 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24852. 1322.44 s [ghc-9.10.2-with-packages] /nix/store/ryx95p02ix6ip1bjl2xmxi3989ii9ab2-ghc-compat-plugin-0.1.0.1/nix-support:
  24853. 1322.44 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24854. 1322.45 s [ghc-9.10.2-with-packages] /nix/store/3rc2jpr9b9ilwznszmkp8arlxdhs30sl-hedgehog-1.5/nix-support:
  24855. 1322.45 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24856. 1322.46 s [ghc-9.10.2-with-packages] /nix/store/hqc5jfvfhnpsdxl4308jphqzh5qc9igw-Cabal-3.12.1.0/nix-support:
  24857. 1322.46 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24858. 1322.49 s [ghc-9.10.2-with-packages] /nix/store/9w1cf8v0r6zwkkfaa4fqhj4p3hypm9vr-cabal-doctest-1.0.12/nix-support:
  24859. 1322.49 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24860. 1322.51 s [ghc-9.10.2-with-packages] /nix/store/l84w056b9ban397xn1ncc7qj8w2xipxs-temporary-1.3/nix-support:
  24861. 1322.51 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24862. 1322.51 s [ghc-9.10.2-with-packages] /nix/store/l84w056b9ban397xn1ncc7qj8w2xipxs-temporary-1.3/nix-support:
  24863. 1322.51 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24864. 1322.51 s [ghc-9.10.2-with-packages] /nix/store/nwv95v1nif7x1lckzapi83m2k980k1ij-ansi-terminal-1.1.3/nix-support:
  24865. 1322.51 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24866. 1322.52 s [ghc-9.10.2-with-packages] /nix/store/nwv95v1nif7x1lckzapi83m2k980k1ij-ansi-terminal-1.1.3/nix-support:
  24867. 1322.52 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24868. 1322.52 s [ghc-9.10.2-with-packages] /nix/store/29aflj1wdp5gcjhwfb16zmwdwzibcn2d-async-2.2.5/nix-support:
  24869. 1322.52 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24870. 1322.52 s [ghc-9.10.2-with-packages] /nix/store/29aflj1wdp5gcjhwfb16zmwdwzibcn2d-async-2.2.5/nix-support:
  24871. 1322.52 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24872. 1322.52 s [ghc-9.10.2-with-packages] /nix/store/0vbbwha84m80hay0dbi4zfwq9mjsc2y4-barbies-2.1.1.0/nix-support:
  24873. 1322.52 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24874. 1322.52 s [ghc-9.10.2-with-packages] /nix/store/0vbbwha84m80hay0dbi4zfwq9mjsc2y4-barbies-2.1.1.0/nix-support:
  24875. 1322.52 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24876. 1322.53 s [ghc-9.10.2-with-packages] /nix/store/77mgc4n83gmj8x7lh3nxii9w4igr7dm6-concurrent-output-1.10.21/nix-support:
  24877. 1322.53 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24878. 1322.53 s [ghc-9.10.2-with-packages] /nix/store/77mgc4n83gmj8x7lh3nxii9w4igr7dm6-concurrent-output-1.10.21/nix-support:
  24879. 1322.53 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24880. 1322.53 s [ghc-9.10.2-with-packages] /nix/store/cg8an3npdl5agqicyir711dgrljbwg73-lifted-async-0.10.2.7/nix-support:
  24881. 1322.53 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24882. 1322.53 s [ghc-9.10.2-with-packages] /nix/store/cg8an3npdl5agqicyir711dgrljbwg73-lifted-async-0.10.2.7/nix-support:
  24883. 1322.53 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24884. 1322.54 s [ghc-9.10.2-with-packages] /nix/store/kddghhigy5m7086mb4gxcyvy20qq18r7-mmorph-1.2.1/nix-support:
  24885. 1322.54 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24886. 1322.54 s [ghc-9.10.2-with-packages] /nix/store/kddghhigy5m7086mb4gxcyvy20qq18r7-mmorph-1.2.1/nix-support:
  24887. 1322.54 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24888. 1322.54 s [ghc-9.10.2-with-packages] /nix/store/xxbxbxdb8li2n14y9j23fnds42y4lk47-monad-control-1.0.3.1/nix-support:
  24889. 1322.54 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24890. 1322.54 s [ghc-9.10.2-with-packages] /nix/store/xxbxbxdb8li2n14y9j23fnds42y4lk47-monad-control-1.0.3.1/nix-support:
  24891. 1322.54 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24892. 1322.54 s [ghc-9.10.2-with-packages] /nix/store/0dzp8kzymmp2yrmxwyiq34h9df8r1b2s-pretty-show-1.10/nix-support:
  24893. 1322.54 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24894. 1322.54 s [ghc-9.10.2-with-packages] /nix/store/0dzp8kzymmp2yrmxwyiq34h9df8r1b2s-pretty-show-1.10/nix-support:
  24895. 1322.54 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24896. 1322.54 s [ghc-9.10.2-with-packages] /nix/store/xj37z083slbwgls55s5mi78ps4sfw87z-primitive-0.9.1.0/nix-support:
  24897. 1322.55 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24898. 1322.55 s [ghc-9.10.2-with-packages] /nix/store/xj37z083slbwgls55s5mi78ps4sfw87z-primitive-0.9.1.0/nix-support:
  24899. 1322.55 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24900. 1322.55 s [ghc-9.10.2-with-packages] /nix/store/ak54mv7nbq0yqk4y8dbjn209lf3hbxcg-random-1.2.1.3/nix-support:
  24901. 1322.55 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24902. 1322.55 s [ghc-9.10.2-with-packages] /nix/store/ak54mv7nbq0yqk4y8dbjn209lf3hbxcg-random-1.2.1.3/nix-support:
  24903. 1322.55 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24904. 1322.55 s [ghc-9.10.2-with-packages] /nix/store/3yy3n64m7881m8jgbr9pdrqpk6jbyi4y-resourcet-1.3.0/nix-support:
  24905. 1322.55 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24906. 1322.55 s [ghc-9.10.2-with-packages] /nix/store/3yy3n64m7881m8jgbr9pdrqpk6jbyi4y-resourcet-1.3.0/nix-support:
  24907. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24908. 1322.56 s [ghc-9.10.2-with-packages] /nix/store/pcmsk19l80qn2qxgn2jdika662ilgkjp-safe-exceptions-0.1.7.4/nix-support:
  24909. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24910. 1322.56 s [ghc-9.10.2-with-packages] /nix/store/pcmsk19l80qn2qxgn2jdika662ilgkjp-safe-exceptions-0.1.7.4/nix-support:
  24911. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24912. 1322.56 s [ghc-9.10.2-with-packages] /nix/store/wxs4wb059ihrh7vvfh9n2qw7a8nji717-transformers-base-0.4.6/nix-support:
  24913. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24914. 1322.56 s [ghc-9.10.2-with-packages] /nix/store/wxs4wb059ihrh7vvfh9n2qw7a8nji717-transformers-base-0.4.6/nix-support:
  24915. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24916. 1322.56 s [ghc-9.10.2-with-packages] /nix/store/6nc1n6zf80kf6q9k1n3afvwlj9sm63ij-wl-pprint-annotated-0.1.0.1/nix-support:
  24917. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24918. 1322.56 s [ghc-9.10.2-with-packages] /nix/store/6nc1n6zf80kf6q9k1n3afvwlj9sm63ij-wl-pprint-annotated-0.1.0.1/nix-support:
  24919. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24920. 1322.56 s [ghc-9.10.2-with-packages] /nix/store/k4qrcbnb573mjfa407qqfw3dbmgakrx0-Cabal-syntax-3.12.1.0/nix-support:
  24921. 1322.56 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24922. 1322.58 s [ghc-9.10.2-with-packages] /nix/store/k4qrcbnb573mjfa407qqfw3dbmgakrx0-Cabal-syntax-3.12.1.0/nix-support:
  24923. 1322.58 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24924. 1322.59 s [ghc-9.10.2-with-packages] /nix/store/mxqrrdfam0hvcszfxb53jd0n8bgh7cmm-ansi-terminal-types-1.1.3/nix-support:
  24925. 1322.59 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24926. 1322.59 s [ghc-9.10.2-with-packages] /nix/store/mxqrrdfam0hvcszfxb53jd0n8bgh7cmm-ansi-terminal-types-1.1.3/nix-support:
  24927. 1322.59 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24928. 1322.60 s [ghc-9.10.2-with-packages] /nix/store/2nj2xri6lv2rxhmsmfh3lfrlvmlgkss6-hashable-1.5.0.0/nix-support:
  24929. 1322.60 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24930. 1322.60 s [ghc-9.10.2-with-packages] /nix/store/2nj2xri6lv2rxhmsmfh3lfrlvmlgkss6-hashable-1.5.0.0/nix-support:
  24931. 1322.60 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24932. 1322.60 s [ghc-9.10.2-with-packages] /nix/store/rmqkhdi6g0wcw3q26kc76iipzkrihyc8-distributive-0.6.2.1/nix-support:
  24933. 1322.60 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24934. 1322.60 s [ghc-9.10.2-with-packages] /nix/store/rmqkhdi6g0wcw3q26kc76iipzkrihyc8-distributive-0.6.2.1/nix-support:
  24935. 1322.60 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24936. 1322.61 s [ghc-9.10.2-with-packages] /nix/store/7bvjbbbp33z63jxabs6gwa912yzi0gca-constraints-0.14.2/nix-support:
  24937. 1322.61 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24938. 1322.61 s [ghc-9.10.2-with-packages] /nix/store/7bvjbbbp33z63jxabs6gwa912yzi0gca-constraints-0.14.2/nix-support:
  24939. 1322.61 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24940. 1322.61 s [ghc-9.10.2-with-packages] /nix/store/6w3n182isbk127fip51i5bx2q0zrdlhg-lifted-base-0.2.3.12/nix-support:
  24941. 1322.61 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24942. 1322.61 s [ghc-9.10.2-with-packages] /nix/store/6w3n182isbk127fip51i5bx2q0zrdlhg-lifted-base-0.2.3.12/nix-support:
  24943. 1322.61 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24944. 1322.62 s [ghc-9.10.2-with-packages] /nix/store/0c3lnk6fsdwlky55d37hlnswg64jv2jq-transformers-compat-0.7.2/nix-support:
  24945. 1322.62 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24946. 1322.62 s [ghc-9.10.2-with-packages] /nix/store/0c3lnk6fsdwlky55d37hlnswg64jv2jq-transformers-compat-0.7.2/nix-support:
  24947. 1322.62 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24948. 1322.62 s [ghc-9.10.2-with-packages] /nix/store/8ffzz1bjhi9ig191pzx0qjyhaq10i0py-splitmix-0.1.3.1/nix-support:
  24949. 1322.62 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24950. 1322.62 s [ghc-9.10.2-with-packages] /nix/store/8ffzz1bjhi9ig191pzx0qjyhaq10i0py-splitmix-0.1.3.1/nix-support:
  24951. 1322.62 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24952. 1322.63 s [ghc-9.10.2-with-packages] /nix/store/6s9z5l4ypcbr82x2nla29kcccynh3sra-unliftio-core-0.2.1.0/nix-support:
  24953. 1322.63 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24954. 1322.63 s [ghc-9.10.2-with-packages] /nix/store/6s9z5l4ypcbr82x2nla29kcccynh3sra-unliftio-core-0.2.1.0/nix-support:
  24955. 1322.63 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24956. 1322.63 s [ghc-9.10.2-with-packages] /nix/store/9k0nr8mx63vhmr0rvhhd6p43ny1qlq9s-base-orphans-0.9.3/nix-support:
  24957. 1322.63 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24958. 1322.63 s [ghc-9.10.2-with-packages] /nix/store/9k0nr8mx63vhmr0rvhhd6p43ny1qlq9s-base-orphans-0.9.3/nix-support:
  24959. 1322.63 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24960. 1322.63 s [ghc-9.10.2-with-packages] /nix/store/gsmqw739c587snr9nch2fpncys3x2v08-tagged-0.8.9/nix-support:
  24961. 1322.63 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24962. 1322.63 s [ghc-9.10.2-with-packages] /nix/store/gsmqw739c587snr9nch2fpncys3x2v08-tagged-0.8.9/nix-support:
  24963. 1322.63 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24964. 1322.63 s [ghc-9.10.2-with-packages] /nix/store/g1av89s12lbcaxmw49xahr0aml348hdk-boring-0.2.2/nix-support:
  24965. 1322.63 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24966. 1322.64 s [ghc-9.10.2-with-packages] /nix/store/g1av89s12lbcaxmw49xahr0aml348hdk-boring-0.2.2/nix-support:
  24967. 1322.64 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/js8lkrdzpjhgs01raawx30idcikkp86x-algebraic-graphs-0.7/nix-support/propagated-build-inputs
  24968. 1323.33 s [ghc-9.10.2-with-packages] Warning: include-dirs: /nix/store/xy3v6qa0326bgwv290pafrdp9fsr02pl-ghc-9.10.2-with-packages/lib/ghc-9.10.2/lib/../lib/x86_64-linux-ghc-9.10.2/directory-1.3.8.5-159c/include doesn't exist or isn't a directory
  24969. 1324.48 s [ghc-9.10.2-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/xy3v6qa0326bgwv290pafrdp9fsr02pl-ghc-9.10.2-with-packages
  24970. 1324.95 s [ghc-9.10.2-with-packages:post-build] Pushing 1 paths (152 are already present) using zstd to cache sellout ⏳
  24971. 1324.95 s [ghc-9.10.2-with-packages:post-build]
  24972. 1325.31 s [ghc-9.10.2-with-packages:post-build] Pushing /nix/store/xy3v6qa0326bgwv290pafrdp9fsr02pl-ghc-9.10.2-with-packages (5.54 MiB)
  24973. 1327.25 s [ghc-9.10.2-with-packages:post-build]
  24974. 1327.33 s [ghc-9.10.2-with-packages:post-build] All done.
  24975. 1327.33 s [ghc-9.10.2-with-packages:post-build] Uploading to the NixCI cache: /nix/store/xy3v6qa0326bgwv290pafrdp9fsr02pl-ghc-9.10.2-with-packages
  24976. 1327.33 s [ghc-9.10.2-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24977. 1327.55 s [ghc-9.10.2-with-packages:post-build] copying 1 paths...
  24978. 1327.55 s [ghc-9.10.2-with-packages:post-build] copying path '/nix/store/xy3v6qa0326bgwv290pafrdp9fsr02pl-ghc-9.10.2-with-packages' to 'https://cache.nix-ci.com'...
  24979. 1328.79 s [ghc-9.10.2-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24980. 1329.03 s [ghc-9.10.2-with-packages:post-build] copying 1 paths...
  24981. 1329.03 s [ghc-9.10.2-with-packages:post-build] copying path '/nix/store/7nxkmgxi1csw6vfqpvkm09wikn5r0pnh-ghc-9.10.2-with-packages.drv' to 'https://cache.nix-ci.com'...
  24982. 1329.27 s Progress: 37 of 39 built, 760 of 760 downloaded from cache
  24983. 1329.37 s Building /nix/store/sqr2s21ysb2fw5ca37hfa7syp7a6g9dr-ghc-shell-for-packages-0.drv
  24984. 1330.22 s [ghc-shell-for-packages:post-build] Uploading to cachix cache "sellout": /nix/store/l8zfjcrz6p6z4cbrpyj3ry4iqigx0asi-ghc-shell-for-packages-0
  24985. 1330.87 s [ghc-shell-for-packages:post-build] Pushing 1 paths (795 are already present) using zstd to cache sellout ⏳
  24986. 1330.87 s [ghc-shell-for-packages:post-build]
  24987. 1331.25 s [ghc-shell-for-packages:post-build] Pushing /nix/store/l8zfjcrz6p6z4cbrpyj3ry4iqigx0asi-ghc-shell-for-packages-0 (336.00 B)
  24988. 1332.52 s [ghc-shell-for-packages:post-build]
  24989. 1332.56 s [ghc-shell-for-packages:post-build] All done.
  24990. 1332.56 s [ghc-shell-for-packages:post-build] Uploading to the NixCI cache: /nix/store/l8zfjcrz6p6z4cbrpyj3ry4iqigx0asi-ghc-shell-for-packages-0
  24991. 1332.58 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1332.64 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24993. 1332.64 s [ghc-shell-for-packages:post-build] copying path '/nix/store/l8zfjcrz6p6z4cbrpyj3ry4iqigx0asi-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
  24994. 1333.00 s [ghc-shell-for-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1333.71 s [ghc-shell-for-packages:post-build] copying 1 paths...
  24996. 1333.71 s [ghc-shell-for-packages:post-build] copying path '/nix/store/sqr2s21ysb2fw5ca37hfa7syp7a6g9dr-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
  24997. 1333.94 s Progress: 38 of 39 built, 760 of 760 downloaded from cache
  24998. 1333.95 s Progress: 39 of 39 built, 760 of 760 downloaded from cache
  24999. 1333.95 s /nix/store/l8zfjcrz6p6z4cbrpyj3ry4iqigx0asi-ghc-shell-for-packages-0
  25000. 1334.02 s Build succeeded.
Tail Raw Logs